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/cav18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/ArraysOfVariableLength4_true-valid-memsafety_true-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-26d9e06-m [2018-02-02 10:11:41,345 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-02 10:11:41,346 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-02 10:11:41,358 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-02 10:11:41,358 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-02 10:11:41,359 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-02 10:11:41,359 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-02 10:11:41,361 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-02 10:11:41,362 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-02 10:11:41,363 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-02 10:11:41,364 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-02 10:11:41,364 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-02 10:11:41,365 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-02 10:11:41,366 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-02 10:11:41,366 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-02 10:11:41,368 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-02 10:11:41,370 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-02 10:11:41,371 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-02 10:11:41,372 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-02 10:11:41,373 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-02 10:11:41,375 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-02 10:11:41,375 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-02 10:11:41,376 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-02 10:11:41,377 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-02 10:11:41,377 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-02 10:11:41,378 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-02 10:11:41,378 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-02 10:11:41,379 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-02 10:11:41,379 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-02 10:11:41,379 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-02 10:11:41,380 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-02 10:11:41,380 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cav18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf [2018-02-02 10:11:41,390 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-02 10:11:41,391 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-02 10:11:41,392 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-02 10:11:41,392 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-02 10:11:41,392 INFO L133 SettingsManager]: * Use SBE=true [2018-02-02 10:11:41,392 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-02 10:11:41,392 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-02 10:11:41,393 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-02 10:11:41,393 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-02 10:11:41,393 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-02 10:11:41,393 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-02 10:11:41,393 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-02 10:11:41,393 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-02 10:11:41,393 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-02 10:11:41,393 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-02 10:11:41,394 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-02 10:11:41,394 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-02 10:11:41,394 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-02 10:11:41,394 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-02 10:11:41,394 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-02 10:11:41,394 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 10:11:41,395 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-02 10:11:41,395 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-02-02 10:11:41,424 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-02 10:11:41,434 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-02 10:11:41,439 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-02 10:11:41,440 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-02 10:11:41,441 INFO L276 PluginConnector]: CDTParser initialized [2018-02-02 10:11:41,441 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/ArraysOfVariableLength4_true-valid-memsafety_true-termination.c [2018-02-02 10:11:41,550 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-02 10:11:41,552 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-02 10:11:41,553 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-02 10:11:41,553 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-02 10:11:41,559 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-02 10:11:41,560 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 10:11:41" (1/1) ... [2018-02-02 10:11:41,564 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3785a87e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:11:41, skipping insertion in model container [2018-02-02 10:11:41,565 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 10:11:41" (1/1) ... [2018-02-02 10:11:41,580 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 10:11:41,598 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 10:11:41,686 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 10:11:41,699 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 10:11:41,705 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:11:41 WrapperNode [2018-02-02 10:11:41,705 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-02 10:11:41,705 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-02 10:11:41,705 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-02 10:11:41,706 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-02 10:11:41,715 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:11:41" (1/1) ... [2018-02-02 10:11:41,715 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:11:41" (1/1) ... [2018-02-02 10:11:41,722 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:11:41" (1/1) ... [2018-02-02 10:11:41,722 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:11:41" (1/1) ... [2018-02-02 10:11:41,725 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:11:41" (1/1) ... [2018-02-02 10:11:41,727 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:11:41" (1/1) ... [2018-02-02 10:11:41,728 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:11:41" (1/1) ... [2018-02-02 10:11:41,730 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-02 10:11:41,730 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-02 10:11:41,730 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-02 10:11:41,730 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-02 10:11:41,731 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:11:41" (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-02 10:11:41,771 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-02 10:11:41,771 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-02 10:11:41,771 INFO L136 BoogieDeclarations]: Found implementation of procedure foo [2018-02-02 10:11:41,771 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-02 10:11:41,771 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-02 10:11:41,771 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-02 10:11:41,772 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-02 10:11:41,772 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-02 10:11:41,772 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-02 10:11:41,772 INFO L128 BoogieDeclarations]: Found specification of procedure foo [2018-02-02 10:11:41,772 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-02 10:11:41,772 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-02 10:11:41,772 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-02 10:11:41,908 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-02 10:11:41,908 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 10:11:41 BoogieIcfgContainer [2018-02-02 10:11:41,908 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-02 10:11:41,909 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-02 10:11:41,909 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-02 10:11:41,911 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-02 10:11:41,911 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.02 10:11:41" (1/3) ... [2018-02-02 10:11:41,912 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@514de860 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 10:11:41, skipping insertion in model container [2018-02-02 10:11:41,912 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:11:41" (2/3) ... [2018-02-02 10:11:41,913 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@514de860 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 10:11:41, skipping insertion in model container [2018-02-02 10:11:41,913 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 10:11:41" (3/3) ... [2018-02-02 10:11:41,914 INFO L107 eAbstractionObserver]: Analyzing ICFG ArraysOfVariableLength4_true-valid-memsafety_true-termination.c [2018-02-02 10:11:41,920 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-02-02 10:11:41,925 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2018-02-02 10:11:41,963 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-02 10:11:41,963 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-02 10:11:41,963 INFO L324 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-02-02 10:11:41,963 INFO L325 AbstractCegarLoop]: Backedges is CANONICAL [2018-02-02 10:11:41,964 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-02 10:11:41,964 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-02 10:11:41,964 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-02 10:11:41,964 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-02 10:11:41,965 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-02 10:11:41,977 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states. [2018-02-02 10:11:41,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-02-02 10:11:41,986 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:11:41,987 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:11:41,987 INFO L371 AbstractCegarLoop]: === Iteration 1 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:11:41,991 INFO L82 PathProgramCache]: Analyzing trace with hash -215054890, now seen corresponding path program 1 times [2018-02-02 10:11:42,028 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:11:42,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:11:42,071 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:11:42,137 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-02 10:11:42,139 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:11:42,139 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-02 10:11:42,140 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:11:42,140 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-02 10:11:42,140 INFO L182 omatonBuilderFactory]: Interpolants [49#true, 50#false, 51#(= main_~i~1 0)] [2018-02-02 10:11:42,140 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-02 10:11:42,141 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-02 10:11:42,150 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-02 10:11:42,151 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 10:11:42,153 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 3 states. [2018-02-02 10:11:42,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:11:42,215 INFO L93 Difference]: Finished difference Result 63 states and 68 transitions. [2018-02-02 10:11:42,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-02 10:11:42,217 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-02-02 10:11:42,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:11:42,223 INFO L225 Difference]: With dead ends: 63 [2018-02-02 10:11:42,224 INFO L226 Difference]: Without dead ends: 59 [2018-02-02 10:11:42,225 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 10:11:42,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-02-02 10:11:42,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 49. [2018-02-02 10:11:42,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-02-02 10:11:42,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 52 transitions. [2018-02-02 10:11:42,300 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 52 transitions. Word has length 11 [2018-02-02 10:11:42,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:11:42,301 INFO L432 AbstractCegarLoop]: Abstraction has 49 states and 52 transitions. [2018-02-02 10:11:42,301 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-02 10:11:42,301 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 52 transitions. [2018-02-02 10:11:42,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-02-02 10:11:42,301 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:11:42,301 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:11:42,301 INFO L371 AbstractCegarLoop]: === Iteration 2 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:11:42,302 INFO L82 PathProgramCache]: Analyzing trace with hash 1100032001, now seen corresponding path program 1 times [2018-02-02 10:11:42,302 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:11:42,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:11:42,318 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:11:42,337 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-02 10:11:42,338 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:11:42,338 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-02 10:11:42,338 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:11:42,338 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-02 10:11:42,338 INFO L182 omatonBuilderFactory]: Interpolants [164#true, 165#false, 166#(= foo_~i~0 0)] [2018-02-02 10:11:42,339 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-02 10:11:42,340 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-02 10:11:42,341 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-02 10:11:42,341 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 10:11:42,341 INFO L87 Difference]: Start difference. First operand 49 states and 52 transitions. Second operand 3 states. [2018-02-02 10:11:42,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:11:42,376 INFO L93 Difference]: Finished difference Result 60 states and 64 transitions. [2018-02-02 10:11:42,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-02 10:11:42,377 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-02-02 10:11:42,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:11:42,379 INFO L225 Difference]: With dead ends: 60 [2018-02-02 10:11:42,380 INFO L226 Difference]: Without dead ends: 60 [2018-02-02 10:11:42,380 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-02 10:11:42,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-02-02 10:11:42,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 52. [2018-02-02 10:11:42,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-02-02 10:11:42,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 56 transitions. [2018-02-02 10:11:42,386 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 56 transitions. Word has length 16 [2018-02-02 10:11:42,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:11:42,386 INFO L432 AbstractCegarLoop]: Abstraction has 52 states and 56 transitions. [2018-02-02 10:11:42,386 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-02 10:11:42,386 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2018-02-02 10:11:42,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-02 10:11:42,387 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:11:42,387 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:11:42,387 INFO L371 AbstractCegarLoop]: === Iteration 3 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:11:42,387 INFO L82 PathProgramCache]: Analyzing trace with hash -258746290, now seen corresponding path program 1 times [2018-02-02 10:11:42,388 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:11:42,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:11:42,400 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:11:42,520 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-02 10:11:42,520 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:11:42,520 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 10:11:42,521 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:11:42,521 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-02 10:11:42,521 INFO L182 omatonBuilderFactory]: Interpolants [279#true, 280#false, 281#(and (= 32 (select |#length| |main_~#mask~0.base|)) (= 0 |main_~#mask~0.offset|)), 282#(and (= 0 |foo_#in~b.offset|) (= 32 (select |#length| |foo_#in~b.base|))), 283#(and (= (select |#length| foo_~b.base) 32) (= foo_~b.offset 0)), 284#(and (= (select |#length| foo_~b.base) 32) (<= 0 foo_~i~0) (= foo_~b.offset 0) (<= foo_~i~0 31))] [2018-02-02 10:11:42,521 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-02 10:11:42,522 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 10:11:42,522 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 10:11:42,522 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:11:42,522 INFO L87 Difference]: Start difference. First operand 52 states and 56 transitions. Second operand 6 states. [2018-02-02 10:11:42,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:11:42,624 INFO L93 Difference]: Finished difference Result 54 states and 58 transitions. [2018-02-02 10:11:42,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 10:11:42,624 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2018-02-02 10:11:42,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:11:42,625 INFO L225 Difference]: With dead ends: 54 [2018-02-02 10:11:42,625 INFO L226 Difference]: Without dead ends: 54 [2018-02-02 10:11:42,626 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-02-02 10:11:42,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-02-02 10:11:42,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 51. [2018-02-02 10:11:42,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-02-02 10:11:42,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 55 transitions. [2018-02-02 10:11:42,631 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 55 transitions. Word has length 17 [2018-02-02 10:11:42,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:11:42,631 INFO L432 AbstractCegarLoop]: Abstraction has 51 states and 55 transitions. [2018-02-02 10:11:42,632 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 10:11:42,632 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 55 transitions. [2018-02-02 10:11:42,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-02 10:11:42,632 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:11:42,632 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:11:42,632 INFO L371 AbstractCegarLoop]: === Iteration 4 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:11:42,633 INFO L82 PathProgramCache]: Analyzing trace with hash -258746291, now seen corresponding path program 1 times [2018-02-02 10:11:42,633 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:11:42,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:11:42,642 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:11:42,672 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-02 10:11:42,672 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:11:42,672 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 10:11:42,672 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:11:42,673 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-02 10:11:42,673 INFO L182 omatonBuilderFactory]: Interpolants [394#true, 395#false, 396#(= 1 (select |#valid| |main_~#mask~0.base|)), 397#(= 1 (select |#valid| |foo_#in~b.base|)), 398#(= 1 (select |#valid| foo_~b.base))] [2018-02-02 10:11:42,673 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-02 10:11:42,673 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 10:11:42,674 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 10:11:42,674 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:11:42,674 INFO L87 Difference]: Start difference. First operand 51 states and 55 transitions. Second operand 5 states. [2018-02-02 10:11:42,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:11:42,705 INFO L93 Difference]: Finished difference Result 50 states and 54 transitions. [2018-02-02 10:11:42,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 10:11:42,706 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-02-02 10:11:42,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:11:42,706 INFO L225 Difference]: With dead ends: 50 [2018-02-02 10:11:42,706 INFO L226 Difference]: Without dead ends: 50 [2018-02-02 10:11:42,707 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 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-02 10:11:42,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-02-02 10:11:42,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-02-02 10:11:42,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-02-02 10:11:42,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2018-02-02 10:11:42,710 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 17 [2018-02-02 10:11:42,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:11:42,711 INFO L432 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2018-02-02 10:11:42,711 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 10:11:42,711 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2018-02-02 10:11:42,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-02-02 10:11:42,711 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:11:42,712 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:11:42,712 INFO L371 AbstractCegarLoop]: === Iteration 5 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:11:42,712 INFO L82 PathProgramCache]: Analyzing trace with hash -1933852231, now seen corresponding path program 1 times [2018-02-02 10:11:42,713 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:11:42,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:11:42,723 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:11:42,772 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:11:42,773 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:11:42,773 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-02-02 10:11:42,773 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:11:42,773 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-02 10:11:42,774 INFO L182 omatonBuilderFactory]: Interpolants [501#true, 502#false, 503#(= 32 |foo_#in~size|), 504#(= foo_~size 32), 505#(and (<= 0 foo_~i~0) (= foo_~size 32)), 506#(and (<= 1 foo_~i~0) (= foo_~size 32)), 507#(and (<= 1 foo_~i~0) (<= foo_~i~0 31))] [2018-02-02 10:11:42,774 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:11:42,774 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 10:11:42,774 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 10:11:42,774 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-02-02 10:11:42,775 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand 7 states. [2018-02-02 10:11:42,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:11:42,843 INFO L93 Difference]: Finished difference Result 52 states and 56 transitions. [2018-02-02 10:11:42,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 10:11:42,843 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2018-02-02 10:11:42,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:11:42,844 INFO L225 Difference]: With dead ends: 52 [2018-02-02 10:11:42,844 INFO L226 Difference]: Without dead ends: 52 [2018-02-02 10:11:42,845 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-02 10:11:42,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-02-02 10:11:42,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 46. [2018-02-02 10:11:42,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-02-02 10:11:42,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 49 transitions. [2018-02-02 10:11:42,848 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 49 transitions. Word has length 22 [2018-02-02 10:11:42,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:11:42,849 INFO L432 AbstractCegarLoop]: Abstraction has 46 states and 49 transitions. [2018-02-02 10:11:42,849 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 10:11:42,849 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 49 transitions. [2018-02-02 10:11:42,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-02 10:11:42,849 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:11:42,850 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:11:42,850 INFO L371 AbstractCegarLoop]: === Iteration 6 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:11:42,850 INFO L82 PathProgramCache]: Analyzing trace with hash 1974903447, now seen corresponding path program 1 times [2018-02-02 10:11:42,851 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:11:42,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:11:42,859 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:11:42,886 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:11:42,886 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:11:42,887 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 10:11:42,887 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:11:42,887 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-02 10:11:42,887 INFO L182 omatonBuilderFactory]: Interpolants [612#true, 613#false, 614#(<= 0 main_~i~1), 615#(<= 1 main_~i~1), 616#(and (<= main_~i~1 31) (<= 1 main_~i~1))] [2018-02-02 10:11:42,887 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:11:42,888 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 10:11:42,888 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 10:11:42,888 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:11:42,888 INFO L87 Difference]: Start difference. First operand 46 states and 49 transitions. Second operand 5 states. [2018-02-02 10:11:42,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:11:42,935 INFO L93 Difference]: Finished difference Result 56 states and 59 transitions. [2018-02-02 10:11:42,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 10:11:42,935 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2018-02-02 10:11:42,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:11:42,936 INFO L225 Difference]: With dead ends: 56 [2018-02-02 10:11:42,936 INFO L226 Difference]: Without dead ends: 56 [2018-02-02 10:11:42,936 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-02 10:11:42,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-02-02 10:11:42,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 42. [2018-02-02 10:11:42,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-02-02 10:11:42,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 45 transitions. [2018-02-02 10:11:42,940 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 45 transitions. Word has length 23 [2018-02-02 10:11:42,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:11:42,940 INFO L432 AbstractCegarLoop]: Abstraction has 42 states and 45 transitions. [2018-02-02 10:11:42,940 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 10:11:42,940 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 45 transitions. [2018-02-02 10:11:42,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-02-02 10:11:42,941 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:11:42,941 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] [2018-02-02 10:11:42,941 INFO L371 AbstractCegarLoop]: === Iteration 7 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:11:42,942 INFO L82 PathProgramCache]: Analyzing trace with hash 1474818454, now seen corresponding path program 1 times [2018-02-02 10:11:42,942 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:11:42,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:11:42,951 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:11:42,991 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:11:42,991 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:11:42,991 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 10:11:42,991 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:11:42,992 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-02 10:11:42,992 INFO L182 omatonBuilderFactory]: Interpolants [715#true, 716#false, 717#(and (= foo_~i~0 0) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 718#(and (= foo_~i~0 0) (not (= |foo_#in~size| 32))), 719#(not (= |foo_#in~size| 32))] [2018-02-02 10:11:42,992 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:11:42,992 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 10:11:42,992 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 10:11:42,992 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:11:42,993 INFO L87 Difference]: Start difference. First operand 42 states and 45 transitions. Second operand 5 states. [2018-02-02 10:11:43,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:11:43,029 INFO L93 Difference]: Finished difference Result 51 states and 54 transitions. [2018-02-02 10:11:43,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 10:11:43,033 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2018-02-02 10:11:43,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:11:43,033 INFO L225 Difference]: With dead ends: 51 [2018-02-02 10:11:43,033 INFO L226 Difference]: Without dead ends: 48 [2018-02-02 10:11:43,034 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:11:43,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-02-02 10:11:43,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 44. [2018-02-02 10:11:43,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-02-02 10:11:43,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 47 transitions. [2018-02-02 10:11:43,037 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 47 transitions. Word has length 31 [2018-02-02 10:11:43,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:11:43,037 INFO L432 AbstractCegarLoop]: Abstraction has 44 states and 47 transitions. [2018-02-02 10:11:43,038 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 10:11:43,038 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 47 transitions. [2018-02-02 10:11:43,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-02-02 10:11:43,038 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:11:43,039 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:11:43,039 INFO L371 AbstractCegarLoop]: === Iteration 8 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:11:43,039 INFO L82 PathProgramCache]: Analyzing trace with hash 1643098334, now seen corresponding path program 1 times [2018-02-02 10:11:43,040 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:11:43,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:11:43,050 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:11:43,091 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 10:11:43,091 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:11:43,091 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-02-02 10:11:43,091 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:11:43,092 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-02 10:11:43,092 INFO L182 omatonBuilderFactory]: Interpolants [817#true, 818#false, 819#(= main_~i~1 0), 820#(<= main_~i~1 1)] [2018-02-02 10:11:43,092 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 10:11:43,092 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 10:11:43,092 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 10:11:43,092 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-02-02 10:11:43,092 INFO L87 Difference]: Start difference. First operand 44 states and 47 transitions. Second operand 4 states. [2018-02-02 10:11:43,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:11:43,123 INFO L93 Difference]: Finished difference Result 72 states and 77 transitions. [2018-02-02 10:11:43,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 10:11:43,124 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 37 [2018-02-02 10:11:43,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:11:43,124 INFO L225 Difference]: With dead ends: 72 [2018-02-02 10:11:43,124 INFO L226 Difference]: Without dead ends: 72 [2018-02-02 10:11:43,125 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-02 10:11:43,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-02-02 10:11:43,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 55. [2018-02-02 10:11:43,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-02-02 10:11:43,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 60 transitions. [2018-02-02 10:11:43,129 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 60 transitions. Word has length 37 [2018-02-02 10:11:43,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:11:43,129 INFO L432 AbstractCegarLoop]: Abstraction has 55 states and 60 transitions. [2018-02-02 10:11:43,129 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 10:11:43,129 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 60 transitions. [2018-02-02 10:11:43,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-02-02 10:11:43,131 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:11:43,131 INFO L351 BasicCegarLoop]: trace histogram [4, 3, 2, 2, 2, 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-02 10:11:43,131 INFO L371 AbstractCegarLoop]: === Iteration 9 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:11:43,132 INFO L82 PathProgramCache]: Analyzing trace with hash -1953764441, now seen corresponding path program 2 times [2018-02-02 10:11:43,133 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:11:43,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:11:43,149 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:11:43,217 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 17 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-02-02 10:11:43,218 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:11:43,218 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-02-02 10:11:43,218 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:11:43,219 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-02-02 10:11:43,219 INFO L182 omatonBuilderFactory]: Interpolants [948#true, 949#false, 950#(and (= foo_~i~0 0) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 951#(and (or (<= foo_~i~0 1) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 952#(not (= |foo_#in~size| 32))] [2018-02-02 10:11:43,220 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 17 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-02-02 10:11:43,220 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 10:11:43,220 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 10:11:43,220 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:11:43,220 INFO L87 Difference]: Start difference. First operand 55 states and 60 transitions. Second operand 5 states. [2018-02-02 10:11:43,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:11:43,280 INFO L93 Difference]: Finished difference Result 68 states and 73 transitions. [2018-02-02 10:11:43,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 10:11:43,281 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 55 [2018-02-02 10:11:43,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:11:43,282 INFO L225 Difference]: With dead ends: 68 [2018-02-02 10:11:43,282 INFO L226 Difference]: Without dead ends: 65 [2018-02-02 10:11:43,282 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:11:43,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-02-02 10:11:43,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 61. [2018-02-02 10:11:43,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-02-02 10:11:43,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 66 transitions. [2018-02-02 10:11:43,286 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 66 transitions. Word has length 55 [2018-02-02 10:11:43,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:11:43,287 INFO L432 AbstractCegarLoop]: Abstraction has 61 states and 66 transitions. [2018-02-02 10:11:43,287 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 10:11:43,287 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 66 transitions. [2018-02-02 10:11:43,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-02-02 10:11:43,288 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:11:43,288 INFO L351 BasicCegarLoop]: trace histogram [6, 4, 4, 4, 4, 4, 3, 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-02 10:11:43,288 INFO L371 AbstractCegarLoop]: === Iteration 10 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:11:43,289 INFO L82 PathProgramCache]: Analyzing trace with hash -81663113, now seen corresponding path program 3 times [2018-02-02 10:11:43,289 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:11:43,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:11:43,309 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:11:43,370 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2018-02-02 10:11:43,370 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:11:43,370 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-02-02 10:11:43,370 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:11:43,371 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-02-02 10:11:43,371 INFO L182 omatonBuilderFactory]: Interpolants [1088#(<= main_~i~1 2), 1084#true, 1085#false, 1086#(= main_~i~1 0), 1087#(<= main_~i~1 1)] [2018-02-02 10:11:43,371 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2018-02-02 10:11:43,371 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 10:11:43,371 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 10:11:43,372 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:11:43,372 INFO L87 Difference]: Start difference. First operand 61 states and 66 transitions. Second operand 5 states. [2018-02-02 10:11:43,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:11:43,411 INFO L93 Difference]: Finished difference Result 94 states and 100 transitions. [2018-02-02 10:11:43,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 10:11:43,411 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2018-02-02 10:11:43,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:11:43,412 INFO L225 Difference]: With dead ends: 94 [2018-02-02 10:11:43,412 INFO L226 Difference]: Without dead ends: 94 [2018-02-02 10:11:43,413 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-02 10:11:43,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-02-02 10:11:43,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 72. [2018-02-02 10:11:43,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-02-02 10:11:43,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 79 transitions. [2018-02-02 10:11:43,418 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 79 transitions. Word has length 67 [2018-02-02 10:11:43,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:11:43,418 INFO L432 AbstractCegarLoop]: Abstraction has 72 states and 79 transitions. [2018-02-02 10:11:43,418 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 10:11:43,418 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 79 transitions. [2018-02-02 10:11:43,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-02-02 10:11:43,420 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:11:43,420 INFO L351 BasicCegarLoop]: trace histogram [9, 6, 6, 6, 6, 6, 4, 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] [2018-02-02 10:11:43,421 INFO L371 AbstractCegarLoop]: === Iteration 11 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:11:43,421 INFO L82 PathProgramCache]: Analyzing trace with hash -33793592, now seen corresponding path program 4 times [2018-02-02 10:11:43,421 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:11:43,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:11:43,442 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:11:43,540 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 10 proven. 84 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2018-02-02 10:11:43,540 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:11:43,540 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-02-02 10:11:43,540 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:11:43,541 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-02-02 10:11:43,541 INFO L182 omatonBuilderFactory]: Interpolants [1255#true, 1256#false, 1257#(and (= foo_~i~0 0) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 1258#(and (or (<= foo_~i~0 1) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 1259#(and (or (<= foo_~i~0 2) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 1260#(not (= |foo_#in~size| 32))] [2018-02-02 10:11:43,541 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 10 proven. 84 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2018-02-02 10:11:43,541 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 10:11:43,542 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 10:11:43,542 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:11:43,542 INFO L87 Difference]: Start difference. First operand 72 states and 79 transitions. Second operand 6 states. [2018-02-02 10:11:43,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:11:43,604 INFO L93 Difference]: Finished difference Result 85 states and 92 transitions. [2018-02-02 10:11:43,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 10:11:43,605 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 91 [2018-02-02 10:11:43,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:11:43,606 INFO L225 Difference]: With dead ends: 85 [2018-02-02 10:11:43,606 INFO L226 Difference]: Without dead ends: 82 [2018-02-02 10:11:43,606 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-02-02 10:11:43,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-02-02 10:11:43,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 78. [2018-02-02 10:11:43,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-02-02 10:11:43,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 85 transitions. [2018-02-02 10:11:43,611 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 85 transitions. Word has length 91 [2018-02-02 10:11:43,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:11:43,611 INFO L432 AbstractCegarLoop]: Abstraction has 78 states and 85 transitions. [2018-02-02 10:11:43,611 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 10:11:43,611 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 85 transitions. [2018-02-02 10:11:43,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-02-02 10:11:43,613 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:11:43,613 INFO L351 BasicCegarLoop]: trace histogram [12, 9, 9, 9, 9, 9, 4, 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] [2018-02-02 10:11:43,613 INFO L371 AbstractCegarLoop]: === Iteration 12 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:11:43,613 INFO L82 PathProgramCache]: Analyzing trace with hash -913746080, now seen corresponding path program 5 times [2018-02-02 10:11:43,614 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:11:43,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:11:43,635 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:11:43,689 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2018-02-02 10:11:43,690 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:11:43,690 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-02-02 10:11:43,690 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:11:43,690 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2018-02-02 10:11:43,690 INFO L182 omatonBuilderFactory]: Interpolants [1426#true, 1427#false, 1428#(= main_~i~1 0), 1429#(<= main_~i~1 1), 1430#(<= main_~i~1 2), 1431#(<= main_~i~1 3)] [2018-02-02 10:11:43,691 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2018-02-02 10:11:43,691 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 10:11:43,691 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 10:11:43,691 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:11:43,692 INFO L87 Difference]: Start difference. First operand 78 states and 85 transitions. Second operand 6 states. [2018-02-02 10:11:43,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:11:43,792 INFO L93 Difference]: Finished difference Result 116 states and 123 transitions. [2018-02-02 10:11:43,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 10:11:43,792 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 109 [2018-02-02 10:11:43,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:11:43,793 INFO L225 Difference]: With dead ends: 116 [2018-02-02 10:11:43,793 INFO L226 Difference]: Without dead ends: 116 [2018-02-02 10:11:43,794 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-02 10:11:43,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-02-02 10:11:43,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 89. [2018-02-02 10:11:43,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-02-02 10:11:43,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 98 transitions. [2018-02-02 10:11:43,799 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 98 transitions. Word has length 109 [2018-02-02 10:11:43,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:11:43,799 INFO L432 AbstractCegarLoop]: Abstraction has 89 states and 98 transitions. [2018-02-02 10:11:43,799 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 10:11:43,799 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 98 transitions. [2018-02-02 10:11:43,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-02-02 10:11:43,801 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:11:43,801 INFO L351 BasicCegarLoop]: trace histogram [16, 12, 12, 12, 12, 12, 5, 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] [2018-02-02 10:11:43,801 INFO L371 AbstractCegarLoop]: === Iteration 13 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:11:43,801 INFO L82 PathProgramCache]: Analyzing trace with hash 969284025, now seen corresponding path program 6 times [2018-02-02 10:11:43,802 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:11:43,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:11:43,824 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:11:43,977 INFO L134 CoverageAnalysis]: Checked inductivity of 572 backedges. 14 proven. 237 refuted. 0 times theorem prover too weak. 321 trivial. 0 not checked. [2018-02-02 10:11:43,978 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:11:43,978 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-02-02 10:11:43,978 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:11:43,978 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 69 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2018-02-02 10:11:43,978 INFO L182 omatonBuilderFactory]: Interpolants [1637#true, 1638#false, 1639#(and (= foo_~i~0 0) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 1640#(and (or (<= foo_~i~0 1) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 1641#(and (or (<= foo_~i~0 2) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 1642#(and (or (<= foo_~i~0 3) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 1643#(not (= |foo_#in~size| 32))] [2018-02-02 10:11:43,979 INFO L134 CoverageAnalysis]: Checked inductivity of 572 backedges. 14 proven. 237 refuted. 0 times theorem prover too weak. 321 trivial. 0 not checked. [2018-02-02 10:11:43,979 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 10:11:43,980 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 10:11:43,980 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-02-02 10:11:43,980 INFO L87 Difference]: Start difference. First operand 89 states and 98 transitions. Second operand 7 states. [2018-02-02 10:11:44,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:11:44,048 INFO L93 Difference]: Finished difference Result 102 states and 111 transitions. [2018-02-02 10:11:44,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 10:11:44,049 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 139 [2018-02-02 10:11:44,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:11:44,051 INFO L225 Difference]: With dead ends: 102 [2018-02-02 10:11:44,051 INFO L226 Difference]: Without dead ends: 99 [2018-02-02 10:11:44,051 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2018-02-02 10:11:44,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-02-02 10:11:44,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 95. [2018-02-02 10:11:44,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-02-02 10:11:44,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 104 transitions. [2018-02-02 10:11:44,060 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 104 transitions. Word has length 139 [2018-02-02 10:11:44,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:11:44,061 INFO L432 AbstractCegarLoop]: Abstraction has 95 states and 104 transitions. [2018-02-02 10:11:44,061 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 10:11:44,061 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 104 transitions. [2018-02-02 10:11:44,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2018-02-02 10:11:44,068 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:11:44,069 INFO L351 BasicCegarLoop]: trace histogram [20, 16, 16, 16, 16, 16, 5, 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] [2018-02-02 10:11:44,069 INFO L371 AbstractCegarLoop]: === Iteration 14 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:11:44,069 INFO L82 PathProgramCache]: Analyzing trace with hash -1862037927, now seen corresponding path program 7 times [2018-02-02 10:11:44,070 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:11:44,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:11:44,089 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:11:44,164 INFO L134 CoverageAnalysis]: Checked inductivity of 928 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 884 trivial. 0 not checked. [2018-02-02 10:11:44,164 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:11:44,164 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-02-02 10:11:44,164 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:11:44,164 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2018-02-02 10:11:44,165 INFO L182 omatonBuilderFactory]: Interpolants [1843#true, 1844#false, 1845#(= main_~i~1 0), 1846#(<= main_~i~1 1), 1847#(<= main_~i~1 2), 1848#(<= main_~i~1 3), 1849#(<= main_~i~1 4)] [2018-02-02 10:11:44,165 INFO L134 CoverageAnalysis]: Checked inductivity of 928 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 884 trivial. 0 not checked. [2018-02-02 10:11:44,165 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 10:11:44,165 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 10:11:44,165 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-02-02 10:11:44,165 INFO L87 Difference]: Start difference. First operand 95 states and 104 transitions. Second operand 7 states. [2018-02-02 10:11:44,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:11:44,255 INFO L93 Difference]: Finished difference Result 138 states and 146 transitions. [2018-02-02 10:11:44,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 10:11:44,256 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 163 [2018-02-02 10:11:44,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:11:44,257 INFO L225 Difference]: With dead ends: 138 [2018-02-02 10:11:44,257 INFO L226 Difference]: Without dead ends: 138 [2018-02-02 10:11:44,257 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-02 10:11:44,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-02-02 10:11:44,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 106. [2018-02-02 10:11:44,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-02-02 10:11:44,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 117 transitions. [2018-02-02 10:11:44,262 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 117 transitions. Word has length 163 [2018-02-02 10:11:44,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:11:44,262 INFO L432 AbstractCegarLoop]: Abstraction has 106 states and 117 transitions. [2018-02-02 10:11:44,262 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 10:11:44,262 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 117 transitions. [2018-02-02 10:11:44,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2018-02-02 10:11:44,265 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:11:44,265 INFO L351 BasicCegarLoop]: trace histogram [25, 20, 20, 20, 20, 20, 6, 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] [2018-02-02 10:11:44,266 INFO L371 AbstractCegarLoop]: === Iteration 15 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:11:44,266 INFO L82 PathProgramCache]: Analyzing trace with hash -1319247558, now seen corresponding path program 8 times [2018-02-02 10:11:44,267 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:11:44,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:11:44,289 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:11:44,478 INFO L134 CoverageAnalysis]: Checked inductivity of 1470 backedges. 18 proven. 512 refuted. 0 times theorem prover too weak. 940 trivial. 0 not checked. [2018-02-02 10:11:44,478 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:11:44,479 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-02-02 10:11:44,479 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:11:44,482 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 116 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2018-02-02 10:11:44,482 INFO L182 omatonBuilderFactory]: Interpolants [2096#(and (= foo_~i~0 0) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 2097#(and (or (<= foo_~i~0 1) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 2098#(and (or (<= foo_~i~0 2) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 2099#(and (or (<= foo_~i~0 3) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 2100#(and (or (<= foo_~i~0 4) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 2101#(not (= |foo_#in~size| 32)), 2094#true, 2095#false] [2018-02-02 10:11:44,483 INFO L134 CoverageAnalysis]: Checked inductivity of 1470 backedges. 18 proven. 512 refuted. 0 times theorem prover too weak. 940 trivial. 0 not checked. [2018-02-02 10:11:44,483 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 10:11:44,483 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 10:11:44,483 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2018-02-02 10:11:44,483 INFO L87 Difference]: Start difference. First operand 106 states and 117 transitions. Second operand 8 states. [2018-02-02 10:11:44,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:11:44,551 INFO L93 Difference]: Finished difference Result 119 states and 130 transitions. [2018-02-02 10:11:44,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 10:11:44,551 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 199 [2018-02-02 10:11:44,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:11:44,555 INFO L225 Difference]: With dead ends: 119 [2018-02-02 10:11:44,555 INFO L226 Difference]: Without dead ends: 116 [2018-02-02 10:11:44,555 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2018-02-02 10:11:44,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-02-02 10:11:44,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 112. [2018-02-02 10:11:44,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-02-02 10:11:44,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 123 transitions. [2018-02-02 10:11:44,559 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 123 transitions. Word has length 199 [2018-02-02 10:11:44,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:11:44,559 INFO L432 AbstractCegarLoop]: Abstraction has 112 states and 123 transitions. [2018-02-02 10:11:44,559 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 10:11:44,560 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 123 transitions. [2018-02-02 10:11:44,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2018-02-02 10:11:44,563 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:11:44,563 INFO L351 BasicCegarLoop]: trace histogram [30, 25, 25, 25, 25, 25, 6, 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] [2018-02-02 10:11:44,563 INFO L371 AbstractCegarLoop]: === Iteration 16 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:11:44,563 INFO L82 PathProgramCache]: Analyzing trace with hash 125993506, now seen corresponding path program 9 times [2018-02-02 10:11:44,564 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:11:44,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:11:44,588 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:11:44,658 INFO L134 CoverageAnalysis]: Checked inductivity of 2180 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 2110 trivial. 0 not checked. [2018-02-02 10:11:44,658 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:11:44,658 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-02-02 10:11:44,658 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:11:44,658 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 360 trivial. 0 not checked. [2018-02-02 10:11:44,659 INFO L182 omatonBuilderFactory]: Interpolants [2336#false, 2337#(= main_~i~1 0), 2338#(<= main_~i~1 1), 2339#(<= main_~i~1 2), 2340#(<= main_~i~1 3), 2341#(<= main_~i~1 4), 2342#(<= main_~i~1 5), 2335#true] [2018-02-02 10:11:44,659 INFO L134 CoverageAnalysis]: Checked inductivity of 2180 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 2110 trivial. 0 not checked. [2018-02-02 10:11:44,660 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 10:11:44,660 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 10:11:44,660 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-02-02 10:11:44,660 INFO L87 Difference]: Start difference. First operand 112 states and 123 transitions. Second operand 8 states. [2018-02-02 10:11:44,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:11:44,736 INFO L93 Difference]: Finished difference Result 160 states and 169 transitions. [2018-02-02 10:11:44,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 10:11:44,736 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 229 [2018-02-02 10:11:44,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:11:44,737 INFO L225 Difference]: With dead ends: 160 [2018-02-02 10:11:44,737 INFO L226 Difference]: Without dead ends: 160 [2018-02-02 10:11:44,737 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-02 10:11:44,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2018-02-02 10:11:44,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 123. [2018-02-02 10:11:44,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-02-02 10:11:44,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 136 transitions. [2018-02-02 10:11:44,741 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 136 transitions. Word has length 229 [2018-02-02 10:11:44,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:11:44,741 INFO L432 AbstractCegarLoop]: Abstraction has 123 states and 136 transitions. [2018-02-02 10:11:44,741 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 10:11:44,741 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 136 transitions. [2018-02-02 10:11:44,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2018-02-02 10:11:44,746 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:11:44,746 INFO L351 BasicCegarLoop]: trace histogram [36, 30, 30, 30, 30, 30, 7, 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] [2018-02-02 10:11:44,746 INFO L371 AbstractCegarLoop]: === Iteration 17 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:11:44,747 INFO L82 PathProgramCache]: Analyzing trace with hash 2046000651, now seen corresponding path program 10 times [2018-02-02 10:11:44,747 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:11:44,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:11:44,784 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:11:45,040 INFO L134 CoverageAnalysis]: Checked inductivity of 3162 backedges. 22 proven. 945 refuted. 0 times theorem prover too weak. 2195 trivial. 0 not checked. [2018-02-02 10:11:45,041 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:11:45,041 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-02-02 10:11:45,041 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:11:45,041 INFO L134 CoverageAnalysis]: Checked inductivity of 540 backedges. 0 proven. 175 refuted. 0 times theorem prover too weak. 365 trivial. 0 not checked. [2018-02-02 10:11:45,042 INFO L182 omatonBuilderFactory]: Interpolants [2626#true, 2627#false, 2628#(and (= foo_~i~0 0) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 2629#(and (or (<= foo_~i~0 1) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 2630#(and (or (<= foo_~i~0 2) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 2631#(and (or (<= foo_~i~0 3) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 2632#(and (or (<= foo_~i~0 4) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 2633#(and (or (not (= foo_~size 32)) (<= foo_~i~0 5)) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 2634#(not (= |foo_#in~size| 32))] [2018-02-02 10:11:45,043 INFO L134 CoverageAnalysis]: Checked inductivity of 3162 backedges. 22 proven. 945 refuted. 0 times theorem prover too weak. 2195 trivial. 0 not checked. [2018-02-02 10:11:45,043 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 10:11:45,043 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 10:11:45,043 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2018-02-02 10:11:45,043 INFO L87 Difference]: Start difference. First operand 123 states and 136 transitions. Second operand 9 states. [2018-02-02 10:11:45,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:11:45,102 INFO L93 Difference]: Finished difference Result 136 states and 149 transitions. [2018-02-02 10:11:45,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 10:11:45,102 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 271 [2018-02-02 10:11:45,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:11:45,103 INFO L225 Difference]: With dead ends: 136 [2018-02-02 10:11:45,103 INFO L226 Difference]: Without dead ends: 133 [2018-02-02 10:11:45,104 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2018-02-02 10:11:45,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-02-02 10:11:45,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 129. [2018-02-02 10:11:45,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-02-02 10:11:45,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 142 transitions. [2018-02-02 10:11:45,107 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 142 transitions. Word has length 271 [2018-02-02 10:11:45,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:11:45,108 INFO L432 AbstractCegarLoop]: Abstraction has 129 states and 142 transitions. [2018-02-02 10:11:45,108 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 10:11:45,108 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 142 transitions. [2018-02-02 10:11:45,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2018-02-02 10:11:45,110 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:11:45,110 INFO L351 BasicCegarLoop]: trace histogram [42, 36, 36, 36, 36, 36, 7, 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] [2018-02-02 10:11:45,110 INFO L371 AbstractCegarLoop]: === Iteration 18 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:11:45,110 INFO L82 PathProgramCache]: Analyzing trace with hash -416957317, now seen corresponding path program 11 times [2018-02-02 10:11:45,111 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:11:45,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:11:45,140 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:11:45,267 INFO L134 CoverageAnalysis]: Checked inductivity of 4404 backedges. 0 proven. 102 refuted. 0 times theorem prover too weak. 4302 trivial. 0 not checked. [2018-02-02 10:11:45,268 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:11:45,268 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-02-02 10:11:45,268 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:11:45,268 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2018-02-02 10:11:45,268 INFO L182 omatonBuilderFactory]: Interpolants [2902#true, 2903#false, 2904#(= main_~i~1 0), 2905#(<= main_~i~1 1), 2906#(<= main_~i~1 2), 2907#(<= main_~i~1 3), 2908#(<= main_~i~1 4), 2909#(<= main_~i~1 5), 2910#(<= main_~i~1 6)] [2018-02-02 10:11:45,269 INFO L134 CoverageAnalysis]: Checked inductivity of 4404 backedges. 0 proven. 102 refuted. 0 times theorem prover too weak. 4302 trivial. 0 not checked. [2018-02-02 10:11:45,269 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 10:11:45,269 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 10:11:45,269 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-02-02 10:11:45,269 INFO L87 Difference]: Start difference. First operand 129 states and 142 transitions. Second operand 9 states. [2018-02-02 10:11:45,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:11:45,340 INFO L93 Difference]: Finished difference Result 182 states and 192 transitions. [2018-02-02 10:11:45,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 10:11:45,340 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 307 [2018-02-02 10:11:45,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:11:45,341 INFO L225 Difference]: With dead ends: 182 [2018-02-02 10:11:45,341 INFO L226 Difference]: Without dead ends: 182 [2018-02-02 10:11:45,341 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-02 10:11:45,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-02-02 10:11:45,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 140. [2018-02-02 10:11:45,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-02-02 10:11:45,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 155 transitions. [2018-02-02 10:11:45,345 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 155 transitions. Word has length 307 [2018-02-02 10:11:45,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:11:45,346 INFO L432 AbstractCegarLoop]: Abstraction has 140 states and 155 transitions. [2018-02-02 10:11:45,346 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 10:11:45,346 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 155 transitions. [2018-02-02 10:11:45,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 356 [2018-02-02 10:11:45,348 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:11:45,348 INFO L351 BasicCegarLoop]: trace histogram [49, 42, 42, 42, 42, 42, 8, 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] [2018-02-02 10:11:45,348 INFO L371 AbstractCegarLoop]: === Iteration 19 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:11:45,349 INFO L82 PathProgramCache]: Analyzing trace with hash -1766255124, now seen corresponding path program 12 times [2018-02-02 10:11:45,349 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:11:45,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:11:45,383 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:11:45,681 INFO L134 CoverageAnalysis]: Checked inductivity of 6020 backedges. 26 proven. 1572 refuted. 0 times theorem prover too weak. 4422 trivial. 0 not checked. [2018-02-02 10:11:45,682 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:11:45,682 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-02-02 10:11:45,682 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:11:45,682 INFO L134 CoverageAnalysis]: Checked inductivity of 882 backedges. 0 proven. 246 refuted. 0 times theorem prover too weak. 636 trivial. 0 not checked. [2018-02-02 10:11:45,682 INFO L182 omatonBuilderFactory]: Interpolants [3233#true, 3234#false, 3235#(and (= foo_~i~0 0) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 3236#(and (or (<= foo_~i~0 1) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 3237#(and (or (<= foo_~i~0 2) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 3238#(and (or (<= foo_~i~0 3) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 3239#(and (or (<= foo_~i~0 4) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 3240#(and (or (not (= foo_~size 32)) (<= foo_~i~0 5)) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 3241#(and (or (<= foo_~i~0 6) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 3242#(not (= |foo_#in~size| 32))] [2018-02-02 10:11:45,684 INFO L134 CoverageAnalysis]: Checked inductivity of 6020 backedges. 26 proven. 1572 refuted. 0 times theorem prover too weak. 4422 trivial. 0 not checked. [2018-02-02 10:11:45,684 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 10:11:45,684 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 10:11:45,684 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2018-02-02 10:11:45,684 INFO L87 Difference]: Start difference. First operand 140 states and 155 transitions. Second operand 10 states. [2018-02-02 10:11:45,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:11:45,733 INFO L93 Difference]: Finished difference Result 153 states and 168 transitions. [2018-02-02 10:11:45,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 10:11:45,734 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 355 [2018-02-02 10:11:45,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:11:45,734 INFO L225 Difference]: With dead ends: 153 [2018-02-02 10:11:45,734 INFO L226 Difference]: Without dead ends: 150 [2018-02-02 10:11:45,735 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2018-02-02 10:11:45,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-02-02 10:11:45,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 146. [2018-02-02 10:11:45,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-02-02 10:11:45,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 161 transitions. [2018-02-02 10:11:45,737 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 161 transitions. Word has length 355 [2018-02-02 10:11:45,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:11:45,737 INFO L432 AbstractCegarLoop]: Abstraction has 146 states and 161 transitions. [2018-02-02 10:11:45,737 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 10:11:45,737 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 161 transitions. [2018-02-02 10:11:45,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 398 [2018-02-02 10:11:45,739 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:11:45,739 INFO L351 BasicCegarLoop]: trace histogram [56, 49, 49, 49, 49, 49, 8, 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] [2018-02-02 10:11:45,739 INFO L371 AbstractCegarLoop]: === Iteration 20 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:11:45,739 INFO L82 PathProgramCache]: Analyzing trace with hash 1901043492, now seen corresponding path program 13 times [2018-02-02 10:11:45,740 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:11:45,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:11:45,762 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:11:46,070 INFO L134 CoverageAnalysis]: Checked inductivity of 8008 backedges. 0 proven. 140 refuted. 0 times theorem prover too weak. 7868 trivial. 0 not checked. [2018-02-02 10:11:46,070 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:11:46,070 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-02-02 10:11:46,071 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:11:46,071 INFO L134 CoverageAnalysis]: Checked inductivity of 1008 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1008 trivial. 0 not checked. [2018-02-02 10:11:46,072 INFO L182 omatonBuilderFactory]: Interpolants [3552#(<= main_~i~1 6), 3553#(<= main_~i~1 7), 3544#true, 3545#false, 3546#(= main_~i~1 0), 3547#(<= main_~i~1 1), 3548#(<= main_~i~1 2), 3549#(<= main_~i~1 3), 3550#(<= main_~i~1 4), 3551#(<= main_~i~1 5)] [2018-02-02 10:11:46,073 INFO L134 CoverageAnalysis]: Checked inductivity of 8008 backedges. 0 proven. 140 refuted. 0 times theorem prover too weak. 7868 trivial. 0 not checked. [2018-02-02 10:11:46,074 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 10:11:46,074 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 10:11:46,074 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-02-02 10:11:46,074 INFO L87 Difference]: Start difference. First operand 146 states and 161 transitions. Second operand 10 states. [2018-02-02 10:11:46,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:11:46,164 INFO L93 Difference]: Finished difference Result 204 states and 215 transitions. [2018-02-02 10:11:46,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 10:11:46,164 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 397 [2018-02-02 10:11:46,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:11:46,166 INFO L225 Difference]: With dead ends: 204 [2018-02-02 10:11:46,166 INFO L226 Difference]: Without dead ends: 204 [2018-02-02 10:11:46,166 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-02 10:11:46,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2018-02-02 10:11:46,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 157. [2018-02-02 10:11:46,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-02-02 10:11:46,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 174 transitions. [2018-02-02 10:11:46,172 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 174 transitions. Word has length 397 [2018-02-02 10:11:46,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:11:46,173 INFO L432 AbstractCegarLoop]: Abstraction has 157 states and 174 transitions. [2018-02-02 10:11:46,173 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 10:11:46,173 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 174 transitions. [2018-02-02 10:11:46,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 452 [2018-02-02 10:11:46,176 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:11:46,176 INFO L351 BasicCegarLoop]: trace histogram [64, 56, 56, 56, 56, 56, 9, 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] [2018-02-02 10:11:46,176 INFO L371 AbstractCegarLoop]: === Iteration 21 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:11:46,176 INFO L82 PathProgramCache]: Analyzing trace with hash 319186589, now seen corresponding path program 14 times [2018-02-02 10:11:46,177 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:11:46,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:11:46,214 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:11:46,690 INFO L134 CoverageAnalysis]: Checked inductivity of 10488 backedges. 30 proven. 2429 refuted. 0 times theorem prover too weak. 8029 trivial. 0 not checked. [2018-02-02 10:11:46,690 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:11:46,690 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-02-02 10:11:46,691 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:11:46,691 INFO L134 CoverageAnalysis]: Checked inductivity of 1344 backedges. 0 proven. 329 refuted. 0 times theorem prover too weak. 1015 trivial. 0 not checked. [2018-02-02 10:11:46,691 INFO L182 omatonBuilderFactory]: Interpolants [3920#(and (or (<= foo_~i~0 3) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 3921#(and (or (<= foo_~i~0 4) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 3922#(and (or (not (= foo_~size 32)) (<= foo_~i~0 5)) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 3923#(and (or (<= foo_~i~0 6) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 3924#(and (or (<= foo_~i~0 7) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 3925#(not (= |foo_#in~size| 32)), 3915#true, 3916#false, 3917#(and (= foo_~i~0 0) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 3918#(and (or (<= foo_~i~0 1) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 3919#(and (or (<= foo_~i~0 2) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32)))] [2018-02-02 10:11:46,692 INFO L134 CoverageAnalysis]: Checked inductivity of 10488 backedges. 30 proven. 2429 refuted. 0 times theorem prover too weak. 8029 trivial. 0 not checked. [2018-02-02 10:11:46,692 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-02 10:11:46,692 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-02 10:11:46,692 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2018-02-02 10:11:46,692 INFO L87 Difference]: Start difference. First operand 157 states and 174 transitions. Second operand 11 states. [2018-02-02 10:11:46,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:11:46,750 INFO L93 Difference]: Finished difference Result 170 states and 187 transitions. [2018-02-02 10:11:46,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-02 10:11:46,750 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 451 [2018-02-02 10:11:46,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:11:46,752 INFO L225 Difference]: With dead ends: 170 [2018-02-02 10:11:46,752 INFO L226 Difference]: Without dead ends: 167 [2018-02-02 10:11:46,752 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2018-02-02 10:11:46,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2018-02-02 10:11:46,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 163. [2018-02-02 10:11:46,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2018-02-02 10:11:46,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 180 transitions. [2018-02-02 10:11:46,756 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 180 transitions. Word has length 451 [2018-02-02 10:11:46,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:11:46,756 INFO L432 AbstractCegarLoop]: Abstraction has 163 states and 180 transitions. [2018-02-02 10:11:46,756 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-02 10:11:46,756 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 180 transitions. [2018-02-02 10:11:46,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 500 [2018-02-02 10:11:46,758 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:11:46,758 INFO L351 BasicCegarLoop]: trace histogram [72, 64, 64, 64, 64, 64, 9, 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] [2018-02-02 10:11:46,758 INFO L371 AbstractCegarLoop]: === Iteration 22 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:11:46,758 INFO L82 PathProgramCache]: Analyzing trace with hash -702635043, now seen corresponding path program 15 times [2018-02-02 10:11:46,758 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:11:46,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:11:46,786 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:11:47,122 INFO L134 CoverageAnalysis]: Checked inductivity of 13472 backedges. 0 proven. 184 refuted. 0 times theorem prover too weak. 13288 trivial. 0 not checked. [2018-02-02 10:11:47,122 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:11:47,123 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-02-02 10:11:47,123 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:11:47,123 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2018-02-02 10:11:47,123 INFO L182 omatonBuilderFactory]: Interpolants [4261#true, 4262#false, 4263#(= main_~i~1 0), 4264#(<= main_~i~1 1), 4265#(<= main_~i~1 2), 4266#(<= main_~i~1 3), 4267#(<= main_~i~1 4), 4268#(<= main_~i~1 5), 4269#(<= main_~i~1 6), 4270#(<= main_~i~1 7), 4271#(<= main_~i~1 8)] [2018-02-02 10:11:47,124 INFO L134 CoverageAnalysis]: Checked inductivity of 13472 backedges. 0 proven. 184 refuted. 0 times theorem prover too weak. 13288 trivial. 0 not checked. [2018-02-02 10:11:47,125 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-02 10:11:47,125 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-02 10:11:47,125 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-02-02 10:11:47,125 INFO L87 Difference]: Start difference. First operand 163 states and 180 transitions. Second operand 11 states. [2018-02-02 10:11:47,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:11:47,259 INFO L93 Difference]: Finished difference Result 226 states and 238 transitions. [2018-02-02 10:11:47,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-02 10:11:47,260 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 499 [2018-02-02 10:11:47,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:11:47,262 INFO L225 Difference]: With dead ends: 226 [2018-02-02 10:11:47,262 INFO L226 Difference]: Without dead ends: 226 [2018-02-02 10:11:47,262 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-02 10:11:47,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2018-02-02 10:11:47,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 174. [2018-02-02 10:11:47,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2018-02-02 10:11:47,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 193 transitions. [2018-02-02 10:11:47,267 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 193 transitions. Word has length 499 [2018-02-02 10:11:47,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:11:47,269 INFO L432 AbstractCegarLoop]: Abstraction has 174 states and 193 transitions. [2018-02-02 10:11:47,269 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-02 10:11:47,269 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 193 transitions. [2018-02-02 10:11:47,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 560 [2018-02-02 10:11:47,273 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:11:47,273 INFO L351 BasicCegarLoop]: trace histogram [81, 72, 72, 72, 72, 72, 10, 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] [2018-02-02 10:11:47,273 INFO L371 AbstractCegarLoop]: === Iteration 23 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:11:47,274 INFO L82 PathProgramCache]: Analyzing trace with hash 1002440158, now seen corresponding path program 16 times [2018-02-02 10:11:47,274 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:11:47,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:11:47,314 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:11:47,897 INFO L134 CoverageAnalysis]: Checked inductivity of 17082 backedges. 34 proven. 3552 refuted. 0 times theorem prover too weak. 13496 trivial. 0 not checked. [2018-02-02 10:11:47,897 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:11:47,898 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-02 10:11:47,898 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:11:47,898 INFO L134 CoverageAnalysis]: Checked inductivity of 1944 backedges. 0 proven. 424 refuted. 0 times theorem prover too weak. 1520 trivial. 0 not checked. [2018-02-02 10:11:47,898 INFO L182 omatonBuilderFactory]: Interpolants [4672#true, 4673#false, 4674#(and (= foo_~i~0 0) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 4675#(and (or (<= foo_~i~0 1) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 4676#(and (or (<= foo_~i~0 2) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 4677#(and (or (<= foo_~i~0 3) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 4678#(and (or (<= foo_~i~0 4) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 4679#(and (or (not (= foo_~size 32)) (<= foo_~i~0 5)) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 4680#(and (or (<= foo_~i~0 6) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 4681#(and (or (<= foo_~i~0 7) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 4682#(and (or (= |foo_#in~size| foo_~size) (= foo_~size 32)) (or (not (= foo_~size 32)) (<= foo_~i~0 8))), 4683#(not (= |foo_#in~size| 32))] [2018-02-02 10:11:47,899 INFO L134 CoverageAnalysis]: Checked inductivity of 17082 backedges. 34 proven. 3552 refuted. 0 times theorem prover too weak. 13496 trivial. 0 not checked. [2018-02-02 10:11:47,900 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-02 10:11:47,900 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-02 10:11:47,900 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2018-02-02 10:11:47,900 INFO L87 Difference]: Start difference. First operand 174 states and 193 transitions. Second operand 12 states. [2018-02-02 10:11:47,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:11:47,987 INFO L93 Difference]: Finished difference Result 187 states and 206 transitions. [2018-02-02 10:11:47,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-02 10:11:47,988 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 559 [2018-02-02 10:11:47,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:11:47,989 INFO L225 Difference]: With dead ends: 187 [2018-02-02 10:11:47,989 INFO L226 Difference]: Without dead ends: 184 [2018-02-02 10:11:47,989 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2018-02-02 10:11:47,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2018-02-02 10:11:47,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 180. [2018-02-02 10:11:47,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2018-02-02 10:11:47,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 199 transitions. [2018-02-02 10:11:47,993 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 199 transitions. Word has length 559 [2018-02-02 10:11:47,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:11:47,993 INFO L432 AbstractCegarLoop]: Abstraction has 180 states and 199 transitions. [2018-02-02 10:11:47,993 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-02 10:11:47,993 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 199 transitions. [2018-02-02 10:11:47,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 614 [2018-02-02 10:11:47,995 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:11:47,995 INFO L351 BasicCegarLoop]: trace histogram [90, 81, 81, 81, 81, 81, 10, 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] [2018-02-02 10:11:47,996 INFO L371 AbstractCegarLoop]: === Iteration 24 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:11:47,996 INFO L82 PathProgramCache]: Analyzing trace with hash -978150298, now seen corresponding path program 17 times [2018-02-02 10:11:47,996 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:11:48,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:11:48,034 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:11:48,484 INFO L134 CoverageAnalysis]: Checked inductivity of 21348 backedges. 0 proven. 234 refuted. 0 times theorem prover too weak. 21114 trivial. 0 not checked. [2018-02-02 10:11:48,485 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:11:48,485 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-02 10:11:48,485 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:11:48,486 INFO L134 CoverageAnalysis]: Checked inductivity of 2160 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2160 trivial. 0 not checked. [2018-02-02 10:11:48,486 INFO L182 omatonBuilderFactory]: Interpolants [5056#(<= main_~i~1 1), 5057#(<= main_~i~1 2), 5058#(<= main_~i~1 3), 5059#(<= main_~i~1 4), 5060#(<= main_~i~1 5), 5061#(<= main_~i~1 6), 5062#(<= main_~i~1 7), 5063#(<= main_~i~1 8), 5064#(<= main_~i~1 9), 5053#true, 5054#false, 5055#(= main_~i~1 0)] [2018-02-02 10:11:48,486 INFO L134 CoverageAnalysis]: Checked inductivity of 21348 backedges. 0 proven. 234 refuted. 0 times theorem prover too weak. 21114 trivial. 0 not checked. [2018-02-02 10:11:48,487 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-02 10:11:48,487 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-02 10:11:48,487 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-02-02 10:11:48,487 INFO L87 Difference]: Start difference. First operand 180 states and 199 transitions. Second operand 12 states. [2018-02-02 10:11:48,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:11:48,597 INFO L93 Difference]: Finished difference Result 248 states and 261 transitions. [2018-02-02 10:11:48,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-02 10:11:48,598 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 613 [2018-02-02 10:11:48,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:11:48,599 INFO L225 Difference]: With dead ends: 248 [2018-02-02 10:11:48,599 INFO L226 Difference]: Without dead ends: 248 [2018-02-02 10:11:48,599 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-02 10:11:48,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2018-02-02 10:11:48,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 191. [2018-02-02 10:11:48,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2018-02-02 10:11:48,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 212 transitions. [2018-02-02 10:11:48,603 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 212 transitions. Word has length 613 [2018-02-02 10:11:48,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:11:48,604 INFO L432 AbstractCegarLoop]: Abstraction has 191 states and 212 transitions. [2018-02-02 10:11:48,604 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-02 10:11:48,604 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 212 transitions. [2018-02-02 10:11:48,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 680 [2018-02-02 10:11:48,607 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:11:48,607 INFO L351 BasicCegarLoop]: trace histogram [100, 90, 90, 90, 90, 90, 11, 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] [2018-02-02 10:11:48,607 INFO L371 AbstractCegarLoop]: === Iteration 25 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:11:48,607 INFO L82 PathProgramCache]: Analyzing trace with hash 711631215, now seen corresponding path program 18 times [2018-02-02 10:11:48,608 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:11:48,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:11:48,640 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:11:49,495 INFO L134 CoverageAnalysis]: Checked inductivity of 26390 backedges. 38 proven. 4977 refuted. 0 times theorem prover too weak. 21375 trivial. 0 not checked. [2018-02-02 10:11:49,495 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:11:49,495 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-02-02 10:11:49,496 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:11:49,496 INFO L134 CoverageAnalysis]: Checked inductivity of 2700 backedges. 0 proven. 531 refuted. 0 times theorem prover too weak. 2169 trivial. 0 not checked. [2018-02-02 10:11:49,496 INFO L182 omatonBuilderFactory]: Interpolants [5504#true, 5505#false, 5506#(and (= foo_~i~0 0) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 5507#(and (or (<= foo_~i~0 1) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 5508#(and (or (<= foo_~i~0 2) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 5509#(and (or (<= foo_~i~0 3) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 5510#(and (or (<= foo_~i~0 4) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 5511#(and (or (not (= foo_~size 32)) (<= foo_~i~0 5)) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 5512#(and (or (<= foo_~i~0 6) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 5513#(and (or (<= foo_~i~0 7) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 5514#(and (or (= |foo_#in~size| foo_~size) (= foo_~size 32)) (or (not (= foo_~size 32)) (<= foo_~i~0 8))), 5515#(and (or (<= foo_~i~0 9) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 5516#(not (= |foo_#in~size| 32))] [2018-02-02 10:11:49,496 INFO L134 CoverageAnalysis]: Checked inductivity of 26390 backedges. 38 proven. 4977 refuted. 0 times theorem prover too weak. 21375 trivial. 0 not checked. [2018-02-02 10:11:49,497 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-02 10:11:49,497 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-02 10:11:49,497 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2018-02-02 10:11:49,497 INFO L87 Difference]: Start difference. First operand 191 states and 212 transitions. Second operand 13 states. [2018-02-02 10:11:49,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:11:49,586 INFO L93 Difference]: Finished difference Result 204 states and 225 transitions. [2018-02-02 10:11:49,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-02 10:11:49,587 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 679 [2018-02-02 10:11:49,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:11:49,587 INFO L225 Difference]: With dead ends: 204 [2018-02-02 10:11:49,587 INFO L226 Difference]: Without dead ends: 201 [2018-02-02 10:11:49,588 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=80, Invalid=102, Unknown=0, NotChecked=0, Total=182 [2018-02-02 10:11:49,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2018-02-02 10:11:49,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 197. [2018-02-02 10:11:49,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2018-02-02 10:11:49,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 218 transitions. [2018-02-02 10:11:49,591 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 218 transitions. Word has length 679 [2018-02-02 10:11:49,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:11:49,591 INFO L432 AbstractCegarLoop]: Abstraction has 197 states and 218 transitions. [2018-02-02 10:11:49,591 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-02 10:11:49,591 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 218 transitions. [2018-02-02 10:11:49,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 740 [2018-02-02 10:11:49,594 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:11:49,594 INFO L351 BasicCegarLoop]: trace histogram [110, 100, 100, 100, 100, 100, 11, 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] [2018-02-02 10:11:49,594 INFO L371 AbstractCegarLoop]: === Iteration 26 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:11:49,594 INFO L82 PathProgramCache]: Analyzing trace with hash -1834618241, now seen corresponding path program 19 times [2018-02-02 10:11:49,595 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:11:49,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:11:49,627 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:11:50,169 INFO L134 CoverageAnalysis]: Checked inductivity of 32260 backedges. 0 proven. 290 refuted. 0 times theorem prover too weak. 31970 trivial. 0 not checked. [2018-02-02 10:11:50,169 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:11:50,169 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-02-02 10:11:50,169 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:11:50,170 INFO L134 CoverageAnalysis]: Checked inductivity of 2970 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2970 trivial. 0 not checked. [2018-02-02 10:11:50,170 INFO L182 omatonBuilderFactory]: Interpolants [5920#true, 5921#false, 5922#(= main_~i~1 0), 5923#(<= main_~i~1 1), 5924#(<= main_~i~1 2), 5925#(<= main_~i~1 3), 5926#(<= main_~i~1 4), 5927#(<= main_~i~1 5), 5928#(<= main_~i~1 6), 5929#(<= main_~i~1 7), 5930#(<= main_~i~1 8), 5931#(<= main_~i~1 9), 5932#(<= main_~i~1 10)] [2018-02-02 10:11:50,170 INFO L134 CoverageAnalysis]: Checked inductivity of 32260 backedges. 0 proven. 290 refuted. 0 times theorem prover too weak. 31970 trivial. 0 not checked. [2018-02-02 10:11:50,170 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-02 10:11:50,171 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-02 10:11:50,171 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-02-02 10:11:50,171 INFO L87 Difference]: Start difference. First operand 197 states and 218 transitions. Second operand 13 states. [2018-02-02 10:11:50,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:11:50,270 INFO L93 Difference]: Finished difference Result 270 states and 284 transitions. [2018-02-02 10:11:50,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-02 10:11:50,270 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 739 [2018-02-02 10:11:50,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:11:50,272 INFO L225 Difference]: With dead ends: 270 [2018-02-02 10:11:50,272 INFO L226 Difference]: Without dead ends: 270 [2018-02-02 10:11:50,272 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-02 10:11:50,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2018-02-02 10:11:50,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 208. [2018-02-02 10:11:50,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2018-02-02 10:11:50,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 231 transitions. [2018-02-02 10:11:50,277 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 231 transitions. Word has length 739 [2018-02-02 10:11:50,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:11:50,277 INFO L432 AbstractCegarLoop]: Abstraction has 208 states and 231 transitions. [2018-02-02 10:11:50,277 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-02 10:11:50,277 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 231 transitions. [2018-02-02 10:11:50,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 812 [2018-02-02 10:11:50,281 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:11:50,281 INFO L351 BasicCegarLoop]: trace histogram [121, 110, 110, 110, 110, 110, 12, 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] [2018-02-02 10:11:50,281 INFO L371 AbstractCegarLoop]: === Iteration 27 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:11:50,281 INFO L82 PathProgramCache]: Analyzing trace with hash -2041430256, now seen corresponding path program 20 times [2018-02-02 10:11:50,282 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:11:50,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:11:50,322 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:11:51,231 INFO L134 CoverageAnalysis]: Checked inductivity of 39072 backedges. 42 proven. 6740 refuted. 0 times theorem prover too weak. 32290 trivial. 0 not checked. [2018-02-02 10:11:51,231 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:11:51,231 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-02 10:11:51,232 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:11:51,232 INFO L134 CoverageAnalysis]: Checked inductivity of 3630 backedges. 0 proven. 650 refuted. 0 times theorem prover too weak. 2980 trivial. 0 not checked. [2018-02-02 10:11:51,232 INFO L182 omatonBuilderFactory]: Interpolants [6411#true, 6412#false, 6413#(and (= foo_~i~0 0) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 6414#(and (or (<= foo_~i~0 1) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 6415#(and (or (<= foo_~i~0 2) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 6416#(and (or (<= foo_~i~0 3) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 6417#(and (or (<= foo_~i~0 4) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 6418#(and (or (not (= foo_~size 32)) (<= foo_~i~0 5)) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 6419#(and (or (<= foo_~i~0 6) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 6420#(and (or (<= foo_~i~0 7) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 6421#(and (or (= |foo_#in~size| foo_~size) (= foo_~size 32)) (or (not (= foo_~size 32)) (<= foo_~i~0 8))), 6422#(and (or (<= foo_~i~0 9) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 6423#(and (or (<= foo_~i~0 10) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 6424#(not (= |foo_#in~size| 32))] [2018-02-02 10:11:51,233 INFO L134 CoverageAnalysis]: Checked inductivity of 39072 backedges. 42 proven. 6740 refuted. 0 times theorem prover too weak. 32290 trivial. 0 not checked. [2018-02-02 10:11:51,233 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-02 10:11:51,233 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-02 10:11:51,233 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=102, Unknown=0, NotChecked=0, Total=182 [2018-02-02 10:11:51,233 INFO L87 Difference]: Start difference. First operand 208 states and 231 transitions. Second operand 14 states. [2018-02-02 10:11:51,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:11:51,302 INFO L93 Difference]: Finished difference Result 221 states and 244 transitions. [2018-02-02 10:11:51,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-02 10:11:51,302 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 811 [2018-02-02 10:11:51,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:11:51,303 INFO L225 Difference]: With dead ends: 221 [2018-02-02 10:11:51,303 INFO L226 Difference]: Without dead ends: 218 [2018-02-02 10:11:51,303 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=93, Invalid=117, Unknown=0, NotChecked=0, Total=210 [2018-02-02 10:11:51,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2018-02-02 10:11:51,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 214. [2018-02-02 10:11:51,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2018-02-02 10:11:51,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 237 transitions. [2018-02-02 10:11:51,308 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 237 transitions. Word has length 811 [2018-02-02 10:11:51,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:11:51,309 INFO L432 AbstractCegarLoop]: Abstraction has 214 states and 237 transitions. [2018-02-02 10:11:51,309 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-02 10:11:51,309 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 237 transitions. [2018-02-02 10:11:51,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 878 [2018-02-02 10:11:51,317 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:11:51,317 INFO L351 BasicCegarLoop]: trace histogram [132, 121, 121, 121, 121, 121, 12, 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] [2018-02-02 10:11:51,317 INFO L371 AbstractCegarLoop]: === Iteration 28 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:11:51,318 INFO L82 PathProgramCache]: Analyzing trace with hash -1088231448, now seen corresponding path program 21 times [2018-02-02 10:11:51,318 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:11:51,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:11:51,394 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:11:52,113 INFO L134 CoverageAnalysis]: Checked inductivity of 46904 backedges. 0 proven. 352 refuted. 0 times theorem prover too weak. 46552 trivial. 0 not checked. [2018-02-02 10:11:52,114 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:11:52,114 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-02 10:11:52,114 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:11:52,114 INFO L134 CoverageAnalysis]: Checked inductivity of 3960 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3960 trivial. 0 not checked. [2018-02-02 10:11:52,114 INFO L182 omatonBuilderFactory]: Interpolants [6862#true, 6863#false, 6864#(= main_~i~1 0), 6865#(<= main_~i~1 1), 6866#(<= main_~i~1 2), 6867#(<= main_~i~1 3), 6868#(<= main_~i~1 4), 6869#(<= main_~i~1 5), 6870#(<= main_~i~1 6), 6871#(<= main_~i~1 7), 6872#(<= main_~i~1 8), 6873#(<= main_~i~1 9), 6874#(<= main_~i~1 10), 6875#(<= main_~i~1 11)] [2018-02-02 10:11:52,115 INFO L134 CoverageAnalysis]: Checked inductivity of 46904 backedges. 0 proven. 352 refuted. 0 times theorem prover too weak. 46552 trivial. 0 not checked. [2018-02-02 10:11:52,115 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-02 10:11:52,115 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-02 10:11:52,115 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-02-02 10:11:52,115 INFO L87 Difference]: Start difference. First operand 214 states and 237 transitions. Second operand 14 states. [2018-02-02 10:11:52,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:11:52,237 INFO L93 Difference]: Finished difference Result 292 states and 307 transitions. [2018-02-02 10:11:52,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-02 10:11:52,238 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 877 [2018-02-02 10:11:52,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:11:52,239 INFO L225 Difference]: With dead ends: 292 [2018-02-02 10:11:52,239 INFO L226 Difference]: Without dead ends: 292 [2018-02-02 10:11:52,239 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-02 10:11:52,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2018-02-02 10:11:52,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 225. [2018-02-02 10:11:52,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2018-02-02 10:11:52,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 250 transitions. [2018-02-02 10:11:52,243 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 250 transitions. Word has length 877 [2018-02-02 10:11:52,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:11:52,243 INFO L432 AbstractCegarLoop]: Abstraction has 225 states and 250 transitions. [2018-02-02 10:11:52,243 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-02 10:11:52,243 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 250 transitions. [2018-02-02 10:11:52,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 956 [2018-02-02 10:11:52,248 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:11:52,248 INFO L351 BasicCegarLoop]: trace histogram [144, 132, 132, 132, 132, 132, 13, 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] [2018-02-02 10:11:52,248 INFO L371 AbstractCegarLoop]: === Iteration 29 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:11:52,248 INFO L82 PathProgramCache]: Analyzing trace with hash -500335487, now seen corresponding path program 22 times [2018-02-02 10:11:52,249 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:11:52,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:11:52,287 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:11:53,619 INFO L134 CoverageAnalysis]: Checked inductivity of 55860 backedges. 46 proven. 8877 refuted. 0 times theorem prover too weak. 46937 trivial. 0 not checked. [2018-02-02 10:11:53,619 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:11:53,619 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-02-02 10:11:53,619 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:11:53,620 INFO L134 CoverageAnalysis]: Checked inductivity of 4752 backedges. 0 proven. 781 refuted. 0 times theorem prover too weak. 3971 trivial. 0 not checked. [2018-02-02 10:11:53,620 INFO L182 omatonBuilderFactory]: Interpolants [7393#true, 7394#false, 7395#(and (= foo_~i~0 0) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 7396#(and (or (<= foo_~i~0 1) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 7397#(and (or (<= foo_~i~0 2) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 7398#(and (or (<= foo_~i~0 3) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 7399#(and (or (<= foo_~i~0 4) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 7400#(and (or (not (= foo_~size 32)) (<= foo_~i~0 5)) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 7401#(and (or (<= foo_~i~0 6) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 7402#(and (or (<= foo_~i~0 7) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 7403#(and (or (= |foo_#in~size| foo_~size) (= foo_~size 32)) (or (not (= foo_~size 32)) (<= foo_~i~0 8))), 7404#(and (or (<= foo_~i~0 9) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 7405#(and (or (<= foo_~i~0 10) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 7406#(and (or (<= foo_~i~0 11) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 7407#(not (= |foo_#in~size| 32))] [2018-02-02 10:11:53,621 INFO L134 CoverageAnalysis]: Checked inductivity of 55860 backedges. 46 proven. 8877 refuted. 0 times theorem prover too weak. 46937 trivial. 0 not checked. [2018-02-02 10:11:53,621 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-02 10:11:53,621 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-02 10:11:53,621 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=117, Unknown=0, NotChecked=0, Total=210 [2018-02-02 10:11:53,621 INFO L87 Difference]: Start difference. First operand 225 states and 250 transitions. Second operand 15 states. [2018-02-02 10:11:53,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:11:53,691 INFO L93 Difference]: Finished difference Result 238 states and 263 transitions. [2018-02-02 10:11:53,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-02 10:11:53,691 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 955 [2018-02-02 10:11:53,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:11:53,692 INFO L225 Difference]: With dead ends: 238 [2018-02-02 10:11:53,692 INFO L226 Difference]: Without dead ends: 235 [2018-02-02 10:11:53,692 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=107, Invalid=133, Unknown=0, NotChecked=0, Total=240 [2018-02-02 10:11:53,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2018-02-02 10:11:53,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 231. [2018-02-02 10:11:53,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2018-02-02 10:11:53,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 256 transitions. [2018-02-02 10:11:53,697 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 256 transitions. Word has length 955 [2018-02-02 10:11:53,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:11:53,698 INFO L432 AbstractCegarLoop]: Abstraction has 231 states and 256 transitions. [2018-02-02 10:11:53,698 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-02 10:11:53,698 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 256 transitions. [2018-02-02 10:11:53,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1028 [2018-02-02 10:11:53,706 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:11:53,706 INFO L351 BasicCegarLoop]: trace histogram [156, 144, 144, 144, 144, 144, 13, 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] [2018-02-02 10:11:53,706 INFO L371 AbstractCegarLoop]: === Iteration 30 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:11:53,707 INFO L82 PathProgramCache]: Analyzing trace with hash -1879255455, now seen corresponding path program 23 times [2018-02-02 10:11:53,708 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:11:53,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:11:53,768 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:11:54,777 INFO L134 CoverageAnalysis]: Checked inductivity of 66048 backedges. 0 proven. 420 refuted. 0 times theorem prover too weak. 65628 trivial. 0 not checked. [2018-02-02 10:11:54,778 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:11:54,778 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-02-02 10:11:54,778 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:11:54,778 INFO L134 CoverageAnalysis]: Checked inductivity of 5148 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5148 trivial. 0 not checked. [2018-02-02 10:11:54,778 INFO L182 omatonBuilderFactory]: Interpolants [7879#true, 7880#false, 7881#(= main_~i~1 0), 7882#(<= main_~i~1 1), 7883#(<= main_~i~1 2), 7884#(<= main_~i~1 3), 7885#(<= main_~i~1 4), 7886#(<= main_~i~1 5), 7887#(<= main_~i~1 6), 7888#(<= main_~i~1 7), 7889#(<= main_~i~1 8), 7890#(<= main_~i~1 9), 7891#(<= main_~i~1 10), 7892#(<= main_~i~1 11), 7893#(<= main_~i~1 12)] [2018-02-02 10:11:54,779 INFO L134 CoverageAnalysis]: Checked inductivity of 66048 backedges. 0 proven. 420 refuted. 0 times theorem prover too weak. 65628 trivial. 0 not checked. [2018-02-02 10:11:54,779 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-02 10:11:54,780 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-02 10:11:54,780 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-02-02 10:11:54,780 INFO L87 Difference]: Start difference. First operand 231 states and 256 transitions. Second operand 15 states. [2018-02-02 10:11:54,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:11:54,901 INFO L93 Difference]: Finished difference Result 314 states and 330 transitions. [2018-02-02 10:11:54,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-02 10:11:54,901 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 1027 [2018-02-02 10:11:54,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:11:54,902 INFO L225 Difference]: With dead ends: 314 [2018-02-02 10:11:54,902 INFO L226 Difference]: Without dead ends: 314 [2018-02-02 10:11:54,903 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-02 10:11:54,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2018-02-02 10:11:54,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 242. [2018-02-02 10:11:54,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2018-02-02 10:11:54,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 269 transitions. [2018-02-02 10:11:54,906 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 269 transitions. Word has length 1027 [2018-02-02 10:11:54,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:11:54,907 INFO L432 AbstractCegarLoop]: Abstraction has 242 states and 269 transitions. [2018-02-02 10:11:54,907 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-02 10:11:54,907 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 269 transitions. [2018-02-02 10:11:54,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1112 [2018-02-02 10:11:54,914 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:11:54,914 INFO L351 BasicCegarLoop]: trace histogram [169, 156, 156, 156, 156, 156, 14, 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] [2018-02-02 10:11:54,914 INFO L371 AbstractCegarLoop]: === Iteration 31 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:11:54,915 INFO L82 PathProgramCache]: Analyzing trace with hash 1856294786, now seen corresponding path program 24 times [2018-02-02 10:11:54,915 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:11:54,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:11:54,968 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:11:56,575 INFO L134 CoverageAnalysis]: Checked inductivity of 77558 backedges. 50 proven. 11424 refuted. 0 times theorem prover too weak. 66084 trivial. 0 not checked. [2018-02-02 10:11:56,575 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:11:56,575 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-02-02 10:11:56,575 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:11:56,576 INFO L134 CoverageAnalysis]: Checked inductivity of 6084 backedges. 0 proven. 924 refuted. 0 times theorem prover too weak. 5160 trivial. 0 not checked. [2018-02-02 10:11:56,576 INFO L182 omatonBuilderFactory]: Interpolants [8450#true, 8451#false, 8452#(and (= foo_~i~0 0) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 8453#(and (or (<= foo_~i~0 1) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 8454#(and (or (<= foo_~i~0 2) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 8455#(and (or (<= foo_~i~0 3) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 8456#(and (or (<= foo_~i~0 4) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 8457#(and (or (not (= foo_~size 32)) (<= foo_~i~0 5)) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 8458#(and (or (<= foo_~i~0 6) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 8459#(and (or (<= foo_~i~0 7) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 8460#(and (or (= |foo_#in~size| foo_~size) (= foo_~size 32)) (or (not (= foo_~size 32)) (<= foo_~i~0 8))), 8461#(and (or (<= foo_~i~0 9) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 8462#(and (or (<= foo_~i~0 10) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 8463#(and (or (<= foo_~i~0 11) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 8464#(and (or (<= foo_~i~0 12) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 8465#(not (= |foo_#in~size| 32))] [2018-02-02 10:11:56,577 INFO L134 CoverageAnalysis]: Checked inductivity of 77558 backedges. 50 proven. 11424 refuted. 0 times theorem prover too weak. 66084 trivial. 0 not checked. [2018-02-02 10:11:56,577 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-02 10:11:56,577 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-02 10:11:56,577 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=133, Unknown=0, NotChecked=0, Total=240 [2018-02-02 10:11:56,577 INFO L87 Difference]: Start difference. First operand 242 states and 269 transitions. Second operand 16 states. [2018-02-02 10:11:56,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:11:56,637 INFO L93 Difference]: Finished difference Result 255 states and 282 transitions. [2018-02-02 10:11:56,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-02 10:11:56,643 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 1111 [2018-02-02 10:11:56,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:11:56,644 INFO L225 Difference]: With dead ends: 255 [2018-02-02 10:11:56,644 INFO L226 Difference]: Without dead ends: 252 [2018-02-02 10:11:56,644 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=122, Invalid=150, Unknown=0, NotChecked=0, Total=272 [2018-02-02 10:11:56,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2018-02-02 10:11:56,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 248. [2018-02-02 10:11:56,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2018-02-02 10:11:56,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 275 transitions. [2018-02-02 10:11:56,649 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 275 transitions. Word has length 1111 [2018-02-02 10:11:56,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:11:56,649 INFO L432 AbstractCegarLoop]: Abstraction has 248 states and 275 transitions. [2018-02-02 10:11:56,649 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-02 10:11:56,649 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 275 transitions. [2018-02-02 10:11:56,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1190 [2018-02-02 10:11:56,659 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:11:56,659 INFO L351 BasicCegarLoop]: trace histogram [182, 169, 169, 169, 169, 169, 14, 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] [2018-02-02 10:11:56,660 INFO L371 AbstractCegarLoop]: === Iteration 32 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:11:56,660 INFO L82 PathProgramCache]: Analyzing trace with hash 1396010922, now seen corresponding path program 25 times [2018-02-02 10:11:56,660 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:11:56,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:11:56,725 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:11:57,971 INFO L134 CoverageAnalysis]: Checked inductivity of 90532 backedges. 0 proven. 494 refuted. 0 times theorem prover too weak. 90038 trivial. 0 not checked. [2018-02-02 10:11:57,971 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:11:57,971 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-02-02 10:11:57,971 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:11:57,971 INFO L134 CoverageAnalysis]: Checked inductivity of 6552 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6552 trivial. 0 not checked. [2018-02-02 10:11:57,971 INFO L182 omatonBuilderFactory]: Interpolants [8971#true, 8972#false, 8973#(= main_~i~1 0), 8974#(<= main_~i~1 1), 8975#(<= main_~i~1 2), 8976#(<= main_~i~1 3), 8977#(<= main_~i~1 4), 8978#(<= main_~i~1 5), 8979#(<= main_~i~1 6), 8980#(<= main_~i~1 7), 8981#(<= main_~i~1 8), 8982#(<= main_~i~1 9), 8983#(<= main_~i~1 10), 8984#(<= main_~i~1 11), 8985#(<= main_~i~1 12), 8986#(<= main_~i~1 13)] [2018-02-02 10:11:57,972 INFO L134 CoverageAnalysis]: Checked inductivity of 90532 backedges. 0 proven. 494 refuted. 0 times theorem prover too weak. 90038 trivial. 0 not checked. [2018-02-02 10:11:57,973 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-02 10:11:57,973 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-02 10:11:57,973 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-02-02 10:11:57,973 INFO L87 Difference]: Start difference. First operand 248 states and 275 transitions. Second operand 16 states. [2018-02-02 10:11:58,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:11:58,087 INFO L93 Difference]: Finished difference Result 336 states and 353 transitions. [2018-02-02 10:11:58,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-02 10:11:58,088 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 1189 [2018-02-02 10:11:58,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:11:58,089 INFO L225 Difference]: With dead ends: 336 [2018-02-02 10:11:58,089 INFO L226 Difference]: Without dead ends: 336 [2018-02-02 10:11:58,089 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-02 10:11:58,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2018-02-02 10:11:58,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 259. [2018-02-02 10:11:58,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2018-02-02 10:11:58,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 288 transitions. [2018-02-02 10:11:58,094 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 288 transitions. Word has length 1189 [2018-02-02 10:11:58,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:11:58,094 INFO L432 AbstractCegarLoop]: Abstraction has 259 states and 288 transitions. [2018-02-02 10:11:58,094 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-02 10:11:58,095 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 288 transitions. [2018-02-02 10:11:58,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1280 [2018-02-02 10:11:58,101 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:11:58,102 INFO L351 BasicCegarLoop]: trace histogram [196, 182, 182, 182, 182, 182, 15, 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] [2018-02-02 10:11:58,102 INFO L371 AbstractCegarLoop]: === Iteration 33 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:11:58,102 INFO L82 PathProgramCache]: Analyzing trace with hash -601504301, now seen corresponding path program 26 times [2018-02-02 10:11:58,103 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:11:58,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:11:58,169 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:12:00,082 INFO L134 CoverageAnalysis]: Checked inductivity of 105042 backedges. 54 proven. 14417 refuted. 0 times theorem prover too weak. 90571 trivial. 0 not checked. [2018-02-02 10:12:00,082 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:12:00,082 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-02-02 10:12:00,082 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:12:00,083 INFO L134 CoverageAnalysis]: Checked inductivity of 7644 backedges. 0 proven. 1079 refuted. 0 times theorem prover too weak. 6565 trivial. 0 not checked. [2018-02-02 10:12:00,083 INFO L182 omatonBuilderFactory]: Interpolants [9582#true, 9583#false, 9584#(and (= foo_~i~0 0) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 9585#(and (or (<= foo_~i~0 1) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 9586#(and (or (<= foo_~i~0 2) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 9587#(and (or (<= foo_~i~0 3) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 9588#(and (or (<= foo_~i~0 4) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 9589#(and (or (not (= foo_~size 32)) (<= foo_~i~0 5)) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 9590#(and (or (<= foo_~i~0 6) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 9591#(and (or (<= foo_~i~0 7) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 9592#(and (or (= |foo_#in~size| foo_~size) (= foo_~size 32)) (or (not (= foo_~size 32)) (<= foo_~i~0 8))), 9593#(and (or (<= foo_~i~0 9) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 9594#(and (or (<= foo_~i~0 10) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 9595#(and (or (<= foo_~i~0 11) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 9596#(and (or (<= foo_~i~0 12) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 9597#(and (or (not (= foo_~size 32)) (<= foo_~i~0 13)) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 9598#(not (= |foo_#in~size| 32))] [2018-02-02 10:12:00,084 INFO L134 CoverageAnalysis]: Checked inductivity of 105042 backedges. 54 proven. 14417 refuted. 0 times theorem prover too weak. 90571 trivial. 0 not checked. [2018-02-02 10:12:00,084 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-02 10:12:00,085 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-02 10:12:00,085 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=150, Unknown=0, NotChecked=0, Total=272 [2018-02-02 10:12:00,085 INFO L87 Difference]: Start difference. First operand 259 states and 288 transitions. Second operand 17 states. [2018-02-02 10:12:00,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:12:00,161 INFO L93 Difference]: Finished difference Result 272 states and 301 transitions. [2018-02-02 10:12:00,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-02 10:12:00,161 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 1279 [2018-02-02 10:12:00,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:12:00,162 INFO L225 Difference]: With dead ends: 272 [2018-02-02 10:12:00,162 INFO L226 Difference]: Without dead ends: 269 [2018-02-02 10:12:00,162 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=138, Invalid=168, Unknown=0, NotChecked=0, Total=306 [2018-02-02 10:12:00,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2018-02-02 10:12:00,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 265. [2018-02-02 10:12:00,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2018-02-02 10:12:00,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 294 transitions. [2018-02-02 10:12:00,166 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 294 transitions. Word has length 1279 [2018-02-02 10:12:00,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:12:00,166 INFO L432 AbstractCegarLoop]: Abstraction has 265 states and 294 transitions. [2018-02-02 10:12:00,166 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-02 10:12:00,166 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 294 transitions. [2018-02-02 10:12:00,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1364 [2018-02-02 10:12:00,174 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:12:00,175 INFO L351 BasicCegarLoop]: trace histogram [210, 196, 196, 196, 196, 196, 15, 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] [2018-02-02 10:12:00,175 INFO L371 AbstractCegarLoop]: === Iteration 34 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:12:00,175 INFO L82 PathProgramCache]: Analyzing trace with hash 1767243139, now seen corresponding path program 27 times [2018-02-02 10:12:00,176 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:12:00,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:12:00,225 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:12:01,814 INFO L134 CoverageAnalysis]: Checked inductivity of 121268 backedges. 0 proven. 574 refuted. 0 times theorem prover too weak. 120694 trivial. 0 not checked. [2018-02-02 10:12:01,815 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:12:01,815 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-02-02 10:12:01,815 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:12:01,815 INFO L134 CoverageAnalysis]: Checked inductivity of 8190 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8190 trivial. 0 not checked. [2018-02-02 10:12:01,815 INFO L182 omatonBuilderFactory]: Interpolants [10144#(<= main_~i~1 4), 10145#(<= main_~i~1 5), 10146#(<= main_~i~1 6), 10147#(<= main_~i~1 7), 10148#(<= main_~i~1 8), 10149#(<= main_~i~1 9), 10150#(<= main_~i~1 10), 10151#(<= main_~i~1 11), 10152#(<= main_~i~1 12), 10153#(<= main_~i~1 13), 10154#(<= main_~i~1 14), 10138#true, 10139#false, 10140#(= main_~i~1 0), 10141#(<= main_~i~1 1), 10142#(<= main_~i~1 2), 10143#(<= main_~i~1 3)] [2018-02-02 10:12:01,817 INFO L134 CoverageAnalysis]: Checked inductivity of 121268 backedges. 0 proven. 574 refuted. 0 times theorem prover too weak. 120694 trivial. 0 not checked. [2018-02-02 10:12:01,817 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-02 10:12:01,817 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-02 10:12:01,817 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-02-02 10:12:01,817 INFO L87 Difference]: Start difference. First operand 265 states and 294 transitions. Second operand 17 states. [2018-02-02 10:12:02,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:12:02,036 INFO L93 Difference]: Finished difference Result 358 states and 376 transitions. [2018-02-02 10:12:02,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-02 10:12:02,037 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 1363 [2018-02-02 10:12:02,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:12:02,038 INFO L225 Difference]: With dead ends: 358 [2018-02-02 10:12:02,038 INFO L226 Difference]: Without dead ends: 358 [2018-02-02 10:12:02,038 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-02 10:12:02,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2018-02-02 10:12:02,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 276. [2018-02-02 10:12:02,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 276 states. [2018-02-02 10:12:02,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 307 transitions. [2018-02-02 10:12:02,042 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 307 transitions. Word has length 1363 [2018-02-02 10:12:02,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:12:02,043 INFO L432 AbstractCegarLoop]: Abstraction has 276 states and 307 transitions. [2018-02-02 10:12:02,043 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-02 10:12:02,043 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 307 transitions. [2018-02-02 10:12:02,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1460 [2018-02-02 10:12:02,052 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:12:02,052 INFO L351 BasicCegarLoop]: trace histogram [225, 210, 210, 210, 210, 210, 16, 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] [2018-02-02 10:12:02,052 INFO L371 AbstractCegarLoop]: === Iteration 35 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:12:02,052 INFO L82 PathProgramCache]: Analyzing trace with hash 946488628, now seen corresponding path program 28 times [2018-02-02 10:12:02,053 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:12:02,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:12:02,129 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:12:04,658 INFO L134 CoverageAnalysis]: Checked inductivity of 139260 backedges. 58 proven. 17892 refuted. 0 times theorem prover too weak. 121310 trivial. 0 not checked. [2018-02-02 10:12:04,658 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:12:04,658 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-02-02 10:12:04,658 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:12:04,659 INFO L134 CoverageAnalysis]: Checked inductivity of 9450 backedges. 0 proven. 1246 refuted. 0 times theorem prover too weak. 8204 trivial. 0 not checked. [2018-02-02 10:12:04,659 INFO L182 omatonBuilderFactory]: Interpolants [10789#true, 10790#false, 10791#(and (= foo_~i~0 0) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 10792#(and (or (<= foo_~i~0 1) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 10793#(and (or (<= foo_~i~0 2) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 10794#(and (or (<= foo_~i~0 3) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 10795#(and (or (<= foo_~i~0 4) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 10796#(and (or (not (= foo_~size 32)) (<= foo_~i~0 5)) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 10797#(and (or (<= foo_~i~0 6) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 10798#(and (or (<= foo_~i~0 7) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 10799#(and (or (= |foo_#in~size| foo_~size) (= foo_~size 32)) (or (not (= foo_~size 32)) (<= foo_~i~0 8))), 10800#(and (or (<= foo_~i~0 9) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 10801#(and (or (<= foo_~i~0 10) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 10802#(and (or (<= foo_~i~0 11) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 10803#(and (or (<= foo_~i~0 12) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 10804#(and (or (not (= foo_~size 32)) (<= foo_~i~0 13)) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 10805#(and (or (<= foo_~i~0 14) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 10806#(not (= |foo_#in~size| 32))] [2018-02-02 10:12:04,661 INFO L134 CoverageAnalysis]: Checked inductivity of 139260 backedges. 58 proven. 17892 refuted. 0 times theorem prover too weak. 121310 trivial. 0 not checked. [2018-02-02 10:12:04,661 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-02 10:12:04,661 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-02 10:12:04,661 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=168, Unknown=0, NotChecked=0, Total=306 [2018-02-02 10:12:04,661 INFO L87 Difference]: Start difference. First operand 276 states and 307 transitions. Second operand 18 states. [2018-02-02 10:12:04,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:12:04,751 INFO L93 Difference]: Finished difference Result 289 states and 320 transitions. [2018-02-02 10:12:04,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-02 10:12:04,752 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 1459 [2018-02-02 10:12:04,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:12:04,752 INFO L225 Difference]: With dead ends: 289 [2018-02-02 10:12:04,753 INFO L226 Difference]: Without dead ends: 286 [2018-02-02 10:12:04,753 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=155, Invalid=187, Unknown=0, NotChecked=0, Total=342 [2018-02-02 10:12:04,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2018-02-02 10:12:04,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 282. [2018-02-02 10:12:04,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282 states. [2018-02-02 10:12:04,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 313 transitions. [2018-02-02 10:12:04,757 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 313 transitions. Word has length 1459 [2018-02-02 10:12:04,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:12:04,757 INFO L432 AbstractCegarLoop]: Abstraction has 282 states and 313 transitions. [2018-02-02 10:12:04,757 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-02 10:12:04,757 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 313 transitions. [2018-02-02 10:12:04,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1550 [2018-02-02 10:12:04,767 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:12:04,767 INFO L351 BasicCegarLoop]: trace histogram [240, 225, 225, 225, 225, 225, 16, 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] [2018-02-02 10:12:04,767 INFO L371 AbstractCegarLoop]: === Iteration 36 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:12:04,768 INFO L82 PathProgramCache]: Analyzing trace with hash -754671188, now seen corresponding path program 29 times [2018-02-02 10:12:04,768 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:12:04,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:12:04,826 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:12:06,927 INFO L134 CoverageAnalysis]: Checked inductivity of 159240 backedges. 0 proven. 660 refuted. 0 times theorem prover too weak. 158580 trivial. 0 not checked. [2018-02-02 10:12:06,928 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:12:06,928 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-02-02 10:12:06,928 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:12:06,928 INFO L134 CoverageAnalysis]: Checked inductivity of 10080 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10080 trivial. 0 not checked. [2018-02-02 10:12:06,928 INFO L182 omatonBuilderFactory]: Interpolants [11392#(<= main_~i~1 10), 11393#(<= main_~i~1 11), 11394#(<= main_~i~1 12), 11395#(<= main_~i~1 13), 11396#(<= main_~i~1 14), 11397#(<= main_~i~1 15), 11380#true, 11381#false, 11382#(= main_~i~1 0), 11383#(<= main_~i~1 1), 11384#(<= main_~i~1 2), 11385#(<= main_~i~1 3), 11386#(<= main_~i~1 4), 11387#(<= main_~i~1 5), 11388#(<= main_~i~1 6), 11389#(<= main_~i~1 7), 11390#(<= main_~i~1 8), 11391#(<= main_~i~1 9)] [2018-02-02 10:12:06,930 INFO L134 CoverageAnalysis]: Checked inductivity of 159240 backedges. 0 proven. 660 refuted. 0 times theorem prover too weak. 158580 trivial. 0 not checked. [2018-02-02 10:12:06,930 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-02 10:12:06,930 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-02 10:12:06,930 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-02-02 10:12:06,930 INFO L87 Difference]: Start difference. First operand 282 states and 313 transitions. Second operand 18 states. [2018-02-02 10:12:07,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:12:07,044 INFO L93 Difference]: Finished difference Result 380 states and 399 transitions. [2018-02-02 10:12:07,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-02 10:12:07,044 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 1549 [2018-02-02 10:12:07,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:12:07,046 INFO L225 Difference]: With dead ends: 380 [2018-02-02 10:12:07,046 INFO L226 Difference]: Without dead ends: 380 [2018-02-02 10:12:07,046 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-02-02 10:12:07,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2018-02-02 10:12:07,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 293. [2018-02-02 10:12:07,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 293 states. [2018-02-02 10:12:07,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 326 transitions. [2018-02-02 10:12:07,050 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 326 transitions. Word has length 1549 [2018-02-02 10:12:07,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:12:07,051 INFO L432 AbstractCegarLoop]: Abstraction has 293 states and 326 transitions. [2018-02-02 10:12:07,051 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-02 10:12:07,051 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 326 transitions. [2018-02-02 10:12:07,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1652 [2018-02-02 10:12:07,063 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:12:07,063 INFO L351 BasicCegarLoop]: trace histogram [256, 240, 240, 240, 240, 240, 17, 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] [2018-02-02 10:12:07,064 INFO L371 AbstractCegarLoop]: === Iteration 37 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:12:07,064 INFO L82 PathProgramCache]: Analyzing trace with hash 1444662117, now seen corresponding path program 30 times [2018-02-02 10:12:07,064 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:12:07,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:12:07,128 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:12:10,240 INFO L134 CoverageAnalysis]: Checked inductivity of 181232 backedges. 62 proven. 21885 refuted. 0 times theorem prover too weak. 159285 trivial. 0 not checked. [2018-02-02 10:12:10,240 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:12:10,240 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-02-02 10:12:10,241 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:12:10,241 INFO L134 CoverageAnalysis]: Checked inductivity of 11520 backedges. 0 proven. 1425 refuted. 0 times theorem prover too weak. 10095 trivial. 0 not checked. [2018-02-02 10:12:10,241 INFO L182 omatonBuilderFactory]: Interpolants [12071#true, 12072#false, 12073#(and (= foo_~i~0 0) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 12074#(and (or (<= foo_~i~0 1) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 12075#(and (or (<= foo_~i~0 2) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 12076#(and (or (<= foo_~i~0 3) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 12077#(and (or (<= foo_~i~0 4) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 12078#(and (or (not (= foo_~size 32)) (<= foo_~i~0 5)) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 12079#(and (or (<= foo_~i~0 6) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 12080#(and (or (<= foo_~i~0 7) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 12081#(and (or (= |foo_#in~size| foo_~size) (= foo_~size 32)) (or (not (= foo_~size 32)) (<= foo_~i~0 8))), 12082#(and (or (<= foo_~i~0 9) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 12083#(and (or (<= foo_~i~0 10) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 12084#(and (or (<= foo_~i~0 11) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 12085#(and (or (<= foo_~i~0 12) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 12086#(and (or (not (= foo_~size 32)) (<= foo_~i~0 13)) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 12087#(and (or (<= foo_~i~0 14) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 12088#(and (or (<= foo_~i~0 15) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 12089#(not (= |foo_#in~size| 32))] [2018-02-02 10:12:10,244 INFO L134 CoverageAnalysis]: Checked inductivity of 181232 backedges. 62 proven. 21885 refuted. 0 times theorem prover too weak. 159285 trivial. 0 not checked. [2018-02-02 10:12:10,244 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-02 10:12:10,244 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-02 10:12:10,244 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=187, Unknown=0, NotChecked=0, Total=342 [2018-02-02 10:12:10,244 INFO L87 Difference]: Start difference. First operand 293 states and 326 transitions. Second operand 19 states. [2018-02-02 10:12:10,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:12:10,318 INFO L93 Difference]: Finished difference Result 306 states and 339 transitions. [2018-02-02 10:12:10,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-02 10:12:10,318 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 1651 [2018-02-02 10:12:10,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:12:10,319 INFO L225 Difference]: With dead ends: 306 [2018-02-02 10:12:10,319 INFO L226 Difference]: Without dead ends: 303 [2018-02-02 10:12:10,319 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=173, Invalid=207, Unknown=0, NotChecked=0, Total=380 [2018-02-02 10:12:10,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2018-02-02 10:12:10,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 299. [2018-02-02 10:12:10,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 299 states. [2018-02-02 10:12:10,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 332 transitions. [2018-02-02 10:12:10,324 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 332 transitions. Word has length 1651 [2018-02-02 10:12:10,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:12:10,325 INFO L432 AbstractCegarLoop]: Abstraction has 299 states and 332 transitions. [2018-02-02 10:12:10,325 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-02 10:12:10,325 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 332 transitions. [2018-02-02 10:12:10,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1748 [2018-02-02 10:12:10,340 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:12:10,340 INFO L351 BasicCegarLoop]: trace histogram [272, 256, 256, 256, 256, 256, 17, 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] [2018-02-02 10:12:10,340 INFO L371 AbstractCegarLoop]: === Iteration 38 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:12:10,340 INFO L82 PathProgramCache]: Analyzing trace with hash 104699365, now seen corresponding path program 31 times [2018-02-02 10:12:10,341 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:12:10,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:12:10,405 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:12:13,100 INFO L134 CoverageAnalysis]: Checked inductivity of 205504 backedges. 0 proven. 752 refuted. 0 times theorem prover too weak. 204752 trivial. 0 not checked. [2018-02-02 10:12:13,100 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:12:13,100 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-02-02 10:12:13,100 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:12:13,101 INFO L134 CoverageAnalysis]: Checked inductivity of 12240 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12240 trivial. 0 not checked. [2018-02-02 10:12:13,101 INFO L182 omatonBuilderFactory]: Interpolants [12704#(<= main_~i~1 5), 12705#(<= main_~i~1 6), 12706#(<= main_~i~1 7), 12707#(<= main_~i~1 8), 12708#(<= main_~i~1 9), 12709#(<= main_~i~1 10), 12710#(<= main_~i~1 11), 12711#(<= main_~i~1 12), 12712#(<= main_~i~1 13), 12713#(<= main_~i~1 14), 12714#(<= main_~i~1 15), 12715#(<= main_~i~1 16), 12697#true, 12698#false, 12699#(= main_~i~1 0), 12700#(<= main_~i~1 1), 12701#(<= main_~i~1 2), 12702#(<= main_~i~1 3), 12703#(<= main_~i~1 4)] [2018-02-02 10:12:13,103 INFO L134 CoverageAnalysis]: Checked inductivity of 205504 backedges. 0 proven. 752 refuted. 0 times theorem prover too weak. 204752 trivial. 0 not checked. [2018-02-02 10:12:13,103 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-02 10:12:13,103 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-02 10:12:13,103 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-02-02 10:12:13,103 INFO L87 Difference]: Start difference. First operand 299 states and 332 transitions. Second operand 19 states. [2018-02-02 10:12:13,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:12:13,242 INFO L93 Difference]: Finished difference Result 402 states and 422 transitions. [2018-02-02 10:12:13,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-02 10:12:13,242 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 1747 [2018-02-02 10:12:13,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:12:13,243 INFO L225 Difference]: With dead ends: 402 [2018-02-02 10:12:13,243 INFO L226 Difference]: Without dead ends: 402 [2018-02-02 10:12:13,244 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-02-02 10:12:13,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2018-02-02 10:12:13,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 310. [2018-02-02 10:12:13,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 310 states. [2018-02-02 10:12:13,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 345 transitions. [2018-02-02 10:12:13,247 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 345 transitions. Word has length 1747 [2018-02-02 10:12:13,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:12:13,247 INFO L432 AbstractCegarLoop]: Abstraction has 310 states and 345 transitions. [2018-02-02 10:12:13,247 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-02 10:12:13,247 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 345 transitions. [2018-02-02 10:12:13,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1856 [2018-02-02 10:12:13,260 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:12:13,261 INFO L351 BasicCegarLoop]: trace histogram [289, 272, 272, 272, 272, 272, 18, 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] [2018-02-02 10:12:13,261 INFO L371 AbstractCegarLoop]: === Iteration 39 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:12:13,261 INFO L82 PathProgramCache]: Analyzing trace with hash -553996762, now seen corresponding path program 32 times [2018-02-02 10:12:13,261 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:12:13,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:12:13,329 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:12:17,209 INFO L134 CoverageAnalysis]: Checked inductivity of 232050 backedges. 66 proven. 26432 refuted. 0 times theorem prover too weak. 205552 trivial. 0 not checked. [2018-02-02 10:12:17,209 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:12:17,209 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-02-02 10:12:17,209 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:12:17,210 INFO L134 CoverageAnalysis]: Checked inductivity of 13872 backedges. 0 proven. 1616 refuted. 0 times theorem prover too weak. 12256 trivial. 0 not checked. [2018-02-02 10:12:17,210 INFO L182 omatonBuilderFactory]: Interpolants [13440#(and (or (<= foo_~i~0 10) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 13441#(and (or (<= foo_~i~0 11) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 13442#(and (or (<= foo_~i~0 12) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 13443#(and (or (not (= foo_~size 32)) (<= foo_~i~0 13)) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 13444#(and (or (<= foo_~i~0 14) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 13445#(and (or (<= foo_~i~0 15) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 13446#(and (or (not (= foo_~size 32)) (<= foo_~i~0 16)) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 13447#(not (= |foo_#in~size| 32)), 13428#true, 13429#false, 13430#(and (= foo_~i~0 0) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 13431#(and (or (<= foo_~i~0 1) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 13432#(and (or (<= foo_~i~0 2) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 13433#(and (or (<= foo_~i~0 3) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 13434#(and (or (<= foo_~i~0 4) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 13435#(and (or (not (= foo_~size 32)) (<= foo_~i~0 5)) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 13436#(and (or (<= foo_~i~0 6) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 13437#(and (or (<= foo_~i~0 7) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 13438#(and (or (= |foo_#in~size| foo_~size) (= foo_~size 32)) (or (not (= foo_~size 32)) (<= foo_~i~0 8))), 13439#(and (or (<= foo_~i~0 9) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32)))] [2018-02-02 10:12:17,212 INFO L134 CoverageAnalysis]: Checked inductivity of 232050 backedges. 66 proven. 26432 refuted. 0 times theorem prover too weak. 205552 trivial. 0 not checked. [2018-02-02 10:12:17,213 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-02 10:12:17,213 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-02 10:12:17,213 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=207, Unknown=0, NotChecked=0, Total=380 [2018-02-02 10:12:17,213 INFO L87 Difference]: Start difference. First operand 310 states and 345 transitions. Second operand 20 states. [2018-02-02 10:12:17,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:12:17,281 INFO L93 Difference]: Finished difference Result 323 states and 358 transitions. [2018-02-02 10:12:17,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-02-02 10:12:17,281 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 1855 [2018-02-02 10:12:17,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:12:17,282 INFO L225 Difference]: With dead ends: 323 [2018-02-02 10:12:17,282 INFO L226 Difference]: Without dead ends: 320 [2018-02-02 10:12:17,282 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=192, Invalid=228, Unknown=0, NotChecked=0, Total=420 [2018-02-02 10:12:17,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2018-02-02 10:12:17,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 316. [2018-02-02 10:12:17,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 316 states. [2018-02-02 10:12:17,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 351 transitions. [2018-02-02 10:12:17,285 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 351 transitions. Word has length 1855 [2018-02-02 10:12:17,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:12:17,285 INFO L432 AbstractCegarLoop]: Abstraction has 316 states and 351 transitions. [2018-02-02 10:12:17,285 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-02 10:12:17,285 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 351 transitions. [2018-02-02 10:12:17,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1958 [2018-02-02 10:12:17,300 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:12:17,300 INFO L351 BasicCegarLoop]: trace histogram [306, 289, 289, 289, 289, 289, 18, 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] [2018-02-02 10:12:17,300 INFO L371 AbstractCegarLoop]: === Iteration 40 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:12:17,301 INFO L82 PathProgramCache]: Analyzing trace with hash 546860014, now seen corresponding path program 33 times [2018-02-02 10:12:17,301 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:12:17,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:12:17,377 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:12:20,935 INFO L134 CoverageAnalysis]: Checked inductivity of 261188 backedges. 0 proven. 850 refuted. 0 times theorem prover too weak. 260338 trivial. 0 not checked. [2018-02-02 10:12:20,935 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:12:20,935 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-02-02 10:12:20,935 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:12:20,936 INFO L134 CoverageAnalysis]: Checked inductivity of 14688 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14688 trivial. 0 not checked. [2018-02-02 10:12:20,936 INFO L182 omatonBuilderFactory]: Interpolants [14089#true, 14090#false, 14091#(= main_~i~1 0), 14092#(<= main_~i~1 1), 14093#(<= main_~i~1 2), 14094#(<= main_~i~1 3), 14095#(<= main_~i~1 4), 14096#(<= main_~i~1 5), 14097#(<= main_~i~1 6), 14098#(<= main_~i~1 7), 14099#(<= main_~i~1 8), 14100#(<= main_~i~1 9), 14101#(<= main_~i~1 10), 14102#(<= main_~i~1 11), 14103#(<= main_~i~1 12), 14104#(<= main_~i~1 13), 14105#(<= main_~i~1 14), 14106#(<= main_~i~1 15), 14107#(<= main_~i~1 16), 14108#(<= main_~i~1 17)] [2018-02-02 10:12:20,938 INFO L134 CoverageAnalysis]: Checked inductivity of 261188 backedges. 0 proven. 850 refuted. 0 times theorem prover too weak. 260338 trivial. 0 not checked. [2018-02-02 10:12:20,938 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-02 10:12:20,939 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-02 10:12:20,939 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-02-02 10:12:20,939 INFO L87 Difference]: Start difference. First operand 316 states and 351 transitions. Second operand 20 states. [2018-02-02 10:12:21,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:12:21,112 INFO L93 Difference]: Finished difference Result 424 states and 445 transitions. [2018-02-02 10:12:21,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-02-02 10:12:21,112 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 1957 [2018-02-02 10:12:21,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:12:21,114 INFO L225 Difference]: With dead ends: 424 [2018-02-02 10:12:21,115 INFO L226 Difference]: Without dead ends: 424 [2018-02-02 10:12:21,115 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-02-02 10:12:21,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 424 states. [2018-02-02 10:12:21,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 424 to 327. [2018-02-02 10:12:21,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 327 states. [2018-02-02 10:12:21,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 364 transitions. [2018-02-02 10:12:21,118 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 364 transitions. Word has length 1957 [2018-02-02 10:12:21,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:12:21,119 INFO L432 AbstractCegarLoop]: Abstraction has 327 states and 364 transitions. [2018-02-02 10:12:21,119 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-02 10:12:21,119 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 364 transitions. [2018-02-02 10:12:21,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2072 [2018-02-02 10:12:21,136 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:12:21,136 INFO L351 BasicCegarLoop]: trace histogram [324, 306, 306, 306, 306, 306, 19, 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] [2018-02-02 10:12:21,136 INFO L371 AbstractCegarLoop]: === Iteration 41 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:12:21,136 INFO L82 PathProgramCache]: Analyzing trace with hash -1829676233, now seen corresponding path program 34 times [2018-02-02 10:12:21,137 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:12:21,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:12:21,213 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:12:26,155 INFO L134 CoverageAnalysis]: Checked inductivity of 292878 backedges. 70 proven. 31569 refuted. 0 times theorem prover too weak. 261239 trivial. 0 not checked. [2018-02-02 10:12:26,155 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:12:26,155 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-02-02 10:12:26,155 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:12:26,156 INFO L134 CoverageAnalysis]: Checked inductivity of 16524 backedges. 0 proven. 1819 refuted. 0 times theorem prover too weak. 14705 trivial. 0 not checked. [2018-02-02 10:12:26,156 INFO L182 omatonBuilderFactory]: Interpolants [14880#(not (= |foo_#in~size| 32)), 14860#true, 14861#false, 14862#(and (= foo_~i~0 0) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 14863#(and (or (<= foo_~i~0 1) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 14864#(and (or (<= foo_~i~0 2) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 14865#(and (or (<= foo_~i~0 3) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 14866#(and (or (<= foo_~i~0 4) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 14867#(and (or (not (= foo_~size 32)) (<= foo_~i~0 5)) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 14868#(and (or (<= foo_~i~0 6) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 14869#(and (or (<= foo_~i~0 7) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 14870#(and (or (= |foo_#in~size| foo_~size) (= foo_~size 32)) (or (not (= foo_~size 32)) (<= foo_~i~0 8))), 14871#(and (or (<= foo_~i~0 9) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 14872#(and (or (<= foo_~i~0 10) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 14873#(and (or (<= foo_~i~0 11) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 14874#(and (or (<= foo_~i~0 12) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 14875#(and (or (not (= foo_~size 32)) (<= foo_~i~0 13)) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 14876#(and (or (<= foo_~i~0 14) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 14877#(and (or (<= foo_~i~0 15) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 14878#(and (or (not (= foo_~size 32)) (<= foo_~i~0 16)) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 14879#(and (or (<= foo_~i~0 17) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32)))] [2018-02-02 10:12:26,159 INFO L134 CoverageAnalysis]: Checked inductivity of 292878 backedges. 70 proven. 31569 refuted. 0 times theorem prover too weak. 261239 trivial. 0 not checked. [2018-02-02 10:12:26,159 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-02 10:12:26,160 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-02 10:12:26,160 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=228, Unknown=0, NotChecked=0, Total=420 [2018-02-02 10:12:26,160 INFO L87 Difference]: Start difference. First operand 327 states and 364 transitions. Second operand 21 states. [2018-02-02 10:12:26,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:12:26,250 INFO L93 Difference]: Finished difference Result 340 states and 377 transitions. [2018-02-02 10:12:26,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-02 10:12:26,250 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 2071 [2018-02-02 10:12:26,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:12:26,251 INFO L225 Difference]: With dead ends: 340 [2018-02-02 10:12:26,251 INFO L226 Difference]: Without dead ends: 337 [2018-02-02 10:12:26,251 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=212, Invalid=250, Unknown=0, NotChecked=0, Total=462 [2018-02-02 10:12:26,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2018-02-02 10:12:26,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 333. [2018-02-02 10:12:26,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 333 states. [2018-02-02 10:12:26,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 370 transitions. [2018-02-02 10:12:26,256 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 370 transitions. Word has length 2071 [2018-02-02 10:12:26,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:12:26,256 INFO L432 AbstractCegarLoop]: Abstraction has 333 states and 370 transitions. [2018-02-02 10:12:26,257 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-02 10:12:26,257 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 370 transitions. [2018-02-02 10:12:26,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2180 [2018-02-02 10:12:26,277 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:12:26,277 INFO L351 BasicCegarLoop]: trace histogram [342, 324, 324, 324, 324, 324, 19, 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] [2018-02-02 10:12:26,277 INFO L371 AbstractCegarLoop]: === Iteration 42 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:12:26,278 INFO L82 PathProgramCache]: Analyzing trace with hash 771837319, now seen corresponding path program 35 times [2018-02-02 10:12:26,278 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:12:26,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:12:26,362 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:12:30,815 INFO L134 CoverageAnalysis]: Checked inductivity of 327492 backedges. 0 proven. 954 refuted. 0 times theorem prover too weak. 326538 trivial. 0 not checked. [2018-02-02 10:12:30,816 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:12:30,816 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-02-02 10:12:30,816 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:12:30,816 INFO L134 CoverageAnalysis]: Checked inductivity of 17442 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17442 trivial. 0 not checked. [2018-02-02 10:12:30,817 INFO L182 omatonBuilderFactory]: Interpolants [15556#true, 15557#false, 15558#(= main_~i~1 0), 15559#(<= main_~i~1 1), 15560#(<= main_~i~1 2), 15561#(<= main_~i~1 3), 15562#(<= main_~i~1 4), 15563#(<= main_~i~1 5), 15564#(<= main_~i~1 6), 15565#(<= main_~i~1 7), 15566#(<= main_~i~1 8), 15567#(<= main_~i~1 9), 15568#(<= main_~i~1 10), 15569#(<= main_~i~1 11), 15570#(<= main_~i~1 12), 15571#(<= main_~i~1 13), 15572#(<= main_~i~1 14), 15573#(<= main_~i~1 15), 15574#(<= main_~i~1 16), 15575#(<= main_~i~1 17), 15576#(<= main_~i~1 18)] [2018-02-02 10:12:30,820 INFO L134 CoverageAnalysis]: Checked inductivity of 327492 backedges. 0 proven. 954 refuted. 0 times theorem prover too weak. 326538 trivial. 0 not checked. [2018-02-02 10:12:30,820 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-02 10:12:30,820 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-02 10:12:30,820 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-02-02 10:12:30,820 INFO L87 Difference]: Start difference. First operand 333 states and 370 transitions. Second operand 21 states. [2018-02-02 10:12:31,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:12:31,012 INFO L93 Difference]: Finished difference Result 446 states and 468 transitions. [2018-02-02 10:12:31,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-02 10:12:31,012 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 2179 [2018-02-02 10:12:31,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:12:31,014 INFO L225 Difference]: With dead ends: 446 [2018-02-02 10:12:31,014 INFO L226 Difference]: Without dead ends: 446 [2018-02-02 10:12:31,014 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-02-02 10:12:31,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 446 states. [2018-02-02 10:12:31,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 446 to 344. [2018-02-02 10:12:31,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 344 states. [2018-02-02 10:12:31,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 383 transitions. [2018-02-02 10:12:31,018 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 383 transitions. Word has length 2179 [2018-02-02 10:12:31,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:12:31,018 INFO L432 AbstractCegarLoop]: Abstraction has 344 states and 383 transitions. [2018-02-02 10:12:31,019 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-02 10:12:31,019 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 383 transitions. [2018-02-02 10:12:31,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2300 [2018-02-02 10:12:31,038 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:12:31,038 INFO L351 BasicCegarLoop]: trace histogram [361, 342, 342, 342, 342, 342, 20, 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] [2018-02-02 10:12:31,038 INFO L371 AbstractCegarLoop]: === Iteration 43 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:12:31,039 INFO L82 PathProgramCache]: Analyzing trace with hash 1752930392, now seen corresponding path program 36 times [2018-02-02 10:12:31,039 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:12:31,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:12:31,117 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:12:37,192 INFO L134 CoverageAnalysis]: Checked inductivity of 364952 backedges. 74 proven. 37332 refuted. 0 times theorem prover too weak. 327546 trivial. 0 not checked. [2018-02-02 10:12:37,192 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:12:37,192 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-02-02 10:12:37,192 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:12:37,193 INFO L134 CoverageAnalysis]: Checked inductivity of 19494 backedges. 0 proven. 2034 refuted. 0 times theorem prover too weak. 17460 trivial. 0 not checked. [2018-02-02 10:12:37,193 INFO L182 omatonBuilderFactory]: Interpolants [16384#(and (or (<= foo_~i~0 15) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 16385#(and (or (not (= foo_~size 32)) (<= foo_~i~0 16)) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 16386#(and (or (<= foo_~i~0 17) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 16387#(and (or (<= foo_~i~0 18) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 16388#(not (= |foo_#in~size| 32)), 16367#true, 16368#false, 16369#(and (= foo_~i~0 0) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 16370#(and (or (<= foo_~i~0 1) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 16371#(and (or (<= foo_~i~0 2) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 16372#(and (or (<= foo_~i~0 3) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 16373#(and (or (<= foo_~i~0 4) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 16374#(and (or (not (= foo_~size 32)) (<= foo_~i~0 5)) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 16375#(and (or (<= foo_~i~0 6) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 16376#(and (or (<= foo_~i~0 7) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 16377#(and (or (= |foo_#in~size| foo_~size) (= foo_~size 32)) (or (not (= foo_~size 32)) (<= foo_~i~0 8))), 16378#(and (or (<= foo_~i~0 9) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 16379#(and (or (<= foo_~i~0 10) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 16380#(and (or (<= foo_~i~0 11) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 16381#(and (or (<= foo_~i~0 12) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 16382#(and (or (not (= foo_~size 32)) (<= foo_~i~0 13)) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 16383#(and (or (<= foo_~i~0 14) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32)))] [2018-02-02 10:12:37,198 INFO L134 CoverageAnalysis]: Checked inductivity of 364952 backedges. 74 proven. 37332 refuted. 0 times theorem prover too weak. 327546 trivial. 0 not checked. [2018-02-02 10:12:37,198 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-02 10:12:37,198 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-02 10:12:37,199 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=212, Invalid=250, Unknown=0, NotChecked=0, Total=462 [2018-02-02 10:12:37,199 INFO L87 Difference]: Start difference. First operand 344 states and 383 transitions. Second operand 22 states. [2018-02-02 10:12:37,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:12:37,288 INFO L93 Difference]: Finished difference Result 357 states and 396 transitions. [2018-02-02 10:12:37,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-02 10:12:37,289 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 2299 [2018-02-02 10:12:37,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:12:37,289 INFO L225 Difference]: With dead ends: 357 [2018-02-02 10:12:37,289 INFO L226 Difference]: Without dead ends: 354 [2018-02-02 10:12:37,290 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=233, Invalid=273, Unknown=0, NotChecked=0, Total=506 [2018-02-02 10:12:37,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2018-02-02 10:12:37,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 350. [2018-02-02 10:12:37,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 350 states. [2018-02-02 10:12:37,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 389 transitions. [2018-02-02 10:12:37,293 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 389 transitions. Word has length 2299 [2018-02-02 10:12:37,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:12:37,293 INFO L432 AbstractCegarLoop]: Abstraction has 350 states and 389 transitions. [2018-02-02 10:12:37,293 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-02 10:12:37,293 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 389 transitions. [2018-02-02 10:12:37,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2414 [2018-02-02 10:12:37,314 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:12:37,315 INFO L351 BasicCegarLoop]: trace histogram [380, 361, 361, 361, 361, 361, 20, 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] [2018-02-02 10:12:37,315 INFO L371 AbstractCegarLoop]: === Iteration 44 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:12:37,315 INFO L82 PathProgramCache]: Analyzing trace with hash 760102000, now seen corresponding path program 37 times [2018-02-02 10:12:37,315 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:12:37,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:12:37,415 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-02 10:12:37,796 FATAL L265 ToolchainWalker]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Timeout exceeded at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.walkResolutionNode(Interpolator.java:235) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.access$0(Interpolator.java:233) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator$ProofTreeWalker.walk(Interpolator.java:130) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:122) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:113) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.interpolate(Interpolator.java:220) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.getInterpolants(Interpolator.java:201) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.getInterpolants(SMTInterpol.java:915) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.managedscript.ManagedScript.getInterpolants(ManagedScript.java:192) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.computeCraigInterpolants(NestedInterpolantsBuilder.java:281) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.(NestedInterpolantsBuilder.java:164) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsTree(InterpolatingTraceCheckCraig.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolants(InterpolatingTraceCheckCraig.java:199) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:106) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructCraig(TraceCheckConstructor.java:222) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.FixedTraceAbstractionRefinementStrategy.getTraceCheck(FixedTraceAbstractionRefinementStrategy.java:131) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:231) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:205) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:397) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:381) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:316) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:292) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:147) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:115) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:119) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:324) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.runToolchainDefault(DefaultToolchainJob.java:221) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.BasicToolchainJob.run(BasicToolchainJob.java:134) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-02-02 10:12:37,800 INFO L168 Benchmark]: Toolchain (without parser) took 56249.35 ms. Allocated memory was 396.9 MB in the beginning and 2.4 GB in the end (delta: 2.0 GB). Free memory was 355.0 MB in the beginning and 1.5 GB in the end (delta: -1.1 GB). Peak memory consumption was 2.0 GB. Max. memory is 5.3 GB. [2018-02-02 10:12:37,801 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 396.9 MB. Free memory is still 360.4 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-02 10:12:37,801 INFO L168 Benchmark]: CACSL2BoogieTranslator took 152.54 ms. Allocated memory is still 396.9 MB. Free memory was 355.0 MB in the beginning and 347.1 MB in the end (delta: 7.9 MB). Peak memory consumption was 7.9 MB. Max. memory is 5.3 GB. [2018-02-02 10:12:37,801 INFO L168 Benchmark]: Boogie Preprocessor took 24.40 ms. Allocated memory is still 396.9 MB. Free memory was 347.1 MB in the beginning and 344.4 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. [2018-02-02 10:12:37,801 INFO L168 Benchmark]: RCFGBuilder took 178.41 ms. Allocated memory is still 396.9 MB. Free memory was 344.4 MB in the beginning and 328.8 MB in the end (delta: 15.6 MB). Peak memory consumption was 15.6 MB. Max. memory is 5.3 GB. [2018-02-02 10:12:37,802 INFO L168 Benchmark]: TraceAbstraction took 55890.01 ms. Allocated memory was 396.9 MB in the beginning and 2.4 GB in the end (delta: 2.0 GB). Free memory was 327.5 MB in the beginning and 1.5 GB in the end (delta: -1.1 GB). Peak memory consumption was 2.0 GB. Max. memory is 5.3 GB. [2018-02-02 10:12:37,803 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.18 ms. Allocated memory is still 396.9 MB. Free memory is still 360.4 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 152.54 ms. Allocated memory is still 396.9 MB. Free memory was 355.0 MB in the beginning and 347.1 MB in the end (delta: 7.9 MB). Peak memory consumption was 7.9 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 24.40 ms. Allocated memory is still 396.9 MB. Free memory was 347.1 MB in the beginning and 344.4 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 178.41 ms. Allocated memory is still 396.9 MB. Free memory was 344.4 MB in the beginning and 328.8 MB in the end (delta: 15.6 MB). Peak memory consumption was 15.6 MB. Max. memory is 5.3 GB. * TraceAbstraction took 55890.01 ms. Allocated memory was 396.9 MB in the beginning and 2.4 GB in the end (delta: 2.0 GB). Free memory was 327.5 MB in the beginning and 1.5 GB in the end (delta: -1.1 GB). Peak memory consumption was 2.0 GB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: Timeout exceeded de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: Timeout exceeded: de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.walkResolutionNode(Interpolator.java:235) RESULT: Ultimate could not prove your program: Toolchain returned no result. Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ArraysOfVariableLength4_true-valid-memsafety_true-termination.c_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-02_10-12-37-810.csv Completed graceful shutdown