java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf -i ../../../trunk/examples/svcomp/memsafety/960521-1_false-valid-free.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-c17473d-m [2018-02-04 17:45:56,979 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-04 17:45:56,981 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-04 17:45:56,993 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-04 17:45:56,993 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-04 17:45:56,994 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-04 17:45:56,995 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-04 17:45:56,996 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-04 17:45:56,998 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-04 17:45:56,999 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-04 17:45:57,000 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-04 17:45:57,000 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-04 17:45:57,001 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-04 17:45:57,002 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-04 17:45:57,002 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-04 17:45:57,004 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-04 17:45:57,006 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-04 17:45:57,007 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-04 17:45:57,008 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-04 17:45:57,010 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-04 17:45:57,011 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-04 17:45:57,012 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-04 17:45:57,012 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-04 17:45:57,013 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-04 17:45:57,014 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-04 17:45:57,015 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-04 17:45:57,015 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-04 17:45:57,015 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-04 17:45:57,016 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-04 17:45:57,016 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-04 17:45:57,017 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-04 17:45:57,017 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf [2018-02-04 17:45:57,026 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-04 17:45:57,026 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-04 17:45:57,028 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-04 17:45:57,028 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-04 17:45:57,028 INFO L133 SettingsManager]: * Use SBE=true [2018-02-04 17:45:57,028 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-04 17:45:57,028 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-04 17:45:57,028 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-04 17:45:57,029 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-04 17:45:57,029 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-04 17:45:57,029 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-04 17:45:57,029 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-04 17:45:57,029 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-04 17:45:57,029 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-04 17:45:57,029 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-04 17:45:57,030 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-04 17:45:57,030 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-04 17:45:57,030 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-04 17:45:57,030 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-04 17:45:57,030 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 17:45:57,030 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-04 17:45:57,030 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-04 17:45:57,030 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-04 17:45:57,030 INFO L133 SettingsManager]: * Trace refinement strategy=SMTINTERPOL [2018-02-04 17:45:57,059 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-04 17:45:57,068 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-04 17:45:57,071 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-04 17:45:57,072 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-04 17:45:57,072 INFO L276 PluginConnector]: CDTParser initialized [2018-02-04 17:45:57,073 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety/960521-1_false-valid-free.i [2018-02-04 17:45:57,223 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-04 17:45:57,224 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-04 17:45:57,225 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-04 17:45:57,225 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-04 17:45:57,230 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-04 17:45:57,231 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 05:45:57" (1/1) ... [2018-02-04 17:45:57,234 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4888748a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:45:57, skipping insertion in model container [2018-02-04 17:45:57,234 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 05:45:57" (1/1) ... [2018-02-04 17:45:57,247 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 17:45:57,275 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 17:45:57,371 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 17:45:57,382 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 17:45:57,386 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:45:57 WrapperNode [2018-02-04 17:45:57,387 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-04 17:45:57,387 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-04 17:45:57,387 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-04 17:45:57,388 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-04 17:45:57,401 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:45:57" (1/1) ... [2018-02-04 17:45:57,401 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:45:57" (1/1) ... [2018-02-04 17:45:57,409 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:45:57" (1/1) ... [2018-02-04 17:45:57,409 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:45:57" (1/1) ... [2018-02-04 17:45:57,412 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:45:57" (1/1) ... [2018-02-04 17:45:57,414 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:45:57" (1/1) ... [2018-02-04 17:45:57,415 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:45:57" (1/1) ... [2018-02-04 17:45:57,416 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-04 17:45:57,416 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-04 17:45:57,416 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-04 17:45:57,416 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-04 17:45:57,417 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:45:57" (1/1) ... No working directory specified, using /home/ultimate/work/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 [2018-02-04 17:45:57,456 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-04 17:45:57,456 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-04 17:45:57,456 INFO L136 BoogieDeclarations]: Found implementation of procedure foo [2018-02-04 17:45:57,456 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-04 17:45:57,456 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-04 17:45:57,456 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-04 17:45:57,456 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-04 17:45:57,457 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-04 17:45:57,457 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-04 17:45:57,457 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-04 17:45:57,457 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-04 17:45:57,457 INFO L128 BoogieDeclarations]: Found specification of procedure foo [2018-02-04 17:45:57,457 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-04 17:45:57,457 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-04 17:45:57,457 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-04 17:45:57,608 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-04 17:45:57,609 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 05:45:57 BoogieIcfgContainer [2018-02-04 17:45:57,610 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-04 17:45:57,610 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-04 17:45:57,610 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-04 17:45:57,613 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-04 17:45:57,613 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 05:45:57" (1/3) ... [2018-02-04 17:45:57,613 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11f26d84 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 05:45:57, skipping insertion in model container [2018-02-04 17:45:57,613 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:45:57" (2/3) ... [2018-02-04 17:45:57,614 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11f26d84 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 05:45:57, skipping insertion in model container [2018-02-04 17:45:57,614 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 05:45:57" (3/3) ... [2018-02-04 17:45:57,615 INFO L107 eAbstractionObserver]: Analyzing ICFG 960521-1_false-valid-free.i [2018-02-04 17:45:57,621 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-04 17:45:57,625 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 17 error locations. [2018-02-04 17:45:57,658 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-04 17:45:57,658 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-04 17:45:57,658 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-04 17:45:57,658 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-04 17:45:57,658 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-04 17:45:57,659 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-04 17:45:57,659 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-04 17:45:57,659 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-04 17:45:57,660 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-04 17:45:57,671 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states. [2018-02-04 17:45:57,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-02-04 17:45:57,679 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:45:57,680 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:45:57,680 INFO L371 AbstractCegarLoop]: === Iteration 1 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 17:45:57,684 INFO L82 PathProgramCache]: Analyzing trace with hash 1993989713, now seen corresponding path program 1 times [2018-02-04 17:45:57,686 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:45:57,687 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:45:57,729 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:45:57,730 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:45:57,730 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:45:57,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:45:57,785 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:45:57,859 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:45:57,861 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:45:57,861 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 17:45:57,862 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 17:45:57,870 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 17:45:57,871 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 17:45:57,873 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 4 states. [2018-02-04 17:45:58,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:45:58,009 INFO L93 Difference]: Finished difference Result 52 states and 54 transitions. [2018-02-04 17:45:58,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 17:45:58,010 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2018-02-04 17:45:58,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:45:58,016 INFO L225 Difference]: With dead ends: 52 [2018-02-04 17:45:58,016 INFO L226 Difference]: Without dead ends: 49 [2018-02-04 17:45:58,017 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-04 17:45:58,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-02-04 17:45:58,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-02-04 17:45:58,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-02-04 17:45:58,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 51 transitions. [2018-02-04 17:45:58,038 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 51 transitions. Word has length 11 [2018-02-04 17:45:58,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:45:58,038 INFO L432 AbstractCegarLoop]: Abstraction has 49 states and 51 transitions. [2018-02-04 17:45:58,038 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 17:45:58,038 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 51 transitions. [2018-02-04 17:45:58,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-02-04 17:45:58,039 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:45:58,039 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:45:58,039 INFO L371 AbstractCegarLoop]: === Iteration 2 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 17:45:58,039 INFO L82 PathProgramCache]: Analyzing trace with hash 1993989714, now seen corresponding path program 1 times [2018-02-04 17:45:58,039 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:45:58,039 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:45:58,040 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:45:58,040 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:45:58,040 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:45:58,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:45:58,051 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:45:58,105 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:45:58,105 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:45:58,105 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 17:45:58,106 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 17:45:58,106 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 17:45:58,106 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 17:45:58,107 INFO L87 Difference]: Start difference. First operand 49 states and 51 transitions. Second operand 5 states. [2018-02-04 17:45:58,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:45:58,161 INFO L93 Difference]: Finished difference Result 48 states and 50 transitions. [2018-02-04 17:45:58,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 17:45:58,161 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2018-02-04 17:45:58,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:45:58,162 INFO L225 Difference]: With dead ends: 48 [2018-02-04 17:45:58,162 INFO L226 Difference]: Without dead ends: 48 [2018-02-04 17:45:58,163 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-02-04 17:45:58,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-02-04 17:45:58,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-02-04 17:45:58,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-02-04 17:45:58,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 50 transitions. [2018-02-04 17:45:58,167 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 50 transitions. Word has length 11 [2018-02-04 17:45:58,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:45:58,167 INFO L432 AbstractCegarLoop]: Abstraction has 48 states and 50 transitions. [2018-02-04 17:45:58,167 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 17:45:58,167 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 50 transitions. [2018-02-04 17:45:58,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-04 17:45:58,168 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:45:58,168 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:45:58,168 INFO L371 AbstractCegarLoop]: === Iteration 3 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 17:45:58,168 INFO L82 PathProgramCache]: Analyzing trace with hash -1188525484, now seen corresponding path program 1 times [2018-02-04 17:45:58,168 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:45:58,169 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:45:58,169 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:45:58,169 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:45:58,169 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:45:58,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:45:58,188 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:45:58,193 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:45:58,194 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:45:58,194 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:45:58,195 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:45:58,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:45:58,238 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:45:58,261 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 17:45:58,262 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:45:58,264 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:45:58,264 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-04 17:45:58,275 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:45:58,276 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:45:58,279 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-02-04 17:45:58,279 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:45:58,288 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 17:45:58,288 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:15 [2018-02-04 17:45:58,305 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:45:58,305 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:45:58,305 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 17:45:58,305 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 17:45:58,306 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 17:45:58,306 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-02-04 17:45:58,306 INFO L87 Difference]: Start difference. First operand 48 states and 50 transitions. Second operand 5 states. [2018-02-04 17:45:58,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:45:58,386 INFO L93 Difference]: Finished difference Result 45 states and 47 transitions. [2018-02-04 17:45:58,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 17:45:58,387 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-02-04 17:45:58,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:45:58,387 INFO L225 Difference]: With dead ends: 45 [2018-02-04 17:45:58,387 INFO L226 Difference]: Without dead ends: 45 [2018-02-04 17:45:58,388 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-02-04 17:45:58,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-02-04 17:45:58,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-02-04 17:45:58,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-02-04 17:45:58,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 47 transitions. [2018-02-04 17:45:58,393 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 47 transitions. Word has length 17 [2018-02-04 17:45:58,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:45:58,394 INFO L432 AbstractCegarLoop]: Abstraction has 45 states and 47 transitions. [2018-02-04 17:45:58,394 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 17:45:58,394 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 47 transitions. [2018-02-04 17:45:58,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-04 17:45:58,394 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:45:58,394 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:45:58,395 INFO L371 AbstractCegarLoop]: === Iteration 4 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 17:45:58,395 INFO L82 PathProgramCache]: Analyzing trace with hash -1188525483, now seen corresponding path program 1 times [2018-02-04 17:45:58,395 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:45:58,395 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:45:58,396 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:45:58,396 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:45:58,396 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:45:58,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:45:58,409 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:45:58,412 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:45:58,413 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:45:58,413 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:45:58,413 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:45:58,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:45:58,457 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:45:58,466 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 17:45:58,466 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:45:58,475 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-04 17:45:58,476 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:45:58,483 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:45:58,483 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:19 [2018-02-04 17:45:58,518 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:45:58,519 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:45:58,520 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-02-04 17:45:58,520 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:45:58,532 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 19 [2018-02-04 17:45:58,533 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:45:58,546 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 17:45:58,546 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:25 [2018-02-04 17:45:58,591 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:45:58,591 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:45:58,591 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 17:45:58,591 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 17:45:58,592 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 17:45:58,592 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-02-04 17:45:58,592 INFO L87 Difference]: Start difference. First operand 45 states and 47 transitions. Second operand 7 states. [2018-02-04 17:45:58,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:45:58,828 INFO L93 Difference]: Finished difference Result 53 states and 55 transitions. [2018-02-04 17:45:58,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 17:45:58,829 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2018-02-04 17:45:58,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:45:58,830 INFO L225 Difference]: With dead ends: 53 [2018-02-04 17:45:58,830 INFO L226 Difference]: Without dead ends: 53 [2018-02-04 17:45:58,830 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2018-02-04 17:45:58,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-02-04 17:45:58,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 48. [2018-02-04 17:45:58,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-02-04 17:45:58,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 50 transitions. [2018-02-04 17:45:58,834 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 50 transitions. Word has length 17 [2018-02-04 17:45:58,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:45:58,835 INFO L432 AbstractCegarLoop]: Abstraction has 48 states and 50 transitions. [2018-02-04 17:45:58,835 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 17:45:58,835 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 50 transitions. [2018-02-04 17:45:58,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-02-04 17:45:58,836 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:45:58,836 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:45:58,836 INFO L371 AbstractCegarLoop]: === Iteration 5 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 17:45:58,836 INFO L82 PathProgramCache]: Analyzing trace with hash -2106816852, now seen corresponding path program 1 times [2018-02-04 17:45:58,836 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:45:58,836 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:45:58,837 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:45:58,837 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:45:58,837 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:45:58,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:45:58,852 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:45:58,856 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:45:58,857 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:45:58,857 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:45:58,858 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:45:58,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:45:58,889 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:45:58,895 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 17:45:58,896 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:45:58,905 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-04 17:45:58,905 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:45:58,912 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:45:58,912 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:19 [2018-02-04 17:45:58,945 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:45:58,946 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:45:58,947 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-02-04 17:45:58,947 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:45:58,955 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 19 [2018-02-04 17:45:58,955 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:45:58,963 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 17:45:58,963 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:25 [2018-02-04 17:45:59,048 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:45:59,049 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 17:45:59,049 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-02-04 17:45:59,049 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 17:45:59,049 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 17:45:59,050 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-02-04 17:45:59,050 INFO L87 Difference]: Start difference. First operand 48 states and 50 transitions. Second operand 9 states. [2018-02-04 17:45:59,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:45:59,409 INFO L93 Difference]: Finished difference Result 57 states and 59 transitions. [2018-02-04 17:45:59,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-04 17:45:59,411 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2018-02-04 17:45:59,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:45:59,411 INFO L225 Difference]: With dead ends: 57 [2018-02-04 17:45:59,411 INFO L226 Difference]: Without dead ends: 57 [2018-02-04 17:45:59,412 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2018-02-04 17:45:59,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-02-04 17:45:59,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 52. [2018-02-04 17:45:59,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-02-04 17:45:59,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 54 transitions. [2018-02-04 17:45:59,416 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 54 transitions. Word has length 21 [2018-02-04 17:45:59,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:45:59,416 INFO L432 AbstractCegarLoop]: Abstraction has 52 states and 54 transitions. [2018-02-04 17:45:59,416 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 17:45:59,416 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 54 transitions. [2018-02-04 17:45:59,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-02-04 17:45:59,417 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:45:59,417 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:45:59,417 INFO L371 AbstractCegarLoop]: === Iteration 6 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 17:45:59,417 INFO L82 PathProgramCache]: Analyzing trace with hash -702775421, now seen corresponding path program 2 times [2018-02-04 17:45:59,417 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:45:59,417 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:45:59,418 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:45:59,418 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:45:59,418 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:45:59,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:45:59,432 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:45:59,437 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:45:59,437 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:45:59,437 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:45:59,438 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 17:45:59,467 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 17:45:59,467 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:45:59,471 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:45:59,474 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 17:45:59,475 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:45:59,479 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-04 17:45:59,479 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:45:59,484 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:45:59,484 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:19 [2018-02-04 17:45:59,508 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:45:59,509 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 19 [2018-02-04 17:45:59,509 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:45:59,520 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:45:59,520 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:45:59,521 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-02-04 17:45:59,521 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:45:59,527 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 17:45:59,527 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:25 [2018-02-04 17:45:59,610 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:45:59,610 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 17:45:59,610 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-02-04 17:45:59,610 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 17:45:59,611 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 17:45:59,611 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-02-04 17:45:59,611 INFO L87 Difference]: Start difference. First operand 52 states and 54 transitions. Second operand 9 states. [2018-02-04 17:45:59,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:45:59,885 INFO L93 Difference]: Finished difference Result 73 states and 75 transitions. [2018-02-04 17:45:59,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-04 17:45:59,886 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2018-02-04 17:45:59,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:45:59,887 INFO L225 Difference]: With dead ends: 73 [2018-02-04 17:45:59,887 INFO L226 Difference]: Without dead ends: 73 [2018-02-04 17:45:59,887 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2018-02-04 17:45:59,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-02-04 17:45:59,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 64. [2018-02-04 17:45:59,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-02-04 17:45:59,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 70 transitions. [2018-02-04 17:45:59,892 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 70 transitions. Word has length 25 [2018-02-04 17:45:59,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:45:59,892 INFO L432 AbstractCegarLoop]: Abstraction has 64 states and 70 transitions. [2018-02-04 17:45:59,892 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 17:45:59,892 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 70 transitions. [2018-02-04 17:45:59,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-02-04 17:45:59,893 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:45:59,893 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:45:59,893 INFO L371 AbstractCegarLoop]: === Iteration 7 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 17:45:59,893 INFO L82 PathProgramCache]: Analyzing trace with hash 1827026138, now seen corresponding path program 3 times [2018-02-04 17:45:59,894 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:45:59,894 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:45:59,895 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:45:59,895 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:45:59,895 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:45:59,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:45:59,907 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:45:59,915 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:45:59,915 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:45:59,915 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:45:59,916 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 17:45:59,935 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-02-04 17:45:59,935 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:45:59,938 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:45:59,946 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-04 17:45:59,946 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:45:59,953 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 17:45:59,953 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:45:59,957 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:45:59,957 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:19 [2018-02-04 17:45:59,972 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:45:59,972 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 19 [2018-02-04 17:45:59,973 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:45:59,988 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:45:59,988 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:45:59,991 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-02-04 17:45:59,991 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:45:59,999 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 17:45:59,999 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:25 [2018-02-04 17:46:00,071 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-02-04 17:46:00,072 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 17:46:00,072 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-02-04 17:46:00,072 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 17:46:00,073 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 17:46:00,073 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2018-02-04 17:46:00,073 INFO L87 Difference]: Start difference. First operand 64 states and 70 transitions. Second operand 9 states. [2018-02-04 17:46:00,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:46:00,297 INFO L93 Difference]: Finished difference Result 65 states and 69 transitions. [2018-02-04 17:46:00,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-04 17:46:00,297 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 29 [2018-02-04 17:46:00,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:46:00,298 INFO L225 Difference]: With dead ends: 65 [2018-02-04 17:46:00,298 INFO L226 Difference]: Without dead ends: 65 [2018-02-04 17:46:00,298 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2018-02-04 17:46:00,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-02-04 17:46:00,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 62. [2018-02-04 17:46:00,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-02-04 17:46:00,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 68 transitions. [2018-02-04 17:46:00,301 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 68 transitions. Word has length 29 [2018-02-04 17:46:00,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:46:00,301 INFO L432 AbstractCegarLoop]: Abstraction has 62 states and 68 transitions. [2018-02-04 17:46:00,301 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 17:46:00,301 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 68 transitions. [2018-02-04 17:46:00,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-02-04 17:46:00,301 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:46:00,301 INFO L351 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:46:00,301 INFO L371 AbstractCegarLoop]: === Iteration 8 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 17:46:00,302 INFO L82 PathProgramCache]: Analyzing trace with hash -1186509351, now seen corresponding path program 1 times [2018-02-04 17:46:00,302 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:46:00,302 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:46:00,302 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:46:00,302 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:46:00,302 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:46:00,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:46:00,309 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:46:00,354 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:46:00,354 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:46:00,354 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:46:00,355 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:46:00,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:46:00,380 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:46:00,421 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:46:00,421 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:46:00,421 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2018-02-04 17:46:00,422 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 17:46:00,422 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 17:46:00,422 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=61, Unknown=0, NotChecked=0, Total=110 [2018-02-04 17:46:00,422 INFO L87 Difference]: Start difference. First operand 62 states and 68 transitions. Second operand 11 states. [2018-02-04 17:46:00,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:46:00,480 INFO L93 Difference]: Finished difference Result 82 states and 84 transitions. [2018-02-04 17:46:00,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 17:46:00,481 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 32 [2018-02-04 17:46:00,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:46:00,482 INFO L225 Difference]: With dead ends: 82 [2018-02-04 17:46:00,482 INFO L226 Difference]: Without dead ends: 82 [2018-02-04 17:46:00,482 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=49, Invalid=61, Unknown=0, NotChecked=0, Total=110 [2018-02-04 17:46:00,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-02-04 17:46:00,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 70. [2018-02-04 17:46:00,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-02-04 17:46:00,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 78 transitions. [2018-02-04 17:46:00,486 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 78 transitions. Word has length 32 [2018-02-04 17:46:00,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:46:00,486 INFO L432 AbstractCegarLoop]: Abstraction has 70 states and 78 transitions. [2018-02-04 17:46:00,486 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 17:46:00,486 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 78 transitions. [2018-02-04 17:46:00,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-02-04 17:46:00,487 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:46:00,487 INFO L351 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:46:00,487 INFO L371 AbstractCegarLoop]: === Iteration 9 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 17:46:00,488 INFO L82 PathProgramCache]: Analyzing trace with hash 547240098, now seen corresponding path program 2 times [2018-02-04 17:46:00,488 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:46:00,488 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:46:00,489 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:46:00,489 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:46:00,489 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:46:00,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:46:00,497 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:46:00,539 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:46:00,539 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:46:00,540 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:46:00,540 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 17:46:00,553 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-02-04 17:46:00,554 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:46:00,557 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:46:00,564 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-04 17:46:00,565 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:46:00,569 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 17:46:00,569 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2018-02-04 17:46:00,636 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-02-04 17:46:00,637 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-02-04 17:46:00,637 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 12 [2018-02-04 17:46:00,637 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-04 17:46:00,637 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-04 17:46:00,638 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2018-02-04 17:46:00,638 INFO L87 Difference]: Start difference. First operand 70 states and 78 transitions. Second operand 12 states. [2018-02-04 17:46:00,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:46:00,895 INFO L93 Difference]: Finished difference Result 89 states and 91 transitions. [2018-02-04 17:46:00,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-04 17:46:00,895 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 36 [2018-02-04 17:46:00,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:46:00,898 INFO L225 Difference]: With dead ends: 89 [2018-02-04 17:46:00,898 INFO L226 Difference]: Without dead ends: 89 [2018-02-04 17:46:00,899 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=115, Invalid=347, Unknown=0, NotChecked=0, Total=462 [2018-02-04 17:46:00,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-02-04 17:46:00,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 70. [2018-02-04 17:46:00,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-02-04 17:46:00,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 76 transitions. [2018-02-04 17:46:00,903 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 76 transitions. Word has length 36 [2018-02-04 17:46:00,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:46:00,903 INFO L432 AbstractCegarLoop]: Abstraction has 70 states and 76 transitions. [2018-02-04 17:46:00,903 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-04 17:46:00,903 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 76 transitions. [2018-02-04 17:46:00,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-02-04 17:46:00,904 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:46:00,904 INFO L351 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:46:00,904 INFO L371 AbstractCegarLoop]: === Iteration 10 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 17:46:00,904 INFO L82 PathProgramCache]: Analyzing trace with hash -645884182, now seen corresponding path program 1 times [2018-02-04 17:46:00,904 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:46:00,905 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:46:00,905 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:46:00,905 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:46:00,905 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:46:00,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:46:00,913 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:46:00,938 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2018-02-04 17:46:00,938 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:46:00,938 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 17:46:00,938 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 17:46:00,939 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 17:46:00,939 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 17:46:00,939 INFO L87 Difference]: Start difference. First operand 70 states and 76 transitions. Second operand 4 states. [2018-02-04 17:46:00,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:46:00,964 INFO L93 Difference]: Finished difference Result 68 states and 71 transitions. [2018-02-04 17:46:00,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 17:46:00,965 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 40 [2018-02-04 17:46:00,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:46:00,965 INFO L225 Difference]: With dead ends: 68 [2018-02-04 17:46:00,965 INFO L226 Difference]: Without dead ends: 68 [2018-02-04 17:46:00,966 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-04 17:46:00,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-02-04 17:46:00,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2018-02-04 17:46:00,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-02-04 17:46:00,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 71 transitions. [2018-02-04 17:46:00,969 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 71 transitions. Word has length 40 [2018-02-04 17:46:00,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:46:00,969 INFO L432 AbstractCegarLoop]: Abstraction has 68 states and 71 transitions. [2018-02-04 17:46:00,969 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 17:46:00,969 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 71 transitions. [2018-02-04 17:46:00,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-02-04 17:46:00,970 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:46:00,970 INFO L351 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:46:00,970 INFO L371 AbstractCegarLoop]: === Iteration 11 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 17:46:00,970 INFO L82 PathProgramCache]: Analyzing trace with hash 1747504322, now seen corresponding path program 1 times [2018-02-04 17:46:00,970 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:46:00,971 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:46:00,971 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:46:00,971 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:46:00,971 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:46:00,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:46:00,979 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:46:01,030 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-04 17:46:01,030 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:46:01,030 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:46:01,031 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:46:01,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:46:01,045 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:46:01,085 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-04 17:46:01,086 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:46:01,086 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2018-02-04 17:46:01,086 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-04 17:46:01,086 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-04 17:46:01,086 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=120, Unknown=0, NotChecked=0, Total=210 [2018-02-04 17:46:01,087 INFO L87 Difference]: Start difference. First operand 68 states and 71 transitions. Second operand 15 states. [2018-02-04 17:46:01,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:46:01,158 INFO L93 Difference]: Finished difference Result 89 states and 90 transitions. [2018-02-04 17:46:01,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 17:46:01,158 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 44 [2018-02-04 17:46:01,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:46:01,158 INFO L225 Difference]: With dead ends: 89 [2018-02-04 17:46:01,158 INFO L226 Difference]: Without dead ends: 89 [2018-02-04 17:46:01,159 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=90, Invalid=120, Unknown=0, NotChecked=0, Total=210 [2018-02-04 17:46:01,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-02-04 17:46:01,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 80. [2018-02-04 17:46:01,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-02-04 17:46:01,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 85 transitions. [2018-02-04 17:46:01,163 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 85 transitions. Word has length 44 [2018-02-04 17:46:01,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:46:01,164 INFO L432 AbstractCegarLoop]: Abstraction has 80 states and 85 transitions. [2018-02-04 17:46:01,164 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-04 17:46:01,164 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 85 transitions. [2018-02-04 17:46:01,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-02-04 17:46:01,165 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:46:01,165 INFO L351 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:46:01,165 INFO L371 AbstractCegarLoop]: === Iteration 12 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 17:46:01,165 INFO L82 PathProgramCache]: Analyzing trace with hash -2024746485, now seen corresponding path program 2 times [2018-02-04 17:46:01,165 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:46:01,165 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:46:01,165 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:46:01,165 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:46:01,165 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:46:01,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:46:01,174 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:46:01,245 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-04 17:46:01,245 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:46:01,245 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:46:01,245 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 17:46:01,262 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 17:46:01,262 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:46:01,265 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:46:01,280 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-04 17:46:01,280 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:46:01,285 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 17:46:01,285 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2018-02-04 17:46:01,408 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2018-02-04 17:46:01,408 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-02-04 17:46:01,408 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [10] total 15 [2018-02-04 17:46:01,409 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-04 17:46:01,409 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-04 17:46:01,409 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2018-02-04 17:46:01,409 INFO L87 Difference]: Start difference. First operand 80 states and 85 transitions. Second operand 15 states. [2018-02-04 17:46:01,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:46:01,795 INFO L93 Difference]: Finished difference Result 93 states and 95 transitions. [2018-02-04 17:46:01,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-02-04 17:46:01,795 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 48 [2018-02-04 17:46:01,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:46:01,796 INFO L225 Difference]: With dead ends: 93 [2018-02-04 17:46:01,796 INFO L226 Difference]: Without dead ends: 93 [2018-02-04 17:46:01,796 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=280, Invalid=712, Unknown=0, NotChecked=0, Total=992 [2018-02-04 17:46:01,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-02-04 17:46:01,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 83. [2018-02-04 17:46:01,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-02-04 17:46:01,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 84 transitions. [2018-02-04 17:46:01,798 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 84 transitions. Word has length 48 [2018-02-04 17:46:01,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:46:01,798 INFO L432 AbstractCegarLoop]: Abstraction has 83 states and 84 transitions. [2018-02-04 17:46:01,798 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-04 17:46:01,799 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 84 transitions. [2018-02-04 17:46:01,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-02-04 17:46:01,804 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:46:01,804 INFO L351 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 7, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:46:01,804 INFO L371 AbstractCegarLoop]: === Iteration 13 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 17:46:01,807 INFO L82 PathProgramCache]: Analyzing trace with hash 221692531, now seen corresponding path program 1 times [2018-02-04 17:46:01,807 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:46:01,807 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:46:01,808 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:46:01,808 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:46:01,808 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:46:01,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:46:01,832 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:46:02,151 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2018-02-04 17:46:02,151 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:46:02,151 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:46:02,152 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:46:02,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:46:02,170 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:46:02,293 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2018-02-04 17:46:02,293 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:46:02,293 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 20 [2018-02-04 17:46:02,293 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-04 17:46:02,293 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-04 17:46:02,294 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=244, Unknown=0, NotChecked=0, Total=380 [2018-02-04 17:46:02,294 INFO L87 Difference]: Start difference. First operand 83 states and 84 transitions. Second operand 20 states. [2018-02-04 17:46:02,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:46:02,421 INFO L93 Difference]: Finished difference Result 99 states and 100 transitions. [2018-02-04 17:46:02,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-04 17:46:02,421 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 77 [2018-02-04 17:46:02,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:46:02,421 INFO L225 Difference]: With dead ends: 99 [2018-02-04 17:46:02,421 INFO L226 Difference]: Without dead ends: 99 [2018-02-04 17:46:02,422 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 69 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=155, Invalid=265, Unknown=0, NotChecked=0, Total=420 [2018-02-04 17:46:02,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-02-04 17:46:02,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 95. [2018-02-04 17:46:02,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-02-04 17:46:02,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 96 transitions. [2018-02-04 17:46:02,424 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 96 transitions. Word has length 77 [2018-02-04 17:46:02,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:46:02,424 INFO L432 AbstractCegarLoop]: Abstraction has 95 states and 96 transitions. [2018-02-04 17:46:02,425 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-04 17:46:02,425 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 96 transitions. [2018-02-04 17:46:02,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-02-04 17:46:02,426 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:46:02,426 INFO L351 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:46:02,426 INFO L371 AbstractCegarLoop]: === Iteration 14 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 17:46:02,426 INFO L82 PathProgramCache]: Analyzing trace with hash -2016762916, now seen corresponding path program 2 times [2018-02-04 17:46:02,426 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:46:02,426 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:46:02,427 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:46:02,427 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:46:02,427 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:46:02,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:46:02,440 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:46:02,537 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 128 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2018-02-04 17:46:02,537 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:46:02,537 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:46:02,538 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 17:46:02,558 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 17:46:02,558 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:46:02,562 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:46:02,585 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 128 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2018-02-04 17:46:02,586 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:46:02,586 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 14 [2018-02-04 17:46:02,586 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-04 17:46:02,586 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-04 17:46:02,587 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2018-02-04 17:46:02,587 INFO L87 Difference]: Start difference. First operand 95 states and 96 transitions. Second operand 14 states. [2018-02-04 17:46:02,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:46:02,722 INFO L93 Difference]: Finished difference Result 107 states and 108 transitions. [2018-02-04 17:46:02,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-04 17:46:02,727 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 89 [2018-02-04 17:46:02,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:46:02,729 INFO L225 Difference]: With dead ends: 107 [2018-02-04 17:46:02,729 INFO L226 Difference]: Without dead ends: 107 [2018-02-04 17:46:02,729 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=179, Invalid=327, Unknown=0, NotChecked=0, Total=506 [2018-02-04 17:46:02,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-02-04 17:46:02,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 103. [2018-02-04 17:46:02,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-02-04 17:46:02,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 104 transitions. [2018-02-04 17:46:02,732 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 104 transitions. Word has length 89 [2018-02-04 17:46:02,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:46:02,732 INFO L432 AbstractCegarLoop]: Abstraction has 103 states and 104 transitions. [2018-02-04 17:46:02,733 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-04 17:46:02,733 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 104 transitions. [2018-02-04 17:46:02,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-02-04 17:46:02,734 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:46:02,734 INFO L351 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:46:02,734 INFO L371 AbstractCegarLoop]: === Iteration 15 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 17:46:02,734 INFO L82 PathProgramCache]: Analyzing trace with hash 1885341628, now seen corresponding path program 3 times [2018-02-04 17:46:02,734 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:46:02,734 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:46:02,735 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:46:02,735 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:46:02,735 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:46:02,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:46:02,746 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:46:02,852 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 0 proven. 162 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2018-02-04 17:46:02,853 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:46:02,853 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:46:02,854 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 17:46:02,891 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-02-04 17:46:02,891 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:46:02,897 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:46:02,917 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 0 proven. 162 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2018-02-04 17:46:02,918 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:46:02,918 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 15 [2018-02-04 17:46:02,919 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-04 17:46:02,919 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-04 17:46:02,920 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=128, Unknown=0, NotChecked=0, Total=210 [2018-02-04 17:46:02,920 INFO L87 Difference]: Start difference. First operand 103 states and 104 transitions. Second operand 15 states. [2018-02-04 17:46:03,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:46:03,184 INFO L93 Difference]: Finished difference Result 115 states and 116 transitions. [2018-02-04 17:46:03,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-04 17:46:03,185 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 97 [2018-02-04 17:46:03,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:46:03,186 INFO L225 Difference]: With dead ends: 115 [2018-02-04 17:46:03,186 INFO L226 Difference]: Without dead ends: 115 [2018-02-04 17:46:03,186 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=213, Invalid=387, Unknown=0, NotChecked=0, Total=600 [2018-02-04 17:46:03,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-02-04 17:46:03,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 111. [2018-02-04 17:46:03,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-02-04 17:46:03,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 112 transitions. [2018-02-04 17:46:03,189 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 112 transitions. Word has length 97 [2018-02-04 17:46:03,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:46:03,189 INFO L432 AbstractCegarLoop]: Abstraction has 111 states and 112 transitions. [2018-02-04 17:46:03,189 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-04 17:46:03,189 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 112 transitions. [2018-02-04 17:46:03,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-02-04 17:46:03,191 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:46:03,191 INFO L351 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:46:03,191 INFO L371 AbstractCegarLoop]: === Iteration 16 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 17:46:03,192 INFO L82 PathProgramCache]: Analyzing trace with hash -984566628, now seen corresponding path program 4 times [2018-02-04 17:46:03,192 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:46:03,192 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:46:03,192 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:46:03,192 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:46:03,193 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:46:03,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:46:03,209 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:46:03,389 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 0 proven. 200 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2018-02-04 17:46:03,389 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:46:03,389 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:46:03,390 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-04 17:46:03,418 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-04 17:46:03,418 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:46:03,423 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:46:03,425 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-04 17:46:03,425 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:46:03,428 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:46:03,428 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-02-04 17:46:03,772 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 200 proven. 200 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:46:03,772 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:46:03,773 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 26] total 39 [2018-02-04 17:46:03,773 INFO L409 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-02-04 17:46:03,773 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-02-04 17:46:03,773 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=338, Invalid=1144, Unknown=0, NotChecked=0, Total=1482 [2018-02-04 17:46:03,773 INFO L87 Difference]: Start difference. First operand 111 states and 112 transitions. Second operand 39 states. [2018-02-04 17:46:04,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:46:04,087 INFO L93 Difference]: Finished difference Result 123 states and 124 transitions. [2018-02-04 17:46:04,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-04 17:46:04,088 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 105 [2018-02-04 17:46:04,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:46:04,088 INFO L225 Difference]: With dead ends: 123 [2018-02-04 17:46:04,088 INFO L226 Difference]: Without dead ends: 123 [2018-02-04 17:46:04,089 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 82 SyntacticMatches, 1 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 909 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=595, Invalid=2161, Unknown=0, NotChecked=0, Total=2756 [2018-02-04 17:46:04,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-02-04 17:46:04,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 119. [2018-02-04 17:46:04,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-02-04 17:46:04,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 120 transitions. [2018-02-04 17:46:04,091 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 120 transitions. Word has length 105 [2018-02-04 17:46:04,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:46:04,091 INFO L432 AbstractCegarLoop]: Abstraction has 119 states and 120 transitions. [2018-02-04 17:46:04,091 INFO L433 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-02-04 17:46:04,091 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 120 transitions. [2018-02-04 17:46:04,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-02-04 17:46:04,092 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:46:04,092 INFO L351 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:46:04,092 INFO L371 AbstractCegarLoop]: === Iteration 17 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 17:46:04,092 INFO L82 PathProgramCache]: Analyzing trace with hash -1299764612, now seen corresponding path program 5 times [2018-02-04 17:46:04,092 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:46:04,092 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:46:04,092 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:46:04,093 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:46:04,093 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:46:04,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:46:04,104 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:46:04,244 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 242 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2018-02-04 17:46:04,244 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:46:04,244 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:46:04,245 INFO L109 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-04 17:46:04,271 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2018-02-04 17:46:04,271 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:46:04,275 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:46:04,293 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 242 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2018-02-04 17:46:04,293 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:46:04,294 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14] total 17 [2018-02-04 17:46:04,294 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-04 17:46:04,294 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-04 17:46:04,295 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=163, Unknown=0, NotChecked=0, Total=272 [2018-02-04 17:46:04,295 INFO L87 Difference]: Start difference. First operand 119 states and 120 transitions. Second operand 17 states. [2018-02-04 17:46:04,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:46:04,437 INFO L93 Difference]: Finished difference Result 131 states and 132 transitions. [2018-02-04 17:46:04,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-04 17:46:04,437 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 113 [2018-02-04 17:46:04,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:46:04,438 INFO L225 Difference]: With dead ends: 131 [2018-02-04 17:46:04,438 INFO L226 Difference]: Without dead ends: 131 [2018-02-04 17:46:04,438 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=290, Invalid=522, Unknown=0, NotChecked=0, Total=812 [2018-02-04 17:46:04,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-02-04 17:46:04,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 127. [2018-02-04 17:46:04,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-02-04 17:46:04,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 128 transitions. [2018-02-04 17:46:04,441 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 128 transitions. Word has length 113 [2018-02-04 17:46:04,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:46:04,441 INFO L432 AbstractCegarLoop]: Abstraction has 127 states and 128 transitions. [2018-02-04 17:46:04,441 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-04 17:46:04,442 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 128 transitions. [2018-02-04 17:46:04,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-02-04 17:46:04,442 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:46:04,443 INFO L351 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:46:04,443 INFO L371 AbstractCegarLoop]: === Iteration 18 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 17:46:04,443 INFO L82 PathProgramCache]: Analyzing trace with hash -1012012708, now seen corresponding path program 6 times [2018-02-04 17:46:04,443 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:46:04,443 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:46:04,444 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:46:04,444 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:46:04,444 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:46:04,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:46:04,452 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:46:04,593 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 0 proven. 288 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2018-02-04 17:46:04,593 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:46:04,593 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:46:04,594 INFO L109 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-02-04 17:46:04,635 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2018-02-04 17:46:04,635 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:46:04,640 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:46:04,670 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 0 proven. 288 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2018-02-04 17:46:04,671 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:46:04,671 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15] total 18 [2018-02-04 17:46:04,671 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-04 17:46:04,672 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-04 17:46:04,672 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=182, Unknown=0, NotChecked=0, Total=306 [2018-02-04 17:46:04,672 INFO L87 Difference]: Start difference. First operand 127 states and 128 transitions. Second operand 18 states. [2018-02-04 17:46:04,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:46:04,854 INFO L93 Difference]: Finished difference Result 139 states and 140 transitions. [2018-02-04 17:46:04,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-04 17:46:04,855 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 121 [2018-02-04 17:46:04,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:46:04,855 INFO L225 Difference]: With dead ends: 139 [2018-02-04 17:46:04,855 INFO L226 Difference]: Without dead ends: 139 [2018-02-04 17:46:04,855 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=333, Invalid=597, Unknown=0, NotChecked=0, Total=930 [2018-02-04 17:46:04,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-02-04 17:46:04,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 135. [2018-02-04 17:46:04,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-02-04 17:46:04,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 136 transitions. [2018-02-04 17:46:04,857 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 136 transitions. Word has length 121 [2018-02-04 17:46:04,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:46:04,857 INFO L432 AbstractCegarLoop]: Abstraction has 135 states and 136 transitions. [2018-02-04 17:46:04,857 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-04 17:46:04,857 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 136 transitions. [2018-02-04 17:46:04,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-02-04 17:46:04,858 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:46:04,858 INFO L351 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:46:04,858 INFO L371 AbstractCegarLoop]: === Iteration 19 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 17:46:04,858 INFO L82 PathProgramCache]: Analyzing trace with hash 70218044, now seen corresponding path program 7 times [2018-02-04 17:46:04,858 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:46:04,858 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:46:04,859 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:46:04,859 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:46:04,859 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:46:04,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:46:04,866 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:46:04,993 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 0 proven. 338 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2018-02-04 17:46:04,993 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:46:04,993 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:46:04,994 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:46:05,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:46:05,011 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:46:05,185 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 0 proven. 338 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2018-02-04 17:46:05,185 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:46:05,185 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17] total 32 [2018-02-04 17:46:05,186 INFO L409 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-02-04 17:46:05,186 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-02-04 17:46:05,187 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=361, Invalid=631, Unknown=0, NotChecked=0, Total=992 [2018-02-04 17:46:05,187 INFO L87 Difference]: Start difference. First operand 135 states and 136 transitions. Second operand 32 states. [2018-02-04 17:46:05,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:46:05,316 INFO L93 Difference]: Finished difference Result 147 states and 148 transitions. [2018-02-04 17:46:05,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-04 17:46:05,316 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 129 [2018-02-04 17:46:05,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:46:05,316 INFO L225 Difference]: With dead ends: 147 [2018-02-04 17:46:05,316 INFO L226 Difference]: Without dead ends: 147 [2018-02-04 17:46:05,317 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 115 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 375 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=392, Invalid=664, Unknown=0, NotChecked=0, Total=1056 [2018-02-04 17:46:05,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-02-04 17:46:05,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 143. [2018-02-04 17:46:05,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-02-04 17:46:05,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 144 transitions. [2018-02-04 17:46:05,318 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 144 transitions. Word has length 129 [2018-02-04 17:46:05,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:46:05,318 INFO L432 AbstractCegarLoop]: Abstraction has 143 states and 144 transitions. [2018-02-04 17:46:05,318 INFO L433 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-02-04 17:46:05,319 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 144 transitions. [2018-02-04 17:46:05,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2018-02-04 17:46:05,319 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:46:05,319 INFO L351 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:46:05,319 INFO L371 AbstractCegarLoop]: === Iteration 20 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 17:46:05,320 INFO L82 PathProgramCache]: Analyzing trace with hash 523649564, now seen corresponding path program 8 times [2018-02-04 17:46:05,320 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:46:05,320 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:46:05,320 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:46:05,320 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:46:05,320 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:46:05,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:46:05,329 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:46:05,457 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 0 proven. 392 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2018-02-04 17:46:05,457 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:46:05,457 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:46:05,458 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 17:46:05,481 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 17:46:05,481 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:46:05,485 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:46:05,514 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 0 proven. 392 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2018-02-04 17:46:05,514 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:46:05,514 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 17] total 20 [2018-02-04 17:46:05,514 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-04 17:46:05,515 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-04 17:46:05,515 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=223, Unknown=0, NotChecked=0, Total=380 [2018-02-04 17:46:05,515 INFO L87 Difference]: Start difference. First operand 143 states and 144 transitions. Second operand 20 states. [2018-02-04 17:46:05,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:46:05,724 INFO L93 Difference]: Finished difference Result 155 states and 156 transitions. [2018-02-04 17:46:05,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-04 17:46:05,725 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 137 [2018-02-04 17:46:05,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:46:05,726 INFO L225 Difference]: With dead ends: 155 [2018-02-04 17:46:05,726 INFO L226 Difference]: Without dead ends: 155 [2018-02-04 17:46:05,726 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=428, Invalid=762, Unknown=0, NotChecked=0, Total=1190 [2018-02-04 17:46:05,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2018-02-04 17:46:05,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 151. [2018-02-04 17:46:05,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-02-04 17:46:05,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 152 transitions. [2018-02-04 17:46:05,729 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 152 transitions. Word has length 137 [2018-02-04 17:46:05,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:46:05,729 INFO L432 AbstractCegarLoop]: Abstraction has 151 states and 152 transitions. [2018-02-04 17:46:05,730 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-04 17:46:05,730 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 152 transitions. [2018-02-04 17:46:05,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2018-02-04 17:46:05,730 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:46:05,731 INFO L351 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:46:05,731 INFO L371 AbstractCegarLoop]: === Iteration 21 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 17:46:05,731 INFO L82 PathProgramCache]: Analyzing trace with hash 2142034940, now seen corresponding path program 9 times [2018-02-04 17:46:05,731 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:46:05,731 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:46:05,731 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:46:05,732 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:46:05,732 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:46:05,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:46:05,747 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:46:05,929 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 0 proven. 450 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked. [2018-02-04 17:46:05,929 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:46:05,929 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:46:05,930 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 17:46:05,964 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2018-02-04 17:46:05,964 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:46:05,969 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:46:06,130 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 0 proven. 450 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked. [2018-02-04 17:46:06,130 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:46:06,130 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19] total 36 [2018-02-04 17:46:06,131 INFO L409 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-02-04 17:46:06,131 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-02-04 17:46:06,131 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=460, Invalid=800, Unknown=0, NotChecked=0, Total=1260 [2018-02-04 17:46:06,131 INFO L87 Difference]: Start difference. First operand 151 states and 152 transitions. Second operand 36 states. [2018-02-04 17:46:06,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:46:06,280 INFO L93 Difference]: Finished difference Result 163 states and 164 transitions. [2018-02-04 17:46:06,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-02-04 17:46:06,280 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 145 [2018-02-04 17:46:06,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:46:06,281 INFO L225 Difference]: With dead ends: 163 [2018-02-04 17:46:06,281 INFO L226 Difference]: Without dead ends: 163 [2018-02-04 17:46:06,281 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 129 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 493 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=495, Invalid=837, Unknown=0, NotChecked=0, Total=1332 [2018-02-04 17:46:06,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2018-02-04 17:46:06,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 159. [2018-02-04 17:46:06,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2018-02-04 17:46:06,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 160 transitions. [2018-02-04 17:46:06,283 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 160 transitions. Word has length 145 [2018-02-04 17:46:06,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:46:06,283 INFO L432 AbstractCegarLoop]: Abstraction has 159 states and 160 transitions. [2018-02-04 17:46:06,283 INFO L433 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-02-04 17:46:06,283 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 160 transitions. [2018-02-04 17:46:06,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2018-02-04 17:46:06,284 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:46:06,284 INFO L351 BasicCegarLoop]: trace histogram [17, 17, 16, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:46:06,284 INFO L371 AbstractCegarLoop]: === Iteration 22 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 17:46:06,284 INFO L82 PathProgramCache]: Analyzing trace with hash 1883094748, now seen corresponding path program 10 times [2018-02-04 17:46:06,284 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:46:06,284 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:46:06,284 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:46:06,284 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:46:06,284 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:46:06,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:46:06,293 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:46:06,474 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 0 proven. 512 refuted. 0 times theorem prover too weak. 512 trivial. 0 not checked. [2018-02-04 17:46:06,474 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:46:06,474 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:46:06,474 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-04 17:46:06,507 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-04 17:46:06,507 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:46:06,513 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:46:06,524 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-04 17:46:06,524 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:46:06,527 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:46:06,527 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-02-04 17:46:07,312 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 512 proven. 512 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:46:07,312 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:46:07,312 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 38] total 57 [2018-02-04 17:46:07,312 INFO L409 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-02-04 17:46:07,313 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-02-04 17:46:07,313 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=722, Invalid=2470, Unknown=0, NotChecked=0, Total=3192 [2018-02-04 17:46:07,313 INFO L87 Difference]: Start difference. First operand 159 states and 160 transitions. Second operand 57 states. [2018-02-04 17:46:07,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:46:07,980 INFO L93 Difference]: Finished difference Result 171 states and 172 transitions. [2018-02-04 17:46:07,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-02-04 17:46:07,982 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 153 [2018-02-04 17:46:07,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:46:07,983 INFO L225 Difference]: With dead ends: 171 [2018-02-04 17:46:07,983 INFO L226 Difference]: Without dead ends: 171 [2018-02-04 17:46:07,984 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 118 SyntacticMatches, 1 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2121 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1264, Invalid=4588, Unknown=0, NotChecked=0, Total=5852 [2018-02-04 17:46:07,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2018-02-04 17:46:07,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 167. [2018-02-04 17:46:07,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2018-02-04 17:46:07,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 168 transitions. [2018-02-04 17:46:07,987 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 168 transitions. Word has length 153 [2018-02-04 17:46:07,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:46:07,988 INFO L432 AbstractCegarLoop]: Abstraction has 167 states and 168 transitions. [2018-02-04 17:46:07,988 INFO L433 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-02-04 17:46:07,988 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 168 transitions. [2018-02-04 17:46:07,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2018-02-04 17:46:07,989 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:46:07,989 INFO L351 BasicCegarLoop]: trace histogram [18, 18, 17, 17, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:46:07,989 INFO L371 AbstractCegarLoop]: === Iteration 23 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 17:46:07,989 INFO L82 PathProgramCache]: Analyzing trace with hash 995322556, now seen corresponding path program 11 times [2018-02-04 17:46:07,989 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:46:07,989 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:46:07,990 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:46:07,990 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:46:07,990 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:46:08,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:46:08,003 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:46:08,237 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 0 proven. 578 refuted. 0 times theorem prover too weak. 578 trivial. 0 not checked. [2018-02-04 17:46:08,237 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:46:08,238 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:46:08,238 INFO L109 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-04 17:46:08,266 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 18 check-sat command(s) [2018-02-04 17:46:08,266 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:46:08,271 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:46:08,296 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 0 proven. 578 refuted. 0 times theorem prover too weak. 578 trivial. 0 not checked. [2018-02-04 17:46:08,296 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:46:08,296 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 20] total 23 [2018-02-04 17:46:08,297 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-04 17:46:08,297 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-04 17:46:08,297 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=214, Invalid=292, Unknown=0, NotChecked=0, Total=506 [2018-02-04 17:46:08,297 INFO L87 Difference]: Start difference. First operand 167 states and 168 transitions. Second operand 23 states. [2018-02-04 17:46:08,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:46:08,570 INFO L93 Difference]: Finished difference Result 179 states and 180 transitions. [2018-02-04 17:46:08,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-04 17:46:08,570 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 161 [2018-02-04 17:46:08,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:46:08,571 INFO L225 Difference]: With dead ends: 179 [2018-02-04 17:46:08,571 INFO L226 Difference]: Without dead ends: 179 [2018-02-04 17:46:08,572 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 179 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 218 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=593, Invalid=1047, Unknown=0, NotChecked=0, Total=1640 [2018-02-04 17:46:08,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2018-02-04 17:46:08,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 175. [2018-02-04 17:46:08,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2018-02-04 17:46:08,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 176 transitions. [2018-02-04 17:46:08,575 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 176 transitions. Word has length 161 [2018-02-04 17:46:08,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:46:08,576 INFO L432 AbstractCegarLoop]: Abstraction has 175 states and 176 transitions. [2018-02-04 17:46:08,576 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-04 17:46:08,576 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 176 transitions. [2018-02-04 17:46:08,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2018-02-04 17:46:08,579 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:46:08,579 INFO L351 BasicCegarLoop]: trace histogram [19, 19, 18, 18, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:46:08,579 INFO L371 AbstractCegarLoop]: === Iteration 24 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 17:46:08,580 INFO L82 PathProgramCache]: Analyzing trace with hash 1259888540, now seen corresponding path program 12 times [2018-02-04 17:46:08,580 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:46:08,580 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:46:08,580 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:46:08,581 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:46:08,581 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:46:08,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:46:08,595 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:46:08,820 INFO L134 CoverageAnalysis]: Checked inductivity of 1296 backedges. 0 proven. 648 refuted. 0 times theorem prover too weak. 648 trivial. 0 not checked. [2018-02-04 17:46:08,820 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:46:08,820 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:46:08,821 INFO L109 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-02-04 17:46:08,864 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2018-02-04 17:46:08,864 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:46:08,873 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:46:09,097 INFO L134 CoverageAnalysis]: Checked inductivity of 1296 backedges. 0 proven. 648 refuted. 0 times theorem prover too weak. 648 trivial. 0 not checked. [2018-02-04 17:46:09,097 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:46:09,097 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22] total 42 [2018-02-04 17:46:09,097 INFO L409 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-02-04 17:46:09,098 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-02-04 17:46:09,098 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=631, Invalid=1091, Unknown=0, NotChecked=0, Total=1722 [2018-02-04 17:46:09,098 INFO L87 Difference]: Start difference. First operand 175 states and 176 transitions. Second operand 42 states. [2018-02-04 17:46:09,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:46:09,225 INFO L93 Difference]: Finished difference Result 187 states and 188 transitions. [2018-02-04 17:46:09,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-04 17:46:09,225 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 169 [2018-02-04 17:46:09,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:46:09,226 INFO L225 Difference]: With dead ends: 187 [2018-02-04 17:46:09,226 INFO L226 Difference]: Without dead ends: 187 [2018-02-04 17:46:09,226 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 150 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 700 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=672, Invalid=1134, Unknown=0, NotChecked=0, Total=1806 [2018-02-04 17:46:09,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2018-02-04 17:46:09,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 183. [2018-02-04 17:46:09,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2018-02-04 17:46:09,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 184 transitions. [2018-02-04 17:46:09,228 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 184 transitions. Word has length 169 [2018-02-04 17:46:09,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:46:09,228 INFO L432 AbstractCegarLoop]: Abstraction has 183 states and 184 transitions. [2018-02-04 17:46:09,228 INFO L433 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-02-04 17:46:09,228 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 184 transitions. [2018-02-04 17:46:09,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2018-02-04 17:46:09,229 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:46:09,229 INFO L351 BasicCegarLoop]: trace histogram [20, 20, 19, 19, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:46:09,229 INFO L371 AbstractCegarLoop]: === Iteration 25 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 17:46:09,229 INFO L82 PathProgramCache]: Analyzing trace with hash 1232543100, now seen corresponding path program 13 times [2018-02-04 17:46:09,229 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:46:09,229 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:46:09,230 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:46:09,230 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:46:09,230 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:46:09,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:46:09,240 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:46:09,447 INFO L134 CoverageAnalysis]: Checked inductivity of 1444 backedges. 0 proven. 722 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked. [2018-02-04 17:46:09,447 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:46:09,447 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:46:09,448 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:46:09,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:46:09,467 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:46:09,685 INFO L134 CoverageAnalysis]: Checked inductivity of 1444 backedges. 0 proven. 722 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked. [2018-02-04 17:46:09,685 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:46:09,686 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 23] total 44 [2018-02-04 17:46:09,686 INFO L409 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-02-04 17:46:09,686 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-02-04 17:46:09,686 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=694, Invalid=1198, Unknown=0, NotChecked=0, Total=1892 [2018-02-04 17:46:09,686 INFO L87 Difference]: Start difference. First operand 183 states and 184 transitions. Second operand 44 states. [2018-02-04 17:46:09,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:46:09,863 INFO L93 Difference]: Finished difference Result 195 states and 196 transitions. [2018-02-04 17:46:09,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-02-04 17:46:09,863 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 177 [2018-02-04 17:46:09,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:46:09,864 INFO L225 Difference]: With dead ends: 195 [2018-02-04 17:46:09,864 INFO L226 Difference]: Without dead ends: 195 [2018-02-04 17:46:09,864 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 157 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 777 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=737, Invalid=1243, Unknown=0, NotChecked=0, Total=1980 [2018-02-04 17:46:09,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2018-02-04 17:46:09,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 191. [2018-02-04 17:46:09,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2018-02-04 17:46:09,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 192 transitions. [2018-02-04 17:46:09,866 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 192 transitions. Word has length 177 [2018-02-04 17:46:09,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:46:09,866 INFO L432 AbstractCegarLoop]: Abstraction has 191 states and 192 transitions. [2018-02-04 17:46:09,866 INFO L433 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-02-04 17:46:09,866 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 192 transitions. [2018-02-04 17:46:09,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2018-02-04 17:46:09,867 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:46:09,867 INFO L351 BasicCegarLoop]: trace histogram [21, 21, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:46:09,867 INFO L371 AbstractCegarLoop]: === Iteration 26 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 17:46:09,867 INFO L82 PathProgramCache]: Analyzing trace with hash 1075455068, now seen corresponding path program 14 times [2018-02-04 17:46:09,867 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:46:09,867 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:46:09,868 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:46:09,868 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:46:09,868 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:46:09,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:46:09,877 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:46:10,098 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 0 proven. 800 refuted. 0 times theorem prover too weak. 800 trivial. 0 not checked. [2018-02-04 17:46:10,099 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:46:10,099 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:46:10,099 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 17:46:10,112 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 17:46:10,112 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:46:10,115 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:46:10,133 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 0 proven. 800 refuted. 0 times theorem prover too weak. 800 trivial. 0 not checked. [2018-02-04 17:46:10,161 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:46:10,161 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 23] total 26 [2018-02-04 17:46:10,162 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-02-04 17:46:10,162 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-02-04 17:46:10,162 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=280, Invalid=370, Unknown=0, NotChecked=0, Total=650 [2018-02-04 17:46:10,162 INFO L87 Difference]: Start difference. First operand 191 states and 192 transitions. Second operand 26 states. [2018-02-04 17:46:10,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:46:10,471 INFO L93 Difference]: Finished difference Result 203 states and 204 transitions. [2018-02-04 17:46:10,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-04 17:46:10,471 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 185 [2018-02-04 17:46:10,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:46:10,472 INFO L225 Difference]: With dead ends: 203 [2018-02-04 17:46:10,472 INFO L226 Difference]: Without dead ends: 203 [2018-02-04 17:46:10,473 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 251 GetRequests, 206 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 287 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=785, Invalid=1377, Unknown=0, NotChecked=0, Total=2162 [2018-02-04 17:46:10,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2018-02-04 17:46:10,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 199. [2018-02-04 17:46:10,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2018-02-04 17:46:10,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 200 transitions. [2018-02-04 17:46:10,476 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 200 transitions. Word has length 185 [2018-02-04 17:46:10,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:46:10,476 INFO L432 AbstractCegarLoop]: Abstraction has 199 states and 200 transitions. [2018-02-04 17:46:10,476 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-02-04 17:46:10,477 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 200 transitions. [2018-02-04 17:46:10,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2018-02-04 17:46:10,477 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:46:10,477 INFO L351 BasicCegarLoop]: trace histogram [22, 22, 21, 21, 21, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:46:10,478 INFO L371 AbstractCegarLoop]: === Iteration 27 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 17:46:10,478 INFO L82 PathProgramCache]: Analyzing trace with hash -1200884676, now seen corresponding path program 15 times [2018-02-04 17:46:10,478 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:46:10,478 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:46:10,478 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:46:10,480 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:46:10,480 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:46:10,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:46:10,495 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:46:10,773 INFO L134 CoverageAnalysis]: Checked inductivity of 1764 backedges. 0 proven. 882 refuted. 0 times theorem prover too weak. 882 trivial. 0 not checked. [2018-02-04 17:46:10,773 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:46:10,773 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:46:10,773 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 17:46:10,801 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2018-02-04 17:46:10,801 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:46:10,808 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:46:11,011 INFO L134 CoverageAnalysis]: Checked inductivity of 1764 backedges. 0 proven. 882 refuted. 0 times theorem prover too weak. 882 trivial. 0 not checked. [2018-02-04 17:46:11,011 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:46:11,012 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 25] total 48 [2018-02-04 17:46:11,012 INFO L409 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-02-04 17:46:11,012 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-02-04 17:46:11,013 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=829, Invalid=1427, Unknown=0, NotChecked=0, Total=2256 [2018-02-04 17:46:11,013 INFO L87 Difference]: Start difference. First operand 199 states and 200 transitions. Second operand 48 states. [2018-02-04 17:46:11,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:46:11,195 INFO L93 Difference]: Finished difference Result 211 states and 212 transitions. [2018-02-04 17:46:11,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-02-04 17:46:11,195 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 193 [2018-02-04 17:46:11,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:46:11,196 INFO L225 Difference]: With dead ends: 211 [2018-02-04 17:46:11,196 INFO L226 Difference]: Without dead ends: 211 [2018-02-04 17:46:11,196 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 171 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 943 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=876, Invalid=1476, Unknown=0, NotChecked=0, Total=2352 [2018-02-04 17:46:11,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2018-02-04 17:46:11,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 207. [2018-02-04 17:46:11,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2018-02-04 17:46:11,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 208 transitions. [2018-02-04 17:46:11,199 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 208 transitions. Word has length 193 [2018-02-04 17:46:11,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:46:11,200 INFO L432 AbstractCegarLoop]: Abstraction has 207 states and 208 transitions. [2018-02-04 17:46:11,200 INFO L433 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-02-04 17:46:11,200 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 208 transitions. [2018-02-04 17:46:11,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2018-02-04 17:46:11,201 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:46:11,201 INFO L351 BasicCegarLoop]: trace histogram [23, 23, 22, 22, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:46:11,201 INFO L371 AbstractCegarLoop]: === Iteration 28 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 17:46:11,201 INFO L82 PathProgramCache]: Analyzing trace with hash -610857700, now seen corresponding path program 16 times [2018-02-04 17:46:11,201 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:46:11,201 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:46:11,202 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:46:11,202 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:46:11,202 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:46:11,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:46:11,219 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:46:11,555 INFO L134 CoverageAnalysis]: Checked inductivity of 1936 backedges. 0 proven. 968 refuted. 0 times theorem prover too weak. 968 trivial. 0 not checked. [2018-02-04 17:46:11,555 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:46:11,555 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:46:11,556 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-04 17:46:11,592 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-04 17:46:11,592 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:46:11,602 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:46:11,618 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-04 17:46:11,618 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:46:11,621 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:46:11,622 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-02-04 17:46:12,651 INFO L134 CoverageAnalysis]: Checked inductivity of 1936 backedges. 968 proven. 968 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:46:12,651 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:46:12,652 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 50] total 75 [2018-02-04 17:46:12,652 INFO L409 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-02-04 17:46:12,652 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-02-04 17:46:12,653 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1250, Invalid=4300, Unknown=0, NotChecked=0, Total=5550 [2018-02-04 17:46:12,653 INFO L87 Difference]: Start difference. First operand 207 states and 208 transitions. Second operand 75 states. [2018-02-04 17:46:13,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:46:13,208 INFO L93 Difference]: Finished difference Result 219 states and 220 transitions. [2018-02-04 17:46:13,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-02-04 17:46:13,209 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 201 [2018-02-04 17:46:13,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:46:13,209 INFO L225 Difference]: With dead ends: 219 [2018-02-04 17:46:13,209 INFO L226 Difference]: Without dead ends: 219 [2018-02-04 17:46:13,211 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 154 SyntacticMatches, 1 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3837 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=2185, Invalid=7915, Unknown=0, NotChecked=0, Total=10100 [2018-02-04 17:46:13,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2018-02-04 17:46:13,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 215. [2018-02-04 17:46:13,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2018-02-04 17:46:13,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 216 transitions. [2018-02-04 17:46:13,213 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 216 transitions. Word has length 201 [2018-02-04 17:46:13,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:46:13,214 INFO L432 AbstractCegarLoop]: Abstraction has 215 states and 216 transitions. [2018-02-04 17:46:13,214 INFO L433 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-02-04 17:46:13,214 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 216 transitions. [2018-02-04 17:46:13,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2018-02-04 17:46:13,214 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:46:13,214 INFO L351 BasicCegarLoop]: trace histogram [24, 24, 23, 23, 23, 23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:46:13,214 INFO L371 AbstractCegarLoop]: === Iteration 29 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 17:46:13,214 INFO L82 PathProgramCache]: Analyzing trace with hash -1836716292, now seen corresponding path program 17 times [2018-02-04 17:46:13,215 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:46:13,215 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:46:13,215 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:46:13,215 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:46:13,215 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:46:13,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:46:13,226 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:46:13,512 INFO L134 CoverageAnalysis]: Checked inductivity of 2116 backedges. 0 proven. 1058 refuted. 0 times theorem prover too weak. 1058 trivial. 0 not checked. [2018-02-04 17:46:13,512 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:46:13,512 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:46:13,513 INFO L109 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-04 17:46:13,546 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2018-02-04 17:46:13,546 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:46:13,551 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:46:13,597 INFO L134 CoverageAnalysis]: Checked inductivity of 2116 backedges. 0 proven. 1058 refuted. 0 times theorem prover too weak. 1058 trivial. 0 not checked. [2018-02-04 17:46:13,598 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:46:13,598 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 26] total 29 [2018-02-04 17:46:13,598 INFO L409 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-02-04 17:46:13,598 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-02-04 17:46:13,599 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=355, Invalid=457, Unknown=0, NotChecked=0, Total=812 [2018-02-04 17:46:13,599 INFO L87 Difference]: Start difference. First operand 215 states and 216 transitions. Second operand 29 states. [2018-02-04 17:46:14,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:46:14,042 INFO L93 Difference]: Finished difference Result 227 states and 228 transitions. [2018-02-04 17:46:14,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-02-04 17:46:14,043 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 209 [2018-02-04 17:46:14,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:46:14,044 INFO L225 Difference]: With dead ends: 227 [2018-02-04 17:46:14,044 INFO L226 Difference]: Without dead ends: 227 [2018-02-04 17:46:14,044 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 284 GetRequests, 233 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 365 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=1004, Invalid=1752, Unknown=0, NotChecked=0, Total=2756 [2018-02-04 17:46:14,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2018-02-04 17:46:14,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 223. [2018-02-04 17:46:14,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2018-02-04 17:46:14,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 224 transitions. [2018-02-04 17:46:14,049 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 224 transitions. Word has length 209 [2018-02-04 17:46:14,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:46:14,049 INFO L432 AbstractCegarLoop]: Abstraction has 223 states and 224 transitions. [2018-02-04 17:46:14,049 INFO L433 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-02-04 17:46:14,049 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 224 transitions. [2018-02-04 17:46:14,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2018-02-04 17:46:14,050 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:46:14,050 INFO L351 BasicCegarLoop]: trace histogram [25, 25, 24, 24, 24, 24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:46:14,050 INFO L371 AbstractCegarLoop]: === Iteration 30 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 17:46:14,051 INFO L82 PathProgramCache]: Analyzing trace with hash -1511843364, now seen corresponding path program 18 times [2018-02-04 17:46:14,051 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:46:14,051 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:46:14,051 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:46:14,051 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:46:14,051 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:46:14,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:46:14,068 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:46:14,473 INFO L134 CoverageAnalysis]: Checked inductivity of 2304 backedges. 0 proven. 1152 refuted. 0 times theorem prover too weak. 1152 trivial. 0 not checked. [2018-02-04 17:46:14,473 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:46:14,473 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:46:14,474 INFO L109 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-02-04 17:46:14,528 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 25 check-sat command(s) [2018-02-04 17:46:14,528 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:46:14,536 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:46:14,768 INFO L134 CoverageAnalysis]: Checked inductivity of 2304 backedges. 0 proven. 1152 refuted. 0 times theorem prover too weak. 1152 trivial. 0 not checked. [2018-02-04 17:46:14,769 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:46:14,769 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 28] total 54 [2018-02-04 17:46:14,769 INFO L409 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-02-04 17:46:14,769 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-02-04 17:46:14,770 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1054, Invalid=1808, Unknown=0, NotChecked=0, Total=2862 [2018-02-04 17:46:14,770 INFO L87 Difference]: Start difference. First operand 223 states and 224 transitions. Second operand 54 states. [2018-02-04 17:46:14,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:46:14,969 INFO L93 Difference]: Finished difference Result 235 states and 236 transitions. [2018-02-04 17:46:14,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-02-04 17:46:14,969 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 217 [2018-02-04 17:46:14,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:46:14,969 INFO L225 Difference]: With dead ends: 235 [2018-02-04 17:46:14,969 INFO L226 Difference]: Without dead ends: 235 [2018-02-04 17:46:14,970 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 192 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1222 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=1107, Invalid=1863, Unknown=0, NotChecked=0, Total=2970 [2018-02-04 17:46:14,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2018-02-04 17:46:14,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 231. [2018-02-04 17:46:14,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2018-02-04 17:46:14,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 232 transitions. [2018-02-04 17:46:14,972 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 232 transitions. Word has length 217 [2018-02-04 17:46:14,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:46:14,972 INFO L432 AbstractCegarLoop]: Abstraction has 231 states and 232 transitions. [2018-02-04 17:46:14,972 INFO L433 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-02-04 17:46:14,972 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 232 transitions. [2018-02-04 17:46:14,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2018-02-04 17:46:14,972 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:46:14,972 INFO L351 BasicCegarLoop]: trace histogram [26, 26, 25, 25, 25, 25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:46:14,973 INFO L371 AbstractCegarLoop]: === Iteration 31 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 17:46:14,973 INFO L82 PathProgramCache]: Analyzing trace with hash -568783428, now seen corresponding path program 19 times [2018-02-04 17:46:14,973 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:46:14,973 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:46:14,973 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:46:14,973 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:46:14,973 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:46:14,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:46:14,991 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:46:15,336 INFO L134 CoverageAnalysis]: Checked inductivity of 2500 backedges. 0 proven. 1250 refuted. 0 times theorem prover too weak. 1250 trivial. 0 not checked. [2018-02-04 17:46:15,337 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:46:15,337 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:46:15,337 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:46:15,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:46:15,352 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:46:15,684 INFO L134 CoverageAnalysis]: Checked inductivity of 2500 backedges. 0 proven. 1250 refuted. 0 times theorem prover too weak. 1250 trivial. 0 not checked. [2018-02-04 17:46:15,684 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:46:15,684 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 29] total 56 [2018-02-04 17:46:15,685 INFO L409 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-02-04 17:46:15,685 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-02-04 17:46:15,685 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1135, Invalid=1945, Unknown=0, NotChecked=0, Total=3080 [2018-02-04 17:46:15,685 INFO L87 Difference]: Start difference. First operand 231 states and 232 transitions. Second operand 56 states. [2018-02-04 17:46:15,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:46:15,864 INFO L93 Difference]: Finished difference Result 243 states and 244 transitions. [2018-02-04 17:46:15,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-02-04 17:46:15,864 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 225 [2018-02-04 17:46:15,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:46:15,865 INFO L225 Difference]: With dead ends: 243 [2018-02-04 17:46:15,865 INFO L226 Difference]: Without dead ends: 243 [2018-02-04 17:46:15,865 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 199 SyntacticMatches, 1 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1323 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=1190, Invalid=2002, Unknown=0, NotChecked=0, Total=3192 [2018-02-04 17:46:15,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2018-02-04 17:46:15,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 239. [2018-02-04 17:46:15,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 239 states. [2018-02-04 17:46:15,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 240 transitions. [2018-02-04 17:46:15,867 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 240 transitions. Word has length 225 [2018-02-04 17:46:15,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:46:15,867 INFO L432 AbstractCegarLoop]: Abstraction has 239 states and 240 transitions. [2018-02-04 17:46:15,867 INFO L433 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-02-04 17:46:15,867 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 240 transitions. [2018-02-04 17:46:15,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2018-02-04 17:46:15,868 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:46:15,868 INFO L351 BasicCegarLoop]: trace histogram [27, 27, 26, 26, 26, 26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:46:15,868 INFO L371 AbstractCegarLoop]: === Iteration 32 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 17:46:15,868 INFO L82 PathProgramCache]: Analyzing trace with hash 592595612, now seen corresponding path program 20 times [2018-02-04 17:46:15,868 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:46:15,868 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:46:15,869 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:46:15,869 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:46:15,869 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:46:15,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:46:15,880 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:46:16,205 INFO L134 CoverageAnalysis]: Checked inductivity of 2704 backedges. 0 proven. 1352 refuted. 0 times theorem prover too weak. 1352 trivial. 0 not checked. [2018-02-04 17:46:16,205 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:46:16,205 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:46:16,206 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 17:46:16,221 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 17:46:16,221 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:46:16,226 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:46:16,260 INFO L134 CoverageAnalysis]: Checked inductivity of 2704 backedges. 0 proven. 1352 refuted. 0 times theorem prover too weak. 1352 trivial. 0 not checked. [2018-02-04 17:46:16,260 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:46:16,260 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 29] total 32 [2018-02-04 17:46:16,261 INFO L409 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-02-04 17:46:16,261 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-02-04 17:46:16,261 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=439, Invalid=553, Unknown=0, NotChecked=0, Total=992 [2018-02-04 17:46:16,261 INFO L87 Difference]: Start difference. First operand 239 states and 240 transitions. Second operand 32 states. [2018-02-04 17:46:16,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:46:16,622 INFO L93 Difference]: Finished difference Result 251 states and 252 transitions. [2018-02-04 17:46:16,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-02-04 17:46:16,622 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 233 [2018-02-04 17:46:16,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:46:16,622 INFO L225 Difference]: With dead ends: 251 [2018-02-04 17:46:16,623 INFO L226 Difference]: Without dead ends: 251 [2018-02-04 17:46:16,623 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 317 GetRequests, 260 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 452 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=1250, Invalid=2172, Unknown=0, NotChecked=0, Total=3422 [2018-02-04 17:46:16,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2018-02-04 17:46:16,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 247. [2018-02-04 17:46:16,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2018-02-04 17:46:16,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 248 transitions. [2018-02-04 17:46:16,625 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 248 transitions. Word has length 233 [2018-02-04 17:46:16,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:46:16,626 INFO L432 AbstractCegarLoop]: Abstraction has 247 states and 248 transitions. [2018-02-04 17:46:16,626 INFO L433 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-02-04 17:46:16,626 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 248 transitions. [2018-02-04 17:46:16,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2018-02-04 17:46:16,627 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:46:16,627 INFO L351 BasicCegarLoop]: trace histogram [28, 28, 27, 27, 27, 27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:46:16,627 INFO L371 AbstractCegarLoop]: === Iteration 33 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 17:46:16,627 INFO L82 PathProgramCache]: Analyzing trace with hash -1652993924, now seen corresponding path program 21 times [2018-02-04 17:46:16,627 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:46:16,627 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:46:16,628 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:46:16,628 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:46:16,628 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:46:16,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:46:16,647 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:46:17,085 INFO L134 CoverageAnalysis]: Checked inductivity of 2916 backedges. 0 proven. 1458 refuted. 0 times theorem prover too weak. 1458 trivial. 0 not checked. [2018-02-04 17:46:17,085 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:46:17,085 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:46:17,085 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 17:46:17,137 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2018-02-04 17:46:17,137 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:46:17,149 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:46:17,549 INFO L134 CoverageAnalysis]: Checked inductivity of 2916 backedges. 0 proven. 1458 refuted. 0 times theorem prover too weak. 1458 trivial. 0 not checked. [2018-02-04 17:46:17,549 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:46:17,549 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 31] total 60 [2018-02-04 17:46:17,550 INFO L409 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-02-04 17:46:17,550 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-02-04 17:46:17,550 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1306, Invalid=2234, Unknown=0, NotChecked=0, Total=3540 [2018-02-04 17:46:17,550 INFO L87 Difference]: Start difference. First operand 247 states and 248 transitions. Second operand 60 states. [2018-02-04 17:46:17,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:46:17,872 INFO L93 Difference]: Finished difference Result 259 states and 260 transitions. [2018-02-04 17:46:17,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-02-04 17:46:17,873 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 241 [2018-02-04 17:46:17,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:46:17,873 INFO L225 Difference]: With dead ends: 259 [2018-02-04 17:46:17,873 INFO L226 Difference]: Without dead ends: 259 [2018-02-04 17:46:17,874 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 213 SyntacticMatches, 1 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1537 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=1365, Invalid=2295, Unknown=0, NotChecked=0, Total=3660 [2018-02-04 17:46:17,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2018-02-04 17:46:17,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 255. [2018-02-04 17:46:17,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2018-02-04 17:46:17,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 256 transitions. [2018-02-04 17:46:17,876 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 256 transitions. Word has length 241 [2018-02-04 17:46:17,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:46:17,876 INFO L432 AbstractCegarLoop]: Abstraction has 255 states and 256 transitions. [2018-02-04 17:46:17,876 INFO L433 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-02-04 17:46:17,877 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 256 transitions. [2018-02-04 17:46:17,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2018-02-04 17:46:17,877 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:46:17,877 INFO L351 BasicCegarLoop]: trace histogram [29, 29, 28, 28, 28, 28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:46:17,877 INFO L371 AbstractCegarLoop]: === Iteration 34 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 17:46:17,877 INFO L82 PathProgramCache]: Analyzing trace with hash -734486692, now seen corresponding path program 22 times [2018-02-04 17:46:17,878 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:46:17,878 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:46:17,878 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:46:17,878 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:46:17,878 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:46:17,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:46:17,891 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:46:18,304 INFO L134 CoverageAnalysis]: Checked inductivity of 3136 backedges. 0 proven. 1568 refuted. 0 times theorem prover too weak. 1568 trivial. 0 not checked. [2018-02-04 17:46:18,304 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:46:18,305 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:46:18,305 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-04 17:46:18,336 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-04 17:46:18,336 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:46:18,345 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:46:18,347 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-04 17:46:18,347 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:46:18,350 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:46:18,350 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-02-04 17:46:19,620 INFO L134 CoverageAnalysis]: Checked inductivity of 3136 backedges. 1568 proven. 1568 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:46:19,620 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:46:19,621 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 62] total 93 [2018-02-04 17:46:19,621 INFO L409 AbstractCegarLoop]: Interpolant automaton has 93 states [2018-02-04 17:46:19,621 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2018-02-04 17:46:19,622 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1922, Invalid=6634, Unknown=0, NotChecked=0, Total=8556 [2018-02-04 17:46:19,622 INFO L87 Difference]: Start difference. First operand 255 states and 256 transitions. Second operand 93 states. [2018-02-04 17:46:20,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:46:20,420 INFO L93 Difference]: Finished difference Result 267 states and 268 transitions. [2018-02-04 17:46:20,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-02-04 17:46:20,420 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 249 [2018-02-04 17:46:20,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:46:20,421 INFO L225 Difference]: With dead ends: 267 [2018-02-04 17:46:20,421 INFO L226 Difference]: Without dead ends: 267 [2018-02-04 17:46:20,422 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 314 GetRequests, 190 SyntacticMatches, 1 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6057 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=3358, Invalid=12142, Unknown=0, NotChecked=0, Total=15500 [2018-02-04 17:46:20,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2018-02-04 17:46:20,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 263. [2018-02-04 17:46:20,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2018-02-04 17:46:20,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 264 transitions. [2018-02-04 17:46:20,424 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 264 transitions. Word has length 249 [2018-02-04 17:46:20,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:46:20,424 INFO L432 AbstractCegarLoop]: Abstraction has 263 states and 264 transitions. [2018-02-04 17:46:20,424 INFO L433 AbstractCegarLoop]: Interpolant automaton has 93 states. [2018-02-04 17:46:20,424 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 264 transitions. [2018-02-04 17:46:20,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2018-02-04 17:46:20,425 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:46:20,425 INFO L351 BasicCegarLoop]: trace histogram [30, 30, 29, 29, 29, 29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:46:20,425 INFO L371 AbstractCegarLoop]: === Iteration 35 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 17:46:20,425 INFO L82 PathProgramCache]: Analyzing trace with hash -822429892, now seen corresponding path program 23 times [2018-02-04 17:46:20,426 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:46:20,426 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:46:20,426 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:46:20,426 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:46:20,426 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:46:20,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:46:20,439 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:46:20,784 INFO L134 CoverageAnalysis]: Checked inductivity of 3364 backedges. 0 proven. 1682 refuted. 0 times theorem prover too weak. 1682 trivial. 0 not checked. [2018-02-04 17:46:20,784 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:46:20,785 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:46:20,785 INFO L109 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-04 17:46:20,816 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 30 check-sat command(s) [2018-02-04 17:46:20,816 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:46:20,820 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:46:20,862 INFO L134 CoverageAnalysis]: Checked inductivity of 3364 backedges. 0 proven. 1682 refuted. 0 times theorem prover too weak. 1682 trivial. 0 not checked. [2018-02-04 17:46:20,863 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:46:20,863 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 32] total 35 [2018-02-04 17:46:20,863 INFO L409 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-02-04 17:46:20,864 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-02-04 17:46:20,864 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=532, Invalid=658, Unknown=0, NotChecked=0, Total=1190 [2018-02-04 17:46:20,864 INFO L87 Difference]: Start difference. First operand 263 states and 264 transitions. Second operand 35 states. [2018-02-04 17:46:21,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:46:21,365 INFO L93 Difference]: Finished difference Result 275 states and 276 transitions. [2018-02-04 17:46:21,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-02-04 17:46:21,365 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 257 [2018-02-04 17:46:21,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:46:21,366 INFO L225 Difference]: With dead ends: 275 [2018-02-04 17:46:21,366 INFO L226 Difference]: Without dead ends: 275 [2018-02-04 17:46:21,366 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 350 GetRequests, 287 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 548 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=1523, Invalid=2637, Unknown=0, NotChecked=0, Total=4160 [2018-02-04 17:46:21,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2018-02-04 17:46:21,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 271. [2018-02-04 17:46:21,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2018-02-04 17:46:21,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 272 transitions. [2018-02-04 17:46:21,368 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 272 transitions. Word has length 257 [2018-02-04 17:46:21,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:46:21,368 INFO L432 AbstractCegarLoop]: Abstraction has 271 states and 272 transitions. [2018-02-04 17:46:21,369 INFO L433 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-02-04 17:46:21,369 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 272 transitions. [2018-02-04 17:46:21,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2018-02-04 17:46:21,369 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:46:21,370 INFO L351 BasicCegarLoop]: trace histogram [31, 31, 30, 30, 30, 30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:46:21,370 INFO L371 AbstractCegarLoop]: === Iteration 36 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 17:46:21,370 INFO L82 PathProgramCache]: Analyzing trace with hash 887756828, now seen corresponding path program 24 times [2018-02-04 17:46:21,370 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:46:21,370 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:46:21,370 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:46:21,370 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:46:21,370 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:46:21,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:46:21,383 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:46:21,767 INFO L134 CoverageAnalysis]: Checked inductivity of 3600 backedges. 0 proven. 1800 refuted. 0 times theorem prover too weak. 1800 trivial. 0 not checked. [2018-02-04 17:46:21,767 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:46:21,767 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:46:21,767 INFO L109 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-02-04 17:46:21,808 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 31 check-sat command(s) [2018-02-04 17:46:21,808 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:46:21,817 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:46:22,312 INFO L134 CoverageAnalysis]: Checked inductivity of 3600 backedges. 0 proven. 1800 refuted. 0 times theorem prover too weak. 1800 trivial. 0 not checked. [2018-02-04 17:46:22,312 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:46:22,313 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 34] total 66 [2018-02-04 17:46:22,313 INFO L409 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-02-04 17:46:22,313 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-02-04 17:46:22,314 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1585, Invalid=2705, Unknown=0, NotChecked=0, Total=4290 [2018-02-04 17:46:22,314 INFO L87 Difference]: Start difference. First operand 271 states and 272 transitions. Second operand 66 states. [2018-02-04 17:46:22,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:46:22,587 INFO L93 Difference]: Finished difference Result 283 states and 284 transitions. [2018-02-04 17:46:22,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-02-04 17:46:22,587 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 265 [2018-02-04 17:46:22,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:46:22,588 INFO L225 Difference]: With dead ends: 283 [2018-02-04 17:46:22,588 INFO L226 Difference]: Without dead ends: 283 [2018-02-04 17:46:22,589 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 300 GetRequests, 234 SyntacticMatches, 1 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1888 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1650, Invalid=2772, Unknown=0, NotChecked=0, Total=4422 [2018-02-04 17:46:22,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2018-02-04 17:46:22,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 279. [2018-02-04 17:46:22,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 279 states. [2018-02-04 17:46:22,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 280 transitions. [2018-02-04 17:46:22,592 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 280 transitions. Word has length 265 [2018-02-04 17:46:22,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:46:22,592 INFO L432 AbstractCegarLoop]: Abstraction has 279 states and 280 transitions. [2018-02-04 17:46:22,593 INFO L433 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-02-04 17:46:22,593 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 280 transitions. [2018-02-04 17:46:22,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2018-02-04 17:46:22,594 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:46:22,594 INFO L351 BasicCegarLoop]: trace histogram [32, 32, 31, 31, 31, 31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:46:22,594 INFO L371 AbstractCegarLoop]: === Iteration 37 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 17:46:22,594 INFO L82 PathProgramCache]: Analyzing trace with hash 1827750396, now seen corresponding path program 25 times [2018-02-04 17:46:22,594 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:46:22,594 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:46:22,595 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:46:22,595 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:46:22,595 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:46:22,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:46:22,612 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:46:23,019 INFO L134 CoverageAnalysis]: Checked inductivity of 3844 backedges. 0 proven. 1922 refuted. 0 times theorem prover too weak. 1922 trivial. 0 not checked. [2018-02-04 17:46:23,020 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:46:23,020 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:46:23,020 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:46:23,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:46:23,037 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:46:23,403 INFO L134 CoverageAnalysis]: Checked inductivity of 3844 backedges. 0 proven. 1922 refuted. 0 times theorem prover too weak. 1922 trivial. 0 not checked. [2018-02-04 17:46:23,404 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:46:23,404 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 35] total 68 [2018-02-04 17:46:23,404 INFO L409 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-02-04 17:46:23,404 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-02-04 17:46:23,405 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1684, Invalid=2872, Unknown=0, NotChecked=0, Total=4556 [2018-02-04 17:46:23,405 INFO L87 Difference]: Start difference. First operand 279 states and 280 transitions. Second operand 68 states. [2018-02-04 17:46:23,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:46:23,644 INFO L93 Difference]: Finished difference Result 291 states and 292 transitions. [2018-02-04 17:46:23,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-02-04 17:46:23,644 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 273 [2018-02-04 17:46:23,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:46:23,645 INFO L225 Difference]: With dead ends: 291 [2018-02-04 17:46:23,645 INFO L226 Difference]: Without dead ends: 291 [2018-02-04 17:46:23,645 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 309 GetRequests, 241 SyntacticMatches, 1 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2013 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=1751, Invalid=2941, Unknown=0, NotChecked=0, Total=4692 [2018-02-04 17:46:23,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2018-02-04 17:46:23,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 287. [2018-02-04 17:46:23,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 287 states. [2018-02-04 17:46:23,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 288 transitions. [2018-02-04 17:46:23,649 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 288 transitions. Word has length 273 [2018-02-04 17:46:23,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:46:23,649 INFO L432 AbstractCegarLoop]: Abstraction has 287 states and 288 transitions. [2018-02-04 17:46:23,649 INFO L433 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-02-04 17:46:23,649 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 288 transitions. [2018-02-04 17:46:23,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 282 [2018-02-04 17:46:23,651 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:46:23,651 INFO L351 BasicCegarLoop]: trace histogram [33, 33, 32, 32, 32, 32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:46:23,651 INFO L371 AbstractCegarLoop]: === Iteration 38 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 17:46:23,651 INFO L82 PathProgramCache]: Analyzing trace with hash -1111837476, now seen corresponding path program 26 times [2018-02-04 17:46:23,651 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:46:23,651 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:46:23,652 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:46:23,652 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:46:23,652 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:46:23,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:46:23,677 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:46:24,257 INFO L134 CoverageAnalysis]: Checked inductivity of 4096 backedges. 0 proven. 2048 refuted. 0 times theorem prover too weak. 2048 trivial. 0 not checked. [2018-02-04 17:46:24,257 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:46:24,257 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:46:24,258 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 17:46:24,276 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 17:46:24,276 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:46:24,280 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:46:24,344 INFO L134 CoverageAnalysis]: Checked inductivity of 4096 backedges. 0 proven. 2048 refuted. 0 times theorem prover too weak. 2048 trivial. 0 not checked. [2018-02-04 17:46:24,345 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:46:24,345 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 35] total 38 [2018-02-04 17:46:24,346 INFO L409 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-02-04 17:46:24,346 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-02-04 17:46:24,346 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=634, Invalid=772, Unknown=0, NotChecked=0, Total=1406 [2018-02-04 17:46:24,346 INFO L87 Difference]: Start difference. First operand 287 states and 288 transitions. Second operand 38 states. [2018-02-04 17:46:24,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:46:24,817 INFO L93 Difference]: Finished difference Result 299 states and 300 transitions. [2018-02-04 17:46:24,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-02-04 17:46:24,817 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 281 [2018-02-04 17:46:24,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:46:24,818 INFO L225 Difference]: With dead ends: 299 [2018-02-04 17:46:24,818 INFO L226 Difference]: Without dead ends: 299 [2018-02-04 17:46:24,818 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 383 GetRequests, 314 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 653 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1823, Invalid=3147, Unknown=0, NotChecked=0, Total=4970 [2018-02-04 17:46:24,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2018-02-04 17:46:24,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 295. [2018-02-04 17:46:24,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 295 states. [2018-02-04 17:46:24,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 296 transitions. [2018-02-04 17:46:24,820 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 296 transitions. Word has length 281 [2018-02-04 17:46:24,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:46:24,820 INFO L432 AbstractCegarLoop]: Abstraction has 295 states and 296 transitions. [2018-02-04 17:46:24,821 INFO L433 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-02-04 17:46:24,821 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 296 transitions. [2018-02-04 17:46:24,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 290 [2018-02-04 17:46:24,821 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:46:24,821 INFO L351 BasicCegarLoop]: trace histogram [34, 34, 33, 33, 33, 33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:46:24,821 INFO L371 AbstractCegarLoop]: === Iteration 39 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 17:46:24,822 INFO L82 PathProgramCache]: Analyzing trace with hash 1840312508, now seen corresponding path program 27 times [2018-02-04 17:46:24,822 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:46:24,822 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:46:24,822 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:46:24,822 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:46:24,822 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:46:24,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:46:24,838 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:46:25,269 INFO L134 CoverageAnalysis]: Checked inductivity of 4356 backedges. 0 proven. 2178 refuted. 0 times theorem prover too weak. 2178 trivial. 0 not checked. [2018-02-04 17:46:25,269 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:46:25,269 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:46:25,270 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 17:46:25,305 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 34 check-sat command(s) [2018-02-04 17:46:25,305 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:46:25,313 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:46:25,376 INFO L134 CoverageAnalysis]: Checked inductivity of 4356 backedges. 0 proven. 2178 refuted. 0 times theorem prover too weak. 2178 trivial. 0 not checked. [2018-02-04 17:46:25,376 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:46:25,376 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 36] total 39 [2018-02-04 17:46:25,377 INFO L409 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-02-04 17:46:25,377 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-02-04 17:46:25,377 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=670, Invalid=812, Unknown=0, NotChecked=0, Total=1482 [2018-02-04 17:46:25,377 INFO L87 Difference]: Start difference. First operand 295 states and 296 transitions. Second operand 39 states. [2018-02-04 17:46:25,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:46:25,861 INFO L93 Difference]: Finished difference Result 307 states and 308 transitions. [2018-02-04 17:46:25,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-02-04 17:46:25,861 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 289 [2018-02-04 17:46:25,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:46:25,862 INFO L225 Difference]: With dead ends: 307 [2018-02-04 17:46:25,862 INFO L226 Difference]: Without dead ends: 307 [2018-02-04 17:46:25,862 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 394 GetRequests, 323 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 690 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=1929, Invalid=3327, Unknown=0, NotChecked=0, Total=5256 [2018-02-04 17:46:25,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2018-02-04 17:46:25,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 303. [2018-02-04 17:46:25,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 303 states. [2018-02-04 17:46:25,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 304 transitions. [2018-02-04 17:46:25,865 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 304 transitions. Word has length 289 [2018-02-04 17:46:25,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:46:25,865 INFO L432 AbstractCegarLoop]: Abstraction has 303 states and 304 transitions. [2018-02-04 17:46:25,865 INFO L433 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-02-04 17:46:25,865 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 304 transitions. [2018-02-04 17:46:25,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2018-02-04 17:46:25,866 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:46:25,866 INFO L351 BasicCegarLoop]: trace histogram [35, 35, 34, 34, 34, 34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:46:25,866 INFO L371 AbstractCegarLoop]: === Iteration 40 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 17:46:25,866 INFO L82 PathProgramCache]: Analyzing trace with hash -486640228, now seen corresponding path program 28 times [2018-02-04 17:46:25,866 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:46:25,866 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:46:25,866 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:46:25,867 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:46:25,867 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:46:25,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:46:25,882 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:46:26,337 INFO L134 CoverageAnalysis]: Checked inductivity of 4624 backedges. 0 proven. 2312 refuted. 0 times theorem prover too weak. 2312 trivial. 0 not checked. [2018-02-04 17:46:26,338 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:46:26,338 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:46:26,338 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-04 17:46:26,381 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-04 17:46:26,381 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:46:26,396 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:46:26,406 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-04 17:46:26,406 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:46:26,408 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:46:26,408 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-02-04 17:46:28,179 INFO L134 CoverageAnalysis]: Checked inductivity of 4624 backedges. 2312 proven. 2312 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:46:28,179 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:46:28,179 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 74] total 111 [2018-02-04 17:46:28,180 INFO L409 AbstractCegarLoop]: Interpolant automaton has 111 states [2018-02-04 17:46:28,180 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2018-02-04 17:46:28,180 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2738, Invalid=9472, Unknown=0, NotChecked=0, Total=12210 [2018-02-04 17:46:28,180 INFO L87 Difference]: Start difference. First operand 303 states and 304 transitions. Second operand 111 states. [2018-02-04 17:46:29,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:46:29,231 INFO L93 Difference]: Finished difference Result 315 states and 316 transitions. [2018-02-04 17:46:29,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-02-04 17:46:29,231 INFO L78 Accepts]: Start accepts. Automaton has 111 states. Word has length 297 [2018-02-04 17:46:29,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:46:29,232 INFO L225 Difference]: With dead ends: 315 [2018-02-04 17:46:29,232 INFO L226 Difference]: Without dead ends: 315 [2018-02-04 17:46:29,232 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 374 GetRequests, 226 SyntacticMatches, 1 SemanticMatches, 147 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8781 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=4783, Invalid=17269, Unknown=0, NotChecked=0, Total=22052 [2018-02-04 17:46:29,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2018-02-04 17:46:29,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 311. [2018-02-04 17:46:29,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 311 states. [2018-02-04 17:46:29,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 312 transitions. [2018-02-04 17:46:29,234 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 312 transitions. Word has length 297 [2018-02-04 17:46:29,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:46:29,235 INFO L432 AbstractCegarLoop]: Abstraction has 311 states and 312 transitions. [2018-02-04 17:46:29,235 INFO L433 AbstractCegarLoop]: Interpolant automaton has 111 states. [2018-02-04 17:46:29,235 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 312 transitions. [2018-02-04 17:46:29,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 306 [2018-02-04 17:46:29,235 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:46:29,236 INFO L351 BasicCegarLoop]: trace histogram [36, 36, 35, 35, 35, 35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:46:29,236 INFO L371 AbstractCegarLoop]: === Iteration 41 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 17:46:29,236 INFO L82 PathProgramCache]: Analyzing trace with hash -1014119556, now seen corresponding path program 29 times [2018-02-04 17:46:29,236 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:46:29,236 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:46:29,236 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:46:29,236 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:46:29,236 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:46:29,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:46:29,251 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:46:29,753 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 2450 refuted. 0 times theorem prover too weak. 2450 trivial. 0 not checked. [2018-02-04 17:46:29,753 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:46:29,753 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:46:29,753 INFO L109 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-04 17:46:29,789 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 36 check-sat command(s) [2018-02-04 17:46:29,789 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:46:29,793 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:46:29,842 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 2450 refuted. 0 times theorem prover too weak. 2450 trivial. 0 not checked. [2018-02-04 17:46:29,842 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:46:29,843 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 38] total 41 [2018-02-04 17:46:29,843 INFO L409 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-02-04 17:46:29,843 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-02-04 17:46:29,843 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=745, Invalid=895, Unknown=0, NotChecked=0, Total=1640 [2018-02-04 17:46:29,843 INFO L87 Difference]: Start difference. First operand 311 states and 312 transitions. Second operand 41 states. [2018-02-04 17:46:30,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:46:30,471 INFO L93 Difference]: Finished difference Result 323 states and 324 transitions. [2018-02-04 17:46:30,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-02-04 17:46:30,472 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 305 [2018-02-04 17:46:30,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:46:30,473 INFO L225 Difference]: With dead ends: 323 [2018-02-04 17:46:30,473 INFO L226 Difference]: Without dead ends: 323 [2018-02-04 17:46:30,473 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 416 GetRequests, 341 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 767 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=2150, Invalid=3702, Unknown=0, NotChecked=0, Total=5852 [2018-02-04 17:46:30,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2018-02-04 17:46:30,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 319. [2018-02-04 17:46:30,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 319 states. [2018-02-04 17:46:30,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 320 transitions. [2018-02-04 17:46:30,477 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 320 transitions. Word has length 305 [2018-02-04 17:46:30,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:46:30,477 INFO L432 AbstractCegarLoop]: Abstraction has 319 states and 320 transitions. [2018-02-04 17:46:30,477 INFO L433 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-02-04 17:46:30,477 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 320 transitions. [2018-02-04 17:46:30,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 314 [2018-02-04 17:46:30,479 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:46:30,479 INFO L351 BasicCegarLoop]: trace histogram [37, 37, 36, 36, 36, 36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:46:30,479 INFO L371 AbstractCegarLoop]: === Iteration 42 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 17:46:30,479 INFO L82 PathProgramCache]: Analyzing trace with hash 352934492, now seen corresponding path program 30 times [2018-02-04 17:46:30,479 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:46:30,479 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:46:30,480 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:46:30,480 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:46:30,480 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:46:30,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:46:30,508 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:46:31,078 INFO L134 CoverageAnalysis]: Checked inductivity of 5184 backedges. 0 proven. 2592 refuted. 0 times theorem prover too weak. 2592 trivial. 0 not checked. [2018-02-04 17:46:31,078 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:46:31,079 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:46:31,079 INFO L109 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-02-04 17:46:31,122 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 37 check-sat command(s) [2018-02-04 17:46:31,122 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:46:31,135 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:46:31,590 INFO L134 CoverageAnalysis]: Checked inductivity of 5184 backedges. 0 proven. 2592 refuted. 0 times theorem prover too weak. 2592 trivial. 0 not checked. [2018-02-04 17:46:31,591 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:46:31,591 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 40] total 78 [2018-02-04 17:46:31,591 INFO L409 AbstractCegarLoop]: Interpolant automaton has 78 states [2018-02-04 17:46:31,591 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-02-04 17:46:31,591 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2224, Invalid=3782, Unknown=0, NotChecked=0, Total=6006 [2018-02-04 17:46:31,592 INFO L87 Difference]: Start difference. First operand 319 states and 320 transitions. Second operand 78 states. [2018-02-04 17:46:31,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:46:31,884 INFO L93 Difference]: Finished difference Result 331 states and 332 transitions. [2018-02-04 17:46:31,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-02-04 17:46:31,884 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 313 [2018-02-04 17:46:31,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:46:31,885 INFO L225 Difference]: With dead ends: 331 [2018-02-04 17:46:31,885 INFO L226 Difference]: Without dead ends: 331 [2018-02-04 17:46:31,885 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 354 GetRequests, 276 SyntacticMatches, 1 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2698 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=2301, Invalid=3861, Unknown=0, NotChecked=0, Total=6162 [2018-02-04 17:46:31,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2018-02-04 17:46:31,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 327. [2018-02-04 17:46:31,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 327 states. [2018-02-04 17:46:31,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 328 transitions. [2018-02-04 17:46:31,888 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 328 transitions. Word has length 313 [2018-02-04 17:46:31,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:46:31,889 INFO L432 AbstractCegarLoop]: Abstraction has 327 states and 328 transitions. [2018-02-04 17:46:31,889 INFO L433 AbstractCegarLoop]: Interpolant automaton has 78 states. [2018-02-04 17:46:31,889 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 328 transitions. [2018-02-04 17:46:31,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 322 [2018-02-04 17:46:31,890 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:46:31,890 INFO L351 BasicCegarLoop]: trace histogram [38, 38, 37, 37, 37, 37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:46:31,890 INFO L371 AbstractCegarLoop]: === Iteration 43 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 17:46:31,891 INFO L82 PathProgramCache]: Analyzing trace with hash 1557903932, now seen corresponding path program 31 times [2018-02-04 17:46:31,891 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:46:31,891 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:46:31,891 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:46:31,891 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:46:31,892 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:46:31,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:46:31,919 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:46:32,476 INFO L134 CoverageAnalysis]: Checked inductivity of 5476 backedges. 0 proven. 2738 refuted. 0 times theorem prover too weak. 2738 trivial. 0 not checked. [2018-02-04 17:46:32,476 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:46:32,476 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:46:32,476 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:46:32,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:46:32,497 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:46:33,000 INFO L134 CoverageAnalysis]: Checked inductivity of 5476 backedges. 0 proven. 2738 refuted. 0 times theorem prover too weak. 2738 trivial. 0 not checked. [2018-02-04 17:46:33,000 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:46:33,000 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 41] total 80 [2018-02-04 17:46:33,001 INFO L409 AbstractCegarLoop]: Interpolant automaton has 80 states [2018-02-04 17:46:33,001 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2018-02-04 17:46:33,001 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2341, Invalid=3979, Unknown=0, NotChecked=0, Total=6320 [2018-02-04 17:46:33,001 INFO L87 Difference]: Start difference. First operand 327 states and 328 transitions. Second operand 80 states. [2018-02-04 17:46:33,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:46:33,325 INFO L93 Difference]: Finished difference Result 339 states and 340 transitions. [2018-02-04 17:46:33,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-02-04 17:46:33,325 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 321 [2018-02-04 17:46:33,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:46:33,326 INFO L225 Difference]: With dead ends: 339 [2018-02-04 17:46:33,326 INFO L226 Difference]: Without dead ends: 339 [2018-02-04 17:46:33,326 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 363 GetRequests, 283 SyntacticMatches, 1 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2847 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=2420, Invalid=4060, Unknown=0, NotChecked=0, Total=6480 [2018-02-04 17:46:33,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2018-02-04 17:46:33,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 335. [2018-02-04 17:46:33,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 335 states. [2018-02-04 17:46:33,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 336 transitions. [2018-02-04 17:46:33,329 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 336 transitions. Word has length 321 [2018-02-04 17:46:33,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:46:33,329 INFO L432 AbstractCegarLoop]: Abstraction has 335 states and 336 transitions. [2018-02-04 17:46:33,329 INFO L433 AbstractCegarLoop]: Interpolant automaton has 80 states. [2018-02-04 17:46:33,329 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 336 transitions. [2018-02-04 17:46:33,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 330 [2018-02-04 17:46:33,331 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:46:33,331 INFO L351 BasicCegarLoop]: trace histogram [39, 39, 38, 38, 38, 38, 38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:46:33,331 INFO L371 AbstractCegarLoop]: === Iteration 44 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 17:46:33,331 INFO L82 PathProgramCache]: Analyzing trace with hash -1070636260, now seen corresponding path program 32 times [2018-02-04 17:46:33,331 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:46:33,331 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:46:33,332 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:46:33,332 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:46:33,332 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:46:33,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:46:33,362 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:46:34,018 INFO L134 CoverageAnalysis]: Checked inductivity of 5776 backedges. 0 proven. 2888 refuted. 0 times theorem prover too weak. 2888 trivial. 0 not checked. [2018-02-04 17:46:34,018 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:46:34,018 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:46:34,019 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 17:46:34,043 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 17:46:34,043 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:46:34,048 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:46:34,095 INFO L134 CoverageAnalysis]: Checked inductivity of 5776 backedges. 0 proven. 2888 refuted. 0 times theorem prover too weak. 2888 trivial. 0 not checked. [2018-02-04 17:46:34,095 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:46:34,095 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 41] total 44 [2018-02-04 17:46:34,096 INFO L409 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-02-04 17:46:34,096 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-02-04 17:46:34,096 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=865, Invalid=1027, Unknown=0, NotChecked=0, Total=1892 [2018-02-04 17:46:34,096 INFO L87 Difference]: Start difference. First operand 335 states and 336 transitions. Second operand 44 states. [2018-02-04 17:46:34,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:46:34,705 INFO L93 Difference]: Finished difference Result 347 states and 348 transitions. [2018-02-04 17:46:34,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-02-04 17:46:34,705 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 329 [2018-02-04 17:46:34,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:46:34,705 INFO L225 Difference]: With dead ends: 347 [2018-02-04 17:46:34,705 INFO L226 Difference]: Without dead ends: 347 [2018-02-04 17:46:34,706 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 449 GetRequests, 368 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 890 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=2504, Invalid=4302, Unknown=0, NotChecked=0, Total=6806 [2018-02-04 17:46:34,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2018-02-04 17:46:34,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 343. [2018-02-04 17:46:34,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 343 states. [2018-02-04 17:46:34,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 344 transitions. [2018-02-04 17:46:34,708 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 344 transitions. Word has length 329 [2018-02-04 17:46:34,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:46:34,708 INFO L432 AbstractCegarLoop]: Abstraction has 343 states and 344 transitions. [2018-02-04 17:46:34,708 INFO L433 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-02-04 17:46:34,708 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 344 transitions. [2018-02-04 17:46:34,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 338 [2018-02-04 17:46:34,709 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:46:34,709 INFO L351 BasicCegarLoop]: trace histogram [40, 40, 39, 39, 39, 39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:46:34,709 INFO L371 AbstractCegarLoop]: === Iteration 45 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 17:46:34,709 INFO L82 PathProgramCache]: Analyzing trace with hash 602854652, now seen corresponding path program 33 times [2018-02-04 17:46:34,710 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:46:34,710 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:46:34,710 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:46:34,710 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:46:34,710 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:46:34,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:46:34,729 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:46:35,357 INFO L134 CoverageAnalysis]: Checked inductivity of 6084 backedges. 0 proven. 3042 refuted. 0 times theorem prover too weak. 3042 trivial. 0 not checked. [2018-02-04 17:46:35,357 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:46:35,357 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:46:35,358 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 17:46:35,406 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 40 check-sat command(s) [2018-02-04 17:46:35,406 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:46:35,415 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:46:35,946 INFO L134 CoverageAnalysis]: Checked inductivity of 6084 backedges. 0 proven. 3042 refuted. 0 times theorem prover too weak. 3042 trivial. 0 not checked. [2018-02-04 17:46:35,947 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:46:35,947 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 43] total 84 [2018-02-04 17:46:35,947 INFO L409 AbstractCegarLoop]: Interpolant automaton has 84 states [2018-02-04 17:46:35,947 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2018-02-04 17:46:35,948 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2584, Invalid=4388, Unknown=0, NotChecked=0, Total=6972 [2018-02-04 17:46:35,948 INFO L87 Difference]: Start difference. First operand 343 states and 344 transitions. Second operand 84 states. [2018-02-04 17:46:36,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:46:36,279 INFO L93 Difference]: Finished difference Result 355 states and 356 transitions. [2018-02-04 17:46:36,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-02-04 17:46:36,279 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 337 [2018-02-04 17:46:36,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:46:36,280 INFO L225 Difference]: With dead ends: 355 [2018-02-04 17:46:36,280 INFO L226 Difference]: Without dead ends: 355 [2018-02-04 17:46:36,280 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 381 GetRequests, 297 SyntacticMatches, 1 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3157 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=2667, Invalid=4473, Unknown=0, NotChecked=0, Total=7140 [2018-02-04 17:46:36,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2018-02-04 17:46:36,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 351. [2018-02-04 17:46:36,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 351 states. [2018-02-04 17:46:36,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 352 transitions. [2018-02-04 17:46:36,282 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 352 transitions. Word has length 337 [2018-02-04 17:46:36,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:46:36,282 INFO L432 AbstractCegarLoop]: Abstraction has 351 states and 352 transitions. [2018-02-04 17:46:36,282 INFO L433 AbstractCegarLoop]: Interpolant automaton has 84 states. [2018-02-04 17:46:36,282 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 352 transitions. [2018-02-04 17:46:36,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 346 [2018-02-04 17:46:36,284 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:46:36,284 INFO L351 BasicCegarLoop]: trace histogram [41, 41, 40, 40, 40, 40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:46:36,284 INFO L371 AbstractCegarLoop]: === Iteration 46 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 17:46:36,284 INFO L82 PathProgramCache]: Analyzing trace with hash 1287950300, now seen corresponding path program 34 times [2018-02-04 17:46:36,284 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:46:36,284 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:46:36,285 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:46:36,285 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:46:36,285 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:46:36,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:46:36,302 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:46:36,934 INFO L134 CoverageAnalysis]: Checked inductivity of 6400 backedges. 0 proven. 3200 refuted. 0 times theorem prover too weak. 3200 trivial. 0 not checked. [2018-02-04 17:46:36,934 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:46:36,934 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:46:36,934 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-04 17:46:36,985 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-04 17:46:36,985 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:46:37,005 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:46:37,015 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-04 17:46:37,015 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:46:37,017 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:46:37,017 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-02-04 17:46:39,272 INFO L134 CoverageAnalysis]: Checked inductivity of 6400 backedges. 3200 proven. 3200 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:46:39,272 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:46:39,272 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 86] total 129 [2018-02-04 17:46:39,273 INFO L409 AbstractCegarLoop]: Interpolant automaton has 129 states [2018-02-04 17:46:39,273 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 129 interpolants. [2018-02-04 17:46:39,273 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3698, Invalid=12814, Unknown=0, NotChecked=0, Total=16512 [2018-02-04 17:46:39,273 INFO L87 Difference]: Start difference. First operand 351 states and 352 transitions. Second operand 129 states. [2018-02-04 17:46:40,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:46:40,601 INFO L93 Difference]: Finished difference Result 363 states and 364 transitions. [2018-02-04 17:46:40,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-02-04 17:46:40,602 INFO L78 Accepts]: Start accepts. Automaton has 129 states. Word has length 345 [2018-02-04 17:46:40,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:46:40,602 INFO L225 Difference]: With dead ends: 363 [2018-02-04 17:46:40,603 INFO L226 Difference]: Without dead ends: 363 [2018-02-04 17:46:40,603 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 434 GetRequests, 262 SyntacticMatches, 1 SemanticMatches, 171 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12009 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=6460, Invalid=23296, Unknown=0, NotChecked=0, Total=29756 [2018-02-04 17:46:40,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2018-02-04 17:46:40,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 359. [2018-02-04 17:46:40,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 359 states. [2018-02-04 17:46:40,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 360 transitions. [2018-02-04 17:46:40,605 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 360 transitions. Word has length 345 [2018-02-04 17:46:40,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:46:40,606 INFO L432 AbstractCegarLoop]: Abstraction has 359 states and 360 transitions. [2018-02-04 17:46:40,606 INFO L433 AbstractCegarLoop]: Interpolant automaton has 129 states. [2018-02-04 17:46:40,606 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 360 transitions. [2018-02-04 17:46:40,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 354 [2018-02-04 17:46:40,607 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:46:40,607 INFO L351 BasicCegarLoop]: trace histogram [42, 42, 41, 41, 41, 41, 41, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:46:40,607 INFO L371 AbstractCegarLoop]: === Iteration 47 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 17:46:40,607 INFO L82 PathProgramCache]: Analyzing trace with hash -15002692, now seen corresponding path program 35 times [2018-02-04 17:46:40,607 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:46:40,607 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:46:40,607 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:46:40,608 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:46:40,608 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:46:40,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:46:40,627 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:46:41,285 INFO L134 CoverageAnalysis]: Checked inductivity of 6724 backedges. 0 proven. 3362 refuted. 0 times theorem prover too weak. 3362 trivial. 0 not checked. [2018-02-04 17:46:41,285 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:46:41,285 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:46:41,286 INFO L109 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-04 17:46:41,329 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 42 check-sat command(s) [2018-02-04 17:46:41,330 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:46:41,335 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:46:41,379 INFO L134 CoverageAnalysis]: Checked inductivity of 6724 backedges. 0 proven. 3362 refuted. 0 times theorem prover too weak. 3362 trivial. 0 not checked. [2018-02-04 17:46:41,379 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:46:41,379 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 44] total 47 [2018-02-04 17:46:41,379 INFO L409 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-02-04 17:46:41,380 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-02-04 17:46:41,380 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=994, Invalid=1168, Unknown=0, NotChecked=0, Total=2162 [2018-02-04 17:46:41,380 INFO L87 Difference]: Start difference. First operand 359 states and 360 transitions. Second operand 47 states. [2018-02-04 17:46:42,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:46:42,037 INFO L93 Difference]: Finished difference Result 371 states and 372 transitions. [2018-02-04 17:46:42,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-02-04 17:46:42,038 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 353 [2018-02-04 17:46:42,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:46:42,038 INFO L225 Difference]: With dead ends: 371 [2018-02-04 17:46:42,038 INFO L226 Difference]: Without dead ends: 371 [2018-02-04 17:46:42,039 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 482 GetRequests, 395 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1022 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=2885, Invalid=4947, Unknown=0, NotChecked=0, Total=7832 [2018-02-04 17:46:42,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2018-02-04 17:46:42,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 367. [2018-02-04 17:46:42,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 367 states. [2018-02-04 17:46:42,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 368 transitions. [2018-02-04 17:46:42,041 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 368 transitions. Word has length 353 [2018-02-04 17:46:42,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:46:42,042 INFO L432 AbstractCegarLoop]: Abstraction has 367 states and 368 transitions. [2018-02-04 17:46:42,042 INFO L433 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-02-04 17:46:42,042 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 368 transitions. [2018-02-04 17:46:42,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 362 [2018-02-04 17:46:42,043 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:46:42,043 INFO L351 BasicCegarLoop]: trace histogram [43, 43, 42, 42, 42, 42, 42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:46:42,044 INFO L371 AbstractCegarLoop]: === Iteration 48 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 17:46:42,044 INFO L82 PathProgramCache]: Analyzing trace with hash 521986204, now seen corresponding path program 36 times [2018-02-04 17:46:42,044 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:46:42,044 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:46:42,044 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:46:42,045 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:46:42,045 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:46:42,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:46:42,074 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:46:42,817 INFO L134 CoverageAnalysis]: Checked inductivity of 7056 backedges. 0 proven. 3528 refuted. 0 times theorem prover too weak. 3528 trivial. 0 not checked. [2018-02-04 17:46:42,817 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:46:42,817 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:46:42,818 INFO L109 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-02-04 17:46:42,871 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 43 check-sat command(s) [2018-02-04 17:46:42,871 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:46:42,890 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:46:43,532 INFO L134 CoverageAnalysis]: Checked inductivity of 7056 backedges. 0 proven. 3528 refuted. 0 times theorem prover too weak. 3528 trivial. 0 not checked. [2018-02-04 17:46:43,532 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:46:43,532 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 46] total 90 [2018-02-04 17:46:43,533 INFO L409 AbstractCegarLoop]: Interpolant automaton has 90 states [2018-02-04 17:46:43,533 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2018-02-04 17:46:43,534 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2971, Invalid=5039, Unknown=0, NotChecked=0, Total=8010 [2018-02-04 17:46:43,534 INFO L87 Difference]: Start difference. First operand 367 states and 368 transitions. Second operand 90 states. [2018-02-04 17:46:43,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:46:43,902 INFO L93 Difference]: Finished difference Result 379 states and 380 transitions. [2018-02-04 17:46:43,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-02-04 17:46:43,902 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 361 [2018-02-04 17:46:43,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:46:43,903 INFO L225 Difference]: With dead ends: 379 [2018-02-04 17:46:43,903 INFO L226 Difference]: Without dead ends: 379 [2018-02-04 17:46:43,904 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 408 GetRequests, 318 SyntacticMatches, 1 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3652 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=3060, Invalid=5130, Unknown=0, NotChecked=0, Total=8190 [2018-02-04 17:46:43,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2018-02-04 17:46:43,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 375. [2018-02-04 17:46:43,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2018-02-04 17:46:43,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 376 transitions. [2018-02-04 17:46:43,906 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 376 transitions. Word has length 361 [2018-02-04 17:46:43,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:46:43,906 INFO L432 AbstractCegarLoop]: Abstraction has 375 states and 376 transitions. [2018-02-04 17:46:43,906 INFO L433 AbstractCegarLoop]: Interpolant automaton has 90 states. [2018-02-04 17:46:43,906 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 376 transitions. [2018-02-04 17:46:43,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 370 [2018-02-04 17:46:43,907 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:46:43,907 INFO L351 BasicCegarLoop]: trace histogram [44, 44, 43, 43, 43, 43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:46:43,907 INFO L371 AbstractCegarLoop]: === Iteration 49 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 17:46:43,907 INFO L82 PathProgramCache]: Analyzing trace with hash -793479556, now seen corresponding path program 37 times [2018-02-04 17:46:43,907 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:46:43,908 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:46:43,908 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:46:43,908 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:46:43,908 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:46:43,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:46:43,928 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:46:44,670 INFO L134 CoverageAnalysis]: Checked inductivity of 7396 backedges. 0 proven. 3698 refuted. 0 times theorem prover too weak. 3698 trivial. 0 not checked. [2018-02-04 17:46:44,670 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:46:44,671 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:46:44,671 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:46:44,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:46:44,694 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:46:45,317 INFO L134 CoverageAnalysis]: Checked inductivity of 7396 backedges. 0 proven. 3698 refuted. 0 times theorem prover too weak. 3698 trivial. 0 not checked. [2018-02-04 17:46:45,317 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:46:45,317 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 47] total 92 [2018-02-04 17:46:45,317 INFO L409 AbstractCegarLoop]: Interpolant automaton has 92 states [2018-02-04 17:46:45,318 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2018-02-04 17:46:45,318 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3106, Invalid=5266, Unknown=0, NotChecked=0, Total=8372 [2018-02-04 17:46:45,318 INFO L87 Difference]: Start difference. First operand 375 states and 376 transitions. Second operand 92 states. [2018-02-04 17:46:45,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:46:45,706 INFO L93 Difference]: Finished difference Result 387 states and 388 transitions. [2018-02-04 17:46:45,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-02-04 17:46:45,707 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 369 [2018-02-04 17:46:45,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:46:45,707 INFO L225 Difference]: With dead ends: 387 [2018-02-04 17:46:45,707 INFO L226 Difference]: Without dead ends: 387 [2018-02-04 17:46:45,708 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 417 GetRequests, 325 SyntacticMatches, 1 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3825 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=3197, Invalid=5359, Unknown=0, NotChecked=0, Total=8556 [2018-02-04 17:46:45,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2018-02-04 17:46:45,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 383. [2018-02-04 17:46:45,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2018-02-04 17:46:45,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 384 transitions. [2018-02-04 17:46:45,710 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 384 transitions. Word has length 369 [2018-02-04 17:46:45,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:46:45,710 INFO L432 AbstractCegarLoop]: Abstraction has 383 states and 384 transitions. [2018-02-04 17:46:45,710 INFO L433 AbstractCegarLoop]: Interpolant automaton has 92 states. [2018-02-04 17:46:45,710 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 384 transitions. [2018-02-04 17:46:45,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 378 [2018-02-04 17:46:45,711 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:46:45,711 INFO L351 BasicCegarLoop]: trace histogram [45, 45, 44, 44, 44, 44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:46:45,711 INFO L371 AbstractCegarLoop]: === Iteration 50 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 17:46:45,712 INFO L82 PathProgramCache]: Analyzing trace with hash -1752410788, now seen corresponding path program 38 times [2018-02-04 17:46:45,712 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:46:45,712 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:46:45,712 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:46:45,712 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:46:45,712 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:46:45,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:46:45,738 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:46:46,534 INFO L134 CoverageAnalysis]: Checked inductivity of 7744 backedges. 0 proven. 3872 refuted. 0 times theorem prover too weak. 3872 trivial. 0 not checked. [2018-02-04 17:46:46,534 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:46:46,534 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:46:46,535 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 17:46:46,563 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 17:46:46,563 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:46:46,579 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:46:46,663 INFO L134 CoverageAnalysis]: Checked inductivity of 7744 backedges. 0 proven. 3872 refuted. 0 times theorem prover too weak. 3872 trivial. 0 not checked. [2018-02-04 17:46:46,664 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:46:46,664 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 47] total 50 [2018-02-04 17:46:46,664 INFO L409 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-02-04 17:46:46,665 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-02-04 17:46:46,665 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1132, Invalid=1318, Unknown=0, NotChecked=0, Total=2450 [2018-02-04 17:46:46,665 INFO L87 Difference]: Start difference. First operand 383 states and 384 transitions. Second operand 50 states. [2018-02-04 17:46:47,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:46:47,362 INFO L93 Difference]: Finished difference Result 395 states and 396 transitions. [2018-02-04 17:46:47,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-02-04 17:46:47,362 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 377 [2018-02-04 17:46:47,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:46:47,363 INFO L225 Difference]: With dead ends: 395 [2018-02-04 17:46:47,363 INFO L226 Difference]: Without dead ends: 395 [2018-02-04 17:46:47,363 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 515 GetRequests, 422 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1163 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=3293, Invalid=5637, Unknown=0, NotChecked=0, Total=8930 [2018-02-04 17:46:47,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2018-02-04 17:46:47,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 391. [2018-02-04 17:46:47,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2018-02-04 17:46:47,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 392 transitions. [2018-02-04 17:46:47,365 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 392 transitions. Word has length 377 [2018-02-04 17:46:47,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:46:47,365 INFO L432 AbstractCegarLoop]: Abstraction has 391 states and 392 transitions. [2018-02-04 17:46:47,365 INFO L433 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-02-04 17:46:47,366 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 392 transitions. [2018-02-04 17:46:47,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 386 [2018-02-04 17:46:47,366 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:46:47,367 INFO L351 BasicCegarLoop]: trace histogram [46, 46, 45, 45, 45, 45, 45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:46:47,367 INFO L371 AbstractCegarLoop]: === Iteration 51 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 17:46:47,367 INFO L82 PathProgramCache]: Analyzing trace with hash 1997471036, now seen corresponding path program 39 times [2018-02-04 17:46:47,367 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:46:47,367 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:46:47,367 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:46:47,367 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:46:47,367 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:46:47,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:46:47,391 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:46:48,186 INFO L134 CoverageAnalysis]: Checked inductivity of 8100 backedges. 0 proven. 4050 refuted. 0 times theorem prover too weak. 4050 trivial. 0 not checked. [2018-02-04 17:46:48,187 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:46:48,187 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:46:48,187 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 17:46:48,257 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 46 check-sat command(s) [2018-02-04 17:46:48,257 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:46:48,295 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:46:48,347 INFO L134 CoverageAnalysis]: Checked inductivity of 8100 backedges. 0 proven. 4050 refuted. 0 times theorem prover too weak. 4050 trivial. 0 not checked. [2018-02-04 17:46:48,348 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:46:48,348 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 48] total 51 [2018-02-04 17:46:48,348 INFO L409 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-02-04 17:46:48,348 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-02-04 17:46:48,348 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1180, Invalid=1370, Unknown=0, NotChecked=0, Total=2550 [2018-02-04 17:46:48,348 INFO L87 Difference]: Start difference. First operand 391 states and 392 transitions. Second operand 51 states. [2018-02-04 17:46:49,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:46:49,114 INFO L93 Difference]: Finished difference Result 403 states and 404 transitions. [2018-02-04 17:46:49,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-02-04 17:46:49,114 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 385 [2018-02-04 17:46:49,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:46:49,115 INFO L225 Difference]: With dead ends: 403 [2018-02-04 17:46:49,115 INFO L226 Difference]: Without dead ends: 403 [2018-02-04 17:46:49,115 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 526 GetRequests, 431 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1212 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=3435, Invalid=5877, Unknown=0, NotChecked=0, Total=9312 [2018-02-04 17:46:49,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states. [2018-02-04 17:46:49,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 399. [2018-02-04 17:46:49,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 399 states. [2018-02-04 17:46:49,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 400 transitions. [2018-02-04 17:46:49,117 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 400 transitions. Word has length 385 [2018-02-04 17:46:49,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:46:49,118 INFO L432 AbstractCegarLoop]: Abstraction has 399 states and 400 transitions. [2018-02-04 17:46:49,118 INFO L433 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-02-04 17:46:49,118 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 400 transitions. [2018-02-04 17:46:49,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 394 [2018-02-04 17:46:49,119 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:46:49,120 INFO L351 BasicCegarLoop]: trace histogram [47, 47, 46, 46, 46, 46, 46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:46:49,120 INFO L371 AbstractCegarLoop]: === Iteration 52 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 17:46:49,120 INFO L82 PathProgramCache]: Analyzing trace with hash 308735516, now seen corresponding path program 40 times [2018-02-04 17:46:49,120 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:46:49,120 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:46:49,121 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:46:49,121 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:46:49,121 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:46:49,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:46:49,144 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:46:49,982 INFO L134 CoverageAnalysis]: Checked inductivity of 8464 backedges. 0 proven. 4232 refuted. 0 times theorem prover too weak. 4232 trivial. 0 not checked. [2018-02-04 17:46:49,982 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:46:49,982 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:46:49,982 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-04 17:46:50,076 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-04 17:46:50,076 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:46:50,100 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:46:50,102 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-04 17:46:50,102 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:46:50,105 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:46:50,106 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-02-04 17:46:52,888 INFO L134 CoverageAnalysis]: Checked inductivity of 8464 backedges. 4232 proven. 4232 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:46:52,888 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:46:52,888 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 98] total 147 [2018-02-04 17:46:52,889 INFO L409 AbstractCegarLoop]: Interpolant automaton has 147 states [2018-02-04 17:46:52,889 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 147 interpolants. [2018-02-04 17:46:52,890 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4802, Invalid=16660, Unknown=0, NotChecked=0, Total=21462 [2018-02-04 17:46:52,890 INFO L87 Difference]: Start difference. First operand 399 states and 400 transitions. Second operand 147 states. [2018-02-04 17:46:54,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:46:54,552 INFO L93 Difference]: Finished difference Result 411 states and 412 transitions. [2018-02-04 17:46:54,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-02-04 17:46:54,553 INFO L78 Accepts]: Start accepts. Automaton has 147 states. Word has length 393 [2018-02-04 17:46:54,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:46:54,553 INFO L225 Difference]: With dead ends: 411 [2018-02-04 17:46:54,553 INFO L226 Difference]: Without dead ends: 411 [2018-02-04 17:46:54,554 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 494 GetRequests, 298 SyntacticMatches, 1 SemanticMatches, 195 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15741 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=8389, Invalid=30223, Unknown=0, NotChecked=0, Total=38612 [2018-02-04 17:46:54,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2018-02-04 17:46:54,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 407. [2018-02-04 17:46:54,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2018-02-04 17:46:54,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 408 transitions. [2018-02-04 17:46:54,556 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 408 transitions. Word has length 393 [2018-02-04 17:46:54,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:46:54,556 INFO L432 AbstractCegarLoop]: Abstraction has 407 states and 408 transitions. [2018-02-04 17:46:54,556 INFO L433 AbstractCegarLoop]: Interpolant automaton has 147 states. [2018-02-04 17:46:54,556 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 408 transitions. [2018-02-04 17:46:54,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 402 [2018-02-04 17:46:54,557 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:46:54,558 INFO L351 BasicCegarLoop]: trace histogram [48, 48, 47, 47, 47, 47, 47, 47, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:46:54,558 INFO L371 AbstractCegarLoop]: === Iteration 53 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 17:46:54,558 INFO L82 PathProgramCache]: Analyzing trace with hash -864114692, now seen corresponding path program 41 times [2018-02-04 17:46:54,558 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:46:54,558 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:46:54,558 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:46:54,558 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:46:54,558 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:46:54,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:46:54,581 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:46:55,445 INFO L134 CoverageAnalysis]: Checked inductivity of 8836 backedges. 0 proven. 4418 refuted. 0 times theorem prover too weak. 4418 trivial. 0 not checked. [2018-02-04 17:46:55,445 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:46:55,446 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:46:55,446 INFO L109 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-04 17:46:55,512 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 48 check-sat command(s) [2018-02-04 17:46:55,512 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:46:55,519 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:46:55,579 INFO L134 CoverageAnalysis]: Checked inductivity of 8836 backedges. 0 proven. 4418 refuted. 0 times theorem prover too weak. 4418 trivial. 0 not checked. [2018-02-04 17:46:55,579 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:46:55,579 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 50] total 53 [2018-02-04 17:46:55,580 INFO L409 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-02-04 17:46:55,580 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-02-04 17:46:55,580 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1279, Invalid=1477, Unknown=0, NotChecked=0, Total=2756 [2018-02-04 17:46:55,580 INFO L87 Difference]: Start difference. First operand 407 states and 408 transitions. Second operand 53 states. [2018-02-04 17:46:56,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:46:56,390 INFO L93 Difference]: Finished difference Result 419 states and 420 transitions. [2018-02-04 17:46:56,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-02-04 17:46:56,390 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 401 [2018-02-04 17:46:56,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:46:56,391 INFO L225 Difference]: With dead ends: 419 [2018-02-04 17:46:56,391 INFO L226 Difference]: Without dead ends: 419 [2018-02-04 17:46:56,391 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 548 GetRequests, 449 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1313 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=3728, Invalid=6372, Unknown=0, NotChecked=0, Total=10100 [2018-02-04 17:46:56,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2018-02-04 17:46:56,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 415. [2018-02-04 17:46:56,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 415 states. [2018-02-04 17:46:56,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 416 transitions. [2018-02-04 17:46:56,394 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 416 transitions. Word has length 401 [2018-02-04 17:46:56,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:46:56,394 INFO L432 AbstractCegarLoop]: Abstraction has 415 states and 416 transitions. [2018-02-04 17:46:56,394 INFO L433 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-02-04 17:46:56,394 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 416 transitions. [2018-02-04 17:46:56,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 410 [2018-02-04 17:46:56,395 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:46:56,395 INFO L351 BasicCegarLoop]: trace histogram [49, 49, 48, 48, 48, 48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:46:56,395 INFO L371 AbstractCegarLoop]: === Iteration 54 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 17:46:56,396 INFO L82 PathProgramCache]: Analyzing trace with hash -402609444, now seen corresponding path program 42 times [2018-02-04 17:46:56,396 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:46:56,396 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:46:56,396 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:46:56,396 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:46:56,396 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:46:56,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:46:56,422 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:46:57,324 INFO L134 CoverageAnalysis]: Checked inductivity of 9216 backedges. 0 proven. 4608 refuted. 0 times theorem prover too weak. 4608 trivial. 0 not checked. [2018-02-04 17:46:57,324 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:46:57,324 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:46:57,325 INFO L109 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-02-04 17:46:57,428 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 49 check-sat command(s) [2018-02-04 17:46:57,428 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:46:57,447 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:46:58,181 INFO L134 CoverageAnalysis]: Checked inductivity of 9216 backedges. 0 proven. 4608 refuted. 0 times theorem prover too weak. 4608 trivial. 0 not checked. [2018-02-04 17:46:58,181 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:46:58,181 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 52] total 102 [2018-02-04 17:46:58,182 INFO L409 AbstractCegarLoop]: Interpolant automaton has 102 states [2018-02-04 17:46:58,182 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2018-02-04 17:46:58,182 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3826, Invalid=6476, Unknown=0, NotChecked=0, Total=10302 [2018-02-04 17:46:58,182 INFO L87 Difference]: Start difference. First operand 415 states and 416 transitions. Second operand 102 states. [2018-02-04 17:46:58,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:46:58,667 INFO L93 Difference]: Finished difference Result 427 states and 428 transitions. [2018-02-04 17:46:58,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-02-04 17:46:58,668 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 409 [2018-02-04 17:46:58,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:46:58,668 INFO L225 Difference]: With dead ends: 427 [2018-02-04 17:46:58,668 INFO L226 Difference]: Without dead ends: 427 [2018-02-04 17:46:58,669 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 462 GetRequests, 360 SyntacticMatches, 1 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4750 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=3927, Invalid=6579, Unknown=0, NotChecked=0, Total=10506 [2018-02-04 17:46:58,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2018-02-04 17:46:58,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 423. [2018-02-04 17:46:58,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 423 states. [2018-02-04 17:46:58,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 424 transitions. [2018-02-04 17:46:58,671 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 424 transitions. Word has length 409 [2018-02-04 17:46:58,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:46:58,671 INFO L432 AbstractCegarLoop]: Abstraction has 423 states and 424 transitions. [2018-02-04 17:46:58,671 INFO L433 AbstractCegarLoop]: Interpolant automaton has 102 states. [2018-02-04 17:46:58,671 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 424 transitions. [2018-02-04 17:46:58,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 418 [2018-02-04 17:46:58,672 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:46:58,672 INFO L351 BasicCegarLoop]: trace histogram [50, 50, 49, 49, 49, 49, 49, 49, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:46:58,672 INFO L371 AbstractCegarLoop]: === Iteration 55 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 17:46:58,672 INFO L82 PathProgramCache]: Analyzing trace with hash -1487440196, now seen corresponding path program 43 times [2018-02-04 17:46:58,673 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:46:58,673 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:46:58,673 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:46:58,673 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:46:58,673 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:46:58,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:46:58,697 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:46:59,633 INFO L134 CoverageAnalysis]: Checked inductivity of 9604 backedges. 0 proven. 4802 refuted. 0 times theorem prover too weak. 4802 trivial. 0 not checked. [2018-02-04 17:46:59,633 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:46:59,633 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:46:59,633 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:46:59,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:46:59,661 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:47:00,451 INFO L134 CoverageAnalysis]: Checked inductivity of 9604 backedges. 0 proven. 4802 refuted. 0 times theorem prover too weak. 4802 trivial. 0 not checked. [2018-02-04 17:47:00,451 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:47:00,451 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 53] total 104 [2018-02-04 17:47:00,452 INFO L409 AbstractCegarLoop]: Interpolant automaton has 104 states [2018-02-04 17:47:00,452 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2018-02-04 17:47:00,453 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3979, Invalid=6733, Unknown=0, NotChecked=0, Total=10712 [2018-02-04 17:47:00,453 INFO L87 Difference]: Start difference. First operand 423 states and 424 transitions. Second operand 104 states. [2018-02-04 17:47:00,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:47:00,984 INFO L93 Difference]: Finished difference Result 435 states and 436 transitions. [2018-02-04 17:47:00,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-02-04 17:47:00,984 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 417 [2018-02-04 17:47:00,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:47:00,985 INFO L225 Difference]: With dead ends: 435 [2018-02-04 17:47:00,985 INFO L226 Difference]: Without dead ends: 435 [2018-02-04 17:47:00,986 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 471 GetRequests, 367 SyntacticMatches, 1 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4947 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=4082, Invalid=6838, Unknown=0, NotChecked=0, Total=10920 [2018-02-04 17:47:00,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2018-02-04 17:47:00,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 431. [2018-02-04 17:47:00,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 431 states. [2018-02-04 17:47:00,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 431 states and 432 transitions. [2018-02-04 17:47:00,988 INFO L78 Accepts]: Start accepts. Automaton has 431 states and 432 transitions. Word has length 417 [2018-02-04 17:47:00,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:47:00,988 INFO L432 AbstractCegarLoop]: Abstraction has 431 states and 432 transitions. [2018-02-04 17:47:00,988 INFO L433 AbstractCegarLoop]: Interpolant automaton has 104 states. [2018-02-04 17:47:00,988 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 432 transitions. [2018-02-04 17:47:00,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 426 [2018-02-04 17:47:00,989 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:47:00,989 INFO L351 BasicCegarLoop]: trace histogram [51, 51, 50, 50, 50, 50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:47:00,989 INFO L371 AbstractCegarLoop]: === Iteration 56 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 17:47:00,989 INFO L82 PathProgramCache]: Analyzing trace with hash 1823312796, now seen corresponding path program 44 times [2018-02-04 17:47:00,989 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:47:00,989 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:47:00,990 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:47:00,990 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:47:00,990 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:47:01,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:47:01,015 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:47:02,111 INFO L134 CoverageAnalysis]: Checked inductivity of 10000 backedges. 0 proven. 5000 refuted. 0 times theorem prover too weak. 5000 trivial. 0 not checked. [2018-02-04 17:47:02,111 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:47:02,111 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:47:02,112 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 17:47:02,145 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 17:47:02,145 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:47:02,151 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:47:02,212 INFO L134 CoverageAnalysis]: Checked inductivity of 10000 backedges. 0 proven. 5000 refuted. 0 times theorem prover too weak. 5000 trivial. 0 not checked. [2018-02-04 17:47:02,213 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:47:02,213 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 53] total 56 [2018-02-04 17:47:02,213 INFO L409 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-02-04 17:47:02,213 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-02-04 17:47:02,213 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1435, Invalid=1645, Unknown=0, NotChecked=0, Total=3080 [2018-02-04 17:47:02,214 INFO L87 Difference]: Start difference. First operand 431 states and 432 transitions. Second operand 56 states. [2018-02-04 17:47:03,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:47:03,200 INFO L93 Difference]: Finished difference Result 443 states and 444 transitions. [2018-02-04 17:47:03,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-02-04 17:47:03,201 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 425 [2018-02-04 17:47:03,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:47:03,201 INFO L225 Difference]: With dead ends: 443 [2018-02-04 17:47:03,201 INFO L226 Difference]: Without dead ends: 443 [2018-02-04 17:47:03,202 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 581 GetRequests, 476 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1472 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=4190, Invalid=7152, Unknown=0, NotChecked=0, Total=11342 [2018-02-04 17:47:03,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2018-02-04 17:47:03,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 439. [2018-02-04 17:47:03,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 439 states. [2018-02-04 17:47:03,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 439 states and 440 transitions. [2018-02-04 17:47:03,204 INFO L78 Accepts]: Start accepts. Automaton has 439 states and 440 transitions. Word has length 425 [2018-02-04 17:47:03,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:47:03,204 INFO L432 AbstractCegarLoop]: Abstraction has 439 states and 440 transitions. [2018-02-04 17:47:03,204 INFO L433 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-02-04 17:47:03,204 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 440 transitions. [2018-02-04 17:47:03,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 434 [2018-02-04 17:47:03,205 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:47:03,205 INFO L351 BasicCegarLoop]: trace histogram [52, 52, 51, 51, 51, 51, 51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:47:03,206 INFO L371 AbstractCegarLoop]: === Iteration 57 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 17:47:03,206 INFO L82 PathProgramCache]: Analyzing trace with hash -638752388, now seen corresponding path program 45 times [2018-02-04 17:47:03,206 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:47:03,206 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:47:03,206 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:47:03,206 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:47:03,206 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:47:03,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:47:03,233 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:47:04,296 INFO L134 CoverageAnalysis]: Checked inductivity of 10404 backedges. 0 proven. 5202 refuted. 0 times theorem prover too weak. 5202 trivial. 0 not checked. [2018-02-04 17:47:04,296 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:47:04,296 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:47:04,297 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 17:47:04,368 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 52 check-sat command(s) [2018-02-04 17:47:04,368 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:47:04,396 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:47:05,260 INFO L134 CoverageAnalysis]: Checked inductivity of 10404 backedges. 0 proven. 5202 refuted. 0 times theorem prover too weak. 5202 trivial. 0 not checked. [2018-02-04 17:47:05,260 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:47:05,260 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 55] total 108 [2018-02-04 17:47:05,260 INFO L409 AbstractCegarLoop]: Interpolant automaton has 108 states [2018-02-04 17:47:05,261 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2018-02-04 17:47:05,261 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4294, Invalid=7262, Unknown=0, NotChecked=0, Total=11556 [2018-02-04 17:47:05,261 INFO L87 Difference]: Start difference. First operand 439 states and 440 transitions. Second operand 108 states. [2018-02-04 17:47:05,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:47:05,786 INFO L93 Difference]: Finished difference Result 451 states and 452 transitions. [2018-02-04 17:47:05,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-02-04 17:47:05,786 INFO L78 Accepts]: Start accepts. Automaton has 108 states. Word has length 433 [2018-02-04 17:47:05,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:47:05,787 INFO L225 Difference]: With dead ends: 451 [2018-02-04 17:47:05,787 INFO L226 Difference]: Without dead ends: 451 [2018-02-04 17:47:05,787 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 489 GetRequests, 381 SyntacticMatches, 1 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5353 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=4401, Invalid=7371, Unknown=0, NotChecked=0, Total=11772 [2018-02-04 17:47:05,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2018-02-04 17:47:05,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 447. [2018-02-04 17:47:05,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 447 states. [2018-02-04 17:47:05,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 447 states and 448 transitions. [2018-02-04 17:47:05,790 INFO L78 Accepts]: Start accepts. Automaton has 447 states and 448 transitions. Word has length 433 [2018-02-04 17:47:05,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:47:05,790 INFO L432 AbstractCegarLoop]: Abstraction has 447 states and 448 transitions. [2018-02-04 17:47:05,790 INFO L433 AbstractCegarLoop]: Interpolant automaton has 108 states. [2018-02-04 17:47:05,790 INFO L276 IsEmpty]: Start isEmpty. Operand 447 states and 448 transitions. [2018-02-04 17:47:05,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 442 [2018-02-04 17:47:05,792 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:47:05,792 INFO L351 BasicCegarLoop]: trace histogram [53, 53, 52, 52, 52, 52, 52, 52, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:47:05,792 INFO L371 AbstractCegarLoop]: === Iteration 58 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 17:47:05,793 INFO L82 PathProgramCache]: Analyzing trace with hash -255750052, now seen corresponding path program 46 times [2018-02-04 17:47:05,793 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:47:05,793 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:47:05,793 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:47:05,794 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:47:05,794 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:47:05,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:47:05,825 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:47:06,893 INFO L134 CoverageAnalysis]: Checked inductivity of 10816 backedges. 0 proven. 5408 refuted. 0 times theorem prover too weak. 5408 trivial. 0 not checked. [2018-02-04 17:47:06,894 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:47:06,894 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:47:06,894 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-04 17:47:06,981 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-04 17:47:06,982 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:47:07,010 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:47:07,011 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-04 17:47:07,011 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:47:07,014 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:47:07,014 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-02-04 17:47:10,622 INFO L134 CoverageAnalysis]: Checked inductivity of 10816 backedges. 5408 proven. 5408 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:47:10,622 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:47:10,622 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 110] total 165 [2018-02-04 17:47:10,622 INFO L409 AbstractCegarLoop]: Interpolant automaton has 165 states [2018-02-04 17:47:10,623 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 165 interpolants. [2018-02-04 17:47:10,623 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6050, Invalid=21010, Unknown=0, NotChecked=0, Total=27060 [2018-02-04 17:47:10,623 INFO L87 Difference]: Start difference. First operand 447 states and 448 transitions. Second operand 165 states. [2018-02-04 17:47:12,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:47:12,648 INFO L93 Difference]: Finished difference Result 459 states and 460 transitions. [2018-02-04 17:47:12,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-02-04 17:47:12,649 INFO L78 Accepts]: Start accepts. Automaton has 165 states. Word has length 441 [2018-02-04 17:47:12,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:47:12,650 INFO L225 Difference]: With dead ends: 459 [2018-02-04 17:47:12,650 INFO L226 Difference]: Without dead ends: 459 [2018-02-04 17:47:12,652 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 554 GetRequests, 334 SyntacticMatches, 1 SemanticMatches, 219 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19977 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=10570, Invalid=38050, Unknown=0, NotChecked=0, Total=48620 [2018-02-04 17:47:12,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2018-02-04 17:47:12,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 455. [2018-02-04 17:47:12,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 455 states. [2018-02-04 17:47:12,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 455 states to 455 states and 456 transitions. [2018-02-04 17:47:12,655 INFO L78 Accepts]: Start accepts. Automaton has 455 states and 456 transitions. Word has length 441 [2018-02-04 17:47:12,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:47:12,655 INFO L432 AbstractCegarLoop]: Abstraction has 455 states and 456 transitions. [2018-02-04 17:47:12,655 INFO L433 AbstractCegarLoop]: Interpolant automaton has 165 states. [2018-02-04 17:47:12,655 INFO L276 IsEmpty]: Start isEmpty. Operand 455 states and 456 transitions. [2018-02-04 17:47:12,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 450 [2018-02-04 17:47:12,657 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:47:12,657 INFO L351 BasicCegarLoop]: trace histogram [54, 54, 53, 53, 53, 53, 53, 53, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:47:12,657 INFO L371 AbstractCegarLoop]: === Iteration 59 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 17:47:12,657 INFO L82 PathProgramCache]: Analyzing trace with hash 848592956, now seen corresponding path program 47 times [2018-02-04 17:47:12,657 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:47:12,657 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:47:12,658 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:47:12,658 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:47:12,658 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:47:12,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:47:12,690 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:47:13,812 INFO L134 CoverageAnalysis]: Checked inductivity of 11236 backedges. 0 proven. 5618 refuted. 0 times theorem prover too weak. 5618 trivial. 0 not checked. [2018-02-04 17:47:13,812 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:47:13,812 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:47:13,813 INFO L109 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-04 17:47:13,895 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 54 check-sat command(s) [2018-02-04 17:47:13,895 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:47:13,904 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:47:13,971 INFO L134 CoverageAnalysis]: Checked inductivity of 11236 backedges. 0 proven. 5618 refuted. 0 times theorem prover too weak. 5618 trivial. 0 not checked. [2018-02-04 17:47:13,971 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:47:13,971 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 56] total 59 [2018-02-04 17:47:13,972 INFO L409 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-02-04 17:47:13,972 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-02-04 17:47:13,972 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1600, Invalid=1822, Unknown=0, NotChecked=0, Total=3422 [2018-02-04 17:47:13,972 INFO L87 Difference]: Start difference. First operand 455 states and 456 transitions. Second operand 59 states. [2018-02-04 17:47:14,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:47:14,982 INFO L93 Difference]: Finished difference Result 467 states and 468 transitions. [2018-02-04 17:47:14,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-02-04 17:47:14,982 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 449 [2018-02-04 17:47:14,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:47:14,983 INFO L225 Difference]: With dead ends: 467 [2018-02-04 17:47:14,983 INFO L226 Difference]: Without dead ends: 467 [2018-02-04 17:47:14,983 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 614 GetRequests, 503 SyntacticMatches, 0 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1640 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=4679, Invalid=7977, Unknown=0, NotChecked=0, Total=12656 [2018-02-04 17:47:14,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 467 states. [2018-02-04 17:47:14,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 467 to 463. [2018-02-04 17:47:14,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 463 states. [2018-02-04 17:47:14,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 463 states to 463 states and 464 transitions. [2018-02-04 17:47:14,985 INFO L78 Accepts]: Start accepts. Automaton has 463 states and 464 transitions. Word has length 449 [2018-02-04 17:47:14,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:47:14,985 INFO L432 AbstractCegarLoop]: Abstraction has 463 states and 464 transitions. [2018-02-04 17:47:14,985 INFO L433 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-02-04 17:47:14,985 INFO L276 IsEmpty]: Start isEmpty. Operand 463 states and 464 transitions. [2018-02-04 17:47:14,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 458 [2018-02-04 17:47:14,987 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:47:14,987 INFO L351 BasicCegarLoop]: trace histogram [55, 55, 54, 54, 54, 54, 54, 54, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:47:14,987 INFO L371 AbstractCegarLoop]: === Iteration 60 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 17:47:14,987 INFO L82 PathProgramCache]: Analyzing trace with hash -1064257252, now seen corresponding path program 48 times [2018-02-04 17:47:14,987 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:47:14,987 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:47:14,987 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:47:14,988 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:47:14,988 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:47:15,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:47:15,016 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:47:16,213 INFO L134 CoverageAnalysis]: Checked inductivity of 11664 backedges. 0 proven. 5832 refuted. 0 times theorem prover too weak. 5832 trivial. 0 not checked. [2018-02-04 17:47:16,213 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:47:16,213 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:47:16,214 INFO L109 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-02-04 17:47:16,352 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 55 check-sat command(s) [2018-02-04 17:47:16,352 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:47:16,410 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:47:17,364 INFO L134 CoverageAnalysis]: Checked inductivity of 11664 backedges. 0 proven. 5832 refuted. 0 times theorem prover too weak. 5832 trivial. 0 not checked. [2018-02-04 17:47:17,364 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:47:17,364 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 58] total 114 [2018-02-04 17:47:17,365 INFO L409 AbstractCegarLoop]: Interpolant automaton has 114 states [2018-02-04 17:47:17,365 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 114 interpolants. [2018-02-04 17:47:17,365 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4789, Invalid=8093, Unknown=0, NotChecked=0, Total=12882 [2018-02-04 17:47:17,366 INFO L87 Difference]: Start difference. First operand 463 states and 464 transitions. Second operand 114 states. [2018-02-04 17:47:17,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:47:17,911 INFO L93 Difference]: Finished difference Result 475 states and 476 transitions. [2018-02-04 17:47:17,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-02-04 17:47:17,911 INFO L78 Accepts]: Start accepts. Automaton has 114 states. Word has length 457 [2018-02-04 17:47:17,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:47:17,912 INFO L225 Difference]: With dead ends: 475 [2018-02-04 17:47:17,912 INFO L226 Difference]: Without dead ends: 475 [2018-02-04 17:47:17,913 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 516 GetRequests, 402 SyntacticMatches, 1 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5992 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=4902, Invalid=8208, Unknown=0, NotChecked=0, Total=13110 [2018-02-04 17:47:17,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 475 states. [2018-02-04 17:47:17,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 475 to 471. [2018-02-04 17:47:17,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 471 states. [2018-02-04 17:47:17,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 471 states to 471 states and 472 transitions. [2018-02-04 17:47:17,915 INFO L78 Accepts]: Start accepts. Automaton has 471 states and 472 transitions. Word has length 457 [2018-02-04 17:47:17,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:47:17,915 INFO L432 AbstractCegarLoop]: Abstraction has 471 states and 472 transitions. [2018-02-04 17:47:17,915 INFO L433 AbstractCegarLoop]: Interpolant automaton has 114 states. [2018-02-04 17:47:17,915 INFO L276 IsEmpty]: Start isEmpty. Operand 471 states and 472 transitions. [2018-02-04 17:47:17,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 466 [2018-02-04 17:47:17,916 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:47:17,916 INFO L351 BasicCegarLoop]: trace histogram [56, 56, 55, 55, 55, 55, 55, 55, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:47:17,916 INFO L371 AbstractCegarLoop]: === Iteration 61 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 17:47:17,917 INFO L82 PathProgramCache]: Analyzing trace with hash 2074131196, now seen corresponding path program 49 times [2018-02-04 17:47:17,917 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:47:17,917 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:47:17,917 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:47:17,917 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:47:17,917 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:47:17,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:47:17,947 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:47:19,177 INFO L134 CoverageAnalysis]: Checked inductivity of 12100 backedges. 0 proven. 6050 refuted. 0 times theorem prover too weak. 6050 trivial. 0 not checked. [2018-02-04 17:47:19,177 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:47:19,177 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:47:19,178 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:47:19,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:47:19,212 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:47:20,163 INFO L134 CoverageAnalysis]: Checked inductivity of 12100 backedges. 0 proven. 6050 refuted. 0 times theorem prover too weak. 6050 trivial. 0 not checked. [2018-02-04 17:47:20,164 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:47:20,164 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 59] total 116 [2018-02-04 17:47:20,164 INFO L409 AbstractCegarLoop]: Interpolant automaton has 116 states [2018-02-04 17:47:20,165 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 116 interpolants. [2018-02-04 17:47:20,166 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4960, Invalid=8380, Unknown=0, NotChecked=0, Total=13340 [2018-02-04 17:47:20,166 INFO L87 Difference]: Start difference. First operand 471 states and 472 transitions. Second operand 116 states. [2018-02-04 17:47:20,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:47:20,857 INFO L93 Difference]: Finished difference Result 483 states and 484 transitions. [2018-02-04 17:47:20,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-02-04 17:47:20,857 INFO L78 Accepts]: Start accepts. Automaton has 116 states. Word has length 465 [2018-02-04 17:47:20,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:47:20,858 INFO L225 Difference]: With dead ends: 483 [2018-02-04 17:47:20,858 INFO L226 Difference]: Without dead ends: 483 [2018-02-04 17:47:20,858 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 525 GetRequests, 409 SyntacticMatches, 1 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6213 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=5075, Invalid=8497, Unknown=0, NotChecked=0, Total=13572 [2018-02-04 17:47:20,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 483 states. [2018-02-04 17:47:20,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 483 to 479. [2018-02-04 17:47:20,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 479 states. [2018-02-04 17:47:20,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 479 states to 479 states and 480 transitions. [2018-02-04 17:47:20,861 INFO L78 Accepts]: Start accepts. Automaton has 479 states and 480 transitions. Word has length 465 [2018-02-04 17:47:20,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:47:20,861 INFO L432 AbstractCegarLoop]: Abstraction has 479 states and 480 transitions. [2018-02-04 17:47:20,861 INFO L433 AbstractCegarLoop]: Interpolant automaton has 116 states. [2018-02-04 17:47:20,861 INFO L276 IsEmpty]: Start isEmpty. Operand 479 states and 480 transitions. [2018-02-04 17:47:20,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 474 [2018-02-04 17:47:20,862 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:47:20,862 INFO L351 BasicCegarLoop]: trace histogram [57, 57, 56, 56, 56, 56, 56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:47:20,862 INFO L371 AbstractCegarLoop]: === Iteration 62 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 17:47:20,863 INFO L82 PathProgramCache]: Analyzing trace with hash 611255772, now seen corresponding path program 50 times [2018-02-04 17:47:20,863 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:47:20,863 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:47:20,863 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:47:20,863 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:47:20,863 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:47:20,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:47:20,899 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:47:22,180 INFO L134 CoverageAnalysis]: Checked inductivity of 12544 backedges. 0 proven. 6272 refuted. 0 times theorem prover too weak. 6272 trivial. 0 not checked. [2018-02-04 17:47:22,181 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:47:22,181 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:47:22,181 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 17:47:22,227 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 17:47:22,227 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:47:22,247 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:47:22,322 INFO L134 CoverageAnalysis]: Checked inductivity of 12544 backedges. 0 proven. 6272 refuted. 0 times theorem prover too weak. 6272 trivial. 0 not checked. [2018-02-04 17:47:22,322 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:47:22,322 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 59] total 62 [2018-02-04 17:47:22,322 INFO L409 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-02-04 17:47:22,323 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-02-04 17:47:22,323 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1774, Invalid=2008, Unknown=0, NotChecked=0, Total=3782 [2018-02-04 17:47:22,323 INFO L87 Difference]: Start difference. First operand 479 states and 480 transitions. Second operand 62 states. [2018-02-04 17:47:23,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:47:23,411 INFO L93 Difference]: Finished difference Result 491 states and 492 transitions. [2018-02-04 17:47:23,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-02-04 17:47:23,412 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 473 [2018-02-04 17:47:23,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:47:23,413 INFO L225 Difference]: With dead ends: 491 [2018-02-04 17:47:23,413 INFO L226 Difference]: Without dead ends: 491 [2018-02-04 17:47:23,413 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 647 GetRequests, 530 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1817 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=5195, Invalid=8847, Unknown=0, NotChecked=0, Total=14042 [2018-02-04 17:47:23,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 491 states. [2018-02-04 17:47:23,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 491 to 487. [2018-02-04 17:47:23,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 487 states. [2018-02-04 17:47:23,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 487 states and 488 transitions. [2018-02-04 17:47:23,416 INFO L78 Accepts]: Start accepts. Automaton has 487 states and 488 transitions. Word has length 473 [2018-02-04 17:47:23,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:47:23,416 INFO L432 AbstractCegarLoop]: Abstraction has 487 states and 488 transitions. [2018-02-04 17:47:23,416 INFO L433 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-02-04 17:47:23,416 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 488 transitions. [2018-02-04 17:47:23,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 482 [2018-02-04 17:47:23,417 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:47:23,418 INFO L351 BasicCegarLoop]: trace histogram [58, 58, 57, 57, 57, 57, 57, 57, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:47:23,418 INFO L371 AbstractCegarLoop]: === Iteration 63 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 17:47:23,418 INFO L82 PathProgramCache]: Analyzing trace with hash 2070288828, now seen corresponding path program 51 times [2018-02-04 17:47:23,418 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:47:23,418 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:47:23,418 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:47:23,418 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:47:23,418 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:47:23,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:47:23,454 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:47:24,729 INFO L134 CoverageAnalysis]: Checked inductivity of 12996 backedges. 0 proven. 6498 refuted. 0 times theorem prover too weak. 6498 trivial. 0 not checked. [2018-02-04 17:47:24,730 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:47:24,730 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:47:24,730 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 17:47:24,817 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 58 check-sat command(s) [2018-02-04 17:47:24,817 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:47:24,857 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:47:24,952 INFO L134 CoverageAnalysis]: Checked inductivity of 12996 backedges. 0 proven. 6498 refuted. 0 times theorem prover too weak. 6498 trivial. 0 not checked. [2018-02-04 17:47:24,953 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:47:24,953 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 60] total 63 [2018-02-04 17:47:24,953 INFO L409 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-02-04 17:47:24,953 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-02-04 17:47:24,953 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1834, Invalid=2072, Unknown=0, NotChecked=0, Total=3906 [2018-02-04 17:47:24,953 INFO L87 Difference]: Start difference. First operand 487 states and 488 transitions. Second operand 63 states. [2018-02-04 17:47:26,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:47:26,026 INFO L93 Difference]: Finished difference Result 499 states and 500 transitions. [2018-02-04 17:47:26,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-02-04 17:47:26,026 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 481 [2018-02-04 17:47:26,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:47:26,027 INFO L225 Difference]: With dead ends: 499 [2018-02-04 17:47:26,027 INFO L226 Difference]: Without dead ends: 499 [2018-02-04 17:47:26,028 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 658 GetRequests, 539 SyntacticMatches, 0 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1878 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=5373, Invalid=9147, Unknown=0, NotChecked=0, Total=14520 [2018-02-04 17:47:26,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 499 states. [2018-02-04 17:47:26,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 499 to 495. [2018-02-04 17:47:26,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 495 states. [2018-02-04 17:47:26,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 495 states and 496 transitions. [2018-02-04 17:47:26,030 INFO L78 Accepts]: Start accepts. Automaton has 495 states and 496 transitions. Word has length 481 [2018-02-04 17:47:26,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:47:26,030 INFO L432 AbstractCegarLoop]: Abstraction has 495 states and 496 transitions. [2018-02-04 17:47:26,030 INFO L433 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-02-04 17:47:26,030 INFO L276 IsEmpty]: Start isEmpty. Operand 495 states and 496 transitions. [2018-02-04 17:47:26,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 490 [2018-02-04 17:47:26,032 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:47:26,032 INFO L351 BasicCegarLoop]: trace histogram [59, 59, 58, 58, 58, 58, 58, 58, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:47:26,032 INFO L371 AbstractCegarLoop]: === Iteration 64 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 17:47:26,032 INFO L82 PathProgramCache]: Analyzing trace with hash 1622177436, now seen corresponding path program 52 times [2018-02-04 17:47:26,032 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:47:26,032 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:47:26,033 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:47:26,033 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:47:26,033 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:47:26,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:47:26,065 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:47:27,385 INFO L134 CoverageAnalysis]: Checked inductivity of 13456 backedges. 0 proven. 6728 refuted. 0 times theorem prover too weak. 6728 trivial. 0 not checked. [2018-02-04 17:47:27,385 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:47:27,385 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:47:27,386 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-04 17:47:27,494 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-04 17:47:27,494 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:47:27,537 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:47:27,539 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-04 17:47:27,539 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:47:27,541 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:47:27,541 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-02-04 17:47:31,778 INFO L134 CoverageAnalysis]: Checked inductivity of 13456 backedges. 6728 proven. 6728 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:47:31,779 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:47:31,779 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 122] total 183 [2018-02-04 17:47:31,779 INFO L409 AbstractCegarLoop]: Interpolant automaton has 183 states [2018-02-04 17:47:31,780 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 183 interpolants. [2018-02-04 17:47:31,781 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7442, Invalid=25864, Unknown=0, NotChecked=0, Total=33306 [2018-02-04 17:47:31,781 INFO L87 Difference]: Start difference. First operand 495 states and 496 transitions. Second operand 183 states. [2018-02-04 17:47:33,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:47:33,881 INFO L93 Difference]: Finished difference Result 507 states and 508 transitions. [2018-02-04 17:47:33,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-02-04 17:47:33,881 INFO L78 Accepts]: Start accepts. Automaton has 183 states. Word has length 489 [2018-02-04 17:47:33,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:47:33,882 INFO L225 Difference]: With dead ends: 507 [2018-02-04 17:47:33,882 INFO L226 Difference]: Without dead ends: 507 [2018-02-04 17:47:33,883 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 614 GetRequests, 370 SyntacticMatches, 1 SemanticMatches, 243 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24717 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=13003, Invalid=46777, Unknown=0, NotChecked=0, Total=59780 [2018-02-04 17:47:33,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507 states. [2018-02-04 17:47:33,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507 to 503. [2018-02-04 17:47:33,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 503 states. [2018-02-04 17:47:33,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 503 states to 503 states and 504 transitions. [2018-02-04 17:47:33,886 INFO L78 Accepts]: Start accepts. Automaton has 503 states and 504 transitions. Word has length 489 [2018-02-04 17:47:33,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:47:33,886 INFO L432 AbstractCegarLoop]: Abstraction has 503 states and 504 transitions. [2018-02-04 17:47:33,886 INFO L433 AbstractCegarLoop]: Interpolant automaton has 183 states. [2018-02-04 17:47:33,886 INFO L276 IsEmpty]: Start isEmpty. Operand 503 states and 504 transitions. [2018-02-04 17:47:33,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 498 [2018-02-04 17:47:33,888 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:47:33,888 INFO L351 BasicCegarLoop]: trace histogram [60, 60, 59, 59, 59, 59, 59, 59, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:47:33,888 INFO L371 AbstractCegarLoop]: === Iteration 65 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 17:47:33,888 INFO L82 PathProgramCache]: Analyzing trace with hash -197616516, now seen corresponding path program 53 times [2018-02-04 17:47:33,888 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:47:33,888 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:47:33,888 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:47:33,889 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:47:33,889 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:47:33,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:47:33,923 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:47:35,277 INFO L134 CoverageAnalysis]: Checked inductivity of 13924 backedges. 0 proven. 6962 refuted. 0 times theorem prover too weak. 6962 trivial. 0 not checked. [2018-02-04 17:47:35,277 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:47:35,278 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:47:35,278 INFO L109 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-04 17:47:35,390 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 60 check-sat command(s) [2018-02-04 17:47:35,390 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:47:35,401 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:47:35,486 INFO L134 CoverageAnalysis]: Checked inductivity of 13924 backedges. 0 proven. 6962 refuted. 0 times theorem prover too weak. 6962 trivial. 0 not checked. [2018-02-04 17:47:35,487 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:47:35,487 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 62] total 65 [2018-02-04 17:47:35,487 INFO L409 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-02-04 17:47:35,487 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-02-04 17:47:35,488 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1957, Invalid=2203, Unknown=0, NotChecked=0, Total=4160 [2018-02-04 17:47:35,488 INFO L87 Difference]: Start difference. First operand 503 states and 504 transitions. Second operand 65 states. [2018-02-04 17:47:36,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:47:36,603 INFO L93 Difference]: Finished difference Result 515 states and 516 transitions. [2018-02-04 17:47:36,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-02-04 17:47:36,603 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 497 [2018-02-04 17:47:36,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:47:36,604 INFO L225 Difference]: With dead ends: 515 [2018-02-04 17:47:36,604 INFO L226 Difference]: Without dead ends: 515 [2018-02-04 17:47:36,605 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 680 GetRequests, 557 SyntacticMatches, 0 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2003 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=5738, Invalid=9762, Unknown=0, NotChecked=0, Total=15500 [2018-02-04 17:47:36,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states. [2018-02-04 17:47:36,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 511. [2018-02-04 17:47:36,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 511 states. [2018-02-04 17:47:36,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 511 states to 511 states and 512 transitions. [2018-02-04 17:47:36,607 INFO L78 Accepts]: Start accepts. Automaton has 511 states and 512 transitions. Word has length 497 [2018-02-04 17:47:36,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:47:36,607 INFO L432 AbstractCegarLoop]: Abstraction has 511 states and 512 transitions. [2018-02-04 17:47:36,607 INFO L433 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-02-04 17:47:36,607 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states and 512 transitions. [2018-02-04 17:47:36,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 506 [2018-02-04 17:47:36,609 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:47:36,609 INFO L351 BasicCegarLoop]: trace histogram [61, 61, 60, 60, 60, 60, 60, 60, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:47:36,609 INFO L371 AbstractCegarLoop]: === Iteration 66 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 17:47:36,609 INFO L82 PathProgramCache]: Analyzing trace with hash -1247212708, now seen corresponding path program 54 times [2018-02-04 17:47:36,609 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:47:36,609 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:47:36,610 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:47:36,610 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:47:36,610 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:47:36,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:47:36,644 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:47:38,069 INFO L134 CoverageAnalysis]: Checked inductivity of 14400 backedges. 0 proven. 7200 refuted. 0 times theorem prover too weak. 7200 trivial. 0 not checked. [2018-02-04 17:47:38,069 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:47:38,069 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:47:38,069 INFO L109 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-02-04 17:47:38,179 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 61 check-sat command(s) [2018-02-04 17:47:38,180 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:47:38,213 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:47:38,294 INFO L134 CoverageAnalysis]: Checked inductivity of 14400 backedges. 0 proven. 7200 refuted. 0 times theorem prover too weak. 7200 trivial. 0 not checked. [2018-02-04 17:47:38,294 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:47:38,294 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 63] total 66 [2018-02-04 17:47:38,295 INFO L409 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-02-04 17:47:38,295 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-02-04 17:47:38,295 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2020, Invalid=2270, Unknown=0, NotChecked=0, Total=4290 [2018-02-04 17:47:38,295 INFO L87 Difference]: Start difference. First operand 511 states and 512 transitions. Second operand 66 states. [2018-02-04 17:47:39,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:47:39,501 INFO L93 Difference]: Finished difference Result 523 states and 524 transitions. [2018-02-04 17:47:39,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-02-04 17:47:39,501 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 505 [2018-02-04 17:47:39,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:47:39,502 INFO L225 Difference]: With dead ends: 523 [2018-02-04 17:47:39,502 INFO L226 Difference]: Without dead ends: 523 [2018-02-04 17:47:39,503 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 691 GetRequests, 566 SyntacticMatches, 0 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2067 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=5925, Invalid=10077, Unknown=0, NotChecked=0, Total=16002 [2018-02-04 17:47:39,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states. [2018-02-04 17:47:39,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 519. [2018-02-04 17:47:39,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 519 states. [2018-02-04 17:47:39,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 519 states to 519 states and 520 transitions. [2018-02-04 17:47:39,505 INFO L78 Accepts]: Start accepts. Automaton has 519 states and 520 transitions. Word has length 505 [2018-02-04 17:47:39,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:47:39,505 INFO L432 AbstractCegarLoop]: Abstraction has 519 states and 520 transitions. [2018-02-04 17:47:39,505 INFO L433 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-02-04 17:47:39,505 INFO L276 IsEmpty]: Start isEmpty. Operand 519 states and 520 transitions. [2018-02-04 17:47:39,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 514 [2018-02-04 17:47:39,507 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:47:39,507 INFO L351 BasicCegarLoop]: trace histogram [62, 62, 61, 61, 61, 61, 61, 61, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:47:39,507 INFO L371 AbstractCegarLoop]: === Iteration 67 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 17:47:39,507 INFO L82 PathProgramCache]: Analyzing trace with hash -1536408772, now seen corresponding path program 55 times [2018-02-04 17:47:39,507 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:47:39,507 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:47:39,508 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:47:39,508 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:47:39,508 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:47:39,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:47:39,543 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:47:41,050 INFO L134 CoverageAnalysis]: Checked inductivity of 14884 backedges. 0 proven. 7442 refuted. 0 times theorem prover too weak. 7442 trivial. 0 not checked. [2018-02-04 17:47:41,050 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:47:41,050 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:47:41,051 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:47:41,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:47:41,086 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:47:42,162 INFO L134 CoverageAnalysis]: Checked inductivity of 14884 backedges. 0 proven. 7442 refuted. 0 times theorem prover too weak. 7442 trivial. 0 not checked. [2018-02-04 17:47:42,162 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:47:42,162 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 65] total 128 [2018-02-04 17:47:42,162 INFO L409 AbstractCegarLoop]: Interpolant automaton has 128 states [2018-02-04 17:47:42,163 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 128 interpolants. [2018-02-04 17:47:42,164 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6049, Invalid=10207, Unknown=0, NotChecked=0, Total=16256 [2018-02-04 17:47:42,164 INFO L87 Difference]: Start difference. First operand 519 states and 520 transitions. Second operand 128 states. [2018-02-04 17:47:42,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:47:42,929 INFO L93 Difference]: Finished difference Result 531 states and 532 transitions. [2018-02-04 17:47:42,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-02-04 17:47:42,930 INFO L78 Accepts]: Start accepts. Automaton has 128 states. Word has length 513 [2018-02-04 17:47:42,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:47:42,931 INFO L225 Difference]: With dead ends: 531 [2018-02-04 17:47:42,931 INFO L226 Difference]: Without dead ends: 531 [2018-02-04 17:47:42,931 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 579 GetRequests, 451 SyntacticMatches, 1 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7623 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=6176, Invalid=10336, Unknown=0, NotChecked=0, Total=16512 [2018-02-04 17:47:42,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2018-02-04 17:47:42,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 527. [2018-02-04 17:47:42,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 527 states. [2018-02-04 17:47:42,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 527 states to 527 states and 528 transitions. [2018-02-04 17:47:42,933 INFO L78 Accepts]: Start accepts. Automaton has 527 states and 528 transitions. Word has length 513 [2018-02-04 17:47:42,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:47:42,934 INFO L432 AbstractCegarLoop]: Abstraction has 527 states and 528 transitions. [2018-02-04 17:47:42,934 INFO L433 AbstractCegarLoop]: Interpolant automaton has 128 states. [2018-02-04 17:47:42,934 INFO L276 IsEmpty]: Start isEmpty. Operand 527 states and 528 transitions. [2018-02-04 17:47:42,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 522 [2018-02-04 17:47:42,935 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:47:42,935 INFO L351 BasicCegarLoop]: trace histogram [63, 63, 62, 62, 62, 62, 62, 62, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:47:42,935 INFO L371 AbstractCegarLoop]: === Iteration 68 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 17:47:42,936 INFO L82 PathProgramCache]: Analyzing trace with hash 1605157916, now seen corresponding path program 56 times [2018-02-04 17:47:42,936 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:47:42,936 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:47:42,936 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:47:42,936 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:47:42,936 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:47:42,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:47:42,972 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:47:44,499 INFO L134 CoverageAnalysis]: Checked inductivity of 15376 backedges. 0 proven. 7688 refuted. 0 times theorem prover too weak. 7688 trivial. 0 not checked. [2018-02-04 17:47:44,499 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:47:44,500 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:47:44,500 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 17:47:44,548 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 17:47:44,548 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:47:44,556 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:47:44,647 INFO L134 CoverageAnalysis]: Checked inductivity of 15376 backedges. 0 proven. 7688 refuted. 0 times theorem prover too weak. 7688 trivial. 0 not checked. [2018-02-04 17:47:44,647 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:47:44,647 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 65] total 68 [2018-02-04 17:47:44,648 INFO L409 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-02-04 17:47:44,648 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-02-04 17:47:44,648 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2149, Invalid=2407, Unknown=0, NotChecked=0, Total=4556 [2018-02-04 17:47:44,648 INFO L87 Difference]: Start difference. First operand 527 states and 528 transitions. Second operand 68 states. [2018-02-04 17:47:45,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:47:45,891 INFO L93 Difference]: Finished difference Result 539 states and 540 transitions. [2018-02-04 17:47:45,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-02-04 17:47:45,891 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 521 [2018-02-04 17:47:45,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:47:45,892 INFO L225 Difference]: With dead ends: 539 [2018-02-04 17:47:45,892 INFO L226 Difference]: Without dead ends: 539 [2018-02-04 17:47:45,893 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 713 GetRequests, 584 SyntacticMatches, 0 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2198 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=6308, Invalid=10722, Unknown=0, NotChecked=0, Total=17030 [2018-02-04 17:47:45,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2018-02-04 17:47:45,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 535. [2018-02-04 17:47:45,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 535 states. [2018-02-04 17:47:45,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 535 states to 535 states and 536 transitions. [2018-02-04 17:47:45,896 INFO L78 Accepts]: Start accepts. Automaton has 535 states and 536 transitions. Word has length 521 [2018-02-04 17:47:45,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:47:45,896 INFO L432 AbstractCegarLoop]: Abstraction has 535 states and 536 transitions. [2018-02-04 17:47:45,896 INFO L433 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-02-04 17:47:45,896 INFO L276 IsEmpty]: Start isEmpty. Operand 535 states and 536 transitions. [2018-02-04 17:47:45,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 530 [2018-02-04 17:47:45,899 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:47:45,899 INFO L351 BasicCegarLoop]: trace histogram [64, 64, 63, 63, 63, 63, 63, 63, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:47:45,899 INFO L371 AbstractCegarLoop]: === Iteration 69 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 17:47:45,899 INFO L82 PathProgramCache]: Analyzing trace with hash 1179979260, now seen corresponding path program 57 times [2018-02-04 17:47:45,899 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:47:45,900 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:47:45,900 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:47:45,900 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:47:45,900 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:47:45,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:47:45,946 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:47:47,523 INFO L134 CoverageAnalysis]: Checked inductivity of 15876 backedges. 0 proven. 7938 refuted. 0 times theorem prover too weak. 7938 trivial. 0 not checked. [2018-02-04 17:47:47,524 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:47:47,524 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:47:47,524 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 17:47:47,630 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 64 check-sat command(s) [2018-02-04 17:47:47,630 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:47:47,653 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:47:48,818 INFO L134 CoverageAnalysis]: Checked inductivity of 15876 backedges. 0 proven. 7938 refuted. 0 times theorem prover too weak. 7938 trivial. 0 not checked. [2018-02-04 17:47:48,819 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:47:48,819 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68, 67] total 132 [2018-02-04 17:47:48,819 INFO L409 AbstractCegarLoop]: Interpolant automaton has 132 states [2018-02-04 17:47:48,820 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 132 interpolants. [2018-02-04 17:47:48,820 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6436, Invalid=10856, Unknown=0, NotChecked=0, Total=17292 [2018-02-04 17:47:48,820 INFO L87 Difference]: Start difference. First operand 535 states and 536 transitions. Second operand 132 states. [2018-02-04 17:47:49,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:47:49,630 INFO L93 Difference]: Finished difference Result 547 states and 548 transitions. [2018-02-04 17:47:49,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-02-04 17:47:49,630 INFO L78 Accepts]: Start accepts. Automaton has 132 states. Word has length 529 [2018-02-04 17:47:49,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:47:49,631 INFO L225 Difference]: With dead ends: 547 [2018-02-04 17:47:49,631 INFO L226 Difference]: Without dead ends: 547 [2018-02-04 17:47:49,632 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 597 GetRequests, 465 SyntacticMatches, 1 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8125 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=6567, Invalid=10989, Unknown=0, NotChecked=0, Total=17556 [2018-02-04 17:47:49,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2018-02-04 17:47:49,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 543. [2018-02-04 17:47:49,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 543 states. [2018-02-04 17:47:49,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 543 states to 543 states and 544 transitions. [2018-02-04 17:47:49,634 INFO L78 Accepts]: Start accepts. Automaton has 543 states and 544 transitions. Word has length 529 [2018-02-04 17:47:49,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:47:49,634 INFO L432 AbstractCegarLoop]: Abstraction has 543 states and 544 transitions. [2018-02-04 17:47:49,634 INFO L433 AbstractCegarLoop]: Interpolant automaton has 132 states. [2018-02-04 17:47:49,634 INFO L276 IsEmpty]: Start isEmpty. Operand 543 states and 544 transitions. [2018-02-04 17:47:49,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 538 [2018-02-04 17:47:49,636 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:47:49,636 INFO L351 BasicCegarLoop]: trace histogram [65, 65, 64, 64, 64, 64, 64, 64, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:47:49,636 INFO L371 AbstractCegarLoop]: === Iteration 70 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 17:47:49,636 INFO L82 PathProgramCache]: Analyzing trace with hash -1760583460, now seen corresponding path program 58 times [2018-02-04 17:47:49,636 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:47:49,636 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:47:49,637 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:47:49,637 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:47:49,637 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:47:49,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:47:49,676 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:47:51,298 INFO L134 CoverageAnalysis]: Checked inductivity of 16384 backedges. 0 proven. 8192 refuted. 0 times theorem prover too weak. 8192 trivial. 0 not checked. [2018-02-04 17:47:51,298 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:47:51,298 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:47:51,298 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-04 17:47:51,430 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-04 17:47:51,430 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:47:51,466 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:47:51,470 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-04 17:47:51,470 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:47:51,477 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:47:51,478 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-02-04 17:47:56,363 INFO L134 CoverageAnalysis]: Checked inductivity of 16384 backedges. 8192 proven. 8192 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:47:56,364 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:47:56,364 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 134] total 201 [2018-02-04 17:47:56,364 INFO L409 AbstractCegarLoop]: Interpolant automaton has 201 states [2018-02-04 17:47:56,365 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 201 interpolants. [2018-02-04 17:47:56,366 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8978, Invalid=31222, Unknown=0, NotChecked=0, Total=40200 [2018-02-04 17:47:56,366 INFO L87 Difference]: Start difference. First operand 543 states and 544 transitions. Second operand 201 states. [2018-02-04 17:47:58,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:47:58,908 INFO L93 Difference]: Finished difference Result 555 states and 556 transitions. [2018-02-04 17:47:58,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-02-04 17:47:58,908 INFO L78 Accepts]: Start accepts. Automaton has 201 states. Word has length 537 [2018-02-04 17:47:58,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:47:58,909 INFO L225 Difference]: With dead ends: 555 [2018-02-04 17:47:58,909 INFO L226 Difference]: Without dead ends: 555 [2018-02-04 17:47:58,911 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 674 GetRequests, 406 SyntacticMatches, 1 SemanticMatches, 267 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29961 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=15688, Invalid=56404, Unknown=0, NotChecked=0, Total=72092 [2018-02-04 17:47:58,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2018-02-04 17:47:58,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 551. [2018-02-04 17:47:58,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 551 states. [2018-02-04 17:47:58,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 551 states and 552 transitions. [2018-02-04 17:47:58,913 INFO L78 Accepts]: Start accepts. Automaton has 551 states and 552 transitions. Word has length 537 [2018-02-04 17:47:58,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:47:58,913 INFO L432 AbstractCegarLoop]: Abstraction has 551 states and 552 transitions. [2018-02-04 17:47:58,913 INFO L433 AbstractCegarLoop]: Interpolant automaton has 201 states. [2018-02-04 17:47:58,913 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 552 transitions. [2018-02-04 17:47:58,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 546 [2018-02-04 17:47:58,915 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:47:58,915 INFO L351 BasicCegarLoop]: trace histogram [66, 66, 65, 65, 65, 65, 65, 65, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:47:58,915 INFO L371 AbstractCegarLoop]: === Iteration 71 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 17:47:58,915 INFO L82 PathProgramCache]: Analyzing trace with hash -1874395972, now seen corresponding path program 59 times [2018-02-04 17:47:58,916 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:47:58,916 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:47:58,916 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:47:58,916 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:47:58,916 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:47:58,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:47:58,956 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:48:00,656 INFO L134 CoverageAnalysis]: Checked inductivity of 16900 backedges. 0 proven. 8450 refuted. 0 times theorem prover too weak. 8450 trivial. 0 not checked. [2018-02-04 17:48:00,656 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:48:00,656 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:48:00,657 INFO L109 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-04 17:48:00,767 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 66 check-sat command(s) [2018-02-04 17:48:00,768 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:48:00,779 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:48:00,872 INFO L134 CoverageAnalysis]: Checked inductivity of 16900 backedges. 0 proven. 8450 refuted. 0 times theorem prover too weak. 8450 trivial. 0 not checked. [2018-02-04 17:48:00,880 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:48:00,880 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70, 68] total 71 [2018-02-04 17:48:00,880 INFO L409 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-02-04 17:48:00,880 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-02-04 17:48:00,880 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2350, Invalid=2620, Unknown=0, NotChecked=0, Total=4970 [2018-02-04 17:48:00,881 INFO L87 Difference]: Start difference. First operand 551 states and 552 transitions. Second operand 71 states. [2018-02-04 17:48:02,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:48:02,325 INFO L93 Difference]: Finished difference Result 563 states and 564 transitions. [2018-02-04 17:48:02,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-02-04 17:48:02,325 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 545 [2018-02-04 17:48:02,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:48:02,326 INFO L225 Difference]: With dead ends: 563 [2018-02-04 17:48:02,326 INFO L226 Difference]: Without dead ends: 563 [2018-02-04 17:48:02,327 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 746 GetRequests, 611 SyntacticMatches, 0 SemanticMatches, 135 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2402 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=6905, Invalid=11727, Unknown=0, NotChecked=0, Total=18632 [2018-02-04 17:48:02,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2018-02-04 17:48:02,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 559. [2018-02-04 17:48:02,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 559 states. [2018-02-04 17:48:02,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 559 states to 559 states and 560 transitions. [2018-02-04 17:48:02,330 INFO L78 Accepts]: Start accepts. Automaton has 559 states and 560 transitions. Word has length 545 [2018-02-04 17:48:02,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:48:02,330 INFO L432 AbstractCegarLoop]: Abstraction has 559 states and 560 transitions. [2018-02-04 17:48:02,330 INFO L433 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-02-04 17:48:02,330 INFO L276 IsEmpty]: Start isEmpty. Operand 559 states and 560 transitions. [2018-02-04 17:48:02,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 554 [2018-02-04 17:48:02,332 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:48:02,332 INFO L351 BasicCegarLoop]: trace histogram [67, 67, 66, 66, 66, 66, 66, 66, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:48:02,332 INFO L371 AbstractCegarLoop]: === Iteration 72 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 17:48:02,332 INFO L82 PathProgramCache]: Analyzing trace with hash -1876581988, now seen corresponding path program 60 times [2018-02-04 17:48:02,332 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:48:02,332 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:48:02,332 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:48:02,332 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:48:02,333 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:48:02,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:48:02,374 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:48:04,189 INFO L134 CoverageAnalysis]: Checked inductivity of 17424 backedges. 0 proven. 8712 refuted. 0 times theorem prover too weak. 8712 trivial. 0 not checked. [2018-02-04 17:48:04,190 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:48:04,190 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:48:04,190 INFO L109 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-02-04 17:48:04,321 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 67 check-sat command(s) [2018-02-04 17:48:04,321 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:48:04,348 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:48:04,445 INFO L134 CoverageAnalysis]: Checked inductivity of 17424 backedges. 0 proven. 8712 refuted. 0 times theorem prover too weak. 8712 trivial. 0 not checked. [2018-02-04 17:48:04,445 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:48:04,445 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 69] total 72 [2018-02-04 17:48:04,445 INFO L409 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-02-04 17:48:04,446 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-02-04 17:48:04,446 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2419, Invalid=2693, Unknown=0, NotChecked=0, Total=5112 [2018-02-04 17:48:04,446 INFO L87 Difference]: Start difference. First operand 559 states and 560 transitions. Second operand 72 states. [2018-02-04 17:48:05,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:48:05,855 INFO L93 Difference]: Finished difference Result 571 states and 572 transitions. [2018-02-04 17:48:05,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-02-04 17:48:05,855 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 553 [2018-02-04 17:48:05,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:48:05,856 INFO L225 Difference]: With dead ends: 571 [2018-02-04 17:48:05,856 INFO L226 Difference]: Without dead ends: 571 [2018-02-04 17:48:05,857 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 757 GetRequests, 620 SyntacticMatches, 0 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2472 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=7110, Invalid=12072, Unknown=0, NotChecked=0, Total=19182 [2018-02-04 17:48:05,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2018-02-04 17:48:05,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 567. [2018-02-04 17:48:05,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 567 states. [2018-02-04 17:48:05,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 567 states to 567 states and 568 transitions. [2018-02-04 17:48:05,859 INFO L78 Accepts]: Start accepts. Automaton has 567 states and 568 transitions. Word has length 553 [2018-02-04 17:48:05,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:48:05,859 INFO L432 AbstractCegarLoop]: Abstraction has 567 states and 568 transitions. [2018-02-04 17:48:05,859 INFO L433 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-02-04 17:48:05,859 INFO L276 IsEmpty]: Start isEmpty. Operand 567 states and 568 transitions. [2018-02-04 17:48:05,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 562 [2018-02-04 17:48:05,861 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:48:05,861 INFO L351 BasicCegarLoop]: trace histogram [68, 68, 67, 67, 67, 67, 67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:48:05,861 INFO L371 AbstractCegarLoop]: === Iteration 73 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 17:48:05,861 INFO L82 PathProgramCache]: Analyzing trace with hash 882249596, now seen corresponding path program 61 times [2018-02-04 17:48:05,861 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:48:05,862 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:48:05,862 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:48:05,862 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:48:05,862 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:48:05,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:48:05,904 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:48:07,700 INFO L134 CoverageAnalysis]: Checked inductivity of 17956 backedges. 0 proven. 8978 refuted. 0 times theorem prover too weak. 8978 trivial. 0 not checked. [2018-02-04 17:48:07,701 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:48:07,701 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:48:07,701 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:48:07,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:48:07,742 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:48:09,126 INFO L134 CoverageAnalysis]: Checked inductivity of 17956 backedges. 0 proven. 8978 refuted. 0 times theorem prover too weak. 8978 trivial. 0 not checked. [2018-02-04 17:48:09,126 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:48:09,126 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72, 71] total 140 [2018-02-04 17:48:09,127 INFO L409 AbstractCegarLoop]: Interpolant automaton has 140 states [2018-02-04 17:48:09,127 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 140 interpolants. [2018-02-04 17:48:09,128 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7246, Invalid=12214, Unknown=0, NotChecked=0, Total=19460 [2018-02-04 17:48:09,128 INFO L87 Difference]: Start difference. First operand 567 states and 568 transitions. Second operand 140 states. [2018-02-04 17:48:09,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:48:09,998 INFO L93 Difference]: Finished difference Result 579 states and 580 transitions. [2018-02-04 17:48:09,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-02-04 17:48:09,998 INFO L78 Accepts]: Start accepts. Automaton has 140 states. Word has length 561 [2018-02-04 17:48:09,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:48:09,999 INFO L225 Difference]: With dead ends: 579 [2018-02-04 17:48:09,999 INFO L226 Difference]: Without dead ends: 579 [2018-02-04 17:48:09,999 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 633 GetRequests, 493 SyntacticMatches, 1 SemanticMatches, 139 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9177 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=7385, Invalid=12355, Unknown=0, NotChecked=0, Total=19740 [2018-02-04 17:48:10,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 579 states. [2018-02-04 17:48:10,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 579 to 575. [2018-02-04 17:48:10,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 575 states. [2018-02-04 17:48:10,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 575 states to 575 states and 576 transitions. [2018-02-04 17:48:10,002 INFO L78 Accepts]: Start accepts. Automaton has 575 states and 576 transitions. Word has length 561 [2018-02-04 17:48:10,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:48:10,002 INFO L432 AbstractCegarLoop]: Abstraction has 575 states and 576 transitions. [2018-02-04 17:48:10,002 INFO L433 AbstractCegarLoop]: Interpolant automaton has 140 states. [2018-02-04 17:48:10,002 INFO L276 IsEmpty]: Start isEmpty. Operand 575 states and 576 transitions. [2018-02-04 17:48:10,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 570 [2018-02-04 17:48:10,004 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:48:10,004 INFO L351 BasicCegarLoop]: trace histogram [69, 69, 68, 68, 68, 68, 68, 68, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:48:10,004 INFO L371 AbstractCegarLoop]: === Iteration 74 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 17:48:10,004 INFO L82 PathProgramCache]: Analyzing trace with hash 2067973724, now seen corresponding path program 62 times [2018-02-04 17:48:10,005 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:48:10,005 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:48:10,005 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:48:10,005 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:48:10,005 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:48:10,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:48:10,049 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:48:11,925 INFO L134 CoverageAnalysis]: Checked inductivity of 18496 backedges. 0 proven. 9248 refuted. 0 times theorem prover too weak. 9248 trivial. 0 not checked. [2018-02-04 17:48:11,925 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:48:11,925 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:48:11,926 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 17:48:11,983 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 17:48:11,983 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:48:11,994 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:48:12,095 INFO L134 CoverageAnalysis]: Checked inductivity of 18496 backedges. 0 proven. 9248 refuted. 0 times theorem prover too weak. 9248 trivial. 0 not checked. [2018-02-04 17:48:12,096 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:48:12,096 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 71] total 74 [2018-02-04 17:48:12,096 INFO L409 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-02-04 17:48:12,096 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-02-04 17:48:12,097 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2560, Invalid=2842, Unknown=0, NotChecked=0, Total=5402 [2018-02-04 17:48:12,097 INFO L87 Difference]: Start difference. First operand 575 states and 576 transitions. Second operand 74 states. [2018-02-04 17:48:13,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:48:13,554 INFO L93 Difference]: Finished difference Result 587 states and 588 transitions. [2018-02-04 17:48:13,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-02-04 17:48:13,554 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 569 [2018-02-04 17:48:13,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:48:13,555 INFO L225 Difference]: With dead ends: 587 [2018-02-04 17:48:13,555 INFO L226 Difference]: Without dead ends: 587 [2018-02-04 17:48:13,556 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 779 GetRequests, 638 SyntacticMatches, 0 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2615 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=7529, Invalid=12777, Unknown=0, NotChecked=0, Total=20306 [2018-02-04 17:48:13,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2018-02-04 17:48:13,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 583. [2018-02-04 17:48:13,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 583 states. [2018-02-04 17:48:13,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 583 states to 583 states and 584 transitions. [2018-02-04 17:48:13,558 INFO L78 Accepts]: Start accepts. Automaton has 583 states and 584 transitions. Word has length 569 [2018-02-04 17:48:13,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:48:13,559 INFO L432 AbstractCegarLoop]: Abstraction has 583 states and 584 transitions. [2018-02-04 17:48:13,559 INFO L433 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-02-04 17:48:13,559 INFO L276 IsEmpty]: Start isEmpty. Operand 583 states and 584 transitions. [2018-02-04 17:48:13,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 578 [2018-02-04 17:48:13,560 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:48:13,561 INFO L351 BasicCegarLoop]: trace histogram [70, 70, 69, 69, 69, 69, 69, 69, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:48:13,561 INFO L371 AbstractCegarLoop]: === Iteration 75 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 17:48:13,561 INFO L82 PathProgramCache]: Analyzing trace with hash -510245316, now seen corresponding path program 63 times [2018-02-04 17:48:13,561 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:48:13,561 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:48:13,561 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:48:13,561 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:48:13,561 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:48:13,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:48:13,605 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:48:15,525 INFO L134 CoverageAnalysis]: Checked inductivity of 19044 backedges. 0 proven. 9522 refuted. 0 times theorem prover too weak. 9522 trivial. 0 not checked. [2018-02-04 17:48:15,525 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:48:15,525 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:48:15,526 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 17:48:15,636 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 70 check-sat command(s) [2018-02-04 17:48:15,636 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:48:15,672 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:48:15,780 INFO L134 CoverageAnalysis]: Checked inductivity of 19044 backedges. 0 proven. 9522 refuted. 0 times theorem prover too weak. 9522 trivial. 0 not checked. [2018-02-04 17:48:15,780 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:48:15,780 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74, 72] total 75 [2018-02-04 17:48:15,781 INFO L409 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-02-04 17:48:15,781 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-02-04 17:48:15,781 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2632, Invalid=2918, Unknown=0, NotChecked=0, Total=5550 [2018-02-04 17:48:15,782 INFO L87 Difference]: Start difference. First operand 583 states and 584 transitions. Second operand 75 states. [2018-02-04 17:48:17,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:48:17,319 INFO L93 Difference]: Finished difference Result 595 states and 596 transitions. [2018-02-04 17:48:17,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-02-04 17:48:17,319 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 577 [2018-02-04 17:48:17,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:48:17,320 INFO L225 Difference]: With dead ends: 595 [2018-02-04 17:48:17,320 INFO L226 Difference]: Without dead ends: 595 [2018-02-04 17:48:17,321 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 790 GetRequests, 647 SyntacticMatches, 0 SemanticMatches, 143 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2688 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=7743, Invalid=13137, Unknown=0, NotChecked=0, Total=20880 [2018-02-04 17:48:17,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 595 states. [2018-02-04 17:48:17,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 595 to 591. [2018-02-04 17:48:17,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 591 states. [2018-02-04 17:48:17,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 592 transitions. [2018-02-04 17:48:17,323 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 592 transitions. Word has length 577 [2018-02-04 17:48:17,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:48:17,323 INFO L432 AbstractCegarLoop]: Abstraction has 591 states and 592 transitions. [2018-02-04 17:48:17,323 INFO L433 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-02-04 17:48:17,324 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 592 transitions. [2018-02-04 17:48:17,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 586 [2018-02-04 17:48:17,325 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:48:17,325 INFO L351 BasicCegarLoop]: trace histogram [71, 71, 70, 70, 70, 70, 70, 70, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:48:17,326 INFO L371 AbstractCegarLoop]: === Iteration 76 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 17:48:17,326 INFO L82 PathProgramCache]: Analyzing trace with hash -2068115684, now seen corresponding path program 64 times [2018-02-04 17:48:17,326 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:48:17,326 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:48:17,326 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:48:17,326 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:48:17,326 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:48:17,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:48:17,373 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:48:19,375 INFO L134 CoverageAnalysis]: Checked inductivity of 19600 backedges. 0 proven. 9800 refuted. 0 times theorem prover too weak. 9800 trivial. 0 not checked. [2018-02-04 17:48:19,375 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:48:19,375 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:48:19,376 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-04 17:48:19,545 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-04 17:48:19,545 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:48:19,594 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:48:19,596 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-04 17:48:19,596 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:48:19,598 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:48:19,598 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-02-04 17:48:25,426 INFO L134 CoverageAnalysis]: Checked inductivity of 19600 backedges. 9800 proven. 9800 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:48:25,427 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:48:25,427 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75, 146] total 219 [2018-02-04 17:48:25,427 INFO L409 AbstractCegarLoop]: Interpolant automaton has 219 states [2018-02-04 17:48:25,428 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 219 interpolants. [2018-02-04 17:48:25,428 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10658, Invalid=37084, Unknown=0, NotChecked=0, Total=47742 [2018-02-04 17:48:25,429 INFO L87 Difference]: Start difference. First operand 591 states and 592 transitions. Second operand 219 states. [2018-02-04 17:48:28,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:48:28,620 INFO L93 Difference]: Finished difference Result 603 states and 604 transitions. [2018-02-04 17:48:28,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-02-04 17:48:28,620 INFO L78 Accepts]: Start accepts. Automaton has 219 states. Word has length 585 [2018-02-04 17:48:28,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:48:28,621 INFO L225 Difference]: With dead ends: 603 [2018-02-04 17:48:28,621 INFO L226 Difference]: Without dead ends: 603 [2018-02-04 17:48:28,624 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 734 GetRequests, 442 SyntacticMatches, 1 SemanticMatches, 291 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35709 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=18625, Invalid=66931, Unknown=0, NotChecked=0, Total=85556 [2018-02-04 17:48:28,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603 states. [2018-02-04 17:48:28,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 603 to 599. [2018-02-04 17:48:28,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 599 states. [2018-02-04 17:48:28,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 599 states to 599 states and 600 transitions. [2018-02-04 17:48:28,627 INFO L78 Accepts]: Start accepts. Automaton has 599 states and 600 transitions. Word has length 585 [2018-02-04 17:48:28,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:48:28,627 INFO L432 AbstractCegarLoop]: Abstraction has 599 states and 600 transitions. [2018-02-04 17:48:28,627 INFO L433 AbstractCegarLoop]: Interpolant automaton has 219 states. [2018-02-04 17:48:28,627 INFO L276 IsEmpty]: Start isEmpty. Operand 599 states and 600 transitions. [2018-02-04 17:48:28,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 594 [2018-02-04 17:48:28,629 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:48:28,629 INFO L351 BasicCegarLoop]: trace histogram [72, 72, 71, 71, 71, 71, 71, 71, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:48:28,629 INFO L371 AbstractCegarLoop]: === Iteration 77 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 17:48:28,629 INFO L82 PathProgramCache]: Analyzing trace with hash 1100718332, now seen corresponding path program 65 times [2018-02-04 17:48:28,630 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:48:28,630 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:48:28,630 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:48:28,630 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:48:28,630 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:48:28,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:48:28,679 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:48:30,742 INFO L134 CoverageAnalysis]: Checked inductivity of 20164 backedges. 0 proven. 10082 refuted. 0 times theorem prover too weak. 10082 trivial. 0 not checked. [2018-02-04 17:48:30,753 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:48:30,753 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:48:30,753 INFO L109 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-04 17:48:30,915 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 72 check-sat command(s) [2018-02-04 17:48:30,915 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:48:30,928 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:48:31,045 INFO L134 CoverageAnalysis]: Checked inductivity of 20164 backedges. 0 proven. 10082 refuted. 0 times theorem prover too weak. 10082 trivial. 0 not checked. [2018-02-04 17:48:31,045 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:48:31,045 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76, 74] total 77 [2018-02-04 17:48:31,046 INFO L409 AbstractCegarLoop]: Interpolant automaton has 77 states [2018-02-04 17:48:31,046 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2018-02-04 17:48:31,047 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2779, Invalid=3073, Unknown=0, NotChecked=0, Total=5852 [2018-02-04 17:48:31,047 INFO L87 Difference]: Start difference. First operand 599 states and 600 transitions. Second operand 77 states. [2018-02-04 17:48:32,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:48:32,584 INFO L93 Difference]: Finished difference Result 611 states and 612 transitions. [2018-02-04 17:48:32,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2018-02-04 17:48:32,585 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 593 [2018-02-04 17:48:32,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:48:32,586 INFO L225 Difference]: With dead ends: 611 [2018-02-04 17:48:32,586 INFO L226 Difference]: Without dead ends: 611 [2018-02-04 17:48:32,586 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 812 GetRequests, 665 SyntacticMatches, 0 SemanticMatches, 147 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2837 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=8180, Invalid=13872, Unknown=0, NotChecked=0, Total=22052 [2018-02-04 17:48:32,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2018-02-04 17:48:32,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 607. [2018-02-04 17:48:32,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 607 states. [2018-02-04 17:48:32,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 607 states to 607 states and 608 transitions. [2018-02-04 17:48:32,589 INFO L78 Accepts]: Start accepts. Automaton has 607 states and 608 transitions. Word has length 593 [2018-02-04 17:48:32,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:48:32,589 INFO L432 AbstractCegarLoop]: Abstraction has 607 states and 608 transitions. [2018-02-04 17:48:32,589 INFO L433 AbstractCegarLoop]: Interpolant automaton has 77 states. [2018-02-04 17:48:32,589 INFO L276 IsEmpty]: Start isEmpty. Operand 607 states and 608 transitions. [2018-02-04 17:48:32,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 602 [2018-02-04 17:48:32,591 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:48:32,591 INFO L351 BasicCegarLoop]: trace histogram [73, 73, 72, 72, 72, 72, 72, 72, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:48:32,591 INFO L371 AbstractCegarLoop]: === Iteration 78 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 17:48:32,591 INFO L82 PathProgramCache]: Analyzing trace with hash -723354660, now seen corresponding path program 66 times [2018-02-04 17:48:32,591 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:48:32,591 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:48:32,592 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:48:32,592 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:48:32,592 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:48:32,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:48:32,640 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:48:34,715 INFO L134 CoverageAnalysis]: Checked inductivity of 20736 backedges. 0 proven. 10368 refuted. 0 times theorem prover too weak. 10368 trivial. 0 not checked. [2018-02-04 17:48:34,715 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:48:34,715 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:48:34,716 INFO L109 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-02-04 17:48:34,944 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 73 check-sat command(s) [2018-02-04 17:48:34,944 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:48:34,980 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:48:35,093 INFO L134 CoverageAnalysis]: Checked inductivity of 20736 backedges. 0 proven. 10368 refuted. 0 times theorem prover too weak. 10368 trivial. 0 not checked. [2018-02-04 17:48:35,093 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:48:35,093 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77, 75] total 78 [2018-02-04 17:48:35,094 INFO L409 AbstractCegarLoop]: Interpolant automaton has 78 states [2018-02-04 17:48:35,094 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-02-04 17:48:35,094 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2854, Invalid=3152, Unknown=0, NotChecked=0, Total=6006 [2018-02-04 17:48:35,094 INFO L87 Difference]: Start difference. First operand 607 states and 608 transitions. Second operand 78 states. [2018-02-04 17:48:36,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:48:36,686 INFO L93 Difference]: Finished difference Result 619 states and 620 transitions. [2018-02-04 17:48:36,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-02-04 17:48:36,687 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 601 [2018-02-04 17:48:36,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:48:36,688 INFO L225 Difference]: With dead ends: 619 [2018-02-04 17:48:36,688 INFO L226 Difference]: Without dead ends: 619 [2018-02-04 17:48:36,688 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 823 GetRequests, 674 SyntacticMatches, 0 SemanticMatches, 149 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2913 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=8403, Invalid=14247, Unknown=0, NotChecked=0, Total=22650 [2018-02-04 17:48:36,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 619 states. [2018-02-04 17:48:36,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 619 to 615. [2018-02-04 17:48:36,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 615 states. [2018-02-04 17:48:36,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 615 states to 615 states and 616 transitions. [2018-02-04 17:48:36,691 INFO L78 Accepts]: Start accepts. Automaton has 615 states and 616 transitions. Word has length 601 [2018-02-04 17:48:36,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:48:36,691 INFO L432 AbstractCegarLoop]: Abstraction has 615 states and 616 transitions. [2018-02-04 17:48:36,691 INFO L433 AbstractCegarLoop]: Interpolant automaton has 78 states. [2018-02-04 17:48:36,691 INFO L276 IsEmpty]: Start isEmpty. Operand 615 states and 616 transitions. [2018-02-04 17:48:36,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 610 [2018-02-04 17:48:36,693 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:48:36,693 INFO L351 BasicCegarLoop]: trace histogram [74, 74, 73, 73, 73, 73, 73, 73, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:48:36,693 INFO L371 AbstractCegarLoop]: === Iteration 79 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 17:48:36,693 INFO L82 PathProgramCache]: Analyzing trace with hash -84271172, now seen corresponding path program 67 times [2018-02-04 17:48:36,693 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:48:36,693 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:48:36,693 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:48:36,694 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:48:36,694 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:48:36,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:48:36,743 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:48:38,962 INFO L134 CoverageAnalysis]: Checked inductivity of 21316 backedges. 0 proven. 10658 refuted. 0 times theorem prover too weak. 10658 trivial. 0 not checked. [2018-02-04 17:48:38,962 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:48:38,962 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:48:38,962 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:48:38,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:48:39,008 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:48:40,586 INFO L134 CoverageAnalysis]: Checked inductivity of 21316 backedges. 0 proven. 10658 refuted. 0 times theorem prover too weak. 10658 trivial. 0 not checked. [2018-02-04 17:48:40,586 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:48:40,586 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78, 77] total 152 [2018-02-04 17:48:40,587 INFO L409 AbstractCegarLoop]: Interpolant automaton has 152 states [2018-02-04 17:48:40,587 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 152 interpolants. [2018-02-04 17:48:40,588 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8551, Invalid=14401, Unknown=0, NotChecked=0, Total=22952 [2018-02-04 17:48:40,588 INFO L87 Difference]: Start difference. First operand 615 states and 616 transitions. Second operand 152 states. [2018-02-04 17:48:41,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:48:41,747 INFO L93 Difference]: Finished difference Result 627 states and 628 transitions. [2018-02-04 17:48:41,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-02-04 17:48:41,747 INFO L78 Accepts]: Start accepts. Automaton has 152 states. Word has length 609 [2018-02-04 17:48:41,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:48:41,748 INFO L225 Difference]: With dead ends: 627 [2018-02-04 17:48:41,748 INFO L226 Difference]: Without dead ends: 627 [2018-02-04 17:48:41,749 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 687 GetRequests, 535 SyntacticMatches, 1 SemanticMatches, 151 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10875 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=8702, Invalid=14554, Unknown=0, NotChecked=0, Total=23256 [2018-02-04 17:48:41,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 627 states. [2018-02-04 17:48:41,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 627 to 623. [2018-02-04 17:48:41,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 623 states. [2018-02-04 17:48:41,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 623 states to 623 states and 624 transitions. [2018-02-04 17:48:41,752 INFO L78 Accepts]: Start accepts. Automaton has 623 states and 624 transitions. Word has length 609 [2018-02-04 17:48:41,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:48:41,752 INFO L432 AbstractCegarLoop]: Abstraction has 623 states and 624 transitions. [2018-02-04 17:48:41,752 INFO L433 AbstractCegarLoop]: Interpolant automaton has 152 states. [2018-02-04 17:48:41,752 INFO L276 IsEmpty]: Start isEmpty. Operand 623 states and 624 transitions. [2018-02-04 17:48:41,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 618 [2018-02-04 17:48:41,754 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:48:41,754 INFO L351 BasicCegarLoop]: trace histogram [75, 75, 74, 74, 74, 74, 74, 74, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:48:41,754 INFO L371 AbstractCegarLoop]: === Iteration 80 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 17:48:41,754 INFO L82 PathProgramCache]: Analyzing trace with hash -1878192996, now seen corresponding path program 68 times [2018-02-04 17:48:41,754 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:48:41,754 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:48:41,755 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:48:41,755 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:48:41,755 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:48:41,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:48:41,812 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:48:44,050 INFO L134 CoverageAnalysis]: Checked inductivity of 21904 backedges. 0 proven. 10952 refuted. 0 times theorem prover too weak. 10952 trivial. 0 not checked. [2018-02-04 17:48:44,051 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:48:44,051 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:48:44,051 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 17:48:44,125 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 17:48:44,125 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:48:44,156 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:48:44,274 INFO L134 CoverageAnalysis]: Checked inductivity of 21904 backedges. 0 proven. 10952 refuted. 0 times theorem prover too weak. 10952 trivial. 0 not checked. [2018-02-04 17:48:44,274 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:48:44,275 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79, 77] total 80 [2018-02-04 17:48:44,275 INFO L409 AbstractCegarLoop]: Interpolant automaton has 80 states [2018-02-04 17:48:44,276 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2018-02-04 17:48:44,276 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3007, Invalid=3313, Unknown=0, NotChecked=0, Total=6320 [2018-02-04 17:48:44,276 INFO L87 Difference]: Start difference. First operand 623 states and 624 transitions. Second operand 80 states. [2018-02-04 17:48:46,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:48:46,002 INFO L93 Difference]: Finished difference Result 635 states and 636 transitions. [2018-02-04 17:48:46,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2018-02-04 17:48:46,002 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 617 [2018-02-04 17:48:46,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:48:46,003 INFO L225 Difference]: With dead ends: 635 [2018-02-04 17:48:46,003 INFO L226 Difference]: Without dead ends: 635 [2018-02-04 17:48:46,004 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 845 GetRequests, 692 SyntacticMatches, 0 SemanticMatches, 153 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3068 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=8858, Invalid=15012, Unknown=0, NotChecked=0, Total=23870 [2018-02-04 17:48:46,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 635 states. [2018-02-04 17:48:46,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 635 to 631. [2018-02-04 17:48:46,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 631 states. [2018-02-04 17:48:46,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 631 states to 631 states and 632 transitions. [2018-02-04 17:48:46,007 INFO L78 Accepts]: Start accepts. Automaton has 631 states and 632 transitions. Word has length 617 [2018-02-04 17:48:46,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:48:46,007 INFO L432 AbstractCegarLoop]: Abstraction has 631 states and 632 transitions. [2018-02-04 17:48:46,007 INFO L433 AbstractCegarLoop]: Interpolant automaton has 80 states. [2018-02-04 17:48:46,007 INFO L276 IsEmpty]: Start isEmpty. Operand 631 states and 632 transitions. [2018-02-04 17:48:46,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 626 [2018-02-04 17:48:46,009 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:48:46,009 INFO L351 BasicCegarLoop]: trace histogram [76, 76, 75, 75, 75, 75, 75, 75, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:48:46,009 INFO L371 AbstractCegarLoop]: === Iteration 81 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 17:48:46,010 INFO L82 PathProgramCache]: Analyzing trace with hash -1341799812, now seen corresponding path program 69 times [2018-02-04 17:48:46,010 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:48:46,010 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:48:46,010 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:48:46,010 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:48:46,010 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:48:46,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:48:46,078 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:48:48,407 INFO L134 CoverageAnalysis]: Checked inductivity of 22500 backedges. 0 proven. 11250 refuted. 0 times theorem prover too weak. 11250 trivial. 0 not checked. [2018-02-04 17:48:48,407 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:48:48,407 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:48:48,407 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 17:48:48,544 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 76 check-sat command(s) [2018-02-04 17:48:48,544 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:48:48,609 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:48:50,237 INFO L134 CoverageAnalysis]: Checked inductivity of 22500 backedges. 0 proven. 11250 refuted. 0 times theorem prover too weak. 11250 trivial. 0 not checked. [2018-02-04 17:48:50,237 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:48:50,237 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80, 79] total 156 [2018-02-04 17:48:50,238 INFO L409 AbstractCegarLoop]: Interpolant automaton has 156 states [2018-02-04 17:48:50,238 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 156 interpolants. [2018-02-04 17:48:50,239 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9010, Invalid=15170, Unknown=0, NotChecked=0, Total=24180 [2018-02-04 17:48:50,239 INFO L87 Difference]: Start difference. First operand 631 states and 632 transitions. Second operand 156 states. [2018-02-04 17:48:51,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:48:51,541 INFO L93 Difference]: Finished difference Result 643 states and 644 transitions. [2018-02-04 17:48:51,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2018-02-04 17:48:51,542 INFO L78 Accepts]: Start accepts. Automaton has 156 states. Word has length 625 [2018-02-04 17:48:51,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:48:51,543 INFO L225 Difference]: With dead ends: 643 [2018-02-04 17:48:51,543 INFO L226 Difference]: Without dead ends: 643 [2018-02-04 17:48:51,543 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 705 GetRequests, 549 SyntacticMatches, 1 SemanticMatches, 155 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11473 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=9165, Invalid=15327, Unknown=0, NotChecked=0, Total=24492 [2018-02-04 17:48:51,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 643 states. [2018-02-04 17:48:51,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 643 to 639. [2018-02-04 17:48:51,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 639 states. [2018-02-04 17:48:51,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 639 states and 640 transitions. [2018-02-04 17:48:51,547 INFO L78 Accepts]: Start accepts. Automaton has 639 states and 640 transitions. Word has length 625 [2018-02-04 17:48:51,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:48:51,547 INFO L432 AbstractCegarLoop]: Abstraction has 639 states and 640 transitions. [2018-02-04 17:48:51,547 INFO L433 AbstractCegarLoop]: Interpolant automaton has 156 states. [2018-02-04 17:48:51,547 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 640 transitions. [2018-02-04 17:48:51,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 634 [2018-02-04 17:48:51,549 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:48:51,549 INFO L351 BasicCegarLoop]: trace histogram [77, 77, 76, 76, 76, 76, 76, 76, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:48:51,549 INFO L371 AbstractCegarLoop]: === Iteration 82 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 17:48:51,550 INFO L82 PathProgramCache]: Analyzing trace with hash -695287460, now seen corresponding path program 70 times [2018-02-04 17:48:51,550 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:48:51,550 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:48:51,550 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:48:51,550 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:48:51,550 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:48:51,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:48:51,608 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. Received shutdown request... [2018-02-04 17:48:53,615 WARN L491 AbstractCegarLoop]: Verification canceled [2018-02-04 17:48:53,618 WARN L185 ceAbstractionStarter]: Timeout [2018-02-04 17:48:53,619 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.02 05:48:53 BoogieIcfgContainer [2018-02-04 17:48:53,619 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-04 17:48:53,619 INFO L168 Benchmark]: Toolchain (without parser) took 176395.97 ms. Allocated memory was 392.7 MB in the beginning and 2.4 GB in the end (delta: 2.0 GB). Free memory was 349.6 MB in the beginning and 1.0 GB in the end (delta: -653.5 MB). Peak memory consumption was 1.3 GB. Max. memory is 5.3 GB. [2018-02-04 17:48:53,620 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 392.7 MB. Free memory is still 354.9 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 17:48:53,620 INFO L168 Benchmark]: CACSL2BoogieTranslator took 162.41 ms. Allocated memory is still 392.7 MB. Free memory was 349.6 MB in the beginning and 338.9 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. [2018-02-04 17:48:53,620 INFO L168 Benchmark]: Boogie Preprocessor took 28.62 ms. Allocated memory is still 392.7 MB. Free memory was 338.9 MB in the beginning and 336.3 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. [2018-02-04 17:48:53,620 INFO L168 Benchmark]: RCFGBuilder took 193.54 ms. Allocated memory is still 392.7 MB. Free memory was 336.3 MB in the beginning and 319.6 MB in the end (delta: 16.7 MB). Peak memory consumption was 16.7 MB. Max. memory is 5.3 GB. [2018-02-04 17:48:53,620 INFO L168 Benchmark]: TraceAbstraction took 176008.37 ms. Allocated memory was 392.7 MB in the beginning and 2.4 GB in the end (delta: 2.0 GB). Free memory was 317.0 MB in the beginning and 1.0 GB in the end (delta: -686.1 MB). Peak memory consumption was 1.3 GB. Max. memory is 5.3 GB. [2018-02-04 17:48:53,621 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 392.7 MB. Free memory is still 354.9 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 162.41 ms. Allocated memory is still 392.7 MB. Free memory was 349.6 MB in the beginning and 338.9 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 28.62 ms. Allocated memory is still 392.7 MB. Free memory was 338.9 MB in the beginning and 336.3 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 193.54 ms. Allocated memory is still 392.7 MB. Free memory was 336.3 MB in the beginning and 319.6 MB in the end (delta: 16.7 MB). Peak memory consumption was 16.7 MB. Max. memory is 5.3 GB. * TraceAbstraction took 176008.37 ms. Allocated memory was 392.7 MB in the beginning and 2.4 GB in the end (delta: 2.0 GB). Free memory was 317.0 MB in the beginning and 1.0 GB in the end (delta: -686.1 MB). Peak memory consumption was 1.3 GB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 625). Cancelled while BasicCegarLoop was analyzing trace of length 634 with TraceHistMax 77, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 73 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 625). Cancelled while BasicCegarLoop was analyzing trace of length 634 with TraceHistMax 77, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 73 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 627). Cancelled while BasicCegarLoop was analyzing trace of length 634 with TraceHistMax 77, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 73 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 627). Cancelled while BasicCegarLoop was analyzing trace of length 634 with TraceHistMax 77, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 73 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 637). Cancelled while BasicCegarLoop was analyzing trace of length 634 with TraceHistMax 77, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 73 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 634). Cancelled while BasicCegarLoop was analyzing trace of length 634 with TraceHistMax 77, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 73 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 639). Cancelled while BasicCegarLoop was analyzing trace of length 634 with TraceHistMax 77, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 73 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 634). Cancelled while BasicCegarLoop was analyzing trace of length 634 with TraceHistMax 77, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 73 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 636). Cancelled while BasicCegarLoop was analyzing trace of length 634 with TraceHistMax 77, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 73 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 637). Cancelled while BasicCegarLoop was analyzing trace of length 634 with TraceHistMax 77, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 73 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 639). Cancelled while BasicCegarLoop was analyzing trace of length 634 with TraceHistMax 77, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 73 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 639). Cancelled while BasicCegarLoop was analyzing trace of length 634 with TraceHistMax 77, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 73 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 639). Cancelled while BasicCegarLoop was analyzing trace of length 634 with TraceHistMax 77, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 73 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 636). Cancelled while BasicCegarLoop was analyzing trace of length 634 with TraceHistMax 77, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 73 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 637). Cancelled while BasicCegarLoop was analyzing trace of length 634 with TraceHistMax 77, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 73 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 637). Cancelled while BasicCegarLoop was analyzing trace of length 634 with TraceHistMax 77, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 73 known predicates. - TimeoutResultAtElement [Line: 629]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 629). Cancelled while BasicCegarLoop was analyzing trace of length 634 with TraceHistMax 77, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 73 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 53 locations, 17 error locations. TIMEOUT Result, 175.9s OverallTime, 82 OverallIterations, 77 TraceHistogramMax, 56.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2131 SDtfs, 39251 SDslu, 49160 SDs, 0 SdLazy, 38500 SolverSat, 9989 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 15.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 31137 GetRequests, 24012 SyntacticMatches, 37 SemanticMatches, 7088 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 304496 ImplicationChecksByTransitivity, 102.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=639occurred in iteration=81, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 81 MinimizatonAttempts, 348 StatesRemovedByMinimization, 77 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 5.7s SatisfiabilityAnalysisTime, 106.6s InterpolantComputationTime, 49306 NumberOfCodeBlocks, 48820 NumberOfCodeBlocksAsserted, 1591 NumberOfCheckSat, 49043 ConstructedInterpolants, 130 QuantifiedInterpolants, 77641336 SizeOfPredicates, 156 NumberOfNonLiveVariables, 61229 ConjunctsInSsa, 3650 ConjunctsInUnsatCore, 154 InterpolantComputations, 7 PerfectInterpolantSequences, 573568/1147260 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/960521-1_false-valid-free.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-04_17-48-53-625.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/960521-1_false-valid-free.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-04_17-48-53-625.csv Completed graceful shutdown