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-deref.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-c17473d-m [2018-02-04 17:42:55,259 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-04 17:42:55,261 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-04 17:42:55,274 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-04 17:42:55,274 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-04 17:42:55,275 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-04 17:42:55,276 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-04 17:42:55,277 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-04 17:42:55,279 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-04 17:42:55,279 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-04 17:42:55,280 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-04 17:42:55,280 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-04 17:42:55,281 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-04 17:42:55,282 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-04 17:42:55,283 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-04 17:42:55,284 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-04 17:42:55,286 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-04 17:42:55,287 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-04 17:42:55,288 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-04 17:42:55,289 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-04 17:42:55,291 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-04 17:42:55,291 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-04 17:42:55,291 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-04 17:42:55,292 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-04 17:42:55,293 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-04 17:42:55,294 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-04 17:42:55,294 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-04 17:42:55,294 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-04 17:42:55,295 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-04 17:42:55,295 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-04 17:42:55,295 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-04 17:42:55,295 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:42:55,304 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-04 17:42:55,304 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-04 17:42:55,305 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-04 17:42:55,306 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-04 17:42:55,306 INFO L133 SettingsManager]: * Use SBE=true [2018-02-04 17:42:55,306 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-04 17:42:55,306 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-04 17:42:55,306 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-04 17:42:55,306 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-04 17:42:55,306 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-04 17:42:55,306 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-04 17:42:55,307 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-04 17:42:55,307 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-04 17:42:55,307 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-04 17:42:55,307 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-04 17:42:55,307 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-04 17:42:55,307 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-04 17:42:55,307 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-04 17:42:55,308 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-04 17:42:55,308 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 17:42:55,308 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-04 17:42:55,308 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-04 17:42:55,308 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-04 17:42:55,308 INFO L133 SettingsManager]: * Trace refinement strategy=SMTINTERPOL [2018-02-04 17:42:55,338 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-04 17:42:55,348 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-04 17:42:55,352 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-04 17:42:55,353 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-04 17:42:55,353 INFO L276 PluginConnector]: CDTParser initialized [2018-02-04 17:42:55,354 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-deref.i [2018-02-04 17:42:55,512 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-04 17:42:55,513 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-04 17:42:55,513 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-04 17:42:55,514 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-04 17:42:55,519 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-04 17:42:55,520 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 05:42:55" (1/1) ... [2018-02-04 17:42:55,522 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@70f5748a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:42:55, skipping insertion in model container [2018-02-04 17:42:55,523 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 05:42:55" (1/1) ... [2018-02-04 17:42:55,536 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 17:42:55,564 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 17:42:55,659 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 17:42:55,670 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 17:42:55,675 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:42:55 WrapperNode [2018-02-04 17:42:55,675 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-04 17:42:55,676 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-04 17:42:55,676 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-04 17:42:55,676 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-04 17:42:55,689 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:42:55" (1/1) ... [2018-02-04 17:42:55,690 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:42:55" (1/1) ... [2018-02-04 17:42:55,697 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:42:55" (1/1) ... [2018-02-04 17:42:55,697 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:42:55" (1/1) ... [2018-02-04 17:42:55,700 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:42:55" (1/1) ... [2018-02-04 17:42:55,702 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:42:55" (1/1) ... [2018-02-04 17:42:55,703 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:42:55" (1/1) ... [2018-02-04 17:42:55,705 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-04 17:42:55,705 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-04 17:42:55,705 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-04 17:42:55,706 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-04 17:42:55,707 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:42:55" (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:42:55,741 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-04 17:42:55,741 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-04 17:42:55,741 INFO L136 BoogieDeclarations]: Found implementation of procedure foo [2018-02-04 17:42:55,741 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-04 17:42:55,741 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-04 17:42:55,741 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-04 17:42:55,741 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-04 17:42:55,741 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-04 17:42:55,742 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-04 17:42:55,742 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-04 17:42:55,742 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-04 17:42:55,742 INFO L128 BoogieDeclarations]: Found specification of procedure foo [2018-02-04 17:42:55,742 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-04 17:42:55,742 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-04 17:42:55,742 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-04 17:42:55,884 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-04 17:42:55,884 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 05:42:55 BoogieIcfgContainer [2018-02-04 17:42:55,884 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-04 17:42:55,884 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-04 17:42:55,885 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-04 17:42:55,886 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-04 17:42:55,886 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 05:42:55" (1/3) ... [2018-02-04 17:42:55,887 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b5331a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 05:42:55, skipping insertion in model container [2018-02-04 17:42:55,887 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:42:55" (2/3) ... [2018-02-04 17:42:55,887 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b5331a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 05:42:55, skipping insertion in model container [2018-02-04 17:42:55,887 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 05:42:55" (3/3) ... [2018-02-04 17:42:55,889 INFO L107 eAbstractionObserver]: Analyzing ICFG 960521-1_false-valid-deref.i [2018-02-04 17:42:55,894 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-04 17:42:55,898 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 17 error locations. [2018-02-04 17:42:55,919 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-04 17:42:55,919 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-04 17:42:55,919 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-04 17:42:55,920 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-04 17:42:55,920 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-04 17:42:55,920 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-04 17:42:55,920 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-04 17:42:55,920 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-04 17:42:55,920 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-04 17:42:55,928 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states. [2018-02-04 17:42:55,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-02-04 17:42:55,934 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:42:55,935 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:42:55,935 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:42:55,938 INFO L82 PathProgramCache]: Analyzing trace with hash 1993989713, now seen corresponding path program 1 times [2018-02-04 17:42:55,939 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:42:55,939 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:42:55,968 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:42:55,968 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:42:55,968 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:42:56,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:42:56,006 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:42:56,069 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:42:56,071 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:42:56,071 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 17:42:56,072 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 17:42:56,080 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 17:42:56,080 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 17:42:56,082 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 4 states. [2018-02-04 17:42:56,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:42:56,200 INFO L93 Difference]: Finished difference Result 52 states and 54 transitions. [2018-02-04 17:42:56,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 17:42:56,246 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2018-02-04 17:42:56,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:42:56,253 INFO L225 Difference]: With dead ends: 52 [2018-02-04 17:42:56,254 INFO L226 Difference]: Without dead ends: 49 [2018-02-04 17:42:56,255 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:42:56,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-02-04 17:42:56,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-02-04 17:42:56,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-02-04 17:42:56,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 51 transitions. [2018-02-04 17:42:56,278 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 51 transitions. Word has length 11 [2018-02-04 17:42:56,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:42:56,278 INFO L432 AbstractCegarLoop]: Abstraction has 49 states and 51 transitions. [2018-02-04 17:42:56,278 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 17:42:56,278 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 51 transitions. [2018-02-04 17:42:56,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-02-04 17:42:56,278 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:42:56,279 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:42:56,279 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:42:56,279 INFO L82 PathProgramCache]: Analyzing trace with hash 1993989714, now seen corresponding path program 1 times [2018-02-04 17:42:56,279 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:42:56,279 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:42:56,280 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:42:56,280 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:42:56,280 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:42:56,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:42:56,297 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:42:56,352 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:42:56,353 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:42:56,353 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 17:42:56,354 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 17:42:56,354 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 17:42:56,354 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 17:42:56,354 INFO L87 Difference]: Start difference. First operand 49 states and 51 transitions. Second operand 5 states. [2018-02-04 17:42:56,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:42:56,413 INFO L93 Difference]: Finished difference Result 48 states and 50 transitions. [2018-02-04 17:42:56,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 17:42:56,413 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2018-02-04 17:42:56,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:42:56,414 INFO L225 Difference]: With dead ends: 48 [2018-02-04 17:42:56,414 INFO L226 Difference]: Without dead ends: 48 [2018-02-04 17:42:56,415 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:42:56,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-02-04 17:42:56,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-02-04 17:42:56,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-02-04 17:42:56,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 50 transitions. [2018-02-04 17:42:56,420 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 50 transitions. Word has length 11 [2018-02-04 17:42:56,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:42:56,420 INFO L432 AbstractCegarLoop]: Abstraction has 48 states and 50 transitions. [2018-02-04 17:42:56,420 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 17:42:56,420 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 50 transitions. [2018-02-04 17:42:56,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-04 17:42:56,421 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:42:56,421 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:42:56,421 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:42:56,421 INFO L82 PathProgramCache]: Analyzing trace with hash -1188525484, now seen corresponding path program 1 times [2018-02-04 17:42:56,422 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:42:56,422 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:42:56,423 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:42:56,423 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:42:56,423 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:42:56,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:42:56,441 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:42:56,447 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:42:56,447 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:42:56,447 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:42:56,448 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:42:56,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:42:56,492 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:42:56,513 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:42:56,515 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:42:56,516 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:42:56,516 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-04 17:42:56,532 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:42:56,532 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:42:56,534 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:42:56,535 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:42:56,539 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:42:56,540 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:15 [2018-02-04 17:42:56,559 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:42:56,560 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:42:56,560 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 17:42:56,560 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 17:42:56,560 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 17:42:56,561 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-02-04 17:42:56,561 INFO L87 Difference]: Start difference. First operand 48 states and 50 transitions. Second operand 5 states. [2018-02-04 17:42:56,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:42:56,607 INFO L93 Difference]: Finished difference Result 45 states and 47 transitions. [2018-02-04 17:42:56,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 17:42:56,607 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-02-04 17:42:56,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:42:56,608 INFO L225 Difference]: With dead ends: 45 [2018-02-04 17:42:56,608 INFO L226 Difference]: Without dead ends: 45 [2018-02-04 17:42:56,608 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:42:56,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-02-04 17:42:56,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-02-04 17:42:56,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-02-04 17:42:56,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 47 transitions. [2018-02-04 17:42:56,611 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 47 transitions. Word has length 17 [2018-02-04 17:42:56,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:42:56,612 INFO L432 AbstractCegarLoop]: Abstraction has 45 states and 47 transitions. [2018-02-04 17:42:56,612 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 17:42:56,612 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 47 transitions. [2018-02-04 17:42:56,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-04 17:42:56,612 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:42:56,612 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:42:56,613 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:42:56,613 INFO L82 PathProgramCache]: Analyzing trace with hash -1188525483, now seen corresponding path program 1 times [2018-02-04 17:42:56,613 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:42:56,613 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:42:56,614 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:42:56,614 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:42:56,614 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:42:56,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:42:56,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:42:56,630 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:42:56,630 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:42:56,630 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:42:56,631 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:42:56,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:42:56,660 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:42:56,666 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:42:56,666 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:42:56,675 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:42:56,675 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:42:56,680 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:42:56,680 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:19 [2018-02-04 17:42:56,705 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:42:56,705 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:42:56,706 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:42:56,706 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:42:56,714 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:42:56,714 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:42:56,725 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:42:56,725 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:25 [2018-02-04 17:42:56,760 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:42:56,760 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:42:56,760 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 17:42:56,760 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 17:42:56,761 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 17:42:56,761 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-02-04 17:42:56,761 INFO L87 Difference]: Start difference. First operand 45 states and 47 transitions. Second operand 7 states. [2018-02-04 17:42:56,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:42:56,987 INFO L93 Difference]: Finished difference Result 53 states and 55 transitions. [2018-02-04 17:42:56,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 17:42:56,987 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2018-02-04 17:42:56,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:42:56,987 INFO L225 Difference]: With dead ends: 53 [2018-02-04 17:42:56,988 INFO L226 Difference]: Without dead ends: 53 [2018-02-04 17:42:56,988 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:42:56,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-02-04 17:42:56,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 48. [2018-02-04 17:42:56,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-02-04 17:42:56,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 50 transitions. [2018-02-04 17:42:56,990 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 50 transitions. Word has length 17 [2018-02-04 17:42:56,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:42:56,991 INFO L432 AbstractCegarLoop]: Abstraction has 48 states and 50 transitions. [2018-02-04 17:42:56,991 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 17:42:56,991 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 50 transitions. [2018-02-04 17:42:56,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-02-04 17:42:56,991 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:42:56,991 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:42:56,991 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:42:56,991 INFO L82 PathProgramCache]: Analyzing trace with hash -2106816852, now seen corresponding path program 1 times [2018-02-04 17:42:56,991 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:42:56,991 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:42:56,992 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:42:56,992 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:42:56,992 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:42:57,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:42:57,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:42:57,008 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:42:57,008 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:42:57,008 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:42:57,009 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:42:57,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:42:57,035 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:42:57,042 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:42:57,043 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:42:57,048 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:42:57,048 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:42:57,051 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:42:57,052 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:19 [2018-02-04 17:42:57,068 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:42:57,069 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:42:57,069 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:42:57,070 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:42:57,076 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:42:57,077 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:42:57,086 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:42:57,086 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:25 [2018-02-04 17:42:57,148 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:42:57,148 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 17:42:57,148 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-02-04 17:42:57,148 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 17:42:57,149 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 17:42:57,149 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-02-04 17:42:57,149 INFO L87 Difference]: Start difference. First operand 48 states and 50 transitions. Second operand 9 states. [2018-02-04 17:42:57,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:42:57,378 INFO L93 Difference]: Finished difference Result 57 states and 59 transitions. [2018-02-04 17:42:57,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-04 17:42:57,378 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2018-02-04 17:42:57,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:42:57,379 INFO L225 Difference]: With dead ends: 57 [2018-02-04 17:42:57,379 INFO L226 Difference]: Without dead ends: 57 [2018-02-04 17:42:57,379 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2018-02-04 17:42:57,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-02-04 17:42:57,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 52. [2018-02-04 17:42:57,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-02-04 17:42:57,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 54 transitions. [2018-02-04 17:42:57,382 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 54 transitions. Word has length 21 [2018-02-04 17:42:57,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:42:57,382 INFO L432 AbstractCegarLoop]: Abstraction has 52 states and 54 transitions. [2018-02-04 17:42:57,382 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 17:42:57,382 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 54 transitions. [2018-02-04 17:42:57,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-02-04 17:42:57,383 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:42:57,383 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:42:57,383 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:42:57,383 INFO L82 PathProgramCache]: Analyzing trace with hash -702775421, now seen corresponding path program 2 times [2018-02-04 17:42:57,383 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:42:57,383 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:42:57,384 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:42:57,384 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:42:57,384 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:42:57,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:42:57,394 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:42:57,399 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:42:57,400 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:42:57,400 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:42:57,400 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 17:42:57,429 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 17:42:57,429 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:42:57,432 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:42:57,437 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:42:57,437 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:42:57,441 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:42:57,441 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:42:57,445 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:42:57,445 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:19 [2018-02-04 17:42:57,461 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:42:57,461 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:42:57,462 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:42:57,471 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:42:57,471 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:42:57,472 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:42:57,472 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:42:57,477 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:42:57,477 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:25 [2018-02-04 17:42:57,546 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:42:57,546 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 17:42:57,546 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-02-04 17:42:57,546 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 17:42:57,546 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 17:42:57,546 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-02-04 17:42:57,546 INFO L87 Difference]: Start difference. First operand 52 states and 54 transitions. Second operand 9 states. [2018-02-04 17:42:57,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:42:57,802 INFO L93 Difference]: Finished difference Result 73 states and 75 transitions. [2018-02-04 17:42:57,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-04 17:42:57,803 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2018-02-04 17:42:57,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:42:57,804 INFO L225 Difference]: With dead ends: 73 [2018-02-04 17:42:57,804 INFO L226 Difference]: Without dead ends: 73 [2018-02-04 17:42:57,804 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:42:57,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-02-04 17:42:57,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 64. [2018-02-04 17:42:57,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-02-04 17:42:57,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 70 transitions. [2018-02-04 17:42:57,808 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 70 transitions. Word has length 25 [2018-02-04 17:42:57,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:42:57,808 INFO L432 AbstractCegarLoop]: Abstraction has 64 states and 70 transitions. [2018-02-04 17:42:57,808 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 17:42:57,808 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 70 transitions. [2018-02-04 17:42:57,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-02-04 17:42:57,809 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:42:57,809 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:42:57,809 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:42:57,810 INFO L82 PathProgramCache]: Analyzing trace with hash 1827026138, now seen corresponding path program 3 times [2018-02-04 17:42:57,810 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:42:57,810 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:42:57,810 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:42:57,810 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:42:57,810 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:42:57,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:42:57,821 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:42:57,827 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:42:57,827 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:42:57,827 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:42:57,828 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 17:42:57,848 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-02-04 17:42:57,848 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:42:57,851 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:42:57,861 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:42:57,861 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:42:57,866 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:42:57,867 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:42:57,871 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:42:57,871 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:19 [2018-02-04 17:42:57,886 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:42:57,888 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:42:57,889 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:42:57,900 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:42:57,901 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:42:57,901 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:42:57,902 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:42:57,909 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:42:57,909 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:25 [2018-02-04 17:42:57,994 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:42:57,994 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 17:42:57,994 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-02-04 17:42:57,994 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 17:42:57,995 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 17:42:57,995 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2018-02-04 17:42:57,995 INFO L87 Difference]: Start difference. First operand 64 states and 70 transitions. Second operand 9 states. [2018-02-04 17:42:58,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:42:58,200 INFO L93 Difference]: Finished difference Result 65 states and 69 transitions. [2018-02-04 17:42:58,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-04 17:42:58,201 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 29 [2018-02-04 17:42:58,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:42:58,202 INFO L225 Difference]: With dead ends: 65 [2018-02-04 17:42:58,202 INFO L226 Difference]: Without dead ends: 65 [2018-02-04 17:42:58,202 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:42:58,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-02-04 17:42:58,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 62. [2018-02-04 17:42:58,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-02-04 17:42:58,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 68 transitions. [2018-02-04 17:42:58,210 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 68 transitions. Word has length 29 [2018-02-04 17:42:58,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:42:58,210 INFO L432 AbstractCegarLoop]: Abstraction has 62 states and 68 transitions. [2018-02-04 17:42:58,210 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 17:42:58,211 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 68 transitions. [2018-02-04 17:42:58,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-02-04 17:42:58,211 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:42:58,211 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:42:58,212 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:42:58,212 INFO L82 PathProgramCache]: Analyzing trace with hash -1186509351, now seen corresponding path program 1 times [2018-02-04 17:42:58,212 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:42:58,212 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:42:58,213 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:42:58,213 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:42:58,213 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:42:58,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:42:58,220 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:42:58,258 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:42:58,258 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:42:58,258 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:42:58,259 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:42:58,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:42:58,274 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:42:58,317 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:42:58,317 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:42:58,317 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2018-02-04 17:42:58,318 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 17:42:58,318 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 17:42:58,318 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=61, Unknown=0, NotChecked=0, Total=110 [2018-02-04 17:42:58,318 INFO L87 Difference]: Start difference. First operand 62 states and 68 transitions. Second operand 11 states. [2018-02-04 17:42:58,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:42:58,367 INFO L93 Difference]: Finished difference Result 82 states and 84 transitions. [2018-02-04 17:42:58,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 17:42:58,367 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 32 [2018-02-04 17:42:58,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:42:58,368 INFO L225 Difference]: With dead ends: 82 [2018-02-04 17:42:58,368 INFO L226 Difference]: Without dead ends: 82 [2018-02-04 17:42:58,368 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:42:58,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-02-04 17:42:58,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 70. [2018-02-04 17:42:58,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-02-04 17:42:58,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 78 transitions. [2018-02-04 17:42:58,371 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 78 transitions. Word has length 32 [2018-02-04 17:42:58,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:42:58,371 INFO L432 AbstractCegarLoop]: Abstraction has 70 states and 78 transitions. [2018-02-04 17:42:58,371 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 17:42:58,371 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 78 transitions. [2018-02-04 17:42:58,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-02-04 17:42:58,375 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:42:58,375 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:42:58,375 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:42:58,375 INFO L82 PathProgramCache]: Analyzing trace with hash 547240098, now seen corresponding path program 2 times [2018-02-04 17:42:58,375 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:42:58,375 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:42:58,375 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:42:58,376 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:42:58,376 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:42:58,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:42:58,380 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:42:58,410 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:42:58,410 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:42:58,410 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:42:58,411 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 17:42:58,418 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-02-04 17:42:58,418 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:42:58,420 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:42:58,439 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:42:58,439 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:42:58,443 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:42:58,443 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2018-02-04 17:42:58,511 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:42:58,511 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-02-04 17:42:58,511 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 12 [2018-02-04 17:42:58,512 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-04 17:42:58,512 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-04 17:42:58,512 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2018-02-04 17:42:58,512 INFO L87 Difference]: Start difference. First operand 70 states and 78 transitions. Second operand 12 states. [2018-02-04 17:42:58,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:42:58,784 INFO L93 Difference]: Finished difference Result 81 states and 83 transitions. [2018-02-04 17:42:58,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-04 17:42:58,785 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 36 [2018-02-04 17:42:58,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:42:58,787 INFO L225 Difference]: With dead ends: 81 [2018-02-04 17:42:58,787 INFO L226 Difference]: Without dead ends: 81 [2018-02-04 17:42:58,787 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=115, Invalid=347, Unknown=0, NotChecked=0, Total=462 [2018-02-04 17:42:58,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-02-04 17:42:58,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 62. [2018-02-04 17:42:58,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-02-04 17:42:58,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 68 transitions. [2018-02-04 17:42:58,791 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 68 transitions. Word has length 36 [2018-02-04 17:42:58,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:42:58,791 INFO L432 AbstractCegarLoop]: Abstraction has 62 states and 68 transitions. [2018-02-04 17:42:58,791 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-04 17:42:58,791 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 68 transitions. [2018-02-04 17:42:58,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-02-04 17:42:58,792 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:42:58,792 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:42:58,792 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:42:58,792 INFO L82 PathProgramCache]: Analyzing trace with hash -645884182, now seen corresponding path program 1 times [2018-02-04 17:42:58,792 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:42:58,792 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:42:58,793 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:42:58,793 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:42:58,793 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:42:58,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:42:58,799 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:42:58,863 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:42:58,863 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:42:58,863 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 17:42:58,864 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 17:42:58,864 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 17:42:58,864 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 17:42:58,864 INFO L87 Difference]: Start difference. First operand 62 states and 68 transitions. Second operand 4 states. [2018-02-04 17:42:58,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:42:58,890 INFO L93 Difference]: Finished difference Result 60 states and 63 transitions. [2018-02-04 17:42:58,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 17:42:58,890 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 40 [2018-02-04 17:42:58,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:42:58,891 INFO L225 Difference]: With dead ends: 60 [2018-02-04 17:42:58,891 INFO L226 Difference]: Without dead ends: 60 [2018-02-04 17:42:58,891 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:42:58,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-02-04 17:42:58,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2018-02-04 17:42:58,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-02-04 17:42:58,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 63 transitions. [2018-02-04 17:42:58,894 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 63 transitions. Word has length 40 [2018-02-04 17:42:58,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:42:58,894 INFO L432 AbstractCegarLoop]: Abstraction has 60 states and 63 transitions. [2018-02-04 17:42:58,895 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 17:42:58,895 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 63 transitions. [2018-02-04 17:42:58,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-02-04 17:42:58,895 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:42:58,895 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:42:58,895 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:42:58,896 INFO L82 PathProgramCache]: Analyzing trace with hash 1747504322, now seen corresponding path program 1 times [2018-02-04 17:42:58,896 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:42:58,896 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:42:58,896 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:42:58,896 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:42:58,897 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:42:58,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:42:58,905 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:42:58,957 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:42:58,957 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:42:58,957 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:42:58,958 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:42:58,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:42:58,973 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:42:59,017 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:42:59,017 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:42:59,017 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2018-02-04 17:42:59,018 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-04 17:42:59,018 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-04 17:42:59,018 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=120, Unknown=0, NotChecked=0, Total=210 [2018-02-04 17:42:59,018 INFO L87 Difference]: Start difference. First operand 60 states and 63 transitions. Second operand 15 states. [2018-02-04 17:42:59,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:42:59,103 INFO L93 Difference]: Finished difference Result 81 states and 82 transitions. [2018-02-04 17:42:59,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 17:42:59,103 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 44 [2018-02-04 17:42:59,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:42:59,104 INFO L225 Difference]: With dead ends: 81 [2018-02-04 17:42:59,104 INFO L226 Difference]: Without dead ends: 81 [2018-02-04 17:42:59,104 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:42:59,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-02-04 17:42:59,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 72. [2018-02-04 17:42:59,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-02-04 17:42:59,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 77 transitions. [2018-02-04 17:42:59,107 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 77 transitions. Word has length 44 [2018-02-04 17:42:59,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:42:59,108 INFO L432 AbstractCegarLoop]: Abstraction has 72 states and 77 transitions. [2018-02-04 17:42:59,108 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-04 17:42:59,108 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 77 transitions. [2018-02-04 17:42:59,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-02-04 17:42:59,109 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:42:59,109 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:42:59,109 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:42:59,109 INFO L82 PathProgramCache]: Analyzing trace with hash -2024746485, now seen corresponding path program 2 times [2018-02-04 17:42:59,109 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:42:59,109 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:42:59,110 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:42:59,110 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:42:59,110 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:42:59,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:42:59,119 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:42:59,201 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:42:59,201 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:42:59,201 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:42:59,202 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 17:42:59,219 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 17:42:59,219 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:42:59,223 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:42:59,227 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:42:59,227 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:42:59,231 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:42:59,231 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2018-02-04 17:42:59,337 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:42:59,337 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-02-04 17:42:59,337 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [10] total 15 [2018-02-04 17:42:59,337 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-04 17:42:59,337 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-04 17:42:59,338 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2018-02-04 17:42:59,338 INFO L87 Difference]: Start difference. First operand 72 states and 77 transitions. Second operand 15 states. [2018-02-04 17:42:59,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:42:59,706 INFO L93 Difference]: Finished difference Result 85 states and 87 transitions. [2018-02-04 17:42:59,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-02-04 17:42:59,706 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 48 [2018-02-04 17:42:59,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:42:59,707 INFO L225 Difference]: With dead ends: 85 [2018-02-04 17:42:59,707 INFO L226 Difference]: Without dead ends: 85 [2018-02-04 17:42:59,707 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:42:59,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-02-04 17:42:59,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 75. [2018-02-04 17:42:59,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-02-04 17:42:59,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 76 transitions. [2018-02-04 17:42:59,709 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 76 transitions. Word has length 48 [2018-02-04 17:42:59,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:42:59,709 INFO L432 AbstractCegarLoop]: Abstraction has 75 states and 76 transitions. [2018-02-04 17:42:59,709 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-04 17:42:59,709 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 76 transitions. [2018-02-04 17:42:59,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-02-04 17:42:59,710 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:42:59,710 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] [2018-02-04 17:42:59,710 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:42:59,710 INFO L82 PathProgramCache]: Analyzing trace with hash -1106929516, now seen corresponding path program 1 times [2018-02-04 17:42:59,710 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:42:59,710 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:42:59,716 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:42:59,716 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:42:59,716 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:42:59,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:42:59,732 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:42:59,827 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:42:59,827 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:42:59,827 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:42:59,828 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:42:59,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:42:59,845 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:42:59,928 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:42:59,928 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:42:59,928 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 20 [2018-02-04 17:42:59,929 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-04 17:42:59,929 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-04 17:42:59,929 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=244, Unknown=0, NotChecked=0, Total=380 [2018-02-04 17:42:59,929 INFO L87 Difference]: Start difference. First operand 75 states and 76 transitions. Second operand 20 states. [2018-02-04 17:43:00,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:43:00,034 INFO L93 Difference]: Finished difference Result 91 states and 92 transitions. [2018-02-04 17:43:00,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-04 17:43:00,034 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 74 [2018-02-04 17:43:00,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:43:00,035 INFO L225 Difference]: With dead ends: 91 [2018-02-04 17:43:00,035 INFO L226 Difference]: Without dead ends: 91 [2018-02-04 17:43:00,035 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 66 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=155, Invalid=265, Unknown=0, NotChecked=0, Total=420 [2018-02-04 17:43:00,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-02-04 17:43:00,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 87. [2018-02-04 17:43:00,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-02-04 17:43:00,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 88 transitions. [2018-02-04 17:43:00,037 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 88 transitions. Word has length 74 [2018-02-04 17:43:00,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:43:00,038 INFO L432 AbstractCegarLoop]: Abstraction has 87 states and 88 transitions. [2018-02-04 17:43:00,038 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-04 17:43:00,038 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 88 transitions. [2018-02-04 17:43:00,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-02-04 17:43:00,039 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:43:00,039 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] [2018-02-04 17:43:00,039 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:43:00,039 INFO L82 PathProgramCache]: Analyzing trace with hash 2069780427, now seen corresponding path program 2 times [2018-02-04 17:43:00,039 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:43:00,039 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:43:00,040 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:43:00,040 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:43:00,040 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:43:00,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:43:00,053 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:43:00,144 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:43:00,144 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:43:00,144 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:43:00,145 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 17:43:00,156 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 17:43:00,156 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:43:00,158 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:43:00,171 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:43:00,171 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:43:00,171 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 14 [2018-02-04 17:43:00,172 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-04 17:43:00,172 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-04 17:43:00,172 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2018-02-04 17:43:00,172 INFO L87 Difference]: Start difference. First operand 87 states and 88 transitions. Second operand 14 states. [2018-02-04 17:43:00,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:43:00,266 INFO L93 Difference]: Finished difference Result 99 states and 100 transitions. [2018-02-04 17:43:00,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-04 17:43:00,266 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 86 [2018-02-04 17:43:00,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:43:00,267 INFO L225 Difference]: With dead ends: 99 [2018-02-04 17:43:00,267 INFO L226 Difference]: Without dead ends: 99 [2018-02-04 17:43:00,267 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 95 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:43:00,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-02-04 17:43:00,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 95. [2018-02-04 17:43:00,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-02-04 17:43:00,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 96 transitions. [2018-02-04 17:43:00,270 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 96 transitions. Word has length 86 [2018-02-04 17:43:00,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:43:00,270 INFO L432 AbstractCegarLoop]: Abstraction has 95 states and 96 transitions. [2018-02-04 17:43:00,271 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-04 17:43:00,271 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 96 transitions. [2018-02-04 17:43:00,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-02-04 17:43:00,272 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:43:00,272 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] [2018-02-04 17:43:00,272 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:43:00,272 INFO L82 PathProgramCache]: Analyzing trace with hash 67534827, now seen corresponding path program 3 times [2018-02-04 17:43:00,272 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:43:00,272 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:43:00,272 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:43:00,272 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:43:00,273 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:43:00,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:43:00,284 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:43:00,376 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:43:00,376 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:43:00,376 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:43:00,376 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 17:43:00,404 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-02-04 17:43:00,404 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:43:00,410 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:43:00,433 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:43:00,434 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:43:00,434 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 15 [2018-02-04 17:43:00,434 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-04 17:43:00,434 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-04 17:43:00,435 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=128, Unknown=0, NotChecked=0, Total=210 [2018-02-04 17:43:00,435 INFO L87 Difference]: Start difference. First operand 95 states and 96 transitions. Second operand 15 states. [2018-02-04 17:43:00,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:43:00,576 INFO L93 Difference]: Finished difference Result 107 states and 108 transitions. [2018-02-04 17:43:00,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-04 17:43:00,576 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 94 [2018-02-04 17:43:00,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:43:00,576 INFO L225 Difference]: With dead ends: 107 [2018-02-04 17:43:00,576 INFO L226 Difference]: Without dead ends: 107 [2018-02-04 17:43:00,577 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 104 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:43:00,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-02-04 17:43:00,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 103. [2018-02-04 17:43:00,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-02-04 17:43:00,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 104 transitions. [2018-02-04 17:43:00,578 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 104 transitions. Word has length 94 [2018-02-04 17:43:00,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:43:00,579 INFO L432 AbstractCegarLoop]: Abstraction has 103 states and 104 transitions. [2018-02-04 17:43:00,579 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-04 17:43:00,579 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 104 transitions. [2018-02-04 17:43:00,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-02-04 17:43:00,581 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:43:00,581 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] [2018-02-04 17:43:00,581 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:43:00,582 INFO L82 PathProgramCache]: Analyzing trace with hash 306183947, now seen corresponding path program 4 times [2018-02-04 17:43:00,582 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:43:00,582 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:43:00,582 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:43:00,582 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:43:00,582 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:43:00,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:43:00,590 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:43:00,678 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:43:00,678 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:43:00,678 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:43:00,679 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-04 17:43:00,696 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-04 17:43:00,696 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:43:00,699 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:43:00,703 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:43:00,703 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:43:00,706 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:43:00,706 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-02-04 17:43:01,037 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:43:01,037 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:43:01,037 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 26] total 39 [2018-02-04 17:43:01,038 INFO L409 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-02-04 17:43:01,038 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-02-04 17:43:01,038 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=338, Invalid=1144, Unknown=0, NotChecked=0, Total=1482 [2018-02-04 17:43:01,038 INFO L87 Difference]: Start difference. First operand 103 states and 104 transitions. Second operand 39 states. [2018-02-04 17:43:01,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:43:01,337 INFO L93 Difference]: Finished difference Result 115 states and 116 transitions. [2018-02-04 17:43:01,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-04 17:43:01,337 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 102 [2018-02-04 17:43:01,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:43:01,337 INFO L225 Difference]: With dead ends: 115 [2018-02-04 17:43:01,337 INFO L226 Difference]: Without dead ends: 115 [2018-02-04 17:43:01,338 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 79 SyntacticMatches, 1 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 909 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=595, Invalid=2161, Unknown=0, NotChecked=0, Total=2756 [2018-02-04 17:43:01,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-02-04 17:43:01,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 111. [2018-02-04 17:43:01,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-02-04 17:43:01,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 112 transitions. [2018-02-04 17:43:01,340 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 112 transitions. Word has length 102 [2018-02-04 17:43:01,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:43:01,340 INFO L432 AbstractCegarLoop]: Abstraction has 111 states and 112 transitions. [2018-02-04 17:43:01,340 INFO L433 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-02-04 17:43:01,340 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 112 transitions. [2018-02-04 17:43:01,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-02-04 17:43:01,341 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:43:01,341 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] [2018-02-04 17:43:01,341 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:43:01,341 INFO L82 PathProgramCache]: Analyzing trace with hash -2043652821, now seen corresponding path program 5 times [2018-02-04 17:43:01,341 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:43:01,341 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:43:01,342 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:43:01,342 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:43:01,342 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:43:01,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:43:01,349 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:43:01,467 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:43:01,467 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:43:01,467 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:43:01,468 INFO L109 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-04 17:43:01,489 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2018-02-04 17:43:01,489 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:43:01,491 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:43:01,503 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:43:01,503 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:43:01,503 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14] total 17 [2018-02-04 17:43:01,504 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-04 17:43:01,504 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-04 17:43:01,504 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=163, Unknown=0, NotChecked=0, Total=272 [2018-02-04 17:43:01,504 INFO L87 Difference]: Start difference. First operand 111 states and 112 transitions. Second operand 17 states. [2018-02-04 17:43:01,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:43:01,678 INFO L93 Difference]: Finished difference Result 123 states and 124 transitions. [2018-02-04 17:43:01,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-04 17:43:01,678 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 110 [2018-02-04 17:43:01,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:43:01,679 INFO L225 Difference]: With dead ends: 123 [2018-02-04 17:43:01,679 INFO L226 Difference]: Without dead ends: 123 [2018-02-04 17:43:01,679 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 122 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:43:01,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-02-04 17:43:01,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 119. [2018-02-04 17:43:01,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-02-04 17:43:01,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 120 transitions. [2018-02-04 17:43:01,682 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 120 transitions. Word has length 110 [2018-02-04 17:43:01,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:43:01,683 INFO L432 AbstractCegarLoop]: Abstraction has 119 states and 120 transitions. [2018-02-04 17:43:01,683 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-04 17:43:01,683 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 120 transitions. [2018-02-04 17:43:01,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-02-04 17:43:01,684 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:43:01,684 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] [2018-02-04 17:43:01,684 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:43:01,684 INFO L82 PathProgramCache]: Analyzing trace with hash -130219445, now seen corresponding path program 6 times [2018-02-04 17:43:01,684 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:43:01,684 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:43:01,685 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:43:01,685 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:43:01,685 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:43:01,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:43:01,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:43:01,852 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:43:01,852 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:43:01,853 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:43:01,853 INFO L109 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-02-04 17:43:01,888 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2018-02-04 17:43:01,889 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:43:01,895 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:43:01,916 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:43:01,916 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:43:01,916 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15] total 18 [2018-02-04 17:43:01,917 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-04 17:43:01,917 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-04 17:43:01,917 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=182, Unknown=0, NotChecked=0, Total=306 [2018-02-04 17:43:01,917 INFO L87 Difference]: Start difference. First operand 119 states and 120 transitions. Second operand 18 states. [2018-02-04 17:43:02,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:43:02,192 INFO L93 Difference]: Finished difference Result 131 states and 132 transitions. [2018-02-04 17:43:02,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-04 17:43:02,193 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 118 [2018-02-04 17:43:02,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:43:02,193 INFO L225 Difference]: With dead ends: 131 [2018-02-04 17:43:02,193 INFO L226 Difference]: Without dead ends: 131 [2018-02-04 17:43:02,194 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 131 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:43:02,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-02-04 17:43:02,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 127. [2018-02-04 17:43:02,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-02-04 17:43:02,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 128 transitions. [2018-02-04 17:43:02,196 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 128 transitions. Word has length 118 [2018-02-04 17:43:02,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:43:02,197 INFO L432 AbstractCegarLoop]: Abstraction has 127 states and 128 transitions. [2018-02-04 17:43:02,197 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-04 17:43:02,197 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 128 transitions. [2018-02-04 17:43:02,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2018-02-04 17:43:02,198 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:43:02,198 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] [2018-02-04 17:43:02,198 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:43:02,198 INFO L82 PathProgramCache]: Analyzing trace with hash -1727297941, now seen corresponding path program 7 times [2018-02-04 17:43:02,198 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:43:02,198 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:43:02,199 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:43:02,199 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:43:02,199 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:43:02,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:43:02,213 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:43:02,388 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:43:02,388 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:43:02,388 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:43:02,389 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:43:02,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:43:02,407 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:43:02,564 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:43:02,564 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:43:02,564 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17] total 32 [2018-02-04 17:43:02,564 INFO L409 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-02-04 17:43:02,565 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-02-04 17:43:02,565 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=361, Invalid=631, Unknown=0, NotChecked=0, Total=992 [2018-02-04 17:43:02,565 INFO L87 Difference]: Start difference. First operand 127 states and 128 transitions. Second operand 32 states. [2018-02-04 17:43:02,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:43:02,805 INFO L93 Difference]: Finished difference Result 139 states and 140 transitions. [2018-02-04 17:43:02,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-04 17:43:02,808 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 126 [2018-02-04 17:43:02,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:43:02,808 INFO L225 Difference]: With dead ends: 139 [2018-02-04 17:43:02,808 INFO L226 Difference]: Without dead ends: 139 [2018-02-04 17:43:02,809 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 112 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:43:02,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-02-04 17:43:02,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 135. [2018-02-04 17:43:02,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-02-04 17:43:02,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 136 transitions. [2018-02-04 17:43:02,810 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 136 transitions. Word has length 126 [2018-02-04 17:43:02,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:43:02,810 INFO L432 AbstractCegarLoop]: Abstraction has 135 states and 136 transitions. [2018-02-04 17:43:02,810 INFO L433 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-02-04 17:43:02,810 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 136 transitions. [2018-02-04 17:43:02,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-02-04 17:43:02,811 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:43:02,811 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] [2018-02-04 17:43:02,811 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:43:02,812 INFO L82 PathProgramCache]: Analyzing trace with hash 293691787, now seen corresponding path program 8 times [2018-02-04 17:43:02,812 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:43:02,812 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:43:02,812 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:43:02,812 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:43:02,813 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:43:02,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:43:02,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:43:03,009 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:43:03,009 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:43:03,009 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:43:03,010 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 17:43:03,033 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 17:43:03,033 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:43:03,037 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:43:03,059 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:43:03,059 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:43:03,059 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 17] total 20 [2018-02-04 17:43:03,060 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-04 17:43:03,060 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-04 17:43:03,060 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=223, Unknown=0, NotChecked=0, Total=380 [2018-02-04 17:43:03,060 INFO L87 Difference]: Start difference. First operand 135 states and 136 transitions. Second operand 20 states. [2018-02-04 17:43:03,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:43:03,426 INFO L93 Difference]: Finished difference Result 147 states and 148 transitions. [2018-02-04 17:43:03,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-04 17:43:03,426 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 134 [2018-02-04 17:43:03,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:43:03,427 INFO L225 Difference]: With dead ends: 147 [2018-02-04 17:43:03,427 INFO L226 Difference]: Without dead ends: 147 [2018-02-04 17:43:03,428 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=428, Invalid=762, Unknown=0, NotChecked=0, Total=1190 [2018-02-04 17:43:03,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-02-04 17:43:03,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 143. [2018-02-04 17:43:03,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-02-04 17:43:03,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 144 transitions. [2018-02-04 17:43:03,430 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 144 transitions. Word has length 134 [2018-02-04 17:43:03,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:43:03,431 INFO L432 AbstractCegarLoop]: Abstraction has 143 states and 144 transitions. [2018-02-04 17:43:03,431 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-04 17:43:03,431 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 144 transitions. [2018-02-04 17:43:03,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-02-04 17:43:03,431 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:43:03,432 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] [2018-02-04 17:43:03,432 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:43:03,432 INFO L82 PathProgramCache]: Analyzing trace with hash 1657017259, now seen corresponding path program 9 times [2018-02-04 17:43:03,432 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:43:03,432 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:43:03,433 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:43:03,433 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:43:03,433 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:43:03,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:43:03,445 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:43:03,647 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:43:03,647 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:43:03,647 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:43:03,648 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 17:43:03,682 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2018-02-04 17:43:03,683 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:43:03,688 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:43:03,851 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:43:03,851 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:43:03,851 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19] total 36 [2018-02-04 17:43:03,851 INFO L409 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-02-04 17:43:03,852 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-02-04 17:43:03,852 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=460, Invalid=800, Unknown=0, NotChecked=0, Total=1260 [2018-02-04 17:43:03,852 INFO L87 Difference]: Start difference. First operand 143 states and 144 transitions. Second operand 36 states. [2018-02-04 17:43:04,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:43:04,002 INFO L93 Difference]: Finished difference Result 155 states and 156 transitions. [2018-02-04 17:43:04,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-02-04 17:43:04,003 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 142 [2018-02-04 17:43:04,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:43:04,003 INFO L225 Difference]: With dead ends: 155 [2018-02-04 17:43:04,003 INFO L226 Difference]: Without dead ends: 155 [2018-02-04 17:43:04,004 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 126 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:43:04,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2018-02-04 17:43:04,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 151. [2018-02-04 17:43:04,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-02-04 17:43:04,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 152 transitions. [2018-02-04 17:43:04,005 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 152 transitions. Word has length 142 [2018-02-04 17:43:04,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:43:04,005 INFO L432 AbstractCegarLoop]: Abstraction has 151 states and 152 transitions. [2018-02-04 17:43:04,005 INFO L433 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-02-04 17:43:04,006 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 152 transitions. [2018-02-04 17:43:04,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-02-04 17:43:04,006 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:43:04,006 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] [2018-02-04 17:43:04,006 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:43:04,006 INFO L82 PathProgramCache]: Analyzing trace with hash -969335605, now seen corresponding path program 10 times [2018-02-04 17:43:04,006 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:43:04,006 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:43:04,007 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:43:04,007 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:43:04,007 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:43:04,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:43:04,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:43:04,190 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:43:04,191 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:43:04,191 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:43:04,191 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-04 17:43:04,220 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-04 17:43:04,220 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:43:04,226 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:43:04,228 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:43:04,229 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:43:04,232 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:43:04,232 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-02-04 17:43:04,987 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:43:04,987 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:43:04,987 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 38] total 57 [2018-02-04 17:43:04,987 INFO L409 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-02-04 17:43:04,987 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-02-04 17:43:04,988 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=722, Invalid=2470, Unknown=0, NotChecked=0, Total=3192 [2018-02-04 17:43:04,988 INFO L87 Difference]: Start difference. First operand 151 states and 152 transitions. Second operand 57 states. [2018-02-04 17:43:05,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:43:05,510 INFO L93 Difference]: Finished difference Result 163 states and 164 transitions. [2018-02-04 17:43:05,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-02-04 17:43:05,510 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 150 [2018-02-04 17:43:05,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:43:05,511 INFO L225 Difference]: With dead ends: 163 [2018-02-04 17:43:05,512 INFO L226 Difference]: Without dead ends: 163 [2018-02-04 17:43:05,513 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 115 SyntacticMatches, 1 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2121 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1264, Invalid=4588, Unknown=0, NotChecked=0, Total=5852 [2018-02-04 17:43:05,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2018-02-04 17:43:05,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 159. [2018-02-04 17:43:05,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2018-02-04 17:43:05,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 160 transitions. [2018-02-04 17:43:05,515 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 160 transitions. Word has length 150 [2018-02-04 17:43:05,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:43:05,516 INFO L432 AbstractCegarLoop]: Abstraction has 159 states and 160 transitions. [2018-02-04 17:43:05,516 INFO L433 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-02-04 17:43:05,516 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 160 transitions. [2018-02-04 17:43:05,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2018-02-04 17:43:05,517 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:43:05,517 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] [2018-02-04 17:43:05,517 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:43:05,517 INFO L82 PathProgramCache]: Analyzing trace with hash -1920598805, now seen corresponding path program 11 times [2018-02-04 17:43:05,517 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:43:05,517 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:43:05,518 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:43:05,518 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:43:05,518 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:43:05,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:43:05,532 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:43:05,765 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:43:05,766 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:43:05,766 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:43:05,766 INFO L109 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-04 17:43:05,792 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 18 check-sat command(s) [2018-02-04 17:43:05,792 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:43:05,796 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:43:05,825 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:43:05,826 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:43:05,826 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 20] total 23 [2018-02-04 17:43:05,826 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-04 17:43:05,826 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-04 17:43:05,827 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=214, Invalid=292, Unknown=0, NotChecked=0, Total=506 [2018-02-04 17:43:05,827 INFO L87 Difference]: Start difference. First operand 159 states and 160 transitions. Second operand 23 states. [2018-02-04 17:43:06,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:43:06,074 INFO L93 Difference]: Finished difference Result 171 states and 172 transitions. [2018-02-04 17:43:06,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-04 17:43:06,074 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 158 [2018-02-04 17:43:06,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:43:06,075 INFO L225 Difference]: With dead ends: 171 [2018-02-04 17:43:06,075 INFO L226 Difference]: Without dead ends: 171 [2018-02-04 17:43:06,076 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 218 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=593, Invalid=1047, Unknown=0, NotChecked=0, Total=1640 [2018-02-04 17:43:06,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2018-02-04 17:43:06,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 167. [2018-02-04 17:43:06,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2018-02-04 17:43:06,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 168 transitions. [2018-02-04 17:43:06,078 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 168 transitions. Word has length 158 [2018-02-04 17:43:06,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:43:06,078 INFO L432 AbstractCegarLoop]: Abstraction has 167 states and 168 transitions. [2018-02-04 17:43:06,078 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-04 17:43:06,078 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 168 transitions. [2018-02-04 17:43:06,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2018-02-04 17:43:06,079 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:43:06,079 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] [2018-02-04 17:43:06,079 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:43:06,079 INFO L82 PathProgramCache]: Analyzing trace with hash 43004939, now seen corresponding path program 12 times [2018-02-04 17:43:06,079 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:43:06,079 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:43:06,080 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:43:06,080 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:43:06,080 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:43:06,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:43:06,089 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:43:06,309 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:43:06,309 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:43:06,310 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:43:06,310 INFO L109 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-02-04 17:43:06,349 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2018-02-04 17:43:06,349 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:43:06,357 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:43:06,567 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:43:06,567 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:43:06,567 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22] total 42 [2018-02-04 17:43:06,568 INFO L409 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-02-04 17:43:06,568 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-02-04 17:43:06,568 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=631, Invalid=1091, Unknown=0, NotChecked=0, Total=1722 [2018-02-04 17:43:06,569 INFO L87 Difference]: Start difference. First operand 167 states and 168 transitions. Second operand 42 states. [2018-02-04 17:43:06,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:43:06,749 INFO L93 Difference]: Finished difference Result 179 states and 180 transitions. [2018-02-04 17:43:06,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-04 17:43:06,749 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 166 [2018-02-04 17:43:06,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:43:06,750 INFO L225 Difference]: With dead ends: 179 [2018-02-04 17:43:06,750 INFO L226 Difference]: Without dead ends: 179 [2018-02-04 17:43:06,751 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 147 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:43:06,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2018-02-04 17:43:06,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 175. [2018-02-04 17:43:06,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2018-02-04 17:43:06,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 176 transitions. [2018-02-04 17:43:06,754 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 176 transitions. Word has length 166 [2018-02-04 17:43:06,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:43:06,754 INFO L432 AbstractCegarLoop]: Abstraction has 175 states and 176 transitions. [2018-02-04 17:43:06,754 INFO L433 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-02-04 17:43:06,754 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 176 transitions. [2018-02-04 17:43:06,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2018-02-04 17:43:06,755 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:43:06,755 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] [2018-02-04 17:43:06,755 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:43:06,755 INFO L82 PathProgramCache]: Analyzing trace with hash 1199391275, now seen corresponding path program 13 times [2018-02-04 17:43:06,755 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:43:06,755 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:43:06,756 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:43:06,756 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:43:06,756 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:43:06,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:43:06,765 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:43:06,969 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:43:06,969 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:43:06,969 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:43:06,970 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:43:06,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:43:06,982 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:43:07,147 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:43:07,148 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:43:07,148 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 23] total 44 [2018-02-04 17:43:07,148 INFO L409 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-02-04 17:43:07,148 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-02-04 17:43:07,149 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=694, Invalid=1198, Unknown=0, NotChecked=0, Total=1892 [2018-02-04 17:43:07,149 INFO L87 Difference]: Start difference. First operand 175 states and 176 transitions. Second operand 44 states. [2018-02-04 17:43:07,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:43:07,338 INFO L93 Difference]: Finished difference Result 187 states and 188 transitions. [2018-02-04 17:43:07,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-02-04 17:43:07,338 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 174 [2018-02-04 17:43:07,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:43:07,339 INFO L225 Difference]: With dead ends: 187 [2018-02-04 17:43:07,339 INFO L226 Difference]: Without dead ends: 187 [2018-02-04 17:43:07,339 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 154 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 777 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=737, Invalid=1243, Unknown=0, NotChecked=0, Total=1980 [2018-02-04 17:43:07,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2018-02-04 17:43:07,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 183. [2018-02-04 17:43:07,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2018-02-04 17:43:07,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 184 transitions. [2018-02-04 17:43:07,341 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 184 transitions. Word has length 174 [2018-02-04 17:43:07,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:43:07,342 INFO L432 AbstractCegarLoop]: Abstraction has 183 states and 184 transitions. [2018-02-04 17:43:07,342 INFO L433 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-02-04 17:43:07,342 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 184 transitions. [2018-02-04 17:43:07,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2018-02-04 17:43:07,343 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:43:07,343 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] [2018-02-04 17:43:07,343 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:43:07,343 INFO L82 PathProgramCache]: Analyzing trace with hash 917677899, now seen corresponding path program 14 times [2018-02-04 17:43:07,343 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:43:07,343 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:43:07,344 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:43:07,344 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:43:07,344 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:43:07,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:43:07,355 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:43:07,625 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:43:07,625 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:43:07,625 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:43:07,626 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 17:43:07,667 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 17:43:07,667 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:43:07,671 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:43:07,706 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:43:07,706 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:43:07,706 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 23] total 26 [2018-02-04 17:43:07,707 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-02-04 17:43:07,707 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-02-04 17:43:07,707 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=280, Invalid=370, Unknown=0, NotChecked=0, Total=650 [2018-02-04 17:43:07,707 INFO L87 Difference]: Start difference. First operand 183 states and 184 transitions. Second operand 26 states. [2018-02-04 17:43:08,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:43:08,072 INFO L93 Difference]: Finished difference Result 195 states and 196 transitions. [2018-02-04 17:43:08,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-04 17:43:08,073 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 182 [2018-02-04 17:43:08,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:43:08,073 INFO L225 Difference]: With dead ends: 195 [2018-02-04 17:43:08,073 INFO L226 Difference]: Without dead ends: 195 [2018-02-04 17:43:08,074 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 248 GetRequests, 203 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:43:08,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2018-02-04 17:43:08,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 191. [2018-02-04 17:43:08,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2018-02-04 17:43:08,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 192 transitions. [2018-02-04 17:43:08,077 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 192 transitions. Word has length 182 [2018-02-04 17:43:08,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:43:08,078 INFO L432 AbstractCegarLoop]: Abstraction has 191 states and 192 transitions. [2018-02-04 17:43:08,078 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-02-04 17:43:08,078 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 192 transitions. [2018-02-04 17:43:08,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2018-02-04 17:43:08,079 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:43:08,079 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] [2018-02-04 17:43:08,079 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:43:08,079 INFO L82 PathProgramCache]: Analyzing trace with hash 1121313643, now seen corresponding path program 15 times [2018-02-04 17:43:08,079 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:43:08,079 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:43:08,080 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:43:08,080 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:43:08,080 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:43:08,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:43:08,093 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:43:08,371 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:43:08,371 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:43:08,371 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:43:08,372 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 17:43:08,404 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2018-02-04 17:43:08,404 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:43:08,413 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:43:08,451 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:43:08,452 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:43:08,452 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 24] total 27 [2018-02-04 17:43:08,452 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-02-04 17:43:08,453 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-02-04 17:43:08,453 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=304, Invalid=398, Unknown=0, NotChecked=0, Total=702 [2018-02-04 17:43:08,453 INFO L87 Difference]: Start difference. First operand 191 states and 192 transitions. Second operand 27 states. [2018-02-04 17:43:08,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:43:08,763 INFO L93 Difference]: Finished difference Result 203 states and 204 transitions. [2018-02-04 17:43:08,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-02-04 17:43:08,763 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 190 [2018-02-04 17:43:08,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:43:08,764 INFO L225 Difference]: With dead ends: 203 [2018-02-04 17:43:08,764 INFO L226 Difference]: Without dead ends: 203 [2018-02-04 17:43:08,765 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 259 GetRequests, 212 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 312 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=855, Invalid=1497, Unknown=0, NotChecked=0, Total=2352 [2018-02-04 17:43:08,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2018-02-04 17:43:08,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 199. [2018-02-04 17:43:08,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2018-02-04 17:43:08,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 200 transitions. [2018-02-04 17:43:08,769 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 200 transitions. Word has length 190 [2018-02-04 17:43:08,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:43:08,769 INFO L432 AbstractCegarLoop]: Abstraction has 199 states and 200 transitions. [2018-02-04 17:43:08,770 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-02-04 17:43:08,770 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 200 transitions. [2018-02-04 17:43:08,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2018-02-04 17:43:08,770 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:43:08,771 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] [2018-02-04 17:43:08,771 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:43:08,771 INFO L82 PathProgramCache]: Analyzing trace with hash 1456240267, now seen corresponding path program 16 times [2018-02-04 17:43:08,771 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:43:08,771 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:43:08,772 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:43:08,772 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:43:08,772 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:43:08,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:43:08,788 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:43:09,079 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:43:09,079 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:43:09,079 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:43:09,080 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-04 17:43:09,100 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-04 17:43:09,100 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:43:09,105 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:43:09,108 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:43:09,109 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:43:09,112 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:43:09,112 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-02-04 17:43:10,240 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:43:10,240 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:43:10,241 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 50] total 75 [2018-02-04 17:43:10,241 INFO L409 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-02-04 17:43:10,241 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-02-04 17:43:10,242 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1250, Invalid=4300, Unknown=0, NotChecked=0, Total=5550 [2018-02-04 17:43:10,242 INFO L87 Difference]: Start difference. First operand 199 states and 200 transitions. Second operand 75 states. [2018-02-04 17:43:10,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:43:10,822 INFO L93 Difference]: Finished difference Result 211 states and 212 transitions. [2018-02-04 17:43:10,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-02-04 17:43:10,822 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 198 [2018-02-04 17:43:10,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:43:10,823 INFO L225 Difference]: With dead ends: 211 [2018-02-04 17:43:10,823 INFO L226 Difference]: Without dead ends: 211 [2018-02-04 17:43:10,826 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 251 GetRequests, 151 SyntacticMatches, 1 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3837 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2185, Invalid=7915, Unknown=0, NotChecked=0, Total=10100 [2018-02-04 17:43:10,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2018-02-04 17:43:10,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 207. [2018-02-04 17:43:10,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2018-02-04 17:43:10,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 208 transitions. [2018-02-04 17:43:10,829 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 208 transitions. Word has length 198 [2018-02-04 17:43:10,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:43:10,830 INFO L432 AbstractCegarLoop]: Abstraction has 207 states and 208 transitions. [2018-02-04 17:43:10,830 INFO L433 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-02-04 17:43:10,830 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 208 transitions. [2018-02-04 17:43:10,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2018-02-04 17:43:10,830 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:43:10,831 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] [2018-02-04 17:43:10,831 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:43:10,831 INFO L82 PathProgramCache]: Analyzing trace with hash -1245978453, now seen corresponding path program 17 times [2018-02-04 17:43:10,831 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:43:10,831 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:43:10,832 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:43:10,832 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:43:10,832 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:43:10,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:43:10,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:43:11,187 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:43:11,187 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:43:11,187 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:43:11,188 INFO L109 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-04 17:43:11,231 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2018-02-04 17:43:11,232 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:43:11,237 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:43:11,269 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:43:11,270 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:43:11,270 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 26] total 29 [2018-02-04 17:43:11,270 INFO L409 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-02-04 17:43:11,271 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-02-04 17:43:11,271 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=355, Invalid=457, Unknown=0, NotChecked=0, Total=812 [2018-02-04 17:43:11,271 INFO L87 Difference]: Start difference. First operand 207 states and 208 transitions. Second operand 29 states. [2018-02-04 17:43:11,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:43:11,607 INFO L93 Difference]: Finished difference Result 219 states and 220 transitions. [2018-02-04 17:43:11,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-02-04 17:43:11,607 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 206 [2018-02-04 17:43:11,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:43:11,608 INFO L225 Difference]: With dead ends: 219 [2018-02-04 17:43:11,608 INFO L226 Difference]: Without dead ends: 219 [2018-02-04 17:43:11,609 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 281 GetRequests, 230 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 365 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=1004, Invalid=1752, Unknown=0, NotChecked=0, Total=2756 [2018-02-04 17:43:11,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2018-02-04 17:43:11,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 215. [2018-02-04 17:43:11,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2018-02-04 17:43:11,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 216 transitions. [2018-02-04 17:43:11,613 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 216 transitions. Word has length 206 [2018-02-04 17:43:11,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:43:11,613 INFO L432 AbstractCegarLoop]: Abstraction has 215 states and 216 transitions. [2018-02-04 17:43:11,613 INFO L433 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-02-04 17:43:11,613 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 216 transitions. [2018-02-04 17:43:11,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2018-02-04 17:43:11,614 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:43:11,614 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] [2018-02-04 17:43:11,614 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:43:11,614 INFO L82 PathProgramCache]: Analyzing trace with hash -620125749, now seen corresponding path program 18 times [2018-02-04 17:43:11,614 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:43:11,615 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:43:11,615 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:43:11,615 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:43:11,615 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:43:11,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:43:11,630 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:43:11,931 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:43:11,932 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:43:11,932 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:43:11,932 INFO L109 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-02-04 17:43:11,975 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 25 check-sat command(s) [2018-02-04 17:43:11,976 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:43:11,984 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:43:12,034 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:43:12,035 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:43:12,035 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 27] total 30 [2018-02-04 17:43:12,036 INFO L409 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-02-04 17:43:12,036 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-02-04 17:43:12,036 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=382, Invalid=488, Unknown=0, NotChecked=0, Total=870 [2018-02-04 17:43:12,036 INFO L87 Difference]: Start difference. First operand 215 states and 216 transitions. Second operand 30 states. [2018-02-04 17:43:12,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:43:12,598 INFO L93 Difference]: Finished difference Result 227 states and 228 transitions. [2018-02-04 17:43:12,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-02-04 17:43:12,598 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 214 [2018-02-04 17:43:12,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:43:12,599 INFO L225 Difference]: With dead ends: 227 [2018-02-04 17:43:12,599 INFO L226 Difference]: Without dead ends: 227 [2018-02-04 17:43:12,600 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 292 GetRequests, 239 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 393 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=1083, Invalid=1887, Unknown=0, NotChecked=0, Total=2970 [2018-02-04 17:43:12,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2018-02-04 17:43:12,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 223. [2018-02-04 17:43:12,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2018-02-04 17:43:12,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 224 transitions. [2018-02-04 17:43:12,603 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 224 transitions. Word has length 214 [2018-02-04 17:43:12,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:43:12,604 INFO L432 AbstractCegarLoop]: Abstraction has 223 states and 224 transitions. [2018-02-04 17:43:12,604 INFO L433 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-02-04 17:43:12,604 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 224 transitions. [2018-02-04 17:43:12,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2018-02-04 17:43:12,605 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:43:12,605 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] [2018-02-04 17:43:12,605 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:43:12,605 INFO L82 PathProgramCache]: Analyzing trace with hash 1515928043, now seen corresponding path program 19 times [2018-02-04 17:43:12,605 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:43:12,605 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:43:12,606 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:43:12,606 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:43:12,606 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:43:12,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:43:12,623 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:43:13,010 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:43:13,010 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:43:13,011 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:43:13,011 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:43:13,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:43:13,035 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:43:13,312 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:43:13,312 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:43:13,312 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 29] total 56 [2018-02-04 17:43:13,313 INFO L409 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-02-04 17:43:13,313 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-02-04 17:43:13,313 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1135, Invalid=1945, Unknown=0, NotChecked=0, Total=3080 [2018-02-04 17:43:13,314 INFO L87 Difference]: Start difference. First operand 223 states and 224 transitions. Second operand 56 states. [2018-02-04 17:43:13,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:43:13,503 INFO L93 Difference]: Finished difference Result 235 states and 236 transitions. [2018-02-04 17:43:13,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-02-04 17:43:13,504 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 222 [2018-02-04 17:43:13,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:43:13,505 INFO L225 Difference]: With dead ends: 235 [2018-02-04 17:43:13,505 INFO L226 Difference]: Without dead ends: 235 [2018-02-04 17:43:13,505 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 196 SyntacticMatches, 1 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1323 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=1190, Invalid=2002, Unknown=0, NotChecked=0, Total=3192 [2018-02-04 17:43:13,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2018-02-04 17:43:13,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 231. [2018-02-04 17:43:13,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2018-02-04 17:43:13,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 232 transitions. [2018-02-04 17:43:13,508 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 232 transitions. Word has length 222 [2018-02-04 17:43:13,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:43:13,509 INFO L432 AbstractCegarLoop]: Abstraction has 231 states and 232 transitions. [2018-02-04 17:43:13,509 INFO L433 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-02-04 17:43:13,509 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 232 transitions. [2018-02-04 17:43:13,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2018-02-04 17:43:13,510 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:43:13,510 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] [2018-02-04 17:43:13,510 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:43:13,510 INFO L82 PathProgramCache]: Analyzing trace with hash -1080678133, now seen corresponding path program 20 times [2018-02-04 17:43:13,511 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:43:13,511 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:43:13,511 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:43:13,511 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:43:13,511 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:43:13,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:43:13,550 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:43:13,893 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:43:13,894 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:43:13,894 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:43:13,894 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 17:43:13,910 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 17:43:13,910 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:43:13,913 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:43:13,945 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:43:13,945 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:43:13,945 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 29] total 32 [2018-02-04 17:43:13,945 INFO L409 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-02-04 17:43:13,946 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-02-04 17:43:13,946 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=439, Invalid=553, Unknown=0, NotChecked=0, Total=992 [2018-02-04 17:43:13,946 INFO L87 Difference]: Start difference. First operand 231 states and 232 transitions. Second operand 32 states. [2018-02-04 17:43:14,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:43:14,396 INFO L93 Difference]: Finished difference Result 243 states and 244 transitions. [2018-02-04 17:43:14,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-02-04 17:43:14,396 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 230 [2018-02-04 17:43:14,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:43:14,397 INFO L225 Difference]: With dead ends: 243 [2018-02-04 17:43:14,397 INFO L226 Difference]: Without dead ends: 243 [2018-02-04 17:43:14,397 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 314 GetRequests, 257 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:43:14,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2018-02-04 17:43:14,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 239. [2018-02-04 17:43:14,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 239 states. [2018-02-04 17:43:14,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 240 transitions. [2018-02-04 17:43:14,400 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 240 transitions. Word has length 230 [2018-02-04 17:43:14,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:43:14,400 INFO L432 AbstractCegarLoop]: Abstraction has 239 states and 240 transitions. [2018-02-04 17:43:14,400 INFO L433 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-02-04 17:43:14,400 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 240 transitions. [2018-02-04 17:43:14,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2018-02-04 17:43:14,400 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:43:14,401 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] [2018-02-04 17:43:14,401 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:43:14,401 INFO L82 PathProgramCache]: Analyzing trace with hash 1860169515, now seen corresponding path program 21 times [2018-02-04 17:43:14,401 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:43:14,401 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:43:14,401 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:43:14,401 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:43:14,401 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:43:14,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:43:14,413 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:43:14,779 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:43:14,779 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:43:14,779 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:43:14,780 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 17:43:14,813 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2018-02-04 17:43:14,814 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:43:14,821 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:43:15,309 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:43:15,309 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:43:15,310 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 31] total 60 [2018-02-04 17:43:15,310 INFO L409 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-02-04 17:43:15,311 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-02-04 17:43:15,311 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1306, Invalid=2234, Unknown=0, NotChecked=0, Total=3540 [2018-02-04 17:43:15,311 INFO L87 Difference]: Start difference. First operand 239 states and 240 transitions. Second operand 60 states. [2018-02-04 17:43:15,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:43:15,580 INFO L93 Difference]: Finished difference Result 251 states and 252 transitions. [2018-02-04 17:43:15,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-02-04 17:43:15,581 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 238 [2018-02-04 17:43:15,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:43:15,582 INFO L225 Difference]: With dead ends: 251 [2018-02-04 17:43:15,582 INFO L226 Difference]: Without dead ends: 251 [2018-02-04 17:43:15,582 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 270 GetRequests, 210 SyntacticMatches, 1 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1537 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1365, Invalid=2295, Unknown=0, NotChecked=0, Total=3660 [2018-02-04 17:43:15,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2018-02-04 17:43:15,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 247. [2018-02-04 17:43:15,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2018-02-04 17:43:15,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 248 transitions. [2018-02-04 17:43:15,586 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 248 transitions. Word has length 238 [2018-02-04 17:43:15,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:43:15,586 INFO L432 AbstractCegarLoop]: Abstraction has 247 states and 248 transitions. [2018-02-04 17:43:15,586 INFO L433 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-02-04 17:43:15,586 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 248 transitions. [2018-02-04 17:43:15,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2018-02-04 17:43:15,587 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:43:15,588 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] [2018-02-04 17:43:15,588 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:43:15,588 INFO L82 PathProgramCache]: Analyzing trace with hash -2070016949, now seen corresponding path program 22 times [2018-02-04 17:43:15,588 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:43:15,588 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:43:15,589 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:43:15,589 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:43:15,589 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:43:15,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:43:15,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:43:16,007 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:43:16,008 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:43:16,008 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:43:16,009 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-04 17:43:16,038 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-04 17:43:16,038 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:43:16,044 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:43:16,071 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:43:16,072 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:43:16,075 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:43:16,075 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-02-04 17:43:17,350 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:43:17,350 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:43:17,350 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 62] total 93 [2018-02-04 17:43:17,351 INFO L409 AbstractCegarLoop]: Interpolant automaton has 93 states [2018-02-04 17:43:17,351 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2018-02-04 17:43:17,352 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1922, Invalid=6634, Unknown=0, NotChecked=0, Total=8556 [2018-02-04 17:43:17,352 INFO L87 Difference]: Start difference. First operand 247 states and 248 transitions. Second operand 93 states. [2018-02-04 17:43:18,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:43:18,114 INFO L93 Difference]: Finished difference Result 259 states and 260 transitions. [2018-02-04 17:43:18,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-02-04 17:43:18,115 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 246 [2018-02-04 17:43:18,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:43:18,115 INFO L225 Difference]: With dead ends: 259 [2018-02-04 17:43:18,116 INFO L226 Difference]: Without dead ends: 259 [2018-02-04 17:43:18,116 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 311 GetRequests, 187 SyntacticMatches, 1 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6057 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=3358, Invalid=12142, Unknown=0, NotChecked=0, Total=15500 [2018-02-04 17:43:18,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2018-02-04 17:43:18,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 255. [2018-02-04 17:43:18,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2018-02-04 17:43:18,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 256 transitions. [2018-02-04 17:43:18,118 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 256 transitions. Word has length 246 [2018-02-04 17:43:18,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:43:18,118 INFO L432 AbstractCegarLoop]: Abstraction has 255 states and 256 transitions. [2018-02-04 17:43:18,118 INFO L433 AbstractCegarLoop]: Interpolant automaton has 93 states. [2018-02-04 17:43:18,119 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 256 transitions. [2018-02-04 17:43:18,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2018-02-04 17:43:18,119 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:43:18,119 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] [2018-02-04 17:43:18,119 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:43:18,119 INFO L82 PathProgramCache]: Analyzing trace with hash -1250557845, now seen corresponding path program 23 times [2018-02-04 17:43:18,119 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:43:18,120 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:43:18,120 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:43:18,120 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:43:18,120 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:43:18,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:43:18,133 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:43:18,477 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:43:18,477 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:43:18,477 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:43:18,477 INFO L109 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-04 17:43:18,504 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 30 check-sat command(s) [2018-02-04 17:43:18,504 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:43:18,508 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:43:18,534 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:43:18,535 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:43:18,535 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 32] total 35 [2018-02-04 17:43:18,535 INFO L409 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-02-04 17:43:18,535 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-02-04 17:43:18,535 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=532, Invalid=658, Unknown=0, NotChecked=0, Total=1190 [2018-02-04 17:43:18,535 INFO L87 Difference]: Start difference. First operand 255 states and 256 transitions. Second operand 35 states. [2018-02-04 17:43:18,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:43:18,953 INFO L93 Difference]: Finished difference Result 267 states and 268 transitions. [2018-02-04 17:43:18,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-02-04 17:43:18,953 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 254 [2018-02-04 17:43:18,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:43:18,954 INFO L225 Difference]: With dead ends: 267 [2018-02-04 17:43:18,954 INFO L226 Difference]: Without dead ends: 267 [2018-02-04 17:43:18,954 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 347 GetRequests, 284 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 548 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=1523, Invalid=2637, Unknown=0, NotChecked=0, Total=4160 [2018-02-04 17:43:18,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2018-02-04 17:43:18,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 263. [2018-02-04 17:43:18,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2018-02-04 17:43:18,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 264 transitions. [2018-02-04 17:43:18,956 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 264 transitions. Word has length 254 [2018-02-04 17:43:18,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:43:18,956 INFO L432 AbstractCegarLoop]: Abstraction has 263 states and 264 transitions. [2018-02-04 17:43:18,956 INFO L433 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-02-04 17:43:18,957 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 264 transitions. [2018-02-04 17:43:18,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2018-02-04 17:43:18,957 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:43:18,957 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] [2018-02-04 17:43:18,957 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:43:18,958 INFO L82 PathProgramCache]: Analyzing trace with hash 776817547, now seen corresponding path program 24 times [2018-02-04 17:43:18,958 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:43:18,958 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:43:18,958 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:43:18,958 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:43:18,958 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:43:18,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:43:18,973 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:43:19,328 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:43:19,328 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:43:19,328 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:43:19,328 INFO L109 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-02-04 17:43:19,390 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 31 check-sat command(s) [2018-02-04 17:43:19,390 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:43:19,405 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:43:19,849 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:43:19,849 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:43:19,849 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 34] total 66 [2018-02-04 17:43:19,850 INFO L409 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-02-04 17:43:19,850 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-02-04 17:43:19,850 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1585, Invalid=2705, Unknown=0, NotChecked=0, Total=4290 [2018-02-04 17:43:19,850 INFO L87 Difference]: Start difference. First operand 263 states and 264 transitions. Second operand 66 states. [2018-02-04 17:43:20,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:43:20,098 INFO L93 Difference]: Finished difference Result 275 states and 276 transitions. [2018-02-04 17:43:20,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-02-04 17:43:20,098 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 262 [2018-02-04 17:43:20,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:43:20,099 INFO L225 Difference]: With dead ends: 275 [2018-02-04 17:43:20,099 INFO L226 Difference]: Without dead ends: 275 [2018-02-04 17:43:20,099 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 297 GetRequests, 231 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:43:20,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2018-02-04 17:43:20,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 271. [2018-02-04 17:43:20,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2018-02-04 17:43:20,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 272 transitions. [2018-02-04 17:43:20,101 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 272 transitions. Word has length 262 [2018-02-04 17:43:20,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:43:20,101 INFO L432 AbstractCegarLoop]: Abstraction has 271 states and 272 transitions. [2018-02-04 17:43:20,101 INFO L433 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-02-04 17:43:20,101 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 272 transitions. [2018-02-04 17:43:20,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2018-02-04 17:43:20,102 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:43:20,102 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] [2018-02-04 17:43:20,102 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:43:20,102 INFO L82 PathProgramCache]: Analyzing trace with hash 1950969259, now seen corresponding path program 25 times [2018-02-04 17:43:20,102 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:43:20,102 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:43:20,102 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:43:20,103 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:43:20,103 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:43:20,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:43:20,116 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:43:20,539 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:43:20,539 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:43:20,539 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:43:20,540 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:43:20,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:43:20,556 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:43:20,941 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:43:20,942 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:43:20,942 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 35] total 68 [2018-02-04 17:43:20,942 INFO L409 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-02-04 17:43:20,942 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-02-04 17:43:20,942 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1684, Invalid=2872, Unknown=0, NotChecked=0, Total=4556 [2018-02-04 17:43:20,943 INFO L87 Difference]: Start difference. First operand 271 states and 272 transitions. Second operand 68 states. [2018-02-04 17:43:21,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:43:21,219 INFO L93 Difference]: Finished difference Result 283 states and 284 transitions. [2018-02-04 17:43:21,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-02-04 17:43:21,219 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 270 [2018-02-04 17:43:21,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:43:21,220 INFO L225 Difference]: With dead ends: 283 [2018-02-04 17:43:21,220 INFO L226 Difference]: Without dead ends: 283 [2018-02-04 17:43:21,220 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 306 GetRequests, 238 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:43:21,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2018-02-04 17:43:21,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 279. [2018-02-04 17:43:21,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 279 states. [2018-02-04 17:43:21,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 280 transitions. [2018-02-04 17:43:21,222 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 280 transitions. Word has length 270 [2018-02-04 17:43:21,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:43:21,222 INFO L432 AbstractCegarLoop]: Abstraction has 279 states and 280 transitions. [2018-02-04 17:43:21,222 INFO L433 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-02-04 17:43:21,222 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 280 transitions. [2018-02-04 17:43:21,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2018-02-04 17:43:21,223 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:43:21,223 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] [2018-02-04 17:43:21,223 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:43:21,223 INFO L82 PathProgramCache]: Analyzing trace with hash 1154475723, now seen corresponding path program 26 times [2018-02-04 17:43:21,223 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:43:21,223 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:43:21,223 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:43:21,224 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:43:21,224 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:43:21,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:43:21,238 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:43:21,668 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:43:21,668 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:43:21,668 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:43:21,669 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 17:43:21,688 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 17:43:21,688 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:43:21,692 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:43:21,740 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:43:21,741 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:43:21,741 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 35] total 38 [2018-02-04 17:43:21,741 INFO L409 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-02-04 17:43:21,742 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-02-04 17:43:21,742 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=634, Invalid=772, Unknown=0, NotChecked=0, Total=1406 [2018-02-04 17:43:21,742 INFO L87 Difference]: Start difference. First operand 279 states and 280 transitions. Second operand 38 states. [2018-02-04 17:43:22,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:43:22,228 INFO L93 Difference]: Finished difference Result 291 states and 292 transitions. [2018-02-04 17:43:22,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-02-04 17:43:22,228 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 278 [2018-02-04 17:43:22,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:43:22,229 INFO L225 Difference]: With dead ends: 291 [2018-02-04 17:43:22,229 INFO L226 Difference]: Without dead ends: 291 [2018-02-04 17:43:22,230 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 380 GetRequests, 311 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 653 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=1823, Invalid=3147, Unknown=0, NotChecked=0, Total=4970 [2018-02-04 17:43:22,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2018-02-04 17:43:22,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 287. [2018-02-04 17:43:22,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 287 states. [2018-02-04 17:43:22,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 288 transitions. [2018-02-04 17:43:22,233 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 288 transitions. Word has length 278 [2018-02-04 17:43:22,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:43:22,233 INFO L432 AbstractCegarLoop]: Abstraction has 287 states and 288 transitions. [2018-02-04 17:43:22,233 INFO L433 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-02-04 17:43:22,233 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 288 transitions. [2018-02-04 17:43:22,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2018-02-04 17:43:22,234 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:43:22,235 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] [2018-02-04 17:43:22,235 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:43:22,235 INFO L82 PathProgramCache]: Analyzing trace with hash 1971730155, now seen corresponding path program 27 times [2018-02-04 17:43:22,235 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:43:22,235 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:43:22,236 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:43:22,236 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:43:22,236 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:43:22,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:43:22,260 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:43:22,798 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:43:22,798 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:43:22,799 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:43:22,799 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 17:43:22,843 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 34 check-sat command(s) [2018-02-04 17:43:22,843 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:43:22,857 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:43:22,912 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:43:22,912 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:43:22,912 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 36] total 39 [2018-02-04 17:43:22,913 INFO L409 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-02-04 17:43:22,913 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-02-04 17:43:22,913 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=670, Invalid=812, Unknown=0, NotChecked=0, Total=1482 [2018-02-04 17:43:22,914 INFO L87 Difference]: Start difference. First operand 287 states and 288 transitions. Second operand 39 states. [2018-02-04 17:43:23,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:43:23,430 INFO L93 Difference]: Finished difference Result 299 states and 300 transitions. [2018-02-04 17:43:23,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-02-04 17:43:23,430 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 286 [2018-02-04 17:43:23,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:43:23,431 INFO L225 Difference]: With dead ends: 299 [2018-02-04 17:43:23,431 INFO L226 Difference]: Without dead ends: 299 [2018-02-04 17:43:23,432 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 391 GetRequests, 320 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 690 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1929, Invalid=3327, Unknown=0, NotChecked=0, Total=5256 [2018-02-04 17:43:23,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2018-02-04 17:43:23,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 295. [2018-02-04 17:43:23,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 295 states. [2018-02-04 17:43:23,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 296 transitions. [2018-02-04 17:43:23,435 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 296 transitions. Word has length 286 [2018-02-04 17:43:23,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:43:23,436 INFO L432 AbstractCegarLoop]: Abstraction has 295 states and 296 transitions. [2018-02-04 17:43:23,436 INFO L433 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-02-04 17:43:23,436 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 296 transitions. [2018-02-04 17:43:23,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 295 [2018-02-04 17:43:23,437 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:43:23,437 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] [2018-02-04 17:43:23,437 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:43:23,438 INFO L82 PathProgramCache]: Analyzing trace with hash -732832245, now seen corresponding path program 28 times [2018-02-04 17:43:23,438 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:43:23,438 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:43:23,438 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:43:23,438 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:43:23,438 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:43:23,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:43:23,460 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:43:23,996 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:43:23,996 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:43:23,996 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:43:23,997 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-04 17:43:24,032 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-04 17:43:24,033 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:43:24,041 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:43:24,052 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:43:24,052 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:43:24,054 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:43:24,054 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-02-04 17:43:25,750 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:43:25,750 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:43:25,750 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 74] total 111 [2018-02-04 17:43:25,750 INFO L409 AbstractCegarLoop]: Interpolant automaton has 111 states [2018-02-04 17:43:25,751 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2018-02-04 17:43:25,751 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2738, Invalid=9472, Unknown=0, NotChecked=0, Total=12210 [2018-02-04 17:43:25,751 INFO L87 Difference]: Start difference. First operand 295 states and 296 transitions. Second operand 111 states. [2018-02-04 17:43:26,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:43:26,733 INFO L93 Difference]: Finished difference Result 307 states and 308 transitions. [2018-02-04 17:43:26,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-02-04 17:43:26,733 INFO L78 Accepts]: Start accepts. Automaton has 111 states. Word has length 294 [2018-02-04 17:43:26,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:43:26,733 INFO L225 Difference]: With dead ends: 307 [2018-02-04 17:43:26,733 INFO L226 Difference]: Without dead ends: 307 [2018-02-04 17:43:26,734 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 371 GetRequests, 223 SyntacticMatches, 1 SemanticMatches, 147 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8781 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=4783, Invalid=17269, Unknown=0, NotChecked=0, Total=22052 [2018-02-04 17:43:26,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2018-02-04 17:43:26,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 303. [2018-02-04 17:43:26,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 303 states. [2018-02-04 17:43:26,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 304 transitions. [2018-02-04 17:43:26,737 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 304 transitions. Word has length 294 [2018-02-04 17:43:26,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:43:26,737 INFO L432 AbstractCegarLoop]: Abstraction has 303 states and 304 transitions. [2018-02-04 17:43:26,737 INFO L433 AbstractCegarLoop]: Interpolant automaton has 111 states. [2018-02-04 17:43:26,737 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 304 transitions. [2018-02-04 17:43:26,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2018-02-04 17:43:26,738 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:43:26,739 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] [2018-02-04 17:43:26,739 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:43:26,739 INFO L82 PathProgramCache]: Analyzing trace with hash 123231275, now seen corresponding path program 29 times [2018-02-04 17:43:26,739 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:43:26,739 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:43:26,740 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:43:26,740 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:43:26,740 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:43:26,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:43:26,758 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:43:27,240 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:43:27,240 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:43:27,240 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:43:27,240 INFO L109 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-04 17:43:27,277 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 36 check-sat command(s) [2018-02-04 17:43:27,277 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:43:27,282 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:43:27,339 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:43:27,339 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:43:27,339 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 38] total 41 [2018-02-04 17:43:27,340 INFO L409 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-02-04 17:43:27,340 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-02-04 17:43:27,340 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=745, Invalid=895, Unknown=0, NotChecked=0, Total=1640 [2018-02-04 17:43:27,340 INFO L87 Difference]: Start difference. First operand 303 states and 304 transitions. Second operand 41 states. [2018-02-04 17:43:27,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:43:27,915 INFO L93 Difference]: Finished difference Result 315 states and 316 transitions. [2018-02-04 17:43:27,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-02-04 17:43:27,915 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 302 [2018-02-04 17:43:27,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:43:27,916 INFO L225 Difference]: With dead ends: 315 [2018-02-04 17:43:27,916 INFO L226 Difference]: Without dead ends: 315 [2018-02-04 17:43:27,917 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 413 GetRequests, 338 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 767 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=2150, Invalid=3702, Unknown=0, NotChecked=0, Total=5852 [2018-02-04 17:43:27,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2018-02-04 17:43:27,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 311. [2018-02-04 17:43:27,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 311 states. [2018-02-04 17:43:27,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 312 transitions. [2018-02-04 17:43:27,920 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 312 transitions. Word has length 302 [2018-02-04 17:43:27,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:43:27,921 INFO L432 AbstractCegarLoop]: Abstraction has 311 states and 312 transitions. [2018-02-04 17:43:27,921 INFO L433 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-02-04 17:43:27,921 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 312 transitions. [2018-02-04 17:43:27,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 311 [2018-02-04 17:43:27,922 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:43:27,923 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] [2018-02-04 17:43:27,923 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:43:27,923 INFO L82 PathProgramCache]: Analyzing trace with hash 1828663627, now seen corresponding path program 30 times [2018-02-04 17:43:27,923 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:43:27,923 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:43:27,924 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:43:27,924 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:43:27,924 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:43:27,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:43:27,950 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:43:28,524 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:43:28,524 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:43:28,524 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:43:28,524 INFO L109 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-02-04 17:43:28,562 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 37 check-sat command(s) [2018-02-04 17:43:28,563 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:43:28,572 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:43:29,032 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:43:29,032 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:43:29,032 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 40] total 78 [2018-02-04 17:43:29,032 INFO L409 AbstractCegarLoop]: Interpolant automaton has 78 states [2018-02-04 17:43:29,033 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-02-04 17:43:29,033 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2224, Invalid=3782, Unknown=0, NotChecked=0, Total=6006 [2018-02-04 17:43:29,033 INFO L87 Difference]: Start difference. First operand 311 states and 312 transitions. Second operand 78 states. [2018-02-04 17:43:29,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:43:29,366 INFO L93 Difference]: Finished difference Result 323 states and 324 transitions. [2018-02-04 17:43:29,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-02-04 17:43:29,366 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 310 [2018-02-04 17:43:29,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:43:29,367 INFO L225 Difference]: With dead ends: 323 [2018-02-04 17:43:29,367 INFO L226 Difference]: Without dead ends: 323 [2018-02-04 17:43:29,367 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 351 GetRequests, 273 SyntacticMatches, 1 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2698 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=2301, Invalid=3861, Unknown=0, NotChecked=0, Total=6162 [2018-02-04 17:43:29,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2018-02-04 17:43:29,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 319. [2018-02-04 17:43:29,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 319 states. [2018-02-04 17:43:29,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 320 transitions. [2018-02-04 17:43:29,369 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 320 transitions. Word has length 310 [2018-02-04 17:43:29,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:43:29,370 INFO L432 AbstractCegarLoop]: Abstraction has 319 states and 320 transitions. [2018-02-04 17:43:29,370 INFO L433 AbstractCegarLoop]: Interpolant automaton has 78 states. [2018-02-04 17:43:29,370 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 320 transitions. [2018-02-04 17:43:29,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 319 [2018-02-04 17:43:29,371 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:43:29,371 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] [2018-02-04 17:43:29,371 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:43:29,371 INFO L82 PathProgramCache]: Analyzing trace with hash -68428437, now seen corresponding path program 31 times [2018-02-04 17:43:29,371 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:43:29,371 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:43:29,371 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:43:29,371 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:43:29,372 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:43:29,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:43:29,389 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:43:29,943 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:43:29,943 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:43:29,943 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:43:29,943 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:43:29,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:43:29,962 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:43:30,423 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:43:30,423 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:43:30,423 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 41] total 80 [2018-02-04 17:43:30,424 INFO L409 AbstractCegarLoop]: Interpolant automaton has 80 states [2018-02-04 17:43:30,424 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2018-02-04 17:43:30,424 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2341, Invalid=3979, Unknown=0, NotChecked=0, Total=6320 [2018-02-04 17:43:30,424 INFO L87 Difference]: Start difference. First operand 319 states and 320 transitions. Second operand 80 states. [2018-02-04 17:43:30,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:43:30,773 INFO L93 Difference]: Finished difference Result 331 states and 332 transitions. [2018-02-04 17:43:30,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-02-04 17:43:30,773 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 318 [2018-02-04 17:43:30,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:43:30,774 INFO L225 Difference]: With dead ends: 331 [2018-02-04 17:43:30,774 INFO L226 Difference]: Without dead ends: 331 [2018-02-04 17:43:30,775 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 360 GetRequests, 280 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:43:30,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2018-02-04 17:43:30,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 327. [2018-02-04 17:43:30,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 327 states. [2018-02-04 17:43:30,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 328 transitions. [2018-02-04 17:43:30,777 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 328 transitions. Word has length 318 [2018-02-04 17:43:30,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:43:30,778 INFO L432 AbstractCegarLoop]: Abstraction has 327 states and 328 transitions. [2018-02-04 17:43:30,778 INFO L433 AbstractCegarLoop]: Interpolant automaton has 80 states. [2018-02-04 17:43:30,778 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 328 transitions. [2018-02-04 17:43:30,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2018-02-04 17:43:30,779 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:43:30,779 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] [2018-02-04 17:43:30,779 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:43:30,780 INFO L82 PathProgramCache]: Analyzing trace with hash 587456651, now seen corresponding path program 32 times [2018-02-04 17:43:30,780 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:43:30,780 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:43:30,780 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:43:30,780 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:43:30,781 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:43:30,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:43:30,800 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:43:31,427 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:43:31,428 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:43:31,428 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:43:31,428 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 17:43:31,458 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 17:43:31,458 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:43:31,465 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:43:31,520 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:43:31,521 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:43:31,521 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 41] total 44 [2018-02-04 17:43:31,521 INFO L409 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-02-04 17:43:31,521 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-02-04 17:43:31,521 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=865, Invalid=1027, Unknown=0, NotChecked=0, Total=1892 [2018-02-04 17:43:31,522 INFO L87 Difference]: Start difference. First operand 327 states and 328 transitions. Second operand 44 states. [2018-02-04 17:43:32,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:43:32,188 INFO L93 Difference]: Finished difference Result 339 states and 340 transitions. [2018-02-04 17:43:32,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-02-04 17:43:32,188 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 326 [2018-02-04 17:43:32,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:43:32,189 INFO L225 Difference]: With dead ends: 339 [2018-02-04 17:43:32,189 INFO L226 Difference]: Without dead ends: 339 [2018-02-04 17:43:32,189 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 446 GetRequests, 365 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 890 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=2504, Invalid=4302, Unknown=0, NotChecked=0, Total=6806 [2018-02-04 17:43:32,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2018-02-04 17:43:32,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 335. [2018-02-04 17:43:32,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 335 states. [2018-02-04 17:43:32,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 336 transitions. [2018-02-04 17:43:32,192 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 336 transitions. Word has length 326 [2018-02-04 17:43:32,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:43:32,192 INFO L432 AbstractCegarLoop]: Abstraction has 335 states and 336 transitions. [2018-02-04 17:43:32,192 INFO L433 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-02-04 17:43:32,192 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 336 transitions. [2018-02-04 17:43:32,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 335 [2018-02-04 17:43:32,193 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:43:32,193 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] [2018-02-04 17:43:32,193 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:43:32,193 INFO L82 PathProgramCache]: Analyzing trace with hash -1452492117, now seen corresponding path program 33 times [2018-02-04 17:43:32,193 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:43:32,193 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:43:32,194 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:43:32,194 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:43:32,194 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:43:32,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:43:32,215 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:43:32,864 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:43:32,864 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:43:32,864 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:43:32,865 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 17:43:32,909 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 40 check-sat command(s) [2018-02-04 17:43:32,909 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:43:32,920 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:43:33,444 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:43:33,444 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:43:33,445 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 43] total 84 [2018-02-04 17:43:33,445 INFO L409 AbstractCegarLoop]: Interpolant automaton has 84 states [2018-02-04 17:43:33,445 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2018-02-04 17:43:33,446 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2584, Invalid=4388, Unknown=0, NotChecked=0, Total=6972 [2018-02-04 17:43:33,446 INFO L87 Difference]: Start difference. First operand 335 states and 336 transitions. Second operand 84 states. [2018-02-04 17:43:33,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:43:33,789 INFO L93 Difference]: Finished difference Result 347 states and 348 transitions. [2018-02-04 17:43:33,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-02-04 17:43:33,790 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 334 [2018-02-04 17:43:33,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:43:33,790 INFO L225 Difference]: With dead ends: 347 [2018-02-04 17:43:33,790 INFO L226 Difference]: Without dead ends: 347 [2018-02-04 17:43:33,791 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 378 GetRequests, 294 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:43:33,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2018-02-04 17:43:33,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 343. [2018-02-04 17:43:33,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 343 states. [2018-02-04 17:43:33,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 344 transitions. [2018-02-04 17:43:33,793 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 344 transitions. Word has length 334 [2018-02-04 17:43:33,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:43:33,793 INFO L432 AbstractCegarLoop]: Abstraction has 343 states and 344 transitions. [2018-02-04 17:43:33,793 INFO L433 AbstractCegarLoop]: Interpolant automaton has 84 states. [2018-02-04 17:43:33,793 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 344 transitions. [2018-02-04 17:43:33,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 343 [2018-02-04 17:43:33,794 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:43:33,794 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] [2018-02-04 17:43:33,794 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:43:33,795 INFO L82 PathProgramCache]: Analyzing trace with hash -1903432757, now seen corresponding path program 34 times [2018-02-04 17:43:33,795 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:43:33,795 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:43:33,795 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:43:33,795 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:43:33,795 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:43:33,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:43:33,814 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:43:34,477 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:43:34,477 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:43:34,477 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:43:34,478 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-04 17:43:34,531 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-04 17:43:34,531 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:43:34,541 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:43:34,543 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:43:34,543 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:43:34,545 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:43:34,545 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-02-04 17:43:36,888 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:43:36,889 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:43:36,889 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 86] total 129 [2018-02-04 17:43:36,889 INFO L409 AbstractCegarLoop]: Interpolant automaton has 129 states [2018-02-04 17:43:36,890 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 129 interpolants. [2018-02-04 17:43:36,890 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3698, Invalid=12814, Unknown=0, NotChecked=0, Total=16512 [2018-02-04 17:43:36,890 INFO L87 Difference]: Start difference. First operand 343 states and 344 transitions. Second operand 129 states. [2018-02-04 17:43:38,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:43:38,140 INFO L93 Difference]: Finished difference Result 355 states and 356 transitions. [2018-02-04 17:43:38,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-02-04 17:43:38,140 INFO L78 Accepts]: Start accepts. Automaton has 129 states. Word has length 342 [2018-02-04 17:43:38,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:43:38,141 INFO L225 Difference]: With dead ends: 355 [2018-02-04 17:43:38,141 INFO L226 Difference]: Without dead ends: 355 [2018-02-04 17:43:38,142 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 431 GetRequests, 259 SyntacticMatches, 1 SemanticMatches, 171 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12009 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=6460, Invalid=23296, Unknown=0, NotChecked=0, Total=29756 [2018-02-04 17:43:38,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2018-02-04 17:43:38,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 351. [2018-02-04 17:43:38,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 351 states. [2018-02-04 17:43:38,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 352 transitions. [2018-02-04 17:43:38,144 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 352 transitions. Word has length 342 [2018-02-04 17:43:38,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:43:38,144 INFO L432 AbstractCegarLoop]: Abstraction has 351 states and 352 transitions. [2018-02-04 17:43:38,144 INFO L433 AbstractCegarLoop]: Interpolant automaton has 129 states. [2018-02-04 17:43:38,144 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 352 transitions. [2018-02-04 17:43:38,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 351 [2018-02-04 17:43:38,145 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:43:38,146 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] [2018-02-04 17:43:38,146 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:43:38,146 INFO L82 PathProgramCache]: Analyzing trace with hash -368643093, now seen corresponding path program 35 times [2018-02-04 17:43:38,146 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:43:38,146 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:43:38,147 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:43:38,147 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:43:38,147 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:43:38,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:43:38,180 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:43:38,860 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:43:38,860 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:43:38,860 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:43:38,860 INFO L109 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-04 17:43:38,903 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 42 check-sat command(s) [2018-02-04 17:43:38,903 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:43:38,909 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:43:38,951 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:43:38,952 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:43:38,952 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 44] total 47 [2018-02-04 17:43:38,952 INFO L409 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-02-04 17:43:38,952 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-02-04 17:43:38,952 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=994, Invalid=1168, Unknown=0, NotChecked=0, Total=2162 [2018-02-04 17:43:38,952 INFO L87 Difference]: Start difference. First operand 351 states and 352 transitions. Second operand 47 states. [2018-02-04 17:43:39,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:43:39,627 INFO L93 Difference]: Finished difference Result 363 states and 364 transitions. [2018-02-04 17:43:39,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-02-04 17:43:39,627 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 350 [2018-02-04 17:43:39,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:43:39,628 INFO L225 Difference]: With dead ends: 363 [2018-02-04 17:43:39,628 INFO L226 Difference]: Without dead ends: 363 [2018-02-04 17:43:39,628 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 479 GetRequests, 392 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:43:39,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2018-02-04 17:43:39,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 359. [2018-02-04 17:43:39,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 359 states. [2018-02-04 17:43:39,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 360 transitions. [2018-02-04 17:43:39,630 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 360 transitions. Word has length 350 [2018-02-04 17:43:39,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:43:39,631 INFO L432 AbstractCegarLoop]: Abstraction has 359 states and 360 transitions. [2018-02-04 17:43:39,631 INFO L433 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-02-04 17:43:39,631 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 360 transitions. [2018-02-04 17:43:39,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 359 [2018-02-04 17:43:39,632 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:43:39,632 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] [2018-02-04 17:43:39,632 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:43:39,632 INFO L82 PathProgramCache]: Analyzing trace with hash -876391669, now seen corresponding path program 36 times [2018-02-04 17:43:39,632 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:43:39,632 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:43:39,632 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:43:39,633 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:43:39,633 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:43:39,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:43:39,653 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:43:40,333 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:43:40,334 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:43:40,334 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:43:40,334 INFO L109 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-02-04 17:43:40,420 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 43 check-sat command(s) [2018-02-04 17:43:40,420 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:43:40,433 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:43:41,090 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:43:41,090 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:43:41,090 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 46] total 90 [2018-02-04 17:43:41,090 INFO L409 AbstractCegarLoop]: Interpolant automaton has 90 states [2018-02-04 17:43:41,091 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2018-02-04 17:43:41,091 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2971, Invalid=5039, Unknown=0, NotChecked=0, Total=8010 [2018-02-04 17:43:41,091 INFO L87 Difference]: Start difference. First operand 359 states and 360 transitions. Second operand 90 states. [2018-02-04 17:43:41,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:43:41,496 INFO L93 Difference]: Finished difference Result 371 states and 372 transitions. [2018-02-04 17:43:41,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-02-04 17:43:41,496 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 358 [2018-02-04 17:43:41,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:43:41,497 INFO L225 Difference]: With dead ends: 371 [2018-02-04 17:43:41,497 INFO L226 Difference]: Without dead ends: 371 [2018-02-04 17:43:41,498 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 405 GetRequests, 315 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:43:41,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2018-02-04 17:43:41,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 367. [2018-02-04 17:43:41,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 367 states. [2018-02-04 17:43:41,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 368 transitions. [2018-02-04 17:43:41,500 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 368 transitions. Word has length 358 [2018-02-04 17:43:41,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:43:41,501 INFO L432 AbstractCegarLoop]: Abstraction has 367 states and 368 transitions. [2018-02-04 17:43:41,501 INFO L433 AbstractCegarLoop]: Interpolant automaton has 90 states. [2018-02-04 17:43:41,501 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 368 transitions. [2018-02-04 17:43:41,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 367 [2018-02-04 17:43:41,502 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:43:41,503 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] [2018-02-04 17:43:41,503 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:43:41,503 INFO L82 PathProgramCache]: Analyzing trace with hash 468093227, now seen corresponding path program 37 times [2018-02-04 17:43:41,503 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:43:41,503 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:43:41,504 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:43:41,504 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:43:41,504 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:43:41,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:43:41,527 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:43:42,281 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:43:42,282 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:43:42,282 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:43:42,282 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:43:42,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:43:42,304 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:43:42,907 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:43:42,907 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:43:42,907 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 47] total 92 [2018-02-04 17:43:42,907 INFO L409 AbstractCegarLoop]: Interpolant automaton has 92 states [2018-02-04 17:43:42,908 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2018-02-04 17:43:42,908 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3106, Invalid=5266, Unknown=0, NotChecked=0, Total=8372 [2018-02-04 17:43:42,908 INFO L87 Difference]: Start difference. First operand 367 states and 368 transitions. Second operand 92 states. [2018-02-04 17:43:43,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:43:43,308 INFO L93 Difference]: Finished difference Result 379 states and 380 transitions. [2018-02-04 17:43:43,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-02-04 17:43:43,308 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 366 [2018-02-04 17:43:43,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:43:43,309 INFO L225 Difference]: With dead ends: 379 [2018-02-04 17:43:43,309 INFO L226 Difference]: Without dead ends: 379 [2018-02-04 17:43:43,309 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 414 GetRequests, 322 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:43:43,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2018-02-04 17:43:43,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 375. [2018-02-04 17:43:43,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2018-02-04 17:43:43,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 376 transitions. [2018-02-04 17:43:43,311 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 376 transitions. Word has length 366 [2018-02-04 17:43:43,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:43:43,311 INFO L432 AbstractCegarLoop]: Abstraction has 375 states and 376 transitions. [2018-02-04 17:43:43,312 INFO L433 AbstractCegarLoop]: Interpolant automaton has 92 states. [2018-02-04 17:43:43,312 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 376 transitions. [2018-02-04 17:43:43,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 375 [2018-02-04 17:43:43,312 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:43:43,313 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] [2018-02-04 17:43:43,313 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:43:43,313 INFO L82 PathProgramCache]: Analyzing trace with hash 2060850763, now seen corresponding path program 38 times [2018-02-04 17:43:43,313 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:43:43,313 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:43:43,313 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:43:43,313 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:43:43,313 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:43:43,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:43:43,335 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:43:44,126 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:43:44,126 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:43:44,126 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:43:44,127 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 17:43:44,154 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 17:43:44,155 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:43:44,160 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:43:44,209 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:43:44,209 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:43:44,209 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 47] total 50 [2018-02-04 17:43:44,209 INFO L409 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-02-04 17:43:44,210 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-02-04 17:43:44,210 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1132, Invalid=1318, Unknown=0, NotChecked=0, Total=2450 [2018-02-04 17:43:44,210 INFO L87 Difference]: Start difference. First operand 375 states and 376 transitions. Second operand 50 states. [2018-02-04 17:43:44,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:43:44,927 INFO L93 Difference]: Finished difference Result 387 states and 388 transitions. [2018-02-04 17:43:44,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-02-04 17:43:44,927 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 374 [2018-02-04 17:43:44,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:43:44,928 INFO L225 Difference]: With dead ends: 387 [2018-02-04 17:43:44,928 INFO L226 Difference]: Without dead ends: 387 [2018-02-04 17:43:44,929 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 512 GetRequests, 419 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:43:44,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2018-02-04 17:43:44,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 383. [2018-02-04 17:43:44,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2018-02-04 17:43:44,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 384 transitions. [2018-02-04 17:43:44,931 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 384 transitions. Word has length 374 [2018-02-04 17:43:44,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:43:44,931 INFO L432 AbstractCegarLoop]: Abstraction has 383 states and 384 transitions. [2018-02-04 17:43:44,931 INFO L433 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-02-04 17:43:44,931 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 384 transitions. [2018-02-04 17:43:44,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 383 [2018-02-04 17:43:44,932 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:43:44,932 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] [2018-02-04 17:43:44,932 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:43:44,932 INFO L82 PathProgramCache]: Analyzing trace with hash 557283947, now seen corresponding path program 39 times [2018-02-04 17:43:44,933 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:43:44,933 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:43:44,933 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:43:44,933 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:43:44,933 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:43:44,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:43:44,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:43:45,739 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:43:45,739 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:43:45,739 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:43:45,740 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 17:43:45,822 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 46 check-sat command(s) [2018-02-04 17:43:45,822 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:43:45,847 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:43:45,897 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:43:45,897 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:43:45,897 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 48] total 51 [2018-02-04 17:43:45,898 INFO L409 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-02-04 17:43:45,898 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-02-04 17:43:45,898 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1180, Invalid=1370, Unknown=0, NotChecked=0, Total=2550 [2018-02-04 17:43:45,898 INFO L87 Difference]: Start difference. First operand 383 states and 384 transitions. Second operand 51 states. [2018-02-04 17:43:46,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:43:46,686 INFO L93 Difference]: Finished difference Result 395 states and 396 transitions. [2018-02-04 17:43:46,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-02-04 17:43:46,687 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 382 [2018-02-04 17:43:46,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:43:46,688 INFO L225 Difference]: With dead ends: 395 [2018-02-04 17:43:46,688 INFO L226 Difference]: Without dead ends: 395 [2018-02-04 17:43:46,688 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 523 GetRequests, 428 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:43:46,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2018-02-04 17:43:46,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 391. [2018-02-04 17:43:46,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2018-02-04 17:43:46,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 392 transitions. [2018-02-04 17:43:46,691 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 392 transitions. Word has length 382 [2018-02-04 17:43:46,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:43:46,692 INFO L432 AbstractCegarLoop]: Abstraction has 391 states and 392 transitions. [2018-02-04 17:43:46,692 INFO L433 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-02-04 17:43:46,692 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 392 transitions. [2018-02-04 17:43:46,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 391 [2018-02-04 17:43:46,693 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:43:46,694 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] [2018-02-04 17:43:46,694 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:43:46,694 INFO L82 PathProgramCache]: Analyzing trace with hash -1074776693, now seen corresponding path program 40 times [2018-02-04 17:43:46,694 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:43:46,694 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:43:46,695 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:43:46,695 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:43:46,695 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:43:46,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:43:46,730 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:43:47,603 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:43:47,604 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:43:47,604 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:43:47,604 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-04 17:43:47,670 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-04 17:43:47,670 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:43:47,681 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:43:47,683 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:43:47,683 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:43:47,685 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:43:47,685 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-02-04 17:43:50,461 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:43:50,461 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:43:50,461 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 98] total 147 [2018-02-04 17:43:50,462 INFO L409 AbstractCegarLoop]: Interpolant automaton has 147 states [2018-02-04 17:43:50,462 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 147 interpolants. [2018-02-04 17:43:50,463 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4802, Invalid=16660, Unknown=0, NotChecked=0, Total=21462 [2018-02-04 17:43:50,463 INFO L87 Difference]: Start difference. First operand 391 states and 392 transitions. Second operand 147 states. [2018-02-04 17:43:51,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:43:51,947 INFO L93 Difference]: Finished difference Result 403 states and 404 transitions. [2018-02-04 17:43:51,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-02-04 17:43:51,948 INFO L78 Accepts]: Start accepts. Automaton has 147 states. Word has length 390 [2018-02-04 17:43:51,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:43:51,948 INFO L225 Difference]: With dead ends: 403 [2018-02-04 17:43:51,948 INFO L226 Difference]: Without dead ends: 403 [2018-02-04 17:43:51,949 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 491 GetRequests, 295 SyntacticMatches, 1 SemanticMatches, 195 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15741 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=8389, Invalid=30223, Unknown=0, NotChecked=0, Total=38612 [2018-02-04 17:43:51,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states. [2018-02-04 17:43:51,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 399. [2018-02-04 17:43:51,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 399 states. [2018-02-04 17:43:51,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 400 transitions. [2018-02-04 17:43:51,951 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 400 transitions. Word has length 390 [2018-02-04 17:43:51,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:43:51,951 INFO L432 AbstractCegarLoop]: Abstraction has 399 states and 400 transitions. [2018-02-04 17:43:51,951 INFO L433 AbstractCegarLoop]: Interpolant automaton has 147 states. [2018-02-04 17:43:51,951 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 400 transitions. [2018-02-04 17:43:51,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 399 [2018-02-04 17:43:51,953 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:43:51,953 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] [2018-02-04 17:43:51,953 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:43:51,953 INFO L82 PathProgramCache]: Analyzing trace with hash 1613088683, now seen corresponding path program 41 times [2018-02-04 17:43:51,953 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:43:51,953 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:43:51,954 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:43:51,954 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:43:51,954 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:43:51,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:43:51,978 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:43:52,803 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:43:52,803 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:43:52,803 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:43:52,804 INFO L109 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-04 17:43:52,864 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 48 check-sat command(s) [2018-02-04 17:43:52,864 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:43:52,873 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:43:52,928 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:43:52,928 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:43:52,928 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 50] total 53 [2018-02-04 17:43:52,929 INFO L409 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-02-04 17:43:52,929 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-02-04 17:43:52,929 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1279, Invalid=1477, Unknown=0, NotChecked=0, Total=2756 [2018-02-04 17:43:52,929 INFO L87 Difference]: Start difference. First operand 399 states and 400 transitions. Second operand 53 states. [2018-02-04 17:43:53,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:43:53,726 INFO L93 Difference]: Finished difference Result 411 states and 412 transitions. [2018-02-04 17:43:53,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-02-04 17:43:53,726 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 398 [2018-02-04 17:43:53,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:43:53,727 INFO L225 Difference]: With dead ends: 411 [2018-02-04 17:43:53,727 INFO L226 Difference]: Without dead ends: 411 [2018-02-04 17:43:53,727 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 545 GetRequests, 446 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:43:53,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2018-02-04 17:43:53,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 407. [2018-02-04 17:43:53,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2018-02-04 17:43:53,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 408 transitions. [2018-02-04 17:43:53,729 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 408 transitions. Word has length 398 [2018-02-04 17:43:53,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:43:53,729 INFO L432 AbstractCegarLoop]: Abstraction has 407 states and 408 transitions. [2018-02-04 17:43:53,729 INFO L433 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-02-04 17:43:53,729 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 408 transitions. [2018-02-04 17:43:53,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 407 [2018-02-04 17:43:53,731 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:43:53,731 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] [2018-02-04 17:43:53,731 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:43:53,731 INFO L82 PathProgramCache]: Analyzing trace with hash 1128116427, now seen corresponding path program 42 times [2018-02-04 17:43:53,731 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:43:53,731 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:43:53,732 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:43:53,732 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:43:53,732 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:43:53,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:43:53,757 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:43:54,631 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:43:54,632 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:43:54,632 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:43:54,632 INFO L109 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-02-04 17:43:54,705 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 49 check-sat command(s) [2018-02-04 17:43:54,705 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:43:54,726 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:43:54,809 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:43:54,809 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:43:54,809 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 51] total 54 [2018-02-04 17:43:54,810 INFO L409 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-02-04 17:43:54,810 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-02-04 17:43:54,810 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1330, Invalid=1532, Unknown=0, NotChecked=0, Total=2862 [2018-02-04 17:43:54,810 INFO L87 Difference]: Start difference. First operand 407 states and 408 transitions. Second operand 54 states. [2018-02-04 17:43:55,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:43:55,652 INFO L93 Difference]: Finished difference Result 419 states and 420 transitions. [2018-02-04 17:43:55,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-02-04 17:43:55,652 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 406 [2018-02-04 17:43:55,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:43:55,653 INFO L225 Difference]: With dead ends: 419 [2018-02-04 17:43:55,653 INFO L226 Difference]: Without dead ends: 419 [2018-02-04 17:43:55,653 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 556 GetRequests, 455 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1365 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=3879, Invalid=6627, Unknown=0, NotChecked=0, Total=10506 [2018-02-04 17:43:55,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2018-02-04 17:43:55,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 415. [2018-02-04 17:43:55,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 415 states. [2018-02-04 17:43:55,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 416 transitions. [2018-02-04 17:43:55,656 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 416 transitions. Word has length 406 [2018-02-04 17:43:55,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:43:55,656 INFO L432 AbstractCegarLoop]: Abstraction has 415 states and 416 transitions. [2018-02-04 17:43:55,656 INFO L433 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-02-04 17:43:55,656 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 416 transitions. [2018-02-04 17:43:55,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 415 [2018-02-04 17:43:55,657 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:43:55,657 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] [2018-02-04 17:43:55,657 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:43:55,658 INFO L82 PathProgramCache]: Analyzing trace with hash -1025675029, now seen corresponding path program 43 times [2018-02-04 17:43:55,658 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:43:55,658 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:43:55,658 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:43:55,658 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:43:55,658 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:43:55,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:43:55,692 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:43:56,711 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:43:56,711 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:43:56,711 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:43:56,712 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:43:56,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:43:56,739 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:43:57,513 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:43:57,514 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:43:57,514 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 53] total 104 [2018-02-04 17:43:57,514 INFO L409 AbstractCegarLoop]: Interpolant automaton has 104 states [2018-02-04 17:43:57,515 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2018-02-04 17:43:57,515 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3979, Invalid=6733, Unknown=0, NotChecked=0, Total=10712 [2018-02-04 17:43:57,515 INFO L87 Difference]: Start difference. First operand 415 states and 416 transitions. Second operand 104 states. [2018-02-04 17:43:57,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:43:57,966 INFO L93 Difference]: Finished difference Result 427 states and 428 transitions. [2018-02-04 17:43:57,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-02-04 17:43:57,967 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 414 [2018-02-04 17:43:57,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:43:57,967 INFO L225 Difference]: With dead ends: 427 [2018-02-04 17:43:57,967 INFO L226 Difference]: Without dead ends: 427 [2018-02-04 17:43:57,968 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 468 GetRequests, 364 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:43:57,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2018-02-04 17:43:57,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 423. [2018-02-04 17:43:57,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 423 states. [2018-02-04 17:43:57,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 424 transitions. [2018-02-04 17:43:57,970 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 424 transitions. Word has length 414 [2018-02-04 17:43:57,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:43:57,970 INFO L432 AbstractCegarLoop]: Abstraction has 423 states and 424 transitions. [2018-02-04 17:43:57,970 INFO L433 AbstractCegarLoop]: Interpolant automaton has 104 states. [2018-02-04 17:43:57,970 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 424 transitions. [2018-02-04 17:43:57,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 423 [2018-02-04 17:43:57,971 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:43:57,971 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] [2018-02-04 17:43:57,971 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:43:57,971 INFO L82 PathProgramCache]: Analyzing trace with hash 820676619, now seen corresponding path program 44 times [2018-02-04 17:43:57,971 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:43:57,971 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:43:57,972 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:43:57,972 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:43:57,972 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:43:57,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:43:57,999 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:43:59,026 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:43:59,026 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:43:59,026 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:43:59,026 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 17:43:59,061 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 17:43:59,061 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:43:59,068 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:43:59,130 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:43:59,130 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:43:59,130 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 53] total 56 [2018-02-04 17:43:59,131 INFO L409 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-02-04 17:43:59,131 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-02-04 17:43:59,131 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1435, Invalid=1645, Unknown=0, NotChecked=0, Total=3080 [2018-02-04 17:43:59,131 INFO L87 Difference]: Start difference. First operand 423 states and 424 transitions. Second operand 56 states. [2018-02-04 17:44:00,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:44:00,094 INFO L93 Difference]: Finished difference Result 435 states and 436 transitions. [2018-02-04 17:44:00,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-02-04 17:44:00,094 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 422 [2018-02-04 17:44:00,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:44:00,095 INFO L225 Difference]: With dead ends: 435 [2018-02-04 17:44:00,095 INFO L226 Difference]: Without dead ends: 435 [2018-02-04 17:44:00,096 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 578 GetRequests, 473 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1472 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=4190, Invalid=7152, Unknown=0, NotChecked=0, Total=11342 [2018-02-04 17:44:00,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2018-02-04 17:44:00,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 431. [2018-02-04 17:44:00,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 431 states. [2018-02-04 17:44:00,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 431 states and 432 transitions. [2018-02-04 17:44:00,100 INFO L78 Accepts]: Start accepts. Automaton has 431 states and 432 transitions. Word has length 422 [2018-02-04 17:44:00,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:44:00,100 INFO L432 AbstractCegarLoop]: Abstraction has 431 states and 432 transitions. [2018-02-04 17:44:00,101 INFO L433 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-02-04 17:44:00,101 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 432 transitions. [2018-02-04 17:44:00,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 431 [2018-02-04 17:44:00,103 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:44:00,103 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] [2018-02-04 17:44:00,103 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:44:00,103 INFO L82 PathProgramCache]: Analyzing trace with hash -1215662549, now seen corresponding path program 45 times [2018-02-04 17:44:00,103 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:44:00,103 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:44:00,104 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:44:00,104 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:44:00,104 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:44:00,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:44:00,134 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:44:01,170 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:44:01,170 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:44:01,170 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:44:01,170 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 17:44:01,236 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 52 check-sat command(s) [2018-02-04 17:44:01,237 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:44:01,275 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:44:02,241 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:44:02,242 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:44:02,242 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 55] total 108 [2018-02-04 17:44:02,242 INFO L409 AbstractCegarLoop]: Interpolant automaton has 108 states [2018-02-04 17:44:02,243 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2018-02-04 17:44:02,243 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4294, Invalid=7262, Unknown=0, NotChecked=0, Total=11556 [2018-02-04 17:44:02,243 INFO L87 Difference]: Start difference. First operand 431 states and 432 transitions. Second operand 108 states. [2018-02-04 17:44:02,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:44:02,937 INFO L93 Difference]: Finished difference Result 443 states and 444 transitions. [2018-02-04 17:44:02,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-02-04 17:44:02,937 INFO L78 Accepts]: Start accepts. Automaton has 108 states. Word has length 430 [2018-02-04 17:44:02,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:44:02,938 INFO L225 Difference]: With dead ends: 443 [2018-02-04 17:44:02,938 INFO L226 Difference]: Without dead ends: 443 [2018-02-04 17:44:02,939 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 486 GetRequests, 378 SyntacticMatches, 1 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5353 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=4401, Invalid=7371, Unknown=0, NotChecked=0, Total=11772 [2018-02-04 17:44:02,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2018-02-04 17:44:02,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 439. [2018-02-04 17:44:02,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 439 states. [2018-02-04 17:44:02,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 439 states and 440 transitions. [2018-02-04 17:44:02,941 INFO L78 Accepts]: Start accepts. Automaton has 439 states and 440 transitions. Word has length 430 [2018-02-04 17:44:02,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:44:02,941 INFO L432 AbstractCegarLoop]: Abstraction has 439 states and 440 transitions. [2018-02-04 17:44:02,941 INFO L433 AbstractCegarLoop]: Interpolant automaton has 108 states. [2018-02-04 17:44:02,942 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 440 transitions. [2018-02-04 17:44:02,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 439 [2018-02-04 17:44:02,943 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:44:02,943 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] [2018-02-04 17:44:02,943 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:44:02,943 INFO L82 PathProgramCache]: Analyzing trace with hash 958577483, now seen corresponding path program 46 times [2018-02-04 17:44:02,944 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:44:02,944 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:44:02,944 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:44:02,944 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:44:02,944 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:44:02,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:44:02,976 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:44:04,040 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:44:04,040 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:44:04,040 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:44:04,040 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-04 17:44:04,121 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-04 17:44:04,121 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:44:04,136 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:44:04,137 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:44:04,138 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:44:04,140 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:44:04,140 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-02-04 17:44:07,609 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:44:07,610 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:44:07,610 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 110] total 165 [2018-02-04 17:44:07,610 INFO L409 AbstractCegarLoop]: Interpolant automaton has 165 states [2018-02-04 17:44:07,611 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 165 interpolants. [2018-02-04 17:44:07,611 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6050, Invalid=21010, Unknown=0, NotChecked=0, Total=27060 [2018-02-04 17:44:07,611 INFO L87 Difference]: Start difference. First operand 439 states and 440 transitions. Second operand 165 states. [2018-02-04 17:44:09,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:44:09,452 INFO L93 Difference]: Finished difference Result 451 states and 452 transitions. [2018-02-04 17:44:09,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-02-04 17:44:09,452 INFO L78 Accepts]: Start accepts. Automaton has 165 states. Word has length 438 [2018-02-04 17:44:09,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:44:09,453 INFO L225 Difference]: With dead ends: 451 [2018-02-04 17:44:09,453 INFO L226 Difference]: Without dead ends: 451 [2018-02-04 17:44:09,454 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 551 GetRequests, 331 SyntacticMatches, 1 SemanticMatches, 219 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19977 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=10570, Invalid=38050, Unknown=0, NotChecked=0, Total=48620 [2018-02-04 17:44:09,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2018-02-04 17:44:09,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 447. [2018-02-04 17:44:09,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 447 states. [2018-02-04 17:44:09,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 447 states and 448 transitions. [2018-02-04 17:44:09,457 INFO L78 Accepts]: Start accepts. Automaton has 447 states and 448 transitions. Word has length 438 [2018-02-04 17:44:09,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:44:09,457 INFO L432 AbstractCegarLoop]: Abstraction has 447 states and 448 transitions. [2018-02-04 17:44:09,457 INFO L433 AbstractCegarLoop]: Interpolant automaton has 165 states. [2018-02-04 17:44:09,457 INFO L276 IsEmpty]: Start isEmpty. Operand 447 states and 448 transitions. [2018-02-04 17:44:09,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 447 [2018-02-04 17:44:09,458 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:44:09,459 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] [2018-02-04 17:44:09,459 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:44:09,459 INFO L82 PathProgramCache]: Analyzing trace with hash 811128683, now seen corresponding path program 47 times [2018-02-04 17:44:09,459 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:44:09,459 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:44:09,459 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:44:09,459 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:44:09,459 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:44:09,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:44:09,489 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:44:10,567 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:44:10,567 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:44:10,568 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:44:10,568 INFO L109 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-04 17:44:10,639 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 54 check-sat command(s) [2018-02-04 17:44:10,639 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:44:10,647 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:44:10,712 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:44:10,713 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:44:10,713 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 56] total 59 [2018-02-04 17:44:10,713 INFO L409 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-02-04 17:44:10,713 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-02-04 17:44:10,714 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1600, Invalid=1822, Unknown=0, NotChecked=0, Total=3422 [2018-02-04 17:44:10,714 INFO L87 Difference]: Start difference. First operand 447 states and 448 transitions. Second operand 59 states. [2018-02-04 17:44:11,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:44:11,709 INFO L93 Difference]: Finished difference Result 459 states and 460 transitions. [2018-02-04 17:44:11,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-02-04 17:44:11,709 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 446 [2018-02-04 17:44:11,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:44:11,710 INFO L225 Difference]: With dead ends: 459 [2018-02-04 17:44:11,710 INFO L226 Difference]: Without dead ends: 459 [2018-02-04 17:44:11,710 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 611 GetRequests, 500 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:44:11,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2018-02-04 17:44:11,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 455. [2018-02-04 17:44:11,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 455 states. [2018-02-04 17:44:11,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 455 states to 455 states and 456 transitions. [2018-02-04 17:44:11,712 INFO L78 Accepts]: Start accepts. Automaton has 455 states and 456 transitions. Word has length 446 [2018-02-04 17:44:11,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:44:11,713 INFO L432 AbstractCegarLoop]: Abstraction has 455 states and 456 transitions. [2018-02-04 17:44:11,713 INFO L433 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-02-04 17:44:11,713 INFO L276 IsEmpty]: Start isEmpty. Operand 455 states and 456 transitions. [2018-02-04 17:44:11,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 455 [2018-02-04 17:44:11,714 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:44:11,714 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] [2018-02-04 17:44:11,714 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:44:11,714 INFO L82 PathProgramCache]: Analyzing trace with hash -1877849461, now seen corresponding path program 48 times [2018-02-04 17:44:11,715 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:44:11,715 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:44:11,715 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:44:11,715 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:44:11,715 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:44:11,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:44:11,745 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:44:12,865 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:44:12,865 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:44:12,865 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:44:12,866 INFO L109 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-02-04 17:44:12,950 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 55 check-sat command(s) [2018-02-04 17:44:12,950 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:44:12,981 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:44:13,893 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:44:13,894 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:44:13,894 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 58] total 114 [2018-02-04 17:44:13,894 INFO L409 AbstractCegarLoop]: Interpolant automaton has 114 states [2018-02-04 17:44:13,894 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 114 interpolants. [2018-02-04 17:44:13,895 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4789, Invalid=8093, Unknown=0, NotChecked=0, Total=12882 [2018-02-04 17:44:13,895 INFO L87 Difference]: Start difference. First operand 455 states and 456 transitions. Second operand 114 states. [2018-02-04 17:44:14,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:44:14,405 INFO L93 Difference]: Finished difference Result 467 states and 468 transitions. [2018-02-04 17:44:14,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-02-04 17:44:14,405 INFO L78 Accepts]: Start accepts. Automaton has 114 states. Word has length 454 [2018-02-04 17:44:14,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:44:14,406 INFO L225 Difference]: With dead ends: 467 [2018-02-04 17:44:14,406 INFO L226 Difference]: Without dead ends: 467 [2018-02-04 17:44:14,407 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 513 GetRequests, 399 SyntacticMatches, 1 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5992 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=4902, Invalid=8208, Unknown=0, NotChecked=0, Total=13110 [2018-02-04 17:44:14,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 467 states. [2018-02-04 17:44:14,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 467 to 463. [2018-02-04 17:44:14,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 463 states. [2018-02-04 17:44:14,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 463 states to 463 states and 464 transitions. [2018-02-04 17:44:14,409 INFO L78 Accepts]: Start accepts. Automaton has 463 states and 464 transitions. Word has length 454 [2018-02-04 17:44:14,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:44:14,409 INFO L432 AbstractCegarLoop]: Abstraction has 463 states and 464 transitions. [2018-02-04 17:44:14,409 INFO L433 AbstractCegarLoop]: Interpolant automaton has 114 states. [2018-02-04 17:44:14,409 INFO L276 IsEmpty]: Start isEmpty. Operand 463 states and 464 transitions. [2018-02-04 17:44:14,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 463 [2018-02-04 17:44:14,411 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:44:14,411 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] [2018-02-04 17:44:14,411 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:44:14,411 INFO L82 PathProgramCache]: Analyzing trace with hash -1552640853, now seen corresponding path program 49 times [2018-02-04 17:44:14,411 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:44:14,411 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:44:14,411 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:44:14,412 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:44:14,412 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:44:14,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:44:14,445 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:44:15,673 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:44:15,673 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:44:15,673 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:44:15,674 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:44:15,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:44:15,704 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:44:16,647 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:44:16,647 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:44:16,648 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 59] total 116 [2018-02-04 17:44:16,648 INFO L409 AbstractCegarLoop]: Interpolant automaton has 116 states [2018-02-04 17:44:16,649 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 116 interpolants. [2018-02-04 17:44:16,649 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4960, Invalid=8380, Unknown=0, NotChecked=0, Total=13340 [2018-02-04 17:44:16,649 INFO L87 Difference]: Start difference. First operand 463 states and 464 transitions. Second operand 116 states. [2018-02-04 17:44:17,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:44:17,255 INFO L93 Difference]: Finished difference Result 475 states and 476 transitions. [2018-02-04 17:44:17,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-02-04 17:44:17,256 INFO L78 Accepts]: Start accepts. Automaton has 116 states. Word has length 462 [2018-02-04 17:44:17,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:44:17,257 INFO L225 Difference]: With dead ends: 475 [2018-02-04 17:44:17,257 INFO L226 Difference]: Without dead ends: 475 [2018-02-04 17:44:17,257 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 522 GetRequests, 406 SyntacticMatches, 1 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6213 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=5075, Invalid=8497, Unknown=0, NotChecked=0, Total=13572 [2018-02-04 17:44:17,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 475 states. [2018-02-04 17:44:17,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 475 to 471. [2018-02-04 17:44:17,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 471 states. [2018-02-04 17:44:17,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 471 states to 471 states and 472 transitions. [2018-02-04 17:44:17,260 INFO L78 Accepts]: Start accepts. Automaton has 471 states and 472 transitions. Word has length 462 [2018-02-04 17:44:17,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:44:17,260 INFO L432 AbstractCegarLoop]: Abstraction has 471 states and 472 transitions. [2018-02-04 17:44:17,260 INFO L433 AbstractCegarLoop]: Interpolant automaton has 116 states. [2018-02-04 17:44:17,260 INFO L276 IsEmpty]: Start isEmpty. Operand 471 states and 472 transitions. [2018-02-04 17:44:17,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 471 [2018-02-04 17:44:17,261 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:44:17,261 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] [2018-02-04 17:44:17,261 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:44:17,262 INFO L82 PathProgramCache]: Analyzing trace with hash -303745589, now seen corresponding path program 50 times [2018-02-04 17:44:17,262 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:44:17,262 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:44:17,262 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:44:17,262 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:44:17,262 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:44:17,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:44:17,294 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:44:18,544 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:44:18,545 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:44:18,545 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:44:18,545 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 17:44:18,585 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 17:44:18,585 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:44:18,593 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:44:18,697 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:44:18,697 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:44:18,697 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 59] total 62 [2018-02-04 17:44:18,698 INFO L409 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-02-04 17:44:18,698 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-02-04 17:44:18,698 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1774, Invalid=2008, Unknown=0, NotChecked=0, Total=3782 [2018-02-04 17:44:18,698 INFO L87 Difference]: Start difference. First operand 471 states and 472 transitions. Second operand 62 states. [2018-02-04 17:44:19,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:44:19,732 INFO L93 Difference]: Finished difference Result 483 states and 484 transitions. [2018-02-04 17:44:19,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-02-04 17:44:19,733 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 470 [2018-02-04 17:44:19,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:44:19,734 INFO L225 Difference]: With dead ends: 483 [2018-02-04 17:44:19,734 INFO L226 Difference]: Without dead ends: 483 [2018-02-04 17:44:19,734 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 644 GetRequests, 527 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:44:19,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 483 states. [2018-02-04 17:44:19,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 483 to 479. [2018-02-04 17:44:19,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 479 states. [2018-02-04 17:44:19,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 479 states to 479 states and 480 transitions. [2018-02-04 17:44:19,736 INFO L78 Accepts]: Start accepts. Automaton has 479 states and 480 transitions. Word has length 470 [2018-02-04 17:44:19,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:44:19,736 INFO L432 AbstractCegarLoop]: Abstraction has 479 states and 480 transitions. [2018-02-04 17:44:19,737 INFO L433 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-02-04 17:44:19,737 INFO L276 IsEmpty]: Start isEmpty. Operand 479 states and 480 transitions. [2018-02-04 17:44:19,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 479 [2018-02-04 17:44:19,738 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:44:19,738 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] [2018-02-04 17:44:19,738 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:44:19,738 INFO L82 PathProgramCache]: Analyzing trace with hash 185183723, now seen corresponding path program 51 times [2018-02-04 17:44:19,738 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:44:19,738 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:44:19,739 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:44:19,739 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:44:19,739 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:44:19,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:44:19,772 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:44:21,037 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:44:21,037 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:44:21,038 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:44:21,038 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 17:44:21,111 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 58 check-sat command(s) [2018-02-04 17:44:21,112 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:44:21,157 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:44:21,232 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:44:21,233 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:44:21,233 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 60] total 63 [2018-02-04 17:44:21,233 INFO L409 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-02-04 17:44:21,233 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-02-04 17:44:21,233 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1834, Invalid=2072, Unknown=0, NotChecked=0, Total=3906 [2018-02-04 17:44:21,234 INFO L87 Difference]: Start difference. First operand 479 states and 480 transitions. Second operand 63 states. [2018-02-04 17:44:22,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:44:22,320 INFO L93 Difference]: Finished difference Result 491 states and 492 transitions. [2018-02-04 17:44:22,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-02-04 17:44:22,320 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 478 [2018-02-04 17:44:22,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:44:22,321 INFO L225 Difference]: With dead ends: 491 [2018-02-04 17:44:22,321 INFO L226 Difference]: Without dead ends: 491 [2018-02-04 17:44:22,321 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 655 GetRequests, 536 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:44:22,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 491 states. [2018-02-04 17:44:22,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 491 to 487. [2018-02-04 17:44:22,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 487 states. [2018-02-04 17:44:22,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 487 states and 488 transitions. [2018-02-04 17:44:22,324 INFO L78 Accepts]: Start accepts. Automaton has 487 states and 488 transitions. Word has length 478 [2018-02-04 17:44:22,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:44:22,324 INFO L432 AbstractCegarLoop]: Abstraction has 487 states and 488 transitions. [2018-02-04 17:44:22,324 INFO L433 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-02-04 17:44:22,324 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 488 transitions. [2018-02-04 17:44:22,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 487 [2018-02-04 17:44:22,325 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:44:22,326 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] [2018-02-04 17:44:22,326 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:44:22,326 INFO L82 PathProgramCache]: Analyzing trace with hash -1899528949, now seen corresponding path program 52 times [2018-02-04 17:44:22,326 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:44:22,326 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:44:22,326 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:44:22,326 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:44:22,326 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:44:22,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:44:22,361 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:44:23,650 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:44:23,651 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:44:23,651 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:44:23,651 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-04 17:44:23,757 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-04 17:44:23,757 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:44:23,775 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:44:23,776 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:44:23,776 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:44:23,778 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:44:23,778 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-02-04 17:44:28,020 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:44:28,020 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:44:28,020 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 122] total 183 [2018-02-04 17:44:28,021 INFO L409 AbstractCegarLoop]: Interpolant automaton has 183 states [2018-02-04 17:44:28,022 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 183 interpolants. [2018-02-04 17:44:28,022 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7442, Invalid=25864, Unknown=0, NotChecked=0, Total=33306 [2018-02-04 17:44:28,022 INFO L87 Difference]: Start difference. First operand 487 states and 488 transitions. Second operand 183 states. [2018-02-04 17:44:30,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:44:30,174 INFO L93 Difference]: Finished difference Result 499 states and 500 transitions. [2018-02-04 17:44:30,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-02-04 17:44:30,174 INFO L78 Accepts]: Start accepts. Automaton has 183 states. Word has length 486 [2018-02-04 17:44:30,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:44:30,175 INFO L225 Difference]: With dead ends: 499 [2018-02-04 17:44:30,175 INFO L226 Difference]: Without dead ends: 499 [2018-02-04 17:44:30,177 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 611 GetRequests, 367 SyntacticMatches, 1 SemanticMatches, 243 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24717 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=13003, Invalid=46777, Unknown=0, NotChecked=0, Total=59780 [2018-02-04 17:44:30,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 499 states. [2018-02-04 17:44:30,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 499 to 495. [2018-02-04 17:44:30,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 495 states. [2018-02-04 17:44:30,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 495 states and 496 transitions. [2018-02-04 17:44:30,181 INFO L78 Accepts]: Start accepts. Automaton has 495 states and 496 transitions. Word has length 486 [2018-02-04 17:44:30,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:44:30,181 INFO L432 AbstractCegarLoop]: Abstraction has 495 states and 496 transitions. [2018-02-04 17:44:30,181 INFO L433 AbstractCegarLoop]: Interpolant automaton has 183 states. [2018-02-04 17:44:30,181 INFO L276 IsEmpty]: Start isEmpty. Operand 495 states and 496 transitions. [2018-02-04 17:44:30,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 495 [2018-02-04 17:44:30,183 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:44:30,183 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] [2018-02-04 17:44:30,183 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:44:30,183 INFO L82 PathProgramCache]: Analyzing trace with hash -448519381, now seen corresponding path program 53 times [2018-02-04 17:44:30,183 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:44:30,183 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:44:30,184 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:44:30,184 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:44:30,184 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:44:30,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:44:30,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:44:31,612 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:44:31,613 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:44:31,613 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:44:31,613 INFO L109 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-04 17:44:31,723 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 60 check-sat command(s) [2018-02-04 17:44:31,723 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:44:31,733 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:44:31,827 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:44:31,828 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:44:31,828 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 62] total 65 [2018-02-04 17:44:31,828 INFO L409 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-02-04 17:44:31,829 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-02-04 17:44:31,829 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1957, Invalid=2203, Unknown=0, NotChecked=0, Total=4160 [2018-02-04 17:44:31,829 INFO L87 Difference]: Start difference. First operand 495 states and 496 transitions. Second operand 65 states. [2018-02-04 17:44:32,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:44:32,958 INFO L93 Difference]: Finished difference Result 507 states and 508 transitions. [2018-02-04 17:44:32,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-02-04 17:44:32,958 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 494 [2018-02-04 17:44:32,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:44:32,959 INFO L225 Difference]: With dead ends: 507 [2018-02-04 17:44:32,959 INFO L226 Difference]: Without dead ends: 507 [2018-02-04 17:44:32,960 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 677 GetRequests, 554 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:44:32,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507 states. [2018-02-04 17:44:32,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507 to 503. [2018-02-04 17:44:32,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 503 states. [2018-02-04 17:44:32,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 503 states to 503 states and 504 transitions. [2018-02-04 17:44:32,962 INFO L78 Accepts]: Start accepts. Automaton has 503 states and 504 transitions. Word has length 494 [2018-02-04 17:44:32,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:44:32,962 INFO L432 AbstractCegarLoop]: Abstraction has 503 states and 504 transitions. [2018-02-04 17:44:32,963 INFO L433 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-02-04 17:44:32,963 INFO L276 IsEmpty]: Start isEmpty. Operand 503 states and 504 transitions. [2018-02-04 17:44:32,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 503 [2018-02-04 17:44:32,964 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:44:32,964 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] [2018-02-04 17:44:32,964 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:44:32,964 INFO L82 PathProgramCache]: Analyzing trace with hash 853876811, now seen corresponding path program 54 times [2018-02-04 17:44:32,964 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:44:32,965 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:44:32,965 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:44:32,965 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:44:32,965 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:44:33,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:44:33,001 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:44:34,439 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:44:34,439 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:44:34,439 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:44:34,439 INFO L109 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-02-04 17:44:34,519 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 61 check-sat command(s) [2018-02-04 17:44:34,520 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:44:34,552 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:44:34,651 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:44:34,651 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:44:34,651 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 63] total 66 [2018-02-04 17:44:34,652 INFO L409 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-02-04 17:44:34,652 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-02-04 17:44:34,652 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2020, Invalid=2270, Unknown=0, NotChecked=0, Total=4290 [2018-02-04 17:44:34,652 INFO L87 Difference]: Start difference. First operand 503 states and 504 transitions. Second operand 66 states. [2018-02-04 17:44:35,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:44:35,836 INFO L93 Difference]: Finished difference Result 515 states and 516 transitions. [2018-02-04 17:44:35,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-02-04 17:44:35,836 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 502 [2018-02-04 17:44:35,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:44:35,837 INFO L225 Difference]: With dead ends: 515 [2018-02-04 17:44:35,837 INFO L226 Difference]: Without dead ends: 515 [2018-02-04 17:44:35,838 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 688 GetRequests, 563 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:44:35,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states. [2018-02-04 17:44:35,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 511. [2018-02-04 17:44:35,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 511 states. [2018-02-04 17:44:35,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 511 states to 511 states and 512 transitions. [2018-02-04 17:44:35,841 INFO L78 Accepts]: Start accepts. Automaton has 511 states and 512 transitions. Word has length 502 [2018-02-04 17:44:35,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:44:35,841 INFO L432 AbstractCegarLoop]: Abstraction has 511 states and 512 transitions. [2018-02-04 17:44:35,841 INFO L433 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-02-04 17:44:35,841 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states and 512 transitions. [2018-02-04 17:44:35,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 511 [2018-02-04 17:44:35,842 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:44:35,842 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] [2018-02-04 17:44:35,843 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:44:35,843 INFO L82 PathProgramCache]: Analyzing trace with hash 877655147, now seen corresponding path program 55 times [2018-02-04 17:44:35,843 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:44:35,843 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:44:35,843 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:44:35,843 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:44:35,843 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:44:35,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:44:35,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:44:37,379 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:44:37,379 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:44:37,379 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:44:37,380 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:44:37,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:44:37,415 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:44:38,554 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:44:38,554 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:44:38,554 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 65] total 128 [2018-02-04 17:44:38,555 INFO L409 AbstractCegarLoop]: Interpolant automaton has 128 states [2018-02-04 17:44:38,555 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 128 interpolants. [2018-02-04 17:44:38,556 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6049, Invalid=10207, Unknown=0, NotChecked=0, Total=16256 [2018-02-04 17:44:38,556 INFO L87 Difference]: Start difference. First operand 511 states and 512 transitions. Second operand 128 states. [2018-02-04 17:44:39,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:44:39,239 INFO L93 Difference]: Finished difference Result 523 states and 524 transitions. [2018-02-04 17:44:39,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-02-04 17:44:39,239 INFO L78 Accepts]: Start accepts. Automaton has 128 states. Word has length 510 [2018-02-04 17:44:39,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:44:39,240 INFO L225 Difference]: With dead ends: 523 [2018-02-04 17:44:39,240 INFO L226 Difference]: Without dead ends: 523 [2018-02-04 17:44:39,241 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 576 GetRequests, 448 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:44:39,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states. [2018-02-04 17:44:39,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 519. [2018-02-04 17:44:39,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 519 states. [2018-02-04 17:44:39,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 519 states to 519 states and 520 transitions. [2018-02-04 17:44:39,243 INFO L78 Accepts]: Start accepts. Automaton has 519 states and 520 transitions. Word has length 510 [2018-02-04 17:44:39,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:44:39,243 INFO L432 AbstractCegarLoop]: Abstraction has 519 states and 520 transitions. [2018-02-04 17:44:39,243 INFO L433 AbstractCegarLoop]: Interpolant automaton has 128 states. [2018-02-04 17:44:39,243 INFO L276 IsEmpty]: Start isEmpty. Operand 519 states and 520 transitions. [2018-02-04 17:44:39,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 519 [2018-02-04 17:44:39,245 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:44:39,245 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] [2018-02-04 17:44:39,245 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:44:39,245 INFO L82 PathProgramCache]: Analyzing trace with hash 510271371, now seen corresponding path program 56 times [2018-02-04 17:44:39,245 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:44:39,245 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:44:39,246 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:44:39,246 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:44:39,246 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:44:39,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:44:39,284 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:44:40,806 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:44:40,806 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:44:40,806 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:44:40,807 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 17:44:40,854 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 17:44:40,854 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:44:40,861 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:44:40,972 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:44:40,972 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:44:40,972 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 65] total 68 [2018-02-04 17:44:40,972 INFO L409 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-02-04 17:44:40,973 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-02-04 17:44:40,973 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2149, Invalid=2407, Unknown=0, NotChecked=0, Total=4556 [2018-02-04 17:44:40,973 INFO L87 Difference]: Start difference. First operand 519 states and 520 transitions. Second operand 68 states. [2018-02-04 17:44:42,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:44:42,168 INFO L93 Difference]: Finished difference Result 531 states and 532 transitions. [2018-02-04 17:44:42,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-02-04 17:44:42,169 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 518 [2018-02-04 17:44:42,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:44:42,170 INFO L225 Difference]: With dead ends: 531 [2018-02-04 17:44:42,170 INFO L226 Difference]: Without dead ends: 531 [2018-02-04 17:44:42,170 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 710 GetRequests, 581 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:44:42,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2018-02-04 17:44:42,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 527. [2018-02-04 17:44:42,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 527 states. [2018-02-04 17:44:42,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 527 states to 527 states and 528 transitions. [2018-02-04 17:44:42,173 INFO L78 Accepts]: Start accepts. Automaton has 527 states and 528 transitions. Word has length 518 [2018-02-04 17:44:42,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:44:42,173 INFO L432 AbstractCegarLoop]: Abstraction has 527 states and 528 transitions. [2018-02-04 17:44:42,173 INFO L433 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-02-04 17:44:42,173 INFO L276 IsEmpty]: Start isEmpty. Operand 527 states and 528 transitions. [2018-02-04 17:44:42,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 527 [2018-02-04 17:44:42,175 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:44:42,175 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] [2018-02-04 17:44:42,175 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:44:42,175 INFO L82 PathProgramCache]: Analyzing trace with hash 2119770539, now seen corresponding path program 57 times [2018-02-04 17:44:42,175 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:44:42,175 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:44:42,176 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:44:42,176 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:44:42,176 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:44:42,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:44:42,215 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:44:43,784 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:44:43,784 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:44:43,784 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:44:43,785 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 17:44:43,882 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 64 check-sat command(s) [2018-02-04 17:44:43,882 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:44:43,910 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:44:45,114 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:44:45,114 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:44:45,114 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68, 67] total 132 [2018-02-04 17:44:45,115 INFO L409 AbstractCegarLoop]: Interpolant automaton has 132 states [2018-02-04 17:44:45,116 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 132 interpolants. [2018-02-04 17:44:45,116 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6436, Invalid=10856, Unknown=0, NotChecked=0, Total=17292 [2018-02-04 17:44:45,116 INFO L87 Difference]: Start difference. First operand 527 states and 528 transitions. Second operand 132 states. [2018-02-04 17:44:45,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:44:45,891 INFO L93 Difference]: Finished difference Result 539 states and 540 transitions. [2018-02-04 17:44:45,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-02-04 17:44:45,891 INFO L78 Accepts]: Start accepts. Automaton has 132 states. Word has length 526 [2018-02-04 17:44:45,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:44:45,892 INFO L225 Difference]: With dead ends: 539 [2018-02-04 17:44:45,892 INFO L226 Difference]: Without dead ends: 539 [2018-02-04 17:44:45,893 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 594 GetRequests, 462 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:44:45,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2018-02-04 17:44:45,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 535. [2018-02-04 17:44:45,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 535 states. [2018-02-04 17:44:45,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 535 states to 535 states and 536 transitions. [2018-02-04 17:44:45,895 INFO L78 Accepts]: Start accepts. Automaton has 535 states and 536 transitions. Word has length 526 [2018-02-04 17:44:45,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:44:45,896 INFO L432 AbstractCegarLoop]: Abstraction has 535 states and 536 transitions. [2018-02-04 17:44:45,896 INFO L433 AbstractCegarLoop]: Interpolant automaton has 132 states. [2018-02-04 17:44:45,896 INFO L276 IsEmpty]: Start isEmpty. Operand 535 states and 536 transitions. [2018-02-04 17:44:45,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 535 [2018-02-04 17:44:45,898 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:44:45,899 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] [2018-02-04 17:44:45,899 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:44:45,899 INFO L82 PathProgramCache]: Analyzing trace with hash 427981515, now seen corresponding path program 58 times [2018-02-04 17:44:45,899 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:44:45,899 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:44:45,900 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:44:45,900 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:44:45,900 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:44:45,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:44:45,949 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:44:47,616 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:44:47,617 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:44:47,617 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:44:47,617 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-04 17:44:47,745 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-04 17:44:47,745 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:44:47,767 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:44:47,770 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:44:47,770 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:44:47,774 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:44:47,774 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-02-04 17:44:53,863 INFO L134 CoverageAnalysis]: Checked inductivity of 16384 backedges. 191 proven. 16193 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:44:53,864 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:44:53,864 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 135] total 202 [2018-02-04 17:44:53,864 INFO L409 AbstractCegarLoop]: Interpolant automaton has 202 states [2018-02-04 17:44:53,865 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 202 interpolants. [2018-02-04 17:44:53,866 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7163, Invalid=33439, Unknown=0, NotChecked=0, Total=40602 [2018-02-04 17:44:53,866 INFO L87 Difference]: Start difference. First operand 535 states and 536 transitions. Second operand 202 states. [2018-02-04 17:45:07,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:45:07,162 INFO L93 Difference]: Finished difference Result 547 states and 548 transitions. [2018-02-04 17:45:07,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-02-04 17:45:07,162 INFO L78 Accepts]: Start accepts. Automaton has 202 states. Word has length 534 [2018-02-04 17:45:07,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:45:07,163 INFO L225 Difference]: With dead ends: 547 [2018-02-04 17:45:07,163 INFO L226 Difference]: Without dead ends: 547 [2018-02-04 17:45:07,164 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 671 GetRequests, 402 SyntacticMatches, 1 SemanticMatches, 268 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28082 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=9842, Invalid=62788, Unknown=0, NotChecked=0, Total=72630 [2018-02-04 17:45:07,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2018-02-04 17:45:07,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 543. [2018-02-04 17:45:07,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 543 states. [2018-02-04 17:45:07,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 543 states to 543 states and 544 transitions. [2018-02-04 17:45:07,167 INFO L78 Accepts]: Start accepts. Automaton has 543 states and 544 transitions. Word has length 534 [2018-02-04 17:45:07,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:45:07,167 INFO L432 AbstractCegarLoop]: Abstraction has 543 states and 544 transitions. [2018-02-04 17:45:07,167 INFO L433 AbstractCegarLoop]: Interpolant automaton has 202 states. [2018-02-04 17:45:07,167 INFO L276 IsEmpty]: Start isEmpty. Operand 543 states and 544 transitions. [2018-02-04 17:45:07,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 543 [2018-02-04 17:45:07,169 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:45:07,169 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] [2018-02-04 17:45:07,169 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:45:07,169 INFO L82 PathProgramCache]: Analyzing trace with hash -846484757, now seen corresponding path program 59 times [2018-02-04 17:45:07,169 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:45:07,169 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:45:07,169 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:45:07,169 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:45:07,169 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:45:07,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:45:07,212 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:08,907 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:45:08,907 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:45:08,907 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:45:08,907 INFO L109 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-04 17:45:09,014 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 66 check-sat command(s) [2018-02-04 17:45:09,014 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:45:09,025 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:45:09,119 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:45:09,119 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:45:09,119 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70, 68] total 71 [2018-02-04 17:45:09,119 INFO L409 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-02-04 17:45:09,120 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-02-04 17:45:09,120 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2350, Invalid=2620, Unknown=0, NotChecked=0, Total=4970 [2018-02-04 17:45:09,120 INFO L87 Difference]: Start difference. First operand 543 states and 544 transitions. Second operand 71 states. [2018-02-04 17:45:10,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:45:10,480 INFO L93 Difference]: Finished difference Result 555 states and 556 transitions. [2018-02-04 17:45:10,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-02-04 17:45:10,480 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 542 [2018-02-04 17:45:10,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:45:10,481 INFO L225 Difference]: With dead ends: 555 [2018-02-04 17:45:10,481 INFO L226 Difference]: Without dead ends: 555 [2018-02-04 17:45:10,481 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 743 GetRequests, 608 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:45:10,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2018-02-04 17:45:10,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 551. [2018-02-04 17:45:10,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 551 states. [2018-02-04 17:45:10,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 551 states and 552 transitions. [2018-02-04 17:45:10,484 INFO L78 Accepts]: Start accepts. Automaton has 551 states and 552 transitions. Word has length 542 [2018-02-04 17:45:10,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:45:10,484 INFO L432 AbstractCegarLoop]: Abstraction has 551 states and 552 transitions. [2018-02-04 17:45:10,484 INFO L433 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-02-04 17:45:10,484 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 552 transitions. [2018-02-04 17:45:10,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 551 [2018-02-04 17:45:10,485 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:45:10,486 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] [2018-02-04 17:45:10,486 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:45:10,486 INFO L82 PathProgramCache]: Analyzing trace with hash 1884959243, now seen corresponding path program 60 times [2018-02-04 17:45:10,486 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:45:10,486 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:45:10,486 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:45:10,486 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:45:10,486 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:45:10,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:45:10,529 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:12,263 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:45:12,264 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:45:12,264 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:45:12,264 INFO L109 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-02-04 17:45:12,401 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 67 check-sat command(s) [2018-02-04 17:45:12,401 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:45:12,434 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:45:12,573 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:45:12,573 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:45:12,574 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 69] total 72 [2018-02-04 17:45:12,574 INFO L409 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-02-04 17:45:12,574 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-02-04 17:45:12,574 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2419, Invalid=2693, Unknown=0, NotChecked=0, Total=5112 [2018-02-04 17:45:12,575 INFO L87 Difference]: Start difference. First operand 551 states and 552 transitions. Second operand 72 states. [2018-02-04 17:45:13,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:45:13,994 INFO L93 Difference]: Finished difference Result 563 states and 564 transitions. [2018-02-04 17:45:13,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-02-04 17:45:13,994 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 550 [2018-02-04 17:45:13,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:45:13,995 INFO L225 Difference]: With dead ends: 563 [2018-02-04 17:45:13,995 INFO L226 Difference]: Without dead ends: 563 [2018-02-04 17:45:13,996 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 754 GetRequests, 617 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:45:13,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2018-02-04 17:45:13,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 559. [2018-02-04 17:45:13,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 559 states. [2018-02-04 17:45:13,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 559 states to 559 states and 560 transitions. [2018-02-04 17:45:13,999 INFO L78 Accepts]: Start accepts. Automaton has 559 states and 560 transitions. Word has length 550 [2018-02-04 17:45:13,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:45:13,999 INFO L432 AbstractCegarLoop]: Abstraction has 559 states and 560 transitions. [2018-02-04 17:45:13,999 INFO L433 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-02-04 17:45:13,999 INFO L276 IsEmpty]: Start isEmpty. Operand 559 states and 560 transitions. [2018-02-04 17:45:14,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 559 [2018-02-04 17:45:14,001 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:45:14,001 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] [2018-02-04 17:45:14,001 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:45:14,001 INFO L82 PathProgramCache]: Analyzing trace with hash -1340895189, now seen corresponding path program 61 times [2018-02-04 17:45:14,001 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:45:14,001 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:45:14,002 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:45:14,002 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:45:14,002 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:45:14,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:45:14,048 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:15,858 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:45:15,858 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:45:15,858 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:45:15,858 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:45:15,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:45:15,899 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:45:17,184 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:45:17,184 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:45:17,184 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72, 71] total 140 [2018-02-04 17:45:17,185 INFO L409 AbstractCegarLoop]: Interpolant automaton has 140 states [2018-02-04 17:45:17,185 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 140 interpolants. [2018-02-04 17:45:17,186 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7246, Invalid=12214, Unknown=0, NotChecked=0, Total=19460 [2018-02-04 17:45:17,186 INFO L87 Difference]: Start difference. First operand 559 states and 560 transitions. Second operand 140 states. [2018-02-04 17:45:18,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:45:18,018 INFO L93 Difference]: Finished difference Result 571 states and 572 transitions. [2018-02-04 17:45:18,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-02-04 17:45:18,019 INFO L78 Accepts]: Start accepts. Automaton has 140 states. Word has length 558 [2018-02-04 17:45:18,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:45:18,020 INFO L225 Difference]: With dead ends: 571 [2018-02-04 17:45:18,020 INFO L226 Difference]: Without dead ends: 571 [2018-02-04 17:45:18,020 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 630 GetRequests, 490 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:45:18,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2018-02-04 17:45:18,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 567. [2018-02-04 17:45:18,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 567 states. [2018-02-04 17:45:18,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 567 states to 567 states and 568 transitions. [2018-02-04 17:45:18,023 INFO L78 Accepts]: Start accepts. Automaton has 567 states and 568 transitions. Word has length 558 [2018-02-04 17:45:18,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:45:18,023 INFO L432 AbstractCegarLoop]: Abstraction has 567 states and 568 transitions. [2018-02-04 17:45:18,023 INFO L433 AbstractCegarLoop]: Interpolant automaton has 140 states. [2018-02-04 17:45:18,023 INFO L276 IsEmpty]: Start isEmpty. Operand 567 states and 568 transitions. [2018-02-04 17:45:18,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 567 [2018-02-04 17:45:18,025 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:45:18,025 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] [2018-02-04 17:45:18,025 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:45:18,025 INFO L82 PathProgramCache]: Analyzing trace with hash -216185525, now seen corresponding path program 62 times [2018-02-04 17:45:18,025 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:45:18,025 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:45:18,025 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:45:18,025 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:45:18,026 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:45:18,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:45:18,072 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:19,936 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:45:19,937 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:45:19,937 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:45:19,937 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 17:45:19,993 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 17:45:19,993 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:45:20,002 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:45:20,105 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:45:20,105 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:45:20,105 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 71] total 74 [2018-02-04 17:45:20,105 INFO L409 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-02-04 17:45:20,106 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-02-04 17:45:20,106 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2560, Invalid=2842, Unknown=0, NotChecked=0, Total=5402 [2018-02-04 17:45:20,106 INFO L87 Difference]: Start difference. First operand 567 states and 568 transitions. Second operand 74 states. [2018-02-04 17:45:21,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:45:21,510 INFO L93 Difference]: Finished difference Result 579 states and 580 transitions. [2018-02-04 17:45:21,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-02-04 17:45:21,511 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 566 [2018-02-04 17:45:21,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:45:21,512 INFO L225 Difference]: With dead ends: 579 [2018-02-04 17:45:21,512 INFO L226 Difference]: Without dead ends: 579 [2018-02-04 17:45:21,512 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 776 GetRequests, 635 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:45:21,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 579 states. [2018-02-04 17:45:21,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 579 to 575. [2018-02-04 17:45:21,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 575 states. [2018-02-04 17:45:21,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 575 states to 575 states and 576 transitions. [2018-02-04 17:45:21,515 INFO L78 Accepts]: Start accepts. Automaton has 575 states and 576 transitions. Word has length 566 [2018-02-04 17:45:21,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:45:21,515 INFO L432 AbstractCegarLoop]: Abstraction has 575 states and 576 transitions. [2018-02-04 17:45:21,515 INFO L433 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-02-04 17:45:21,515 INFO L276 IsEmpty]: Start isEmpty. Operand 575 states and 576 transitions. [2018-02-04 17:45:21,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 575 [2018-02-04 17:45:21,517 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:45:21,517 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] [2018-02-04 17:45:21,517 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:45:21,518 INFO L82 PathProgramCache]: Analyzing trace with hash 941412715, now seen corresponding path program 63 times [2018-02-04 17:45:21,518 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:45:21,518 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:45:21,518 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:45:21,518 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:45:21,518 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:45:21,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:45:21,571 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:23,440 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:45:23,441 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:45:23,441 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:45:23,441 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 17:45:23,572 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 70 check-sat command(s) [2018-02-04 17:45:23,572 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:45:23,628 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:45:23,738 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:45:23,739 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:45:23,739 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74, 72] total 75 [2018-02-04 17:45:23,739 INFO L409 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-02-04 17:45:23,740 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-02-04 17:45:23,740 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2632, Invalid=2918, Unknown=0, NotChecked=0, Total=5550 [2018-02-04 17:45:23,740 INFO L87 Difference]: Start difference. First operand 575 states and 576 transitions. Second operand 75 states. [2018-02-04 17:45:25,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:45:25,245 INFO L93 Difference]: Finished difference Result 587 states and 588 transitions. [2018-02-04 17:45:25,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-02-04 17:45:25,245 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 574 [2018-02-04 17:45:25,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:45:25,247 INFO L225 Difference]: With dead ends: 587 [2018-02-04 17:45:25,247 INFO L226 Difference]: Without dead ends: 587 [2018-02-04 17:45:25,247 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 787 GetRequests, 644 SyntacticMatches, 0 SemanticMatches, 143 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2688 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=7743, Invalid=13137, Unknown=0, NotChecked=0, Total=20880 [2018-02-04 17:45:25,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2018-02-04 17:45:25,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 583. [2018-02-04 17:45:25,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 583 states. [2018-02-04 17:45:25,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 583 states to 583 states and 584 transitions. [2018-02-04 17:45:25,250 INFO L78 Accepts]: Start accepts. Automaton has 583 states and 584 transitions. Word has length 574 [2018-02-04 17:45:25,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:45:25,250 INFO L432 AbstractCegarLoop]: Abstraction has 583 states and 584 transitions. [2018-02-04 17:45:25,250 INFO L433 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-02-04 17:45:25,250 INFO L276 IsEmpty]: Start isEmpty. Operand 583 states and 584 transitions. [2018-02-04 17:45:25,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 583 [2018-02-04 17:45:25,253 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:45:25,253 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] [2018-02-04 17:45:25,253 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:45:25,253 INFO L82 PathProgramCache]: Analyzing trace with hash -168315765, now seen corresponding path program 64 times [2018-02-04 17:45:25,253 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:45:25,254 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:45:25,254 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:45:25,254 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:45:25,254 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:45:25,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:45:25,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:45:27,296 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:45:27,296 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:45:27,296 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:45:27,297 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-04 17:45:27,454 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-04 17:45:27,454 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:45:27,478 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:45:27,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:27,480 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:45:27,481 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:45:27,481 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-02-04 17:45:33,309 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:45:33,310 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:45:33,310 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75, 146] total 219 [2018-02-04 17:45:33,310 INFO L409 AbstractCegarLoop]: Interpolant automaton has 219 states [2018-02-04 17:45:33,311 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 219 interpolants. [2018-02-04 17:45:33,312 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10658, Invalid=37084, Unknown=0, NotChecked=0, Total=47742 [2018-02-04 17:45:33,312 INFO L87 Difference]: Start difference. First operand 583 states and 584 transitions. Second operand 219 states. [2018-02-04 17:45:36,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:45:36,345 INFO L93 Difference]: Finished difference Result 595 states and 596 transitions. [2018-02-04 17:45:36,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-02-04 17:45:36,345 INFO L78 Accepts]: Start accepts. Automaton has 219 states. Word has length 582 [2018-02-04 17:45:36,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:45:36,346 INFO L225 Difference]: With dead ends: 595 [2018-02-04 17:45:36,346 INFO L226 Difference]: Without dead ends: 595 [2018-02-04 17:45:36,347 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 731 GetRequests, 439 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:45:36,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 595 states. [2018-02-04 17:45:36,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 595 to 591. [2018-02-04 17:45:36,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 591 states. [2018-02-04 17:45:36,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 592 transitions. [2018-02-04 17:45:36,350 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 592 transitions. Word has length 582 [2018-02-04 17:45:36,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:45:36,350 INFO L432 AbstractCegarLoop]: Abstraction has 591 states and 592 transitions. [2018-02-04 17:45:36,350 INFO L433 AbstractCegarLoop]: Interpolant automaton has 219 states. [2018-02-04 17:45:36,350 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 592 transitions. [2018-02-04 17:45:36,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 591 [2018-02-04 17:45:36,352 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:45:36,352 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] [2018-02-04 17:45:36,352 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:45:36,352 INFO L82 PathProgramCache]: Analyzing trace with hash -70029653, now seen corresponding path program 65 times [2018-02-04 17:45:36,352 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:45:36,352 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:45:36,353 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:45:36,353 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:45:36,353 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:45:36,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:45:36,402 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:38,436 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:45:38,436 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:45:38,436 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:45:38,437 INFO L109 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-04 17:45:38,575 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 72 check-sat command(s) [2018-02-04 17:45:38,575 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:45:38,587 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:45:38,697 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:45:38,697 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:45:38,697 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76, 74] total 77 [2018-02-04 17:45:38,697 INFO L409 AbstractCegarLoop]: Interpolant automaton has 77 states [2018-02-04 17:45:38,698 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2018-02-04 17:45:38,698 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2779, Invalid=3073, Unknown=0, NotChecked=0, Total=5852 [2018-02-04 17:45:38,698 INFO L87 Difference]: Start difference. First operand 591 states and 592 transitions. Second operand 77 states. [2018-02-04 17:45:40,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:45:40,221 INFO L93 Difference]: Finished difference Result 603 states and 604 transitions. [2018-02-04 17:45:40,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2018-02-04 17:45:40,222 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 590 [2018-02-04 17:45:40,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:45:40,223 INFO L225 Difference]: With dead ends: 603 [2018-02-04 17:45:40,223 INFO L226 Difference]: Without dead ends: 603 [2018-02-04 17:45:40,224 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 809 GetRequests, 662 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:45:40,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603 states. [2018-02-04 17:45:40,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 603 to 599. [2018-02-04 17:45:40,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 599 states. [2018-02-04 17:45:40,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 599 states to 599 states and 600 transitions. [2018-02-04 17:45:40,227 INFO L78 Accepts]: Start accepts. Automaton has 599 states and 600 transitions. Word has length 590 [2018-02-04 17:45:40,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:45:40,227 INFO L432 AbstractCegarLoop]: Abstraction has 599 states and 600 transitions. [2018-02-04 17:45:40,227 INFO L433 AbstractCegarLoop]: Interpolant automaton has 77 states. [2018-02-04 17:45:40,227 INFO L276 IsEmpty]: Start isEmpty. Operand 599 states and 600 transitions. [2018-02-04 17:45:40,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 599 [2018-02-04 17:45:40,229 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:45:40,229 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] [2018-02-04 17:45:40,229 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:45:40,229 INFO L82 PathProgramCache]: Analyzing trace with hash 1360363467, now seen corresponding path program 66 times [2018-02-04 17:45:40,229 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:45:40,229 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:45:40,230 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:45:40,230 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:45:40,230 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:45:40,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:45:40,282 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:42,453 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:45:42,453 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:45:42,453 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:45:42,454 INFO L109 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-02-04 17:45:42,680 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 73 check-sat command(s) [2018-02-04 17:45:42,680 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:45:42,720 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:45:42,888 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:45:42,888 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:45:42,888 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77, 76] total 79 [2018-02-04 17:45:42,889 INFO L409 AbstractCegarLoop]: Interpolant automaton has 79 states [2018-02-04 17:45:42,889 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2018-02-04 17:45:42,890 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2856, Invalid=3306, Unknown=0, NotChecked=0, Total=6162 [2018-02-04 17:45:42,890 INFO L87 Difference]: Start difference. First operand 599 states and 600 transitions. Second operand 79 states. [2018-02-04 17:45:44,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:45:44,822 INFO L93 Difference]: Finished difference Result 611 states and 612 transitions. [2018-02-04 17:45:44,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-02-04 17:45:44,822 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 598 [2018-02-04 17:45:44,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:45:44,823 INFO L225 Difference]: With dead ends: 611 [2018-02-04 17:45:44,823 INFO L226 Difference]: Without dead ends: 611 [2018-02-04 17:45:44,824 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 822 GetRequests, 671 SyntacticMatches, 0 SemanticMatches, 151 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3059 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=8409, Invalid=14847, Unknown=0, NotChecked=0, Total=23256 [2018-02-04 17:45:44,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2018-02-04 17:45:44,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 607. [2018-02-04 17:45:44,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 607 states. [2018-02-04 17:45:44,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 607 states to 607 states and 608 transitions. [2018-02-04 17:45:44,827 INFO L78 Accepts]: Start accepts. Automaton has 607 states and 608 transitions. Word has length 598 [2018-02-04 17:45:44,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:45:44,827 INFO L432 AbstractCegarLoop]: Abstraction has 607 states and 608 transitions. [2018-02-04 17:45:44,827 INFO L433 AbstractCegarLoop]: Interpolant automaton has 79 states. [2018-02-04 17:45:44,827 INFO L276 IsEmpty]: Start isEmpty. Operand 607 states and 608 transitions. [2018-02-04 17:45:44,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 607 [2018-02-04 17:45:44,829 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:45:44,829 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] [2018-02-04 17:45:44,829 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:45:44,829 INFO L82 PathProgramCache]: Analyzing trace with hash 358836203, now seen corresponding path program 67 times [2018-02-04 17:45:44,830 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:45:44,830 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:45:44,830 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:45:44,830 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:45:44,830 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:45:44,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:45:44,893 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:47,136 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:45:47,137 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:45:47,137 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:45:47,137 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:45:47,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:45:47,184 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:45:48,771 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:45:48,772 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:45:48,772 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78, 77] total 152 [2018-02-04 17:45:48,772 INFO L409 AbstractCegarLoop]: Interpolant automaton has 152 states [2018-02-04 17:45:48,773 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 152 interpolants. [2018-02-04 17:45:48,774 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8551, Invalid=14401, Unknown=0, NotChecked=0, Total=22952 [2018-02-04 17:45:48,774 INFO L87 Difference]: Start difference. First operand 607 states and 608 transitions. Second operand 152 states. [2018-02-04 17:45:49,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:45:49,991 INFO L93 Difference]: Finished difference Result 619 states and 620 transitions. [2018-02-04 17:45:49,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-02-04 17:45:49,991 INFO L78 Accepts]: Start accepts. Automaton has 152 states. Word has length 606 [2018-02-04 17:45:49,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:45:49,992 INFO L225 Difference]: With dead ends: 619 [2018-02-04 17:45:49,992 INFO L226 Difference]: Without dead ends: 619 [2018-02-04 17:45:49,992 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 684 GetRequests, 532 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:45:49,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 619 states. [2018-02-04 17:45:49,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 619 to 615. [2018-02-04 17:45:49,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 615 states. [2018-02-04 17:45:49,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 615 states to 615 states and 616 transitions. [2018-02-04 17:45:49,995 INFO L78 Accepts]: Start accepts. Automaton has 615 states and 616 transitions. Word has length 606 [2018-02-04 17:45:49,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:45:49,995 INFO L432 AbstractCegarLoop]: Abstraction has 615 states and 616 transitions. [2018-02-04 17:45:49,995 INFO L433 AbstractCegarLoop]: Interpolant automaton has 152 states. [2018-02-04 17:45:49,995 INFO L276 IsEmpty]: Start isEmpty. Operand 615 states and 616 transitions. [2018-02-04 17:45:49,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 615 [2018-02-04 17:45:49,997 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:45:49,997 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] [2018-02-04 17:45:49,997 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:45:49,997 INFO L82 PathProgramCache]: Analyzing trace with hash 1621272331, now seen corresponding path program 68 times [2018-02-04 17:45:49,998 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:45:49,998 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:45:49,998 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:45:49,998 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:45:49,998 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:45:50,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:45:50,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:52,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:45:52,274 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:45:52,274 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:45:52,275 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 17:45:52,358 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 17:45:52,358 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:45:52,373 INFO L270 TraceCheckSpWp]: Computing forward predicates... Received shutdown request... [2018-02-04 17:45:52,409 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-02-04 17:45:52,409 WARN L491 AbstractCegarLoop]: Verification canceled [2018-02-04 17:45:52,413 WARN L185 ceAbstractionStarter]: Timeout [2018-02-04 17:45:52,413 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.02 05:45:52 BoogieIcfgContainer [2018-02-04 17:45:52,414 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-04 17:45:52,414 INFO L168 Benchmark]: Toolchain (without parser) took 176902.24 ms. Allocated memory was 400.0 MB in the beginning and 2.4 GB in the end (delta: 2.0 GB). Free memory was 356.5 MB in the beginning and 2.1 GB in the end (delta: -1.8 GB). Peak memory consumption was 224.1 MB. Max. memory is 5.3 GB. [2018-02-04 17:45:52,415 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 400.0 MB. Free memory is still 363.1 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 17:45:52,416 INFO L168 Benchmark]: CACSL2BoogieTranslator took 161.84 ms. Allocated memory is still 400.0 MB. Free memory was 356.5 MB in the beginning and 345.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:45:52,416 INFO L168 Benchmark]: Boogie Preprocessor took 29.39 ms. Allocated memory is still 400.0 MB. Free memory was 345.9 MB in the beginning and 344.5 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-02-04 17:45:52,416 INFO L168 Benchmark]: RCFGBuilder took 178.75 ms. Allocated memory is still 400.0 MB. Free memory was 344.5 MB in the beginning and 324.7 MB in the end (delta: 19.9 MB). Peak memory consumption was 19.9 MB. Max. memory is 5.3 GB. [2018-02-04 17:45:52,416 INFO L168 Benchmark]: TraceAbstraction took 176529.17 ms. Allocated memory was 400.0 MB in the beginning and 2.4 GB in the end (delta: 2.0 GB). Free memory was 324.7 MB in the beginning and 2.1 GB in the end (delta: -1.8 GB). Peak memory consumption was 192.2 MB. Max. memory is 5.3 GB. [2018-02-04 17:45:52,417 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.17 ms. Allocated memory is still 400.0 MB. Free memory is still 363.1 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 161.84 ms. Allocated memory is still 400.0 MB. Free memory was 356.5 MB in the beginning and 345.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 29.39 ms. Allocated memory is still 400.0 MB. Free memory was 345.9 MB in the beginning and 344.5 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 178.75 ms. Allocated memory is still 400.0 MB. Free memory was 344.5 MB in the beginning and 324.7 MB in the end (delta: 19.9 MB). Peak memory consumption was 19.9 MB. Max. memory is 5.3 GB. * TraceAbstraction took 176529.17 ms. Allocated memory was 400.0 MB in the beginning and 2.4 GB in the end (delta: 2.0 GB). Free memory was 324.7 MB in the beginning and 2.1 GB in the end (delta: -1.8 GB). Peak memory consumption was 192.2 MB. 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 615 with TraceHistMax 75, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 2 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 625). Cancelled while BasicCegarLoop was analyzing trace of length 615 with TraceHistMax 75, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 2 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 627). Cancelled while BasicCegarLoop was analyzing trace of length 615 with TraceHistMax 75, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 2 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 627). Cancelled while BasicCegarLoop was analyzing trace of length 615 with TraceHistMax 75, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 2 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 637). Cancelled while BasicCegarLoop was analyzing trace of length 615 with TraceHistMax 75, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 2 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 634). Cancelled while BasicCegarLoop was analyzing trace of length 615 with TraceHistMax 75, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 2 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 639). Cancelled while BasicCegarLoop was analyzing trace of length 615 with TraceHistMax 75, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 2 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 634). Cancelled while BasicCegarLoop was analyzing trace of length 615 with TraceHistMax 75, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 2 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 636). Cancelled while BasicCegarLoop was analyzing trace of length 615 with TraceHistMax 75, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 2 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 637). Cancelled while BasicCegarLoop was analyzing trace of length 615 with TraceHistMax 75, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 2 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 639). Cancelled while BasicCegarLoop was analyzing trace of length 615 with TraceHistMax 75, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 2 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 639). Cancelled while BasicCegarLoop was analyzing trace of length 615 with TraceHistMax 75, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 2 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 639). Cancelled while BasicCegarLoop was analyzing trace of length 615 with TraceHistMax 75, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 2 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 636). Cancelled while BasicCegarLoop was analyzing trace of length 615 with TraceHistMax 75, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 2 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 637). Cancelled while BasicCegarLoop was analyzing trace of length 615 with TraceHistMax 75, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 2 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 637). Cancelled while BasicCegarLoop was analyzing trace of length 615 with TraceHistMax 75, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 2 xjuncts. - TimeoutResultAtElement [Line: 629]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 629). Cancelled while BasicCegarLoop was analyzing trace of length 615 with TraceHistMax 75, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 2 xjuncts. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 53 locations, 17 error locations. TIMEOUT Result, 176.4s OverallTime, 80 OverallIterations, 75 TraceHistogramMax, 64.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1687 SDtfs, 36399 SDslu, 46006 SDs, 0 SdLazy, 75382 SolverSat, 9392 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 23.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 29577 GetRequests, 22761 SyntacticMatches, 33 SemanticMatches, 6783 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 283377 ImplicationChecksByTransitivity, 98.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=615occurred in iteration=79, 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, 79 MinimizatonAttempts, 340 StatesRemovedByMinimization, 75 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 5.2s SatisfiabilityAnalysisTime, 99.7s InterpolantComputationTime, 46420 NumberOfCodeBlocks, 45934 NumberOfCodeBlocksAsserted, 1511 NumberOfCheckSat, 46161 ConstructedInterpolants, 130 QuantifiedInterpolants, 72357399 SizeOfPredicates, 158 NumberOfNonLiveVariables, 57400 ConjunctsInSsa, 3633 ConjunctsInUnsatCore, 150 InterpolantComputations, 7 PerfectInterpolantSequences, 521163/1058452 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-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-04_17-45-52-428.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/960521-1_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-04_17-45-52-428.csv Completed graceful shutdown