java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+cfa-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 12:32:02,762 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 12:32:02,764 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 12:32:02,776 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 12:32:02,776 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 12:32:02,777 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 12:32:02,779 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 12:32:02,780 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 12:32:02,782 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 12:32:02,783 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 12:32:02,784 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 12:32:02,785 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 12:32:02,785 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 12:32:02,786 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 12:32:02,787 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 12:32:02,788 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 12:32:02,789 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 12:32:02,790 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 12:32:02,792 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 12:32:02,794 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 12:32:02,795 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 12:32:02,796 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 12:32:02,798 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 12:32:02,798 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 12:32:02,801 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 12:32:02,801 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 12:32:02,801 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 12:32:02,802 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 12:32:02,802 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 12:32:02,803 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 12:32:02,804 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 12:32:02,804 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 12:32:02,805 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 12:32:02,806 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 12:32:02,807 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 12:32:02,807 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 12:32:02,808 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 12:32:02,808 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 12:32:02,808 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 12:32:02,809 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 12:32:02,810 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 12:32:02,810 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-09-08 12:32:02,825 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 12:32:02,825 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 12:32:02,826 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 12:32:02,826 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 12:32:02,827 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 12:32:02,827 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 12:32:02,827 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 12:32:02,827 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 12:32:02,827 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 12:32:02,828 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 12:32:02,828 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 12:32:02,828 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 12:32:02,828 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 12:32:02,828 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 12:32:02,829 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 12:32:02,829 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 12:32:02,829 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 12:32:02,829 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 12:32:02,829 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 12:32:02,830 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 12:32:02,830 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 12:32:02,830 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 12:32:02,830 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 12:32:02,830 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 12:32:02,831 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 12:32:02,831 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 12:32:02,831 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 12:32:02,831 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 12:32:02,831 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 12:32:02,860 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 12:32:02,871 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 12:32:02,874 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 12:32:02,876 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 12:32:02,876 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 12:32:02,877 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+cfa-reducer.c [2019-09-08 12:32:02,934 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/10ecd3f15/ca63057fbcf04de48ce3b5efd2326de2/FLAGcca457198 [2019-09-08 12:32:03,433 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 12:32:03,434 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+cfa-reducer.c [2019-09-08 12:32:03,459 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/10ecd3f15/ca63057fbcf04de48ce3b5efd2326de2/FLAGcca457198 [2019-09-08 12:32:03,781 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/10ecd3f15/ca63057fbcf04de48ce3b5efd2326de2 [2019-09-08 12:32:03,792 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 12:32:03,793 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 12:32:03,794 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 12:32:03,794 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 12:32:03,798 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 12:32:03,799 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 12:32:03" (1/1) ... [2019-09-08 12:32:03,802 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7106b43b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:32:03, skipping insertion in model container [2019-09-08 12:32:03,802 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 12:32:03" (1/1) ... [2019-09-08 12:32:03,810 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 12:32:03,860 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 12:32:04,297 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 12:32:04,312 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 12:32:04,430 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 12:32:04,466 INFO L192 MainTranslator]: Completed translation [2019-09-08 12:32:04,467 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:32:04 WrapperNode [2019-09-08 12:32:04,467 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 12:32:04,468 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 12:32:04,468 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 12:32:04,468 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 12:32:04,480 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:32:04" (1/1) ... [2019-09-08 12:32:04,480 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:32:04" (1/1) ... [2019-09-08 12:32:04,491 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:32:04" (1/1) ... [2019-09-08 12:32:04,491 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:32:04" (1/1) ... [2019-09-08 12:32:04,507 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:32:04" (1/1) ... [2019-09-08 12:32:04,518 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:32:04" (1/1) ... [2019-09-08 12:32:04,522 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:32:04" (1/1) ... [2019-09-08 12:32:04,526 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 12:32:04,527 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 12:32:04,527 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 12:32:04,527 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 12:32:04,528 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:32:04" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 12:32:04,576 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 12:32:04,577 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 12:32:04,577 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 12:32:04,577 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 12:32:04,577 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-08 12:32:04,577 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-08 12:32:04,577 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-08 12:32:04,578 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 12:32:04,578 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-08 12:32:04,578 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-08 12:32:04,578 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-08 12:32:04,578 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-08 12:32:04,579 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-08 12:32:04,579 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-08 12:32:04,579 INFO L130 BoogieDeclarations]: Found specification of procedure node5 [2019-09-08 12:32:04,579 INFO L130 BoogieDeclarations]: Found specification of procedure node6 [2019-09-08 12:32:04,579 INFO L130 BoogieDeclarations]: Found specification of procedure node7 [2019-09-08 12:32:04,579 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-08 12:32:04,580 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-08 12:32:04,580 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 12:32:04,580 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 12:32:04,580 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 12:32:05,354 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 12:32:05,355 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-08 12:32:05,356 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 12:32:05 BoogieIcfgContainer [2019-09-08 12:32:05,357 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 12:32:05,359 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 12:32:05,359 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 12:32:05,362 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 12:32:05,363 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 12:32:03" (1/3) ... [2019-09-08 12:32:05,363 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@474ee2b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 12:32:05, skipping insertion in model container [2019-09-08 12:32:05,364 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:32:04" (2/3) ... [2019-09-08 12:32:05,364 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@474ee2b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 12:32:05, skipping insertion in model container [2019-09-08 12:32:05,365 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 12:32:05" (3/3) ... [2019-09-08 12:32:05,366 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+cfa-reducer.c [2019-09-08 12:32:05,375 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 12:32:05,383 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 12:32:05,399 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 12:32:05,431 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 12:32:05,431 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 12:32:05,432 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 12:32:05,432 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 12:32:05,432 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 12:32:05,432 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 12:32:05,433 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 12:32:05,433 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 12:32:05,433 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 12:32:05,456 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states. [2019-09-08 12:32:05,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-08 12:32:05,466 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:32:05,467 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:32:05,469 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:32:05,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:32:05,474 INFO L82 PathProgramCache]: Analyzing trace with hash -342597549, now seen corresponding path program 1 times [2019-09-08 12:32:05,476 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:32:05,476 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:32:05,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:32:05,534 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:32:05,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:32:05,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:32:06,029 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:32:06,032 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:32:06,032 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:32:06,037 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:32:06,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:32:06,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:32:06,055 INFO L87 Difference]: Start difference. First operand 141 states. Second operand 3 states. [2019-09-08 12:32:06,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:32:06,196 INFO L93 Difference]: Finished difference Result 301 states and 491 transitions. [2019-09-08 12:32:06,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:32:06,198 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 90 [2019-09-08 12:32:06,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:32:06,222 INFO L225 Difference]: With dead ends: 301 [2019-09-08 12:32:06,222 INFO L226 Difference]: Without dead ends: 209 [2019-09-08 12:32:06,230 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:32:06,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2019-09-08 12:32:06,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 207. [2019-09-08 12:32:06,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2019-09-08 12:32:06,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 296 transitions. [2019-09-08 12:32:06,343 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 296 transitions. Word has length 90 [2019-09-08 12:32:06,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:32:06,345 INFO L475 AbstractCegarLoop]: Abstraction has 207 states and 296 transitions. [2019-09-08 12:32:06,345 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:32:06,345 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 296 transitions. [2019-09-08 12:32:06,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-09-08 12:32:06,350 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:32:06,350 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:32:06,351 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:32:06,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:32:06,351 INFO L82 PathProgramCache]: Analyzing trace with hash 2032484070, now seen corresponding path program 1 times [2019-09-08 12:32:06,352 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:32:06,352 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:32:06,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:32:06,354 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:32:06,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:32:06,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:32:06,519 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:32:06,520 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:32:06,520 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:32:06,522 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:32:06,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:32:06,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:32:06,523 INFO L87 Difference]: Start difference. First operand 207 states and 296 transitions. Second operand 3 states. [2019-09-08 12:32:06,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:32:06,567 INFO L93 Difference]: Finished difference Result 491 states and 748 transitions. [2019-09-08 12:32:06,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:32:06,567 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 91 [2019-09-08 12:32:06,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:32:06,570 INFO L225 Difference]: With dead ends: 491 [2019-09-08 12:32:06,570 INFO L226 Difference]: Without dead ends: 341 [2019-09-08 12:32:06,572 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:32:06,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2019-09-08 12:32:06,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 339. [2019-09-08 12:32:06,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 339 states. [2019-09-08 12:32:06,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 506 transitions. [2019-09-08 12:32:06,607 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 506 transitions. Word has length 91 [2019-09-08 12:32:06,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:32:06,608 INFO L475 AbstractCegarLoop]: Abstraction has 339 states and 506 transitions. [2019-09-08 12:32:06,608 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:32:06,608 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 506 transitions. [2019-09-08 12:32:06,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-09-08 12:32:06,612 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:32:06,613 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:32:06,613 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:32:06,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:32:06,615 INFO L82 PathProgramCache]: Analyzing trace with hash 1593427600, now seen corresponding path program 1 times [2019-09-08 12:32:06,616 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:32:06,616 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:32:06,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:32:06,620 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:32:06,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:32:06,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:32:06,742 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:32:06,742 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:32:06,742 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:32:06,744 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:32:06,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:32:06,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:32:06,745 INFO L87 Difference]: Start difference. First operand 339 states and 506 transitions. Second operand 3 states. [2019-09-08 12:32:06,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:32:06,805 INFO L93 Difference]: Finished difference Result 871 states and 1352 transitions. [2019-09-08 12:32:06,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:32:06,806 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 92 [2019-09-08 12:32:06,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:32:06,820 INFO L225 Difference]: With dead ends: 871 [2019-09-08 12:32:06,820 INFO L226 Difference]: Without dead ends: 589 [2019-09-08 12:32:06,823 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:32:06,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2019-09-08 12:32:06,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 587. [2019-09-08 12:32:06,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 587 states. [2019-09-08 12:32:06,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 587 states to 587 states and 898 transitions. [2019-09-08 12:32:06,881 INFO L78 Accepts]: Start accepts. Automaton has 587 states and 898 transitions. Word has length 92 [2019-09-08 12:32:06,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:32:06,884 INFO L475 AbstractCegarLoop]: Abstraction has 587 states and 898 transitions. [2019-09-08 12:32:06,885 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:32:06,885 INFO L276 IsEmpty]: Start isEmpty. Operand 587 states and 898 transitions. [2019-09-08 12:32:06,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-09-08 12:32:06,894 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:32:06,895 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:32:06,895 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:32:06,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:32:06,896 INFO L82 PathProgramCache]: Analyzing trace with hash -304306673, now seen corresponding path program 1 times [2019-09-08 12:32:06,896 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:32:06,896 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:32:06,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:32:06,902 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:32:06,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:32:06,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:32:07,073 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:32:07,074 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:32:07,074 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:32:07,074 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:32:07,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:32:07,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:32:07,075 INFO L87 Difference]: Start difference. First operand 587 states and 898 transitions. Second operand 3 states. [2019-09-08 12:32:07,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:32:07,125 INFO L93 Difference]: Finished difference Result 1583 states and 2476 transitions. [2019-09-08 12:32:07,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:32:07,126 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 93 [2019-09-08 12:32:07,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:32:07,135 INFO L225 Difference]: With dead ends: 1583 [2019-09-08 12:32:07,135 INFO L226 Difference]: Without dead ends: 1053 [2019-09-08 12:32:07,137 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:32:07,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1053 states. [2019-09-08 12:32:07,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1053 to 1051. [2019-09-08 12:32:07,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1051 states. [2019-09-08 12:32:07,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1051 states to 1051 states and 1626 transitions. [2019-09-08 12:32:07,192 INFO L78 Accepts]: Start accepts. Automaton has 1051 states and 1626 transitions. Word has length 93 [2019-09-08 12:32:07,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:32:07,193 INFO L475 AbstractCegarLoop]: Abstraction has 1051 states and 1626 transitions. [2019-09-08 12:32:07,193 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:32:07,193 INFO L276 IsEmpty]: Start isEmpty. Operand 1051 states and 1626 transitions. [2019-09-08 12:32:07,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-09-08 12:32:07,198 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:32:07,199 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:32:07,199 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:32:07,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:32:07,199 INFO L82 PathProgramCache]: Analyzing trace with hash 22614474, now seen corresponding path program 1 times [2019-09-08 12:32:07,199 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:32:07,200 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:32:07,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:32:07,201 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:32:07,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:32:07,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:32:07,331 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:32:07,332 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:32:07,332 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:32:07,333 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:32:07,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:32:07,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:32:07,335 INFO L87 Difference]: Start difference. First operand 1051 states and 1626 transitions. Second operand 3 states. [2019-09-08 12:32:07,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:32:07,424 INFO L93 Difference]: Finished difference Result 2911 states and 4556 transitions. [2019-09-08 12:32:07,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:32:07,425 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 94 [2019-09-08 12:32:07,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:32:07,435 INFO L225 Difference]: With dead ends: 2911 [2019-09-08 12:32:07,436 INFO L226 Difference]: Without dead ends: 1917 [2019-09-08 12:32:07,438 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:32:07,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1917 states. [2019-09-08 12:32:07,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1917 to 1915. [2019-09-08 12:32:07,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1915 states. [2019-09-08 12:32:07,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1915 states to 1915 states and 2970 transitions. [2019-09-08 12:32:07,542 INFO L78 Accepts]: Start accepts. Automaton has 1915 states and 2970 transitions. Word has length 94 [2019-09-08 12:32:07,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:32:07,544 INFO L475 AbstractCegarLoop]: Abstraction has 1915 states and 2970 transitions. [2019-09-08 12:32:07,544 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:32:07,544 INFO L276 IsEmpty]: Start isEmpty. Operand 1915 states and 2970 transitions. [2019-09-08 12:32:07,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-09-08 12:32:07,545 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:32:07,545 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:32:07,545 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:32:07,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:32:07,546 INFO L82 PathProgramCache]: Analyzing trace with hash -1677889525, now seen corresponding path program 1 times [2019-09-08 12:32:07,546 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:32:07,546 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:32:07,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:32:07,548 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:32:07,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:32:07,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:32:07,676 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:32:07,676 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:32:07,676 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:32:07,677 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:32:07,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:32:07,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:32:07,678 INFO L87 Difference]: Start difference. First operand 1915 states and 2970 transitions. Second operand 3 states. [2019-09-08 12:32:07,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:32:07,837 INFO L93 Difference]: Finished difference Result 5375 states and 8380 transitions. [2019-09-08 12:32:07,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:32:07,838 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 95 [2019-09-08 12:32:07,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:32:07,858 INFO L225 Difference]: With dead ends: 5375 [2019-09-08 12:32:07,858 INFO L226 Difference]: Without dead ends: 3517 [2019-09-08 12:32:07,863 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:32:07,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3517 states. [2019-09-08 12:32:08,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3517 to 3515. [2019-09-08 12:32:08,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3515 states. [2019-09-08 12:32:08,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3515 states to 3515 states and 5434 transitions. [2019-09-08 12:32:08,048 INFO L78 Accepts]: Start accepts. Automaton has 3515 states and 5434 transitions. Word has length 95 [2019-09-08 12:32:08,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:32:08,048 INFO L475 AbstractCegarLoop]: Abstraction has 3515 states and 5434 transitions. [2019-09-08 12:32:08,048 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:32:08,049 INFO L276 IsEmpty]: Start isEmpty. Operand 3515 states and 5434 transitions. [2019-09-08 12:32:08,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-09-08 12:32:08,049 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:32:08,051 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:32:08,053 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:32:08,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:32:08,054 INFO L82 PathProgramCache]: Analyzing trace with hash 2079777372, now seen corresponding path program 1 times [2019-09-08 12:32:08,054 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:32:08,054 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:32:08,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:32:08,058 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:32:08,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:32:08,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:32:08,194 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:32:08,195 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:32:08,195 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:32:08,195 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:32:08,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:32:08,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:32:08,196 INFO L87 Difference]: Start difference. First operand 3515 states and 5434 transitions. Second operand 3 states. [2019-09-08 12:32:08,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:32:08,445 INFO L93 Difference]: Finished difference Result 9919 states and 15356 transitions. [2019-09-08 12:32:08,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:32:08,445 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 96 [2019-09-08 12:32:08,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:32:08,479 INFO L225 Difference]: With dead ends: 9919 [2019-09-08 12:32:08,479 INFO L226 Difference]: Without dead ends: 6461 [2019-09-08 12:32:08,488 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:32:08,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6461 states. [2019-09-08 12:32:08,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6461 to 6459. [2019-09-08 12:32:08,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6459 states. [2019-09-08 12:32:08,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6459 states to 6459 states and 9914 transitions. [2019-09-08 12:32:08,859 INFO L78 Accepts]: Start accepts. Automaton has 6459 states and 9914 transitions. Word has length 96 [2019-09-08 12:32:08,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:32:08,859 INFO L475 AbstractCegarLoop]: Abstraction has 6459 states and 9914 transitions. [2019-09-08 12:32:08,859 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:32:08,859 INFO L276 IsEmpty]: Start isEmpty. Operand 6459 states and 9914 transitions. [2019-09-08 12:32:08,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-08 12:32:08,860 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:32:08,860 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:32:08,861 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:32:08,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:32:08,861 INFO L82 PathProgramCache]: Analyzing trace with hash -447256609, now seen corresponding path program 1 times [2019-09-08 12:32:08,861 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:32:08,862 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:32:08,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:32:08,863 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:32:08,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:32:08,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:32:08,994 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:32:08,995 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:32:08,995 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:32:08,996 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:32:08,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:32:08,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:32:08,997 INFO L87 Difference]: Start difference. First operand 6459 states and 9914 transitions. Second operand 5 states. [2019-09-08 12:32:09,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:32:09,822 INFO L93 Difference]: Finished difference Result 19263 states and 29628 transitions. [2019-09-08 12:32:09,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:32:09,823 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 97 [2019-09-08 12:32:09,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:32:09,908 INFO L225 Difference]: With dead ends: 19263 [2019-09-08 12:32:09,909 INFO L226 Difference]: Without dead ends: 12861 [2019-09-08 12:32:09,925 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-08 12:32:09,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12861 states. [2019-09-08 12:32:10,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12861 to 12859. [2019-09-08 12:32:10,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12859 states. [2019-09-08 12:32:10,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12859 states to 12859 states and 19706 transitions. [2019-09-08 12:32:10,636 INFO L78 Accepts]: Start accepts. Automaton has 12859 states and 19706 transitions. Word has length 97 [2019-09-08 12:32:10,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:32:10,637 INFO L475 AbstractCegarLoop]: Abstraction has 12859 states and 19706 transitions. [2019-09-08 12:32:10,637 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:32:10,637 INFO L276 IsEmpty]: Start isEmpty. Operand 12859 states and 19706 transitions. [2019-09-08 12:32:10,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-08 12:32:10,638 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:32:10,638 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:32:10,639 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:32:10,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:32:10,639 INFO L82 PathProgramCache]: Analyzing trace with hash 1088141316, now seen corresponding path program 1 times [2019-09-08 12:32:10,639 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:32:10,639 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:32:10,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:32:10,641 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:32:10,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:32:10,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:32:10,753 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:32:10,753 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:32:10,754 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:32:10,754 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:32:10,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:32:10,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:32:10,755 INFO L87 Difference]: Start difference. First operand 12859 states and 19706 transitions. Second operand 5 states. [2019-09-08 12:32:11,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:32:11,568 INFO L93 Difference]: Finished difference Result 25661 states and 39355 transitions. [2019-09-08 12:32:11,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:32:11,569 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 97 [2019-09-08 12:32:11,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:32:11,600 INFO L225 Difference]: With dead ends: 25661 [2019-09-08 12:32:11,601 INFO L226 Difference]: Without dead ends: 12859 [2019-09-08 12:32:11,626 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-08 12:32:11,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12859 states. [2019-09-08 12:32:12,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12859 to 12859. [2019-09-08 12:32:12,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12859 states. [2019-09-08 12:32:12,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12859 states to 12859 states and 19578 transitions. [2019-09-08 12:32:12,821 INFO L78 Accepts]: Start accepts. Automaton has 12859 states and 19578 transitions. Word has length 97 [2019-09-08 12:32:12,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:32:12,821 INFO L475 AbstractCegarLoop]: Abstraction has 12859 states and 19578 transitions. [2019-09-08 12:32:12,821 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:32:12,822 INFO L276 IsEmpty]: Start isEmpty. Operand 12859 states and 19578 transitions. [2019-09-08 12:32:12,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-08 12:32:12,823 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:32:12,823 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:32:12,823 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:32:12,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:32:12,824 INFO L82 PathProgramCache]: Analyzing trace with hash -1485495105, now seen corresponding path program 1 times [2019-09-08 12:32:12,824 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:32:12,824 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:32:12,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:32:12,826 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:32:12,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:32:12,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:32:12,921 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:32:12,921 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:32:12,922 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:32:12,922 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:32:12,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:32:12,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:32:12,923 INFO L87 Difference]: Start difference. First operand 12859 states and 19578 transitions. Second operand 5 states. [2019-09-08 12:32:13,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:32:13,694 INFO L93 Difference]: Finished difference Result 25661 states and 39099 transitions. [2019-09-08 12:32:13,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:32:13,694 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 97 [2019-09-08 12:32:13,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:32:13,724 INFO L225 Difference]: With dead ends: 25661 [2019-09-08 12:32:13,725 INFO L226 Difference]: Without dead ends: 12859 [2019-09-08 12:32:13,745 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-08 12:32:13,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12859 states. [2019-09-08 12:32:14,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12859 to 12859. [2019-09-08 12:32:14,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12859 states. [2019-09-08 12:32:14,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12859 states to 12859 states and 19450 transitions. [2019-09-08 12:32:14,431 INFO L78 Accepts]: Start accepts. Automaton has 12859 states and 19450 transitions. Word has length 97 [2019-09-08 12:32:14,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:32:14,431 INFO L475 AbstractCegarLoop]: Abstraction has 12859 states and 19450 transitions. [2019-09-08 12:32:14,431 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:32:14,432 INFO L276 IsEmpty]: Start isEmpty. Operand 12859 states and 19450 transitions. [2019-09-08 12:32:14,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-08 12:32:14,433 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:32:14,433 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:32:14,433 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:32:14,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:32:14,434 INFO L82 PathProgramCache]: Analyzing trace with hash -211627100, now seen corresponding path program 1 times [2019-09-08 12:32:14,434 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:32:14,434 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:32:14,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:32:14,436 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:32:14,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:32:14,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:32:14,549 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:32:14,550 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:32:14,550 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:32:14,550 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:32:14,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:32:14,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:32:14,551 INFO L87 Difference]: Start difference. First operand 12859 states and 19450 transitions. Second operand 5 states. [2019-09-08 12:32:15,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:32:15,416 INFO L93 Difference]: Finished difference Result 25661 states and 38843 transitions. [2019-09-08 12:32:15,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:32:15,416 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 97 [2019-09-08 12:32:15,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:32:15,455 INFO L225 Difference]: With dead ends: 25661 [2019-09-08 12:32:15,455 INFO L226 Difference]: Without dead ends: 12859 [2019-09-08 12:32:15,480 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-08 12:32:15,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12859 states. [2019-09-08 12:32:16,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12859 to 12859. [2019-09-08 12:32:16,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12859 states. [2019-09-08 12:32:16,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12859 states to 12859 states and 19322 transitions. [2019-09-08 12:32:16,354 INFO L78 Accepts]: Start accepts. Automaton has 12859 states and 19322 transitions. Word has length 97 [2019-09-08 12:32:16,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:32:16,354 INFO L475 AbstractCegarLoop]: Abstraction has 12859 states and 19322 transitions. [2019-09-08 12:32:16,355 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:32:16,355 INFO L276 IsEmpty]: Start isEmpty. Operand 12859 states and 19322 transitions. [2019-09-08 12:32:16,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-08 12:32:16,356 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:32:16,356 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:32:16,356 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:32:16,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:32:16,357 INFO L82 PathProgramCache]: Analyzing trace with hash -1658656695, now seen corresponding path program 1 times [2019-09-08 12:32:16,357 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:32:16,357 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:32:16,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:32:16,359 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:32:16,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:32:16,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:32:16,456 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:32:16,456 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:32:16,457 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:32:16,457 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:32:16,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:32:16,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:32:16,458 INFO L87 Difference]: Start difference. First operand 12859 states and 19322 transitions. Second operand 5 states. [2019-09-08 12:32:17,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:32:17,165 INFO L93 Difference]: Finished difference Result 25661 states and 38587 transitions. [2019-09-08 12:32:17,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:32:17,166 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 97 [2019-09-08 12:32:17,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:32:17,202 INFO L225 Difference]: With dead ends: 25661 [2019-09-08 12:32:17,202 INFO L226 Difference]: Without dead ends: 12859 [2019-09-08 12:32:17,228 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-08 12:32:17,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12859 states. [2019-09-08 12:32:18,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12859 to 12859. [2019-09-08 12:32:18,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12859 states. [2019-09-08 12:32:18,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12859 states to 12859 states and 19194 transitions. [2019-09-08 12:32:18,439 INFO L78 Accepts]: Start accepts. Automaton has 12859 states and 19194 transitions. Word has length 97 [2019-09-08 12:32:18,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:32:18,439 INFO L475 AbstractCegarLoop]: Abstraction has 12859 states and 19194 transitions. [2019-09-08 12:32:18,439 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:32:18,439 INFO L276 IsEmpty]: Start isEmpty. Operand 12859 states and 19194 transitions. [2019-09-08 12:32:18,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-08 12:32:18,440 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:32:18,440 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:32:18,441 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:32:18,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:32:18,441 INFO L82 PathProgramCache]: Analyzing trace with hash -331271506, now seen corresponding path program 1 times [2019-09-08 12:32:18,441 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:32:18,441 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:32:18,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:32:18,444 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:32:18,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:32:18,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:32:18,624 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:32:18,624 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:32:18,625 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:32:18,625 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:32:18,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:32:18,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:32:18,626 INFO L87 Difference]: Start difference. First operand 12859 states and 19194 transitions. Second operand 9 states. [2019-09-08 12:32:26,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:32:26,741 INFO L93 Difference]: Finished difference Result 192087 states and 287112 transitions. [2019-09-08 12:32:26,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:32:26,742 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 97 [2019-09-08 12:32:26,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:32:27,433 INFO L225 Difference]: With dead ends: 192087 [2019-09-08 12:32:27,434 INFO L226 Difference]: Without dead ends: 179285 [2019-09-08 12:32:27,488 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=112, Invalid=230, Unknown=0, NotChecked=0, Total=342 [2019-09-08 12:32:27,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179285 states. [2019-09-08 12:32:30,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179285 to 25659. [2019-09-08 12:32:30,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25659 states. [2019-09-08 12:32:30,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25659 states to 25659 states and 37818 transitions. [2019-09-08 12:32:30,385 INFO L78 Accepts]: Start accepts. Automaton has 25659 states and 37818 transitions. Word has length 97 [2019-09-08 12:32:30,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:32:30,386 INFO L475 AbstractCegarLoop]: Abstraction has 25659 states and 37818 transitions. [2019-09-08 12:32:30,386 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:32:30,386 INFO L276 IsEmpty]: Start isEmpty. Operand 25659 states and 37818 transitions. [2019-09-08 12:32:30,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-08 12:32:30,386 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:32:30,387 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:32:30,387 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:32:30,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:32:30,387 INFO L82 PathProgramCache]: Analyzing trace with hash -1397477208, now seen corresponding path program 1 times [2019-09-08 12:32:30,387 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:32:30,387 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:32:30,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:32:30,389 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:32:30,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:32:30,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:32:30,767 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:32:30,767 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:32:30,768 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:32:30,768 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:32:30,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:32:30,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:32:30,769 INFO L87 Difference]: Start difference. First operand 25659 states and 37818 transitions. Second operand 9 states. [2019-09-08 12:32:37,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:32:37,017 INFO L93 Difference]: Finished difference Result 102467 states and 151102 transitions. [2019-09-08 12:32:37,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 12:32:37,017 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 99 [2019-09-08 12:32:37,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:32:37,112 INFO L225 Difference]: With dead ends: 102467 [2019-09-08 12:32:37,113 INFO L226 Difference]: Without dead ends: 76865 [2019-09-08 12:32:37,154 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2019-09-08 12:32:37,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76865 states. [2019-09-08 12:32:41,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76865 to 51259. [2019-09-08 12:32:41,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51259 states. [2019-09-08 12:32:41,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51259 states to 51259 states and 75322 transitions. [2019-09-08 12:32:41,093 INFO L78 Accepts]: Start accepts. Automaton has 51259 states and 75322 transitions. Word has length 99 [2019-09-08 12:32:41,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:32:41,093 INFO L475 AbstractCegarLoop]: Abstraction has 51259 states and 75322 transitions. [2019-09-08 12:32:41,093 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:32:41,093 INFO L276 IsEmpty]: Start isEmpty. Operand 51259 states and 75322 transitions. [2019-09-08 12:32:41,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-08 12:32:41,094 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:32:41,094 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:32:41,094 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:32:41,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:32:41,095 INFO L82 PathProgramCache]: Analyzing trace with hash -1417526551, now seen corresponding path program 1 times [2019-09-08 12:32:41,095 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:32:41,095 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:32:41,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:32:41,097 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:32:41,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:32:41,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:32:41,187 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:32:41,187 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:32:41,187 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:32:41,187 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:32:41,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:32:41,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:32:41,188 INFO L87 Difference]: Start difference. First operand 51259 states and 75322 transitions. Second operand 3 states. [2019-09-08 12:32:46,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:32:46,515 INFO L93 Difference]: Finished difference Result 114881 states and 168574 transitions. [2019-09-08 12:32:46,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:32:46,516 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2019-09-08 12:32:46,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:32:46,585 INFO L225 Difference]: With dead ends: 114881 [2019-09-08 12:32:46,585 INFO L226 Difference]: Without dead ends: 63679 [2019-09-08 12:32:46,622 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:32:46,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63679 states. [2019-09-08 12:32:51,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63679 to 63677. [2019-09-08 12:32:51,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63677 states. [2019-09-08 12:32:51,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63677 states to 63677 states and 92924 transitions. [2019-09-08 12:32:51,253 INFO L78 Accepts]: Start accepts. Automaton has 63677 states and 92924 transitions. Word has length 99 [2019-09-08 12:32:51,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:32:51,254 INFO L475 AbstractCegarLoop]: Abstraction has 63677 states and 92924 transitions. [2019-09-08 12:32:51,254 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:32:51,254 INFO L276 IsEmpty]: Start isEmpty. Operand 63677 states and 92924 transitions. [2019-09-08 12:32:51,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-08 12:32:51,254 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:32:51,254 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:32:51,255 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:32:51,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:32:51,255 INFO L82 PathProgramCache]: Analyzing trace with hash -374029762, now seen corresponding path program 1 times [2019-09-08 12:32:51,255 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:32:51,255 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:32:51,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:32:51,257 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:32:51,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:32:51,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:32:51,340 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:32:51,342 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:32:51,342 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:32:51,343 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:32:51,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:32:51,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:32:51,343 INFO L87 Difference]: Start difference. First operand 63677 states and 92924 transitions. Second operand 5 states. [2019-09-08 12:33:01,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:33:01,343 INFO L93 Difference]: Finished difference Result 123837 states and 179919 transitions. [2019-09-08 12:33:01,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 12:33:01,343 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 100 [2019-09-08 12:33:01,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:33:01,478 INFO L225 Difference]: With dead ends: 123837 [2019-09-08 12:33:01,479 INFO L226 Difference]: Without dead ends: 123835 [2019-09-08 12:33:01,503 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-08 12:33:01,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123835 states. [2019-09-08 12:33:07,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123835 to 65853. [2019-09-08 12:33:07,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65853 states. [2019-09-08 12:33:07,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65853 states to 65853 states and 95036 transitions. [2019-09-08 12:33:07,297 INFO L78 Accepts]: Start accepts. Automaton has 65853 states and 95036 transitions. Word has length 100 [2019-09-08 12:33:07,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:33:07,298 INFO L475 AbstractCegarLoop]: Abstraction has 65853 states and 95036 transitions. [2019-09-08 12:33:07,298 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:33:07,298 INFO L276 IsEmpty]: Start isEmpty. Operand 65853 states and 95036 transitions. [2019-09-08 12:33:07,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-09-08 12:33:07,313 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:33:07,313 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:33:07,313 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:33:07,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:33:07,314 INFO L82 PathProgramCache]: Analyzing trace with hash 928377095, now seen corresponding path program 1 times [2019-09-08 12:33:07,314 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:33:07,314 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:33:07,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:33:07,316 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:33:07,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:33:07,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:33:07,544 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-08 12:33:07,545 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:33:07,545 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:33:07,545 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:33:07,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:33:07,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:33:07,546 INFO L87 Difference]: Start difference. First operand 65853 states and 95036 transitions. Second operand 9 states. [2019-09-08 12:33:40,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:33:40,909 INFO L93 Difference]: Finished difference Result 400013 states and 578628 transitions. [2019-09-08 12:33:40,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 12:33:40,909 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 134 [2019-09-08 12:33:40,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:33:41,394 INFO L225 Difference]: With dead ends: 400013 [2019-09-08 12:33:41,394 INFO L226 Difference]: Without dead ends: 373387 [2019-09-08 12:33:41,476 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2019-09-08 12:33:41,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373387 states. [2019-09-08 12:33:53,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373387 to 108925. [2019-09-08 12:33:53,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108925 states. [2019-09-08 12:33:53,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108925 states to 108925 states and 156732 transitions. [2019-09-08 12:33:53,247 INFO L78 Accepts]: Start accepts. Automaton has 108925 states and 156732 transitions. Word has length 134 [2019-09-08 12:33:53,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:33:53,248 INFO L475 AbstractCegarLoop]: Abstraction has 108925 states and 156732 transitions. [2019-09-08 12:33:53,248 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:33:53,248 INFO L276 IsEmpty]: Start isEmpty. Operand 108925 states and 156732 transitions. [2019-09-08 12:33:53,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-09-08 12:33:53,263 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:33:53,264 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:33:53,264 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:33:53,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:33:53,264 INFO L82 PathProgramCache]: Analyzing trace with hash -1520560563, now seen corresponding path program 1 times [2019-09-08 12:33:53,264 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:33:53,265 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:33:53,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:33:53,266 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:33:53,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:33:53,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:33:53,395 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:33:53,395 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 12:33:53,395 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 12:33:53,414 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 12:33:53,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:33:53,574 INFO L256 TraceCheckSpWp]: Trace formula consists of 1005 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-08 12:33:53,587 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 12:33:53,828 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-08 12:33:53,833 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 12:33:53,834 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [5] total 12 [2019-09-08 12:33:53,835 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 12:33:53,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 12:33:53,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2019-09-08 12:33:53,836 INFO L87 Difference]: Start difference. First operand 108925 states and 156732 transitions. Second operand 12 states. [2019-09-08 12:34:59,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:34:59,438 INFO L93 Difference]: Finished difference Result 682737 states and 987222 transitions. [2019-09-08 12:34:59,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-08 12:34:59,438 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 134 [2019-09-08 12:34:59,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:35:00,814 INFO L225 Difference]: With dead ends: 682737 [2019-09-08 12:35:00,814 INFO L226 Difference]: Without dead ends: 649775 [2019-09-08 12:35:00,955 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 185 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=237, Invalid=633, Unknown=0, NotChecked=0, Total=870 [2019-09-08 12:35:01,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 649775 states. [2019-09-08 12:35:27,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 649775 to 168509. [2019-09-08 12:35:27,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168509 states. [2019-09-08 12:35:28,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168509 states to 168509 states and 242940 transitions. [2019-09-08 12:35:28,157 INFO L78 Accepts]: Start accepts. Automaton has 168509 states and 242940 transitions. Word has length 134 [2019-09-08 12:35:28,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:35:28,158 INFO L475 AbstractCegarLoop]: Abstraction has 168509 states and 242940 transitions. [2019-09-08 12:35:28,158 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 12:35:28,158 INFO L276 IsEmpty]: Start isEmpty. Operand 168509 states and 242940 transitions. [2019-09-08 12:35:28,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-09-08 12:35:28,179 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:35:28,179 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:35:28,179 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:35:28,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:35:28,180 INFO L82 PathProgramCache]: Analyzing trace with hash -402225319, now seen corresponding path program 1 times [2019-09-08 12:35:28,180 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:35:28,180 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:35:28,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:35:28,182 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:35:28,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:35:28,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:35:28,432 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-08 12:35:28,432 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:35:28,433 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:35:28,433 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:35:28,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:35:28,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:35:28,436 INFO L87 Difference]: Start difference. First operand 168509 states and 242940 transitions. Second operand 9 states. [2019-09-08 12:36:09,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:36:09,691 INFO L93 Difference]: Finished difference Result 478477 states and 690372 transitions. [2019-09-08 12:36:09,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 12:36:09,691 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 134 [2019-09-08 12:36:09,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:36:10,175 INFO L225 Difference]: With dead ends: 478477 [2019-09-08 12:36:10,175 INFO L226 Difference]: Without dead ends: 353099 [2019-09-08 12:36:10,313 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2019-09-08 12:36:10,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353099 states. [2019-09-08 12:36:37,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353099 to 201341. [2019-09-08 12:36:37,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201341 states. [2019-09-08 12:36:37,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201341 states to 201341 states and 289852 transitions. [2019-09-08 12:36:37,681 INFO L78 Accepts]: Start accepts. Automaton has 201341 states and 289852 transitions. Word has length 134 [2019-09-08 12:36:37,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:36:37,681 INFO L475 AbstractCegarLoop]: Abstraction has 201341 states and 289852 transitions. [2019-09-08 12:36:37,681 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:36:37,681 INFO L276 IsEmpty]: Start isEmpty. Operand 201341 states and 289852 transitions. [2019-09-08 12:36:37,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-09-08 12:36:37,695 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:36:37,696 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:36:37,696 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:36:37,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:36:37,696 INFO L82 PathProgramCache]: Analyzing trace with hash 1882658405, now seen corresponding path program 1 times [2019-09-08 12:36:37,696 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:36:37,696 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:36:37,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:36:37,698 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:36:37,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:36:37,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:36:37,934 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-08 12:36:37,935 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:36:37,935 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:36:37,935 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:36:37,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:36:37,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:36:37,936 INFO L87 Difference]: Start difference. First operand 201341 states and 289852 transitions. Second operand 9 states. [2019-09-08 12:37:25,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:37:25,794 INFO L93 Difference]: Finished difference Result 511309 states and 737284 transitions. [2019-09-08 12:37:25,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 12:37:25,795 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 134 [2019-09-08 12:37:25,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:37:26,339 INFO L225 Difference]: With dead ends: 511309 [2019-09-08 12:37:26,339 INFO L226 Difference]: Without dead ends: 385931 [2019-09-08 12:37:26,475 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2019-09-08 12:37:26,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385931 states. [2019-09-08 12:37:59,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385931 to 234173. [2019-09-08 12:37:59,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234173 states. [2019-09-08 12:38:00,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234173 states to 234173 states and 336764 transitions. [2019-09-08 12:38:00,346 INFO L78 Accepts]: Start accepts. Automaton has 234173 states and 336764 transitions. Word has length 134 [2019-09-08 12:38:00,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:38:00,347 INFO L475 AbstractCegarLoop]: Abstraction has 234173 states and 336764 transitions. [2019-09-08 12:38:00,347 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:38:00,347 INFO L276 IsEmpty]: Start isEmpty. Operand 234173 states and 336764 transitions. [2019-09-08 12:38:00,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-09-08 12:38:00,360 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:38:00,361 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:38:00,361 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:38:00,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:38:00,361 INFO L82 PathProgramCache]: Analyzing trace with hash 1906403627, now seen corresponding path program 1 times [2019-09-08 12:38:00,362 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:38:00,362 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:38:00,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:38:00,363 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:38:00,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:38:00,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:38:00,507 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:38:00,507 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 12:38:00,507 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 12:38:00,523 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 12:38:00,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:38:00,657 INFO L256 TraceCheckSpWp]: Trace formula consists of 1005 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-08 12:38:00,664 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 12:38:00,859 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-09-08 12:38:00,868 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 12:38:00,869 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [5] total 12 [2019-09-08 12:38:00,869 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 12:38:00,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 12:38:00,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2019-09-08 12:38:00,870 INFO L87 Difference]: Start difference. First operand 234173 states and 336764 transitions. Second operand 12 states. [2019-09-08 12:39:21,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:39:21,465 INFO L93 Difference]: Finished difference Result 761701 states and 1098448 transitions. [2019-09-08 12:39:21,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-09-08 12:39:21,465 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 134 [2019-09-08 12:39:21,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:39:22,353 INFO L225 Difference]: With dead ends: 761701 [2019-09-08 12:39:22,353 INFO L226 Difference]: Without dead ends: 636323 [2019-09-08 12:39:22,970 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=292, Invalid=578, Unknown=0, NotChecked=0, Total=870 [2019-09-08 12:39:23,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 636323 states. [2019-09-08 12:40:05,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 636323 to 280253. [2019-09-08 12:40:05,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280253 states. [2019-09-08 12:40:05,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280253 states to 280253 states and 403644 transitions. [2019-09-08 12:40:05,859 INFO L78 Accepts]: Start accepts. Automaton has 280253 states and 403644 transitions. Word has length 134 [2019-09-08 12:40:05,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:40:05,859 INFO L475 AbstractCegarLoop]: Abstraction has 280253 states and 403644 transitions. [2019-09-08 12:40:05,859 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 12:40:05,859 INFO L276 IsEmpty]: Start isEmpty. Operand 280253 states and 403644 transitions. [2019-09-08 12:40:05,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-09-08 12:40:05,874 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:40:05,874 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:40:05,874 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:40:05,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:40:05,875 INFO L82 PathProgramCache]: Analyzing trace with hash 1510132511, now seen corresponding path program 1 times [2019-09-08 12:40:05,875 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:40:05,875 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:40:05,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:40:05,876 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:40:05,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:40:05,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:40:06,076 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-09-08 12:40:06,077 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:40:06,077 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:40:06,079 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:40:06,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:40:06,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:40:06,079 INFO L87 Difference]: Start difference. First operand 280253 states and 403644 transitions. Second operand 9 states. [2019-09-08 12:41:15,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:41:15,707 INFO L93 Difference]: Finished difference Result 698765 states and 1008580 transitions. [2019-09-08 12:41:15,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 12:41:15,709 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 134 [2019-09-08 12:41:15,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:41:16,430 INFO L225 Difference]: With dead ends: 698765 [2019-09-08 12:41:16,431 INFO L226 Difference]: Without dead ends: 527307 [2019-09-08 12:41:16,603 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2019-09-08 12:41:16,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 527307 states. [2019-09-08 12:42:03,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 527307 to 313085. [2019-09-08 12:42:03,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 313085 states. [2019-09-08 12:42:04,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313085 states to 313085 states and 450556 transitions. [2019-09-08 12:42:04,420 INFO L78 Accepts]: Start accepts. Automaton has 313085 states and 450556 transitions. Word has length 134 [2019-09-08 12:42:04,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:42:04,420 INFO L475 AbstractCegarLoop]: Abstraction has 313085 states and 450556 transitions. [2019-09-08 12:42:04,420 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:42:04,420 INFO L276 IsEmpty]: Start isEmpty. Operand 313085 states and 450556 transitions. [2019-09-08 12:42:04,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-09-08 12:42:04,438 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:42:04,438 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:42:04,439 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:42:04,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:42:04,439 INFO L82 PathProgramCache]: Analyzing trace with hash -2090579181, now seen corresponding path program 1 times [2019-09-08 12:42:04,439 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:42:04,439 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:42:04,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:42:04,441 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:42:04,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:42:04,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:42:04,659 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-08 12:42:04,660 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:42:04,661 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:42:04,661 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:42:04,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:42:04,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:42:04,662 INFO L87 Difference]: Start difference. First operand 313085 states and 450556 transitions. Second operand 9 states. [2019-09-08 12:43:21,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:43:21,227 INFO L93 Difference]: Finished difference Result 731597 states and 1055492 transitions. [2019-09-08 12:43:21,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 12:43:21,227 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 134 [2019-09-08 12:43:21,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:43:21,987 INFO L225 Difference]: With dead ends: 731597 [2019-09-08 12:43:21,987 INFO L226 Difference]: Without dead ends: 560139 [2019-09-08 12:43:22,163 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2019-09-08 12:43:22,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560139 states. [2019-09-08 12:44:16,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560139 to 345917. [2019-09-08 12:44:16,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 345917 states. [2019-09-08 12:44:17,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345917 states to 345917 states and 497468 transitions. [2019-09-08 12:44:17,204 INFO L78 Accepts]: Start accepts. Automaton has 345917 states and 497468 transitions. Word has length 134 [2019-09-08 12:44:17,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:44:17,205 INFO L475 AbstractCegarLoop]: Abstraction has 345917 states and 497468 transitions. [2019-09-08 12:44:17,205 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:44:17,205 INFO L276 IsEmpty]: Start isEmpty. Operand 345917 states and 497468 transitions. [2019-09-08 12:44:17,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-09-08 12:44:17,220 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:44:17,221 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:44:17,221 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:44:17,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:44:17,221 INFO L82 PathProgramCache]: Analyzing trace with hash -1251322482, now seen corresponding path program 1 times [2019-09-08 12:44:17,221 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:44:17,221 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:44:17,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:44:17,222 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:44:17,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:44:17,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:44:17,414 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-08 12:44:17,414 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 12:44:17,415 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 12:44:17,431 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 12:44:17,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:44:17,567 INFO L256 TraceCheckSpWp]: Trace formula consists of 1004 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-08 12:44:17,573 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 12:44:17,653 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 12:44:18,028 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (4)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 12:44:18,643 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 12:44:18,644 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 10] total 12 [2019-09-08 12:44:18,645 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 12:44:18,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 12:44:18,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2019-09-08 12:44:18,646 INFO L87 Difference]: Start difference. First operand 345917 states and 497468 transitions. Second operand 12 states.