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_Array.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/ArraysOfVariableLength_true-valid-memsafety.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-c17473d-m [2018-02-04 16:13:39,837 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-04 16:13:39,838 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-04 16:13:39,848 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-04 16:13:39,849 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-04 16:13:39,850 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-04 16:13:39,850 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-04 16:13:39,852 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-04 16:13:39,853 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-04 16:13:39,854 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-04 16:13:39,854 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-04 16:13:39,854 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-04 16:13:39,855 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-04 16:13:39,856 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-04 16:13:39,857 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-04 16:13:39,859 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-04 16:13:39,860 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-04 16:13:39,862 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-04 16:13:39,863 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-04 16:13:39,864 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-04 16:13:39,865 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-04 16:13:39,866 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-04 16:13:39,866 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-04 16:13:39,867 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-04 16:13:39,867 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-04 16:13:39,868 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-04 16:13:39,868 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-04 16:13:39,869 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-04 16:13:39,869 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-04 16:13:39,869 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-04 16:13:39,870 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-04 16:13:39,870 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_Array.epf [2018-02-04 16:13:39,880 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-04 16:13:39,880 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-04 16:13:39,881 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-04 16:13:39,881 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-04 16:13:39,881 INFO L133 SettingsManager]: * Use SBE=true [2018-02-04 16:13:39,881 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-04 16:13:39,881 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-04 16:13:39,882 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-04 16:13:39,882 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-04 16:13:39,882 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-04 16:13:39,882 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-04 16:13:39,882 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-04 16:13:39,882 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-04 16:13:39,882 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-04 16:13:39,883 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-04 16:13:39,883 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-04 16:13:39,883 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-04 16:13:39,883 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-04 16:13:39,883 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-04 16:13:39,883 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 16:13:39,884 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-04 16:13:39,884 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-02-04 16:13:39,909 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-04 16:13:39,918 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-04 16:13:39,921 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-04 16:13:39,922 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-04 16:13:39,923 INFO L276 PluginConnector]: CDTParser initialized [2018-02-04 16:13:39,923 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/ArraysOfVariableLength_true-valid-memsafety.c [2018-02-04 16:13:40,027 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-04 16:13:40,029 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-04 16:13:40,029 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-04 16:13:40,030 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-04 16:13:40,035 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-04 16:13:40,036 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 04:13:40" (1/1) ... [2018-02-04 16:13:40,039 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@69de7289 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:13:40, skipping insertion in model container [2018-02-04 16:13:40,039 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 04:13:40" (1/1) ... [2018-02-04 16:13:40,053 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 16:13:40,067 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 16:13:40,155 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 16:13:40,166 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 16:13:40,170 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:13:40 WrapperNode [2018-02-04 16:13:40,171 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-04 16:13:40,171 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-04 16:13:40,171 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-04 16:13:40,171 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-04 16:13:40,183 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:13:40" (1/1) ... [2018-02-04 16:13:40,184 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:13:40" (1/1) ... [2018-02-04 16:13:40,190 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:13:40" (1/1) ... [2018-02-04 16:13:40,191 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:13:40" (1/1) ... [2018-02-04 16:13:40,192 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:13:40" (1/1) ... [2018-02-04 16:13:40,194 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:13:40" (1/1) ... [2018-02-04 16:13:40,194 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:13:40" (1/1) ... [2018-02-04 16:13:40,195 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-04 16:13:40,196 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-04 16:13:40,196 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-04 16:13:40,196 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-04 16:13:40,196 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:13:40" (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 16:13:40,231 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-04 16:13:40,231 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-04 16:13:40,231 INFO L136 BoogieDeclarations]: Found implementation of procedure foo [2018-02-04 16:13:40,231 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-04 16:13:40,231 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-04 16:13:40,231 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-04 16:13:40,232 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-04 16:13:40,232 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-04 16:13:40,232 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-04 16:13:40,232 INFO L128 BoogieDeclarations]: Found specification of procedure foo [2018-02-04 16:13:40,232 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-04 16:13:40,232 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-04 16:13:40,232 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-04 16:13:40,379 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-04 16:13:40,380 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 04:13:40 BoogieIcfgContainer [2018-02-04 16:13:40,380 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-04 16:13:40,380 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-04 16:13:40,380 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-04 16:13:40,382 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-04 16:13:40,382 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 04:13:40" (1/3) ... [2018-02-04 16:13:40,383 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@290c1622 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 04:13:40, skipping insertion in model container [2018-02-04 16:13:40,383 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:13:40" (2/3) ... [2018-02-04 16:13:40,383 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@290c1622 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 04:13:40, skipping insertion in model container [2018-02-04 16:13:40,383 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 04:13:40" (3/3) ... [2018-02-04 16:13:40,385 INFO L107 eAbstractionObserver]: Analyzing ICFG ArraysOfVariableLength_true-valid-memsafety.c [2018-02-04 16:13:40,393 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-02-04 16:13:40,397 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 8 error locations. [2018-02-04 16:13:40,427 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-04 16:13:40,427 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-04 16:13:40,427 INFO L324 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-02-04 16:13:40,427 INFO L325 AbstractCegarLoop]: Backedges is CANONICAL [2018-02-04 16:13:40,428 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-04 16:13:40,428 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-04 16:13:40,428 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-04 16:13:40,428 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-04 16:13:40,428 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-04 16:13:40,436 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states. [2018-02-04 16:13:40,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-02-04 16:13:40,442 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:13:40,443 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:13:40,443 INFO L371 AbstractCegarLoop]: === Iteration 1 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 16:13:40,446 INFO L82 PathProgramCache]: Analyzing trace with hash 1202729229, now seen corresponding path program 1 times [2018-02-04 16:13:40,480 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:13:40,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:13:40,506 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:13:40,530 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 16:13:40,531 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 16:13:40,531 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 16:13:40,532 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:13:40,532 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 16:13:40,533 INFO L182 omatonBuilderFactory]: Interpolants [52#true, 53#false] [2018-02-04 16:13:40,533 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 16:13:40,534 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-02-04 16:13:40,546 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-02-04 16:13:40,546 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-02-04 16:13:40,548 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 2 states. [2018-02-04 16:13:40,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:13:40,561 INFO L93 Difference]: Finished difference Result 49 states and 52 transitions. [2018-02-04 16:13:40,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-02-04 16:13:40,562 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 13 [2018-02-04 16:13:40,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:13:40,568 INFO L225 Difference]: With dead ends: 49 [2018-02-04 16:13:40,568 INFO L226 Difference]: Without dead ends: 46 [2018-02-04 16:13:40,569 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-02-04 16:13:40,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-02-04 16:13:40,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-02-04 16:13:40,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-02-04 16:13:40,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 49 transitions. [2018-02-04 16:13:40,591 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 49 transitions. Word has length 13 [2018-02-04 16:13:40,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:13:40,591 INFO L432 AbstractCegarLoop]: Abstraction has 46 states and 49 transitions. [2018-02-04 16:13:40,592 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-02-04 16:13:40,592 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 49 transitions. [2018-02-04 16:13:40,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-04 16:13:40,592 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:13:40,592 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:13:40,592 INFO L371 AbstractCegarLoop]: === Iteration 2 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 16:13:40,592 INFO L82 PathProgramCache]: Analyzing trace with hash -1812590093, now seen corresponding path program 1 times [2018-02-04 16:13:40,593 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:13:40,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:13:40,603 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:13:40,635 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 16:13:40,636 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 16:13:40,636 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 16:13:40,636 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:13:40,636 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 16:13:40,636 INFO L182 omatonBuilderFactory]: Interpolants [149#true, 150#false, 151#(= main_~i~1 0)] [2018-02-04 16:13:40,636 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 16:13:40,637 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 16:13:40,637 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 16:13:40,637 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 16:13:40,638 INFO L87 Difference]: Start difference. First operand 46 states and 49 transitions. Second operand 3 states. [2018-02-04 16:13:40,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:13:40,685 INFO L93 Difference]: Finished difference Result 67 states and 71 transitions. [2018-02-04 16:13:40,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 16:13:40,686 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-02-04 16:13:40,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:13:40,689 INFO L225 Difference]: With dead ends: 67 [2018-02-04 16:13:40,689 INFO L226 Difference]: Without dead ends: 67 [2018-02-04 16:13:40,690 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 16:13:40,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-02-04 16:13:40,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 50. [2018-02-04 16:13:40,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-02-04 16:13:40,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 53 transitions. [2018-02-04 16:13:40,748 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 53 transitions. Word has length 14 [2018-02-04 16:13:40,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:13:40,748 INFO L432 AbstractCegarLoop]: Abstraction has 50 states and 53 transitions. [2018-02-04 16:13:40,748 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 16:13:40,748 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 53 transitions. [2018-02-04 16:13:40,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-02-04 16:13:40,749 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:13:40,749 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:13:40,749 INFO L371 AbstractCegarLoop]: === Iteration 3 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 16:13:40,750 INFO L82 PathProgramCache]: Analyzing trace with hash -267768884, now seen corresponding path program 1 times [2018-02-04 16:13:40,751 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:13:40,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:13:40,766 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:13:40,831 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 16:13:40,831 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 16:13:40,831 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 16:13:40,832 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:13:40,832 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 16:13:40,832 INFO L182 omatonBuilderFactory]: Interpolants [272#(= 0 |foo_#in~size|), 273#(and (= foo_~size 0) (= foo_~i~0 0)), 269#true, 270#false, 271#(= 0 main_~i~1)] [2018-02-04 16:13:40,832 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 16:13:40,833 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 16:13:40,833 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 16:13:40,833 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 16:13:40,833 INFO L87 Difference]: Start difference. First operand 50 states and 53 transitions. Second operand 5 states. [2018-02-04 16:13:40,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:13:40,956 INFO L93 Difference]: Finished difference Result 73 states and 76 transitions. [2018-02-04 16:13:40,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 16:13:40,956 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-02-04 16:13:40,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:13:40,958 INFO L225 Difference]: With dead ends: 73 [2018-02-04 16:13:40,958 INFO L226 Difference]: Without dead ends: 73 [2018-02-04 16:13:40,958 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-02-04 16:13:40,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-02-04 16:13:40,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 57. [2018-02-04 16:13:40,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-02-04 16:13:40,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 60 transitions. [2018-02-04 16:13:40,964 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 60 transitions. Word has length 15 [2018-02-04 16:13:40,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:13:40,965 INFO L432 AbstractCegarLoop]: Abstraction has 57 states and 60 transitions. [2018-02-04 16:13:40,965 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 16:13:40,965 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 60 transitions. [2018-02-04 16:13:40,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-04 16:13:40,966 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:13:40,966 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:13:40,966 INFO L371 AbstractCegarLoop]: === Iteration 4 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 16:13:40,966 INFO L82 PathProgramCache]: Analyzing trace with hash 1098181562, now seen corresponding path program 1 times [2018-02-04 16:13:40,967 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:13:40,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:13:40,978 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:13:41,003 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 16:13:41,003 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 16:13:41,003 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 16:13:41,004 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:13:41,004 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 16:13:41,004 INFO L182 omatonBuilderFactory]: Interpolants [406#true, 407#false, 408#(= 1 (select |#valid| |main_~#b~0.base|))] [2018-02-04 16:13:41,004 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 16:13:41,005 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 16:13:41,005 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 16:13:41,005 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 16:13:41,005 INFO L87 Difference]: Start difference. First operand 57 states and 60 transitions. Second operand 3 states. [2018-02-04 16:13:41,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:13:41,025 INFO L93 Difference]: Finished difference Result 55 states and 58 transitions. [2018-02-04 16:13:41,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 16:13:41,026 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-02-04 16:13:41,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:13:41,028 INFO L225 Difference]: With dead ends: 55 [2018-02-04 16:13:41,028 INFO L226 Difference]: Without dead ends: 55 [2018-02-04 16:13:41,028 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 16:13:41,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-02-04 16:13:41,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-02-04 16:13:41,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-02-04 16:13:41,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 58 transitions. [2018-02-04 16:13:41,032 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 58 transitions. Word has length 19 [2018-02-04 16:13:41,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:13:41,032 INFO L432 AbstractCegarLoop]: Abstraction has 55 states and 58 transitions. [2018-02-04 16:13:41,032 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 16:13:41,032 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 58 transitions. [2018-02-04 16:13:41,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-04 16:13:41,033 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:13:41,033 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:13:41,033 INFO L371 AbstractCegarLoop]: === Iteration 5 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 16:13:41,033 INFO L82 PathProgramCache]: Analyzing trace with hash 1098181563, now seen corresponding path program 1 times [2018-02-04 16:13:41,034 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:13:41,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:13:41,043 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:13:41,107 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 16:13:41,108 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 16:13:41,108 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 16:13:41,108 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:13:41,108 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 16:13:41,108 INFO L182 omatonBuilderFactory]: Interpolants [519#true, 520#false, 521#(and (= |main_~#b~0.offset| 0) (= (select |#length| |main_~#b~0.base|) 400)), 522#(and (= |main_~#b~0.offset| 0) (= (select |#length| |main_~#b~0.base|) 400) (= main_~i~1 0))] [2018-02-04 16:13:41,108 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 16:13:41,109 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 16:13:41,109 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 16:13:41,109 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-02-04 16:13:41,109 INFO L87 Difference]: Start difference. First operand 55 states and 58 transitions. Second operand 4 states. [2018-02-04 16:13:41,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:13:41,163 INFO L93 Difference]: Finished difference Result 65 states and 69 transitions. [2018-02-04 16:13:41,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 16:13:41,164 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2018-02-04 16:13:41,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:13:41,164 INFO L225 Difference]: With dead ends: 65 [2018-02-04 16:13:41,165 INFO L226 Difference]: Without dead ends: 65 [2018-02-04 16:13:41,165 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-02-04 16:13:41,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-02-04 16:13:41,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 58. [2018-02-04 16:13:41,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-02-04 16:13:41,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 61 transitions. [2018-02-04 16:13:41,169 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 61 transitions. Word has length 19 [2018-02-04 16:13:41,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:13:41,170 INFO L432 AbstractCegarLoop]: Abstraction has 58 states and 61 transitions. [2018-02-04 16:13:41,170 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 16:13:41,170 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 61 transitions. [2018-02-04 16:13:41,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-02-04 16:13:41,170 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:13:41,171 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:13:41,171 INFO L371 AbstractCegarLoop]: === Iteration 6 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 16:13:41,171 INFO L82 PathProgramCache]: Analyzing trace with hash -2060273317, now seen corresponding path program 1 times [2018-02-04 16:13:41,172 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:13:41,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:13:41,185 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:13:41,220 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-04 16:13:41,221 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 16:13:41,221 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 16:13:41,221 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:13:41,221 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 16:13:41,222 INFO L182 omatonBuilderFactory]: Interpolants [646#true, 647#false, 648#(<= |foo_#in~size| |foo_#in~n|), 649#(and (= foo_~i~0 0) (<= foo_~size foo_~n)), 650#(and (= foo_~i~0 0) (<= (+ foo_~i~0 1) foo_~n))] [2018-02-04 16:13:41,222 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-04 16:13:41,222 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 16:13:41,222 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 16:13:41,223 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 16:13:41,223 INFO L87 Difference]: Start difference. First operand 58 states and 61 transitions. Second operand 5 states. [2018-02-04 16:13:41,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:13:41,280 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2018-02-04 16:13:41,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 16:13:41,282 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2018-02-04 16:13:41,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:13:41,283 INFO L225 Difference]: With dead ends: 69 [2018-02-04 16:13:41,283 INFO L226 Difference]: Without dead ends: 69 [2018-02-04 16:13:41,284 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 16:13:41,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-02-04 16:13:41,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 61. [2018-02-04 16:13:41,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-02-04 16:13:41,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 65 transitions. [2018-02-04 16:13:41,289 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 65 transitions. Word has length 28 [2018-02-04 16:13:41,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:13:41,289 INFO L432 AbstractCegarLoop]: Abstraction has 61 states and 65 transitions. [2018-02-04 16:13:41,289 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 16:13:41,289 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 65 transitions. [2018-02-04 16:13:41,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-02-04 16:13:41,290 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:13:41,290 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:13:41,290 INFO L371 AbstractCegarLoop]: === Iteration 7 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 16:13:41,291 INFO L82 PathProgramCache]: Analyzing trace with hash 556036660, now seen corresponding path program 1 times [2018-02-04 16:13:41,292 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:13:41,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:13:41,306 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:13:41,405 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 16:13:41,405 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:13:41,405 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-02-04 16:13:41,406 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:13:41,406 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 16:13:41,406 INFO L182 omatonBuilderFactory]: Interpolants [785#true, 786#false, 787#(and (= 400 (select |#length| |main_~#b~0.base|)) (= 0 |main_~#b~0.offset|)), 788#(and (<= main_~i~1 99) (= 400 (select |#length| |main_~#b~0.base|)) (= 0 |main_~#b~0.offset|)), 789#(and (<= main_~i~1 100) (= 400 (select |#length| |main_~#b~0.base|)) (= 0 |main_~#b~0.offset|)), 790#(and (= 0 |foo_#in~b.offset|) (<= |foo_#in~n| 100) (= 400 (select |#length| |foo_#in~b.base|))), 791#(and (= (select |#length| foo_~b.base) 400) (<= foo_~n 100) (= foo_~b.offset 0)), 792#(and (<= foo_~i~0 99) (= (select |#length| foo_~b.base) 400) (<= 0 foo_~i~0) (= foo_~b.offset 0))] [2018-02-04 16:13:41,406 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 16:13:41,407 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 16:13:41,407 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 16:13:41,407 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-02-04 16:13:41,407 INFO L87 Difference]: Start difference. First operand 61 states and 65 transitions. Second operand 8 states. [2018-02-04 16:13:41,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:13:41,515 INFO L93 Difference]: Finished difference Result 63 states and 67 transitions. [2018-02-04 16:13:41,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 16:13:41,515 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 29 [2018-02-04 16:13:41,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:13:41,516 INFO L225 Difference]: With dead ends: 63 [2018-02-04 16:13:41,516 INFO L226 Difference]: Without dead ends: 63 [2018-02-04 16:13:41,517 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-02-04 16:13:41,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-02-04 16:13:41,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 60. [2018-02-04 16:13:41,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-02-04 16:13:41,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 64 transitions. [2018-02-04 16:13:41,521 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 64 transitions. Word has length 29 [2018-02-04 16:13:41,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:13:41,521 INFO L432 AbstractCegarLoop]: Abstraction has 60 states and 64 transitions. [2018-02-04 16:13:41,521 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 16:13:41,522 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 64 transitions. [2018-02-04 16:13:41,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-02-04 16:13:41,522 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:13:41,522 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:13:41,523 INFO L371 AbstractCegarLoop]: === Iteration 8 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 16:13:41,523 INFO L82 PathProgramCache]: Analyzing trace with hash 556036659, now seen corresponding path program 1 times [2018-02-04 16:13:41,524 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:13:41,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:13:41,534 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:13:41,590 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 16:13:41,591 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 16:13:41,591 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 16:13:41,591 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:13:41,591 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 16:13:41,591 INFO L182 omatonBuilderFactory]: Interpolants [922#true, 923#false, 924#(= 1 (select |#valid| |main_~#b~0.base|)), 925#(= 1 (select |#valid| |foo_#in~b.base|)), 926#(= 1 (select |#valid| foo_~b.base))] [2018-02-04 16:13:41,592 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 16:13:41,592 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 16:13:41,592 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 16:13:41,592 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 16:13:41,592 INFO L87 Difference]: Start difference. First operand 60 states and 64 transitions. Second operand 5 states. [2018-02-04 16:13:41,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:13:41,621 INFO L93 Difference]: Finished difference Result 59 states and 63 transitions. [2018-02-04 16:13:41,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 16:13:41,622 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2018-02-04 16:13:41,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:13:41,623 INFO L225 Difference]: With dead ends: 59 [2018-02-04 16:13:41,623 INFO L226 Difference]: Without dead ends: 59 [2018-02-04 16:13:41,623 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-02-04 16:13:41,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-02-04 16:13:41,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-02-04 16:13:41,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-02-04 16:13:41,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 63 transitions. [2018-02-04 16:13:41,626 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 63 transitions. Word has length 29 [2018-02-04 16:13:41,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:13:41,627 INFO L432 AbstractCegarLoop]: Abstraction has 59 states and 63 transitions. [2018-02-04 16:13:41,627 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 16:13:41,627 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 63 transitions. [2018-02-04 16:13:41,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-02-04 16:13:41,628 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:13:41,628 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:13:41,628 INFO L371 AbstractCegarLoop]: === Iteration 9 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 16:13:41,628 INFO L82 PathProgramCache]: Analyzing trace with hash -848422454, now seen corresponding path program 1 times [2018-02-04 16:13:41,629 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:13:41,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:13:41,639 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:13:41,745 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-04 16:13:41,746 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 16:13:41,746 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 16:13:41,746 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:13:41,746 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 16:13:41,746 INFO L182 omatonBuilderFactory]: Interpolants [1048#true, 1049#false, 1050#(and (= |main_~#b~0.offset| 0) (= (select |#length| |main_~#b~0.base|) 400)), 1051#(and (= |main_~#b~0.offset| 0) (<= 0 (+ (* 4 main_~i~1) |main_~#b~0.offset|)) (= (select |#length| |main_~#b~0.base|) 400)), 1052#(and (= |main_~#b~0.offset| 0) (= (select |#length| |main_~#b~0.base|) 400) (<= 4 (+ (* 4 main_~i~1) |main_~#b~0.offset|))), 1053#(and (<= main_~i~1 99) (= |main_~#b~0.offset| 0) (= (select |#length| |main_~#b~0.base|) 400) (<= 4 (+ (* 4 main_~i~1) |main_~#b~0.offset|)))] [2018-02-04 16:13:41,746 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-04 16:13:41,746 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 16:13:41,747 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 16:13:41,747 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-02-04 16:13:41,747 INFO L87 Difference]: Start difference. First operand 59 states and 63 transitions. Second operand 6 states. [2018-02-04 16:13:41,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:13:41,805 INFO L93 Difference]: Finished difference Result 64 states and 69 transitions. [2018-02-04 16:13:41,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 16:13:41,805 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 32 [2018-02-04 16:13:41,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:13:41,805 INFO L225 Difference]: With dead ends: 64 [2018-02-04 16:13:41,805 INFO L226 Difference]: Without dead ends: 64 [2018-02-04 16:13:41,806 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-02-04 16:13:41,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-02-04 16:13:41,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 54. [2018-02-04 16:13:41,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-02-04 16:13:41,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 58 transitions. [2018-02-04 16:13:41,809 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 58 transitions. Word has length 32 [2018-02-04 16:13:41,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:13:41,809 INFO L432 AbstractCegarLoop]: Abstraction has 54 states and 58 transitions. [2018-02-04 16:13:41,809 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 16:13:41,809 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2018-02-04 16:13:41,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-02-04 16:13:41,810 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:13:41,810 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:13:41,810 INFO L371 AbstractCegarLoop]: === Iteration 10 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 16:13:41,810 INFO L82 PathProgramCache]: Analyzing trace with hash -1529051221, now seen corresponding path program 1 times [2018-02-04 16:13:41,811 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:13:41,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:13:41,819 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:13:41,857 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 16:13:41,857 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:13:41,857 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-02-04 16:13:41,858 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:13:41,858 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 16:13:41,858 INFO L182 omatonBuilderFactory]: Interpolants [1172#true, 1173#false, 1174#(= main_~i~1 0), 1175#(<= main_~i~1 1)] [2018-02-04 16:13:41,858 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 16:13:41,858 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 16:13:41,858 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 16:13:41,858 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-02-04 16:13:41,858 INFO L87 Difference]: Start difference. First operand 54 states and 58 transitions. Second operand 4 states. [2018-02-04 16:13:41,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:13:41,884 INFO L93 Difference]: Finished difference Result 83 states and 88 transitions. [2018-02-04 16:13:41,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 16:13:41,884 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 32 [2018-02-04 16:13:41,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:13:41,885 INFO L225 Difference]: With dead ends: 83 [2018-02-04 16:13:41,885 INFO L226 Difference]: Without dead ends: 83 [2018-02-04 16:13:41,885 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-02-04 16:13:41,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-02-04 16:13:41,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 65. [2018-02-04 16:13:41,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-02-04 16:13:41,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 70 transitions. [2018-02-04 16:13:41,889 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 70 transitions. Word has length 32 [2018-02-04 16:13:41,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:13:41,889 INFO L432 AbstractCegarLoop]: Abstraction has 65 states and 70 transitions. [2018-02-04 16:13:41,889 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 16:13:41,889 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 70 transitions. [2018-02-04 16:13:41,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-02-04 16:13:41,890 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:13:41,890 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:13:41,890 INFO L371 AbstractCegarLoop]: === Iteration 11 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 16:13:41,890 INFO L82 PathProgramCache]: Analyzing trace with hash -736270445, now seen corresponding path program 1 times [2018-02-04 16:13:41,891 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:13:41,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:13:41,900 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:13:41,958 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 16:13:41,959 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:13:41,959 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-02-04 16:13:41,959 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:13:41,959 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 16:13:41,960 INFO L182 omatonBuilderFactory]: Interpolants [1328#(<= |foo_#in~size| 1), 1329#(<= foo_~size 1), 1330#(<= foo_~size (+ foo_~i~0 1)), 1331#(<= foo_~size foo_~i~0), 1324#true, 1325#false, 1326#(= main_~i~1 0), 1327#(<= main_~i~1 1)] [2018-02-04 16:13:41,960 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 16:13:41,960 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 16:13:41,960 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 16:13:41,961 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-02-04 16:13:41,961 INFO L87 Difference]: Start difference. First operand 65 states and 70 transitions. Second operand 8 states. [2018-02-04 16:13:42,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:13:42,066 INFO L93 Difference]: Finished difference Result 95 states and 100 transitions. [2018-02-04 16:13:42,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 16:13:42,066 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 34 [2018-02-04 16:13:42,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:13:42,067 INFO L225 Difference]: With dead ends: 95 [2018-02-04 16:13:42,067 INFO L226 Difference]: Without dead ends: 95 [2018-02-04 16:13:42,067 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-02-04 16:13:42,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-02-04 16:13:42,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 78. [2018-02-04 16:13:42,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-02-04 16:13:42,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 84 transitions. [2018-02-04 16:13:42,070 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 84 transitions. Word has length 34 [2018-02-04 16:13:42,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:13:42,070 INFO L432 AbstractCegarLoop]: Abstraction has 78 states and 84 transitions. [2018-02-04 16:13:42,070 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 16:13:42,070 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 84 transitions. [2018-02-04 16:13:42,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-02-04 16:13:42,071 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:13:42,071 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:13:42,071 INFO L371 AbstractCegarLoop]: === Iteration 12 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 16:13:42,071 INFO L82 PathProgramCache]: Analyzing trace with hash 733800956, now seen corresponding path program 2 times [2018-02-04 16:13:42,072 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:13:42,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:13:42,078 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:13:42,119 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-04 16:13:42,120 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:13:42,120 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-02-04 16:13:42,120 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:13:42,120 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 16:13:42,121 INFO L182 omatonBuilderFactory]: Interpolants [1511#true, 1512#false, 1513#(= main_~i~1 0), 1514#(<= main_~i~1 1), 1515#(<= main_~i~1 2)] [2018-02-04 16:13:42,121 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-04 16:13:42,121 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 16:13:42,121 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 16:13:42,121 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-02-04 16:13:42,122 INFO L87 Difference]: Start difference. First operand 78 states and 84 transitions. Second operand 5 states. [2018-02-04 16:13:42,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:13:42,178 INFO L93 Difference]: Finished difference Result 112 states and 118 transitions. [2018-02-04 16:13:42,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 16:13:42,179 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 45 [2018-02-04 16:13:42,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:13:42,180 INFO L225 Difference]: With dead ends: 112 [2018-02-04 16:13:42,180 INFO L226 Difference]: Without dead ends: 112 [2018-02-04 16:13:42,180 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-02-04 16:13:42,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-02-04 16:13:42,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 89. [2018-02-04 16:13:42,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-02-04 16:13:42,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 96 transitions. [2018-02-04 16:13:42,184 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 96 transitions. Word has length 45 [2018-02-04 16:13:42,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:13:42,185 INFO L432 AbstractCegarLoop]: Abstraction has 89 states and 96 transitions. [2018-02-04 16:13:42,185 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 16:13:42,185 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 96 transitions. [2018-02-04 16:13:42,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-02-04 16:13:42,186 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:13:42,186 INFO L351 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:13:42,186 INFO L371 AbstractCegarLoop]: === Iteration 13 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 16:13:42,186 INFO L82 PathProgramCache]: Analyzing trace with hash 611219876, now seen corresponding path program 2 times [2018-02-04 16:13:42,187 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:13:42,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:13:42,198 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:13:42,276 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 22 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-04 16:13:42,276 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:13:42,276 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-02-04 16:13:42,277 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:13:42,277 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 16:13:42,277 INFO L182 omatonBuilderFactory]: Interpolants [1717#true, 1718#false, 1719#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 1720#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~i~0)), 1721#(<= |foo_#in~size| 0), 1722#(<= main_~i~1 0), 1723#(<= main_~i~1 1), 1724#(<= |foo_#in~size| 1), 1725#(<= foo_~size 1), 1726#(<= foo_~size (+ foo_~i~0 1)), 1727#(<= foo_~size foo_~i~0)] [2018-02-04 16:13:42,277 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 22 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-04 16:13:42,277 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 16:13:42,278 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 16:13:42,278 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2018-02-04 16:13:42,278 INFO L87 Difference]: Start difference. First operand 89 states and 96 transitions. Second operand 11 states. [2018-02-04 16:13:42,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:13:42,402 INFO L93 Difference]: Finished difference Result 137 states and 144 transitions. [2018-02-04 16:13:42,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-04 16:13:42,403 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 47 [2018-02-04 16:13:42,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:13:42,404 INFO L225 Difference]: With dead ends: 137 [2018-02-04 16:13:42,404 INFO L226 Difference]: Without dead ends: 137 [2018-02-04 16:13:42,404 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2018-02-04 16:13:42,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-02-04 16:13:42,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 114. [2018-02-04 16:13:42,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-02-04 16:13:42,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 123 transitions. [2018-02-04 16:13:42,409 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 123 transitions. Word has length 47 [2018-02-04 16:13:42,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:13:42,409 INFO L432 AbstractCegarLoop]: Abstraction has 114 states and 123 transitions. [2018-02-04 16:13:42,410 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 16:13:42,410 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 123 transitions. [2018-02-04 16:13:42,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-02-04 16:13:42,412 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:13:42,412 INFO L351 BasicCegarLoop]: trace histogram [5, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:13:42,412 INFO L371 AbstractCegarLoop]: === Iteration 14 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 16:13:42,412 INFO L82 PathProgramCache]: Analyzing trace with hash -1268780948, now seen corresponding path program 3 times [2018-02-04 16:13:42,413 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:13:42,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:13:42,423 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:13:42,471 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 21 proven. 1 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-02-04 16:13:42,471 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:13:42,471 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-02-04 16:13:42,471 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:13:42,471 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 16:13:42,471 INFO L182 omatonBuilderFactory]: Interpolants [1987#true, 1988#false, 1989#(<= |foo_#in~size| |foo_#in~n|), 1990#(<= foo_~size foo_~n), 1991#(and (<= 0 foo_~i~0) (<= foo_~size foo_~n)), 1992#(and (<= 1 foo_~i~0) (<= foo_~size foo_~n)), 1993#(and (<= 1 foo_~i~0) (<= (+ foo_~i~0 1) foo_~n))] [2018-02-04 16:13:42,472 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 21 proven. 1 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-02-04 16:13:42,472 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 16:13:42,472 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 16:13:42,472 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-02-04 16:13:42,472 INFO L87 Difference]: Start difference. First operand 114 states and 123 transitions. Second operand 7 states. [2018-02-04 16:13:42,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:13:42,523 INFO L93 Difference]: Finished difference Result 116 states and 125 transitions. [2018-02-04 16:13:42,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 16:13:42,524 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 53 [2018-02-04 16:13:42,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:13:42,526 INFO L225 Difference]: With dead ends: 116 [2018-02-04 16:13:42,526 INFO L226 Difference]: Without dead ends: 116 [2018-02-04 16:13:42,526 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2018-02-04 16:13:42,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-02-04 16:13:42,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 112. [2018-02-04 16:13:42,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-02-04 16:13:42,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 121 transitions. [2018-02-04 16:13:42,530 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 121 transitions. Word has length 53 [2018-02-04 16:13:42,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:13:42,530 INFO L432 AbstractCegarLoop]: Abstraction has 112 states and 121 transitions. [2018-02-04 16:13:42,530 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 16:13:42,531 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 121 transitions. [2018-02-04 16:13:42,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-02-04 16:13:42,532 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:13:42,532 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:13:42,532 INFO L371 AbstractCegarLoop]: === Iteration 15 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 16:13:42,532 INFO L82 PathProgramCache]: Analyzing trace with hash 17999059, now seen corresponding path program 1 times [2018-02-04 16:13:42,533 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:13:42,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:13:42,542 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:13:42,578 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-02-04 16:13:42,578 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:13:42,578 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-02-04 16:13:42,579 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:13:42,579 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 16:13:42,579 INFO L182 omatonBuilderFactory]: Interpolants [2228#true, 2229#false, 2230#(= main_~i~1 0), 2231#(<= main_~i~1 1), 2232#(<= main_~i~1 2), 2233#(<= main_~i~1 3)] [2018-02-04 16:13:42,579 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-02-04 16:13:42,580 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 16:13:42,580 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 16:13:42,580 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-02-04 16:13:42,580 INFO L87 Difference]: Start difference. First operand 112 states and 121 transitions. Second operand 6 states. [2018-02-04 16:13:42,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:13:42,620 INFO L93 Difference]: Finished difference Result 170 states and 185 transitions. [2018-02-04 16:13:42,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 16:13:42,620 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 64 [2018-02-04 16:13:42,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:13:42,621 INFO L225 Difference]: With dead ends: 170 [2018-02-04 16:13:42,621 INFO L226 Difference]: Without dead ends: 170 [2018-02-04 16:13:42,622 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-02-04 16:13:42,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2018-02-04 16:13:42,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 131. [2018-02-04 16:13:42,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-02-04 16:13:42,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 145 transitions. [2018-02-04 16:13:42,626 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 145 transitions. Word has length 64 [2018-02-04 16:13:42,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:13:42,627 INFO L432 AbstractCegarLoop]: Abstraction has 131 states and 145 transitions. [2018-02-04 16:13:42,627 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 16:13:42,627 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 145 transitions. [2018-02-04 16:13:42,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-02-04 16:13:42,628 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:13:42,628 INFO L351 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:13:42,628 INFO L371 AbstractCegarLoop]: === Iteration 16 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 16:13:42,628 INFO L82 PathProgramCache]: Analyzing trace with hash 1865253668, now seen corresponding path program 2 times [2018-02-04 16:13:42,629 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:13:42,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:13:42,644 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:13:42,722 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2018-02-04 16:13:42,722 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:13:42,722 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-02-04 16:13:42,723 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:13:42,723 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-04 16:13:42,723 INFO L182 omatonBuilderFactory]: Interpolants [2535#true, 2536#false, 2537#(= main_~i~1 0), 2538#(<= main_~i~1 1), 2539#(<= main_~i~1 2), 2540#(<= main_~i~1 3), 2541#(<= main_~i~1 4)] [2018-02-04 16:13:42,723 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2018-02-04 16:13:42,723 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 16:13:42,724 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 16:13:42,724 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-02-04 16:13:42,724 INFO L87 Difference]: Start difference. First operand 131 states and 145 transitions. Second operand 7 states. [2018-02-04 16:13:42,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:13:42,798 INFO L93 Difference]: Finished difference Result 194 states and 213 transitions. [2018-02-04 16:13:42,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 16:13:42,798 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 77 [2018-02-04 16:13:42,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:13:42,800 INFO L225 Difference]: With dead ends: 194 [2018-02-04 16:13:42,800 INFO L226 Difference]: Without dead ends: 194 [2018-02-04 16:13:42,800 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-02-04 16:13:42,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2018-02-04 16:13:42,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 150. [2018-02-04 16:13:42,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-02-04 16:13:42,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 169 transitions. [2018-02-04 16:13:42,807 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 169 transitions. Word has length 77 [2018-02-04 16:13:42,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:13:42,807 INFO L432 AbstractCegarLoop]: Abstraction has 150 states and 169 transitions. [2018-02-04 16:13:42,807 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 16:13:42,807 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 169 transitions. [2018-02-04 16:13:42,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-02-04 16:13:42,809 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:13:42,809 INFO L351 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:13:42,809 INFO L371 AbstractCegarLoop]: === Iteration 17 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 16:13:42,809 INFO L82 PathProgramCache]: Analyzing trace with hash 123220083, now seen corresponding path program 3 times [2018-02-04 16:13:42,810 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:13:42,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:13:42,822 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:13:42,878 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 0 proven. 80 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-02-04 16:13:42,878 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:13:42,878 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-02-04 16:13:42,879 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:13:42,879 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-02-04 16:13:42,879 INFO L182 omatonBuilderFactory]: Interpolants [2886#true, 2887#false, 2888#(= main_~i~1 0), 2889#(<= main_~i~1 1), 2890#(<= main_~i~1 2), 2891#(<= main_~i~1 3), 2892#(<= main_~i~1 4), 2893#(<= main_~i~1 5)] [2018-02-04 16:13:42,880 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 0 proven. 80 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-02-04 16:13:42,880 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 16:13:42,880 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 16:13:42,880 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-02-04 16:13:42,881 INFO L87 Difference]: Start difference. First operand 150 states and 169 transitions. Second operand 8 states. [2018-02-04 16:13:42,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:13:42,964 INFO L93 Difference]: Finished difference Result 218 states and 241 transitions. [2018-02-04 16:13:42,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 16:13:42,965 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 90 [2018-02-04 16:13:42,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:13:42,966 INFO L225 Difference]: With dead ends: 218 [2018-02-04 16:13:42,966 INFO L226 Difference]: Without dead ends: 218 [2018-02-04 16:13:42,966 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-02-04 16:13:42,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2018-02-04 16:13:42,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 169. [2018-02-04 16:13:42,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2018-02-04 16:13:42,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 193 transitions. [2018-02-04 16:13:42,972 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 193 transitions. Word has length 90 [2018-02-04 16:13:42,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:13:42,972 INFO L432 AbstractCegarLoop]: Abstraction has 169 states and 193 transitions. [2018-02-04 16:13:42,973 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 16:13:42,973 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 193 transitions. [2018-02-04 16:13:42,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-02-04 16:13:42,974 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:13:42,974 INFO L351 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:13:42,974 INFO L371 AbstractCegarLoop]: === Iteration 18 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 16:13:42,974 INFO L82 PathProgramCache]: Analyzing trace with hash 404740996, now seen corresponding path program 4 times [2018-02-04 16:13:42,975 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:13:42,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:13:42,988 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:13:43,063 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 117 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2018-02-04 16:13:43,063 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:13:43,063 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-02-04 16:13:43,063 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:13:43,064 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-02-04 16:13:43,064 INFO L182 omatonBuilderFactory]: Interpolants [3281#true, 3282#false, 3283#(= main_~i~1 0), 3284#(<= main_~i~1 1), 3285#(<= main_~i~1 2), 3286#(<= main_~i~1 3), 3287#(<= main_~i~1 4), 3288#(<= main_~i~1 5), 3289#(<= main_~i~1 6)] [2018-02-04 16:13:43,064 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 117 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2018-02-04 16:13:43,064 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 16:13:43,064 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 16:13:43,065 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-02-04 16:13:43,065 INFO L87 Difference]: Start difference. First operand 169 states and 193 transitions. Second operand 9 states. [2018-02-04 16:13:43,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:13:43,151 INFO L93 Difference]: Finished difference Result 242 states and 269 transitions. [2018-02-04 16:13:43,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 16:13:43,151 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 103 [2018-02-04 16:13:43,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:13:43,152 INFO L225 Difference]: With dead ends: 242 [2018-02-04 16:13:43,152 INFO L226 Difference]: Without dead ends: 242 [2018-02-04 16:13:43,153 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-02-04 16:13:43,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2018-02-04 16:13:43,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 188. [2018-02-04 16:13:43,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2018-02-04 16:13:43,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 217 transitions. [2018-02-04 16:13:43,159 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 217 transitions. Word has length 103 [2018-02-04 16:13:43,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:13:43,159 INFO L432 AbstractCegarLoop]: Abstraction has 188 states and 217 transitions. [2018-02-04 16:13:43,159 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 16:13:43,159 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 217 transitions. [2018-02-04 16:13:43,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-02-04 16:13:43,161 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:13:43,161 INFO L351 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:13:43,161 INFO L371 AbstractCegarLoop]: === Iteration 19 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 16:13:43,161 INFO L82 PathProgramCache]: Analyzing trace with hash -400526317, now seen corresponding path program 5 times [2018-02-04 16:13:43,162 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:13:43,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:13:43,175 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:13:43,258 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 0 proven. 161 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2018-02-04 16:13:43,258 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:13:43,258 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-02-04 16:13:43,259 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:13:43,259 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2018-02-04 16:13:43,259 INFO L182 omatonBuilderFactory]: Interpolants [3728#(<= main_~i~1 6), 3729#(<= main_~i~1 7), 3720#true, 3721#false, 3722#(= main_~i~1 0), 3723#(<= main_~i~1 1), 3724#(<= main_~i~1 2), 3725#(<= main_~i~1 3), 3726#(<= main_~i~1 4), 3727#(<= main_~i~1 5)] [2018-02-04 16:13:43,259 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 0 proven. 161 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2018-02-04 16:13:43,260 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-04 16:13:43,260 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-04 16:13:43,260 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-02-04 16:13:43,260 INFO L87 Difference]: Start difference. First operand 188 states and 217 transitions. Second operand 10 states. [2018-02-04 16:13:43,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:13:43,354 INFO L93 Difference]: Finished difference Result 266 states and 297 transitions. [2018-02-04 16:13:43,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 16:13:43,355 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 116 [2018-02-04 16:13:43,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:13:43,356 INFO L225 Difference]: With dead ends: 266 [2018-02-04 16:13:43,356 INFO L226 Difference]: Without dead ends: 266 [2018-02-04 16:13:43,357 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-02-04 16:13:43,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2018-02-04 16:13:43,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 207. [2018-02-04 16:13:43,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2018-02-04 16:13:43,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 241 transitions. [2018-02-04 16:13:43,364 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 241 transitions. Word has length 116 [2018-02-04 16:13:43,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:13:43,365 INFO L432 AbstractCegarLoop]: Abstraction has 207 states and 241 transitions. [2018-02-04 16:13:43,365 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-04 16:13:43,365 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 241 transitions. [2018-02-04 16:13:43,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-02-04 16:13:43,367 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:13:43,367 INFO L351 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:13:43,367 INFO L371 AbstractCegarLoop]: === Iteration 20 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 16:13:43,367 INFO L82 PathProgramCache]: Analyzing trace with hash -222659612, now seen corresponding path program 6 times [2018-02-04 16:13:43,368 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:13:43,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:13:43,393 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:13:43,503 INFO L134 CoverageAnalysis]: Checked inductivity of 396 backedges. 0 proven. 212 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2018-02-04 16:13:43,504 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:13:43,504 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-02-04 16:13:43,504 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:13:43,504 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2018-02-04 16:13:43,504 INFO L182 omatonBuilderFactory]: Interpolants [4208#(<= main_~i~1 3), 4209#(<= main_~i~1 4), 4210#(<= main_~i~1 5), 4211#(<= main_~i~1 6), 4212#(<= main_~i~1 7), 4213#(<= main_~i~1 8), 4203#true, 4204#false, 4205#(= main_~i~1 0), 4206#(<= main_~i~1 1), 4207#(<= main_~i~1 2)] [2018-02-04 16:13:43,505 INFO L134 CoverageAnalysis]: Checked inductivity of 396 backedges. 0 proven. 212 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2018-02-04 16:13:43,505 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 16:13:43,505 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 16:13:43,505 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-02-04 16:13:43,506 INFO L87 Difference]: Start difference. First operand 207 states and 241 transitions. Second operand 11 states. [2018-02-04 16:13:43,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:13:43,629 INFO L93 Difference]: Finished difference Result 290 states and 325 transitions. [2018-02-04 16:13:43,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-04 16:13:43,630 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 129 [2018-02-04 16:13:43,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:13:43,631 INFO L225 Difference]: With dead ends: 290 [2018-02-04 16:13:43,632 INFO L226 Difference]: Without dead ends: 290 [2018-02-04 16:13:43,632 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-02-04 16:13:43,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2018-02-04 16:13:43,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 226. [2018-02-04 16:13:43,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2018-02-04 16:13:43,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 265 transitions. [2018-02-04 16:13:43,639 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 265 transitions. Word has length 129 [2018-02-04 16:13:43,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:13:43,639 INFO L432 AbstractCegarLoop]: Abstraction has 226 states and 265 transitions. [2018-02-04 16:13:43,639 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 16:13:43,639 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 265 transitions. [2018-02-04 16:13:43,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-02-04 16:13:43,641 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:13:43,641 INFO L351 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:13:43,641 INFO L371 AbstractCegarLoop]: === Iteration 21 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 16:13:43,642 INFO L82 PathProgramCache]: Analyzing trace with hash -386568269, now seen corresponding path program 7 times [2018-02-04 16:13:43,642 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:13:43,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:13:43,659 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:13:43,747 INFO L134 CoverageAnalysis]: Checked inductivity of 504 backedges. 0 proven. 270 refuted. 0 times theorem prover too weak. 234 trivial. 0 not checked. [2018-02-04 16:13:43,747 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:13:43,747 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-04 16:13:43,748 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:13:43,748 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2018-02-04 16:13:43,748 INFO L182 omatonBuilderFactory]: Interpolants [4736#(<= main_~i~1 4), 4737#(<= main_~i~1 5), 4738#(<= main_~i~1 6), 4739#(<= main_~i~1 7), 4740#(<= main_~i~1 8), 4741#(<= main_~i~1 9), 4730#true, 4731#false, 4732#(= main_~i~1 0), 4733#(<= main_~i~1 1), 4734#(<= main_~i~1 2), 4735#(<= main_~i~1 3)] [2018-02-04 16:13:43,748 INFO L134 CoverageAnalysis]: Checked inductivity of 504 backedges. 0 proven. 270 refuted. 0 times theorem prover too weak. 234 trivial. 0 not checked. [2018-02-04 16:13:43,748 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-04 16:13:43,748 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-04 16:13:43,749 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-02-04 16:13:43,749 INFO L87 Difference]: Start difference. First operand 226 states and 265 transitions. Second operand 12 states. [2018-02-04 16:13:43,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:13:43,872 INFO L93 Difference]: Finished difference Result 314 states and 353 transitions. [2018-02-04 16:13:43,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-04 16:13:43,872 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 142 [2018-02-04 16:13:43,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:13:43,874 INFO L225 Difference]: With dead ends: 314 [2018-02-04 16:13:43,874 INFO L226 Difference]: Without dead ends: 314 [2018-02-04 16:13:43,875 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-02-04 16:13:43,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2018-02-04 16:13:43,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 245. [2018-02-04 16:13:43,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2018-02-04 16:13:43,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 289 transitions. [2018-02-04 16:13:43,882 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 289 transitions. Word has length 142 [2018-02-04 16:13:43,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:13:43,882 INFO L432 AbstractCegarLoop]: Abstraction has 245 states and 289 transitions. [2018-02-04 16:13:43,882 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-04 16:13:43,882 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 289 transitions. [2018-02-04 16:13:43,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-02-04 16:13:43,884 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:13:43,884 INFO L351 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:13:43,884 INFO L371 AbstractCegarLoop]: === Iteration 22 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 16:13:43,885 INFO L82 PathProgramCache]: Analyzing trace with hash -1984732092, now seen corresponding path program 8 times [2018-02-04 16:13:43,885 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:13:43,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:13:43,903 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:13:44,052 INFO L134 CoverageAnalysis]: Checked inductivity of 625 backedges. 0 proven. 335 refuted. 0 times theorem prover too weak. 290 trivial. 0 not checked. [2018-02-04 16:13:44,052 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:13:44,053 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-02-04 16:13:44,053 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:13:44,053 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2018-02-04 16:13:44,053 INFO L182 omatonBuilderFactory]: Interpolants [5312#(<= main_~i~1 9), 5313#(<= main_~i~1 10), 5301#true, 5302#false, 5303#(= main_~i~1 0), 5304#(<= main_~i~1 1), 5305#(<= main_~i~1 2), 5306#(<= main_~i~1 3), 5307#(<= main_~i~1 4), 5308#(<= main_~i~1 5), 5309#(<= main_~i~1 6), 5310#(<= main_~i~1 7), 5311#(<= main_~i~1 8)] [2018-02-04 16:13:44,054 INFO L134 CoverageAnalysis]: Checked inductivity of 625 backedges. 0 proven. 335 refuted. 0 times theorem prover too weak. 290 trivial. 0 not checked. [2018-02-04 16:13:44,054 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-04 16:13:44,054 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-04 16:13:44,055 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-02-04 16:13:44,055 INFO L87 Difference]: Start difference. First operand 245 states and 289 transitions. Second operand 13 states. [2018-02-04 16:13:44,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:13:44,203 INFO L93 Difference]: Finished difference Result 338 states and 381 transitions. [2018-02-04 16:13:44,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-04 16:13:44,205 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 155 [2018-02-04 16:13:44,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:13:44,207 INFO L225 Difference]: With dead ends: 338 [2018-02-04 16:13:44,207 INFO L226 Difference]: Without dead ends: 338 [2018-02-04 16:13:44,207 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-02-04 16:13:44,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2018-02-04 16:13:44,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 264. [2018-02-04 16:13:44,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 264 states. [2018-02-04 16:13:44,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 313 transitions. [2018-02-04 16:13:44,216 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 313 transitions. Word has length 155 [2018-02-04 16:13:44,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:13:44,216 INFO L432 AbstractCegarLoop]: Abstraction has 264 states and 313 transitions. [2018-02-04 16:13:44,216 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-04 16:13:44,216 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 313 transitions. [2018-02-04 16:13:44,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2018-02-04 16:13:44,218 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:13:44,219 INFO L351 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:13:44,219 INFO L371 AbstractCegarLoop]: === Iteration 23 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 16:13:44,219 INFO L82 PathProgramCache]: Analyzing trace with hash 383853395, now seen corresponding path program 9 times [2018-02-04 16:13:44,220 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:13:44,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:13:44,238 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:13:44,358 INFO L134 CoverageAnalysis]: Checked inductivity of 759 backedges. 0 proven. 407 refuted. 0 times theorem prover too weak. 352 trivial. 0 not checked. [2018-02-04 16:13:44,358 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:13:44,358 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-04 16:13:44,358 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:13:44,358 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2018-02-04 16:13:44,358 INFO L182 omatonBuilderFactory]: Interpolants [5920#(<= main_~i~1 2), 5921#(<= main_~i~1 3), 5922#(<= main_~i~1 4), 5923#(<= main_~i~1 5), 5924#(<= main_~i~1 6), 5925#(<= main_~i~1 7), 5926#(<= main_~i~1 8), 5927#(<= main_~i~1 9), 5928#(<= main_~i~1 10), 5929#(<= main_~i~1 11), 5916#true, 5917#false, 5918#(= main_~i~1 0), 5919#(<= main_~i~1 1)] [2018-02-04 16:13:44,359 INFO L134 CoverageAnalysis]: Checked inductivity of 759 backedges. 0 proven. 407 refuted. 0 times theorem prover too weak. 352 trivial. 0 not checked. [2018-02-04 16:13:44,359 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-04 16:13:44,359 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-04 16:13:44,359 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-02-04 16:13:44,359 INFO L87 Difference]: Start difference. First operand 264 states and 313 transitions. Second operand 14 states. [2018-02-04 16:13:44,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:13:44,483 INFO L93 Difference]: Finished difference Result 362 states and 409 transitions. [2018-02-04 16:13:44,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-04 16:13:44,483 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 168 [2018-02-04 16:13:44,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:13:44,484 INFO L225 Difference]: With dead ends: 362 [2018-02-04 16:13:44,485 INFO L226 Difference]: Without dead ends: 362 [2018-02-04 16:13:44,485 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-02-04 16:13:44,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2018-02-04 16:13:44,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 283. [2018-02-04 16:13:44,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2018-02-04 16:13:44,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 337 transitions. [2018-02-04 16:13:44,491 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 337 transitions. Word has length 168 [2018-02-04 16:13:44,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:13:44,492 INFO L432 AbstractCegarLoop]: Abstraction has 283 states and 337 transitions. [2018-02-04 16:13:44,492 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-04 16:13:44,492 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 337 transitions. [2018-02-04 16:13:44,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2018-02-04 16:13:44,493 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:13:44,493 INFO L351 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:13:44,493 INFO L371 AbstractCegarLoop]: === Iteration 24 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 16:13:44,493 INFO L82 PathProgramCache]: Analyzing trace with hash -801074012, now seen corresponding path program 10 times [2018-02-04 16:13:44,494 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:13:44,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:13:44,508 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:13:44,664 INFO L134 CoverageAnalysis]: Checked inductivity of 906 backedges. 0 proven. 486 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2018-02-04 16:13:44,664 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:13:44,665 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-02-04 16:13:44,665 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:13:44,665 INFO L134 CoverageAnalysis]: Checked inductivity of 243 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 243 trivial. 0 not checked. [2018-02-04 16:13:44,665 INFO L182 omatonBuilderFactory]: Interpolants [6575#true, 6576#false, 6577#(= main_~i~1 0), 6578#(<= main_~i~1 1), 6579#(<= main_~i~1 2), 6580#(<= main_~i~1 3), 6581#(<= main_~i~1 4), 6582#(<= main_~i~1 5), 6583#(<= main_~i~1 6), 6584#(<= main_~i~1 7), 6585#(<= main_~i~1 8), 6586#(<= main_~i~1 9), 6587#(<= main_~i~1 10), 6588#(<= main_~i~1 11), 6589#(<= main_~i~1 12)] [2018-02-04 16:13:44,666 INFO L134 CoverageAnalysis]: Checked inductivity of 906 backedges. 0 proven. 486 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2018-02-04 16:13:44,666 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-04 16:13:44,666 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-04 16:13:44,666 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-02-04 16:13:44,666 INFO L87 Difference]: Start difference. First operand 283 states and 337 transitions. Second operand 15 states. [2018-02-04 16:13:44,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:13:44,830 INFO L93 Difference]: Finished difference Result 386 states and 437 transitions. [2018-02-04 16:13:44,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-04 16:13:44,830 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 181 [2018-02-04 16:13:44,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:13:44,831 INFO L225 Difference]: With dead ends: 386 [2018-02-04 16:13:44,832 INFO L226 Difference]: Without dead ends: 386 [2018-02-04 16:13:44,832 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-02-04 16:13:44,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2018-02-04 16:13:44,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 302. [2018-02-04 16:13:44,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 302 states. [2018-02-04 16:13:44,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 361 transitions. [2018-02-04 16:13:44,838 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 361 transitions. Word has length 181 [2018-02-04 16:13:44,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:13:44,839 INFO L432 AbstractCegarLoop]: Abstraction has 302 states and 361 transitions. [2018-02-04 16:13:44,839 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-04 16:13:44,839 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 361 transitions. [2018-02-04 16:13:44,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2018-02-04 16:13:44,841 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:13:44,841 INFO L351 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:13:44,841 INFO L371 AbstractCegarLoop]: === Iteration 25 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 16:13:44,841 INFO L82 PathProgramCache]: Analyzing trace with hash -429027597, now seen corresponding path program 11 times [2018-02-04 16:13:44,842 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:13:44,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:13:44,860 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:13:45,038 INFO L134 CoverageAnalysis]: Checked inductivity of 1066 backedges. 0 proven. 572 refuted. 0 times theorem prover too weak. 494 trivial. 0 not checked. [2018-02-04 16:13:45,038 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:13:45,039 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-02-04 16:13:45,039 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:13:45,039 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2018-02-04 16:13:45,039 INFO L182 omatonBuilderFactory]: Interpolants [7278#true, 7279#false, 7280#(= main_~i~1 0), 7281#(<= main_~i~1 1), 7282#(<= main_~i~1 2), 7283#(<= main_~i~1 3), 7284#(<= main_~i~1 4), 7285#(<= main_~i~1 5), 7286#(<= main_~i~1 6), 7287#(<= main_~i~1 7), 7288#(<= main_~i~1 8), 7289#(<= main_~i~1 9), 7290#(<= main_~i~1 10), 7291#(<= main_~i~1 11), 7292#(<= main_~i~1 12), 7293#(<= main_~i~1 13)] [2018-02-04 16:13:45,040 INFO L134 CoverageAnalysis]: Checked inductivity of 1066 backedges. 0 proven. 572 refuted. 0 times theorem prover too weak. 494 trivial. 0 not checked. [2018-02-04 16:13:45,040 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-04 16:13:45,040 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-04 16:13:45,041 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-02-04 16:13:45,041 INFO L87 Difference]: Start difference. First operand 302 states and 361 transitions. Second operand 16 states. [2018-02-04 16:13:45,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:13:45,239 INFO L93 Difference]: Finished difference Result 410 states and 465 transitions. [2018-02-04 16:13:45,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-04 16:13:45,239 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 194 [2018-02-04 16:13:45,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:13:45,241 INFO L225 Difference]: With dead ends: 410 [2018-02-04 16:13:45,241 INFO L226 Difference]: Without dead ends: 410 [2018-02-04 16:13:45,242 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-02-04 16:13:45,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2018-02-04 16:13:45,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 321. [2018-02-04 16:13:45,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 321 states. [2018-02-04 16:13:45,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 385 transitions. [2018-02-04 16:13:45,251 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 385 transitions. Word has length 194 [2018-02-04 16:13:45,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:13:45,251 INFO L432 AbstractCegarLoop]: Abstraction has 321 states and 385 transitions. [2018-02-04 16:13:45,251 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-04 16:13:45,252 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 385 transitions. [2018-02-04 16:13:45,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2018-02-04 16:13:45,253 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:13:45,253 INFO L351 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:13:45,254 INFO L371 AbstractCegarLoop]: === Iteration 26 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 16:13:45,254 INFO L82 PathProgramCache]: Analyzing trace with hash -2112353020, now seen corresponding path program 12 times [2018-02-04 16:13:45,255 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:13:45,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:13:45,275 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:13:45,480 INFO L134 CoverageAnalysis]: Checked inductivity of 1239 backedges. 0 proven. 665 refuted. 0 times theorem prover too weak. 574 trivial. 0 not checked. [2018-02-04 16:13:45,480 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:13:45,480 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-02-04 16:13:45,480 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:13:45,481 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 363 trivial. 0 not checked. [2018-02-04 16:13:45,481 INFO L182 omatonBuilderFactory]: Interpolants [8032#(<= main_~i~1 5), 8033#(<= main_~i~1 6), 8034#(<= main_~i~1 7), 8035#(<= main_~i~1 8), 8036#(<= main_~i~1 9), 8037#(<= main_~i~1 10), 8038#(<= main_~i~1 11), 8039#(<= main_~i~1 12), 8040#(<= main_~i~1 13), 8041#(<= main_~i~1 14), 8025#true, 8026#false, 8027#(= main_~i~1 0), 8028#(<= main_~i~1 1), 8029#(<= main_~i~1 2), 8030#(<= main_~i~1 3), 8031#(<= main_~i~1 4)] [2018-02-04 16:13:45,482 INFO L134 CoverageAnalysis]: Checked inductivity of 1239 backedges. 0 proven. 665 refuted. 0 times theorem prover too weak. 574 trivial. 0 not checked. [2018-02-04 16:13:45,482 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-04 16:13:45,482 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-04 16:13:45,482 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-02-04 16:13:45,483 INFO L87 Difference]: Start difference. First operand 321 states and 385 transitions. Second operand 17 states. [2018-02-04 16:13:45,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:13:45,658 INFO L93 Difference]: Finished difference Result 434 states and 493 transitions. [2018-02-04 16:13:45,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-04 16:13:45,658 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 207 [2018-02-04 16:13:45,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:13:45,660 INFO L225 Difference]: With dead ends: 434 [2018-02-04 16:13:45,661 INFO L226 Difference]: Without dead ends: 434 [2018-02-04 16:13:45,661 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-02-04 16:13:45,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2018-02-04 16:13:45,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 340. [2018-02-04 16:13:45,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340 states. [2018-02-04 16:13:45,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 409 transitions. [2018-02-04 16:13:45,670 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 409 transitions. Word has length 207 [2018-02-04 16:13:45,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:13:45,670 INFO L432 AbstractCegarLoop]: Abstraction has 340 states and 409 transitions. [2018-02-04 16:13:45,670 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-04 16:13:45,670 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 409 transitions. [2018-02-04 16:13:45,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2018-02-04 16:13:45,672 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:13:45,672 INFO L351 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:13:45,672 INFO L371 AbstractCegarLoop]: === Iteration 27 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 16:13:45,673 INFO L82 PathProgramCache]: Analyzing trace with hash -744181101, now seen corresponding path program 13 times [2018-02-04 16:13:45,673 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:13:45,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:13:45,693 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:13:45,970 INFO L134 CoverageAnalysis]: Checked inductivity of 1425 backedges. 0 proven. 765 refuted. 0 times theorem prover too weak. 660 trivial. 0 not checked. [2018-02-04 16:13:45,971 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:13:45,971 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-02-04 16:13:45,971 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:13:45,971 INFO L134 CoverageAnalysis]: Checked inductivity of 432 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 432 trivial. 0 not checked. [2018-02-04 16:13:45,972 INFO L182 omatonBuilderFactory]: Interpolants [8832#(<= main_~i~1 14), 8833#(<= main_~i~1 15), 8816#true, 8817#false, 8818#(= main_~i~1 0), 8819#(<= main_~i~1 1), 8820#(<= main_~i~1 2), 8821#(<= main_~i~1 3), 8822#(<= main_~i~1 4), 8823#(<= main_~i~1 5), 8824#(<= main_~i~1 6), 8825#(<= main_~i~1 7), 8826#(<= main_~i~1 8), 8827#(<= main_~i~1 9), 8828#(<= main_~i~1 10), 8829#(<= main_~i~1 11), 8830#(<= main_~i~1 12), 8831#(<= main_~i~1 13)] [2018-02-04 16:13:45,972 INFO L134 CoverageAnalysis]: Checked inductivity of 1425 backedges. 0 proven. 765 refuted. 0 times theorem prover too weak. 660 trivial. 0 not checked. [2018-02-04 16:13:45,972 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-04 16:13:45,973 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-04 16:13:45,973 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-02-04 16:13:45,973 INFO L87 Difference]: Start difference. First operand 340 states and 409 transitions. Second operand 18 states. [2018-02-04 16:13:46,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:13:46,166 INFO L93 Difference]: Finished difference Result 458 states and 521 transitions. [2018-02-04 16:13:46,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-04 16:13:46,166 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 220 [2018-02-04 16:13:46,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:13:46,169 INFO L225 Difference]: With dead ends: 458 [2018-02-04 16:13:46,169 INFO L226 Difference]: Without dead ends: 458 [2018-02-04 16:13:46,169 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-02-04 16:13:46,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2018-02-04 16:13:46,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 359. [2018-02-04 16:13:46,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 359 states. [2018-02-04 16:13:46,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 433 transitions. [2018-02-04 16:13:46,177 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 433 transitions. Word has length 220 [2018-02-04 16:13:46,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:13:46,177 INFO L432 AbstractCegarLoop]: Abstraction has 359 states and 433 transitions. [2018-02-04 16:13:46,177 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-04 16:13:46,178 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 433 transitions. [2018-02-04 16:13:46,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2018-02-04 16:13:46,179 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:13:46,180 INFO L351 BasicCegarLoop]: trace histogram [17, 17, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:13:46,180 INFO L371 AbstractCegarLoop]: === Iteration 28 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 16:13:46,180 INFO L82 PathProgramCache]: Analyzing trace with hash -2089824924, now seen corresponding path program 14 times [2018-02-04 16:13:46,180 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:13:46,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:13:46,201 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:13:46,470 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 872 refuted. 0 times theorem prover too weak. 752 trivial. 0 not checked. [2018-02-04 16:13:46,470 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:13:46,470 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-02-04 16:13:46,471 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:13:46,471 INFO L134 CoverageAnalysis]: Checked inductivity of 507 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 507 trivial. 0 not checked. [2018-02-04 16:13:46,471 INFO L182 omatonBuilderFactory]: Interpolants [9664#(<= main_~i~1 11), 9665#(<= main_~i~1 12), 9666#(<= main_~i~1 13), 9667#(<= main_~i~1 14), 9668#(<= main_~i~1 15), 9669#(<= main_~i~1 16), 9651#true, 9652#false, 9653#(= main_~i~1 0), 9654#(<= main_~i~1 1), 9655#(<= main_~i~1 2), 9656#(<= main_~i~1 3), 9657#(<= main_~i~1 4), 9658#(<= main_~i~1 5), 9659#(<= main_~i~1 6), 9660#(<= main_~i~1 7), 9661#(<= main_~i~1 8), 9662#(<= main_~i~1 9), 9663#(<= main_~i~1 10)] [2018-02-04 16:13:46,472 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 872 refuted. 0 times theorem prover too weak. 752 trivial. 0 not checked. [2018-02-04 16:13:46,472 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-04 16:13:46,473 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-04 16:13:46,473 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-02-04 16:13:46,473 INFO L87 Difference]: Start difference. First operand 359 states and 433 transitions. Second operand 19 states. [2018-02-04 16:13:46,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:13:46,726 INFO L93 Difference]: Finished difference Result 482 states and 549 transitions. [2018-02-04 16:13:46,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-04 16:13:46,726 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 233 [2018-02-04 16:13:46,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:13:46,728 INFO L225 Difference]: With dead ends: 482 [2018-02-04 16:13:46,728 INFO L226 Difference]: Without dead ends: 482 [2018-02-04 16:13:46,729 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-02-04 16:13:46,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2018-02-04 16:13:46,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 378. [2018-02-04 16:13:46,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378 states. [2018-02-04 16:13:46,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 457 transitions. [2018-02-04 16:13:46,734 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 457 transitions. Word has length 233 [2018-02-04 16:13:46,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:13:46,734 INFO L432 AbstractCegarLoop]: Abstraction has 378 states and 457 transitions. [2018-02-04 16:13:46,734 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-04 16:13:46,734 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 457 transitions. [2018-02-04 16:13:46,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2018-02-04 16:13:46,735 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:13:46,735 INFO L351 BasicCegarLoop]: trace histogram [18, 18, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:13:46,736 INFO L371 AbstractCegarLoop]: === Iteration 29 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 16:13:46,736 INFO L82 PathProgramCache]: Analyzing trace with hash 34639411, now seen corresponding path program 15 times [2018-02-04 16:13:46,736 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:13:46,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:13:46,749 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:13:47,006 INFO L134 CoverageAnalysis]: Checked inductivity of 1836 backedges. 0 proven. 986 refuted. 0 times theorem prover too weak. 850 trivial. 0 not checked. [2018-02-04 16:13:47,006 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:13:47,006 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-02-04 16:13:47,006 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:13:47,007 INFO L134 CoverageAnalysis]: Checked inductivity of 588 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 588 trivial. 0 not checked. [2018-02-04 16:13:47,007 INFO L182 omatonBuilderFactory]: Interpolants [10530#true, 10531#false, 10532#(= main_~i~1 0), 10533#(<= main_~i~1 1), 10534#(<= main_~i~1 2), 10535#(<= main_~i~1 3), 10536#(<= main_~i~1 4), 10537#(<= main_~i~1 5), 10538#(<= main_~i~1 6), 10539#(<= main_~i~1 7), 10540#(<= main_~i~1 8), 10541#(<= main_~i~1 9), 10542#(<= main_~i~1 10), 10543#(<= main_~i~1 11), 10544#(<= main_~i~1 12), 10545#(<= main_~i~1 13), 10546#(<= main_~i~1 14), 10547#(<= main_~i~1 15), 10548#(<= main_~i~1 16), 10549#(<= main_~i~1 17)] [2018-02-04 16:13:47,008 INFO L134 CoverageAnalysis]: Checked inductivity of 1836 backedges. 0 proven. 986 refuted. 0 times theorem prover too weak. 850 trivial. 0 not checked. [2018-02-04 16:13:47,008 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-04 16:13:47,008 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-04 16:13:47,009 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-02-04 16:13:47,009 INFO L87 Difference]: Start difference. First operand 378 states and 457 transitions. Second operand 20 states. [2018-02-04 16:13:47,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:13:47,291 INFO L93 Difference]: Finished difference Result 506 states and 577 transitions. [2018-02-04 16:13:47,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-02-04 16:13:47,292 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 246 [2018-02-04 16:13:47,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:13:47,293 INFO L225 Difference]: With dead ends: 506 [2018-02-04 16:13:47,293 INFO L226 Difference]: Without dead ends: 506 [2018-02-04 16:13:47,293 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-02-04 16:13:47,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 506 states. [2018-02-04 16:13:47,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 506 to 397. [2018-02-04 16:13:47,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2018-02-04 16:13:47,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 481 transitions. [2018-02-04 16:13:47,299 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 481 transitions. Word has length 246 [2018-02-04 16:13:47,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:13:47,299 INFO L432 AbstractCegarLoop]: Abstraction has 397 states and 481 transitions. [2018-02-04 16:13:47,299 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-04 16:13:47,299 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 481 transitions. [2018-02-04 16:13:47,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2018-02-04 16:13:47,300 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:13:47,301 INFO L351 BasicCegarLoop]: trace histogram [19, 19, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:13:47,301 INFO L371 AbstractCegarLoop]: === Iteration 30 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 16:13:47,301 INFO L82 PathProgramCache]: Analyzing trace with hash 1090377156, now seen corresponding path program 16 times [2018-02-04 16:13:47,301 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:13:47,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:13:47,316 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:13:47,556 INFO L134 CoverageAnalysis]: Checked inductivity of 2061 backedges. 0 proven. 1107 refuted. 0 times theorem prover too weak. 954 trivial. 0 not checked. [2018-02-04 16:13:47,556 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:13:47,556 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-02-04 16:13:47,556 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:13:47,557 INFO L134 CoverageAnalysis]: Checked inductivity of 675 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 675 trivial. 0 not checked. [2018-02-04 16:13:47,557 INFO L182 omatonBuilderFactory]: Interpolants [11456#(<= main_~i~1 1), 11457#(<= main_~i~1 2), 11458#(<= main_~i~1 3), 11459#(<= main_~i~1 4), 11460#(<= main_~i~1 5), 11461#(<= main_~i~1 6), 11462#(<= main_~i~1 7), 11463#(<= main_~i~1 8), 11464#(<= main_~i~1 9), 11465#(<= main_~i~1 10), 11466#(<= main_~i~1 11), 11467#(<= main_~i~1 12), 11468#(<= main_~i~1 13), 11469#(<= main_~i~1 14), 11470#(<= main_~i~1 15), 11471#(<= main_~i~1 16), 11472#(<= main_~i~1 17), 11473#(<= main_~i~1 18), 11453#true, 11454#false, 11455#(= main_~i~1 0)] [2018-02-04 16:13:47,558 INFO L134 CoverageAnalysis]: Checked inductivity of 2061 backedges. 0 proven. 1107 refuted. 0 times theorem prover too weak. 954 trivial. 0 not checked. [2018-02-04 16:13:47,558 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-04 16:13:47,558 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-04 16:13:47,558 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-02-04 16:13:47,558 INFO L87 Difference]: Start difference. First operand 397 states and 481 transitions. Second operand 21 states. [2018-02-04 16:13:47,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:13:47,720 INFO L93 Difference]: Finished difference Result 530 states and 605 transitions. [2018-02-04 16:13:47,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-04 16:13:47,720 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 259 [2018-02-04 16:13:47,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:13:47,722 INFO L225 Difference]: With dead ends: 530 [2018-02-04 16:13:47,722 INFO L226 Difference]: Without dead ends: 530 [2018-02-04 16:13:47,723 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-02-04 16:13:47,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2018-02-04 16:13:47,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 416. [2018-02-04 16:13:47,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 416 states. [2018-02-04 16:13:47,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 505 transitions. [2018-02-04 16:13:47,731 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 505 transitions. Word has length 259 [2018-02-04 16:13:47,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:13:47,732 INFO L432 AbstractCegarLoop]: Abstraction has 416 states and 505 transitions. [2018-02-04 16:13:47,732 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-04 16:13:47,732 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 505 transitions. [2018-02-04 16:13:47,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2018-02-04 16:13:47,734 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:13:47,734 INFO L351 BasicCegarLoop]: trace histogram [20, 20, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:13:47,734 INFO L371 AbstractCegarLoop]: === Iteration 31 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 16:13:47,735 INFO L82 PathProgramCache]: Analyzing trace with hash -591715885, now seen corresponding path program 17 times [2018-02-04 16:13:47,735 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:13:47,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:13:47,759 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:13:48,085 INFO L134 CoverageAnalysis]: Checked inductivity of 2299 backedges. 0 proven. 1235 refuted. 0 times theorem prover too weak. 1064 trivial. 0 not checked. [2018-02-04 16:13:48,085 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:13:48,085 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-02-04 16:13:48,085 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:13:48,086 INFO L134 CoverageAnalysis]: Checked inductivity of 768 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 768 trivial. 0 not checked. [2018-02-04 16:13:48,086 INFO L182 omatonBuilderFactory]: Interpolants [12420#true, 12421#false, 12422#(= main_~i~1 0), 12423#(<= main_~i~1 1), 12424#(<= main_~i~1 2), 12425#(<= main_~i~1 3), 12426#(<= main_~i~1 4), 12427#(<= main_~i~1 5), 12428#(<= main_~i~1 6), 12429#(<= main_~i~1 7), 12430#(<= main_~i~1 8), 12431#(<= main_~i~1 9), 12432#(<= main_~i~1 10), 12433#(<= main_~i~1 11), 12434#(<= main_~i~1 12), 12435#(<= main_~i~1 13), 12436#(<= main_~i~1 14), 12437#(<= main_~i~1 15), 12438#(<= main_~i~1 16), 12439#(<= main_~i~1 17), 12440#(<= main_~i~1 18), 12441#(<= main_~i~1 19)] [2018-02-04 16:13:48,087 INFO L134 CoverageAnalysis]: Checked inductivity of 2299 backedges. 0 proven. 1235 refuted. 0 times theorem prover too weak. 1064 trivial. 0 not checked. [2018-02-04 16:13:48,087 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-04 16:13:48,087 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-04 16:13:48,087 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-02-04 16:13:48,088 INFO L87 Difference]: Start difference. First operand 416 states and 505 transitions. Second operand 22 states. [2018-02-04 16:13:48,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:13:48,336 INFO L93 Difference]: Finished difference Result 554 states and 633 transitions. [2018-02-04 16:13:48,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-04 16:13:48,336 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 272 [2018-02-04 16:13:48,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:13:48,338 INFO L225 Difference]: With dead ends: 554 [2018-02-04 16:13:48,338 INFO L226 Difference]: Without dead ends: 554 [2018-02-04 16:13:48,338 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-02-04 16:13:48,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2018-02-04 16:13:48,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 435. [2018-02-04 16:13:48,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 435 states. [2018-02-04 16:13:48,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 435 states and 529 transitions. [2018-02-04 16:13:48,343 INFO L78 Accepts]: Start accepts. Automaton has 435 states and 529 transitions. Word has length 272 [2018-02-04 16:13:48,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:13:48,344 INFO L432 AbstractCegarLoop]: Abstraction has 435 states and 529 transitions. [2018-02-04 16:13:48,344 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-04 16:13:48,344 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 529 transitions. [2018-02-04 16:13:48,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 286 [2018-02-04 16:13:48,345 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:13:48,346 INFO L351 BasicCegarLoop]: trace histogram [21, 21, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:13:48,346 INFO L371 AbstractCegarLoop]: === Iteration 32 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 16:13:48,346 INFO L82 PathProgramCache]: Analyzing trace with hash 267920932, now seen corresponding path program 18 times [2018-02-04 16:13:48,346 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:13:48,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:13:48,362 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:13:48,694 INFO L134 CoverageAnalysis]: Checked inductivity of 2550 backedges. 0 proven. 1370 refuted. 0 times theorem prover too weak. 1180 trivial. 0 not checked. [2018-02-04 16:13:48,710 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:13:48,711 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-02-04 16:13:48,711 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:13:48,711 INFO L134 CoverageAnalysis]: Checked inductivity of 867 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 867 trivial. 0 not checked. [2018-02-04 16:13:48,712 INFO L182 omatonBuilderFactory]: Interpolants [13440#(<= main_~i~1 7), 13441#(<= main_~i~1 8), 13442#(<= main_~i~1 9), 13443#(<= main_~i~1 10), 13444#(<= main_~i~1 11), 13445#(<= main_~i~1 12), 13446#(<= main_~i~1 13), 13447#(<= main_~i~1 14), 13448#(<= main_~i~1 15), 13449#(<= main_~i~1 16), 13450#(<= main_~i~1 17), 13451#(<= main_~i~1 18), 13452#(<= main_~i~1 19), 13453#(<= main_~i~1 20), 13431#true, 13432#false, 13433#(= main_~i~1 0), 13434#(<= main_~i~1 1), 13435#(<= main_~i~1 2), 13436#(<= main_~i~1 3), 13437#(<= main_~i~1 4), 13438#(<= main_~i~1 5), 13439#(<= main_~i~1 6)] [2018-02-04 16:13:48,712 INFO L134 CoverageAnalysis]: Checked inductivity of 2550 backedges. 0 proven. 1370 refuted. 0 times theorem prover too weak. 1180 trivial. 0 not checked. [2018-02-04 16:13:48,713 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-04 16:13:48,713 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-04 16:13:48,713 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-02-04 16:13:48,713 INFO L87 Difference]: Start difference. First operand 435 states and 529 transitions. Second operand 23 states. [2018-02-04 16:13:48,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:13:48,900 INFO L93 Difference]: Finished difference Result 578 states and 661 transitions. [2018-02-04 16:13:48,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-04 16:13:48,901 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 285 [2018-02-04 16:13:48,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:13:48,902 INFO L225 Difference]: With dead ends: 578 [2018-02-04 16:13:48,902 INFO L226 Difference]: Without dead ends: 578 [2018-02-04 16:13:48,903 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-02-04 16:13:48,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2018-02-04 16:13:48,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 454. [2018-02-04 16:13:48,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 454 states. [2018-02-04 16:13:48,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 454 states to 454 states and 553 transitions. [2018-02-04 16:13:48,908 INFO L78 Accepts]: Start accepts. Automaton has 454 states and 553 transitions. Word has length 285 [2018-02-04 16:13:48,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:13:48,909 INFO L432 AbstractCegarLoop]: Abstraction has 454 states and 553 transitions. [2018-02-04 16:13:48,909 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-04 16:13:48,909 INFO L276 IsEmpty]: Start isEmpty. Operand 454 states and 553 transitions. [2018-02-04 16:13:48,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2018-02-04 16:13:48,910 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:13:48,910 INFO L351 BasicCegarLoop]: trace histogram [22, 22, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:13:48,910 INFO L371 AbstractCegarLoop]: === Iteration 33 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 16:13:48,910 INFO L82 PathProgramCache]: Analyzing trace with hash -1238471309, now seen corresponding path program 19 times [2018-02-04 16:13:48,911 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:13:48,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:13:48,932 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:13:49,343 INFO L134 CoverageAnalysis]: Checked inductivity of 2814 backedges. 0 proven. 1512 refuted. 0 times theorem prover too weak. 1302 trivial. 0 not checked. [2018-02-04 16:13:49,343 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:13:49,343 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-02-04 16:13:49,343 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:13:49,344 INFO L134 CoverageAnalysis]: Checked inductivity of 972 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 972 trivial. 0 not checked. [2018-02-04 16:13:49,344 INFO L182 omatonBuilderFactory]: Interpolants [14496#(<= main_~i~1 8), 14497#(<= main_~i~1 9), 14498#(<= main_~i~1 10), 14499#(<= main_~i~1 11), 14500#(<= main_~i~1 12), 14501#(<= main_~i~1 13), 14502#(<= main_~i~1 14), 14503#(<= main_~i~1 15), 14504#(<= main_~i~1 16), 14505#(<= main_~i~1 17), 14506#(<= main_~i~1 18), 14507#(<= main_~i~1 19), 14508#(<= main_~i~1 20), 14509#(<= main_~i~1 21), 14486#true, 14487#false, 14488#(= main_~i~1 0), 14489#(<= main_~i~1 1), 14490#(<= main_~i~1 2), 14491#(<= main_~i~1 3), 14492#(<= main_~i~1 4), 14493#(<= main_~i~1 5), 14494#(<= main_~i~1 6), 14495#(<= main_~i~1 7)] [2018-02-04 16:13:49,345 INFO L134 CoverageAnalysis]: Checked inductivity of 2814 backedges. 0 proven. 1512 refuted. 0 times theorem prover too weak. 1302 trivial. 0 not checked. [2018-02-04 16:13:49,346 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-02-04 16:13:49,346 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-02-04 16:13:49,346 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-02-04 16:13:49,346 INFO L87 Difference]: Start difference. First operand 454 states and 553 transitions. Second operand 24 states. [2018-02-04 16:13:49,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:13:49,605 INFO L93 Difference]: Finished difference Result 602 states and 689 transitions. [2018-02-04 16:13:49,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-02-04 16:13:49,605 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 298 [2018-02-04 16:13:49,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:13:49,607 INFO L225 Difference]: With dead ends: 602 [2018-02-04 16:13:49,607 INFO L226 Difference]: Without dead ends: 602 [2018-02-04 16:13:49,608 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-02-04 16:13:49,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2018-02-04 16:13:49,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 473. [2018-02-04 16:13:49,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 473 states. [2018-02-04 16:13:49,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 473 states to 473 states and 577 transitions. [2018-02-04 16:13:49,617 INFO L78 Accepts]: Start accepts. Automaton has 473 states and 577 transitions. Word has length 298 [2018-02-04 16:13:49,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:13:49,618 INFO L432 AbstractCegarLoop]: Abstraction has 473 states and 577 transitions. [2018-02-04 16:13:49,618 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-02-04 16:13:49,618 INFO L276 IsEmpty]: Start isEmpty. Operand 473 states and 577 transitions. [2018-02-04 16:13:49,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 312 [2018-02-04 16:13:49,621 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:13:49,622 INFO L351 BasicCegarLoop]: trace histogram [23, 23, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:13:49,622 INFO L371 AbstractCegarLoop]: === Iteration 34 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 16:13:49,622 INFO L82 PathProgramCache]: Analyzing trace with hash -1911243132, now seen corresponding path program 20 times [2018-02-04 16:13:49,622 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:13:49,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:13:49,645 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:13:50,080 INFO L134 CoverageAnalysis]: Checked inductivity of 3091 backedges. 0 proven. 1661 refuted. 0 times theorem prover too weak. 1430 trivial. 0 not checked. [2018-02-04 16:13:50,080 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:13:50,080 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-02-04 16:13:50,080 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:13:50,081 INFO L134 CoverageAnalysis]: Checked inductivity of 1083 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1083 trivial. 0 not checked. [2018-02-04 16:13:50,081 INFO L182 omatonBuilderFactory]: Interpolants [15585#true, 15586#false, 15587#(= main_~i~1 0), 15588#(<= main_~i~1 1), 15589#(<= main_~i~1 2), 15590#(<= main_~i~1 3), 15591#(<= main_~i~1 4), 15592#(<= main_~i~1 5), 15593#(<= main_~i~1 6), 15594#(<= main_~i~1 7), 15595#(<= main_~i~1 8), 15596#(<= main_~i~1 9), 15597#(<= main_~i~1 10), 15598#(<= main_~i~1 11), 15599#(<= main_~i~1 12), 15600#(<= main_~i~1 13), 15601#(<= main_~i~1 14), 15602#(<= main_~i~1 15), 15603#(<= main_~i~1 16), 15604#(<= main_~i~1 17), 15605#(<= main_~i~1 18), 15606#(<= main_~i~1 19), 15607#(<= main_~i~1 20), 15608#(<= main_~i~1 21), 15609#(<= main_~i~1 22)] [2018-02-04 16:13:50,081 INFO L134 CoverageAnalysis]: Checked inductivity of 3091 backedges. 0 proven. 1661 refuted. 0 times theorem prover too weak. 1430 trivial. 0 not checked. [2018-02-04 16:13:50,081 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-02-04 16:13:50,082 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-02-04 16:13:50,082 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2018-02-04 16:13:50,082 INFO L87 Difference]: Start difference. First operand 473 states and 577 transitions. Second operand 25 states. [2018-02-04 16:13:50,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:13:50,295 INFO L93 Difference]: Finished difference Result 626 states and 717 transitions. [2018-02-04 16:13:50,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-04 16:13:50,295 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 311 [2018-02-04 16:13:50,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:13:50,297 INFO L225 Difference]: With dead ends: 626 [2018-02-04 16:13:50,297 INFO L226 Difference]: Without dead ends: 626 [2018-02-04 16:13:50,298 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2018-02-04 16:13:50,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states. [2018-02-04 16:13:50,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 492. [2018-02-04 16:13:50,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 492 states. [2018-02-04 16:13:50,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 492 states to 492 states and 601 transitions. [2018-02-04 16:13:50,304 INFO L78 Accepts]: Start accepts. Automaton has 492 states and 601 transitions. Word has length 311 [2018-02-04 16:13:50,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:13:50,304 INFO L432 AbstractCegarLoop]: Abstraction has 492 states and 601 transitions. [2018-02-04 16:13:50,304 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-02-04 16:13:50,305 INFO L276 IsEmpty]: Start isEmpty. Operand 492 states and 601 transitions. [2018-02-04 16:13:50,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2018-02-04 16:13:50,306 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:13:50,306 INFO L351 BasicCegarLoop]: trace histogram [24, 24, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:13:50,306 INFO L371 AbstractCegarLoop]: === Iteration 35 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 16:13:50,307 INFO L82 PathProgramCache]: Analyzing trace with hash 1752461587, now seen corresponding path program 21 times [2018-02-04 16:13:50,307 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:13:50,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:13:50,324 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:13:50,752 INFO L134 CoverageAnalysis]: Checked inductivity of 3381 backedges. 0 proven. 1817 refuted. 0 times theorem prover too weak. 1564 trivial. 0 not checked. [2018-02-04 16:13:50,752 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:13:50,753 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-02-04 16:13:50,753 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:13:50,754 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2018-02-04 16:13:50,754 INFO L182 omatonBuilderFactory]: Interpolants [16728#true, 16729#false, 16730#(= main_~i~1 0), 16731#(<= main_~i~1 1), 16732#(<= main_~i~1 2), 16733#(<= main_~i~1 3), 16734#(<= main_~i~1 4), 16735#(<= main_~i~1 5), 16736#(<= main_~i~1 6), 16737#(<= main_~i~1 7), 16738#(<= main_~i~1 8), 16739#(<= main_~i~1 9), 16740#(<= main_~i~1 10), 16741#(<= main_~i~1 11), 16742#(<= main_~i~1 12), 16743#(<= main_~i~1 13), 16744#(<= main_~i~1 14), 16745#(<= main_~i~1 15), 16746#(<= main_~i~1 16), 16747#(<= main_~i~1 17), 16748#(<= main_~i~1 18), 16749#(<= main_~i~1 19), 16750#(<= main_~i~1 20), 16751#(<= main_~i~1 21), 16752#(<= main_~i~1 22), 16753#(<= main_~i~1 23)] [2018-02-04 16:13:50,755 INFO L134 CoverageAnalysis]: Checked inductivity of 3381 backedges. 0 proven. 1817 refuted. 0 times theorem prover too weak. 1564 trivial. 0 not checked. [2018-02-04 16:13:50,755 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-02-04 16:13:50,755 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-02-04 16:13:50,756 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-02-04 16:13:50,756 INFO L87 Difference]: Start difference. First operand 492 states and 601 transitions. Second operand 26 states. [2018-02-04 16:13:51,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:13:51,012 INFO L93 Difference]: Finished difference Result 650 states and 745 transitions. [2018-02-04 16:13:51,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-02-04 16:13:51,013 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 324 [2018-02-04 16:13:51,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:13:51,014 INFO L225 Difference]: With dead ends: 650 [2018-02-04 16:13:51,014 INFO L226 Difference]: Without dead ends: 650 [2018-02-04 16:13:51,015 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-02-04 16:13:51,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 650 states. [2018-02-04 16:13:51,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 650 to 511. [2018-02-04 16:13:51,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 511 states. [2018-02-04 16:13:51,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 511 states to 511 states and 625 transitions. [2018-02-04 16:13:51,027 INFO L78 Accepts]: Start accepts. Automaton has 511 states and 625 transitions. Word has length 324 [2018-02-04 16:13:51,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:13:51,028 INFO L432 AbstractCegarLoop]: Abstraction has 511 states and 625 transitions. [2018-02-04 16:13:51,028 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-02-04 16:13:51,028 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states and 625 transitions. [2018-02-04 16:13:51,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 338 [2018-02-04 16:13:51,029 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:13:51,029 INFO L351 BasicCegarLoop]: trace histogram [25, 25, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:13:51,030 INFO L371 AbstractCegarLoop]: === Iteration 36 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 16:13:51,030 INFO L82 PathProgramCache]: Analyzing trace with hash 25796324, now seen corresponding path program 22 times [2018-02-04 16:13:51,030 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:13:51,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:13:51,048 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:13:51,454 INFO L134 CoverageAnalysis]: Checked inductivity of 3684 backedges. 0 proven. 1980 refuted. 0 times theorem prover too weak. 1704 trivial. 0 not checked. [2018-02-04 16:13:51,454 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:13:51,455 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-02-04 16:13:51,455 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:13:51,455 INFO L134 CoverageAnalysis]: Checked inductivity of 1323 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1323 trivial. 0 not checked. [2018-02-04 16:13:51,455 INFO L182 omatonBuilderFactory]: Interpolants [17920#(<= main_~i~1 3), 17921#(<= main_~i~1 4), 17922#(<= main_~i~1 5), 17923#(<= main_~i~1 6), 17924#(<= main_~i~1 7), 17925#(<= main_~i~1 8), 17926#(<= main_~i~1 9), 17927#(<= main_~i~1 10), 17928#(<= main_~i~1 11), 17929#(<= main_~i~1 12), 17930#(<= main_~i~1 13), 17931#(<= main_~i~1 14), 17932#(<= main_~i~1 15), 17933#(<= main_~i~1 16), 17934#(<= main_~i~1 17), 17935#(<= main_~i~1 18), 17936#(<= main_~i~1 19), 17937#(<= main_~i~1 20), 17938#(<= main_~i~1 21), 17939#(<= main_~i~1 22), 17940#(<= main_~i~1 23), 17941#(<= main_~i~1 24), 17915#true, 17916#false, 17917#(= main_~i~1 0), 17918#(<= main_~i~1 1), 17919#(<= main_~i~1 2)] [2018-02-04 16:13:51,455 INFO L134 CoverageAnalysis]: Checked inductivity of 3684 backedges. 0 proven. 1980 refuted. 0 times theorem prover too weak. 1704 trivial. 0 not checked. [2018-02-04 16:13:51,456 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-02-04 16:13:51,456 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-02-04 16:13:51,456 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2018-02-04 16:13:51,456 INFO L87 Difference]: Start difference. First operand 511 states and 625 transitions. Second operand 27 states. [2018-02-04 16:13:51,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:13:51,679 INFO L93 Difference]: Finished difference Result 674 states and 773 transitions. [2018-02-04 16:13:51,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-02-04 16:13:51,679 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 337 [2018-02-04 16:13:51,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:13:51,681 INFO L225 Difference]: With dead ends: 674 [2018-02-04 16:13:51,681 INFO L226 Difference]: Without dead ends: 674 [2018-02-04 16:13:51,681 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2018-02-04 16:13:51,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 674 states. [2018-02-04 16:13:51,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 674 to 530. [2018-02-04 16:13:51,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 530 states. [2018-02-04 16:13:51,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 530 states to 530 states and 649 transitions. [2018-02-04 16:13:51,691 INFO L78 Accepts]: Start accepts. Automaton has 530 states and 649 transitions. Word has length 337 [2018-02-04 16:13:51,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:13:51,692 INFO L432 AbstractCegarLoop]: Abstraction has 530 states and 649 transitions. [2018-02-04 16:13:51,692 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-02-04 16:13:51,692 INFO L276 IsEmpty]: Start isEmpty. Operand 530 states and 649 transitions. [2018-02-04 16:13:51,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 351 [2018-02-04 16:13:51,695 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:13:51,695 INFO L351 BasicCegarLoop]: trace histogram [26, 26, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:13:51,695 INFO L371 AbstractCegarLoop]: === Iteration 37 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 16:13:51,696 INFO L82 PathProgramCache]: Analyzing trace with hash -183030605, now seen corresponding path program 23 times [2018-02-04 16:13:51,696 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:13:51,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:13:51,723 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:13:52,184 INFO L134 CoverageAnalysis]: Checked inductivity of 4000 backedges. 0 proven. 2150 refuted. 0 times theorem prover too weak. 1850 trivial. 0 not checked. [2018-02-04 16:13:52,184 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:13:52,184 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-02-04 16:13:52,184 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:13:52,184 INFO L134 CoverageAnalysis]: Checked inductivity of 1452 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1452 trivial. 0 not checked. [2018-02-04 16:13:52,184 INFO L182 omatonBuilderFactory]: Interpolants [19146#true, 19147#false, 19148#(= main_~i~1 0), 19149#(<= main_~i~1 1), 19150#(<= main_~i~1 2), 19151#(<= main_~i~1 3), 19152#(<= main_~i~1 4), 19153#(<= main_~i~1 5), 19154#(<= main_~i~1 6), 19155#(<= main_~i~1 7), 19156#(<= main_~i~1 8), 19157#(<= main_~i~1 9), 19158#(<= main_~i~1 10), 19159#(<= main_~i~1 11), 19160#(<= main_~i~1 12), 19161#(<= main_~i~1 13), 19162#(<= main_~i~1 14), 19163#(<= main_~i~1 15), 19164#(<= main_~i~1 16), 19165#(<= main_~i~1 17), 19166#(<= main_~i~1 18), 19167#(<= main_~i~1 19), 19168#(<= main_~i~1 20), 19169#(<= main_~i~1 21), 19170#(<= main_~i~1 22), 19171#(<= main_~i~1 23), 19172#(<= main_~i~1 24), 19173#(<= main_~i~1 25)] [2018-02-04 16:13:52,185 INFO L134 CoverageAnalysis]: Checked inductivity of 4000 backedges. 0 proven. 2150 refuted. 0 times theorem prover too weak. 1850 trivial. 0 not checked. [2018-02-04 16:13:52,185 INFO L409 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-02-04 16:13:52,185 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-02-04 16:13:52,185 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-02-04 16:13:52,185 INFO L87 Difference]: Start difference. First operand 530 states and 649 transitions. Second operand 28 states. [2018-02-04 16:13:52,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:13:52,489 INFO L93 Difference]: Finished difference Result 698 states and 801 transitions. [2018-02-04 16:13:52,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-02-04 16:13:52,489 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 350 [2018-02-04 16:13:52,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:13:52,491 INFO L225 Difference]: With dead ends: 698 [2018-02-04 16:13:52,491 INFO L226 Difference]: Without dead ends: 698 [2018-02-04 16:13:52,492 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-02-04 16:13:52,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 698 states. [2018-02-04 16:13:52,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 698 to 549. [2018-02-04 16:13:52,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 549 states. [2018-02-04 16:13:52,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 549 states to 549 states and 673 transitions. [2018-02-04 16:13:52,498 INFO L78 Accepts]: Start accepts. Automaton has 549 states and 673 transitions. Word has length 350 [2018-02-04 16:13:52,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:13:52,498 INFO L432 AbstractCegarLoop]: Abstraction has 549 states and 673 transitions. [2018-02-04 16:13:52,498 INFO L433 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-02-04 16:13:52,498 INFO L276 IsEmpty]: Start isEmpty. Operand 549 states and 673 transitions. [2018-02-04 16:13:52,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 364 [2018-02-04 16:13:52,500 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:13:52,500 INFO L351 BasicCegarLoop]: trace histogram [27, 27, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:13:52,500 INFO L371 AbstractCegarLoop]: === Iteration 38 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 16:13:52,500 INFO L82 PathProgramCache]: Analyzing trace with hash -1190344892, now seen corresponding path program 24 times [2018-02-04 16:13:52,501 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:13:52,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:13:52,518 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:13:52,984 INFO L134 CoverageAnalysis]: Checked inductivity of 4329 backedges. 0 proven. 2327 refuted. 0 times theorem prover too weak. 2002 trivial. 0 not checked. [2018-02-04 16:13:52,985 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:13:52,985 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-02-04 16:13:52,985 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:13:52,985 INFO L134 CoverageAnalysis]: Checked inductivity of 1587 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1587 trivial. 0 not checked. [2018-02-04 16:13:52,985 INFO L182 omatonBuilderFactory]: Interpolants [20421#true, 20422#false, 20423#(= main_~i~1 0), 20424#(<= main_~i~1 1), 20425#(<= main_~i~1 2), 20426#(<= main_~i~1 3), 20427#(<= main_~i~1 4), 20428#(<= main_~i~1 5), 20429#(<= main_~i~1 6), 20430#(<= main_~i~1 7), 20431#(<= main_~i~1 8), 20432#(<= main_~i~1 9), 20433#(<= main_~i~1 10), 20434#(<= main_~i~1 11), 20435#(<= main_~i~1 12), 20436#(<= main_~i~1 13), 20437#(<= main_~i~1 14), 20438#(<= main_~i~1 15), 20439#(<= main_~i~1 16), 20440#(<= main_~i~1 17), 20441#(<= main_~i~1 18), 20442#(<= main_~i~1 19), 20443#(<= main_~i~1 20), 20444#(<= main_~i~1 21), 20445#(<= main_~i~1 22), 20446#(<= main_~i~1 23), 20447#(<= main_~i~1 24), 20448#(<= main_~i~1 25), 20449#(<= main_~i~1 26)] [2018-02-04 16:13:52,986 INFO L134 CoverageAnalysis]: Checked inductivity of 4329 backedges. 0 proven. 2327 refuted. 0 times theorem prover too weak. 2002 trivial. 0 not checked. [2018-02-04 16:13:52,986 INFO L409 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-02-04 16:13:52,986 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-02-04 16:13:52,987 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2018-02-04 16:13:52,987 INFO L87 Difference]: Start difference. First operand 549 states and 673 transitions. Second operand 29 states. [2018-02-04 16:13:53,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:13:53,399 INFO L93 Difference]: Finished difference Result 722 states and 829 transitions. [2018-02-04 16:13:53,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-02-04 16:13:53,399 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 363 [2018-02-04 16:13:53,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:13:53,401 INFO L225 Difference]: With dead ends: 722 [2018-02-04 16:13:53,401 INFO L226 Difference]: Without dead ends: 722 [2018-02-04 16:13:53,401 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2018-02-04 16:13:53,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 722 states. [2018-02-04 16:13:53,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 722 to 568. [2018-02-04 16:13:53,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 568 states. [2018-02-04 16:13:53,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 568 states to 568 states and 697 transitions. [2018-02-04 16:13:53,411 INFO L78 Accepts]: Start accepts. Automaton has 568 states and 697 transitions. Word has length 363 [2018-02-04 16:13:53,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:13:53,412 INFO L432 AbstractCegarLoop]: Abstraction has 568 states and 697 transitions. [2018-02-04 16:13:53,412 INFO L433 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-02-04 16:13:53,412 INFO L276 IsEmpty]: Start isEmpty. Operand 568 states and 697 transitions. [2018-02-04 16:13:53,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 377 [2018-02-04 16:13:53,415 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:13:53,415 INFO L351 BasicCegarLoop]: trace histogram [28, 28, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:13:53,415 INFO L371 AbstractCegarLoop]: === Iteration 39 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 16:13:53,415 INFO L82 PathProgramCache]: Analyzing trace with hash 622895187, now seen corresponding path program 25 times [2018-02-04 16:13:53,416 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:13:53,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:13:53,444 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:13:54,069 INFO L134 CoverageAnalysis]: Checked inductivity of 4671 backedges. 0 proven. 2511 refuted. 0 times theorem prover too weak. 2160 trivial. 0 not checked. [2018-02-04 16:13:54,070 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:13:54,093 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-02-04 16:13:54,094 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:13:54,095 INFO L134 CoverageAnalysis]: Checked inductivity of 1728 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1728 trivial. 0 not checked. [2018-02-04 16:13:54,095 INFO L182 omatonBuilderFactory]: Interpolants [21760#(<= main_~i~1 18), 21761#(<= main_~i~1 19), 21762#(<= main_~i~1 20), 21763#(<= main_~i~1 21), 21764#(<= main_~i~1 22), 21765#(<= main_~i~1 23), 21766#(<= main_~i~1 24), 21767#(<= main_~i~1 25), 21768#(<= main_~i~1 26), 21769#(<= main_~i~1 27), 21740#true, 21741#false, 21742#(= main_~i~1 0), 21743#(<= main_~i~1 1), 21744#(<= main_~i~1 2), 21745#(<= main_~i~1 3), 21746#(<= main_~i~1 4), 21747#(<= main_~i~1 5), 21748#(<= main_~i~1 6), 21749#(<= main_~i~1 7), 21750#(<= main_~i~1 8), 21751#(<= main_~i~1 9), 21752#(<= main_~i~1 10), 21753#(<= main_~i~1 11), 21754#(<= main_~i~1 12), 21755#(<= main_~i~1 13), 21756#(<= main_~i~1 14), 21757#(<= main_~i~1 15), 21758#(<= main_~i~1 16), 21759#(<= main_~i~1 17)] [2018-02-04 16:13:54,096 INFO L134 CoverageAnalysis]: Checked inductivity of 4671 backedges. 0 proven. 2511 refuted. 0 times theorem prover too weak. 2160 trivial. 0 not checked. [2018-02-04 16:13:54,096 INFO L409 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-02-04 16:13:54,096 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-02-04 16:13:54,096 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-02-04 16:13:54,097 INFO L87 Difference]: Start difference. First operand 568 states and 697 transitions. Second operand 30 states. [2018-02-04 16:13:54,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:13:54,398 INFO L93 Difference]: Finished difference Result 746 states and 857 transitions. [2018-02-04 16:13:54,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-02-04 16:13:54,398 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 376 [2018-02-04 16:13:54,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:13:54,400 INFO L225 Difference]: With dead ends: 746 [2018-02-04 16:13:54,400 INFO L226 Difference]: Without dead ends: 746 [2018-02-04 16:13:54,401 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-02-04 16:13:54,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 746 states. [2018-02-04 16:13:54,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 746 to 587. [2018-02-04 16:13:54,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 587 states. [2018-02-04 16:13:54,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 587 states to 587 states and 721 transitions. [2018-02-04 16:13:54,406 INFO L78 Accepts]: Start accepts. Automaton has 587 states and 721 transitions. Word has length 376 [2018-02-04 16:13:54,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:13:54,406 INFO L432 AbstractCegarLoop]: Abstraction has 587 states and 721 transitions. [2018-02-04 16:13:54,407 INFO L433 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-02-04 16:13:54,407 INFO L276 IsEmpty]: Start isEmpty. Operand 587 states and 721 transitions. [2018-02-04 16:13:54,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 390 [2018-02-04 16:13:54,408 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:13:54,408 INFO L351 BasicCegarLoop]: trace histogram [29, 29, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:13:54,408 INFO L371 AbstractCegarLoop]: === Iteration 40 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 16:13:54,409 INFO L82 PathProgramCache]: Analyzing trace with hash 1809069988, now seen corresponding path program 26 times [2018-02-04 16:13:54,409 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:13:54,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:13:54,426 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:13:54,953 INFO L134 CoverageAnalysis]: Checked inductivity of 5026 backedges. 0 proven. 2702 refuted. 0 times theorem prover too weak. 2324 trivial. 0 not checked. [2018-02-04 16:13:54,953 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:13:54,953 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-02-04 16:13:54,954 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:13:54,954 INFO L134 CoverageAnalysis]: Checked inductivity of 1875 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1875 trivial. 0 not checked. [2018-02-04 16:13:54,954 INFO L182 omatonBuilderFactory]: Interpolants [23104#false, 23105#(= main_~i~1 0), 23106#(<= main_~i~1 1), 23107#(<= main_~i~1 2), 23108#(<= main_~i~1 3), 23109#(<= main_~i~1 4), 23110#(<= main_~i~1 5), 23111#(<= main_~i~1 6), 23112#(<= main_~i~1 7), 23113#(<= main_~i~1 8), 23114#(<= main_~i~1 9), 23115#(<= main_~i~1 10), 23116#(<= main_~i~1 11), 23117#(<= main_~i~1 12), 23118#(<= main_~i~1 13), 23119#(<= main_~i~1 14), 23120#(<= main_~i~1 15), 23121#(<= main_~i~1 16), 23122#(<= main_~i~1 17), 23123#(<= main_~i~1 18), 23124#(<= main_~i~1 19), 23125#(<= main_~i~1 20), 23126#(<= main_~i~1 21), 23127#(<= main_~i~1 22), 23128#(<= main_~i~1 23), 23129#(<= main_~i~1 24), 23130#(<= main_~i~1 25), 23131#(<= main_~i~1 26), 23132#(<= main_~i~1 27), 23133#(<= main_~i~1 28), 23103#true] [2018-02-04 16:13:54,954 INFO L134 CoverageAnalysis]: Checked inductivity of 5026 backedges. 0 proven. 2702 refuted. 0 times theorem prover too weak. 2324 trivial. 0 not checked. [2018-02-04 16:13:54,954 INFO L409 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-02-04 16:13:54,955 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-02-04 16:13:54,955 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2018-02-04 16:13:54,955 INFO L87 Difference]: Start difference. First operand 587 states and 721 transitions. Second operand 31 states. [2018-02-04 16:13:55,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:13:55,307 INFO L93 Difference]: Finished difference Result 770 states and 885 transitions. [2018-02-04 16:13:55,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-02-04 16:13:55,307 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 389 [2018-02-04 16:13:55,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:13:55,309 INFO L225 Difference]: With dead ends: 770 [2018-02-04 16:13:55,309 INFO L226 Difference]: Without dead ends: 770 [2018-02-04 16:13:55,309 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2018-02-04 16:13:55,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 770 states. [2018-02-04 16:13:55,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 770 to 606. [2018-02-04 16:13:55,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 606 states. [2018-02-04 16:13:55,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 606 states to 606 states and 745 transitions. [2018-02-04 16:13:55,315 INFO L78 Accepts]: Start accepts. Automaton has 606 states and 745 transitions. Word has length 389 [2018-02-04 16:13:55,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:13:55,315 INFO L432 AbstractCegarLoop]: Abstraction has 606 states and 745 transitions. [2018-02-04 16:13:55,315 INFO L433 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-02-04 16:13:55,315 INFO L276 IsEmpty]: Start isEmpty. Operand 606 states and 745 transitions. [2018-02-04 16:13:55,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 403 [2018-02-04 16:13:55,317 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:13:55,317 INFO L351 BasicCegarLoop]: trace histogram [30, 30, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:13:55,317 INFO L371 AbstractCegarLoop]: === Iteration 41 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 16:13:55,317 INFO L82 PathProgramCache]: Analyzing trace with hash 689622003, now seen corresponding path program 27 times [2018-02-04 16:13:55,318 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:13:55,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:13:55,335 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:13:55,958 INFO L134 CoverageAnalysis]: Checked inductivity of 5394 backedges. 0 proven. 2900 refuted. 0 times theorem prover too weak. 2494 trivial. 0 not checked. [2018-02-04 16:13:55,958 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:13:55,958 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2018-02-04 16:13:55,958 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:13:55,959 INFO L134 CoverageAnalysis]: Checked inductivity of 2028 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2028 trivial. 0 not checked. [2018-02-04 16:13:55,959 INFO L182 omatonBuilderFactory]: Interpolants [24512#(= main_~i~1 0), 24513#(<= main_~i~1 1), 24514#(<= main_~i~1 2), 24515#(<= main_~i~1 3), 24516#(<= main_~i~1 4), 24517#(<= main_~i~1 5), 24518#(<= main_~i~1 6), 24519#(<= main_~i~1 7), 24520#(<= main_~i~1 8), 24521#(<= main_~i~1 9), 24522#(<= main_~i~1 10), 24523#(<= main_~i~1 11), 24524#(<= main_~i~1 12), 24525#(<= main_~i~1 13), 24526#(<= main_~i~1 14), 24527#(<= main_~i~1 15), 24528#(<= main_~i~1 16), 24529#(<= main_~i~1 17), 24530#(<= main_~i~1 18), 24531#(<= main_~i~1 19), 24532#(<= main_~i~1 20), 24533#(<= main_~i~1 21), 24534#(<= main_~i~1 22), 24535#(<= main_~i~1 23), 24536#(<= main_~i~1 24), 24537#(<= main_~i~1 25), 24538#(<= main_~i~1 26), 24539#(<= main_~i~1 27), 24540#(<= main_~i~1 28), 24541#(<= main_~i~1 29), 24510#true, 24511#false] [2018-02-04 16:13:55,959 INFO L134 CoverageAnalysis]: Checked inductivity of 5394 backedges. 0 proven. 2900 refuted. 0 times theorem prover too weak. 2494 trivial. 0 not checked. [2018-02-04 16:13:55,959 INFO L409 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-02-04 16:13:55,959 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-02-04 16:13:55,959 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-02-04 16:13:55,959 INFO L87 Difference]: Start difference. First operand 606 states and 745 transitions. Second operand 32 states. [2018-02-04 16:13:56,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:13:56,383 INFO L93 Difference]: Finished difference Result 794 states and 913 transitions. [2018-02-04 16:13:56,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-02-04 16:13:56,384 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 402 [2018-02-04 16:13:56,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:13:56,385 INFO L225 Difference]: With dead ends: 794 [2018-02-04 16:13:56,385 INFO L226 Difference]: Without dead ends: 794 [2018-02-04 16:13:56,386 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-02-04 16:13:56,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 794 states. [2018-02-04 16:13:56,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 794 to 625. [2018-02-04 16:13:56,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 625 states. [2018-02-04 16:13:56,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 625 states to 625 states and 769 transitions. [2018-02-04 16:13:56,393 INFO L78 Accepts]: Start accepts. Automaton has 625 states and 769 transitions. Word has length 402 [2018-02-04 16:13:56,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:13:56,394 INFO L432 AbstractCegarLoop]: Abstraction has 625 states and 769 transitions. [2018-02-04 16:13:56,394 INFO L433 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-02-04 16:13:56,394 INFO L276 IsEmpty]: Start isEmpty. Operand 625 states and 769 transitions. [2018-02-04 16:13:56,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 416 [2018-02-04 16:13:56,397 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:13:56,397 INFO L351 BasicCegarLoop]: trace histogram [31, 31, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:13:56,397 INFO L371 AbstractCegarLoop]: === Iteration 42 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 16:13:56,397 INFO L82 PathProgramCache]: Analyzing trace with hash -1718226940, now seen corresponding path program 28 times [2018-02-04 16:13:56,398 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:13:56,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:13:56,424 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:13:57,110 INFO L134 CoverageAnalysis]: Checked inductivity of 5775 backedges. 0 proven. 3105 refuted. 0 times theorem prover too weak. 2670 trivial. 0 not checked. [2018-02-04 16:13:57,111 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:13:57,111 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-02-04 16:13:57,111 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:13:57,111 INFO L134 CoverageAnalysis]: Checked inductivity of 2187 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2187 trivial. 0 not checked. [2018-02-04 16:13:57,111 INFO L182 omatonBuilderFactory]: Interpolants [25984#(<= main_~i~1 21), 25985#(<= main_~i~1 22), 25986#(<= main_~i~1 23), 25987#(<= main_~i~1 24), 25988#(<= main_~i~1 25), 25989#(<= main_~i~1 26), 25990#(<= main_~i~1 27), 25991#(<= main_~i~1 28), 25992#(<= main_~i~1 29), 25993#(<= main_~i~1 30), 25961#true, 25962#false, 25963#(= main_~i~1 0), 25964#(<= main_~i~1 1), 25965#(<= main_~i~1 2), 25966#(<= main_~i~1 3), 25967#(<= main_~i~1 4), 25968#(<= main_~i~1 5), 25969#(<= main_~i~1 6), 25970#(<= main_~i~1 7), 25971#(<= main_~i~1 8), 25972#(<= main_~i~1 9), 25973#(<= main_~i~1 10), 25974#(<= main_~i~1 11), 25975#(<= main_~i~1 12), 25976#(<= main_~i~1 13), 25977#(<= main_~i~1 14), 25978#(<= main_~i~1 15), 25979#(<= main_~i~1 16), 25980#(<= main_~i~1 17), 25981#(<= main_~i~1 18), 25982#(<= main_~i~1 19), 25983#(<= main_~i~1 20)] [2018-02-04 16:13:57,111 INFO L134 CoverageAnalysis]: Checked inductivity of 5775 backedges. 0 proven. 3105 refuted. 0 times theorem prover too weak. 2670 trivial. 0 not checked. [2018-02-04 16:13:57,112 INFO L409 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-02-04 16:13:57,112 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-02-04 16:13:57,112 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2018-02-04 16:13:57,112 INFO L87 Difference]: Start difference. First operand 625 states and 769 transitions. Second operand 33 states. [2018-02-04 16:13:57,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:13:57,377 INFO L93 Difference]: Finished difference Result 818 states and 941 transitions. [2018-02-04 16:13:57,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-02-04 16:13:57,377 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 415 [2018-02-04 16:13:57,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:13:57,379 INFO L225 Difference]: With dead ends: 818 [2018-02-04 16:13:57,379 INFO L226 Difference]: Without dead ends: 818 [2018-02-04 16:13:57,379 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2018-02-04 16:13:57,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 818 states. [2018-02-04 16:13:57,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 818 to 644. [2018-02-04 16:13:57,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 644 states. [2018-02-04 16:13:57,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 644 states to 644 states and 793 transitions. [2018-02-04 16:13:57,385 INFO L78 Accepts]: Start accepts. Automaton has 644 states and 793 transitions. Word has length 415 [2018-02-04 16:13:57,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:13:57,385 INFO L432 AbstractCegarLoop]: Abstraction has 644 states and 793 transitions. [2018-02-04 16:13:57,385 INFO L433 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-02-04 16:13:57,385 INFO L276 IsEmpty]: Start isEmpty. Operand 644 states and 793 transitions. [2018-02-04 16:13:57,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 429 [2018-02-04 16:13:57,387 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:13:57,387 INFO L351 BasicCegarLoop]: trace histogram [32, 32, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:13:57,387 INFO L371 AbstractCegarLoop]: === Iteration 43 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 16:13:57,388 INFO L82 PathProgramCache]: Analyzing trace with hash 957329299, now seen corresponding path program 29 times [2018-02-04 16:13:57,388 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:13:57,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:13:57,406 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:13:58,095 INFO L134 CoverageAnalysis]: Checked inductivity of 6169 backedges. 0 proven. 3317 refuted. 0 times theorem prover too weak. 2852 trivial. 0 not checked. [2018-02-04 16:13:58,096 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:13:58,096 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2018-02-04 16:13:58,096 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:13:58,096 INFO L134 CoverageAnalysis]: Checked inductivity of 2352 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2352 trivial. 0 not checked. [2018-02-04 16:13:58,096 INFO L182 omatonBuilderFactory]: Interpolants [27456#true, 27457#false, 27458#(= main_~i~1 0), 27459#(<= main_~i~1 1), 27460#(<= main_~i~1 2), 27461#(<= main_~i~1 3), 27462#(<= main_~i~1 4), 27463#(<= main_~i~1 5), 27464#(<= main_~i~1 6), 27465#(<= main_~i~1 7), 27466#(<= main_~i~1 8), 27467#(<= main_~i~1 9), 27468#(<= main_~i~1 10), 27469#(<= main_~i~1 11), 27470#(<= main_~i~1 12), 27471#(<= main_~i~1 13), 27472#(<= main_~i~1 14), 27473#(<= main_~i~1 15), 27474#(<= main_~i~1 16), 27475#(<= main_~i~1 17), 27476#(<= main_~i~1 18), 27477#(<= main_~i~1 19), 27478#(<= main_~i~1 20), 27479#(<= main_~i~1 21), 27480#(<= main_~i~1 22), 27481#(<= main_~i~1 23), 27482#(<= main_~i~1 24), 27483#(<= main_~i~1 25), 27484#(<= main_~i~1 26), 27485#(<= main_~i~1 27), 27486#(<= main_~i~1 28), 27487#(<= main_~i~1 29), 27488#(<= main_~i~1 30), 27489#(<= main_~i~1 31)] [2018-02-04 16:13:58,096 INFO L134 CoverageAnalysis]: Checked inductivity of 6169 backedges. 0 proven. 3317 refuted. 0 times theorem prover too weak. 2852 trivial. 0 not checked. [2018-02-04 16:13:58,097 INFO L409 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-02-04 16:13:58,097 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-02-04 16:13:58,097 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-02-04 16:13:58,097 INFO L87 Difference]: Start difference. First operand 644 states and 793 transitions. Second operand 34 states. [2018-02-04 16:13:58,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:13:58,504 INFO L93 Difference]: Finished difference Result 842 states and 969 transitions. [2018-02-04 16:13:58,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-02-04 16:13:58,504 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 428 [2018-02-04 16:13:58,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:13:58,506 INFO L225 Difference]: With dead ends: 842 [2018-02-04 16:13:58,506 INFO L226 Difference]: Without dead ends: 842 [2018-02-04 16:13:58,507 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-02-04 16:13:58,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 842 states. [2018-02-04 16:13:58,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 842 to 663. [2018-02-04 16:13:58,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 663 states. [2018-02-04 16:13:58,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 663 states to 663 states and 817 transitions. [2018-02-04 16:13:58,513 INFO L78 Accepts]: Start accepts. Automaton has 663 states and 817 transitions. Word has length 428 [2018-02-04 16:13:58,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:13:58,513 INFO L432 AbstractCegarLoop]: Abstraction has 663 states and 817 transitions. [2018-02-04 16:13:58,513 INFO L433 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-02-04 16:13:58,513 INFO L276 IsEmpty]: Start isEmpty. Operand 663 states and 817 transitions. [2018-02-04 16:13:58,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 442 [2018-02-04 16:13:58,515 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:13:58,516 INFO L351 BasicCegarLoop]: trace histogram [33, 33, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:13:58,516 INFO L371 AbstractCegarLoop]: === Iteration 44 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 16:13:58,516 INFO L82 PathProgramCache]: Analyzing trace with hash -360189852, now seen corresponding path program 30 times [2018-02-04 16:13:58,516 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:13:58,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:13:58,534 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:13:59,295 INFO L134 CoverageAnalysis]: Checked inductivity of 6576 backedges. 0 proven. 3536 refuted. 0 times theorem prover too weak. 3040 trivial. 0 not checked. [2018-02-04 16:13:59,296 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:13:59,309 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-02-04 16:13:59,310 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:13:59,310 INFO L134 CoverageAnalysis]: Checked inductivity of 2523 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2523 trivial. 0 not checked. [2018-02-04 16:13:59,310 INFO L182 omatonBuilderFactory]: Interpolants [28995#true, 28996#false, 28997#(= main_~i~1 0), 28998#(<= main_~i~1 1), 28999#(<= main_~i~1 2), 29000#(<= main_~i~1 3), 29001#(<= main_~i~1 4), 29002#(<= main_~i~1 5), 29003#(<= main_~i~1 6), 29004#(<= main_~i~1 7), 29005#(<= main_~i~1 8), 29006#(<= main_~i~1 9), 29007#(<= main_~i~1 10), 29008#(<= main_~i~1 11), 29009#(<= main_~i~1 12), 29010#(<= main_~i~1 13), 29011#(<= main_~i~1 14), 29012#(<= main_~i~1 15), 29013#(<= main_~i~1 16), 29014#(<= main_~i~1 17), 29015#(<= main_~i~1 18), 29016#(<= main_~i~1 19), 29017#(<= main_~i~1 20), 29018#(<= main_~i~1 21), 29019#(<= main_~i~1 22), 29020#(<= main_~i~1 23), 29021#(<= main_~i~1 24), 29022#(<= main_~i~1 25), 29023#(<= main_~i~1 26), 29024#(<= main_~i~1 27), 29025#(<= main_~i~1 28), 29026#(<= main_~i~1 29), 29027#(<= main_~i~1 30), 29028#(<= main_~i~1 31), 29029#(<= main_~i~1 32)] [2018-02-04 16:13:59,310 INFO L134 CoverageAnalysis]: Checked inductivity of 6576 backedges. 0 proven. 3536 refuted. 0 times theorem prover too weak. 3040 trivial. 0 not checked. [2018-02-04 16:13:59,311 INFO L409 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-02-04 16:13:59,311 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-02-04 16:13:59,311 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2018-02-04 16:13:59,311 INFO L87 Difference]: Start difference. First operand 663 states and 817 transitions. Second operand 35 states. [2018-02-04 16:13:59,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:13:59,720 INFO L93 Difference]: Finished difference Result 866 states and 997 transitions. [2018-02-04 16:13:59,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-02-04 16:13:59,720 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 441 [2018-02-04 16:13:59,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:13:59,722 INFO L225 Difference]: With dead ends: 866 [2018-02-04 16:13:59,722 INFO L226 Difference]: Without dead ends: 866 [2018-02-04 16:13:59,722 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2018-02-04 16:13:59,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 866 states. [2018-02-04 16:13:59,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 866 to 682. [2018-02-04 16:13:59,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 682 states. [2018-02-04 16:13:59,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 682 states to 682 states and 841 transitions. [2018-02-04 16:13:59,728 INFO L78 Accepts]: Start accepts. Automaton has 682 states and 841 transitions. Word has length 441 [2018-02-04 16:13:59,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:13:59,728 INFO L432 AbstractCegarLoop]: Abstraction has 682 states and 841 transitions. [2018-02-04 16:13:59,728 INFO L433 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-02-04 16:13:59,728 INFO L276 IsEmpty]: Start isEmpty. Operand 682 states and 841 transitions. [2018-02-04 16:13:59,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 455 [2018-02-04 16:13:59,730 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:13:59,730 INFO L351 BasicCegarLoop]: trace histogram [34, 34, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:13:59,731 INFO L371 AbstractCegarLoop]: === Iteration 45 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 16:13:59,731 INFO L82 PathProgramCache]: Analyzing trace with hash 881412915, now seen corresponding path program 31 times [2018-02-04 16:13:59,731 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:13:59,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:13:59,762 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:14:00,496 INFO L134 CoverageAnalysis]: Checked inductivity of 6996 backedges. 0 proven. 3762 refuted. 0 times theorem prover too weak. 3234 trivial. 0 not checked. [2018-02-04 16:14:00,497 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:14:00,497 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2018-02-04 16:14:00,497 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:14:00,497 INFO L134 CoverageAnalysis]: Checked inductivity of 2700 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2700 trivial. 0 not checked. [2018-02-04 16:14:00,497 INFO L182 omatonBuilderFactory]: Interpolants [30592#(<= main_~i~1 12), 30593#(<= main_~i~1 13), 30594#(<= main_~i~1 14), 30595#(<= main_~i~1 15), 30596#(<= main_~i~1 16), 30597#(<= main_~i~1 17), 30598#(<= main_~i~1 18), 30599#(<= main_~i~1 19), 30600#(<= main_~i~1 20), 30601#(<= main_~i~1 21), 30602#(<= main_~i~1 22), 30603#(<= main_~i~1 23), 30604#(<= main_~i~1 24), 30605#(<= main_~i~1 25), 30606#(<= main_~i~1 26), 30607#(<= main_~i~1 27), 30608#(<= main_~i~1 28), 30609#(<= main_~i~1 29), 30610#(<= main_~i~1 30), 30611#(<= main_~i~1 31), 30612#(<= main_~i~1 32), 30613#(<= main_~i~1 33), 30578#true, 30579#false, 30580#(= main_~i~1 0), 30581#(<= main_~i~1 1), 30582#(<= main_~i~1 2), 30583#(<= main_~i~1 3), 30584#(<= main_~i~1 4), 30585#(<= main_~i~1 5), 30586#(<= main_~i~1 6), 30587#(<= main_~i~1 7), 30588#(<= main_~i~1 8), 30589#(<= main_~i~1 9), 30590#(<= main_~i~1 10), 30591#(<= main_~i~1 11)] [2018-02-04 16:14:00,497 INFO L134 CoverageAnalysis]: Checked inductivity of 6996 backedges. 0 proven. 3762 refuted. 0 times theorem prover too weak. 3234 trivial. 0 not checked. [2018-02-04 16:14:00,498 INFO L409 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-02-04 16:14:00,498 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-02-04 16:14:00,498 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-02-04 16:14:00,498 INFO L87 Difference]: Start difference. First operand 682 states and 841 transitions. Second operand 36 states. [2018-02-04 16:14:00,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:14:00,807 INFO L93 Difference]: Finished difference Result 890 states and 1025 transitions. [2018-02-04 16:14:00,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-02-04 16:14:00,807 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 454 [2018-02-04 16:14:00,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:14:00,809 INFO L225 Difference]: With dead ends: 890 [2018-02-04 16:14:00,809 INFO L226 Difference]: Without dead ends: 890 [2018-02-04 16:14:00,810 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-02-04 16:14:00,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 890 states. [2018-02-04 16:14:00,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 890 to 701. [2018-02-04 16:14:00,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 701 states. [2018-02-04 16:14:00,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 701 states to 701 states and 865 transitions. [2018-02-04 16:14:00,815 INFO L78 Accepts]: Start accepts. Automaton has 701 states and 865 transitions. Word has length 454 [2018-02-04 16:14:00,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:14:00,816 INFO L432 AbstractCegarLoop]: Abstraction has 701 states and 865 transitions. [2018-02-04 16:14:00,816 INFO L433 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-02-04 16:14:00,816 INFO L276 IsEmpty]: Start isEmpty. Operand 701 states and 865 transitions. [2018-02-04 16:14:00,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 468 [2018-02-04 16:14:00,819 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:14:00,820 INFO L351 BasicCegarLoop]: trace histogram [35, 35, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:14:00,820 INFO L371 AbstractCegarLoop]: === Iteration 46 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 16:14:00,820 INFO L82 PathProgramCache]: Analyzing trace with hash -1889519420, now seen corresponding path program 32 times [2018-02-04 16:14:00,821 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:14:00,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:14:00,851 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:14:01,776 INFO L134 CoverageAnalysis]: Checked inductivity of 7429 backedges. 0 proven. 3995 refuted. 0 times theorem prover too weak. 3434 trivial. 0 not checked. [2018-02-04 16:14:01,776 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:14:01,776 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2018-02-04 16:14:01,777 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:14:01,777 INFO L134 CoverageAnalysis]: Checked inductivity of 2883 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2883 trivial. 0 not checked. [2018-02-04 16:14:01,777 INFO L182 omatonBuilderFactory]: Interpolants [32205#true, 32206#false, 32207#(= main_~i~1 0), 32208#(<= main_~i~1 1), 32209#(<= main_~i~1 2), 32210#(<= main_~i~1 3), 32211#(<= main_~i~1 4), 32212#(<= main_~i~1 5), 32213#(<= main_~i~1 6), 32214#(<= main_~i~1 7), 32215#(<= main_~i~1 8), 32216#(<= main_~i~1 9), 32217#(<= main_~i~1 10), 32218#(<= main_~i~1 11), 32219#(<= main_~i~1 12), 32220#(<= main_~i~1 13), 32221#(<= main_~i~1 14), 32222#(<= main_~i~1 15), 32223#(<= main_~i~1 16), 32224#(<= main_~i~1 17), 32225#(<= main_~i~1 18), 32226#(<= main_~i~1 19), 32227#(<= main_~i~1 20), 32228#(<= main_~i~1 21), 32229#(<= main_~i~1 22), 32230#(<= main_~i~1 23), 32231#(<= main_~i~1 24), 32232#(<= main_~i~1 25), 32233#(<= main_~i~1 26), 32234#(<= main_~i~1 27), 32235#(<= main_~i~1 28), 32236#(<= main_~i~1 29), 32237#(<= main_~i~1 30), 32238#(<= main_~i~1 31), 32239#(<= main_~i~1 32), 32240#(<= main_~i~1 33), 32241#(<= main_~i~1 34)] [2018-02-04 16:14:01,777 INFO L134 CoverageAnalysis]: Checked inductivity of 7429 backedges. 0 proven. 3995 refuted. 0 times theorem prover too weak. 3434 trivial. 0 not checked. [2018-02-04 16:14:01,777 INFO L409 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-02-04 16:14:01,777 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-02-04 16:14:01,778 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2018-02-04 16:14:01,778 INFO L87 Difference]: Start difference. First operand 701 states and 865 transitions. Second operand 37 states. [2018-02-04 16:14:02,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:14:02,567 INFO L93 Difference]: Finished difference Result 914 states and 1053 transitions. [2018-02-04 16:14:02,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-02-04 16:14:02,567 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 467 [2018-02-04 16:14:02,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:14:02,570 INFO L225 Difference]: With dead ends: 914 [2018-02-04 16:14:02,570 INFO L226 Difference]: Without dead ends: 914 [2018-02-04 16:14:02,570 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2018-02-04 16:14:02,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 914 states. [2018-02-04 16:14:02,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 914 to 720. [2018-02-04 16:14:02,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 720 states. [2018-02-04 16:14:02,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 720 states to 720 states and 889 transitions. [2018-02-04 16:14:02,578 INFO L78 Accepts]: Start accepts. Automaton has 720 states and 889 transitions. Word has length 467 [2018-02-04 16:14:02,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:14:02,579 INFO L432 AbstractCegarLoop]: Abstraction has 720 states and 889 transitions. [2018-02-04 16:14:02,579 INFO L433 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-02-04 16:14:02,579 INFO L276 IsEmpty]: Start isEmpty. Operand 720 states and 889 transitions. [2018-02-04 16:14:02,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 481 [2018-02-04 16:14:02,583 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:14:02,583 INFO L351 BasicCegarLoop]: trace histogram [36, 36, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:14:02,583 INFO L371 AbstractCegarLoop]: === Iteration 47 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 16:14:02,583 INFO L82 PathProgramCache]: Analyzing trace with hash 1116839635, now seen corresponding path program 33 times [2018-02-04 16:14:02,584 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:14:02,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:14:02,617 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:14:03,351 INFO L134 CoverageAnalysis]: Checked inductivity of 7875 backedges. 0 proven. 4235 refuted. 0 times theorem prover too weak. 3640 trivial. 0 not checked. [2018-02-04 16:14:03,351 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:14:03,352 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2018-02-04 16:14:03,352 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:14:03,352 INFO L134 CoverageAnalysis]: Checked inductivity of 3072 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3072 trivial. 0 not checked. [2018-02-04 16:14:03,352 INFO L182 omatonBuilderFactory]: Interpolants [33876#true, 33877#false, 33878#(= main_~i~1 0), 33879#(<= main_~i~1 1), 33880#(<= main_~i~1 2), 33881#(<= main_~i~1 3), 33882#(<= main_~i~1 4), 33883#(<= main_~i~1 5), 33884#(<= main_~i~1 6), 33885#(<= main_~i~1 7), 33886#(<= main_~i~1 8), 33887#(<= main_~i~1 9), 33888#(<= main_~i~1 10), 33889#(<= main_~i~1 11), 33890#(<= main_~i~1 12), 33891#(<= main_~i~1 13), 33892#(<= main_~i~1 14), 33893#(<= main_~i~1 15), 33894#(<= main_~i~1 16), 33895#(<= main_~i~1 17), 33896#(<= main_~i~1 18), 33897#(<= main_~i~1 19), 33898#(<= main_~i~1 20), 33899#(<= main_~i~1 21), 33900#(<= main_~i~1 22), 33901#(<= main_~i~1 23), 33902#(<= main_~i~1 24), 33903#(<= main_~i~1 25), 33904#(<= main_~i~1 26), 33905#(<= main_~i~1 27), 33906#(<= main_~i~1 28), 33907#(<= main_~i~1 29), 33908#(<= main_~i~1 30), 33909#(<= main_~i~1 31), 33910#(<= main_~i~1 32), 33911#(<= main_~i~1 33), 33912#(<= main_~i~1 34), 33913#(<= main_~i~1 35)] [2018-02-04 16:14:03,352 INFO L134 CoverageAnalysis]: Checked inductivity of 7875 backedges. 0 proven. 4235 refuted. 0 times theorem prover too weak. 3640 trivial. 0 not checked. [2018-02-04 16:14:03,353 INFO L409 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-02-04 16:14:03,353 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-02-04 16:14:03,353 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2018-02-04 16:14:03,353 INFO L87 Difference]: Start difference. First operand 720 states and 889 transitions. Second operand 38 states. [2018-02-04 16:14:03,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:14:03,791 INFO L93 Difference]: Finished difference Result 938 states and 1081 transitions. [2018-02-04 16:14:03,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-02-04 16:14:03,791 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 480 [2018-02-04 16:14:03,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:14:03,794 INFO L225 Difference]: With dead ends: 938 [2018-02-04 16:14:03,794 INFO L226 Difference]: Without dead ends: 938 [2018-02-04 16:14:03,794 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2018-02-04 16:14:03,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 938 states. [2018-02-04 16:14:03,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 938 to 739. [2018-02-04 16:14:03,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 739 states. [2018-02-04 16:14:03,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 739 states to 739 states and 913 transitions. [2018-02-04 16:14:03,801 INFO L78 Accepts]: Start accepts. Automaton has 739 states and 913 transitions. Word has length 480 [2018-02-04 16:14:03,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:14:03,802 INFO L432 AbstractCegarLoop]: Abstraction has 739 states and 913 transitions. [2018-02-04 16:14:03,802 INFO L433 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-02-04 16:14:03,802 INFO L276 IsEmpty]: Start isEmpty. Operand 739 states and 913 transitions. [2018-02-04 16:14:03,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 494 [2018-02-04 16:14:03,804 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:14:03,804 INFO L351 BasicCegarLoop]: trace histogram [37, 37, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:14:03,804 INFO L371 AbstractCegarLoop]: === Iteration 48 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 16:14:03,804 INFO L82 PathProgramCache]: Analyzing trace with hash -1588279004, now seen corresponding path program 34 times [2018-02-04 16:14:03,805 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:14:03,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:14:03,826 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:14:04,601 INFO L134 CoverageAnalysis]: Checked inductivity of 8334 backedges. 0 proven. 4482 refuted. 0 times theorem prover too weak. 3852 trivial. 0 not checked. [2018-02-04 16:14:04,601 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:14:04,601 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-02-04 16:14:04,601 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:14:04,601 INFO L134 CoverageAnalysis]: Checked inductivity of 3267 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3267 trivial. 0 not checked. [2018-02-04 16:14:04,601 INFO L182 omatonBuilderFactory]: Interpolants [35591#true, 35592#false, 35593#(= main_~i~1 0), 35594#(<= main_~i~1 1), 35595#(<= main_~i~1 2), 35596#(<= main_~i~1 3), 35597#(<= main_~i~1 4), 35598#(<= main_~i~1 5), 35599#(<= main_~i~1 6), 35600#(<= main_~i~1 7), 35601#(<= main_~i~1 8), 35602#(<= main_~i~1 9), 35603#(<= main_~i~1 10), 35604#(<= main_~i~1 11), 35605#(<= main_~i~1 12), 35606#(<= main_~i~1 13), 35607#(<= main_~i~1 14), 35608#(<= main_~i~1 15), 35609#(<= main_~i~1 16), 35610#(<= main_~i~1 17), 35611#(<= main_~i~1 18), 35612#(<= main_~i~1 19), 35613#(<= main_~i~1 20), 35614#(<= main_~i~1 21), 35615#(<= main_~i~1 22), 35616#(<= main_~i~1 23), 35617#(<= main_~i~1 24), 35618#(<= main_~i~1 25), 35619#(<= main_~i~1 26), 35620#(<= main_~i~1 27), 35621#(<= main_~i~1 28), 35622#(<= main_~i~1 29), 35623#(<= main_~i~1 30), 35624#(<= main_~i~1 31), 35625#(<= main_~i~1 32), 35626#(<= main_~i~1 33), 35627#(<= main_~i~1 34), 35628#(<= main_~i~1 35), 35629#(<= main_~i~1 36)] [2018-02-04 16:14:04,602 INFO L134 CoverageAnalysis]: Checked inductivity of 8334 backedges. 0 proven. 4482 refuted. 0 times theorem prover too weak. 3852 trivial. 0 not checked. [2018-02-04 16:14:04,602 INFO L409 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-02-04 16:14:04,602 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-02-04 16:14:04,602 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2018-02-04 16:14:04,602 INFO L87 Difference]: Start difference. First operand 739 states and 913 transitions. Second operand 39 states. [2018-02-04 16:14:05,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:14:05,078 INFO L93 Difference]: Finished difference Result 962 states and 1109 transitions. [2018-02-04 16:14:05,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-02-04 16:14:05,078 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 493 [2018-02-04 16:14:05,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:14:05,081 INFO L225 Difference]: With dead ends: 962 [2018-02-04 16:14:05,081 INFO L226 Difference]: Without dead ends: 962 [2018-02-04 16:14:05,081 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2018-02-04 16:14:05,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 962 states. [2018-02-04 16:14:05,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 962 to 758. [2018-02-04 16:14:05,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 758 states. [2018-02-04 16:14:05,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 758 states to 758 states and 937 transitions. [2018-02-04 16:14:05,088 INFO L78 Accepts]: Start accepts. Automaton has 758 states and 937 transitions. Word has length 493 [2018-02-04 16:14:05,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:14:05,088 INFO L432 AbstractCegarLoop]: Abstraction has 758 states and 937 transitions. [2018-02-04 16:14:05,088 INFO L433 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-02-04 16:14:05,088 INFO L276 IsEmpty]: Start isEmpty. Operand 758 states and 937 transitions. [2018-02-04 16:14:05,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 507 [2018-02-04 16:14:05,090 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:14:05,091 INFO L351 BasicCegarLoop]: trace histogram [38, 38, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:14:05,091 INFO L371 AbstractCegarLoop]: === Iteration 49 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 16:14:05,091 INFO L82 PathProgramCache]: Analyzing trace with hash 1907534451, now seen corresponding path program 35 times [2018-02-04 16:14:05,091 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:14:05,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:14:05,111 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:14:05,926 INFO L134 CoverageAnalysis]: Checked inductivity of 8806 backedges. 0 proven. 4736 refuted. 0 times theorem prover too weak. 4070 trivial. 0 not checked. [2018-02-04 16:14:05,926 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:14:05,926 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2018-02-04 16:14:05,926 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:14:05,927 INFO L134 CoverageAnalysis]: Checked inductivity of 3468 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3468 trivial. 0 not checked. [2018-02-04 16:14:05,927 INFO L182 omatonBuilderFactory]: Interpolants [37376#(<= main_~i~1 24), 37377#(<= main_~i~1 25), 37378#(<= main_~i~1 26), 37379#(<= main_~i~1 27), 37380#(<= main_~i~1 28), 37381#(<= main_~i~1 29), 37382#(<= main_~i~1 30), 37383#(<= main_~i~1 31), 37384#(<= main_~i~1 32), 37385#(<= main_~i~1 33), 37386#(<= main_~i~1 34), 37387#(<= main_~i~1 35), 37388#(<= main_~i~1 36), 37389#(<= main_~i~1 37), 37350#true, 37351#false, 37352#(= main_~i~1 0), 37353#(<= main_~i~1 1), 37354#(<= main_~i~1 2), 37355#(<= main_~i~1 3), 37356#(<= main_~i~1 4), 37357#(<= main_~i~1 5), 37358#(<= main_~i~1 6), 37359#(<= main_~i~1 7), 37360#(<= main_~i~1 8), 37361#(<= main_~i~1 9), 37362#(<= main_~i~1 10), 37363#(<= main_~i~1 11), 37364#(<= main_~i~1 12), 37365#(<= main_~i~1 13), 37366#(<= main_~i~1 14), 37367#(<= main_~i~1 15), 37368#(<= main_~i~1 16), 37369#(<= main_~i~1 17), 37370#(<= main_~i~1 18), 37371#(<= main_~i~1 19), 37372#(<= main_~i~1 20), 37373#(<= main_~i~1 21), 37374#(<= main_~i~1 22), 37375#(<= main_~i~1 23)] [2018-02-04 16:14:05,927 INFO L134 CoverageAnalysis]: Checked inductivity of 8806 backedges. 0 proven. 4736 refuted. 0 times theorem prover too weak. 4070 trivial. 0 not checked. [2018-02-04 16:14:05,927 INFO L409 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-02-04 16:14:05,927 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-02-04 16:14:05,928 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2018-02-04 16:14:05,928 INFO L87 Difference]: Start difference. First operand 758 states and 937 transitions. Second operand 40 states. [2018-02-04 16:14:06,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:14:06,305 INFO L93 Difference]: Finished difference Result 986 states and 1137 transitions. [2018-02-04 16:14:06,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-02-04 16:14:06,306 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 506 [2018-02-04 16:14:06,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:14:06,308 INFO L225 Difference]: With dead ends: 986 [2018-02-04 16:14:06,308 INFO L226 Difference]: Without dead ends: 986 [2018-02-04 16:14:06,309 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2018-02-04 16:14:06,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 986 states. [2018-02-04 16:14:06,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 986 to 777. [2018-02-04 16:14:06,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2018-02-04 16:14:06,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 961 transitions. [2018-02-04 16:14:06,316 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 961 transitions. Word has length 506 [2018-02-04 16:14:06,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:14:06,316 INFO L432 AbstractCegarLoop]: Abstraction has 777 states and 961 transitions. [2018-02-04 16:14:06,316 INFO L433 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-02-04 16:14:06,316 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 961 transitions. [2018-02-04 16:14:06,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 520 [2018-02-04 16:14:06,319 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:14:06,319 INFO L351 BasicCegarLoop]: trace histogram [39, 39, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:14:06,319 INFO L371 AbstractCegarLoop]: === Iteration 50 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 16:14:06,319 INFO L82 PathProgramCache]: Analyzing trace with hash -2112118396, now seen corresponding path program 36 times [2018-02-04 16:14:06,320 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:14:06,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:14:06,340 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:14:07,167 INFO L134 CoverageAnalysis]: Checked inductivity of 9291 backedges. 0 proven. 4997 refuted. 0 times theorem prover too weak. 4294 trivial. 0 not checked. [2018-02-04 16:14:07,167 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:14:07,167 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2018-02-04 16:14:07,168 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:14:07,168 INFO L134 CoverageAnalysis]: Checked inductivity of 3675 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3675 trivial. 0 not checked. [2018-02-04 16:14:07,168 INFO L182 omatonBuilderFactory]: Interpolants [39168#(<= main_~i~1 13), 39169#(<= main_~i~1 14), 39170#(<= main_~i~1 15), 39171#(<= main_~i~1 16), 39172#(<= main_~i~1 17), 39173#(<= main_~i~1 18), 39174#(<= main_~i~1 19), 39175#(<= main_~i~1 20), 39176#(<= main_~i~1 21), 39177#(<= main_~i~1 22), 39178#(<= main_~i~1 23), 39179#(<= main_~i~1 24), 39180#(<= main_~i~1 25), 39181#(<= main_~i~1 26), 39182#(<= main_~i~1 27), 39183#(<= main_~i~1 28), 39184#(<= main_~i~1 29), 39185#(<= main_~i~1 30), 39186#(<= main_~i~1 31), 39187#(<= main_~i~1 32), 39188#(<= main_~i~1 33), 39189#(<= main_~i~1 34), 39190#(<= main_~i~1 35), 39191#(<= main_~i~1 36), 39192#(<= main_~i~1 37), 39193#(<= main_~i~1 38), 39153#true, 39154#false, 39155#(= main_~i~1 0), 39156#(<= main_~i~1 1), 39157#(<= main_~i~1 2), 39158#(<= main_~i~1 3), 39159#(<= main_~i~1 4), 39160#(<= main_~i~1 5), 39161#(<= main_~i~1 6), 39162#(<= main_~i~1 7), 39163#(<= main_~i~1 8), 39164#(<= main_~i~1 9), 39165#(<= main_~i~1 10), 39166#(<= main_~i~1 11), 39167#(<= main_~i~1 12)] [2018-02-04 16:14:07,168 INFO L134 CoverageAnalysis]: Checked inductivity of 9291 backedges. 0 proven. 4997 refuted. 0 times theorem prover too weak. 4294 trivial. 0 not checked. [2018-02-04 16:14:07,168 INFO L409 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-02-04 16:14:07,168 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-02-04 16:14:07,169 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2018-02-04 16:14:07,169 INFO L87 Difference]: Start difference. First operand 777 states and 961 transitions. Second operand 41 states. [2018-02-04 16:14:07,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:14:07,559 INFO L93 Difference]: Finished difference Result 1010 states and 1165 transitions. [2018-02-04 16:14:07,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-02-04 16:14:07,559 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 519 [2018-02-04 16:14:07,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:14:07,561 INFO L225 Difference]: With dead ends: 1010 [2018-02-04 16:14:07,561 INFO L226 Difference]: Without dead ends: 1010 [2018-02-04 16:14:07,561 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2018-02-04 16:14:07,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1010 states. [2018-02-04 16:14:07,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1010 to 796. [2018-02-04 16:14:07,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 796 states. [2018-02-04 16:14:07,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 796 states to 796 states and 985 transitions. [2018-02-04 16:14:07,568 INFO L78 Accepts]: Start accepts. Automaton has 796 states and 985 transitions. Word has length 519 [2018-02-04 16:14:07,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:14:07,568 INFO L432 AbstractCegarLoop]: Abstraction has 796 states and 985 transitions. [2018-02-04 16:14:07,568 INFO L433 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-02-04 16:14:07,568 INFO L276 IsEmpty]: Start isEmpty. Operand 796 states and 985 transitions. [2018-02-04 16:14:07,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 533 [2018-02-04 16:14:07,570 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:14:07,570 INFO L351 BasicCegarLoop]: trace histogram [40, 40, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:14:07,571 INFO L371 AbstractCegarLoop]: === Iteration 51 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 16:14:07,571 INFO L82 PathProgramCache]: Analyzing trace with hash 1475767827, now seen corresponding path program 37 times [2018-02-04 16:14:07,571 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:14:07,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:14:07,592 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:14:08,473 INFO L134 CoverageAnalysis]: Checked inductivity of 9789 backedges. 0 proven. 5265 refuted. 0 times theorem prover too weak. 4524 trivial. 0 not checked. [2018-02-04 16:14:08,473 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:14:08,473 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2018-02-04 16:14:08,473 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:14:08,474 INFO L134 CoverageAnalysis]: Checked inductivity of 3888 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3888 trivial. 0 not checked. [2018-02-04 16:14:08,474 INFO L182 omatonBuilderFactory]: Interpolants [41024#(<= main_~i~1 22), 41025#(<= main_~i~1 23), 41026#(<= main_~i~1 24), 41027#(<= main_~i~1 25), 41028#(<= main_~i~1 26), 41029#(<= main_~i~1 27), 41030#(<= main_~i~1 28), 41031#(<= main_~i~1 29), 41032#(<= main_~i~1 30), 41033#(<= main_~i~1 31), 41034#(<= main_~i~1 32), 41035#(<= main_~i~1 33), 41036#(<= main_~i~1 34), 41037#(<= main_~i~1 35), 41038#(<= main_~i~1 36), 41039#(<= main_~i~1 37), 41040#(<= main_~i~1 38), 41041#(<= main_~i~1 39), 41000#true, 41001#false, 41002#(= main_~i~1 0), 41003#(<= main_~i~1 1), 41004#(<= main_~i~1 2), 41005#(<= main_~i~1 3), 41006#(<= main_~i~1 4), 41007#(<= main_~i~1 5), 41008#(<= main_~i~1 6), 41009#(<= main_~i~1 7), 41010#(<= main_~i~1 8), 41011#(<= main_~i~1 9), 41012#(<= main_~i~1 10), 41013#(<= main_~i~1 11), 41014#(<= main_~i~1 12), 41015#(<= main_~i~1 13), 41016#(<= main_~i~1 14), 41017#(<= main_~i~1 15), 41018#(<= main_~i~1 16), 41019#(<= main_~i~1 17), 41020#(<= main_~i~1 18), 41021#(<= main_~i~1 19), 41022#(<= main_~i~1 20), 41023#(<= main_~i~1 21)] [2018-02-04 16:14:08,474 INFO L134 CoverageAnalysis]: Checked inductivity of 9789 backedges. 0 proven. 5265 refuted. 0 times theorem prover too weak. 4524 trivial. 0 not checked. [2018-02-04 16:14:08,474 INFO L409 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-02-04 16:14:08,474 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-02-04 16:14:08,475 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-02-04 16:14:08,475 INFO L87 Difference]: Start difference. First operand 796 states and 985 transitions. Second operand 42 states. [2018-02-04 16:14:08,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:14:08,861 INFO L93 Difference]: Finished difference Result 1034 states and 1193 transitions. [2018-02-04 16:14:08,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-02-04 16:14:08,861 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 532 [2018-02-04 16:14:08,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:14:08,863 INFO L225 Difference]: With dead ends: 1034 [2018-02-04 16:14:08,864 INFO L226 Difference]: Without dead ends: 1034 [2018-02-04 16:14:08,864 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-02-04 16:14:08,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1034 states. [2018-02-04 16:14:08,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1034 to 815. [2018-02-04 16:14:08,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 815 states. [2018-02-04 16:14:08,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 815 states to 815 states and 1009 transitions. [2018-02-04 16:14:08,870 INFO L78 Accepts]: Start accepts. Automaton has 815 states and 1009 transitions. Word has length 532 [2018-02-04 16:14:08,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:14:08,871 INFO L432 AbstractCegarLoop]: Abstraction has 815 states and 1009 transitions. [2018-02-04 16:14:08,871 INFO L433 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-02-04 16:14:08,871 INFO L276 IsEmpty]: Start isEmpty. Operand 815 states and 1009 transitions. [2018-02-04 16:14:08,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 546 [2018-02-04 16:14:08,873 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:14:08,874 INFO L351 BasicCegarLoop]: trace histogram [41, 41, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:14:08,874 INFO L371 AbstractCegarLoop]: === Iteration 52 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 16:14:08,874 INFO L82 PathProgramCache]: Analyzing trace with hash 1005240804, now seen corresponding path program 38 times [2018-02-04 16:14:08,875 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:14:08,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:14:08,896 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:14:09,834 INFO L134 CoverageAnalysis]: Checked inductivity of 10300 backedges. 0 proven. 5540 refuted. 0 times theorem prover too weak. 4760 trivial. 0 not checked. [2018-02-04 16:14:09,834 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:14:09,834 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-02-04 16:14:09,834 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:14:09,835 INFO L134 CoverageAnalysis]: Checked inductivity of 4107 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4107 trivial. 0 not checked. [2018-02-04 16:14:09,835 INFO L182 omatonBuilderFactory]: Interpolants [42891#true, 42892#false, 42893#(= main_~i~1 0), 42894#(<= main_~i~1 1), 42895#(<= main_~i~1 2), 42896#(<= main_~i~1 3), 42897#(<= main_~i~1 4), 42898#(<= main_~i~1 5), 42899#(<= main_~i~1 6), 42900#(<= main_~i~1 7), 42901#(<= main_~i~1 8), 42902#(<= main_~i~1 9), 42903#(<= main_~i~1 10), 42904#(<= main_~i~1 11), 42905#(<= main_~i~1 12), 42906#(<= main_~i~1 13), 42907#(<= main_~i~1 14), 42908#(<= main_~i~1 15), 42909#(<= main_~i~1 16), 42910#(<= main_~i~1 17), 42911#(<= main_~i~1 18), 42912#(<= main_~i~1 19), 42913#(<= main_~i~1 20), 42914#(<= main_~i~1 21), 42915#(<= main_~i~1 22), 42916#(<= main_~i~1 23), 42917#(<= main_~i~1 24), 42918#(<= main_~i~1 25), 42919#(<= main_~i~1 26), 42920#(<= main_~i~1 27), 42921#(<= main_~i~1 28), 42922#(<= main_~i~1 29), 42923#(<= main_~i~1 30), 42924#(<= main_~i~1 31), 42925#(<= main_~i~1 32), 42926#(<= main_~i~1 33), 42927#(<= main_~i~1 34), 42928#(<= main_~i~1 35), 42929#(<= main_~i~1 36), 42930#(<= main_~i~1 37), 42931#(<= main_~i~1 38), 42932#(<= main_~i~1 39), 42933#(<= main_~i~1 40)] [2018-02-04 16:14:09,835 INFO L134 CoverageAnalysis]: Checked inductivity of 10300 backedges. 0 proven. 5540 refuted. 0 times theorem prover too weak. 4760 trivial. 0 not checked. [2018-02-04 16:14:09,835 INFO L409 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-02-04 16:14:09,835 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-02-04 16:14:09,835 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2018-02-04 16:14:09,836 INFO L87 Difference]: Start difference. First operand 815 states and 1009 transitions. Second operand 43 states. [2018-02-04 16:14:10,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:14:10,368 INFO L93 Difference]: Finished difference Result 1058 states and 1221 transitions. [2018-02-04 16:14:10,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-02-04 16:14:10,369 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 545 [2018-02-04 16:14:10,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:14:10,371 INFO L225 Difference]: With dead ends: 1058 [2018-02-04 16:14:10,371 INFO L226 Difference]: Without dead ends: 1058 [2018-02-04 16:14:10,372 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2018-02-04 16:14:10,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1058 states. [2018-02-04 16:14:10,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1058 to 834. [2018-02-04 16:14:10,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 834 states. [2018-02-04 16:14:10,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 834 states to 834 states and 1033 transitions. [2018-02-04 16:14:10,379 INFO L78 Accepts]: Start accepts. Automaton has 834 states and 1033 transitions. Word has length 545 [2018-02-04 16:14:10,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:14:10,380 INFO L432 AbstractCegarLoop]: Abstraction has 834 states and 1033 transitions. [2018-02-04 16:14:10,380 INFO L433 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-02-04 16:14:10,380 INFO L276 IsEmpty]: Start isEmpty. Operand 834 states and 1033 transitions. [2018-02-04 16:14:10,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 559 [2018-02-04 16:14:10,382 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:14:10,383 INFO L351 BasicCegarLoop]: trace histogram [42, 42, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:14:10,383 INFO L371 AbstractCegarLoop]: === Iteration 53 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 16:14:10,383 INFO L82 PathProgramCache]: Analyzing trace with hash -1293489741, now seen corresponding path program 39 times [2018-02-04 16:14:10,383 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:14:10,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:14:10,405 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:14:11,382 INFO L134 CoverageAnalysis]: Checked inductivity of 10824 backedges. 0 proven. 5822 refuted. 0 times theorem prover too weak. 5002 trivial. 0 not checked. [2018-02-04 16:14:11,382 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:14:11,409 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2018-02-04 16:14:11,409 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:14:11,409 INFO L134 CoverageAnalysis]: Checked inductivity of 4332 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4332 trivial. 0 not checked. [2018-02-04 16:14:11,409 INFO L182 omatonBuilderFactory]: Interpolants [44864#(<= main_~i~1 36), 44865#(<= main_~i~1 37), 44866#(<= main_~i~1 38), 44867#(<= main_~i~1 39), 44868#(<= main_~i~1 40), 44869#(<= main_~i~1 41), 44826#true, 44827#false, 44828#(= main_~i~1 0), 44829#(<= main_~i~1 1), 44830#(<= main_~i~1 2), 44831#(<= main_~i~1 3), 44832#(<= main_~i~1 4), 44833#(<= main_~i~1 5), 44834#(<= main_~i~1 6), 44835#(<= main_~i~1 7), 44836#(<= main_~i~1 8), 44837#(<= main_~i~1 9), 44838#(<= main_~i~1 10), 44839#(<= main_~i~1 11), 44840#(<= main_~i~1 12), 44841#(<= main_~i~1 13), 44842#(<= main_~i~1 14), 44843#(<= main_~i~1 15), 44844#(<= main_~i~1 16), 44845#(<= main_~i~1 17), 44846#(<= main_~i~1 18), 44847#(<= main_~i~1 19), 44848#(<= main_~i~1 20), 44849#(<= main_~i~1 21), 44850#(<= main_~i~1 22), 44851#(<= main_~i~1 23), 44852#(<= main_~i~1 24), 44853#(<= main_~i~1 25), 44854#(<= main_~i~1 26), 44855#(<= main_~i~1 27), 44856#(<= main_~i~1 28), 44857#(<= main_~i~1 29), 44858#(<= main_~i~1 30), 44859#(<= main_~i~1 31), 44860#(<= main_~i~1 32), 44861#(<= main_~i~1 33), 44862#(<= main_~i~1 34), 44863#(<= main_~i~1 35)] [2018-02-04 16:14:11,410 INFO L134 CoverageAnalysis]: Checked inductivity of 10824 backedges. 0 proven. 5822 refuted. 0 times theorem prover too weak. 5002 trivial. 0 not checked. [2018-02-04 16:14:11,410 INFO L409 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-02-04 16:14:11,410 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-02-04 16:14:11,410 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2018-02-04 16:14:11,410 INFO L87 Difference]: Start difference. First operand 834 states and 1033 transitions. Second operand 44 states. [2018-02-04 16:14:11,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:14:11,952 INFO L93 Difference]: Finished difference Result 1082 states and 1249 transitions. [2018-02-04 16:14:11,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-02-04 16:14:11,952 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 558 [2018-02-04 16:14:11,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:14:11,954 INFO L225 Difference]: With dead ends: 1082 [2018-02-04 16:14:11,954 INFO L226 Difference]: Without dead ends: 1082 [2018-02-04 16:14:11,954 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2018-02-04 16:14:11,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1082 states. [2018-02-04 16:14:11,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1082 to 853. [2018-02-04 16:14:11,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 853 states. [2018-02-04 16:14:11,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 853 states to 853 states and 1057 transitions. [2018-02-04 16:14:11,962 INFO L78 Accepts]: Start accepts. Automaton has 853 states and 1057 transitions. Word has length 558 [2018-02-04 16:14:11,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:14:11,962 INFO L432 AbstractCegarLoop]: Abstraction has 853 states and 1057 transitions. [2018-02-04 16:14:11,962 INFO L433 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-02-04 16:14:11,962 INFO L276 IsEmpty]: Start isEmpty. Operand 853 states and 1057 transitions. [2018-02-04 16:14:11,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 572 [2018-02-04 16:14:11,965 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:14:11,965 INFO L351 BasicCegarLoop]: trace histogram [43, 43, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:14:11,965 INFO L371 AbstractCegarLoop]: === Iteration 54 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 16:14:11,965 INFO L82 PathProgramCache]: Analyzing trace with hash -512218556, now seen corresponding path program 40 times [2018-02-04 16:14:11,965 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:14:11,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:14:11,988 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:14:13,006 INFO L134 CoverageAnalysis]: Checked inductivity of 11361 backedges. 0 proven. 6111 refuted. 0 times theorem prover too weak. 5250 trivial. 0 not checked. [2018-02-04 16:14:13,006 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:14:13,006 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2018-02-04 16:14:13,006 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:14:13,006 INFO L134 CoverageAnalysis]: Checked inductivity of 4563 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4563 trivial. 0 not checked. [2018-02-04 16:14:13,007 INFO L182 omatonBuilderFactory]: Interpolants [46848#(<= main_~i~1 41), 46849#(<= main_~i~1 42), 46805#true, 46806#false, 46807#(= main_~i~1 0), 46808#(<= main_~i~1 1), 46809#(<= main_~i~1 2), 46810#(<= main_~i~1 3), 46811#(<= main_~i~1 4), 46812#(<= main_~i~1 5), 46813#(<= main_~i~1 6), 46814#(<= main_~i~1 7), 46815#(<= main_~i~1 8), 46816#(<= main_~i~1 9), 46817#(<= main_~i~1 10), 46818#(<= main_~i~1 11), 46819#(<= main_~i~1 12), 46820#(<= main_~i~1 13), 46821#(<= main_~i~1 14), 46822#(<= main_~i~1 15), 46823#(<= main_~i~1 16), 46824#(<= main_~i~1 17), 46825#(<= main_~i~1 18), 46826#(<= main_~i~1 19), 46827#(<= main_~i~1 20), 46828#(<= main_~i~1 21), 46829#(<= main_~i~1 22), 46830#(<= main_~i~1 23), 46831#(<= main_~i~1 24), 46832#(<= main_~i~1 25), 46833#(<= main_~i~1 26), 46834#(<= main_~i~1 27), 46835#(<= main_~i~1 28), 46836#(<= main_~i~1 29), 46837#(<= main_~i~1 30), 46838#(<= main_~i~1 31), 46839#(<= main_~i~1 32), 46840#(<= main_~i~1 33), 46841#(<= main_~i~1 34), 46842#(<= main_~i~1 35), 46843#(<= main_~i~1 36), 46844#(<= main_~i~1 37), 46845#(<= main_~i~1 38), 46846#(<= main_~i~1 39), 46847#(<= main_~i~1 40)] [2018-02-04 16:14:13,007 INFO L134 CoverageAnalysis]: Checked inductivity of 11361 backedges. 0 proven. 6111 refuted. 0 times theorem prover too weak. 5250 trivial. 0 not checked. [2018-02-04 16:14:13,007 INFO L409 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-02-04 16:14:13,007 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-02-04 16:14:13,008 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2018-02-04 16:14:13,008 INFO L87 Difference]: Start difference. First operand 853 states and 1057 transitions. Second operand 45 states. [2018-02-04 16:14:13,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:14:13,589 INFO L93 Difference]: Finished difference Result 1106 states and 1277 transitions. [2018-02-04 16:14:13,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-02-04 16:14:13,589 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 571 [2018-02-04 16:14:13,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:14:13,592 INFO L225 Difference]: With dead ends: 1106 [2018-02-04 16:14:13,592 INFO L226 Difference]: Without dead ends: 1106 [2018-02-04 16:14:13,592 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2018-02-04 16:14:13,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1106 states. [2018-02-04 16:14:13,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1106 to 872. [2018-02-04 16:14:13,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 872 states. [2018-02-04 16:14:13,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 872 states to 872 states and 1081 transitions. [2018-02-04 16:14:13,601 INFO L78 Accepts]: Start accepts. Automaton has 872 states and 1081 transitions. Word has length 571 [2018-02-04 16:14:13,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:14:13,601 INFO L432 AbstractCegarLoop]: Abstraction has 872 states and 1081 transitions. [2018-02-04 16:14:13,602 INFO L433 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-02-04 16:14:13,602 INFO L276 IsEmpty]: Start isEmpty. Operand 872 states and 1081 transitions. [2018-02-04 16:14:13,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 585 [2018-02-04 16:14:13,604 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:14:13,605 INFO L351 BasicCegarLoop]: trace histogram [44, 44, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:14:13,605 INFO L371 AbstractCegarLoop]: === Iteration 55 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 16:14:13,605 INFO L82 PathProgramCache]: Analyzing trace with hash 126754131, now seen corresponding path program 41 times [2018-02-04 16:14:13,605 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:14:13,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:14:13,636 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:14:14,734 INFO L134 CoverageAnalysis]: Checked inductivity of 11911 backedges. 0 proven. 6407 refuted. 0 times theorem prover too weak. 5504 trivial. 0 not checked. [2018-02-04 16:14:14,735 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:14:14,735 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2018-02-04 16:14:14,735 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:14:14,735 INFO L134 CoverageAnalysis]: Checked inductivity of 4800 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4800 trivial. 0 not checked. [2018-02-04 16:14:14,735 INFO L182 omatonBuilderFactory]: Interpolants [48832#(<= main_~i~1 2), 48833#(<= main_~i~1 3), 48834#(<= main_~i~1 4), 48835#(<= main_~i~1 5), 48836#(<= main_~i~1 6), 48837#(<= main_~i~1 7), 48838#(<= main_~i~1 8), 48839#(<= main_~i~1 9), 48840#(<= main_~i~1 10), 48841#(<= main_~i~1 11), 48842#(<= main_~i~1 12), 48843#(<= main_~i~1 13), 48844#(<= main_~i~1 14), 48845#(<= main_~i~1 15), 48846#(<= main_~i~1 16), 48847#(<= main_~i~1 17), 48848#(<= main_~i~1 18), 48849#(<= main_~i~1 19), 48850#(<= main_~i~1 20), 48851#(<= main_~i~1 21), 48852#(<= main_~i~1 22), 48853#(<= main_~i~1 23), 48854#(<= main_~i~1 24), 48855#(<= main_~i~1 25), 48856#(<= main_~i~1 26), 48857#(<= main_~i~1 27), 48858#(<= main_~i~1 28), 48859#(<= main_~i~1 29), 48860#(<= main_~i~1 30), 48861#(<= main_~i~1 31), 48862#(<= main_~i~1 32), 48863#(<= main_~i~1 33), 48864#(<= main_~i~1 34), 48865#(<= main_~i~1 35), 48866#(<= main_~i~1 36), 48867#(<= main_~i~1 37), 48868#(<= main_~i~1 38), 48869#(<= main_~i~1 39), 48870#(<= main_~i~1 40), 48871#(<= main_~i~1 41), 48872#(<= main_~i~1 42), 48873#(<= main_~i~1 43), 48828#true, 48829#false, 48830#(= main_~i~1 0), 48831#(<= main_~i~1 1)] [2018-02-04 16:14:14,736 INFO L134 CoverageAnalysis]: Checked inductivity of 11911 backedges. 0 proven. 6407 refuted. 0 times theorem prover too weak. 5504 trivial. 0 not checked. [2018-02-04 16:14:14,736 INFO L409 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-02-04 16:14:14,736 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-02-04 16:14:14,736 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2018-02-04 16:14:14,736 INFO L87 Difference]: Start difference. First operand 872 states and 1081 transitions. Second operand 46 states. [2018-02-04 16:14:15,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:14:15,335 INFO L93 Difference]: Finished difference Result 1130 states and 1305 transitions. [2018-02-04 16:14:15,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-02-04 16:14:15,335 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 584 [2018-02-04 16:14:15,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:14:15,338 INFO L225 Difference]: With dead ends: 1130 [2018-02-04 16:14:15,338 INFO L226 Difference]: Without dead ends: 1130 [2018-02-04 16:14:15,338 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2018-02-04 16:14:15,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1130 states. [2018-02-04 16:14:15,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1130 to 891. [2018-02-04 16:14:15,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 891 states. [2018-02-04 16:14:15,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 891 states to 891 states and 1105 transitions. [2018-02-04 16:14:15,345 INFO L78 Accepts]: Start accepts. Automaton has 891 states and 1105 transitions. Word has length 584 [2018-02-04 16:14:15,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:14:15,345 INFO L432 AbstractCegarLoop]: Abstraction has 891 states and 1105 transitions. [2018-02-04 16:14:15,345 INFO L433 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-02-04 16:14:15,345 INFO L276 IsEmpty]: Start isEmpty. Operand 891 states and 1105 transitions. [2018-02-04 16:14:15,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 598 [2018-02-04 16:14:15,348 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:14:15,348 INFO L351 BasicCegarLoop]: trace histogram [45, 45, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:14:15,348 INFO L371 AbstractCegarLoop]: === Iteration 56 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 16:14:15,348 INFO L82 PathProgramCache]: Analyzing trace with hash -302392668, now seen corresponding path program 42 times [2018-02-04 16:14:15,349 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:14:15,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:14:15,376 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:14:16,544 INFO L134 CoverageAnalysis]: Checked inductivity of 12474 backedges. 0 proven. 6710 refuted. 0 times theorem prover too weak. 5764 trivial. 0 not checked. [2018-02-04 16:14:16,544 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:14:16,544 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2018-02-04 16:14:16,544 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:14:16,544 INFO L134 CoverageAnalysis]: Checked inductivity of 5043 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5043 trivial. 0 not checked. [2018-02-04 16:14:16,545 INFO L182 omatonBuilderFactory]: Interpolants [50895#true, 50896#false, 50897#(= main_~i~1 0), 50898#(<= main_~i~1 1), 50899#(<= main_~i~1 2), 50900#(<= main_~i~1 3), 50901#(<= main_~i~1 4), 50902#(<= main_~i~1 5), 50903#(<= main_~i~1 6), 50904#(<= main_~i~1 7), 50905#(<= main_~i~1 8), 50906#(<= main_~i~1 9), 50907#(<= main_~i~1 10), 50908#(<= main_~i~1 11), 50909#(<= main_~i~1 12), 50910#(<= main_~i~1 13), 50911#(<= main_~i~1 14), 50912#(<= main_~i~1 15), 50913#(<= main_~i~1 16), 50914#(<= main_~i~1 17), 50915#(<= main_~i~1 18), 50916#(<= main_~i~1 19), 50917#(<= main_~i~1 20), 50918#(<= main_~i~1 21), 50919#(<= main_~i~1 22), 50920#(<= main_~i~1 23), 50921#(<= main_~i~1 24), 50922#(<= main_~i~1 25), 50923#(<= main_~i~1 26), 50924#(<= main_~i~1 27), 50925#(<= main_~i~1 28), 50926#(<= main_~i~1 29), 50927#(<= main_~i~1 30), 50928#(<= main_~i~1 31), 50929#(<= main_~i~1 32), 50930#(<= main_~i~1 33), 50931#(<= main_~i~1 34), 50932#(<= main_~i~1 35), 50933#(<= main_~i~1 36), 50934#(<= main_~i~1 37), 50935#(<= main_~i~1 38), 50936#(<= main_~i~1 39), 50937#(<= main_~i~1 40), 50938#(<= main_~i~1 41), 50939#(<= main_~i~1 42), 50940#(<= main_~i~1 43), 50941#(<= main_~i~1 44)] [2018-02-04 16:14:16,545 INFO L134 CoverageAnalysis]: Checked inductivity of 12474 backedges. 0 proven. 6710 refuted. 0 times theorem prover too weak. 5764 trivial. 0 not checked. [2018-02-04 16:14:16,545 INFO L409 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-02-04 16:14:16,545 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-02-04 16:14:16,545 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2018-02-04 16:14:16,545 INFO L87 Difference]: Start difference. First operand 891 states and 1105 transitions. Second operand 47 states. [2018-02-04 16:14:17,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:14:17,219 INFO L93 Difference]: Finished difference Result 1154 states and 1333 transitions. [2018-02-04 16:14:17,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-02-04 16:14:17,220 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 597 [2018-02-04 16:14:17,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:14:17,223 INFO L225 Difference]: With dead ends: 1154 [2018-02-04 16:14:17,223 INFO L226 Difference]: Without dead ends: 1154 [2018-02-04 16:14:17,224 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2018-02-04 16:14:17,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1154 states. [2018-02-04 16:14:17,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1154 to 910. [2018-02-04 16:14:17,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 910 states. [2018-02-04 16:14:17,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 910 states to 910 states and 1129 transitions. [2018-02-04 16:14:17,235 INFO L78 Accepts]: Start accepts. Automaton has 910 states and 1129 transitions. Word has length 597 [2018-02-04 16:14:17,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:14:17,235 INFO L432 AbstractCegarLoop]: Abstraction has 910 states and 1129 transitions. [2018-02-04 16:14:17,235 INFO L433 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-02-04 16:14:17,235 INFO L276 IsEmpty]: Start isEmpty. Operand 910 states and 1129 transitions. [2018-02-04 16:14:17,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 611 [2018-02-04 16:14:17,238 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:14:17,238 INFO L351 BasicCegarLoop]: trace histogram [46, 46, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:14:17,238 INFO L371 AbstractCegarLoop]: === Iteration 57 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 16:14:17,238 INFO L82 PathProgramCache]: Analyzing trace with hash 1115031795, now seen corresponding path program 43 times [2018-02-04 16:14:17,239 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:14:17,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:14:17,264 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:14:18,467 INFO L134 CoverageAnalysis]: Checked inductivity of 13050 backedges. 0 proven. 7020 refuted. 0 times theorem prover too weak. 6030 trivial. 0 not checked. [2018-02-04 16:14:18,467 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:14:18,467 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2018-02-04 16:14:18,467 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:14:18,468 INFO L134 CoverageAnalysis]: Checked inductivity of 5292 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5292 trivial. 0 not checked. [2018-02-04 16:14:18,468 INFO L182 omatonBuilderFactory]: Interpolants [53006#true, 53007#false, 53008#(= main_~i~1 0), 53009#(<= main_~i~1 1), 53010#(<= main_~i~1 2), 53011#(<= main_~i~1 3), 53012#(<= main_~i~1 4), 53013#(<= main_~i~1 5), 53014#(<= main_~i~1 6), 53015#(<= main_~i~1 7), 53016#(<= main_~i~1 8), 53017#(<= main_~i~1 9), 53018#(<= main_~i~1 10), 53019#(<= main_~i~1 11), 53020#(<= main_~i~1 12), 53021#(<= main_~i~1 13), 53022#(<= main_~i~1 14), 53023#(<= main_~i~1 15), 53024#(<= main_~i~1 16), 53025#(<= main_~i~1 17), 53026#(<= main_~i~1 18), 53027#(<= main_~i~1 19), 53028#(<= main_~i~1 20), 53029#(<= main_~i~1 21), 53030#(<= main_~i~1 22), 53031#(<= main_~i~1 23), 53032#(<= main_~i~1 24), 53033#(<= main_~i~1 25), 53034#(<= main_~i~1 26), 53035#(<= main_~i~1 27), 53036#(<= main_~i~1 28), 53037#(<= main_~i~1 29), 53038#(<= main_~i~1 30), 53039#(<= main_~i~1 31), 53040#(<= main_~i~1 32), 53041#(<= main_~i~1 33), 53042#(<= main_~i~1 34), 53043#(<= main_~i~1 35), 53044#(<= main_~i~1 36), 53045#(<= main_~i~1 37), 53046#(<= main_~i~1 38), 53047#(<= main_~i~1 39), 53048#(<= main_~i~1 40), 53049#(<= main_~i~1 41), 53050#(<= main_~i~1 42), 53051#(<= main_~i~1 43), 53052#(<= main_~i~1 44), 53053#(<= main_~i~1 45)] [2018-02-04 16:14:18,468 INFO L134 CoverageAnalysis]: Checked inductivity of 13050 backedges. 0 proven. 7020 refuted. 0 times theorem prover too weak. 6030 trivial. 0 not checked. [2018-02-04 16:14:18,468 INFO L409 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-02-04 16:14:18,468 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-02-04 16:14:18,469 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2018-02-04 16:14:18,469 INFO L87 Difference]: Start difference. First operand 910 states and 1129 transitions. Second operand 48 states. [2018-02-04 16:14:19,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:14:19,162 INFO L93 Difference]: Finished difference Result 1178 states and 1361 transitions. [2018-02-04 16:14:19,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-02-04 16:14:19,162 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 610 [2018-02-04 16:14:19,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:14:19,166 INFO L225 Difference]: With dead ends: 1178 [2018-02-04 16:14:19,166 INFO L226 Difference]: Without dead ends: 1178 [2018-02-04 16:14:19,166 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2018-02-04 16:14:19,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1178 states. [2018-02-04 16:14:19,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1178 to 929. [2018-02-04 16:14:19,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 929 states. [2018-02-04 16:14:19,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 929 states to 929 states and 1153 transitions. [2018-02-04 16:14:19,177 INFO L78 Accepts]: Start accepts. Automaton has 929 states and 1153 transitions. Word has length 610 [2018-02-04 16:14:19,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:14:19,177 INFO L432 AbstractCegarLoop]: Abstraction has 929 states and 1153 transitions. [2018-02-04 16:14:19,177 INFO L433 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-02-04 16:14:19,177 INFO L276 IsEmpty]: Start isEmpty. Operand 929 states and 1153 transitions. [2018-02-04 16:14:19,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 624 [2018-02-04 16:14:19,180 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:14:19,180 INFO L351 BasicCegarLoop]: trace histogram [47, 47, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:14:19,180 INFO L371 AbstractCegarLoop]: === Iteration 58 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 16:14:19,180 INFO L82 PathProgramCache]: Analyzing trace with hash -1524247804, now seen corresponding path program 44 times [2018-02-04 16:14:19,181 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:14:19,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:14:19,206 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:14:20,476 INFO L134 CoverageAnalysis]: Checked inductivity of 13639 backedges. 0 proven. 7337 refuted. 0 times theorem prover too weak. 6302 trivial. 0 not checked. [2018-02-04 16:14:20,476 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:14:20,477 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2018-02-04 16:14:20,477 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:14:20,477 INFO L134 CoverageAnalysis]: Checked inductivity of 5547 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5547 trivial. 0 not checked. [2018-02-04 16:14:20,477 INFO L182 omatonBuilderFactory]: Interpolants [55168#(<= main_~i~1 5), 55169#(<= main_~i~1 6), 55170#(<= main_~i~1 7), 55171#(<= main_~i~1 8), 55172#(<= main_~i~1 9), 55173#(<= main_~i~1 10), 55174#(<= main_~i~1 11), 55175#(<= main_~i~1 12), 55176#(<= main_~i~1 13), 55177#(<= main_~i~1 14), 55178#(<= main_~i~1 15), 55179#(<= main_~i~1 16), 55180#(<= main_~i~1 17), 55181#(<= main_~i~1 18), 55182#(<= main_~i~1 19), 55183#(<= main_~i~1 20), 55184#(<= main_~i~1 21), 55185#(<= main_~i~1 22), 55186#(<= main_~i~1 23), 55187#(<= main_~i~1 24), 55188#(<= main_~i~1 25), 55189#(<= main_~i~1 26), 55190#(<= main_~i~1 27), 55191#(<= main_~i~1 28), 55192#(<= main_~i~1 29), 55193#(<= main_~i~1 30), 55194#(<= main_~i~1 31), 55195#(<= main_~i~1 32), 55196#(<= main_~i~1 33), 55197#(<= main_~i~1 34), 55198#(<= main_~i~1 35), 55199#(<= main_~i~1 36), 55200#(<= main_~i~1 37), 55201#(<= main_~i~1 38), 55202#(<= main_~i~1 39), 55203#(<= main_~i~1 40), 55204#(<= main_~i~1 41), 55205#(<= main_~i~1 42), 55206#(<= main_~i~1 43), 55207#(<= main_~i~1 44), 55208#(<= main_~i~1 45), 55209#(<= main_~i~1 46), 55161#true, 55162#false, 55163#(= main_~i~1 0), 55164#(<= main_~i~1 1), 55165#(<= main_~i~1 2), 55166#(<= main_~i~1 3), 55167#(<= main_~i~1 4)] [2018-02-04 16:14:20,477 INFO L134 CoverageAnalysis]: Checked inductivity of 13639 backedges. 0 proven. 7337 refuted. 0 times theorem prover too weak. 6302 trivial. 0 not checked. [2018-02-04 16:14:20,477 INFO L409 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-02-04 16:14:20,478 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-02-04 16:14:20,478 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2018-02-04 16:14:20,478 INFO L87 Difference]: Start difference. First operand 929 states and 1153 transitions. Second operand 49 states. [2018-02-04 16:14:21,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:14:21,112 INFO L93 Difference]: Finished difference Result 1202 states and 1389 transitions. [2018-02-04 16:14:21,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-02-04 16:14:21,112 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 623 [2018-02-04 16:14:21,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:14:21,114 INFO L225 Difference]: With dead ends: 1202 [2018-02-04 16:14:21,114 INFO L226 Difference]: Without dead ends: 1202 [2018-02-04 16:14:21,114 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2018-02-04 16:14:21,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1202 states. [2018-02-04 16:14:21,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1202 to 948. [2018-02-04 16:14:21,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 948 states. [2018-02-04 16:14:21,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 948 states to 948 states and 1177 transitions. [2018-02-04 16:14:21,122 INFO L78 Accepts]: Start accepts. Automaton has 948 states and 1177 transitions. Word has length 623 [2018-02-04 16:14:21,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:14:21,122 INFO L432 AbstractCegarLoop]: Abstraction has 948 states and 1177 transitions. [2018-02-04 16:14:21,122 INFO L433 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-02-04 16:14:21,123 INFO L276 IsEmpty]: Start isEmpty. Operand 948 states and 1177 transitions. [2018-02-04 16:14:21,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 637 [2018-02-04 16:14:21,125 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:14:21,125 INFO L351 BasicCegarLoop]: trace histogram [48, 48, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:14:21,126 INFO L371 AbstractCegarLoop]: === Iteration 59 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 16:14:21,126 INFO L82 PathProgramCache]: Analyzing trace with hash 1470672019, now seen corresponding path program 45 times [2018-02-04 16:14:21,126 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:14:21,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:14:21,153 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:14:22,515 INFO L134 CoverageAnalysis]: Checked inductivity of 14241 backedges. 0 proven. 7661 refuted. 0 times theorem prover too weak. 6580 trivial. 0 not checked. [2018-02-04 16:14:22,516 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:14:22,683 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2018-02-04 16:14:22,683 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:14:22,684 INFO L134 CoverageAnalysis]: Checked inductivity of 5808 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5808 trivial. 0 not checked. [2018-02-04 16:14:22,684 INFO L182 omatonBuilderFactory]: Interpolants [57360#true, 57361#false, 57362#(= main_~i~1 0), 57363#(<= main_~i~1 1), 57364#(<= main_~i~1 2), 57365#(<= main_~i~1 3), 57366#(<= main_~i~1 4), 57367#(<= main_~i~1 5), 57368#(<= main_~i~1 6), 57369#(<= main_~i~1 7), 57370#(<= main_~i~1 8), 57371#(<= main_~i~1 9), 57372#(<= main_~i~1 10), 57373#(<= main_~i~1 11), 57374#(<= main_~i~1 12), 57375#(<= main_~i~1 13), 57376#(<= main_~i~1 14), 57377#(<= main_~i~1 15), 57378#(<= main_~i~1 16), 57379#(<= main_~i~1 17), 57380#(<= main_~i~1 18), 57381#(<= main_~i~1 19), 57382#(<= main_~i~1 20), 57383#(<= main_~i~1 21), 57384#(<= main_~i~1 22), 57385#(<= main_~i~1 23), 57386#(<= main_~i~1 24), 57387#(<= main_~i~1 25), 57388#(<= main_~i~1 26), 57389#(<= main_~i~1 27), 57390#(<= main_~i~1 28), 57391#(<= main_~i~1 29), 57392#(<= main_~i~1 30), 57393#(<= main_~i~1 31), 57394#(<= main_~i~1 32), 57395#(<= main_~i~1 33), 57396#(<= main_~i~1 34), 57397#(<= main_~i~1 35), 57398#(<= main_~i~1 36), 57399#(<= main_~i~1 37), 57400#(<= main_~i~1 38), 57401#(<= main_~i~1 39), 57402#(<= main_~i~1 40), 57403#(<= main_~i~1 41), 57404#(<= main_~i~1 42), 57405#(<= main_~i~1 43), 57406#(<= main_~i~1 44), 57407#(<= main_~i~1 45), 57408#(<= main_~i~1 46), 57409#(<= main_~i~1 47)] [2018-02-04 16:14:22,684 INFO L134 CoverageAnalysis]: Checked inductivity of 14241 backedges. 0 proven. 7661 refuted. 0 times theorem prover too weak. 6580 trivial. 0 not checked. [2018-02-04 16:14:22,685 INFO L409 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-02-04 16:14:22,685 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-02-04 16:14:22,685 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2018-02-04 16:14:22,685 INFO L87 Difference]: Start difference. First operand 948 states and 1177 transitions. Second operand 50 states. [2018-02-04 16:14:23,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:14:23,419 INFO L93 Difference]: Finished difference Result 1226 states and 1417 transitions. [2018-02-04 16:14:23,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-02-04 16:14:23,419 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 636 [2018-02-04 16:14:23,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:14:23,421 INFO L225 Difference]: With dead ends: 1226 [2018-02-04 16:14:23,422 INFO L226 Difference]: Without dead ends: 1226 [2018-02-04 16:14:23,422 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2018-02-04 16:14:23,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1226 states. [2018-02-04 16:14:23,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1226 to 967. [2018-02-04 16:14:23,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 967 states. [2018-02-04 16:14:23,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 967 states to 967 states and 1201 transitions. [2018-02-04 16:14:23,429 INFO L78 Accepts]: Start accepts. Automaton has 967 states and 1201 transitions. Word has length 636 [2018-02-04 16:14:23,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:14:23,429 INFO L432 AbstractCegarLoop]: Abstraction has 967 states and 1201 transitions. [2018-02-04 16:14:23,429 INFO L433 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-02-04 16:14:23,430 INFO L276 IsEmpty]: Start isEmpty. Operand 967 states and 1201 transitions. [2018-02-04 16:14:23,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 650 [2018-02-04 16:14:23,432 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:14:23,433 INFO L351 BasicCegarLoop]: trace histogram [49, 49, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:14:23,433 INFO L371 AbstractCegarLoop]: === Iteration 60 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 16:14:23,433 INFO L82 PathProgramCache]: Analyzing trace with hash 1932661604, now seen corresponding path program 46 times [2018-02-04 16:14:23,433 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:14:23,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:14:23,465 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:14:24,864 INFO L134 CoverageAnalysis]: Checked inductivity of 14856 backedges. 0 proven. 7992 refuted. 0 times theorem prover too weak. 6864 trivial. 0 not checked. [2018-02-04 16:14:24,864 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:14:24,864 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2018-02-04 16:14:24,864 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:14:24,865 INFO L134 CoverageAnalysis]: Checked inductivity of 6075 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6075 trivial. 0 not checked. [2018-02-04 16:14:24,865 INFO L182 omatonBuilderFactory]: Interpolants [59648#(<= main_~i~1 43), 59649#(<= main_~i~1 44), 59650#(<= main_~i~1 45), 59651#(<= main_~i~1 46), 59652#(<= main_~i~1 47), 59653#(<= main_~i~1 48), 59603#true, 59604#false, 59605#(= main_~i~1 0), 59606#(<= main_~i~1 1), 59607#(<= main_~i~1 2), 59608#(<= main_~i~1 3), 59609#(<= main_~i~1 4), 59610#(<= main_~i~1 5), 59611#(<= main_~i~1 6), 59612#(<= main_~i~1 7), 59613#(<= main_~i~1 8), 59614#(<= main_~i~1 9), 59615#(<= main_~i~1 10), 59616#(<= main_~i~1 11), 59617#(<= main_~i~1 12), 59618#(<= main_~i~1 13), 59619#(<= main_~i~1 14), 59620#(<= main_~i~1 15), 59621#(<= main_~i~1 16), 59622#(<= main_~i~1 17), 59623#(<= main_~i~1 18), 59624#(<= main_~i~1 19), 59625#(<= main_~i~1 20), 59626#(<= main_~i~1 21), 59627#(<= main_~i~1 22), 59628#(<= main_~i~1 23), 59629#(<= main_~i~1 24), 59630#(<= main_~i~1 25), 59631#(<= main_~i~1 26), 59632#(<= main_~i~1 27), 59633#(<= main_~i~1 28), 59634#(<= main_~i~1 29), 59635#(<= main_~i~1 30), 59636#(<= main_~i~1 31), 59637#(<= main_~i~1 32), 59638#(<= main_~i~1 33), 59639#(<= main_~i~1 34), 59640#(<= main_~i~1 35), 59641#(<= main_~i~1 36), 59642#(<= main_~i~1 37), 59643#(<= main_~i~1 38), 59644#(<= main_~i~1 39), 59645#(<= main_~i~1 40), 59646#(<= main_~i~1 41), 59647#(<= main_~i~1 42)] [2018-02-04 16:14:24,865 INFO L134 CoverageAnalysis]: Checked inductivity of 14856 backedges. 0 proven. 7992 refuted. 0 times theorem prover too weak. 6864 trivial. 0 not checked. [2018-02-04 16:14:24,865 INFO L409 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-02-04 16:14:24,866 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-02-04 16:14:24,866 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2018-02-04 16:14:24,866 INFO L87 Difference]: Start difference. First operand 967 states and 1201 transitions. Second operand 51 states. [2018-02-04 16:14:25,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:14:25,583 INFO L93 Difference]: Finished difference Result 1250 states and 1445 transitions. [2018-02-04 16:14:25,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-02-04 16:14:25,583 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 649 [2018-02-04 16:14:25,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:14:25,585 INFO L225 Difference]: With dead ends: 1250 [2018-02-04 16:14:25,585 INFO L226 Difference]: Without dead ends: 1250 [2018-02-04 16:14:25,585 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2018-02-04 16:14:25,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1250 states. [2018-02-04 16:14:25,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1250 to 986. [2018-02-04 16:14:25,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 986 states. [2018-02-04 16:14:25,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 986 states to 986 states and 1225 transitions. [2018-02-04 16:14:25,592 INFO L78 Accepts]: Start accepts. Automaton has 986 states and 1225 transitions. Word has length 649 [2018-02-04 16:14:25,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:14:25,592 INFO L432 AbstractCegarLoop]: Abstraction has 986 states and 1225 transitions. [2018-02-04 16:14:25,592 INFO L433 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-02-04 16:14:25,592 INFO L276 IsEmpty]: Start isEmpty. Operand 986 states and 1225 transitions. [2018-02-04 16:14:25,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 663 [2018-02-04 16:14:25,595 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:14:25,595 INFO L351 BasicCegarLoop]: trace histogram [50, 50, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:14:25,596 INFO L371 AbstractCegarLoop]: === Iteration 61 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 16:14:25,596 INFO L82 PathProgramCache]: Analyzing trace with hash -491780045, now seen corresponding path program 47 times [2018-02-04 16:14:25,596 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:14:25,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:14:25,623 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:14:27,067 INFO L134 CoverageAnalysis]: Checked inductivity of 15484 backedges. 0 proven. 8330 refuted. 0 times theorem prover too weak. 7154 trivial. 0 not checked. [2018-02-04 16:14:27,068 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:14:27,068 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2018-02-04 16:14:27,068 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:14:27,068 INFO L134 CoverageAnalysis]: Checked inductivity of 6348 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6348 trivial. 0 not checked. [2018-02-04 16:14:27,068 INFO L182 omatonBuilderFactory]: Interpolants [61890#true, 61891#false, 61892#(= main_~i~1 0), 61893#(<= main_~i~1 1), 61894#(<= main_~i~1 2), 61895#(<= main_~i~1 3), 61896#(<= main_~i~1 4), 61897#(<= main_~i~1 5), 61898#(<= main_~i~1 6), 61899#(<= main_~i~1 7), 61900#(<= main_~i~1 8), 61901#(<= main_~i~1 9), 61902#(<= main_~i~1 10), 61903#(<= main_~i~1 11), 61904#(<= main_~i~1 12), 61905#(<= main_~i~1 13), 61906#(<= main_~i~1 14), 61907#(<= main_~i~1 15), 61908#(<= main_~i~1 16), 61909#(<= main_~i~1 17), 61910#(<= main_~i~1 18), 61911#(<= main_~i~1 19), 61912#(<= main_~i~1 20), 61913#(<= main_~i~1 21), 61914#(<= main_~i~1 22), 61915#(<= main_~i~1 23), 61916#(<= main_~i~1 24), 61917#(<= main_~i~1 25), 61918#(<= main_~i~1 26), 61919#(<= main_~i~1 27), 61920#(<= main_~i~1 28), 61921#(<= main_~i~1 29), 61922#(<= main_~i~1 30), 61923#(<= main_~i~1 31), 61924#(<= main_~i~1 32), 61925#(<= main_~i~1 33), 61926#(<= main_~i~1 34), 61927#(<= main_~i~1 35), 61928#(<= main_~i~1 36), 61929#(<= main_~i~1 37), 61930#(<= main_~i~1 38), 61931#(<= main_~i~1 39), 61932#(<= main_~i~1 40), 61933#(<= main_~i~1 41), 61934#(<= main_~i~1 42), 61935#(<= main_~i~1 43), 61936#(<= main_~i~1 44), 61937#(<= main_~i~1 45), 61938#(<= main_~i~1 46), 61939#(<= main_~i~1 47), 61940#(<= main_~i~1 48), 61941#(<= main_~i~1 49)] [2018-02-04 16:14:27,069 INFO L134 CoverageAnalysis]: Checked inductivity of 15484 backedges. 0 proven. 8330 refuted. 0 times theorem prover too weak. 7154 trivial. 0 not checked. [2018-02-04 16:14:27,069 INFO L409 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-02-04 16:14:27,069 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-02-04 16:14:27,069 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-02-04 16:14:27,069 INFO L87 Difference]: Start difference. First operand 986 states and 1225 transitions. Second operand 52 states. [2018-02-04 16:14:27,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:14:27,922 INFO L93 Difference]: Finished difference Result 1274 states and 1473 transitions. [2018-02-04 16:14:28,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-02-04 16:14:28,050 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 662 [2018-02-04 16:14:28,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:14:28,052 INFO L225 Difference]: With dead ends: 1274 [2018-02-04 16:14:28,053 INFO L226 Difference]: Without dead ends: 1274 [2018-02-04 16:14:28,053 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-02-04 16:14:28,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1274 states. [2018-02-04 16:14:28,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1274 to 1005. [2018-02-04 16:14:28,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1005 states. [2018-02-04 16:14:28,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1005 states to 1005 states and 1249 transitions. [2018-02-04 16:14:28,061 INFO L78 Accepts]: Start accepts. Automaton has 1005 states and 1249 transitions. Word has length 662 [2018-02-04 16:14:28,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:14:28,061 INFO L432 AbstractCegarLoop]: Abstraction has 1005 states and 1249 transitions. [2018-02-04 16:14:28,061 INFO L433 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-02-04 16:14:28,062 INFO L276 IsEmpty]: Start isEmpty. Operand 1005 states and 1249 transitions. [2018-02-04 16:14:28,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 676 [2018-02-04 16:14:28,065 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:14:28,065 INFO L351 BasicCegarLoop]: trace histogram [51, 51, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:14:28,065 INFO L371 AbstractCegarLoop]: === Iteration 62 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 16:14:28,065 INFO L82 PathProgramCache]: Analyzing trace with hash 1289001924, now seen corresponding path program 48 times [2018-02-04 16:14:28,066 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:14:28,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:14:28,096 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:14:29,606 INFO L134 CoverageAnalysis]: Checked inductivity of 16125 backedges. 0 proven. 8675 refuted. 0 times theorem prover too weak. 7450 trivial. 0 not checked. [2018-02-04 16:14:29,606 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:14:29,606 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2018-02-04 16:14:29,606 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:14:29,607 INFO L134 CoverageAnalysis]: Checked inductivity of 6627 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6627 trivial. 0 not checked. [2018-02-04 16:14:29,607 INFO L182 omatonBuilderFactory]: Interpolants [64256#(<= main_~i~1 33), 64257#(<= main_~i~1 34), 64258#(<= main_~i~1 35), 64259#(<= main_~i~1 36), 64260#(<= main_~i~1 37), 64261#(<= main_~i~1 38), 64262#(<= main_~i~1 39), 64263#(<= main_~i~1 40), 64264#(<= main_~i~1 41), 64265#(<= main_~i~1 42), 64266#(<= main_~i~1 43), 64267#(<= main_~i~1 44), 64268#(<= main_~i~1 45), 64269#(<= main_~i~1 46), 64270#(<= main_~i~1 47), 64271#(<= main_~i~1 48), 64272#(<= main_~i~1 49), 64273#(<= main_~i~1 50), 64221#true, 64222#false, 64223#(= main_~i~1 0), 64224#(<= main_~i~1 1), 64225#(<= main_~i~1 2), 64226#(<= main_~i~1 3), 64227#(<= main_~i~1 4), 64228#(<= main_~i~1 5), 64229#(<= main_~i~1 6), 64230#(<= main_~i~1 7), 64231#(<= main_~i~1 8), 64232#(<= main_~i~1 9), 64233#(<= main_~i~1 10), 64234#(<= main_~i~1 11), 64235#(<= main_~i~1 12), 64236#(<= main_~i~1 13), 64237#(<= main_~i~1 14), 64238#(<= main_~i~1 15), 64239#(<= main_~i~1 16), 64240#(<= main_~i~1 17), 64241#(<= main_~i~1 18), 64242#(<= main_~i~1 19), 64243#(<= main_~i~1 20), 64244#(<= main_~i~1 21), 64245#(<= main_~i~1 22), 64246#(<= main_~i~1 23), 64247#(<= main_~i~1 24), 64248#(<= main_~i~1 25), 64249#(<= main_~i~1 26), 64250#(<= main_~i~1 27), 64251#(<= main_~i~1 28), 64252#(<= main_~i~1 29), 64253#(<= main_~i~1 30), 64254#(<= main_~i~1 31), 64255#(<= main_~i~1 32)] [2018-02-04 16:14:29,608 INFO L134 CoverageAnalysis]: Checked inductivity of 16125 backedges. 0 proven. 8675 refuted. 0 times theorem prover too weak. 7450 trivial. 0 not checked. [2018-02-04 16:14:29,608 INFO L409 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-02-04 16:14:29,608 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-02-04 16:14:29,608 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2018-02-04 16:14:29,608 INFO L87 Difference]: Start difference. First operand 1005 states and 1249 transitions. Second operand 53 states. [2018-02-04 16:14:30,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:14:30,254 INFO L93 Difference]: Finished difference Result 1298 states and 1501 transitions. [2018-02-04 16:14:30,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-02-04 16:14:30,254 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 675 [2018-02-04 16:14:30,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:14:30,257 INFO L225 Difference]: With dead ends: 1298 [2018-02-04 16:14:30,257 INFO L226 Difference]: Without dead ends: 1298 [2018-02-04 16:14:30,258 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2018-02-04 16:14:30,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1298 states. [2018-02-04 16:14:30,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1298 to 1024. [2018-02-04 16:14:30,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1024 states. [2018-02-04 16:14:30,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1024 states to 1024 states and 1273 transitions. [2018-02-04 16:14:30,272 INFO L78 Accepts]: Start accepts. Automaton has 1024 states and 1273 transitions. Word has length 675 [2018-02-04 16:14:30,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:14:30,272 INFO L432 AbstractCegarLoop]: Abstraction has 1024 states and 1273 transitions. [2018-02-04 16:14:30,272 INFO L433 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-02-04 16:14:30,272 INFO L276 IsEmpty]: Start isEmpty. Operand 1024 states and 1273 transitions. [2018-02-04 16:14:30,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 689 [2018-02-04 16:14:30,278 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:14:30,278 INFO L351 BasicCegarLoop]: trace histogram [52, 52, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:14:30,278 INFO L371 AbstractCegarLoop]: === Iteration 63 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 16:14:30,278 INFO L82 PathProgramCache]: Analyzing trace with hash -963241005, now seen corresponding path program 49 times [2018-02-04 16:14:30,279 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:14:30,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:14:30,329 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:14:32,009 INFO L134 CoverageAnalysis]: Checked inductivity of 16779 backedges. 0 proven. 9027 refuted. 0 times theorem prover too weak. 7752 trivial. 0 not checked. [2018-02-04 16:14:32,010 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:14:32,010 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2018-02-04 16:14:32,010 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:14:32,010 INFO L134 CoverageAnalysis]: Checked inductivity of 6912 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6912 trivial. 0 not checked. [2018-02-04 16:14:32,010 INFO L182 omatonBuilderFactory]: Interpolants [66597#false, 66596#true, 66599#(<= main_~i~1 1), 66598#(= main_~i~1 0), 66601#(<= main_~i~1 3), 66600#(<= main_~i~1 2), 66603#(<= main_~i~1 5), 66602#(<= main_~i~1 4), 66605#(<= main_~i~1 7), 66604#(<= main_~i~1 6), 66607#(<= main_~i~1 9), 66606#(<= main_~i~1 8), 66609#(<= main_~i~1 11), 66608#(<= main_~i~1 10), 66611#(<= main_~i~1 13), 66610#(<= main_~i~1 12), 66613#(<= main_~i~1 15), 66612#(<= main_~i~1 14), 66615#(<= main_~i~1 17), 66614#(<= main_~i~1 16), 66617#(<= main_~i~1 19), 66616#(<= main_~i~1 18), 66619#(<= main_~i~1 21), 66618#(<= main_~i~1 20), 66621#(<= main_~i~1 23), 66620#(<= main_~i~1 22), 66623#(<= main_~i~1 25), 66622#(<= main_~i~1 24), 66625#(<= main_~i~1 27), 66624#(<= main_~i~1 26), 66627#(<= main_~i~1 29), 66626#(<= main_~i~1 28), 66629#(<= main_~i~1 31), 66628#(<= main_~i~1 30), 66631#(<= main_~i~1 33), 66630#(<= main_~i~1 32), 66633#(<= main_~i~1 35), 66632#(<= main_~i~1 34), 66635#(<= main_~i~1 37), 66634#(<= main_~i~1 36), 66637#(<= main_~i~1 39), 66636#(<= main_~i~1 38), 66639#(<= main_~i~1 41), 66638#(<= main_~i~1 40), 66641#(<= main_~i~1 43), 66640#(<= main_~i~1 42), 66643#(<= main_~i~1 45), 66642#(<= main_~i~1 44), 66645#(<= main_~i~1 47), 66644#(<= main_~i~1 46), 66647#(<= main_~i~1 49), 66646#(<= main_~i~1 48), 66649#(<= main_~i~1 51), 66648#(<= main_~i~1 50)] [2018-02-04 16:14:32,011 INFO L134 CoverageAnalysis]: Checked inductivity of 16779 backedges. 0 proven. 9027 refuted. 0 times theorem prover too weak. 7752 trivial. 0 not checked. [2018-02-04 16:14:32,011 INFO L409 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-02-04 16:14:32,011 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-02-04 16:14:32,012 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2018-02-04 16:14:32,012 INFO L87 Difference]: Start difference. First operand 1024 states and 1273 transitions. Second operand 54 states. [2018-02-04 16:14:32,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:14:32,667 INFO L93 Difference]: Finished difference Result 1322 states and 1529 transitions. [2018-02-04 16:14:32,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-02-04 16:14:32,667 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 688 [2018-02-04 16:14:32,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:14:32,669 INFO L225 Difference]: With dead ends: 1322 [2018-02-04 16:14:32,669 INFO L226 Difference]: Without dead ends: 1322 [2018-02-04 16:14:32,669 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2018-02-04 16:14:32,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1322 states. [2018-02-04 16:14:32,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1322 to 1043. [2018-02-04 16:14:32,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1043 states. [2018-02-04 16:14:32,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1043 states to 1043 states and 1297 transitions. [2018-02-04 16:14:32,680 INFO L78 Accepts]: Start accepts. Automaton has 1043 states and 1297 transitions. Word has length 688 [2018-02-04 16:14:32,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:14:32,680 INFO L432 AbstractCegarLoop]: Abstraction has 1043 states and 1297 transitions. [2018-02-04 16:14:32,680 INFO L433 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-02-04 16:14:32,681 INFO L276 IsEmpty]: Start isEmpty. Operand 1043 states and 1297 transitions. [2018-02-04 16:14:32,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 702 [2018-02-04 16:14:32,686 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:14:32,687 INFO L351 BasicCegarLoop]: trace histogram [53, 53, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:14:32,687 INFO L371 AbstractCegarLoop]: === Iteration 64 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 16:14:32,687 INFO L82 PathProgramCache]: Analyzing trace with hash 256076836, now seen corresponding path program 50 times [2018-02-04 16:14:32,688 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:14:32,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:14:32,728 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:14:34,373 INFO L134 CoverageAnalysis]: Checked inductivity of 17446 backedges. 0 proven. 9386 refuted. 0 times theorem prover too weak. 8060 trivial. 0 not checked. [2018-02-04 16:14:34,373 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:14:34,373 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2018-02-04 16:14:34,373 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:14:34,374 INFO L134 CoverageAnalysis]: Checked inductivity of 7203 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7203 trivial. 0 not checked. [2018-02-04 16:14:34,374 INFO L182 omatonBuilderFactory]: Interpolants [69015#true, 69017#(= main_~i~1 0), 69016#false, 69019#(<= main_~i~1 2), 69018#(<= main_~i~1 1), 69021#(<= main_~i~1 4), 69020#(<= main_~i~1 3), 69023#(<= main_~i~1 6), 69022#(<= main_~i~1 5), 69025#(<= main_~i~1 8), 69024#(<= main_~i~1 7), 69027#(<= main_~i~1 10), 69026#(<= main_~i~1 9), 69029#(<= main_~i~1 12), 69028#(<= main_~i~1 11), 69031#(<= main_~i~1 14), 69030#(<= main_~i~1 13), 69033#(<= main_~i~1 16), 69032#(<= main_~i~1 15), 69035#(<= main_~i~1 18), 69034#(<= main_~i~1 17), 69037#(<= main_~i~1 20), 69036#(<= main_~i~1 19), 69039#(<= main_~i~1 22), 69038#(<= main_~i~1 21), 69041#(<= main_~i~1 24), 69040#(<= main_~i~1 23), 69043#(<= main_~i~1 26), 69042#(<= main_~i~1 25), 69045#(<= main_~i~1 28), 69044#(<= main_~i~1 27), 69047#(<= main_~i~1 30), 69046#(<= main_~i~1 29), 69049#(<= main_~i~1 32), 69048#(<= main_~i~1 31), 69051#(<= main_~i~1 34), 69050#(<= main_~i~1 33), 69053#(<= main_~i~1 36), 69052#(<= main_~i~1 35), 69055#(<= main_~i~1 38), 69054#(<= main_~i~1 37), 69057#(<= main_~i~1 40), 69056#(<= main_~i~1 39), 69059#(<= main_~i~1 42), 69058#(<= main_~i~1 41), 69061#(<= main_~i~1 44), 69060#(<= main_~i~1 43), 69063#(<= main_~i~1 46), 69062#(<= main_~i~1 45), 69065#(<= main_~i~1 48), 69064#(<= main_~i~1 47), 69067#(<= main_~i~1 50), 69066#(<= main_~i~1 49), 69069#(<= main_~i~1 52), 69068#(<= main_~i~1 51)] [2018-02-04 16:14:34,374 INFO L134 CoverageAnalysis]: Checked inductivity of 17446 backedges. 0 proven. 9386 refuted. 0 times theorem prover too weak. 8060 trivial. 0 not checked. [2018-02-04 16:14:34,374 INFO L409 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-02-04 16:14:34,375 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-02-04 16:14:34,375 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2018-02-04 16:14:34,375 INFO L87 Difference]: Start difference. First operand 1043 states and 1297 transitions. Second operand 55 states. [2018-02-04 16:14:35,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:14:35,112 INFO L93 Difference]: Finished difference Result 1346 states and 1557 transitions. [2018-02-04 16:14:35,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-02-04 16:14:35,112 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 701 [2018-02-04 16:14:35,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:14:35,115 INFO L225 Difference]: With dead ends: 1346 [2018-02-04 16:14:35,115 INFO L226 Difference]: Without dead ends: 1346 [2018-02-04 16:14:35,115 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2018-02-04 16:14:35,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1346 states. [2018-02-04 16:14:35,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1346 to 1062. [2018-02-04 16:14:35,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1062 states. [2018-02-04 16:14:35,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1062 states to 1062 states and 1321 transitions. [2018-02-04 16:14:35,125 INFO L78 Accepts]: Start accepts. Automaton has 1062 states and 1321 transitions. Word has length 701 [2018-02-04 16:14:35,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:14:35,126 INFO L432 AbstractCegarLoop]: Abstraction has 1062 states and 1321 transitions. [2018-02-04 16:14:35,126 INFO L433 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-02-04 16:14:35,126 INFO L276 IsEmpty]: Start isEmpty. Operand 1062 states and 1321 transitions. [2018-02-04 16:14:35,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 715 [2018-02-04 16:14:35,130 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:14:35,130 INFO L351 BasicCegarLoop]: trace histogram [54, 54, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:14:35,130 INFO L371 AbstractCegarLoop]: === Iteration 65 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 16:14:35,130 INFO L82 PathProgramCache]: Analyzing trace with hash -840636557, now seen corresponding path program 51 times [2018-02-04 16:14:35,131 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:14:35,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:14:35,170 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:14:36,919 INFO L134 CoverageAnalysis]: Checked inductivity of 18126 backedges. 0 proven. 9752 refuted. 0 times theorem prover too weak. 8374 trivial. 0 not checked. [2018-02-04 16:14:36,920 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:14:36,920 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2018-02-04 16:14:36,920 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:14:36,920 INFO L134 CoverageAnalysis]: Checked inductivity of 7500 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7500 trivial. 0 not checked. [2018-02-04 16:14:36,920 INFO L182 omatonBuilderFactory]: Interpolants [71479#false, 71478#true, 71481#(<= main_~i~1 1), 71480#(= main_~i~1 0), 71483#(<= main_~i~1 3), 71482#(<= main_~i~1 2), 71485#(<= main_~i~1 5), 71484#(<= main_~i~1 4), 71487#(<= main_~i~1 7), 71486#(<= main_~i~1 6), 71489#(<= main_~i~1 9), 71488#(<= main_~i~1 8), 71491#(<= main_~i~1 11), 71490#(<= main_~i~1 10), 71493#(<= main_~i~1 13), 71492#(<= main_~i~1 12), 71495#(<= main_~i~1 15), 71494#(<= main_~i~1 14), 71497#(<= main_~i~1 17), 71496#(<= main_~i~1 16), 71499#(<= main_~i~1 19), 71498#(<= main_~i~1 18), 71501#(<= main_~i~1 21), 71500#(<= main_~i~1 20), 71503#(<= main_~i~1 23), 71502#(<= main_~i~1 22), 71505#(<= main_~i~1 25), 71504#(<= main_~i~1 24), 71507#(<= main_~i~1 27), 71506#(<= main_~i~1 26), 71509#(<= main_~i~1 29), 71508#(<= main_~i~1 28), 71511#(<= main_~i~1 31), 71510#(<= main_~i~1 30), 71513#(<= main_~i~1 33), 71512#(<= main_~i~1 32), 71515#(<= main_~i~1 35), 71514#(<= main_~i~1 34), 71517#(<= main_~i~1 37), 71516#(<= main_~i~1 36), 71519#(<= main_~i~1 39), 71518#(<= main_~i~1 38), 71521#(<= main_~i~1 41), 71520#(<= main_~i~1 40), 71523#(<= main_~i~1 43), 71522#(<= main_~i~1 42), 71525#(<= main_~i~1 45), 71524#(<= main_~i~1 44), 71527#(<= main_~i~1 47), 71526#(<= main_~i~1 46), 71529#(<= main_~i~1 49), 71528#(<= main_~i~1 48), 71531#(<= main_~i~1 51), 71530#(<= main_~i~1 50), 71533#(<= main_~i~1 53), 71532#(<= main_~i~1 52)] [2018-02-04 16:14:36,921 INFO L134 CoverageAnalysis]: Checked inductivity of 18126 backedges. 0 proven. 9752 refuted. 0 times theorem prover too weak. 8374 trivial. 0 not checked. [2018-02-04 16:14:36,921 INFO L409 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-02-04 16:14:36,921 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-02-04 16:14:36,921 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2018-02-04 16:14:36,921 INFO L87 Difference]: Start difference. First operand 1062 states and 1321 transitions. Second operand 56 states. [2018-02-04 16:14:37,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:14:37,681 INFO L93 Difference]: Finished difference Result 1370 states and 1585 transitions. [2018-02-04 16:14:37,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-02-04 16:14:37,681 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 714 [2018-02-04 16:14:37,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:14:37,683 INFO L225 Difference]: With dead ends: 1370 [2018-02-04 16:14:37,683 INFO L226 Difference]: Without dead ends: 1370 [2018-02-04 16:14:37,684 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2018-02-04 16:14:37,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1370 states. [2018-02-04 16:14:37,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1370 to 1081. [2018-02-04 16:14:37,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1081 states. [2018-02-04 16:14:37,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1081 states to 1081 states and 1345 transitions. [2018-02-04 16:14:37,692 INFO L78 Accepts]: Start accepts. Automaton has 1081 states and 1345 transitions. Word has length 714 [2018-02-04 16:14:37,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:14:37,692 INFO L432 AbstractCegarLoop]: Abstraction has 1081 states and 1345 transitions. [2018-02-04 16:14:37,692 INFO L433 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-02-04 16:14:37,692 INFO L276 IsEmpty]: Start isEmpty. Operand 1081 states and 1345 transitions. [2018-02-04 16:14:37,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 728 [2018-02-04 16:14:37,696 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:14:37,696 INFO L351 BasicCegarLoop]: trace histogram [55, 55, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:14:37,697 INFO L371 AbstractCegarLoop]: === Iteration 66 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 16:14:37,697 INFO L82 PathProgramCache]: Analyzing trace with hash -533429116, now seen corresponding path program 52 times [2018-02-04 16:14:37,697 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:14:37,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:14:37,730 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:14:39,621 INFO L134 CoverageAnalysis]: Checked inductivity of 18819 backedges. 0 proven. 10125 refuted. 0 times theorem prover too weak. 8694 trivial. 0 not checked. [2018-02-04 16:14:39,621 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:14:39,622 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2018-02-04 16:14:39,622 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:14:39,622 INFO L134 CoverageAnalysis]: Checked inductivity of 7803 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7803 trivial. 0 not checked. [2018-02-04 16:14:39,622 INFO L182 omatonBuilderFactory]: Interpolants [73985#true, 73987#(= main_~i~1 0), 73986#false, 73989#(<= main_~i~1 2), 73988#(<= main_~i~1 1), 73991#(<= main_~i~1 4), 73990#(<= main_~i~1 3), 73993#(<= main_~i~1 6), 73992#(<= main_~i~1 5), 73995#(<= main_~i~1 8), 73994#(<= main_~i~1 7), 73997#(<= main_~i~1 10), 73996#(<= main_~i~1 9), 73999#(<= main_~i~1 12), 73998#(<= main_~i~1 11), 74001#(<= main_~i~1 14), 74000#(<= main_~i~1 13), 74003#(<= main_~i~1 16), 74002#(<= main_~i~1 15), 74005#(<= main_~i~1 18), 74004#(<= main_~i~1 17), 74007#(<= main_~i~1 20), 74006#(<= main_~i~1 19), 74009#(<= main_~i~1 22), 74008#(<= main_~i~1 21), 74011#(<= main_~i~1 24), 74010#(<= main_~i~1 23), 74013#(<= main_~i~1 26), 74012#(<= main_~i~1 25), 74015#(<= main_~i~1 28), 74014#(<= main_~i~1 27), 74017#(<= main_~i~1 30), 74016#(<= main_~i~1 29), 74019#(<= main_~i~1 32), 74018#(<= main_~i~1 31), 74021#(<= main_~i~1 34), 74020#(<= main_~i~1 33), 74023#(<= main_~i~1 36), 74022#(<= main_~i~1 35), 74025#(<= main_~i~1 38), 74024#(<= main_~i~1 37), 74027#(<= main_~i~1 40), 74026#(<= main_~i~1 39), 74029#(<= main_~i~1 42), 74028#(<= main_~i~1 41), 74031#(<= main_~i~1 44), 74030#(<= main_~i~1 43), 74033#(<= main_~i~1 46), 74032#(<= main_~i~1 45), 74035#(<= main_~i~1 48), 74034#(<= main_~i~1 47), 74037#(<= main_~i~1 50), 74036#(<= main_~i~1 49), 74039#(<= main_~i~1 52), 74038#(<= main_~i~1 51), 74041#(<= main_~i~1 54), 74040#(<= main_~i~1 53)] [2018-02-04 16:14:39,623 INFO L134 CoverageAnalysis]: Checked inductivity of 18819 backedges. 0 proven. 10125 refuted. 0 times theorem prover too weak. 8694 trivial. 0 not checked. [2018-02-04 16:14:39,623 INFO L409 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-02-04 16:14:39,623 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-02-04 16:14:39,623 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2018-02-04 16:14:39,623 INFO L87 Difference]: Start difference. First operand 1081 states and 1345 transitions. Second operand 57 states. [2018-02-04 16:14:40,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:14:40,493 INFO L93 Difference]: Finished difference Result 1394 states and 1613 transitions. [2018-02-04 16:14:40,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-02-04 16:14:40,493 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 727 [2018-02-04 16:14:40,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:14:40,495 INFO L225 Difference]: With dead ends: 1394 [2018-02-04 16:14:40,495 INFO L226 Difference]: Without dead ends: 1394 [2018-02-04 16:14:40,496 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2018-02-04 16:14:40,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1394 states. [2018-02-04 16:14:40,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1394 to 1100. [2018-02-04 16:14:40,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1100 states. [2018-02-04 16:14:40,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1100 states to 1100 states and 1369 transitions. [2018-02-04 16:14:40,504 INFO L78 Accepts]: Start accepts. Automaton has 1100 states and 1369 transitions. Word has length 727 [2018-02-04 16:14:40,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:14:40,504 INFO L432 AbstractCegarLoop]: Abstraction has 1100 states and 1369 transitions. [2018-02-04 16:14:40,504 INFO L433 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-02-04 16:14:40,504 INFO L276 IsEmpty]: Start isEmpty. Operand 1100 states and 1369 transitions. [2018-02-04 16:14:40,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 741 [2018-02-04 16:14:40,508 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:14:40,508 INFO L351 BasicCegarLoop]: trace histogram [56, 56, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:14:40,508 INFO L371 AbstractCegarLoop]: === Iteration 67 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 16:14:40,508 INFO L82 PathProgramCache]: Analyzing trace with hash 1252420371, now seen corresponding path program 53 times [2018-02-04 16:14:40,509 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:14:40,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:14:40,548 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:14:42,478 INFO L134 CoverageAnalysis]: Checked inductivity of 19525 backedges. 0 proven. 10505 refuted. 0 times theorem prover too weak. 9020 trivial. 0 not checked. [2018-02-04 16:14:42,479 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:14:42,479 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2018-02-04 16:14:42,479 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:14:42,479 INFO L134 CoverageAnalysis]: Checked inductivity of 8112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8112 trivial. 0 not checked. [2018-02-04 16:14:42,480 INFO L182 omatonBuilderFactory]: Interpolants [76545#(<= main_~i~1 7), 76544#(<= main_~i~1 6), 76547#(<= main_~i~1 9), 76546#(<= main_~i~1 8), 76549#(<= main_~i~1 11), 76548#(<= main_~i~1 10), 76551#(<= main_~i~1 13), 76550#(<= main_~i~1 12), 76553#(<= main_~i~1 15), 76552#(<= main_~i~1 14), 76555#(<= main_~i~1 17), 76554#(<= main_~i~1 16), 76557#(<= main_~i~1 19), 76556#(<= main_~i~1 18), 76559#(<= main_~i~1 21), 76558#(<= main_~i~1 20), 76561#(<= main_~i~1 23), 76560#(<= main_~i~1 22), 76563#(<= main_~i~1 25), 76562#(<= main_~i~1 24), 76565#(<= main_~i~1 27), 76564#(<= main_~i~1 26), 76567#(<= main_~i~1 29), 76566#(<= main_~i~1 28), 76569#(<= main_~i~1 31), 76568#(<= main_~i~1 30), 76571#(<= main_~i~1 33), 76570#(<= main_~i~1 32), 76573#(<= main_~i~1 35), 76572#(<= main_~i~1 34), 76575#(<= main_~i~1 37), 76574#(<= main_~i~1 36), 76577#(<= main_~i~1 39), 76576#(<= main_~i~1 38), 76579#(<= main_~i~1 41), 76578#(<= main_~i~1 40), 76581#(<= main_~i~1 43), 76580#(<= main_~i~1 42), 76583#(<= main_~i~1 45), 76582#(<= main_~i~1 44), 76585#(<= main_~i~1 47), 76584#(<= main_~i~1 46), 76587#(<= main_~i~1 49), 76586#(<= main_~i~1 48), 76589#(<= main_~i~1 51), 76588#(<= main_~i~1 50), 76591#(<= main_~i~1 53), 76590#(<= main_~i~1 52), 76593#(<= main_~i~1 55), 76592#(<= main_~i~1 54), 76537#false, 76536#true, 76539#(<= main_~i~1 1), 76538#(= main_~i~1 0), 76541#(<= main_~i~1 3), 76540#(<= main_~i~1 2), 76543#(<= main_~i~1 5), 76542#(<= main_~i~1 4)] [2018-02-04 16:14:42,480 INFO L134 CoverageAnalysis]: Checked inductivity of 19525 backedges. 0 proven. 10505 refuted. 0 times theorem prover too weak. 9020 trivial. 0 not checked. [2018-02-04 16:14:42,480 INFO L409 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-02-04 16:14:42,481 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-02-04 16:14:42,481 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2018-02-04 16:14:42,481 INFO L87 Difference]: Start difference. First operand 1100 states and 1369 transitions. Second operand 58 states. [2018-02-04 16:14:43,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:14:43,304 INFO L93 Difference]: Finished difference Result 1418 states and 1641 transitions. [2018-02-04 16:14:43,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-02-04 16:14:43,304 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 740 [2018-02-04 16:14:43,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:14:43,306 INFO L225 Difference]: With dead ends: 1418 [2018-02-04 16:14:43,306 INFO L226 Difference]: Without dead ends: 1418 [2018-02-04 16:14:43,306 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2018-02-04 16:14:43,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1418 states. [2018-02-04 16:14:43,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1418 to 1119. [2018-02-04 16:14:43,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1119 states. [2018-02-04 16:14:43,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1119 states to 1119 states and 1393 transitions. [2018-02-04 16:14:43,315 INFO L78 Accepts]: Start accepts. Automaton has 1119 states and 1393 transitions. Word has length 740 [2018-02-04 16:14:43,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:14:43,316 INFO L432 AbstractCegarLoop]: Abstraction has 1119 states and 1393 transitions. [2018-02-04 16:14:43,316 INFO L433 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-02-04 16:14:43,316 INFO L276 IsEmpty]: Start isEmpty. Operand 1119 states and 1393 transitions. [2018-02-04 16:14:43,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 754 [2018-02-04 16:14:43,320 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:14:43,320 INFO L351 BasicCegarLoop]: trace histogram [57, 57, 56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:14:43,320 INFO L371 AbstractCegarLoop]: === Iteration 68 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 16:14:43,320 INFO L82 PathProgramCache]: Analyzing trace with hash -1914837788, now seen corresponding path program 54 times [2018-02-04 16:14:43,321 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:14:43,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:14:43,356 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:14:45,357 INFO L134 CoverageAnalysis]: Checked inductivity of 20244 backedges. 0 proven. 10892 refuted. 0 times theorem prover too weak. 9352 trivial. 0 not checked. [2018-02-04 16:14:45,357 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:14:45,357 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2018-02-04 16:14:45,357 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:14:45,357 INFO L134 CoverageAnalysis]: Checked inductivity of 8427 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8427 trivial. 0 not checked. [2018-02-04 16:14:45,358 INFO L182 omatonBuilderFactory]: Interpolants [79131#true, 79133#(= main_~i~1 0), 79132#false, 79135#(<= main_~i~1 2), 79134#(<= main_~i~1 1), 79137#(<= main_~i~1 4), 79136#(<= main_~i~1 3), 79139#(<= main_~i~1 6), 79138#(<= main_~i~1 5), 79141#(<= main_~i~1 8), 79140#(<= main_~i~1 7), 79143#(<= main_~i~1 10), 79142#(<= main_~i~1 9), 79145#(<= main_~i~1 12), 79144#(<= main_~i~1 11), 79147#(<= main_~i~1 14), 79146#(<= main_~i~1 13), 79149#(<= main_~i~1 16), 79148#(<= main_~i~1 15), 79151#(<= main_~i~1 18), 79150#(<= main_~i~1 17), 79153#(<= main_~i~1 20), 79152#(<= main_~i~1 19), 79155#(<= main_~i~1 22), 79154#(<= main_~i~1 21), 79157#(<= main_~i~1 24), 79156#(<= main_~i~1 23), 79159#(<= main_~i~1 26), 79158#(<= main_~i~1 25), 79161#(<= main_~i~1 28), 79160#(<= main_~i~1 27), 79163#(<= main_~i~1 30), 79162#(<= main_~i~1 29), 79165#(<= main_~i~1 32), 79164#(<= main_~i~1 31), 79167#(<= main_~i~1 34), 79166#(<= main_~i~1 33), 79169#(<= main_~i~1 36), 79168#(<= main_~i~1 35), 79171#(<= main_~i~1 38), 79170#(<= main_~i~1 37), 79173#(<= main_~i~1 40), 79172#(<= main_~i~1 39), 79175#(<= main_~i~1 42), 79174#(<= main_~i~1 41), 79177#(<= main_~i~1 44), 79176#(<= main_~i~1 43), 79179#(<= main_~i~1 46), 79178#(<= main_~i~1 45), 79181#(<= main_~i~1 48), 79180#(<= main_~i~1 47), 79183#(<= main_~i~1 50), 79182#(<= main_~i~1 49), 79185#(<= main_~i~1 52), 79184#(<= main_~i~1 51), 79187#(<= main_~i~1 54), 79186#(<= main_~i~1 53), 79189#(<= main_~i~1 56), 79188#(<= main_~i~1 55)] [2018-02-04 16:14:45,358 INFO L134 CoverageAnalysis]: Checked inductivity of 20244 backedges. 0 proven. 10892 refuted. 0 times theorem prover too weak. 9352 trivial. 0 not checked. [2018-02-04 16:14:45,358 INFO L409 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-02-04 16:14:45,358 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-02-04 16:14:45,359 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2018-02-04 16:14:45,359 INFO L87 Difference]: Start difference. First operand 1119 states and 1393 transitions. Second operand 59 states. [2018-02-04 16:14:46,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:14:46,239 INFO L93 Difference]: Finished difference Result 1442 states and 1669 transitions. [2018-02-04 16:14:46,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-02-04 16:14:46,239 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 753 [2018-02-04 16:14:46,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:14:46,241 INFO L225 Difference]: With dead ends: 1442 [2018-02-04 16:14:46,241 INFO L226 Difference]: Without dead ends: 1442 [2018-02-04 16:14:46,241 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2018-02-04 16:14:46,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1442 states. [2018-02-04 16:14:46,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1442 to 1138. [2018-02-04 16:14:46,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1138 states. [2018-02-04 16:14:46,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1138 states to 1138 states and 1417 transitions. [2018-02-04 16:14:46,250 INFO L78 Accepts]: Start accepts. Automaton has 1138 states and 1417 transitions. Word has length 753 [2018-02-04 16:14:46,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:14:46,251 INFO L432 AbstractCegarLoop]: Abstraction has 1138 states and 1417 transitions. [2018-02-04 16:14:46,251 INFO L433 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-02-04 16:14:46,251 INFO L276 IsEmpty]: Start isEmpty. Operand 1138 states and 1417 transitions. [2018-02-04 16:14:46,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 767 [2018-02-04 16:14:46,254 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:14:46,254 INFO L351 BasicCegarLoop]: trace histogram [58, 58, 57, 57, 57, 57, 57, 57, 57, 57, 57, 57, 57, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:14:46,254 INFO L371 AbstractCegarLoop]: === Iteration 69 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 16:14:46,255 INFO L82 PathProgramCache]: Analyzing trace with hash -1234917709, now seen corresponding path program 55 times [2018-02-04 16:14:46,255 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:14:46,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:14:46,290 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:14:48,385 INFO L134 CoverageAnalysis]: Checked inductivity of 20976 backedges. 0 proven. 11286 refuted. 0 times theorem prover too weak. 9690 trivial. 0 not checked. [2018-02-04 16:14:48,386 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:14:48,386 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2018-02-04 16:14:48,386 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:14:48,386 INFO L134 CoverageAnalysis]: Checked inductivity of 8748 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8748 trivial. 0 not checked. [2018-02-04 16:14:48,387 INFO L182 omatonBuilderFactory]: Interpolants [81793#(<= main_~i~1 21), 81792#(<= main_~i~1 20), 81795#(<= main_~i~1 23), 81794#(<= main_~i~1 22), 81797#(<= main_~i~1 25), 81796#(<= main_~i~1 24), 81799#(<= main_~i~1 27), 81798#(<= main_~i~1 26), 81801#(<= main_~i~1 29), 81800#(<= main_~i~1 28), 81803#(<= main_~i~1 31), 81802#(<= main_~i~1 30), 81805#(<= main_~i~1 33), 81804#(<= main_~i~1 32), 81807#(<= main_~i~1 35), 81806#(<= main_~i~1 34), 81809#(<= main_~i~1 37), 81808#(<= main_~i~1 36), 81811#(<= main_~i~1 39), 81810#(<= main_~i~1 38), 81813#(<= main_~i~1 41), 81812#(<= main_~i~1 40), 81815#(<= main_~i~1 43), 81814#(<= main_~i~1 42), 81817#(<= main_~i~1 45), 81816#(<= main_~i~1 44), 81819#(<= main_~i~1 47), 81818#(<= main_~i~1 46), 81821#(<= main_~i~1 49), 81820#(<= main_~i~1 48), 81823#(<= main_~i~1 51), 81822#(<= main_~i~1 50), 81825#(<= main_~i~1 53), 81824#(<= main_~i~1 52), 81827#(<= main_~i~1 55), 81826#(<= main_~i~1 54), 81829#(<= main_~i~1 57), 81828#(<= main_~i~1 56), 81771#false, 81770#true, 81773#(<= main_~i~1 1), 81772#(= main_~i~1 0), 81775#(<= main_~i~1 3), 81774#(<= main_~i~1 2), 81777#(<= main_~i~1 5), 81776#(<= main_~i~1 4), 81779#(<= main_~i~1 7), 81778#(<= main_~i~1 6), 81781#(<= main_~i~1 9), 81780#(<= main_~i~1 8), 81783#(<= main_~i~1 11), 81782#(<= main_~i~1 10), 81785#(<= main_~i~1 13), 81784#(<= main_~i~1 12), 81787#(<= main_~i~1 15), 81786#(<= main_~i~1 14), 81789#(<= main_~i~1 17), 81788#(<= main_~i~1 16), 81791#(<= main_~i~1 19), 81790#(<= main_~i~1 18)] [2018-02-04 16:14:48,387 INFO L134 CoverageAnalysis]: Checked inductivity of 20976 backedges. 0 proven. 11286 refuted. 0 times theorem prover too weak. 9690 trivial. 0 not checked. [2018-02-04 16:14:48,387 INFO L409 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-02-04 16:14:48,387 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-02-04 16:14:48,388 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2018-02-04 16:14:48,388 INFO L87 Difference]: Start difference. First operand 1138 states and 1417 transitions. Second operand 60 states. [2018-02-04 16:14:49,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:14:49,216 INFO L93 Difference]: Finished difference Result 1466 states and 1697 transitions. [2018-02-04 16:14:49,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-02-04 16:14:49,216 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 766 [2018-02-04 16:14:49,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:14:49,219 INFO L225 Difference]: With dead ends: 1466 [2018-02-04 16:14:49,219 INFO L226 Difference]: Without dead ends: 1466 [2018-02-04 16:14:49,219 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2018-02-04 16:14:49,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1466 states. [2018-02-04 16:14:49,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1466 to 1157. [2018-02-04 16:14:49,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1157 states. [2018-02-04 16:14:49,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1157 states to 1157 states and 1441 transitions. [2018-02-04 16:14:49,230 INFO L78 Accepts]: Start accepts. Automaton has 1157 states and 1441 transitions. Word has length 766 [2018-02-04 16:14:49,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:14:49,231 INFO L432 AbstractCegarLoop]: Abstraction has 1157 states and 1441 transitions. [2018-02-04 16:14:49,231 INFO L433 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-02-04 16:14:49,231 INFO L276 IsEmpty]: Start isEmpty. Operand 1157 states and 1441 transitions. [2018-02-04 16:14:49,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 780 [2018-02-04 16:14:49,235 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:14:49,235 INFO L351 BasicCegarLoop]: trace histogram [59, 59, 58, 58, 58, 58, 58, 58, 58, 58, 58, 58, 58, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:14:49,235 INFO L371 AbstractCegarLoop]: === Iteration 70 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 16:14:49,235 INFO L82 PathProgramCache]: Analyzing trace with hash -285897404, now seen corresponding path program 56 times [2018-02-04 16:14:49,235 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:14:49,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:14:49,275 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:14:51,439 INFO L134 CoverageAnalysis]: Checked inductivity of 21721 backedges. 0 proven. 11687 refuted. 0 times theorem prover too weak. 10034 trivial. 0 not checked. [2018-02-04 16:14:51,439 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:14:51,439 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2018-02-04 16:14:51,439 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:14:51,440 INFO L134 CoverageAnalysis]: Checked inductivity of 9075 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9075 trivial. 0 not checked. [2018-02-04 16:14:51,440 INFO L182 omatonBuilderFactory]: Interpolants [84481#(<= main_~i~1 26), 84480#(<= main_~i~1 25), 84483#(<= main_~i~1 28), 84482#(<= main_~i~1 27), 84485#(<= main_~i~1 30), 84484#(<= main_~i~1 29), 84487#(<= main_~i~1 32), 84486#(<= main_~i~1 31), 84489#(<= main_~i~1 34), 84488#(<= main_~i~1 33), 84491#(<= main_~i~1 36), 84490#(<= main_~i~1 35), 84493#(<= main_~i~1 38), 84492#(<= main_~i~1 37), 84495#(<= main_~i~1 40), 84494#(<= main_~i~1 39), 84497#(<= main_~i~1 42), 84496#(<= main_~i~1 41), 84499#(<= main_~i~1 44), 84498#(<= main_~i~1 43), 84501#(<= main_~i~1 46), 84500#(<= main_~i~1 45), 84503#(<= main_~i~1 48), 84502#(<= main_~i~1 47), 84505#(<= main_~i~1 50), 84504#(<= main_~i~1 49), 84507#(<= main_~i~1 52), 84506#(<= main_~i~1 51), 84509#(<= main_~i~1 54), 84508#(<= main_~i~1 53), 84511#(<= main_~i~1 56), 84510#(<= main_~i~1 55), 84513#(<= main_~i~1 58), 84512#(<= main_~i~1 57), 84453#true, 84455#(= main_~i~1 0), 84454#false, 84457#(<= main_~i~1 2), 84456#(<= main_~i~1 1), 84459#(<= main_~i~1 4), 84458#(<= main_~i~1 3), 84461#(<= main_~i~1 6), 84460#(<= main_~i~1 5), 84463#(<= main_~i~1 8), 84462#(<= main_~i~1 7), 84465#(<= main_~i~1 10), 84464#(<= main_~i~1 9), 84467#(<= main_~i~1 12), 84466#(<= main_~i~1 11), 84469#(<= main_~i~1 14), 84468#(<= main_~i~1 13), 84471#(<= main_~i~1 16), 84470#(<= main_~i~1 15), 84473#(<= main_~i~1 18), 84472#(<= main_~i~1 17), 84475#(<= main_~i~1 20), 84474#(<= main_~i~1 19), 84477#(<= main_~i~1 22), 84476#(<= main_~i~1 21), 84479#(<= main_~i~1 24), 84478#(<= main_~i~1 23)] [2018-02-04 16:14:51,440 INFO L134 CoverageAnalysis]: Checked inductivity of 21721 backedges. 0 proven. 11687 refuted. 0 times theorem prover too weak. 10034 trivial. 0 not checked. [2018-02-04 16:14:51,440 INFO L409 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-02-04 16:14:51,441 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-02-04 16:14:51,441 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2018-02-04 16:14:51,441 INFO L87 Difference]: Start difference. First operand 1157 states and 1441 transitions. Second operand 61 states. [2018-02-04 16:14:52,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:14:52,161 INFO L93 Difference]: Finished difference Result 1490 states and 1725 transitions. [2018-02-04 16:14:52,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-02-04 16:14:52,161 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 779 [2018-02-04 16:14:52,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:14:52,163 INFO L225 Difference]: With dead ends: 1490 [2018-02-04 16:14:52,163 INFO L226 Difference]: Without dead ends: 1490 [2018-02-04 16:14:52,163 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2018-02-04 16:14:52,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1490 states. [2018-02-04 16:14:52,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1490 to 1176. [2018-02-04 16:14:52,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1176 states. [2018-02-04 16:14:52,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1176 states to 1176 states and 1465 transitions. [2018-02-04 16:14:52,172 INFO L78 Accepts]: Start accepts. Automaton has 1176 states and 1465 transitions. Word has length 779 [2018-02-04 16:14:52,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:14:52,173 INFO L432 AbstractCegarLoop]: Abstraction has 1176 states and 1465 transitions. [2018-02-04 16:14:52,173 INFO L433 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-02-04 16:14:52,173 INFO L276 IsEmpty]: Start isEmpty. Operand 1176 states and 1465 transitions. [2018-02-04 16:14:52,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 793 [2018-02-04 16:14:52,176 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:14:52,176 INFO L351 BasicCegarLoop]: trace histogram [60, 60, 59, 59, 59, 59, 59, 59, 59, 59, 59, 59, 59, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:14:52,177 INFO L371 AbstractCegarLoop]: === Iteration 71 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 16:14:52,177 INFO L82 PathProgramCache]: Analyzing trace with hash 1378458195, now seen corresponding path program 57 times [2018-02-04 16:14:52,177 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:14:52,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:14:52,215 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:14:54,503 INFO L134 CoverageAnalysis]: Checked inductivity of 22479 backedges. 0 proven. 12095 refuted. 0 times theorem prover too weak. 10384 trivial. 0 not checked. [2018-02-04 16:14:54,504 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:14:54,504 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62] total 62 [2018-02-04 16:14:54,504 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:14:54,504 INFO L134 CoverageAnalysis]: Checked inductivity of 9408 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9408 trivial. 0 not checked. [2018-02-04 16:14:54,505 INFO L182 omatonBuilderFactory]: Interpolants [87181#false, 87180#true, 87183#(<= main_~i~1 1), 87182#(= main_~i~1 0), 87185#(<= main_~i~1 3), 87184#(<= main_~i~1 2), 87187#(<= main_~i~1 5), 87186#(<= main_~i~1 4), 87189#(<= main_~i~1 7), 87188#(<= main_~i~1 6), 87191#(<= main_~i~1 9), 87190#(<= main_~i~1 8), 87193#(<= main_~i~1 11), 87192#(<= main_~i~1 10), 87195#(<= main_~i~1 13), 87194#(<= main_~i~1 12), 87197#(<= main_~i~1 15), 87196#(<= main_~i~1 14), 87199#(<= main_~i~1 17), 87198#(<= main_~i~1 16), 87201#(<= main_~i~1 19), 87200#(<= main_~i~1 18), 87203#(<= main_~i~1 21), 87202#(<= main_~i~1 20), 87205#(<= main_~i~1 23), 87204#(<= main_~i~1 22), 87207#(<= main_~i~1 25), 87206#(<= main_~i~1 24), 87209#(<= main_~i~1 27), 87208#(<= main_~i~1 26), 87211#(<= main_~i~1 29), 87210#(<= main_~i~1 28), 87213#(<= main_~i~1 31), 87212#(<= main_~i~1 30), 87215#(<= main_~i~1 33), 87214#(<= main_~i~1 32), 87217#(<= main_~i~1 35), 87216#(<= main_~i~1 34), 87219#(<= main_~i~1 37), 87218#(<= main_~i~1 36), 87221#(<= main_~i~1 39), 87220#(<= main_~i~1 38), 87223#(<= main_~i~1 41), 87222#(<= main_~i~1 40), 87225#(<= main_~i~1 43), 87224#(<= main_~i~1 42), 87227#(<= main_~i~1 45), 87226#(<= main_~i~1 44), 87229#(<= main_~i~1 47), 87228#(<= main_~i~1 46), 87231#(<= main_~i~1 49), 87230#(<= main_~i~1 48), 87233#(<= main_~i~1 51), 87232#(<= main_~i~1 50), 87235#(<= main_~i~1 53), 87234#(<= main_~i~1 52), 87237#(<= main_~i~1 55), 87236#(<= main_~i~1 54), 87239#(<= main_~i~1 57), 87238#(<= main_~i~1 56), 87241#(<= main_~i~1 59), 87240#(<= main_~i~1 58)] [2018-02-04 16:14:54,505 INFO L134 CoverageAnalysis]: Checked inductivity of 22479 backedges. 0 proven. 12095 refuted. 0 times theorem prover too weak. 10384 trivial. 0 not checked. [2018-02-04 16:14:54,505 INFO L409 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-02-04 16:14:54,506 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-02-04 16:14:54,506 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2018-02-04 16:14:54,506 INFO L87 Difference]: Start difference. First operand 1176 states and 1465 transitions. Second operand 62 states. [2018-02-04 16:14:55,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:14:55,618 INFO L93 Difference]: Finished difference Result 1514 states and 1753 transitions. [2018-02-04 16:14:55,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-02-04 16:14:55,618 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 792 [2018-02-04 16:14:55,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:14:55,620 INFO L225 Difference]: With dead ends: 1514 [2018-02-04 16:14:55,620 INFO L226 Difference]: Without dead ends: 1514 [2018-02-04 16:14:55,621 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2018-02-04 16:14:55,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1514 states. [2018-02-04 16:14:55,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1514 to 1195. [2018-02-04 16:14:55,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1195 states. [2018-02-04 16:14:55,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1195 states to 1195 states and 1489 transitions. [2018-02-04 16:14:55,632 INFO L78 Accepts]: Start accepts. Automaton has 1195 states and 1489 transitions. Word has length 792 [2018-02-04 16:14:55,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:14:55,632 INFO L432 AbstractCegarLoop]: Abstraction has 1195 states and 1489 transitions. [2018-02-04 16:14:55,632 INFO L433 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-02-04 16:14:55,632 INFO L276 IsEmpty]: Start isEmpty. Operand 1195 states and 1489 transitions. [2018-02-04 16:14:55,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 806 [2018-02-04 16:14:55,636 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:14:55,636 INFO L351 BasicCegarLoop]: trace histogram [61, 61, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:14:55,636 INFO L371 AbstractCegarLoop]: === Iteration 72 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 16:14:55,636 INFO L82 PathProgramCache]: Analyzing trace with hash 1118928292, now seen corresponding path program 58 times [2018-02-04 16:14:55,637 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:14:55,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:14:55,678 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:14:58,046 INFO L134 CoverageAnalysis]: Checked inductivity of 23250 backedges. 0 proven. 12510 refuted. 0 times theorem prover too weak. 10740 trivial. 0 not checked. [2018-02-04 16:14:58,047 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:14:58,047 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2018-02-04 16:14:58,047 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:14:58,047 INFO L134 CoverageAnalysis]: Checked inductivity of 9747 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9747 trivial. 0 not checked. [2018-02-04 16:14:58,048 INFO L182 omatonBuilderFactory]: Interpolants [89985#(<= main_~i~1 32), 89984#(<= main_~i~1 31), 89987#(<= main_~i~1 34), 89986#(<= main_~i~1 33), 89989#(<= main_~i~1 36), 89988#(<= main_~i~1 35), 89991#(<= main_~i~1 38), 89990#(<= main_~i~1 37), 89993#(<= main_~i~1 40), 89992#(<= main_~i~1 39), 89995#(<= main_~i~1 42), 89994#(<= main_~i~1 41), 89997#(<= main_~i~1 44), 89996#(<= main_~i~1 43), 89999#(<= main_~i~1 46), 89998#(<= main_~i~1 45), 90001#(<= main_~i~1 48), 90000#(<= main_~i~1 47), 90003#(<= main_~i~1 50), 90002#(<= main_~i~1 49), 90005#(<= main_~i~1 52), 90004#(<= main_~i~1 51), 90007#(<= main_~i~1 54), 90006#(<= main_~i~1 53), 90009#(<= main_~i~1 56), 90008#(<= main_~i~1 55), 90011#(<= main_~i~1 58), 90010#(<= main_~i~1 57), 90013#(<= main_~i~1 60), 90012#(<= main_~i~1 59), 89951#true, 89953#(= main_~i~1 0), 89952#false, 89955#(<= main_~i~1 2), 89954#(<= main_~i~1 1), 89957#(<= main_~i~1 4), 89956#(<= main_~i~1 3), 89959#(<= main_~i~1 6), 89958#(<= main_~i~1 5), 89961#(<= main_~i~1 8), 89960#(<= main_~i~1 7), 89963#(<= main_~i~1 10), 89962#(<= main_~i~1 9), 89965#(<= main_~i~1 12), 89964#(<= main_~i~1 11), 89967#(<= main_~i~1 14), 89966#(<= main_~i~1 13), 89969#(<= main_~i~1 16), 89968#(<= main_~i~1 15), 89971#(<= main_~i~1 18), 89970#(<= main_~i~1 17), 89973#(<= main_~i~1 20), 89972#(<= main_~i~1 19), 89975#(<= main_~i~1 22), 89974#(<= main_~i~1 21), 89977#(<= main_~i~1 24), 89976#(<= main_~i~1 23), 89979#(<= main_~i~1 26), 89978#(<= main_~i~1 25), 89981#(<= main_~i~1 28), 89980#(<= main_~i~1 27), 89983#(<= main_~i~1 30), 89982#(<= main_~i~1 29)] [2018-02-04 16:14:58,048 INFO L134 CoverageAnalysis]: Checked inductivity of 23250 backedges. 0 proven. 12510 refuted. 0 times theorem prover too weak. 10740 trivial. 0 not checked. [2018-02-04 16:14:58,048 INFO L409 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-02-04 16:14:58,049 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-02-04 16:14:58,049 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1953, Invalid=1953, Unknown=0, NotChecked=0, Total=3906 [2018-02-04 16:14:58,049 INFO L87 Difference]: Start difference. First operand 1195 states and 1489 transitions. Second operand 63 states. [2018-02-04 16:14:58,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:14:58,822 INFO L93 Difference]: Finished difference Result 1538 states and 1781 transitions. [2018-02-04 16:14:58,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-02-04 16:14:58,822 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 805 [2018-02-04 16:14:58,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:14:58,824 INFO L225 Difference]: With dead ends: 1538 [2018-02-04 16:14:58,824 INFO L226 Difference]: Without dead ends: 1538 [2018-02-04 16:14:58,824 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1953, Invalid=1953, Unknown=0, NotChecked=0, Total=3906 [2018-02-04 16:14:58,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1538 states. [2018-02-04 16:14:58,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1538 to 1214. [2018-02-04 16:14:58,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1214 states. [2018-02-04 16:14:58,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1214 states to 1214 states and 1513 transitions. [2018-02-04 16:14:58,833 INFO L78 Accepts]: Start accepts. Automaton has 1214 states and 1513 transitions. Word has length 805 [2018-02-04 16:14:58,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:14:58,834 INFO L432 AbstractCegarLoop]: Abstraction has 1214 states and 1513 transitions. [2018-02-04 16:14:58,834 INFO L433 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-02-04 16:14:58,834 INFO L276 IsEmpty]: Start isEmpty. Operand 1214 states and 1513 transitions. [2018-02-04 16:14:58,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 819 [2018-02-04 16:14:58,838 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:14:58,838 INFO L351 BasicCegarLoop]: trace histogram [62, 62, 61, 61, 61, 61, 61, 61, 61, 61, 61, 61, 61, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:14:58,838 INFO L371 AbstractCegarLoop]: === Iteration 73 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 16:14:58,838 INFO L82 PathProgramCache]: Analyzing trace with hash -964737549, now seen corresponding path program 59 times [2018-02-04 16:14:58,838 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:14:58,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:14:58,904 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:15:01,346 INFO L134 CoverageAnalysis]: Checked inductivity of 24034 backedges. 0 proven. 12932 refuted. 0 times theorem prover too weak. 11102 trivial. 0 not checked. [2018-02-04 16:15:01,346 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:15:01,346 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64] total 64 [2018-02-04 16:15:01,346 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:15:01,346 INFO L134 CoverageAnalysis]: Checked inductivity of 10092 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10092 trivial. 0 not checked. [2018-02-04 16:15:01,347 INFO L182 omatonBuilderFactory]: Interpolants [92801#(<= main_~i~1 33), 92800#(<= main_~i~1 32), 92803#(<= main_~i~1 35), 92802#(<= main_~i~1 34), 92805#(<= main_~i~1 37), 92804#(<= main_~i~1 36), 92807#(<= main_~i~1 39), 92806#(<= main_~i~1 38), 92809#(<= main_~i~1 41), 92808#(<= main_~i~1 40), 92811#(<= main_~i~1 43), 92810#(<= main_~i~1 42), 92813#(<= main_~i~1 45), 92812#(<= main_~i~1 44), 92815#(<= main_~i~1 47), 92814#(<= main_~i~1 46), 92817#(<= main_~i~1 49), 92816#(<= main_~i~1 48), 92819#(<= main_~i~1 51), 92818#(<= main_~i~1 50), 92821#(<= main_~i~1 53), 92820#(<= main_~i~1 52), 92823#(<= main_~i~1 55), 92822#(<= main_~i~1 54), 92825#(<= main_~i~1 57), 92824#(<= main_~i~1 56), 92827#(<= main_~i~1 59), 92826#(<= main_~i~1 58), 92829#(<= main_~i~1 61), 92828#(<= main_~i~1 60), 92767#false, 92766#true, 92769#(<= main_~i~1 1), 92768#(= main_~i~1 0), 92771#(<= main_~i~1 3), 92770#(<= main_~i~1 2), 92773#(<= main_~i~1 5), 92772#(<= main_~i~1 4), 92775#(<= main_~i~1 7), 92774#(<= main_~i~1 6), 92777#(<= main_~i~1 9), 92776#(<= main_~i~1 8), 92779#(<= main_~i~1 11), 92778#(<= main_~i~1 10), 92781#(<= main_~i~1 13), 92780#(<= main_~i~1 12), 92783#(<= main_~i~1 15), 92782#(<= main_~i~1 14), 92785#(<= main_~i~1 17), 92784#(<= main_~i~1 16), 92787#(<= main_~i~1 19), 92786#(<= main_~i~1 18), 92789#(<= main_~i~1 21), 92788#(<= main_~i~1 20), 92791#(<= main_~i~1 23), 92790#(<= main_~i~1 22), 92793#(<= main_~i~1 25), 92792#(<= main_~i~1 24), 92795#(<= main_~i~1 27), 92794#(<= main_~i~1 26), 92797#(<= main_~i~1 29), 92796#(<= main_~i~1 28), 92799#(<= main_~i~1 31), 92798#(<= main_~i~1 30)] [2018-02-04 16:15:01,347 INFO L134 CoverageAnalysis]: Checked inductivity of 24034 backedges. 0 proven. 12932 refuted. 0 times theorem prover too weak. 11102 trivial. 0 not checked. [2018-02-04 16:15:01,347 INFO L409 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-02-04 16:15:01,347 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-02-04 16:15:01,348 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2018-02-04 16:15:01,348 INFO L87 Difference]: Start difference. First operand 1214 states and 1513 transitions. Second operand 64 states. [2018-02-04 16:15:02,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:15:02,267 INFO L93 Difference]: Finished difference Result 1562 states and 1809 transitions. [2018-02-04 16:15:02,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-02-04 16:15:02,267 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 818 [2018-02-04 16:15:02,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:15:02,269 INFO L225 Difference]: With dead ends: 1562 [2018-02-04 16:15:02,269 INFO L226 Difference]: Without dead ends: 1562 [2018-02-04 16:15:02,269 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2018-02-04 16:15:02,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1562 states. [2018-02-04 16:15:02,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1562 to 1233. [2018-02-04 16:15:02,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1233 states. [2018-02-04 16:15:02,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1233 states to 1233 states and 1537 transitions. [2018-02-04 16:15:02,283 INFO L78 Accepts]: Start accepts. Automaton has 1233 states and 1537 transitions. Word has length 818 [2018-02-04 16:15:02,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:15:02,284 INFO L432 AbstractCegarLoop]: Abstraction has 1233 states and 1537 transitions. [2018-02-04 16:15:02,284 INFO L433 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-02-04 16:15:02,284 INFO L276 IsEmpty]: Start isEmpty. Operand 1233 states and 1537 transitions. [2018-02-04 16:15:02,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 832 [2018-02-04 16:15:02,291 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:15:02,291 INFO L351 BasicCegarLoop]: trace histogram [63, 63, 62, 62, 62, 62, 62, 62, 62, 62, 62, 62, 62, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:15:02,291 INFO L371 AbstractCegarLoop]: === Iteration 74 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 16:15:02,291 INFO L82 PathProgramCache]: Analyzing trace with hash -1865959932, now seen corresponding path program 60 times [2018-02-04 16:15:02,292 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:15:02,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:15:02,342 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:15:04,885 INFO L134 CoverageAnalysis]: Checked inductivity of 24831 backedges. 0 proven. 13361 refuted. 0 times theorem prover too weak. 11470 trivial. 0 not checked. [2018-02-04 16:15:04,886 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:15:04,886 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2018-02-04 16:15:04,886 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:15:04,886 INFO L134 CoverageAnalysis]: Checked inductivity of 10443 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10443 trivial. 0 not checked. [2018-02-04 16:15:04,886 INFO L182 omatonBuilderFactory]: Interpolants [95625#true, 95627#(= main_~i~1 0), 95626#false, 95629#(<= main_~i~1 2), 95628#(<= main_~i~1 1), 95631#(<= main_~i~1 4), 95630#(<= main_~i~1 3), 95633#(<= main_~i~1 6), 95632#(<= main_~i~1 5), 95635#(<= main_~i~1 8), 95634#(<= main_~i~1 7), 95637#(<= main_~i~1 10), 95636#(<= main_~i~1 9), 95639#(<= main_~i~1 12), 95638#(<= main_~i~1 11), 95641#(<= main_~i~1 14), 95640#(<= main_~i~1 13), 95643#(<= main_~i~1 16), 95642#(<= main_~i~1 15), 95645#(<= main_~i~1 18), 95644#(<= main_~i~1 17), 95647#(<= main_~i~1 20), 95646#(<= main_~i~1 19), 95649#(<= main_~i~1 22), 95648#(<= main_~i~1 21), 95651#(<= main_~i~1 24), 95650#(<= main_~i~1 23), 95653#(<= main_~i~1 26), 95652#(<= main_~i~1 25), 95655#(<= main_~i~1 28), 95654#(<= main_~i~1 27), 95657#(<= main_~i~1 30), 95656#(<= main_~i~1 29), 95659#(<= main_~i~1 32), 95658#(<= main_~i~1 31), 95661#(<= main_~i~1 34), 95660#(<= main_~i~1 33), 95663#(<= main_~i~1 36), 95662#(<= main_~i~1 35), 95665#(<= main_~i~1 38), 95664#(<= main_~i~1 37), 95667#(<= main_~i~1 40), 95666#(<= main_~i~1 39), 95669#(<= main_~i~1 42), 95668#(<= main_~i~1 41), 95671#(<= main_~i~1 44), 95670#(<= main_~i~1 43), 95673#(<= main_~i~1 46), 95672#(<= main_~i~1 45), 95675#(<= main_~i~1 48), 95674#(<= main_~i~1 47), 95677#(<= main_~i~1 50), 95676#(<= main_~i~1 49), 95679#(<= main_~i~1 52), 95678#(<= main_~i~1 51), 95681#(<= main_~i~1 54), 95680#(<= main_~i~1 53), 95683#(<= main_~i~1 56), 95682#(<= main_~i~1 55), 95685#(<= main_~i~1 58), 95684#(<= main_~i~1 57), 95687#(<= main_~i~1 60), 95686#(<= main_~i~1 59), 95689#(<= main_~i~1 62), 95688#(<= main_~i~1 61)] [2018-02-04 16:15:04,887 INFO L134 CoverageAnalysis]: Checked inductivity of 24831 backedges. 0 proven. 13361 refuted. 0 times theorem prover too weak. 11470 trivial. 0 not checked. [2018-02-04 16:15:04,887 INFO L409 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-02-04 16:15:04,887 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-02-04 16:15:04,887 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2080, Invalid=2080, Unknown=0, NotChecked=0, Total=4160 [2018-02-04 16:15:04,888 INFO L87 Difference]: Start difference. First operand 1233 states and 1537 transitions. Second operand 65 states. [2018-02-04 16:15:06,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:15:06,263 INFO L93 Difference]: Finished difference Result 1586 states and 1837 transitions. [2018-02-04 16:15:06,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-02-04 16:15:06,263 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 831 [2018-02-04 16:15:06,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:15:06,265 INFO L225 Difference]: With dead ends: 1586 [2018-02-04 16:15:06,266 INFO L226 Difference]: Without dead ends: 1586 [2018-02-04 16:15:06,266 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=2080, Invalid=2080, Unknown=0, NotChecked=0, Total=4160 [2018-02-04 16:15:06,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1586 states. [2018-02-04 16:15:06,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1586 to 1252. [2018-02-04 16:15:06,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1252 states. [2018-02-04 16:15:06,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1252 states to 1252 states and 1561 transitions. [2018-02-04 16:15:06,276 INFO L78 Accepts]: Start accepts. Automaton has 1252 states and 1561 transitions. Word has length 831 [2018-02-04 16:15:06,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:15:06,277 INFO L432 AbstractCegarLoop]: Abstraction has 1252 states and 1561 transitions. [2018-02-04 16:15:06,277 INFO L433 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-02-04 16:15:06,277 INFO L276 IsEmpty]: Start isEmpty. Operand 1252 states and 1561 transitions. [2018-02-04 16:15:06,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 845 [2018-02-04 16:15:06,281 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:15:06,281 INFO L351 BasicCegarLoop]: trace histogram [64, 64, 63, 63, 63, 63, 63, 63, 63, 63, 63, 63, 63, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:15:06,281 INFO L371 AbstractCegarLoop]: === Iteration 75 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 16:15:06,282 INFO L82 PathProgramCache]: Analyzing trace with hash -1016092269, now seen corresponding path program 61 times [2018-02-04 16:15:06,282 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:15:06,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:15:06,332 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:15:08,891 INFO L134 CoverageAnalysis]: Checked inductivity of 25641 backedges. 0 proven. 13797 refuted. 0 times theorem prover too weak. 11844 trivial. 0 not checked. [2018-02-04 16:15:08,891 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:15:08,892 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66] total 66 [2018-02-04 16:15:08,892 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:15:08,892 INFO L134 CoverageAnalysis]: Checked inductivity of 10800 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10800 trivial. 0 not checked. [2018-02-04 16:15:08,892 INFO L182 omatonBuilderFactory]: Interpolants [98561#(<= main_~i~1 31), 98560#(<= main_~i~1 30), 98563#(<= main_~i~1 33), 98562#(<= main_~i~1 32), 98565#(<= main_~i~1 35), 98564#(<= main_~i~1 34), 98567#(<= main_~i~1 37), 98566#(<= main_~i~1 36), 98569#(<= main_~i~1 39), 98568#(<= main_~i~1 38), 98571#(<= main_~i~1 41), 98570#(<= main_~i~1 40), 98573#(<= main_~i~1 43), 98572#(<= main_~i~1 42), 98575#(<= main_~i~1 45), 98574#(<= main_~i~1 44), 98577#(<= main_~i~1 47), 98576#(<= main_~i~1 46), 98579#(<= main_~i~1 49), 98578#(<= main_~i~1 48), 98581#(<= main_~i~1 51), 98580#(<= main_~i~1 50), 98583#(<= main_~i~1 53), 98582#(<= main_~i~1 52), 98585#(<= main_~i~1 55), 98584#(<= main_~i~1 54), 98587#(<= main_~i~1 57), 98586#(<= main_~i~1 56), 98589#(<= main_~i~1 59), 98588#(<= main_~i~1 58), 98591#(<= main_~i~1 61), 98590#(<= main_~i~1 60), 98593#(<= main_~i~1 63), 98592#(<= main_~i~1 62), 98529#false, 98528#true, 98531#(<= main_~i~1 1), 98530#(= main_~i~1 0), 98533#(<= main_~i~1 3), 98532#(<= main_~i~1 2), 98535#(<= main_~i~1 5), 98534#(<= main_~i~1 4), 98537#(<= main_~i~1 7), 98536#(<= main_~i~1 6), 98539#(<= main_~i~1 9), 98538#(<= main_~i~1 8), 98541#(<= main_~i~1 11), 98540#(<= main_~i~1 10), 98543#(<= main_~i~1 13), 98542#(<= main_~i~1 12), 98545#(<= main_~i~1 15), 98544#(<= main_~i~1 14), 98547#(<= main_~i~1 17), 98546#(<= main_~i~1 16), 98549#(<= main_~i~1 19), 98548#(<= main_~i~1 18), 98551#(<= main_~i~1 21), 98550#(<= main_~i~1 20), 98553#(<= main_~i~1 23), 98552#(<= main_~i~1 22), 98555#(<= main_~i~1 25), 98554#(<= main_~i~1 24), 98557#(<= main_~i~1 27), 98556#(<= main_~i~1 26), 98559#(<= main_~i~1 29), 98558#(<= main_~i~1 28)] [2018-02-04 16:15:08,893 INFO L134 CoverageAnalysis]: Checked inductivity of 25641 backedges. 0 proven. 13797 refuted. 0 times theorem prover too weak. 11844 trivial. 0 not checked. [2018-02-04 16:15:08,893 INFO L409 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-02-04 16:15:08,893 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-02-04 16:15:08,893 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2018-02-04 16:15:08,893 INFO L87 Difference]: Start difference. First operand 1252 states and 1561 transitions. Second operand 66 states. [2018-02-04 16:15:09,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:15:09,749 INFO L93 Difference]: Finished difference Result 1610 states and 1865 transitions. [2018-02-04 16:15:09,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-02-04 16:15:09,749 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 844 [2018-02-04 16:15:09,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:15:09,751 INFO L225 Difference]: With dead ends: 1610 [2018-02-04 16:15:09,751 INFO L226 Difference]: Without dead ends: 1610 [2018-02-04 16:15:09,751 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2018-02-04 16:15:09,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1610 states. [2018-02-04 16:15:09,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1610 to 1271. [2018-02-04 16:15:09,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1271 states. [2018-02-04 16:15:09,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1271 states to 1271 states and 1585 transitions. [2018-02-04 16:15:09,760 INFO L78 Accepts]: Start accepts. Automaton has 1271 states and 1585 transitions. Word has length 844 [2018-02-04 16:15:09,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:15:09,760 INFO L432 AbstractCegarLoop]: Abstraction has 1271 states and 1585 transitions. [2018-02-04 16:15:09,760 INFO L433 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-02-04 16:15:09,760 INFO L276 IsEmpty]: Start isEmpty. Operand 1271 states and 1585 transitions. [2018-02-04 16:15:09,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 858 [2018-02-04 16:15:09,764 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:15:09,764 INFO L351 BasicCegarLoop]: trace histogram [65, 65, 64, 64, 64, 64, 64, 64, 64, 64, 64, 64, 64, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:15:09,765 INFO L371 AbstractCegarLoop]: === Iteration 76 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 16:15:09,765 INFO L82 PathProgramCache]: Analyzing trace with hash 158217828, now seen corresponding path program 62 times [2018-02-04 16:15:09,765 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:15:09,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:15:09,806 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:15:12,573 INFO L134 CoverageAnalysis]: Checked inductivity of 26464 backedges. 0 proven. 14240 refuted. 0 times theorem prover too weak. 12224 trivial. 0 not checked. [2018-02-04 16:15:12,574 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:15:12,574 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2018-02-04 16:15:12,574 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:15:12,574 INFO L134 CoverageAnalysis]: Checked inductivity of 11163 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11163 trivial. 0 not checked. [2018-02-04 16:15:12,575 INFO L182 omatonBuilderFactory]: Interpolants [101505#(<= main_~i~1 28), 101504#(<= main_~i~1 27), 101507#(<= main_~i~1 30), 101506#(<= main_~i~1 29), 101509#(<= main_~i~1 32), 101508#(<= main_~i~1 31), 101511#(<= main_~i~1 34), 101510#(<= main_~i~1 33), 101513#(<= main_~i~1 36), 101512#(<= main_~i~1 35), 101515#(<= main_~i~1 38), 101514#(<= main_~i~1 37), 101517#(<= main_~i~1 40), 101516#(<= main_~i~1 39), 101519#(<= main_~i~1 42), 101518#(<= main_~i~1 41), 101521#(<= main_~i~1 44), 101520#(<= main_~i~1 43), 101523#(<= main_~i~1 46), 101522#(<= main_~i~1 45), 101525#(<= main_~i~1 48), 101524#(<= main_~i~1 47), 101527#(<= main_~i~1 50), 101526#(<= main_~i~1 49), 101529#(<= main_~i~1 52), 101528#(<= main_~i~1 51), 101531#(<= main_~i~1 54), 101530#(<= main_~i~1 53), 101533#(<= main_~i~1 56), 101532#(<= main_~i~1 55), 101535#(<= main_~i~1 58), 101534#(<= main_~i~1 57), 101537#(<= main_~i~1 60), 101536#(<= main_~i~1 59), 101539#(<= main_~i~1 62), 101538#(<= main_~i~1 61), 101541#(<= main_~i~1 64), 101540#(<= main_~i~1 63), 101475#true, 101477#(= main_~i~1 0), 101476#false, 101479#(<= main_~i~1 2), 101478#(<= main_~i~1 1), 101481#(<= main_~i~1 4), 101480#(<= main_~i~1 3), 101483#(<= main_~i~1 6), 101482#(<= main_~i~1 5), 101485#(<= main_~i~1 8), 101484#(<= main_~i~1 7), 101487#(<= main_~i~1 10), 101486#(<= main_~i~1 9), 101489#(<= main_~i~1 12), 101488#(<= main_~i~1 11), 101491#(<= main_~i~1 14), 101490#(<= main_~i~1 13), 101493#(<= main_~i~1 16), 101492#(<= main_~i~1 15), 101495#(<= main_~i~1 18), 101494#(<= main_~i~1 17), 101497#(<= main_~i~1 20), 101496#(<= main_~i~1 19), 101499#(<= main_~i~1 22), 101498#(<= main_~i~1 21), 101501#(<= main_~i~1 24), 101500#(<= main_~i~1 23), 101503#(<= main_~i~1 26), 101502#(<= main_~i~1 25)] [2018-02-04 16:15:12,575 INFO L134 CoverageAnalysis]: Checked inductivity of 26464 backedges. 0 proven. 14240 refuted. 0 times theorem prover too weak. 12224 trivial. 0 not checked. [2018-02-04 16:15:12,575 INFO L409 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-02-04 16:15:12,576 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-02-04 16:15:12,576 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2211, Invalid=2211, Unknown=0, NotChecked=0, Total=4422 [2018-02-04 16:15:12,576 INFO L87 Difference]: Start difference. First operand 1271 states and 1585 transitions. Second operand 67 states. [2018-02-04 16:15:13,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:15:13,501 INFO L93 Difference]: Finished difference Result 1634 states and 1893 transitions. [2018-02-04 16:15:13,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-02-04 16:15:13,502 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 857 [2018-02-04 16:15:13,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:15:13,503 INFO L225 Difference]: With dead ends: 1634 [2018-02-04 16:15:13,504 INFO L226 Difference]: Without dead ends: 1634 [2018-02-04 16:15:13,504 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=2211, Invalid=2211, Unknown=0, NotChecked=0, Total=4422 [2018-02-04 16:15:13,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1634 states. [2018-02-04 16:15:13,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1634 to 1290. [2018-02-04 16:15:13,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1290 states. [2018-02-04 16:15:13,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1290 states to 1290 states and 1609 transitions. [2018-02-04 16:15:13,514 INFO L78 Accepts]: Start accepts. Automaton has 1290 states and 1609 transitions. Word has length 857 [2018-02-04 16:15:13,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:15:13,514 INFO L432 AbstractCegarLoop]: Abstraction has 1290 states and 1609 transitions. [2018-02-04 16:15:13,514 INFO L433 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-02-04 16:15:13,514 INFO L276 IsEmpty]: Start isEmpty. Operand 1290 states and 1609 transitions. [2018-02-04 16:15:13,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 871 [2018-02-04 16:15:13,518 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:15:13,519 INFO L351 BasicCegarLoop]: trace histogram [66, 66, 65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:15:13,519 INFO L371 AbstractCegarLoop]: === Iteration 77 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 16:15:13,519 INFO L82 PathProgramCache]: Analyzing trace with hash -1601911501, now seen corresponding path program 63 times [2018-02-04 16:15:13,519 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:15:13,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:15:13,580 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:15:16,416 INFO L134 CoverageAnalysis]: Checked inductivity of 27300 backedges. 0 proven. 14690 refuted. 0 times theorem prover too weak. 12610 trivial. 0 not checked. [2018-02-04 16:15:16,417 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:15:16,417 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68] total 68 [2018-02-04 16:15:16,417 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:15:16,417 INFO L134 CoverageAnalysis]: Checked inductivity of 11532 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11532 trivial. 0 not checked. [2018-02-04 16:15:16,417 INFO L182 omatonBuilderFactory]: Interpolants [104467#false, 104466#true, 104469#(<= main_~i~1 1), 104468#(= main_~i~1 0), 104471#(<= main_~i~1 3), 104470#(<= main_~i~1 2), 104473#(<= main_~i~1 5), 104472#(<= main_~i~1 4), 104475#(<= main_~i~1 7), 104474#(<= main_~i~1 6), 104477#(<= main_~i~1 9), 104476#(<= main_~i~1 8), 104479#(<= main_~i~1 11), 104478#(<= main_~i~1 10), 104481#(<= main_~i~1 13), 104480#(<= main_~i~1 12), 104483#(<= main_~i~1 15), 104482#(<= main_~i~1 14), 104485#(<= main_~i~1 17), 104484#(<= main_~i~1 16), 104487#(<= main_~i~1 19), 104486#(<= main_~i~1 18), 104489#(<= main_~i~1 21), 104488#(<= main_~i~1 20), 104491#(<= main_~i~1 23), 104490#(<= main_~i~1 22), 104493#(<= main_~i~1 25), 104492#(<= main_~i~1 24), 104495#(<= main_~i~1 27), 104494#(<= main_~i~1 26), 104497#(<= main_~i~1 29), 104496#(<= main_~i~1 28), 104499#(<= main_~i~1 31), 104498#(<= main_~i~1 30), 104501#(<= main_~i~1 33), 104500#(<= main_~i~1 32), 104503#(<= main_~i~1 35), 104502#(<= main_~i~1 34), 104505#(<= main_~i~1 37), 104504#(<= main_~i~1 36), 104507#(<= main_~i~1 39), 104506#(<= main_~i~1 38), 104509#(<= main_~i~1 41), 104508#(<= main_~i~1 40), 104511#(<= main_~i~1 43), 104510#(<= main_~i~1 42), 104513#(<= main_~i~1 45), 104512#(<= main_~i~1 44), 104515#(<= main_~i~1 47), 104514#(<= main_~i~1 46), 104517#(<= main_~i~1 49), 104516#(<= main_~i~1 48), 104519#(<= main_~i~1 51), 104518#(<= main_~i~1 50), 104521#(<= main_~i~1 53), 104520#(<= main_~i~1 52), 104523#(<= main_~i~1 55), 104522#(<= main_~i~1 54), 104525#(<= main_~i~1 57), 104524#(<= main_~i~1 56), 104527#(<= main_~i~1 59), 104526#(<= main_~i~1 58), 104529#(<= main_~i~1 61), 104528#(<= main_~i~1 60), 104531#(<= main_~i~1 63), 104530#(<= main_~i~1 62), 104533#(<= main_~i~1 65), 104532#(<= main_~i~1 64)] [2018-02-04 16:15:16,418 INFO L134 CoverageAnalysis]: Checked inductivity of 27300 backedges. 0 proven. 14690 refuted. 0 times theorem prover too weak. 12610 trivial. 0 not checked. [2018-02-04 16:15:16,418 INFO L409 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-02-04 16:15:16,418 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-02-04 16:15:16,418 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2018-02-04 16:15:16,418 INFO L87 Difference]: Start difference. First operand 1290 states and 1609 transitions. Second operand 68 states. [2018-02-04 16:15:17,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:15:17,749 INFO L93 Difference]: Finished difference Result 1658 states and 1921 transitions. [2018-02-04 16:15:17,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-02-04 16:15:17,772 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 870 [2018-02-04 16:15:17,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:15:17,774 INFO L225 Difference]: With dead ends: 1658 [2018-02-04 16:15:17,774 INFO L226 Difference]: Without dead ends: 1658 [2018-02-04 16:15:17,774 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2018-02-04 16:15:17,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1658 states. [2018-02-04 16:15:17,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1658 to 1309. [2018-02-04 16:15:17,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1309 states. [2018-02-04 16:15:17,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1309 states to 1309 states and 1633 transitions. [2018-02-04 16:15:17,783 INFO L78 Accepts]: Start accepts. Automaton has 1309 states and 1633 transitions. Word has length 870 [2018-02-04 16:15:17,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:15:17,783 INFO L432 AbstractCegarLoop]: Abstraction has 1309 states and 1633 transitions. [2018-02-04 16:15:17,783 INFO L433 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-02-04 16:15:17,784 INFO L276 IsEmpty]: Start isEmpty. Operand 1309 states and 1633 transitions. [2018-02-04 16:15:17,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 884 [2018-02-04 16:15:17,788 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:15:17,788 INFO L351 BasicCegarLoop]: trace histogram [67, 67, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:15:17,788 INFO L371 AbstractCegarLoop]: === Iteration 78 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 16:15:17,788 INFO L82 PathProgramCache]: Analyzing trace with hash 1700462276, now seen corresponding path program 64 times [2018-02-04 16:15:17,788 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:15:17,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:15:17,831 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:15:20,722 INFO L134 CoverageAnalysis]: Checked inductivity of 28149 backedges. 0 proven. 15147 refuted. 0 times theorem prover too weak. 13002 trivial. 0 not checked. [2018-02-04 16:15:20,722 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:15:20,722 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2018-02-04 16:15:20,723 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:15:20,723 INFO L134 CoverageAnalysis]: Checked inductivity of 11907 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11907 trivial. 0 not checked. [2018-02-04 16:15:20,723 INFO L182 omatonBuilderFactory]: Interpolants [107521#(<= main_~i~1 18), 107520#(<= main_~i~1 17), 107523#(<= main_~i~1 20), 107522#(<= main_~i~1 19), 107525#(<= main_~i~1 22), 107524#(<= main_~i~1 21), 107527#(<= main_~i~1 24), 107526#(<= main_~i~1 23), 107529#(<= main_~i~1 26), 107528#(<= main_~i~1 25), 107531#(<= main_~i~1 28), 107530#(<= main_~i~1 27), 107533#(<= main_~i~1 30), 107532#(<= main_~i~1 29), 107535#(<= main_~i~1 32), 107534#(<= main_~i~1 31), 107537#(<= main_~i~1 34), 107536#(<= main_~i~1 33), 107539#(<= main_~i~1 36), 107538#(<= main_~i~1 35), 107541#(<= main_~i~1 38), 107540#(<= main_~i~1 37), 107543#(<= main_~i~1 40), 107542#(<= main_~i~1 39), 107545#(<= main_~i~1 42), 107544#(<= main_~i~1 41), 107547#(<= main_~i~1 44), 107546#(<= main_~i~1 43), 107549#(<= main_~i~1 46), 107548#(<= main_~i~1 45), 107551#(<= main_~i~1 48), 107550#(<= main_~i~1 47), 107553#(<= main_~i~1 50), 107552#(<= main_~i~1 49), 107555#(<= main_~i~1 52), 107554#(<= main_~i~1 51), 107557#(<= main_~i~1 54), 107556#(<= main_~i~1 53), 107559#(<= main_~i~1 56), 107558#(<= main_~i~1 55), 107561#(<= main_~i~1 58), 107560#(<= main_~i~1 57), 107563#(<= main_~i~1 60), 107562#(<= main_~i~1 59), 107565#(<= main_~i~1 62), 107564#(<= main_~i~1 61), 107567#(<= main_~i~1 64), 107566#(<= main_~i~1 63), 107569#(<= main_~i~1 66), 107568#(<= main_~i~1 65), 107501#true, 107503#(= main_~i~1 0), 107502#false, 107505#(<= main_~i~1 2), 107504#(<= main_~i~1 1), 107507#(<= main_~i~1 4), 107506#(<= main_~i~1 3), 107509#(<= main_~i~1 6), 107508#(<= main_~i~1 5), 107511#(<= main_~i~1 8), 107510#(<= main_~i~1 7), 107513#(<= main_~i~1 10), 107512#(<= main_~i~1 9), 107515#(<= main_~i~1 12), 107514#(<= main_~i~1 11), 107517#(<= main_~i~1 14), 107516#(<= main_~i~1 13), 107519#(<= main_~i~1 16), 107518#(<= main_~i~1 15)] [2018-02-04 16:15:20,724 INFO L134 CoverageAnalysis]: Checked inductivity of 28149 backedges. 0 proven. 15147 refuted. 0 times theorem prover too weak. 13002 trivial. 0 not checked. [2018-02-04 16:15:20,724 INFO L409 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-02-04 16:15:20,725 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-02-04 16:15:20,725 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2346, Invalid=2346, Unknown=0, NotChecked=0, Total=4692 [2018-02-04 16:15:20,725 INFO L87 Difference]: Start difference. First operand 1309 states and 1633 transitions. Second operand 69 states. [2018-02-04 16:15:21,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:15:21,921 INFO L93 Difference]: Finished difference Result 1682 states and 1949 transitions. [2018-02-04 16:15:21,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-02-04 16:15:21,921 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 883 [2018-02-04 16:15:21,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:15:21,923 INFO L225 Difference]: With dead ends: 1682 [2018-02-04 16:15:21,923 INFO L226 Difference]: Without dead ends: 1682 [2018-02-04 16:15:21,924 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=2346, Invalid=2346, Unknown=0, NotChecked=0, Total=4692 [2018-02-04 16:15:21,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1682 states. [2018-02-04 16:15:21,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1682 to 1328. [2018-02-04 16:15:21,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1328 states. [2018-02-04 16:15:21,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1328 states to 1328 states and 1657 transitions. [2018-02-04 16:15:21,934 INFO L78 Accepts]: Start accepts. Automaton has 1328 states and 1657 transitions. Word has length 883 [2018-02-04 16:15:21,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:15:21,934 INFO L432 AbstractCegarLoop]: Abstraction has 1328 states and 1657 transitions. [2018-02-04 16:15:21,934 INFO L433 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-02-04 16:15:21,934 INFO L276 IsEmpty]: Start isEmpty. Operand 1328 states and 1657 transitions. [2018-02-04 16:15:21,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 897 [2018-02-04 16:15:21,938 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:15:21,939 INFO L351 BasicCegarLoop]: trace histogram [68, 68, 67, 67, 67, 67, 67, 67, 67, 67, 67, 67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:15:21,939 INFO L371 AbstractCegarLoop]: === Iteration 79 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 16:15:21,939 INFO L82 PathProgramCache]: Analyzing trace with hash -53962541, now seen corresponding path program 65 times [2018-02-04 16:15:21,939 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:15:21,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:15:21,990 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:15:25,075 INFO L134 CoverageAnalysis]: Checked inductivity of 29011 backedges. 0 proven. 15611 refuted. 0 times theorem prover too weak. 13400 trivial. 0 not checked. [2018-02-04 16:15:25,075 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:15:25,075 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70] total 70 [2018-02-04 16:15:25,075 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:15:25,076 INFO L134 CoverageAnalysis]: Checked inductivity of 12288 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12288 trivial. 0 not checked. [2018-02-04 16:15:25,076 INFO L182 omatonBuilderFactory]: Interpolants [110593#(<= main_~i~1 11), 110592#(<= main_~i~1 10), 110595#(<= main_~i~1 13), 110594#(<= main_~i~1 12), 110597#(<= main_~i~1 15), 110596#(<= main_~i~1 14), 110599#(<= main_~i~1 17), 110598#(<= main_~i~1 16), 110601#(<= main_~i~1 19), 110600#(<= main_~i~1 18), 110603#(<= main_~i~1 21), 110602#(<= main_~i~1 20), 110605#(<= main_~i~1 23), 110604#(<= main_~i~1 22), 110607#(<= main_~i~1 25), 110606#(<= main_~i~1 24), 110609#(<= main_~i~1 27), 110608#(<= main_~i~1 26), 110611#(<= main_~i~1 29), 110610#(<= main_~i~1 28), 110613#(<= main_~i~1 31), 110612#(<= main_~i~1 30), 110615#(<= main_~i~1 33), 110614#(<= main_~i~1 32), 110617#(<= main_~i~1 35), 110616#(<= main_~i~1 34), 110619#(<= main_~i~1 37), 110618#(<= main_~i~1 36), 110621#(<= main_~i~1 39), 110620#(<= main_~i~1 38), 110623#(<= main_~i~1 41), 110622#(<= main_~i~1 40), 110625#(<= main_~i~1 43), 110624#(<= main_~i~1 42), 110627#(<= main_~i~1 45), 110626#(<= main_~i~1 44), 110629#(<= main_~i~1 47), 110628#(<= main_~i~1 46), 110631#(<= main_~i~1 49), 110630#(<= main_~i~1 48), 110633#(<= main_~i~1 51), 110632#(<= main_~i~1 50), 110635#(<= main_~i~1 53), 110634#(<= main_~i~1 52), 110637#(<= main_~i~1 55), 110636#(<= main_~i~1 54), 110639#(<= main_~i~1 57), 110638#(<= main_~i~1 56), 110641#(<= main_~i~1 59), 110640#(<= main_~i~1 58), 110643#(<= main_~i~1 61), 110642#(<= main_~i~1 60), 110645#(<= main_~i~1 63), 110644#(<= main_~i~1 62), 110647#(<= main_~i~1 65), 110646#(<= main_~i~1 64), 110649#(<= main_~i~1 67), 110648#(<= main_~i~1 66), 110581#false, 110580#true, 110583#(<= main_~i~1 1), 110582#(= main_~i~1 0), 110585#(<= main_~i~1 3), 110584#(<= main_~i~1 2), 110587#(<= main_~i~1 5), 110586#(<= main_~i~1 4), 110589#(<= main_~i~1 7), 110588#(<= main_~i~1 6), 110591#(<= main_~i~1 9), 110590#(<= main_~i~1 8)] [2018-02-04 16:15:25,076 INFO L134 CoverageAnalysis]: Checked inductivity of 29011 backedges. 0 proven. 15611 refuted. 0 times theorem prover too weak. 13400 trivial. 0 not checked. [2018-02-04 16:15:25,077 INFO L409 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-02-04 16:15:25,077 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-02-04 16:15:25,077 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2018-02-04 16:15:25,077 INFO L87 Difference]: Start difference. First operand 1328 states and 1657 transitions. Second operand 70 states. [2018-02-04 16:15:26,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:15:26,300 INFO L93 Difference]: Finished difference Result 1706 states and 1977 transitions. [2018-02-04 16:15:26,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-02-04 16:15:26,301 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 896 [2018-02-04 16:15:26,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:15:26,303 INFO L225 Difference]: With dead ends: 1706 [2018-02-04 16:15:26,303 INFO L226 Difference]: Without dead ends: 1706 [2018-02-04 16:15:26,303 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2018-02-04 16:15:26,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1706 states. [2018-02-04 16:15:26,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1706 to 1347. [2018-02-04 16:15:26,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1347 states. [2018-02-04 16:15:26,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1347 states to 1347 states and 1681 transitions. [2018-02-04 16:15:26,312 INFO L78 Accepts]: Start accepts. Automaton has 1347 states and 1681 transitions. Word has length 896 [2018-02-04 16:15:26,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:15:26,313 INFO L432 AbstractCegarLoop]: Abstraction has 1347 states and 1681 transitions. [2018-02-04 16:15:26,313 INFO L433 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-02-04 16:15:26,313 INFO L276 IsEmpty]: Start isEmpty. Operand 1347 states and 1681 transitions. [2018-02-04 16:15:26,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 910 [2018-02-04 16:15:26,317 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:15:26,317 INFO L351 BasicCegarLoop]: trace histogram [69, 69, 68, 68, 68, 68, 68, 68, 68, 68, 68, 68, 68, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:15:26,317 INFO L371 AbstractCegarLoop]: === Iteration 80 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 16:15:26,317 INFO L82 PathProgramCache]: Analyzing trace with hash 1170476836, now seen corresponding path program 66 times [2018-02-04 16:15:26,318 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:15:26,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:15:26,371 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:15:29,530 INFO L134 CoverageAnalysis]: Checked inductivity of 29886 backedges. 0 proven. 16082 refuted. 0 times theorem prover too weak. 13804 trivial. 0 not checked. [2018-02-04 16:15:29,530 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:15:29,530 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2018-02-04 16:15:29,530 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:15:29,531 INFO L134 CoverageAnalysis]: Checked inductivity of 12675 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12675 trivial. 0 not checked. [2018-02-04 16:15:29,531 INFO L182 omatonBuilderFactory]: Interpolants [113703#true, 113705#(= main_~i~1 0), 113704#false, 113707#(<= main_~i~1 2), 113706#(<= main_~i~1 1), 113709#(<= main_~i~1 4), 113708#(<= main_~i~1 3), 113711#(<= main_~i~1 6), 113710#(<= main_~i~1 5), 113713#(<= main_~i~1 8), 113712#(<= main_~i~1 7), 113715#(<= main_~i~1 10), 113714#(<= main_~i~1 9), 113717#(<= main_~i~1 12), 113716#(<= main_~i~1 11), 113719#(<= main_~i~1 14), 113718#(<= main_~i~1 13), 113721#(<= main_~i~1 16), 113720#(<= main_~i~1 15), 113723#(<= main_~i~1 18), 113722#(<= main_~i~1 17), 113725#(<= main_~i~1 20), 113724#(<= main_~i~1 19), 113727#(<= main_~i~1 22), 113726#(<= main_~i~1 21), 113729#(<= main_~i~1 24), 113728#(<= main_~i~1 23), 113731#(<= main_~i~1 26), 113730#(<= main_~i~1 25), 113733#(<= main_~i~1 28), 113732#(<= main_~i~1 27), 113735#(<= main_~i~1 30), 113734#(<= main_~i~1 29), 113737#(<= main_~i~1 32), 113736#(<= main_~i~1 31), 113739#(<= main_~i~1 34), 113738#(<= main_~i~1 33), 113741#(<= main_~i~1 36), 113740#(<= main_~i~1 35), 113743#(<= main_~i~1 38), 113742#(<= main_~i~1 37), 113745#(<= main_~i~1 40), 113744#(<= main_~i~1 39), 113747#(<= main_~i~1 42), 113746#(<= main_~i~1 41), 113749#(<= main_~i~1 44), 113748#(<= main_~i~1 43), 113751#(<= main_~i~1 46), 113750#(<= main_~i~1 45), 113753#(<= main_~i~1 48), 113752#(<= main_~i~1 47), 113755#(<= main_~i~1 50), 113754#(<= main_~i~1 49), 113757#(<= main_~i~1 52), 113756#(<= main_~i~1 51), 113759#(<= main_~i~1 54), 113758#(<= main_~i~1 53), 113761#(<= main_~i~1 56), 113760#(<= main_~i~1 55), 113763#(<= main_~i~1 58), 113762#(<= main_~i~1 57), 113765#(<= main_~i~1 60), 113764#(<= main_~i~1 59), 113767#(<= main_~i~1 62), 113766#(<= main_~i~1 61), 113769#(<= main_~i~1 64), 113768#(<= main_~i~1 63), 113771#(<= main_~i~1 66), 113770#(<= main_~i~1 65), 113773#(<= main_~i~1 68), 113772#(<= main_~i~1 67)] [2018-02-04 16:15:29,531 INFO L134 CoverageAnalysis]: Checked inductivity of 29886 backedges. 0 proven. 16082 refuted. 0 times theorem prover too weak. 13804 trivial. 0 not checked. [2018-02-04 16:15:29,532 INFO L409 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-02-04 16:15:29,532 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-02-04 16:15:29,532 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2485, Invalid=2485, Unknown=0, NotChecked=0, Total=4970 [2018-02-04 16:15:29,532 INFO L87 Difference]: Start difference. First operand 1347 states and 1681 transitions. Second operand 71 states. [2018-02-04 16:15:30,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:15:30,961 INFO L93 Difference]: Finished difference Result 1730 states and 2005 transitions. [2018-02-04 16:15:30,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-02-04 16:15:30,961 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 909 [2018-02-04 16:15:30,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:15:30,963 INFO L225 Difference]: With dead ends: 1730 [2018-02-04 16:15:30,963 INFO L226 Difference]: Without dead ends: 1730 [2018-02-04 16:15:30,963 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=2485, Invalid=2485, Unknown=0, NotChecked=0, Total=4970 [2018-02-04 16:15:30,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1730 states. [2018-02-04 16:15:30,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1730 to 1366. [2018-02-04 16:15:30,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1366 states. [2018-02-04 16:15:30,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1366 states to 1366 states and 1705 transitions. [2018-02-04 16:15:30,972 INFO L78 Accepts]: Start accepts. Automaton has 1366 states and 1705 transitions. Word has length 909 [2018-02-04 16:15:30,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:15:30,973 INFO L432 AbstractCegarLoop]: Abstraction has 1366 states and 1705 transitions. [2018-02-04 16:15:30,973 INFO L433 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-02-04 16:15:30,973 INFO L276 IsEmpty]: Start isEmpty. Operand 1366 states and 1705 transitions. [2018-02-04 16:15:30,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 923 [2018-02-04 16:15:30,977 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:15:30,977 INFO L351 BasicCegarLoop]: trace histogram [70, 70, 69, 69, 69, 69, 69, 69, 69, 69, 69, 69, 69, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:15:30,978 INFO L371 AbstractCegarLoop]: === Iteration 81 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 16:15:30,978 INFO L82 PathProgramCache]: Analyzing trace with hash 1589978227, now seen corresponding path program 67 times [2018-02-04 16:15:30,978 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:15:31,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:15:31,025 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:15:34,240 INFO L134 CoverageAnalysis]: Checked inductivity of 30774 backedges. 0 proven. 16560 refuted. 0 times theorem prover too weak. 14214 trivial. 0 not checked. [2018-02-04 16:15:34,240 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:15:34,296 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72] total 72 [2018-02-04 16:15:34,296 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:15:34,297 INFO L134 CoverageAnalysis]: Checked inductivity of 13068 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13068 trivial. 0 not checked. [2018-02-04 16:15:34,297 INFO L182 omatonBuilderFactory]: Interpolants [116871#false, 116870#true, 116873#(<= main_~i~1 1), 116872#(= main_~i~1 0), 116875#(<= main_~i~1 3), 116874#(<= main_~i~1 2), 116877#(<= main_~i~1 5), 116876#(<= main_~i~1 4), 116879#(<= main_~i~1 7), 116878#(<= main_~i~1 6), 116881#(<= main_~i~1 9), 116880#(<= main_~i~1 8), 116883#(<= main_~i~1 11), 116882#(<= main_~i~1 10), 116885#(<= main_~i~1 13), 116884#(<= main_~i~1 12), 116887#(<= main_~i~1 15), 116886#(<= main_~i~1 14), 116889#(<= main_~i~1 17), 116888#(<= main_~i~1 16), 116891#(<= main_~i~1 19), 116890#(<= main_~i~1 18), 116893#(<= main_~i~1 21), 116892#(<= main_~i~1 20), 116895#(<= main_~i~1 23), 116894#(<= main_~i~1 22), 116897#(<= main_~i~1 25), 116896#(<= main_~i~1 24), 116899#(<= main_~i~1 27), 116898#(<= main_~i~1 26), 116901#(<= main_~i~1 29), 116900#(<= main_~i~1 28), 116903#(<= main_~i~1 31), 116902#(<= main_~i~1 30), 116905#(<= main_~i~1 33), 116904#(<= main_~i~1 32), 116907#(<= main_~i~1 35), 116906#(<= main_~i~1 34), 116909#(<= main_~i~1 37), 116908#(<= main_~i~1 36), 116911#(<= main_~i~1 39), 116910#(<= main_~i~1 38), 116913#(<= main_~i~1 41), 116912#(<= main_~i~1 40), 116915#(<= main_~i~1 43), 116914#(<= main_~i~1 42), 116917#(<= main_~i~1 45), 116916#(<= main_~i~1 44), 116919#(<= main_~i~1 47), 116918#(<= main_~i~1 46), 116921#(<= main_~i~1 49), 116920#(<= main_~i~1 48), 116923#(<= main_~i~1 51), 116922#(<= main_~i~1 50), 116925#(<= main_~i~1 53), 116924#(<= main_~i~1 52), 116927#(<= main_~i~1 55), 116926#(<= main_~i~1 54), 116929#(<= main_~i~1 57), 116928#(<= main_~i~1 56), 116931#(<= main_~i~1 59), 116930#(<= main_~i~1 58), 116933#(<= main_~i~1 61), 116932#(<= main_~i~1 60), 116935#(<= main_~i~1 63), 116934#(<= main_~i~1 62), 116937#(<= main_~i~1 65), 116936#(<= main_~i~1 64), 116939#(<= main_~i~1 67), 116938#(<= main_~i~1 66), 116941#(<= main_~i~1 69), 116940#(<= main_~i~1 68)] [2018-02-04 16:15:34,297 INFO L134 CoverageAnalysis]: Checked inductivity of 30774 backedges. 0 proven. 16560 refuted. 0 times theorem prover too weak. 14214 trivial. 0 not checked. [2018-02-04 16:15:34,298 INFO L409 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-02-04 16:15:34,298 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-02-04 16:15:34,298 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2018-02-04 16:15:34,298 INFO L87 Difference]: Start difference. First operand 1366 states and 1705 transitions. Second operand 72 states. [2018-02-04 16:15:35,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:15:35,869 INFO L93 Difference]: Finished difference Result 1754 states and 2033 transitions. [2018-02-04 16:15:35,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-02-04 16:15:35,870 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 922 [2018-02-04 16:15:35,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:15:35,872 INFO L225 Difference]: With dead ends: 1754 [2018-02-04 16:15:35,872 INFO L226 Difference]: Without dead ends: 1754 [2018-02-04 16:15:35,872 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2018-02-04 16:15:35,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1754 states. [2018-02-04 16:15:35,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1754 to 1385. [2018-02-04 16:15:35,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1385 states. [2018-02-04 16:15:35,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1385 states to 1385 states and 1729 transitions. [2018-02-04 16:15:35,881 INFO L78 Accepts]: Start accepts. Automaton has 1385 states and 1729 transitions. Word has length 922 [2018-02-04 16:15:35,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:15:35,882 INFO L432 AbstractCegarLoop]: Abstraction has 1385 states and 1729 transitions. [2018-02-04 16:15:35,882 INFO L433 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-02-04 16:15:35,882 INFO L276 IsEmpty]: Start isEmpty. Operand 1385 states and 1729 transitions. [2018-02-04 16:15:35,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 936 [2018-02-04 16:15:35,886 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:15:35,887 INFO L351 BasicCegarLoop]: trace histogram [71, 71, 70, 70, 70, 70, 70, 70, 70, 70, 70, 70, 70, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:15:35,887 INFO L371 AbstractCegarLoop]: === Iteration 82 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 16:15:35,887 INFO L82 PathProgramCache]: Analyzing trace with hash -1805686908, now seen corresponding path program 68 times [2018-02-04 16:15:35,887 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:15:35,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:15:35,935 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:15:39,345 INFO L134 CoverageAnalysis]: Checked inductivity of 31675 backedges. 0 proven. 17045 refuted. 0 times theorem prover too weak. 14630 trivial. 0 not checked. [2018-02-04 16:15:39,345 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:15:39,345 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2018-02-04 16:15:39,345 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:15:39,345 INFO L134 CoverageAnalysis]: Checked inductivity of 13467 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13467 trivial. 0 not checked. [2018-02-04 16:15:39,346 INFO L182 omatonBuilderFactory]: Interpolants [120081#true, 120083#(= main_~i~1 0), 120082#false, 120085#(<= main_~i~1 2), 120084#(<= main_~i~1 1), 120087#(<= main_~i~1 4), 120086#(<= main_~i~1 3), 120089#(<= main_~i~1 6), 120088#(<= main_~i~1 5), 120091#(<= main_~i~1 8), 120090#(<= main_~i~1 7), 120093#(<= main_~i~1 10), 120092#(<= main_~i~1 9), 120095#(<= main_~i~1 12), 120094#(<= main_~i~1 11), 120097#(<= main_~i~1 14), 120096#(<= main_~i~1 13), 120099#(<= main_~i~1 16), 120098#(<= main_~i~1 15), 120101#(<= main_~i~1 18), 120100#(<= main_~i~1 17), 120103#(<= main_~i~1 20), 120102#(<= main_~i~1 19), 120105#(<= main_~i~1 22), 120104#(<= main_~i~1 21), 120107#(<= main_~i~1 24), 120106#(<= main_~i~1 23), 120109#(<= main_~i~1 26), 120108#(<= main_~i~1 25), 120111#(<= main_~i~1 28), 120110#(<= main_~i~1 27), 120113#(<= main_~i~1 30), 120112#(<= main_~i~1 29), 120115#(<= main_~i~1 32), 120114#(<= main_~i~1 31), 120117#(<= main_~i~1 34), 120116#(<= main_~i~1 33), 120119#(<= main_~i~1 36), 120118#(<= main_~i~1 35), 120121#(<= main_~i~1 38), 120120#(<= main_~i~1 37), 120123#(<= main_~i~1 40), 120122#(<= main_~i~1 39), 120125#(<= main_~i~1 42), 120124#(<= main_~i~1 41), 120127#(<= main_~i~1 44), 120126#(<= main_~i~1 43), 120129#(<= main_~i~1 46), 120128#(<= main_~i~1 45), 120131#(<= main_~i~1 48), 120130#(<= main_~i~1 47), 120133#(<= main_~i~1 50), 120132#(<= main_~i~1 49), 120135#(<= main_~i~1 52), 120134#(<= main_~i~1 51), 120137#(<= main_~i~1 54), 120136#(<= main_~i~1 53), 120139#(<= main_~i~1 56), 120138#(<= main_~i~1 55), 120141#(<= main_~i~1 58), 120140#(<= main_~i~1 57), 120143#(<= main_~i~1 60), 120142#(<= main_~i~1 59), 120145#(<= main_~i~1 62), 120144#(<= main_~i~1 61), 120147#(<= main_~i~1 64), 120146#(<= main_~i~1 63), 120149#(<= main_~i~1 66), 120148#(<= main_~i~1 65), 120151#(<= main_~i~1 68), 120150#(<= main_~i~1 67), 120153#(<= main_~i~1 70), 120152#(<= main_~i~1 69)] [2018-02-04 16:15:39,346 INFO L134 CoverageAnalysis]: Checked inductivity of 31675 backedges. 0 proven. 17045 refuted. 0 times theorem prover too weak. 14630 trivial. 0 not checked. [2018-02-04 16:15:39,346 INFO L409 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-02-04 16:15:39,347 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-02-04 16:15:39,347 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2628, Invalid=2628, Unknown=0, NotChecked=0, Total=5256 [2018-02-04 16:15:39,347 INFO L87 Difference]: Start difference. First operand 1385 states and 1729 transitions. Second operand 73 states. [2018-02-04 16:15:41,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:15:41,027 INFO L93 Difference]: Finished difference Result 1778 states and 2061 transitions. [2018-02-04 16:15:41,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-02-04 16:15:41,028 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 935 [2018-02-04 16:15:41,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:15:41,030 INFO L225 Difference]: With dead ends: 1778 [2018-02-04 16:15:41,030 INFO L226 Difference]: Without dead ends: 1778 [2018-02-04 16:15:41,030 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=2628, Invalid=2628, Unknown=0, NotChecked=0, Total=5256 [2018-02-04 16:15:41,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1778 states. [2018-02-04 16:15:41,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1778 to 1404. [2018-02-04 16:15:41,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1404 states. [2018-02-04 16:15:41,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1404 states to 1404 states and 1753 transitions. [2018-02-04 16:15:41,040 INFO L78 Accepts]: Start accepts. Automaton has 1404 states and 1753 transitions. Word has length 935 [2018-02-04 16:15:41,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:15:41,040 INFO L432 AbstractCegarLoop]: Abstraction has 1404 states and 1753 transitions. [2018-02-04 16:15:41,040 INFO L433 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-02-04 16:15:41,041 INFO L276 IsEmpty]: Start isEmpty. Operand 1404 states and 1753 transitions. [2018-02-04 16:15:41,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 949 [2018-02-04 16:15:41,045 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:15:41,046 INFO L351 BasicCegarLoop]: trace histogram [72, 72, 71, 71, 71, 71, 71, 71, 71, 71, 71, 71, 71, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:15:41,046 INFO L371 AbstractCegarLoop]: === Iteration 83 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 16:15:41,046 INFO L82 PathProgramCache]: Analyzing trace with hash -729520109, now seen corresponding path program 69 times [2018-02-04 16:15:41,046 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:15:41,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:15:41,104 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:15:44,520 INFO L134 CoverageAnalysis]: Checked inductivity of 32589 backedges. 0 proven. 17537 refuted. 0 times theorem prover too weak. 15052 trivial. 0 not checked. [2018-02-04 16:15:44,520 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:15:44,521 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74] total 74 [2018-02-04 16:15:44,521 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:15:44,521 INFO L134 CoverageAnalysis]: Checked inductivity of 13872 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13872 trivial. 0 not checked. [2018-02-04 16:15:44,521 INFO L182 omatonBuilderFactory]: Interpolants [123393#(<= main_~i~1 55), 123392#(<= main_~i~1 54), 123395#(<= main_~i~1 57), 123394#(<= main_~i~1 56), 123397#(<= main_~i~1 59), 123396#(<= main_~i~1 58), 123399#(<= main_~i~1 61), 123398#(<= main_~i~1 60), 123401#(<= main_~i~1 63), 123400#(<= main_~i~1 62), 123403#(<= main_~i~1 65), 123402#(<= main_~i~1 64), 123405#(<= main_~i~1 67), 123404#(<= main_~i~1 66), 123407#(<= main_~i~1 69), 123406#(<= main_~i~1 68), 123409#(<= main_~i~1 71), 123408#(<= main_~i~1 70), 123337#false, 123336#true, 123339#(<= main_~i~1 1), 123338#(= main_~i~1 0), 123341#(<= main_~i~1 3), 123340#(<= main_~i~1 2), 123343#(<= main_~i~1 5), 123342#(<= main_~i~1 4), 123345#(<= main_~i~1 7), 123344#(<= main_~i~1 6), 123347#(<= main_~i~1 9), 123346#(<= main_~i~1 8), 123349#(<= main_~i~1 11), 123348#(<= main_~i~1 10), 123351#(<= main_~i~1 13), 123350#(<= main_~i~1 12), 123353#(<= main_~i~1 15), 123352#(<= main_~i~1 14), 123355#(<= main_~i~1 17), 123354#(<= main_~i~1 16), 123357#(<= main_~i~1 19), 123356#(<= main_~i~1 18), 123359#(<= main_~i~1 21), 123358#(<= main_~i~1 20), 123361#(<= main_~i~1 23), 123360#(<= main_~i~1 22), 123363#(<= main_~i~1 25), 123362#(<= main_~i~1 24), 123365#(<= main_~i~1 27), 123364#(<= main_~i~1 26), 123367#(<= main_~i~1 29), 123366#(<= main_~i~1 28), 123369#(<= main_~i~1 31), 123368#(<= main_~i~1 30), 123371#(<= main_~i~1 33), 123370#(<= main_~i~1 32), 123373#(<= main_~i~1 35), 123372#(<= main_~i~1 34), 123375#(<= main_~i~1 37), 123374#(<= main_~i~1 36), 123377#(<= main_~i~1 39), 123376#(<= main_~i~1 38), 123379#(<= main_~i~1 41), 123378#(<= main_~i~1 40), 123381#(<= main_~i~1 43), 123380#(<= main_~i~1 42), 123383#(<= main_~i~1 45), 123382#(<= main_~i~1 44), 123385#(<= main_~i~1 47), 123384#(<= main_~i~1 46), 123387#(<= main_~i~1 49), 123386#(<= main_~i~1 48), 123389#(<= main_~i~1 51), 123388#(<= main_~i~1 50), 123391#(<= main_~i~1 53), 123390#(<= main_~i~1 52)] [2018-02-04 16:15:44,522 INFO L134 CoverageAnalysis]: Checked inductivity of 32589 backedges. 0 proven. 17537 refuted. 0 times theorem prover too weak. 15052 trivial. 0 not checked. [2018-02-04 16:15:44,522 INFO L409 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-02-04 16:15:44,522 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-02-04 16:15:44,523 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2018-02-04 16:15:44,523 INFO L87 Difference]: Start difference. First operand 1404 states and 1753 transitions. Second operand 74 states. [2018-02-04 16:15:45,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:15:45,950 INFO L93 Difference]: Finished difference Result 1802 states and 2089 transitions. [2018-02-04 16:15:45,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-02-04 16:15:45,950 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 948 [2018-02-04 16:15:45,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:15:45,953 INFO L225 Difference]: With dead ends: 1802 [2018-02-04 16:15:45,953 INFO L226 Difference]: Without dead ends: 1802 [2018-02-04 16:15:45,953 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2018-02-04 16:15:45,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1802 states. [2018-02-04 16:15:45,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1802 to 1423. [2018-02-04 16:15:45,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1423 states. [2018-02-04 16:15:45,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1423 states to 1423 states and 1777 transitions. [2018-02-04 16:15:45,963 INFO L78 Accepts]: Start accepts. Automaton has 1423 states and 1777 transitions. Word has length 948 [2018-02-04 16:15:45,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:15:45,964 INFO L432 AbstractCegarLoop]: Abstraction has 1423 states and 1777 transitions. [2018-02-04 16:15:45,964 INFO L433 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-02-04 16:15:45,964 INFO L276 IsEmpty]: Start isEmpty. Operand 1423 states and 1777 transitions. [2018-02-04 16:15:45,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 962 [2018-02-04 16:15:45,969 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:15:45,970 INFO L351 BasicCegarLoop]: trace histogram [73, 73, 72, 72, 72, 72, 72, 72, 72, 72, 72, 72, 72, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:15:45,970 INFO L371 AbstractCegarLoop]: === Iteration 84 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 16:15:45,970 INFO L82 PathProgramCache]: Analyzing trace with hash -480049180, now seen corresponding path program 70 times [2018-02-04 16:15:45,970 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:15:46,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:15:46,029 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:15:49,595 INFO L134 CoverageAnalysis]: Checked inductivity of 33516 backedges. 0 proven. 18036 refuted. 0 times theorem prover too weak. 15480 trivial. 0 not checked. [2018-02-04 16:15:49,595 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:15:49,595 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2018-02-04 16:15:49,595 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:15:49,596 INFO L134 CoverageAnalysis]: Checked inductivity of 14283 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14283 trivial. 0 not checked. [2018-02-04 16:15:49,596 INFO L182 omatonBuilderFactory]: Interpolants [126635#true, 126637#(= main_~i~1 0), 126636#false, 126639#(<= main_~i~1 2), 126638#(<= main_~i~1 1), 126641#(<= main_~i~1 4), 126640#(<= main_~i~1 3), 126643#(<= main_~i~1 6), 126642#(<= main_~i~1 5), 126645#(<= main_~i~1 8), 126644#(<= main_~i~1 7), 126647#(<= main_~i~1 10), 126646#(<= main_~i~1 9), 126649#(<= main_~i~1 12), 126648#(<= main_~i~1 11), 126651#(<= main_~i~1 14), 126650#(<= main_~i~1 13), 126653#(<= main_~i~1 16), 126652#(<= main_~i~1 15), 126655#(<= main_~i~1 18), 126654#(<= main_~i~1 17), 126657#(<= main_~i~1 20), 126656#(<= main_~i~1 19), 126659#(<= main_~i~1 22), 126658#(<= main_~i~1 21), 126661#(<= main_~i~1 24), 126660#(<= main_~i~1 23), 126663#(<= main_~i~1 26), 126662#(<= main_~i~1 25), 126665#(<= main_~i~1 28), 126664#(<= main_~i~1 27), 126667#(<= main_~i~1 30), 126666#(<= main_~i~1 29), 126669#(<= main_~i~1 32), 126668#(<= main_~i~1 31), 126671#(<= main_~i~1 34), 126670#(<= main_~i~1 33), 126673#(<= main_~i~1 36), 126672#(<= main_~i~1 35), 126675#(<= main_~i~1 38), 126674#(<= main_~i~1 37), 126677#(<= main_~i~1 40), 126676#(<= main_~i~1 39), 126679#(<= main_~i~1 42), 126678#(<= main_~i~1 41), 126681#(<= main_~i~1 44), 126680#(<= main_~i~1 43), 126683#(<= main_~i~1 46), 126682#(<= main_~i~1 45), 126685#(<= main_~i~1 48), 126684#(<= main_~i~1 47), 126687#(<= main_~i~1 50), 126686#(<= main_~i~1 49), 126689#(<= main_~i~1 52), 126688#(<= main_~i~1 51), 126691#(<= main_~i~1 54), 126690#(<= main_~i~1 53), 126693#(<= main_~i~1 56), 126692#(<= main_~i~1 55), 126695#(<= main_~i~1 58), 126694#(<= main_~i~1 57), 126697#(<= main_~i~1 60), 126696#(<= main_~i~1 59), 126699#(<= main_~i~1 62), 126698#(<= main_~i~1 61), 126701#(<= main_~i~1 64), 126700#(<= main_~i~1 63), 126703#(<= main_~i~1 66), 126702#(<= main_~i~1 65), 126705#(<= main_~i~1 68), 126704#(<= main_~i~1 67), 126707#(<= main_~i~1 70), 126706#(<= main_~i~1 69), 126709#(<= main_~i~1 72), 126708#(<= main_~i~1 71)] [2018-02-04 16:15:49,597 INFO L134 CoverageAnalysis]: Checked inductivity of 33516 backedges. 0 proven. 18036 refuted. 0 times theorem prover too weak. 15480 trivial. 0 not checked. [2018-02-04 16:15:49,597 INFO L409 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-02-04 16:15:49,597 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-02-04 16:15:49,598 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2775, Invalid=2775, Unknown=0, NotChecked=0, Total=5550 [2018-02-04 16:15:49,598 INFO L87 Difference]: Start difference. First operand 1423 states and 1777 transitions. Second operand 75 states. [2018-02-04 16:15:51,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:15:51,402 INFO L93 Difference]: Finished difference Result 1826 states and 2117 transitions. [2018-02-04 16:15:51,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-02-04 16:15:51,402 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 961 [2018-02-04 16:15:51,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:15:51,404 INFO L225 Difference]: With dead ends: 1826 [2018-02-04 16:15:51,404 INFO L226 Difference]: Without dead ends: 1826 [2018-02-04 16:15:51,405 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=2775, Invalid=2775, Unknown=0, NotChecked=0, Total=5550 [2018-02-04 16:15:51,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1826 states. [2018-02-04 16:15:51,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1826 to 1442. [2018-02-04 16:15:51,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1442 states. [2018-02-04 16:15:51,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1442 states to 1442 states and 1801 transitions. [2018-02-04 16:15:51,414 INFO L78 Accepts]: Start accepts. Automaton has 1442 states and 1801 transitions. Word has length 961 [2018-02-04 16:15:51,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:15:51,414 INFO L432 AbstractCegarLoop]: Abstraction has 1442 states and 1801 transitions. [2018-02-04 16:15:51,414 INFO L433 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-02-04 16:15:51,415 INFO L276 IsEmpty]: Start isEmpty. Operand 1442 states and 1801 transitions. [2018-02-04 16:15:51,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 975 [2018-02-04 16:15:51,419 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:15:51,419 INFO L351 BasicCegarLoop]: trace histogram [74, 74, 73, 73, 73, 73, 73, 73, 73, 73, 73, 73, 73, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:15:51,419 INFO L371 AbstractCegarLoop]: === Iteration 85 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 16:15:51,420 INFO L82 PathProgramCache]: Analyzing trace with hash -1819253837, now seen corresponding path program 71 times [2018-02-04 16:15:51,420 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:15:51,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:15:51,475 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:15:55,191 INFO L134 CoverageAnalysis]: Checked inductivity of 34456 backedges. 0 proven. 18542 refuted. 0 times theorem prover too weak. 15914 trivial. 0 not checked. [2018-02-04 16:15:55,191 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:15:55,191 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76] total 76 [2018-02-04 16:15:55,191 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:15:55,192 INFO L134 CoverageAnalysis]: Checked inductivity of 14700 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14700 trivial. 0 not checked. [2018-02-04 16:15:55,192 INFO L182 omatonBuilderFactory]: Interpolants [130049#(<= main_~i~1 69), 130048#(<= main_~i~1 68), 130051#(<= main_~i~1 71), 130050#(<= main_~i~1 70), 130053#(<= main_~i~1 73), 130052#(<= main_~i~1 72), 129979#false, 129978#true, 129981#(<= main_~i~1 1), 129980#(= main_~i~1 0), 129983#(<= main_~i~1 3), 129982#(<= main_~i~1 2), 129985#(<= main_~i~1 5), 129984#(<= main_~i~1 4), 129987#(<= main_~i~1 7), 129986#(<= main_~i~1 6), 129989#(<= main_~i~1 9), 129988#(<= main_~i~1 8), 129991#(<= main_~i~1 11), 129990#(<= main_~i~1 10), 129993#(<= main_~i~1 13), 129992#(<= main_~i~1 12), 129995#(<= main_~i~1 15), 129994#(<= main_~i~1 14), 129997#(<= main_~i~1 17), 129996#(<= main_~i~1 16), 129999#(<= main_~i~1 19), 129998#(<= main_~i~1 18), 130001#(<= main_~i~1 21), 130000#(<= main_~i~1 20), 130003#(<= main_~i~1 23), 130002#(<= main_~i~1 22), 130005#(<= main_~i~1 25), 130004#(<= main_~i~1 24), 130007#(<= main_~i~1 27), 130006#(<= main_~i~1 26), 130009#(<= main_~i~1 29), 130008#(<= main_~i~1 28), 130011#(<= main_~i~1 31), 130010#(<= main_~i~1 30), 130013#(<= main_~i~1 33), 130012#(<= main_~i~1 32), 130015#(<= main_~i~1 35), 130014#(<= main_~i~1 34), 130017#(<= main_~i~1 37), 130016#(<= main_~i~1 36), 130019#(<= main_~i~1 39), 130018#(<= main_~i~1 38), 130021#(<= main_~i~1 41), 130020#(<= main_~i~1 40), 130023#(<= main_~i~1 43), 130022#(<= main_~i~1 42), 130025#(<= main_~i~1 45), 130024#(<= main_~i~1 44), 130027#(<= main_~i~1 47), 130026#(<= main_~i~1 46), 130029#(<= main_~i~1 49), 130028#(<= main_~i~1 48), 130031#(<= main_~i~1 51), 130030#(<= main_~i~1 50), 130033#(<= main_~i~1 53), 130032#(<= main_~i~1 52), 130035#(<= main_~i~1 55), 130034#(<= main_~i~1 54), 130037#(<= main_~i~1 57), 130036#(<= main_~i~1 56), 130039#(<= main_~i~1 59), 130038#(<= main_~i~1 58), 130041#(<= main_~i~1 61), 130040#(<= main_~i~1 60), 130043#(<= main_~i~1 63), 130042#(<= main_~i~1 62), 130045#(<= main_~i~1 65), 130044#(<= main_~i~1 64), 130047#(<= main_~i~1 67), 130046#(<= main_~i~1 66)] [2018-02-04 16:15:55,193 INFO L134 CoverageAnalysis]: Checked inductivity of 34456 backedges. 0 proven. 18542 refuted. 0 times theorem prover too weak. 15914 trivial. 0 not checked. [2018-02-04 16:15:55,193 INFO L409 AbstractCegarLoop]: Interpolant automaton has 76 states [2018-02-04 16:15:55,193 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2018-02-04 16:15:55,193 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2018-02-04 16:15:55,193 INFO L87 Difference]: Start difference. First operand 1442 states and 1801 transitions. Second operand 76 states. [2018-02-04 16:15:56,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:15:56,950 INFO L93 Difference]: Finished difference Result 1850 states and 2145 transitions. [2018-02-04 16:15:56,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2018-02-04 16:15:56,950 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 974 [2018-02-04 16:15:56,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:15:56,952 INFO L225 Difference]: With dead ends: 1850 [2018-02-04 16:15:56,952 INFO L226 Difference]: Without dead ends: 1850 [2018-02-04 16:15:56,953 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2018-02-04 16:15:56,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1850 states. [2018-02-04 16:15:56,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1850 to 1461. [2018-02-04 16:15:56,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1461 states. [2018-02-04 16:15:56,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1461 states to 1461 states and 1825 transitions. [2018-02-04 16:15:56,962 INFO L78 Accepts]: Start accepts. Automaton has 1461 states and 1825 transitions. Word has length 974 [2018-02-04 16:15:56,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:15:56,963 INFO L432 AbstractCegarLoop]: Abstraction has 1461 states and 1825 transitions. [2018-02-04 16:15:56,963 INFO L433 AbstractCegarLoop]: Interpolant automaton has 76 states. [2018-02-04 16:15:56,963 INFO L276 IsEmpty]: Start isEmpty. Operand 1461 states and 1825 transitions. [2018-02-04 16:15:56,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 988 [2018-02-04 16:15:56,967 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:15:56,968 INFO L351 BasicCegarLoop]: trace histogram [75, 75, 74, 74, 74, 74, 74, 74, 74, 74, 74, 74, 74, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:15:56,968 INFO L371 AbstractCegarLoop]: === Iteration 86 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 16:15:56,968 INFO L82 PathProgramCache]: Analyzing trace with hash -846925756, now seen corresponding path program 72 times [2018-02-04 16:15:56,968 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:15:57,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:15:57,021 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:16:00,853 INFO L134 CoverageAnalysis]: Checked inductivity of 35409 backedges. 0 proven. 19055 refuted. 0 times theorem prover too weak. 16354 trivial. 0 not checked. [2018-02-04 16:16:00,853 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:16:00,853 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77] total 77 [2018-02-04 16:16:00,853 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:16:00,854 INFO L134 CoverageAnalysis]: Checked inductivity of 15123 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15123 trivial. 0 not checked. [2018-02-04 16:16:00,854 INFO L182 omatonBuilderFactory]: Interpolants [133378#(<= main_~i~1 11), 133379#(<= main_~i~1 12), 133376#(<= main_~i~1 9), 133377#(<= main_~i~1 10), 133382#(<= main_~i~1 15), 133383#(<= main_~i~1 16), 133380#(<= main_~i~1 13), 133381#(<= main_~i~1 14), 133386#(<= main_~i~1 19), 133387#(<= main_~i~1 20), 133384#(<= main_~i~1 17), 133385#(<= main_~i~1 18), 133390#(<= main_~i~1 23), 133391#(<= main_~i~1 24), 133388#(<= main_~i~1 21), 133389#(<= main_~i~1 22), 133394#(<= main_~i~1 27), 133395#(<= main_~i~1 28), 133392#(<= main_~i~1 25), 133393#(<= main_~i~1 26), 133398#(<= main_~i~1 31), 133399#(<= main_~i~1 32), 133396#(<= main_~i~1 29), 133397#(<= main_~i~1 30), 133402#(<= main_~i~1 35), 133403#(<= main_~i~1 36), 133400#(<= main_~i~1 33), 133401#(<= main_~i~1 34), 133406#(<= main_~i~1 39), 133407#(<= main_~i~1 40), 133404#(<= main_~i~1 37), 133405#(<= main_~i~1 38), 133410#(<= main_~i~1 43), 133411#(<= main_~i~1 44), 133408#(<= main_~i~1 41), 133409#(<= main_~i~1 42), 133414#(<= main_~i~1 47), 133415#(<= main_~i~1 48), 133412#(<= main_~i~1 45), 133413#(<= main_~i~1 46), 133418#(<= main_~i~1 51), 133419#(<= main_~i~1 52), 133416#(<= main_~i~1 49), 133417#(<= main_~i~1 50), 133422#(<= main_~i~1 55), 133423#(<= main_~i~1 56), 133420#(<= main_~i~1 53), 133421#(<= main_~i~1 54), 133426#(<= main_~i~1 59), 133427#(<= main_~i~1 60), 133424#(<= main_~i~1 57), 133425#(<= main_~i~1 58), 133430#(<= main_~i~1 63), 133431#(<= main_~i~1 64), 133428#(<= main_~i~1 61), 133429#(<= main_~i~1 62), 133434#(<= main_~i~1 67), 133435#(<= main_~i~1 68), 133432#(<= main_~i~1 65), 133433#(<= main_~i~1 66), 133438#(<= main_~i~1 71), 133439#(<= main_~i~1 72), 133436#(<= main_~i~1 69), 133437#(<= main_~i~1 70), 133440#(<= main_~i~1 73), 133441#(<= main_~i~1 74), 133366#false, 133367#(= main_~i~1 0), 133365#true, 133370#(<= main_~i~1 3), 133371#(<= main_~i~1 4), 133368#(<= main_~i~1 1), 133369#(<= main_~i~1 2), 133374#(<= main_~i~1 7), 133375#(<= main_~i~1 8), 133372#(<= main_~i~1 5), 133373#(<= main_~i~1 6)] [2018-02-04 16:16:00,855 INFO L134 CoverageAnalysis]: Checked inductivity of 35409 backedges. 0 proven. 19055 refuted. 0 times theorem prover too weak. 16354 trivial. 0 not checked. [2018-02-04 16:16:00,855 INFO L409 AbstractCegarLoop]: Interpolant automaton has 77 states [2018-02-04 16:16:00,855 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2018-02-04 16:16:00,855 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2926, Invalid=2926, Unknown=0, NotChecked=0, Total=5852 [2018-02-04 16:16:00,855 INFO L87 Difference]: Start difference. First operand 1461 states and 1825 transitions. Second operand 77 states. [2018-02-04 16:16:02,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:16:02,698 INFO L93 Difference]: Finished difference Result 1874 states and 2173 transitions. [2018-02-04 16:16:02,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-02-04 16:16:02,698 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 987 [2018-02-04 16:16:02,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:16:02,700 INFO L225 Difference]: With dead ends: 1874 [2018-02-04 16:16:02,700 INFO L226 Difference]: Without dead ends: 1874 [2018-02-04 16:16:02,701 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=2926, Invalid=2926, Unknown=0, NotChecked=0, Total=5852 [2018-02-04 16:16:02,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1874 states. [2018-02-04 16:16:02,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1874 to 1480. [2018-02-04 16:16:02,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1480 states. [2018-02-04 16:16:02,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1480 states to 1480 states and 1849 transitions. [2018-02-04 16:16:02,712 INFO L78 Accepts]: Start accepts. Automaton has 1480 states and 1849 transitions. Word has length 987 [2018-02-04 16:16:02,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:16:02,712 INFO L432 AbstractCegarLoop]: Abstraction has 1480 states and 1849 transitions. [2018-02-04 16:16:02,712 INFO L433 AbstractCegarLoop]: Interpolant automaton has 77 states. [2018-02-04 16:16:02,713 INFO L276 IsEmpty]: Start isEmpty. Operand 1480 states and 1849 transitions. [2018-02-04 16:16:02,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1001 [2018-02-04 16:16:02,718 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:16:02,718 INFO L351 BasicCegarLoop]: trace histogram [76, 76, 75, 75, 75, 75, 75, 75, 75, 75, 75, 75, 75, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:16:02,718 INFO L371 AbstractCegarLoop]: === Iteration 87 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 16:16:02,719 INFO L82 PathProgramCache]: Analyzing trace with hash -1728899245, now seen corresponding path program 73 times [2018-02-04 16:16:02,719 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:16:02,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:16:02,780 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:16:06,715 INFO L134 CoverageAnalysis]: Checked inductivity of 36375 backedges. 0 proven. 19575 refuted. 0 times theorem prover too weak. 16800 trivial. 0 not checked. [2018-02-04 16:16:06,716 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:16:06,716 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78] total 78 [2018-02-04 16:16:06,716 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:16:06,716 INFO L134 CoverageAnalysis]: Checked inductivity of 15552 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15552 trivial. 0 not checked. [2018-02-04 16:16:06,717 INFO L182 omatonBuilderFactory]: Interpolants [136834#(<= main_~i~1 36), 136835#(<= main_~i~1 37), 136832#(<= main_~i~1 34), 136833#(<= main_~i~1 35), 136838#(<= main_~i~1 40), 136839#(<= main_~i~1 41), 136836#(<= main_~i~1 38), 136837#(<= main_~i~1 39), 136842#(<= main_~i~1 44), 136843#(<= main_~i~1 45), 136840#(<= main_~i~1 42), 136841#(<= main_~i~1 43), 136846#(<= main_~i~1 48), 136847#(<= main_~i~1 49), 136844#(<= main_~i~1 46), 136845#(<= main_~i~1 47), 136850#(<= main_~i~1 52), 136851#(<= main_~i~1 53), 136848#(<= main_~i~1 50), 136849#(<= main_~i~1 51), 136854#(<= main_~i~1 56), 136855#(<= main_~i~1 57), 136852#(<= main_~i~1 54), 136853#(<= main_~i~1 55), 136858#(<= main_~i~1 60), 136859#(<= main_~i~1 61), 136856#(<= main_~i~1 58), 136857#(<= main_~i~1 59), 136862#(<= main_~i~1 64), 136863#(<= main_~i~1 65), 136860#(<= main_~i~1 62), 136861#(<= main_~i~1 63), 136866#(<= main_~i~1 68), 136867#(<= main_~i~1 69), 136864#(<= main_~i~1 66), 136865#(<= main_~i~1 67), 136870#(<= main_~i~1 72), 136871#(<= main_~i~1 73), 136868#(<= main_~i~1 70), 136869#(<= main_~i~1 71), 136872#(<= main_~i~1 74), 136873#(<= main_~i~1 75), 136798#(= main_~i~1 0), 136799#(<= main_~i~1 1), 136796#true, 136797#false, 136802#(<= main_~i~1 4), 136803#(<= main_~i~1 5), 136800#(<= main_~i~1 2), 136801#(<= main_~i~1 3), 136806#(<= main_~i~1 8), 136807#(<= main_~i~1 9), 136804#(<= main_~i~1 6), 136805#(<= main_~i~1 7), 136810#(<= main_~i~1 12), 136811#(<= main_~i~1 13), 136808#(<= main_~i~1 10), 136809#(<= main_~i~1 11), 136814#(<= main_~i~1 16), 136815#(<= main_~i~1 17), 136812#(<= main_~i~1 14), 136813#(<= main_~i~1 15), 136818#(<= main_~i~1 20), 136819#(<= main_~i~1 21), 136816#(<= main_~i~1 18), 136817#(<= main_~i~1 19), 136822#(<= main_~i~1 24), 136823#(<= main_~i~1 25), 136820#(<= main_~i~1 22), 136821#(<= main_~i~1 23), 136826#(<= main_~i~1 28), 136827#(<= main_~i~1 29), 136824#(<= main_~i~1 26), 136825#(<= main_~i~1 27), 136830#(<= main_~i~1 32), 136831#(<= main_~i~1 33), 136828#(<= main_~i~1 30), 136829#(<= main_~i~1 31)] [2018-02-04 16:16:06,717 INFO L134 CoverageAnalysis]: Checked inductivity of 36375 backedges. 0 proven. 19575 refuted. 0 times theorem prover too weak. 16800 trivial. 0 not checked. [2018-02-04 16:16:06,718 INFO L409 AbstractCegarLoop]: Interpolant automaton has 78 states [2018-02-04 16:16:06,718 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-02-04 16:16:06,719 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2018-02-04 16:16:06,719 INFO L87 Difference]: Start difference. First operand 1480 states and 1849 transitions. Second operand 78 states. [2018-02-04 16:16:08,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:16:08,040 INFO L93 Difference]: Finished difference Result 1898 states and 2201 transitions. [2018-02-04 16:16:08,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-02-04 16:16:08,041 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 1000 [2018-02-04 16:16:08,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:16:08,043 INFO L225 Difference]: With dead ends: 1898 [2018-02-04 16:16:08,043 INFO L226 Difference]: Without dead ends: 1898 [2018-02-04 16:16:08,043 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2018-02-04 16:16:08,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1898 states. [2018-02-04 16:16:08,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1898 to 1499. [2018-02-04 16:16:08,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1499 states. [2018-02-04 16:16:08,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1499 states to 1499 states and 1873 transitions. [2018-02-04 16:16:08,053 INFO L78 Accepts]: Start accepts. Automaton has 1499 states and 1873 transitions. Word has length 1000 [2018-02-04 16:16:08,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:16:08,054 INFO L432 AbstractCegarLoop]: Abstraction has 1499 states and 1873 transitions. [2018-02-04 16:16:08,054 INFO L433 AbstractCegarLoop]: Interpolant automaton has 78 states. [2018-02-04 16:16:08,054 INFO L276 IsEmpty]: Start isEmpty. Operand 1499 states and 1873 transitions. [2018-02-04 16:16:08,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1014 [2018-02-04 16:16:08,059 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:16:08,060 INFO L351 BasicCegarLoop]: trace histogram [77, 77, 76, 76, 76, 76, 76, 76, 76, 76, 76, 76, 76, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:16:08,060 INFO L371 AbstractCegarLoop]: === Iteration 88 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 16:16:08,060 INFO L82 PathProgramCache]: Analyzing trace with hash 1442521252, now seen corresponding path program 74 times [2018-02-04 16:16:08,060 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:16:08,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:16:08,116 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:16:12,170 INFO L134 CoverageAnalysis]: Checked inductivity of 37354 backedges. 0 proven. 20102 refuted. 0 times theorem prover too weak. 17252 trivial. 0 not checked. [2018-02-04 16:16:12,170 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:16:12,170 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79] total 79 [2018-02-04 16:16:12,171 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:16:12,171 INFO L134 CoverageAnalysis]: Checked inductivity of 15987 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15987 trivial. 0 not checked. [2018-02-04 16:16:12,171 INFO L182 omatonBuilderFactory]: Interpolants [140290#(<= main_~i~1 17), 140291#(<= main_~i~1 18), 140288#(<= main_~i~1 15), 140289#(<= main_~i~1 16), 140294#(<= main_~i~1 21), 140295#(<= main_~i~1 22), 140292#(<= main_~i~1 19), 140293#(<= main_~i~1 20), 140298#(<= main_~i~1 25), 140299#(<= main_~i~1 26), 140296#(<= main_~i~1 23), 140297#(<= main_~i~1 24), 140302#(<= main_~i~1 29), 140303#(<= main_~i~1 30), 140300#(<= main_~i~1 27), 140301#(<= main_~i~1 28), 140306#(<= main_~i~1 33), 140307#(<= main_~i~1 34), 140304#(<= main_~i~1 31), 140305#(<= main_~i~1 32), 140310#(<= main_~i~1 37), 140311#(<= main_~i~1 38), 140308#(<= main_~i~1 35), 140309#(<= main_~i~1 36), 140314#(<= main_~i~1 41), 140315#(<= main_~i~1 42), 140312#(<= main_~i~1 39), 140313#(<= main_~i~1 40), 140318#(<= main_~i~1 45), 140319#(<= main_~i~1 46), 140316#(<= main_~i~1 43), 140317#(<= main_~i~1 44), 140322#(<= main_~i~1 49), 140323#(<= main_~i~1 50), 140320#(<= main_~i~1 47), 140321#(<= main_~i~1 48), 140326#(<= main_~i~1 53), 140327#(<= main_~i~1 54), 140324#(<= main_~i~1 51), 140325#(<= main_~i~1 52), 140330#(<= main_~i~1 57), 140331#(<= main_~i~1 58), 140328#(<= main_~i~1 55), 140329#(<= main_~i~1 56), 140334#(<= main_~i~1 61), 140335#(<= main_~i~1 62), 140332#(<= main_~i~1 59), 140333#(<= main_~i~1 60), 140338#(<= main_~i~1 65), 140339#(<= main_~i~1 66), 140336#(<= main_~i~1 63), 140337#(<= main_~i~1 64), 140342#(<= main_~i~1 69), 140343#(<= main_~i~1 70), 140340#(<= main_~i~1 67), 140341#(<= main_~i~1 68), 140346#(<= main_~i~1 73), 140347#(<= main_~i~1 74), 140344#(<= main_~i~1 71), 140345#(<= main_~i~1 72), 140348#(<= main_~i~1 75), 140349#(<= main_~i~1 76), 140271#true, 140274#(<= main_~i~1 1), 140275#(<= main_~i~1 2), 140272#false, 140273#(= main_~i~1 0), 140278#(<= main_~i~1 5), 140279#(<= main_~i~1 6), 140276#(<= main_~i~1 3), 140277#(<= main_~i~1 4), 140282#(<= main_~i~1 9), 140283#(<= main_~i~1 10), 140280#(<= main_~i~1 7), 140281#(<= main_~i~1 8), 140286#(<= main_~i~1 13), 140287#(<= main_~i~1 14), 140284#(<= main_~i~1 11), 140285#(<= main_~i~1 12)] [2018-02-04 16:16:12,172 INFO L134 CoverageAnalysis]: Checked inductivity of 37354 backedges. 0 proven. 20102 refuted. 0 times theorem prover too weak. 17252 trivial. 0 not checked. [2018-02-04 16:16:12,172 INFO L409 AbstractCegarLoop]: Interpolant automaton has 79 states [2018-02-04 16:16:12,172 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2018-02-04 16:16:12,172 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3081, Invalid=3081, Unknown=0, NotChecked=0, Total=6162 [2018-02-04 16:16:12,173 INFO L87 Difference]: Start difference. First operand 1499 states and 1873 transitions. Second operand 79 states. [2018-02-04 16:16:13,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:16:13,734 INFO L93 Difference]: Finished difference Result 1922 states and 2229 transitions. [2018-02-04 16:16:13,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2018-02-04 16:16:13,734 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 1013 [2018-02-04 16:16:13,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:16:13,736 INFO L225 Difference]: With dead ends: 1922 [2018-02-04 16:16:13,737 INFO L226 Difference]: Without dead ends: 1922 [2018-02-04 16:16:13,737 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=3081, Invalid=3081, Unknown=0, NotChecked=0, Total=6162 [2018-02-04 16:16:13,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1922 states. [2018-02-04 16:16:13,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1922 to 1518. [2018-02-04 16:16:13,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1518 states. [2018-02-04 16:16:13,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1518 states to 1518 states and 1897 transitions. [2018-02-04 16:16:13,747 INFO L78 Accepts]: Start accepts. Automaton has 1518 states and 1897 transitions. Word has length 1013 [2018-02-04 16:16:13,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:16:13,747 INFO L432 AbstractCegarLoop]: Abstraction has 1518 states and 1897 transitions. [2018-02-04 16:16:13,747 INFO L433 AbstractCegarLoop]: Interpolant automaton has 79 states. [2018-02-04 16:16:13,747 INFO L276 IsEmpty]: Start isEmpty. Operand 1518 states and 1897 transitions. [2018-02-04 16:16:13,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1027 [2018-02-04 16:16:13,752 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:16:13,752 INFO L351 BasicCegarLoop]: trace histogram [78, 78, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:16:13,752 INFO L371 AbstractCegarLoop]: === Iteration 89 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 16:16:13,752 INFO L82 PathProgramCache]: Analyzing trace with hash 1228309235, now seen corresponding path program 75 times [2018-02-04 16:16:13,753 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:16:13,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:16:13,807 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:16:17,984 INFO L134 CoverageAnalysis]: Checked inductivity of 38346 backedges. 0 proven. 20636 refuted. 0 times theorem prover too weak. 17710 trivial. 0 not checked. [2018-02-04 16:16:17,985 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:16:17,985 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80] total 80 [2018-02-04 16:16:17,985 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:16:17,985 INFO L134 CoverageAnalysis]: Checked inductivity of 16428 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16428 trivial. 0 not checked. [2018-02-04 16:16:17,986 INFO L182 omatonBuilderFactory]: Interpolants [143790#true, 143791#false, 143794#(<= main_~i~1 2), 143795#(<= main_~i~1 3), 143792#(= main_~i~1 0), 143793#(<= main_~i~1 1), 143798#(<= main_~i~1 6), 143799#(<= main_~i~1 7), 143796#(<= main_~i~1 4), 143797#(<= main_~i~1 5), 143802#(<= main_~i~1 10), 143803#(<= main_~i~1 11), 143800#(<= main_~i~1 8), 143801#(<= main_~i~1 9), 143806#(<= main_~i~1 14), 143807#(<= main_~i~1 15), 143804#(<= main_~i~1 12), 143805#(<= main_~i~1 13), 143810#(<= main_~i~1 18), 143811#(<= main_~i~1 19), 143808#(<= main_~i~1 16), 143809#(<= main_~i~1 17), 143814#(<= main_~i~1 22), 143815#(<= main_~i~1 23), 143812#(<= main_~i~1 20), 143813#(<= main_~i~1 21), 143818#(<= main_~i~1 26), 143819#(<= main_~i~1 27), 143816#(<= main_~i~1 24), 143817#(<= main_~i~1 25), 143822#(<= main_~i~1 30), 143823#(<= main_~i~1 31), 143820#(<= main_~i~1 28), 143821#(<= main_~i~1 29), 143826#(<= main_~i~1 34), 143827#(<= main_~i~1 35), 143824#(<= main_~i~1 32), 143825#(<= main_~i~1 33), 143830#(<= main_~i~1 38), 143831#(<= main_~i~1 39), 143828#(<= main_~i~1 36), 143829#(<= main_~i~1 37), 143834#(<= main_~i~1 42), 143835#(<= main_~i~1 43), 143832#(<= main_~i~1 40), 143833#(<= main_~i~1 41), 143838#(<= main_~i~1 46), 143839#(<= main_~i~1 47), 143836#(<= main_~i~1 44), 143837#(<= main_~i~1 45), 143842#(<= main_~i~1 50), 143843#(<= main_~i~1 51), 143840#(<= main_~i~1 48), 143841#(<= main_~i~1 49), 143846#(<= main_~i~1 54), 143847#(<= main_~i~1 55), 143844#(<= main_~i~1 52), 143845#(<= main_~i~1 53), 143850#(<= main_~i~1 58), 143851#(<= main_~i~1 59), 143848#(<= main_~i~1 56), 143849#(<= main_~i~1 57), 143854#(<= main_~i~1 62), 143855#(<= main_~i~1 63), 143852#(<= main_~i~1 60), 143853#(<= main_~i~1 61), 143858#(<= main_~i~1 66), 143859#(<= main_~i~1 67), 143856#(<= main_~i~1 64), 143857#(<= main_~i~1 65), 143862#(<= main_~i~1 70), 143863#(<= main_~i~1 71), 143860#(<= main_~i~1 68), 143861#(<= main_~i~1 69), 143866#(<= main_~i~1 74), 143867#(<= main_~i~1 75), 143864#(<= main_~i~1 72), 143865#(<= main_~i~1 73), 143868#(<= main_~i~1 76), 143869#(<= main_~i~1 77)] [2018-02-04 16:16:17,986 INFO L134 CoverageAnalysis]: Checked inductivity of 38346 backedges. 0 proven. 20636 refuted. 0 times theorem prover too weak. 17710 trivial. 0 not checked. [2018-02-04 16:16:17,986 INFO L409 AbstractCegarLoop]: Interpolant automaton has 80 states [2018-02-04 16:16:17,987 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2018-02-04 16:16:17,987 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2018-02-04 16:16:17,987 INFO L87 Difference]: Start difference. First operand 1518 states and 1897 transitions. Second operand 80 states. [2018-02-04 16:16:20,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:16:20,046 INFO L93 Difference]: Finished difference Result 1946 states and 2257 transitions. [2018-02-04 16:16:20,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2018-02-04 16:16:20,046 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 1026 [2018-02-04 16:16:20,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:16:20,048 INFO L225 Difference]: With dead ends: 1946 [2018-02-04 16:16:20,048 INFO L226 Difference]: Without dead ends: 1946 [2018-02-04 16:16:20,048 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2018-02-04 16:16:20,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1946 states. [2018-02-04 16:16:20,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1946 to 1537. [2018-02-04 16:16:20,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1537 states. [2018-02-04 16:16:20,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1537 states to 1537 states and 1921 transitions. [2018-02-04 16:16:20,059 INFO L78 Accepts]: Start accepts. Automaton has 1537 states and 1921 transitions. Word has length 1026 [2018-02-04 16:16:20,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:16:20,059 INFO L432 AbstractCegarLoop]: Abstraction has 1537 states and 1921 transitions. [2018-02-04 16:16:20,059 INFO L433 AbstractCegarLoop]: Interpolant automaton has 80 states. [2018-02-04 16:16:20,060 INFO L276 IsEmpty]: Start isEmpty. Operand 1537 states and 1921 transitions. [2018-02-04 16:16:20,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1040 [2018-02-04 16:16:20,065 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:16:20,065 INFO L351 BasicCegarLoop]: trace histogram [79, 79, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:16:20,065 INFO L371 AbstractCegarLoop]: === Iteration 90 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 16:16:20,065 INFO L82 PathProgramCache]: Analyzing trace with hash 1216059652, now seen corresponding path program 76 times [2018-02-04 16:16:20,065 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:16:20,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:16:20,127 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:16:24,495 INFO L134 CoverageAnalysis]: Checked inductivity of 39351 backedges. 0 proven. 21177 refuted. 0 times theorem prover too weak. 18174 trivial. 0 not checked. [2018-02-04 16:16:24,496 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:16:24,496 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81] total 81 [2018-02-04 16:16:24,496 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:16:24,496 INFO L134 CoverageAnalysis]: Checked inductivity of 16875 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16875 trivial. 0 not checked. [2018-02-04 16:16:24,496 INFO L182 omatonBuilderFactory]: Interpolants [147354#false, 147355#(= main_~i~1 0), 147353#true, 147358#(<= main_~i~1 3), 147359#(<= main_~i~1 4), 147356#(<= main_~i~1 1), 147357#(<= main_~i~1 2), 147362#(<= main_~i~1 7), 147363#(<= main_~i~1 8), 147360#(<= main_~i~1 5), 147361#(<= main_~i~1 6), 147366#(<= main_~i~1 11), 147367#(<= main_~i~1 12), 147364#(<= main_~i~1 9), 147365#(<= main_~i~1 10), 147370#(<= main_~i~1 15), 147371#(<= main_~i~1 16), 147368#(<= main_~i~1 13), 147369#(<= main_~i~1 14), 147374#(<= main_~i~1 19), 147375#(<= main_~i~1 20), 147372#(<= main_~i~1 17), 147373#(<= main_~i~1 18), 147378#(<= main_~i~1 23), 147379#(<= main_~i~1 24), 147376#(<= main_~i~1 21), 147377#(<= main_~i~1 22), 147382#(<= main_~i~1 27), 147383#(<= main_~i~1 28), 147380#(<= main_~i~1 25), 147381#(<= main_~i~1 26), 147386#(<= main_~i~1 31), 147387#(<= main_~i~1 32), 147384#(<= main_~i~1 29), 147385#(<= main_~i~1 30), 147390#(<= main_~i~1 35), 147391#(<= main_~i~1 36), 147388#(<= main_~i~1 33), 147389#(<= main_~i~1 34), 147394#(<= main_~i~1 39), 147395#(<= main_~i~1 40), 147392#(<= main_~i~1 37), 147393#(<= main_~i~1 38), 147398#(<= main_~i~1 43), 147399#(<= main_~i~1 44), 147396#(<= main_~i~1 41), 147397#(<= main_~i~1 42), 147402#(<= main_~i~1 47), 147403#(<= main_~i~1 48), 147400#(<= main_~i~1 45), 147401#(<= main_~i~1 46), 147406#(<= main_~i~1 51), 147407#(<= main_~i~1 52), 147404#(<= main_~i~1 49), 147405#(<= main_~i~1 50), 147410#(<= main_~i~1 55), 147411#(<= main_~i~1 56), 147408#(<= main_~i~1 53), 147409#(<= main_~i~1 54), 147414#(<= main_~i~1 59), 147415#(<= main_~i~1 60), 147412#(<= main_~i~1 57), 147413#(<= main_~i~1 58), 147418#(<= main_~i~1 63), 147419#(<= main_~i~1 64), 147416#(<= main_~i~1 61), 147417#(<= main_~i~1 62), 147422#(<= main_~i~1 67), 147423#(<= main_~i~1 68), 147420#(<= main_~i~1 65), 147421#(<= main_~i~1 66), 147426#(<= main_~i~1 71), 147427#(<= main_~i~1 72), 147424#(<= main_~i~1 69), 147425#(<= main_~i~1 70), 147430#(<= main_~i~1 75), 147431#(<= main_~i~1 76), 147428#(<= main_~i~1 73), 147429#(<= main_~i~1 74), 147432#(<= main_~i~1 77), 147433#(<= main_~i~1 78)] [2018-02-04 16:16:24,497 INFO L134 CoverageAnalysis]: Checked inductivity of 39351 backedges. 0 proven. 21177 refuted. 0 times theorem prover too weak. 18174 trivial. 0 not checked. [2018-02-04 16:16:24,497 INFO L409 AbstractCegarLoop]: Interpolant automaton has 81 states [2018-02-04 16:16:24,497 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2018-02-04 16:16:24,498 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3240, Invalid=3240, Unknown=0, NotChecked=0, Total=6480 [2018-02-04 16:16:24,498 INFO L87 Difference]: Start difference. First operand 1537 states and 1921 transitions. Second operand 81 states. [2018-02-04 16:16:26,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:16:26,723 INFO L93 Difference]: Finished difference Result 1970 states and 2285 transitions. [2018-02-04 16:16:26,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-02-04 16:16:26,724 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 1039 [2018-02-04 16:16:26,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:16:26,726 INFO L225 Difference]: With dead ends: 1970 [2018-02-04 16:16:26,726 INFO L226 Difference]: Without dead ends: 1970 [2018-02-04 16:16:26,726 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=3240, Invalid=3240, Unknown=0, NotChecked=0, Total=6480 [2018-02-04 16:16:26,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1970 states. [2018-02-04 16:16:26,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1970 to 1556. [2018-02-04 16:16:26,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1556 states. [2018-02-04 16:16:26,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1556 states to 1556 states and 1945 transitions. [2018-02-04 16:16:26,735 INFO L78 Accepts]: Start accepts. Automaton has 1556 states and 1945 transitions. Word has length 1039 [2018-02-04 16:16:26,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:16:26,735 INFO L432 AbstractCegarLoop]: Abstraction has 1556 states and 1945 transitions. [2018-02-04 16:16:26,735 INFO L433 AbstractCegarLoop]: Interpolant automaton has 81 states. [2018-02-04 16:16:26,735 INFO L276 IsEmpty]: Start isEmpty. Operand 1556 states and 1945 transitions. [2018-02-04 16:16:26,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1053 [2018-02-04 16:16:26,741 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:16:26,741 INFO L351 BasicCegarLoop]: trace histogram [80, 80, 79, 79, 79, 79, 79, 79, 79, 79, 79, 79, 79, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:16:26,741 INFO L371 AbstractCegarLoop]: === Iteration 91 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 16:16:26,741 INFO L82 PathProgramCache]: Analyzing trace with hash 275031699, now seen corresponding path program 77 times [2018-02-04 16:16:26,741 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:16:26,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:16:26,801 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:16:31,307 INFO L134 CoverageAnalysis]: Checked inductivity of 40369 backedges. 0 proven. 21725 refuted. 0 times theorem prover too weak. 18644 trivial. 0 not checked. [2018-02-04 16:16:31,307 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:16:31,307 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82] total 82 [2018-02-04 16:16:31,307 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:16:31,308 INFO L134 CoverageAnalysis]: Checked inductivity of 17328 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17328 trivial. 0 not checked. [2018-02-04 16:16:31,308 INFO L182 omatonBuilderFactory]: Interpolants [151040#(<= main_~i~1 78), 151041#(<= main_~i~1 79), 150962#(= main_~i~1 0), 150963#(<= main_~i~1 1), 150960#true, 150961#false, 150966#(<= main_~i~1 4), 150967#(<= main_~i~1 5), 150964#(<= main_~i~1 2), 150965#(<= main_~i~1 3), 150970#(<= main_~i~1 8), 150971#(<= main_~i~1 9), 150968#(<= main_~i~1 6), 150969#(<= main_~i~1 7), 150974#(<= main_~i~1 12), 150975#(<= main_~i~1 13), 150972#(<= main_~i~1 10), 150973#(<= main_~i~1 11), 150978#(<= main_~i~1 16), 150979#(<= main_~i~1 17), 150976#(<= main_~i~1 14), 150977#(<= main_~i~1 15), 150982#(<= main_~i~1 20), 150983#(<= main_~i~1 21), 150980#(<= main_~i~1 18), 150981#(<= main_~i~1 19), 150986#(<= main_~i~1 24), 150987#(<= main_~i~1 25), 150984#(<= main_~i~1 22), 150985#(<= main_~i~1 23), 150990#(<= main_~i~1 28), 150991#(<= main_~i~1 29), 150988#(<= main_~i~1 26), 150989#(<= main_~i~1 27), 150994#(<= main_~i~1 32), 150995#(<= main_~i~1 33), 150992#(<= main_~i~1 30), 150993#(<= main_~i~1 31), 150998#(<= main_~i~1 36), 150999#(<= main_~i~1 37), 150996#(<= main_~i~1 34), 150997#(<= main_~i~1 35), 151002#(<= main_~i~1 40), 151003#(<= main_~i~1 41), 151000#(<= main_~i~1 38), 151001#(<= main_~i~1 39), 151006#(<= main_~i~1 44), 151007#(<= main_~i~1 45), 151004#(<= main_~i~1 42), 151005#(<= main_~i~1 43), 151010#(<= main_~i~1 48), 151011#(<= main_~i~1 49), 151008#(<= main_~i~1 46), 151009#(<= main_~i~1 47), 151014#(<= main_~i~1 52), 151015#(<= main_~i~1 53), 151012#(<= main_~i~1 50), 151013#(<= main_~i~1 51), 151018#(<= main_~i~1 56), 151019#(<= main_~i~1 57), 151016#(<= main_~i~1 54), 151017#(<= main_~i~1 55), 151022#(<= main_~i~1 60), 151023#(<= main_~i~1 61), 151020#(<= main_~i~1 58), 151021#(<= main_~i~1 59), 151026#(<= main_~i~1 64), 151027#(<= main_~i~1 65), 151024#(<= main_~i~1 62), 151025#(<= main_~i~1 63), 151030#(<= main_~i~1 68), 151031#(<= main_~i~1 69), 151028#(<= main_~i~1 66), 151029#(<= main_~i~1 67), 151034#(<= main_~i~1 72), 151035#(<= main_~i~1 73), 151032#(<= main_~i~1 70), 151033#(<= main_~i~1 71), 151038#(<= main_~i~1 76), 151039#(<= main_~i~1 77), 151036#(<= main_~i~1 74), 151037#(<= main_~i~1 75)] [2018-02-04 16:16:31,309 INFO L134 CoverageAnalysis]: Checked inductivity of 40369 backedges. 0 proven. 21725 refuted. 0 times theorem prover too weak. 18644 trivial. 0 not checked. [2018-02-04 16:16:31,309 INFO L409 AbstractCegarLoop]: Interpolant automaton has 82 states [2018-02-04 16:16:31,309 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2018-02-04 16:16:31,310 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2018-02-04 16:16:31,310 INFO L87 Difference]: Start difference. First operand 1556 states and 1945 transitions. Second operand 82 states. [2018-02-04 16:16:33,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:16:33,466 INFO L93 Difference]: Finished difference Result 1994 states and 2313 transitions. [2018-02-04 16:16:33,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2018-02-04 16:16:33,501 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 1052 [2018-02-04 16:16:33,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:16:33,503 INFO L225 Difference]: With dead ends: 1994 [2018-02-04 16:16:33,503 INFO L226 Difference]: Without dead ends: 1994 [2018-02-04 16:16:33,503 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2018-02-04 16:16:33,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1994 states. [2018-02-04 16:16:33,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1994 to 1575. [2018-02-04 16:16:33,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1575 states. [2018-02-04 16:16:33,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1575 states to 1575 states and 1969 transitions. [2018-02-04 16:16:33,512 INFO L78 Accepts]: Start accepts. Automaton has 1575 states and 1969 transitions. Word has length 1052 [2018-02-04 16:16:33,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:16:33,513 INFO L432 AbstractCegarLoop]: Abstraction has 1575 states and 1969 transitions. [2018-02-04 16:16:33,513 INFO L433 AbstractCegarLoop]: Interpolant automaton has 82 states. [2018-02-04 16:16:33,513 INFO L276 IsEmpty]: Start isEmpty. Operand 1575 states and 1969 transitions. [2018-02-04 16:16:33,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1066 [2018-02-04 16:16:33,518 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:16:33,518 INFO L351 BasicCegarLoop]: trace histogram [81, 81, 80, 80, 80, 80, 80, 80, 80, 80, 80, 80, 80, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:16:33,518 INFO L371 AbstractCegarLoop]: === Iteration 92 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 16:16:33,518 INFO L82 PathProgramCache]: Analyzing trace with hash -1724098204, now seen corresponding path program 78 times [2018-02-04 16:16:33,519 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:16:33,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:16:33,579 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:16:38,259 INFO L134 CoverageAnalysis]: Checked inductivity of 41400 backedges. 0 proven. 22280 refuted. 0 times theorem prover too weak. 19120 trivial. 0 not checked. [2018-02-04 16:16:38,259 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:16:38,260 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83] total 83 [2018-02-04 16:16:38,260 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:16:38,260 INFO L134 CoverageAnalysis]: Checked inductivity of 17787 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17787 trivial. 0 not checked. [2018-02-04 16:16:38,260 INFO L182 omatonBuilderFactory]: Interpolants [154626#(<= main_~i~1 13), 154627#(<= main_~i~1 14), 154624#(<= main_~i~1 11), 154625#(<= main_~i~1 12), 154630#(<= main_~i~1 17), 154631#(<= main_~i~1 18), 154628#(<= main_~i~1 15), 154629#(<= main_~i~1 16), 154634#(<= main_~i~1 21), 154635#(<= main_~i~1 22), 154632#(<= main_~i~1 19), 154633#(<= main_~i~1 20), 154638#(<= main_~i~1 25), 154639#(<= main_~i~1 26), 154636#(<= main_~i~1 23), 154637#(<= main_~i~1 24), 154642#(<= main_~i~1 29), 154643#(<= main_~i~1 30), 154640#(<= main_~i~1 27), 154641#(<= main_~i~1 28), 154646#(<= main_~i~1 33), 154647#(<= main_~i~1 34), 154644#(<= main_~i~1 31), 154645#(<= main_~i~1 32), 154650#(<= main_~i~1 37), 154651#(<= main_~i~1 38), 154648#(<= main_~i~1 35), 154649#(<= main_~i~1 36), 154654#(<= main_~i~1 41), 154655#(<= main_~i~1 42), 154652#(<= main_~i~1 39), 154653#(<= main_~i~1 40), 154658#(<= main_~i~1 45), 154659#(<= main_~i~1 46), 154656#(<= main_~i~1 43), 154657#(<= main_~i~1 44), 154662#(<= main_~i~1 49), 154663#(<= main_~i~1 50), 154660#(<= main_~i~1 47), 154661#(<= main_~i~1 48), 154666#(<= main_~i~1 53), 154667#(<= main_~i~1 54), 154664#(<= main_~i~1 51), 154665#(<= main_~i~1 52), 154670#(<= main_~i~1 57), 154671#(<= main_~i~1 58), 154668#(<= main_~i~1 55), 154669#(<= main_~i~1 56), 154674#(<= main_~i~1 61), 154675#(<= main_~i~1 62), 154672#(<= main_~i~1 59), 154673#(<= main_~i~1 60), 154678#(<= main_~i~1 65), 154679#(<= main_~i~1 66), 154676#(<= main_~i~1 63), 154677#(<= main_~i~1 64), 154682#(<= main_~i~1 69), 154683#(<= main_~i~1 70), 154680#(<= main_~i~1 67), 154681#(<= main_~i~1 68), 154686#(<= main_~i~1 73), 154687#(<= main_~i~1 74), 154684#(<= main_~i~1 71), 154685#(<= main_~i~1 72), 154690#(<= main_~i~1 77), 154691#(<= main_~i~1 78), 154688#(<= main_~i~1 75), 154689#(<= main_~i~1 76), 154692#(<= main_~i~1 79), 154693#(<= main_~i~1 80), 154611#true, 154614#(<= main_~i~1 1), 154615#(<= main_~i~1 2), 154612#false, 154613#(= main_~i~1 0), 154618#(<= main_~i~1 5), 154619#(<= main_~i~1 6), 154616#(<= main_~i~1 3), 154617#(<= main_~i~1 4), 154622#(<= main_~i~1 9), 154623#(<= main_~i~1 10), 154620#(<= main_~i~1 7), 154621#(<= main_~i~1 8)] [2018-02-04 16:16:38,261 INFO L134 CoverageAnalysis]: Checked inductivity of 41400 backedges. 0 proven. 22280 refuted. 0 times theorem prover too weak. 19120 trivial. 0 not checked. [2018-02-04 16:16:38,261 INFO L409 AbstractCegarLoop]: Interpolant automaton has 83 states [2018-02-04 16:16:38,261 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2018-02-04 16:16:38,262 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3403, Invalid=3403, Unknown=0, NotChecked=0, Total=6806 [2018-02-04 16:16:38,262 INFO L87 Difference]: Start difference. First operand 1575 states and 1969 transitions. Second operand 83 states. [2018-02-04 16:16:40,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:16:40,191 INFO L93 Difference]: Finished difference Result 2018 states and 2341 transitions. [2018-02-04 16:16:40,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2018-02-04 16:16:40,191 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 1065 [2018-02-04 16:16:40,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:16:40,193 INFO L225 Difference]: With dead ends: 2018 [2018-02-04 16:16:40,194 INFO L226 Difference]: Without dead ends: 2018 [2018-02-04 16:16:40,194 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=3403, Invalid=3403, Unknown=0, NotChecked=0, Total=6806 [2018-02-04 16:16:40,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2018 states. [2018-02-04 16:16:40,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2018 to 1594. [2018-02-04 16:16:40,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1594 states. [2018-02-04 16:16:40,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1594 states to 1594 states and 1993 transitions. [2018-02-04 16:16:40,204 INFO L78 Accepts]: Start accepts. Automaton has 1594 states and 1993 transitions. Word has length 1065 [2018-02-04 16:16:40,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:16:40,205 INFO L432 AbstractCegarLoop]: Abstraction has 1594 states and 1993 transitions. [2018-02-04 16:16:40,205 INFO L433 AbstractCegarLoop]: Interpolant automaton has 83 states. [2018-02-04 16:16:40,205 INFO L276 IsEmpty]: Start isEmpty. Operand 1594 states and 1993 transitions. [2018-02-04 16:16:40,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1079 [2018-02-04 16:16:40,211 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:16:40,211 INFO L351 BasicCegarLoop]: trace histogram [82, 82, 81, 81, 81, 81, 81, 81, 81, 81, 81, 81, 81, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:16:40,211 INFO L371 AbstractCegarLoop]: === Iteration 93 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 16:16:40,211 INFO L82 PathProgramCache]: Analyzing trace with hash 34046515, now seen corresponding path program 79 times [2018-02-04 16:16:40,211 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:16:40,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:16:40,278 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. Received shutdown request... [2018-02-04 16:16:43,797 WARN L491 AbstractCegarLoop]: Verification canceled [2018-02-04 16:16:43,800 WARN L185 ceAbstractionStarter]: Timeout [2018-02-04 16:16:43,800 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.02 04:16:43 BoogieIcfgContainer [2018-02-04 16:16:43,800 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-04 16:16:43,801 INFO L168 Benchmark]: Toolchain (without parser) took 183772.64 ms. Allocated memory was 396.4 MB in the beginning and 2.4 GB in the end (delta: 2.0 GB). Free memory was 354.5 MB in the beginning and 1.2 GB in the end (delta: -821.0 MB). Peak memory consumption was 1.2 GB. Max. memory is 5.3 GB. [2018-02-04 16:16:43,801 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 396.4 MB. Free memory is still 359.9 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 16:16:43,802 INFO L168 Benchmark]: CACSL2BoogieTranslator took 141.45 ms. Allocated memory is still 396.4 MB. Free memory was 354.5 MB in the beginning and 346.4 MB in the end (delta: 8.1 MB). Peak memory consumption was 8.1 MB. Max. memory is 5.3 GB. [2018-02-04 16:16:43,802 INFO L168 Benchmark]: Boogie Preprocessor took 24.41 ms. Allocated memory is still 396.4 MB. Free memory was 346.4 MB in the beginning and 345.1 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-02-04 16:16:43,802 INFO L168 Benchmark]: RCFGBuilder took 184.10 ms. Allocated memory is still 396.4 MB. Free memory was 345.1 MB in the beginning and 327.0 MB in the end (delta: 18.0 MB). Peak memory consumption was 18.0 MB. Max. memory is 5.3 GB. [2018-02-04 16:16:43,802 INFO L168 Benchmark]: TraceAbstraction took 183419.87 ms. Allocated memory was 396.4 MB in the beginning and 2.4 GB in the end (delta: 2.0 GB). Free memory was 327.0 MB in the beginning and 1.2 GB in the end (delta: -848.4 MB). Peak memory consumption was 1.1 GB. Max. memory is 5.3 GB. [2018-02-04 16:16:43,804 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.13 ms. Allocated memory is still 396.4 MB. Free memory is still 359.9 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 141.45 ms. Allocated memory is still 396.4 MB. Free memory was 354.5 MB in the beginning and 346.4 MB in the end (delta: 8.1 MB). Peak memory consumption was 8.1 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 24.41 ms. Allocated memory is still 396.4 MB. Free memory was 346.4 MB in the beginning and 345.1 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 184.10 ms. Allocated memory is still 396.4 MB. Free memory was 345.1 MB in the beginning and 327.0 MB in the end (delta: 18.0 MB). Peak memory consumption was 18.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 183419.87 ms. Allocated memory was 396.4 MB in the beginning and 2.4 GB in the end (delta: 2.0 GB). Free memory was 327.0 MB in the beginning and 1.2 GB in the end (delta: -848.4 MB). Peak memory consumption was 1.1 GB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 15). Cancelled while BasicCegarLoop was analyzing trace of length 1079 with TraceHistMax 82, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 37 known predicates. - TimeoutResultAtElement [Line: 15]: Timeout (TraceAbstraction) Unable to prove that array index is always in bounds (line 15). Cancelled while BasicCegarLoop was analyzing trace of length 1079 with TraceHistMax 82, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 37 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 15). Cancelled while BasicCegarLoop was analyzing trace of length 1079 with TraceHistMax 82, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 37 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 26). Cancelled while BasicCegarLoop was analyzing trace of length 1079 with TraceHistMax 82, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 37 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 23). Cancelled while BasicCegarLoop was analyzing trace of length 1079 with TraceHistMax 82, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 37 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 26). Cancelled while BasicCegarLoop was analyzing trace of length 1079 with TraceHistMax 82, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 37 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 23). Cancelled while BasicCegarLoop was analyzing trace of length 1079 with TraceHistMax 82, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 37 known predicates. - TimeoutResultAtElement [Line: 20]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 20). Cancelled while BasicCegarLoop was analyzing trace of length 1079 with TraceHistMax 82, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 37 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 49 locations, 8 error locations. TIMEOUT Result, 183.3s OverallTime, 93 OverallIterations, 82 TraceHistogramMax, 57.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 6470 SDtfs, 63708 SDslu, 63230 SDs, 0 SdLazy, 79716 SolverSat, 9094 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 26.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3561 GetRequests, 183 SyntacticMatches, 1 SemanticMatches, 3377 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 37.6s Time, 0.1s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1594occurred in iteration=92, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 518498/1122231 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 92 MinimizatonAttempts, 18203 StatesRemovedByMinimization, 89 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 2.2s SatisfiabilityAnalysisTime, 108.7s InterpolantComputationTime, 44440 NumberOfCodeBlocks, 44440 NumberOfCodeBlocksAsserted, 92 NumberOfCheckSat, 44348 ConstructedInterpolants, 0 QuantifiedInterpolants, 64393570 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 92 InterpolantComputations, 8 PerfectInterpolantSequences, 518498/1122231 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/ArraysOfVariableLength_true-valid-memsafety.c_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-04_16-16-43-810.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ArraysOfVariableLength_true-valid-memsafety.c_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-04_16-16-43-810.csv Completed graceful shutdown