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/memleaks_test17_3_false-valid-memtrack.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-26d9e06-m [2018-02-02 10:19:11,361 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-02 10:19:11,362 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-02 10:19:11,374 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-02 10:19:11,374 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-02 10:19:11,375 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-02 10:19:11,376 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-02 10:19:11,377 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-02 10:19:11,379 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-02 10:19:11,379 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-02 10:19:11,380 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-02 10:19:11,380 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-02 10:19:11,381 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-02 10:19:11,382 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-02 10:19:11,383 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-02 10:19:11,385 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-02 10:19:11,386 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-02 10:19:11,388 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-02 10:19:11,389 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-02 10:19:11,390 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-02 10:19:11,392 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-02 10:19:11,392 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-02 10:19:11,392 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-02 10:19:11,393 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-02 10:19:11,394 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-02 10:19:11,395 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-02 10:19:11,395 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-02 10:19:11,396 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-02 10:19:11,396 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-02 10:19:11,396 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-02 10:19:11,397 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-02 10:19:11,397 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:19:11,407 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-02 10:19:11,407 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-02 10:19:11,408 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-02 10:19:11,408 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-02 10:19:11,408 INFO L133 SettingsManager]: * Use SBE=true [2018-02-02 10:19:11,409 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-02 10:19:11,409 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-02 10:19:11,409 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-02 10:19:11,409 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-02 10:19:11,409 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-02 10:19:11,409 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-02 10:19:11,409 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-02 10:19:11,409 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-02 10:19:11,410 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-02 10:19:11,410 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-02 10:19:11,410 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-02 10:19:11,410 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-02 10:19:11,410 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-02 10:19:11,410 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-02 10:19:11,410 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-02 10:19:11,411 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 10:19:11,411 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-02 10:19:11,411 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-02-02 10:19:11,438 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-02 10:19:11,449 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-02 10:19:11,451 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-02 10:19:11,452 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-02 10:19:11,453 INFO L276 PluginConnector]: CDTParser initialized [2018-02-02 10:19:11,453 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test17_3_false-valid-memtrack.i [2018-02-02 10:19:11,601 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-02 10:19:11,602 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-02 10:19:11,603 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-02 10:19:11,603 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-02 10:19:11,609 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-02 10:19:11,610 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 10:19:11" (1/1) ... [2018-02-02 10:19:11,612 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c9178f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:19:11, skipping insertion in model container [2018-02-02 10:19:11,613 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 10:19:11" (1/1) ... [2018-02-02 10:19:11,628 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 10:19:11,665 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 10:19:11,753 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 10:19:11,764 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 10:19:11,770 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:19:11 WrapperNode [2018-02-02 10:19:11,770 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-02 10:19:11,770 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-02 10:19:11,770 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-02 10:19:11,770 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-02 10:19:11,780 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:19:11" (1/1) ... [2018-02-02 10:19:11,781 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:19:11" (1/1) ... [2018-02-02 10:19:11,788 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:19:11" (1/1) ... [2018-02-02 10:19:11,788 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:19:11" (1/1) ... [2018-02-02 10:19:11,790 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:19:11" (1/1) ... [2018-02-02 10:19:11,793 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:19:11" (1/1) ... [2018-02-02 10:19:11,793 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:19:11" (1/1) ... [2018-02-02 10:19:11,794 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-02 10:19:11,795 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-02 10:19:11,795 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-02 10:19:11,795 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-02 10:19:11,796 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:19:11" (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:19:11,831 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-02 10:19:11,831 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-02 10:19:11,831 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-02-02 10:19:11,832 INFO L136 BoogieDeclarations]: Found implementation of procedure alloc_17 [2018-02-02 10:19:11,832 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-02-02 10:19:11,832 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-02 10:19:11,832 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-02 10:19:11,832 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-02 10:19:11,832 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-02 10:19:11,832 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-02 10:19:11,832 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-02 10:19:11,832 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-02 10:19:11,832 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-02 10:19:11,832 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-02 10:19:11,832 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-02-02 10:19:11,833 INFO L128 BoogieDeclarations]: Found specification of procedure alloc_17 [2018-02-02 10:19:11,833 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-02-02 10:19:11,833 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-02 10:19:11,833 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-02 10:19:11,833 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-02 10:19:12,045 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-02 10:19:12,045 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 10:19:12 BoogieIcfgContainer [2018-02-02 10:19:12,046 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-02 10:19:12,047 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-02 10:19:12,047 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-02 10:19:12,049 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-02 10:19:12,050 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.02 10:19:11" (1/3) ... [2018-02-02 10:19:12,050 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b07aa9b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 10:19:12, skipping insertion in model container [2018-02-02 10:19:12,051 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:19:11" (2/3) ... [2018-02-02 10:19:12,051 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b07aa9b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 10:19:12, skipping insertion in model container [2018-02-02 10:19:12,051 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 10:19:12" (3/3) ... [2018-02-02 10:19:12,053 INFO L107 eAbstractionObserver]: Analyzing ICFG memleaks_test17_3_false-valid-memtrack.i [2018-02-02 10:19:12,058 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-02-02 10:19:12,063 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 13 error locations. [2018-02-02 10:19:12,097 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-02 10:19:12,097 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-02 10:19:12,097 INFO L324 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-02-02 10:19:12,097 INFO L325 AbstractCegarLoop]: Backedges is CANONICAL [2018-02-02 10:19:12,097 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-02 10:19:12,097 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-02 10:19:12,098 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-02 10:19:12,098 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-02 10:19:12,098 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-02 10:19:12,109 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states. [2018-02-02 10:19:12,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-02 10:19:12,115 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:19:12,116 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:19:12,116 INFO L371 AbstractCegarLoop]: === Iteration 1 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 10:19:12,120 INFO L82 PathProgramCache]: Analyzing trace with hash 1525029176, now seen corresponding path program 1 times [2018-02-02 10:19:12,162 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:19:12,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:19:12,199 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:19:12,260 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:19:12,262 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:19:12,262 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-02 10:19:12,263 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:19:12,264 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:19:12,264 INFO L182 omatonBuilderFactory]: Interpolants [65#true, 66#false, 67#(= |#valid| |old(#valid)|)] [2018-02-02 10:19:12,264 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:19:12,265 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-02 10:19:12,275 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-02 10:19:12,276 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 10:19:12,277 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 3 states. [2018-02-02 10:19:12,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:19:12,447 INFO L93 Difference]: Finished difference Result 102 states and 118 transitions. [2018-02-02 10:19:12,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-02 10:19:12,448 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-02-02 10:19:12,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:19:12,457 INFO L225 Difference]: With dead ends: 102 [2018-02-02 10:19:12,458 INFO L226 Difference]: Without dead ends: 96 [2018-02-02 10:19:12,459 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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:19:12,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-02-02 10:19:12,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 63. [2018-02-02 10:19:12,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-02-02 10:19:12,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 70 transitions. [2018-02-02 10:19:12,492 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 70 transitions. Word has length 17 [2018-02-02 10:19:12,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:19:12,492 INFO L432 AbstractCegarLoop]: Abstraction has 63 states and 70 transitions. [2018-02-02 10:19:12,492 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-02 10:19:12,492 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 70 transitions. [2018-02-02 10:19:12,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-02 10:19:12,494 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:19:12,494 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:19:12,494 INFO L371 AbstractCegarLoop]: === Iteration 2 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 10:19:12,494 INFO L82 PathProgramCache]: Analyzing trace with hash 1524292544, now seen corresponding path program 1 times [2018-02-02 10:19:12,496 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:19:12,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:19:12,510 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:19:12,562 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:19:12,562 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:19:12,562 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 10:19:12,562 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:19:12,563 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:19:12,563 INFO L182 omatonBuilderFactory]: Interpolants [233#true, 234#false, 235#(and (= 0 |ldv_malloc_#res.offset|) (= 0 |ldv_malloc_#res.base|)), 236#(and (= 0 |entry_point_#t~ret8.offset|) (= 0 |entry_point_#t~ret8.base|)), 237#(and (= entry_point_~array~0.base 0) (= 0 entry_point_~array~0.offset))] [2018-02-02 10:19:12,563 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:19:12,564 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 10:19:12,564 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 10:19:12,565 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:19:12,565 INFO L87 Difference]: Start difference. First operand 63 states and 70 transitions. Second operand 5 states. [2018-02-02 10:19:12,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:19:12,597 INFO L93 Difference]: Finished difference Result 65 states and 71 transitions. [2018-02-02 10:19:12,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 10:19:12,598 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-02-02 10:19:12,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:19:12,599 INFO L225 Difference]: With dead ends: 65 [2018-02-02 10:19:12,599 INFO L226 Difference]: Without dead ends: 63 [2018-02-02 10:19:12,600 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:19:12,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-02-02 10:19:12,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 61. [2018-02-02 10:19:12,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-02-02 10:19:12,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 67 transitions. [2018-02-02 10:19:12,605 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 67 transitions. Word has length 17 [2018-02-02 10:19:12,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:19:12,605 INFO L432 AbstractCegarLoop]: Abstraction has 61 states and 67 transitions. [2018-02-02 10:19:12,606 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 10:19:12,606 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 67 transitions. [2018-02-02 10:19:12,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-02 10:19:12,606 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:19:12,606 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:19:12,607 INFO L371 AbstractCegarLoop]: === Iteration 3 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 10:19:12,607 INFO L82 PathProgramCache]: Analyzing trace with hash -1268239334, now seen corresponding path program 1 times [2018-02-02 10:19:12,608 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:19:12,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:19:12,621 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:19:12,657 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:19:12,657 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:19:12,657 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 10:19:12,657 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:19:12,658 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:19:12,658 INFO L182 omatonBuilderFactory]: Interpolants [368#(not (= 0 |entry_point_#t~ret8.base|)), 369#(not (= 0 entry_point_~array~0.base)), 364#true, 365#false, 366#(not (= 0 |ldv_malloc_#t~malloc1.base|)), 367#(not (= 0 |ldv_malloc_#res.base|))] [2018-02-02 10:19:12,658 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:19:12,658 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 10:19:12,658 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 10:19:12,658 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:19:12,658 INFO L87 Difference]: Start difference. First operand 61 states and 67 transitions. Second operand 6 states. [2018-02-02 10:19:12,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:19:12,681 INFO L93 Difference]: Finished difference Result 61 states and 66 transitions. [2018-02-02 10:19:12,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 10:19:12,681 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-02-02 10:19:12,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:19:12,682 INFO L225 Difference]: With dead ends: 61 [2018-02-02 10:19:12,682 INFO L226 Difference]: Without dead ends: 61 [2018-02-02 10:19:12,682 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-02-02 10:19:12,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-02-02 10:19:12,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2018-02-02 10:19:12,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-02-02 10:19:12,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 66 transitions. [2018-02-02 10:19:12,685 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 66 transitions. Word has length 19 [2018-02-02 10:19:12,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:19:12,685 INFO L432 AbstractCegarLoop]: Abstraction has 61 states and 66 transitions. [2018-02-02 10:19:12,685 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 10:19:12,685 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 66 transitions. [2018-02-02 10:19:12,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-02 10:19:12,686 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:19:12,686 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:19:12,686 INFO L371 AbstractCegarLoop]: === Iteration 4 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 10:19:12,686 INFO L82 PathProgramCache]: Analyzing trace with hash -1268975966, now seen corresponding path program 1 times [2018-02-02 10:19:12,687 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:19:12,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:19:12,698 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:19:12,739 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:19:12,739 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:19:12,740 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 10:19:12,740 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:19:12,740 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:19:12,740 INFO L182 omatonBuilderFactory]: Interpolants [496#(= 1 (select |#valid| |ldv_malloc_#t~malloc1.base|)), 497#(= 1 (select |#valid| |ldv_malloc_#res.base|)), 498#(= 1 (select |#valid| |entry_point_#t~ret8.base|)), 499#(= 1 (select |#valid| entry_point_~array~0.base)), 494#true, 495#false] [2018-02-02 10:19:12,740 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:19:12,741 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 10:19:12,741 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 10:19:12,741 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:19:12,741 INFO L87 Difference]: Start difference. First operand 61 states and 66 transitions. Second operand 6 states. [2018-02-02 10:19:12,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:19:12,801 INFO L93 Difference]: Finished difference Result 60 states and 65 transitions. [2018-02-02 10:19:12,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 10:19:12,801 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-02-02 10:19:12,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:19:12,802 INFO L225 Difference]: With dead ends: 60 [2018-02-02 10:19:12,802 INFO L226 Difference]: Without dead ends: 60 [2018-02-02 10:19:12,802 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-02-02 10:19:12,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-02-02 10:19:12,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2018-02-02 10:19:12,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-02-02 10:19:12,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 65 transitions. [2018-02-02 10:19:12,805 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 65 transitions. Word has length 19 [2018-02-02 10:19:12,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:19:12,805 INFO L432 AbstractCegarLoop]: Abstraction has 60 states and 65 transitions. [2018-02-02 10:19:12,805 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 10:19:12,806 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 65 transitions. [2018-02-02 10:19:12,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-02 10:19:12,806 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:19:12,806 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:19:12,806 INFO L371 AbstractCegarLoop]: === Iteration 5 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 10:19:12,806 INFO L82 PathProgramCache]: Analyzing trace with hash -1268975965, now seen corresponding path program 1 times [2018-02-02 10:19:12,807 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:19:12,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:19:12,816 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:19:12,998 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:19:12,998 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:19:12,998 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-02 10:19:12,998 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:19:12,998 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:19:12,999 INFO L182 omatonBuilderFactory]: Interpolants [624#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10)), 625#(and (or (< 0 (div ldv_malloc_~size 4294967296)) (and (or (<= ldv_malloc_~size |ldv_malloc_#in~size|) (<= (+ (div ldv_malloc_~size 4294967296) 1) 0)) (<= |ldv_malloc_#in~size| ldv_malloc_~size))) (or (<= ldv_malloc_~size |ldv_malloc_#in~size|) (<= (div ldv_malloc_~size 4294967296) 0))), 626#(and (or (<= (+ |ldv_malloc_#in~size| 1) 0) (<= |ldv_malloc_#in~size| (select |#length| |ldv_malloc_#t~malloc1.base|)) (<= 2147483648 |ldv_malloc_#in~size|)) (= 0 |ldv_malloc_#t~malloc1.offset|)), 627#(and (= 0 |ldv_malloc_#res.offset|) (or (<= (+ |ldv_malloc_#in~size| 1) 0) (<= |ldv_malloc_#in~size| (select |#length| |ldv_malloc_#res.base|)) (<= 2147483648 |ldv_malloc_#in~size|))), 628#(and (= 0 |entry_point_#t~ret8.offset|) (<= 40 (select |#length| |entry_point_#t~ret8.base|))), 629#(and (<= 40 (select |#length| entry_point_~array~0.base)) (= entry_point_~array~0.offset 0)), 630#(and (<= 40 (select |#length| entry_point_~array~0.base)) (= entry_point_~array~0.offset 0) (= entry_point_~i~1 0)), 622#true, 623#false] [2018-02-02 10:19:12,999 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:19:12,999 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 10:19:12,999 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 10:19:12,999 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-02-02 10:19:12,999 INFO L87 Difference]: Start difference. First operand 60 states and 65 transitions. Second operand 9 states. [2018-02-02 10:19:13,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:19:13,182 INFO L93 Difference]: Finished difference Result 64 states and 69 transitions. [2018-02-02 10:19:13,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 10:19:13,183 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 19 [2018-02-02 10:19:13,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:19:13,184 INFO L225 Difference]: With dead ends: 64 [2018-02-02 10:19:13,184 INFO L226 Difference]: Without dead ends: 64 [2018-02-02 10:19:13,184 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2018-02-02 10:19:13,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-02-02 10:19:13,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 63. [2018-02-02 10:19:13,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-02-02 10:19:13,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 68 transitions. [2018-02-02 10:19:13,188 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 68 transitions. Word has length 19 [2018-02-02 10:19:13,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:19:13,189 INFO L432 AbstractCegarLoop]: Abstraction has 63 states and 68 transitions. [2018-02-02 10:19:13,189 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 10:19:13,189 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 68 transitions. [2018-02-02 10:19:13,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-02 10:19:13,189 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:19:13,189 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:19:13,189 INFO L371 AbstractCegarLoop]: === Iteration 6 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 10:19:13,190 INFO L82 PathProgramCache]: Analyzing trace with hash -1174934022, now seen corresponding path program 1 times [2018-02-02 10:19:13,190 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:19:13,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:19:13,203 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:19:13,413 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:19:13,414 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:19:13,414 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-02-02 10:19:13,414 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:19:13,414 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:19:13,415 INFO L182 omatonBuilderFactory]: Interpolants [768#true, 769#false, 770#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10)), 771#(and (or (< 0 (div ldv_malloc_~size 4294967296)) (<= |ldv_malloc_#in~size| ldv_malloc_~size)) (or (<= ldv_malloc_~size |ldv_malloc_#in~size|) (<= (div ldv_malloc_~size 4294967296) 0))), 772#(or (and (<= |ldv_malloc_#in~size| (select |#length| |ldv_malloc_#t~malloc1.base|)) (= 0 |ldv_malloc_#t~malloc1.offset|)) (<= 4294967296 |ldv_malloc_#in~size|) (<= (+ (select |#length| |ldv_malloc_#t~malloc1.base|) 1) 0)), 773#(or (<= (+ (select |#length| |ldv_malloc_#res.base|) 1) 0) (<= 4294967296 |ldv_malloc_#in~size|) (and (= 0 |ldv_malloc_#res.offset|) (<= |ldv_malloc_#in~size| (select |#length| |ldv_malloc_#res.base|)))), 774#(or (<= (+ (select |#length| |entry_point_#t~ret8.base|) 1) 0) (and (= 0 |entry_point_#t~ret8.offset|) (<= 40 (select |#length| |entry_point_#t~ret8.base|)))), 775#(or (<= (+ (select |#length| entry_point_~array~0.base) 1) 0) (and (<= 40 (select |#length| entry_point_~array~0.base)) (= entry_point_~array~0.offset 0))), 776#(and (or (<= (+ (select |#length| entry_point_~array~0.base) 1) 0) (and (<= 40 (select |#length| entry_point_~array~0.base)) (= entry_point_~array~0.offset 0))) (= entry_point_~i~1 0)), 777#(and (<= 40 (select |#length| entry_point_~array~0.base)) (= entry_point_~array~0.offset 0) (= entry_point_~i~1 0)), 778#(and (<= 4 (+ (* 4 entry_point_~i~1) entry_point_~array~0.offset)) (= entry_point_~array~0.offset 0) (<= (+ (* 4 entry_point_~i~1) 36) (select |#length| entry_point_~array~0.base)))] [2018-02-02 10:19:13,415 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:19:13,415 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-02 10:19:13,415 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-02 10:19:13,415 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-02-02 10:19:13,415 INFO L87 Difference]: Start difference. First operand 63 states and 68 transitions. Second operand 11 states. [2018-02-02 10:19:13,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:19:13,668 INFO L93 Difference]: Finished difference Result 69 states and 76 transitions. [2018-02-02 10:19:13,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-02 10:19:13,668 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 23 [2018-02-02 10:19:13,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:19:13,669 INFO L225 Difference]: With dead ends: 69 [2018-02-02 10:19:13,669 INFO L226 Difference]: Without dead ends: 69 [2018-02-02 10:19:13,669 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=245, Unknown=0, NotChecked=0, Total=306 [2018-02-02 10:19:13,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-02-02 10:19:13,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 67. [2018-02-02 10:19:13,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-02-02 10:19:13,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 73 transitions. [2018-02-02 10:19:13,673 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 73 transitions. Word has length 23 [2018-02-02 10:19:13,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:19:13,673 INFO L432 AbstractCegarLoop]: Abstraction has 67 states and 73 transitions. [2018-02-02 10:19:13,673 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-02 10:19:13,674 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 73 transitions. [2018-02-02 10:19:13,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-02-02 10:19:13,674 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:19:13,674 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:19:13,674 INFO L371 AbstractCegarLoop]: === Iteration 7 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 10:19:13,675 INFO L82 PathProgramCache]: Analyzing trace with hash 614865, now seen corresponding path program 2 times [2018-02-02 10:19:13,676 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:19:13,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:19:13,687 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:19:13,887 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:19:13,887 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:19:13,887 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-02 10:19:13,887 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:19:13,888 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:19:13,888 INFO L182 omatonBuilderFactory]: Interpolants [929#true, 930#false, 931#(<= entry_point_~len~0 10), 932#(and (or (< 0 (div ldv_malloc_~size 4294967296)) (<= |ldv_malloc_#in~size| ldv_malloc_~size)) (or (<= ldv_malloc_~size |ldv_malloc_#in~size|) (<= (div ldv_malloc_~size 4294967296) 0))), 933#(or (and (<= |ldv_malloc_#in~size| (select |#length| |ldv_malloc_#t~malloc1.base|)) (= 0 |ldv_malloc_#t~malloc1.offset|)) (<= 4294967296 |ldv_malloc_#in~size|) (<= (+ (select |#length| |ldv_malloc_#t~malloc1.base|) 1) 0)), 934#(or (<= (+ (select |#length| |ldv_malloc_#res.base|) 1) 0) (<= 4294967296 |ldv_malloc_#in~size|) (and (= 0 |ldv_malloc_#res.offset|) (<= |ldv_malloc_#in~size| (select |#length| |ldv_malloc_#res.base|)))), 935#(or (<= (+ (select |#length| |entry_point_#t~ret8.base|) 1) 0) (and (<= (* 4 entry_point_~len~0) (select |#length| |entry_point_#t~ret8.base|)) (= 0 |entry_point_#t~ret8.offset|))), 936#(or (<= (+ (select |#length| entry_point_~array~0.base) 1) 0) (and (<= (* 4 entry_point_~len~0) (select |#length| entry_point_~array~0.base)) (= entry_point_~array~0.offset 0))), 937#(or (<= (+ (select |#length| entry_point_~array~0.base) 1) (+ (* 4 entry_point_~i~1) entry_point_~array~0.offset)) (and (<= (* 4 entry_point_~len~0) (select |#length| entry_point_~array~0.base)) (= entry_point_~array~0.offset 0))), 938#(or (<= (+ (select |#length| entry_point_~array~0.base) 5) (+ (* 4 entry_point_~i~1) entry_point_~array~0.offset)) (and (<= (* 4 entry_point_~len~0) (select |#length| entry_point_~array~0.base)) (= entry_point_~array~0.offset 0))), 939#(and (<= 0 (+ (* 4 entry_point_~i~1) entry_point_~array~0.offset)) (<= (* 4 entry_point_~len~0) (select |#length| entry_point_~array~0.base)) (= entry_point_~array~0.offset 0)), 940#(and (<= (* 4 entry_point_~len~0) (select |#length| entry_point_~array~0.base)) (<= 4 (+ (* 4 entry_point_~i~1) entry_point_~array~0.offset)) (= entry_point_~array~0.offset 0)), 941#(and (<= 4 (+ (* 4 entry_point_~i~1) entry_point_~array~0.offset)) (= entry_point_~array~0.offset 0) (<= (+ (* 4 entry_point_~i~1) 4) (select |#length| entry_point_~array~0.base)))] [2018-02-02 10:19:13,888 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:19:13,888 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-02 10:19:13,889 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-02 10:19:13,889 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2018-02-02 10:19:13,889 INFO L87 Difference]: Start difference. First operand 67 states and 73 transitions. Second operand 13 states. [2018-02-02 10:19:14,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:19:14,101 INFO L93 Difference]: Finished difference Result 66 states and 72 transitions. [2018-02-02 10:19:14,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-02 10:19:14,101 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 27 [2018-02-02 10:19:14,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:19:14,102 INFO L225 Difference]: With dead ends: 66 [2018-02-02 10:19:14,102 INFO L226 Difference]: Without dead ends: 66 [2018-02-02 10:19:14,103 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=301, Unknown=0, NotChecked=0, Total=380 [2018-02-02 10:19:14,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-02-02 10:19:14,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 61. [2018-02-02 10:19:14,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-02-02 10:19:14,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 66 transitions. [2018-02-02 10:19:14,105 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 66 transitions. Word has length 27 [2018-02-02 10:19:14,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:19:14,105 INFO L432 AbstractCegarLoop]: Abstraction has 61 states and 66 transitions. [2018-02-02 10:19:14,105 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-02 10:19:14,106 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 66 transitions. [2018-02-02 10:19:14,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-02-02 10:19:14,106 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:19:14,106 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:19:14,106 INFO L371 AbstractCegarLoop]: === Iteration 8 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 10:19:14,106 INFO L82 PathProgramCache]: Analyzing trace with hash 2025596221, now seen corresponding path program 1 times [2018-02-02 10:19:14,107 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:19:14,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:19:14,116 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:19:14,137 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:19:14,137 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:19:14,137 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 10:19:14,137 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:19:14,138 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:19:14,138 INFO L182 omatonBuilderFactory]: Interpolants [1083#true, 1084#false, 1085#(= 1 (select |#valid| entry_point_~array~0.base)), 1086#(= |#valid| |old(#valid)|)] [2018-02-02 10:19:14,138 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:19:14,138 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 10:19:14,138 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 10:19:14,138 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 10:19:14,139 INFO L87 Difference]: Start difference. First operand 61 states and 66 transitions. Second operand 4 states. [2018-02-02 10:19:14,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:19:14,190 INFO L93 Difference]: Finished difference Result 87 states and 97 transitions. [2018-02-02 10:19:14,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 10:19:14,191 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 31 [2018-02-02 10:19:14,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:19:14,192 INFO L225 Difference]: With dead ends: 87 [2018-02-02 10:19:14,192 INFO L226 Difference]: Without dead ends: 87 [2018-02-02 10:19:14,192 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 10:19:14,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-02-02 10:19:14,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 77. [2018-02-02 10:19:14,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-02-02 10:19:14,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 90 transitions. [2018-02-02 10:19:14,201 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 90 transitions. Word has length 31 [2018-02-02 10:19:14,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:19:14,201 INFO L432 AbstractCegarLoop]: Abstraction has 77 states and 90 transitions. [2018-02-02 10:19:14,201 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 10:19:14,201 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 90 transitions. [2018-02-02 10:19:14,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-02-02 10:19:14,202 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:19:14,202 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:19:14,202 INFO L371 AbstractCegarLoop]: === Iteration 9 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 10:19:14,202 INFO L82 PathProgramCache]: Analyzing trace with hash 2025596220, now seen corresponding path program 1 times [2018-02-02 10:19:14,209 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:19:14,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:19:14,217 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:19:14,244 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 10:19:14,244 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:19:14,245 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 10:19:14,245 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:19:14,245 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:19:14,245 INFO L182 omatonBuilderFactory]: Interpolants [1251#true, 1252#false, 1253#(= 0 |ldv_malloc_#t~malloc1.offset|), 1254#(= 0 |ldv_malloc_#res.offset|), 1255#(= 0 |entry_point_#t~ret8.offset|), 1256#(= 0 entry_point_~array~0.offset)] [2018-02-02 10:19:14,245 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 10:19:14,246 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 10:19:14,246 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 10:19:14,246 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:19:14,246 INFO L87 Difference]: Start difference. First operand 77 states and 90 transitions. Second operand 6 states. [2018-02-02 10:19:14,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:19:14,265 INFO L93 Difference]: Finished difference Result 76 states and 88 transitions. [2018-02-02 10:19:14,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 10:19:14,266 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2018-02-02 10:19:14,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:19:14,267 INFO L225 Difference]: With dead ends: 76 [2018-02-02 10:19:14,267 INFO L226 Difference]: Without dead ends: 76 [2018-02-02 10:19:14,268 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-02-02 10:19:14,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-02-02 10:19:14,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2018-02-02 10:19:14,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-02-02 10:19:14,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 88 transitions. [2018-02-02 10:19:14,274 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 88 transitions. Word has length 31 [2018-02-02 10:19:14,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:19:14,274 INFO L432 AbstractCegarLoop]: Abstraction has 76 states and 88 transitions. [2018-02-02 10:19:14,274 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 10:19:14,274 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 88 transitions. [2018-02-02 10:19:14,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-02-02 10:19:14,275 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:19:14,275 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:19:14,275 INFO L371 AbstractCegarLoop]: === Iteration 10 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 10:19:14,275 INFO L82 PathProgramCache]: Analyzing trace with hash 324245613, now seen corresponding path program 1 times [2018-02-02 10:19:14,276 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:19:14,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:19:14,284 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:19:14,315 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-02 10:19:14,316 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:19:14,316 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 10:19:14,316 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:19:14,317 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 10:19:14,317 INFO L182 omatonBuilderFactory]: Interpolants [1411#true, 1412#false, 1413#(and (= 0 |ldv_malloc_#res.offset|) (= 0 |ldv_malloc_#res.base|)), 1414#(and (= 0 |alloc_17_#t~ret3.base|) (= 0 |alloc_17_#t~ret3.offset|)), 1415#(and (= 0 alloc_17_~p~0.offset) (= alloc_17_~p~0.base 0))] [2018-02-02 10:19:14,317 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-02 10:19:14,317 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 10:19:14,317 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 10:19:14,317 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:19:14,317 INFO L87 Difference]: Start difference. First operand 76 states and 88 transitions. Second operand 5 states. [2018-02-02 10:19:14,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:19:14,329 INFO L93 Difference]: Finished difference Result 80 states and 89 transitions. [2018-02-02 10:19:14,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 10:19:14,330 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 34 [2018-02-02 10:19:14,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:19:14,331 INFO L225 Difference]: With dead ends: 80 [2018-02-02 10:19:14,331 INFO L226 Difference]: Without dead ends: 80 [2018-02-02 10:19:14,331 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:19:14,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-02-02 10:19:14,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 76. [2018-02-02 10:19:14,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-02-02 10:19:14,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 85 transitions. [2018-02-02 10:19:14,335 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 85 transitions. Word has length 34 [2018-02-02 10:19:14,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:19:14,335 INFO L432 AbstractCegarLoop]: Abstraction has 76 states and 85 transitions. [2018-02-02 10:19:14,335 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 10:19:14,335 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 85 transitions. [2018-02-02 10:19:14,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-02-02 10:19:14,336 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:19:14,336 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:19:14,336 INFO L371 AbstractCegarLoop]: === Iteration 11 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 10:19:14,336 INFO L82 PathProgramCache]: Analyzing trace with hash 246550693, now seen corresponding path program 1 times [2018-02-02 10:19:14,337 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:19:14,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:19:14,356 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:19:14,382 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:19:14,382 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:19:14,382 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-02-02 10:19:14,382 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:19:14,383 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:19:14,383 INFO L182 omatonBuilderFactory]: Interpolants [1572#true, 1573#false, 1574#(<= 10 entry_point_~len~0), 1575#(and (<= 10 entry_point_~len~0) (= entry_point_~i~1 0)), 1576#(<= (+ entry_point_~i~1 9) entry_point_~len~0)] [2018-02-02 10:19:14,383 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:19:14,383 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 10:19:14,384 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 10:19:14,384 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:19:14,384 INFO L87 Difference]: Start difference. First operand 76 states and 85 transitions. Second operand 5 states. [2018-02-02 10:19:14,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:19:14,421 INFO L93 Difference]: Finished difference Result 82 states and 91 transitions. [2018-02-02 10:19:14,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 10:19:14,421 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 34 [2018-02-02 10:19:14,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:19:14,422 INFO L225 Difference]: With dead ends: 82 [2018-02-02 10:19:14,422 INFO L226 Difference]: Without dead ends: 82 [2018-02-02 10:19:14,423 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:19:14,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-02-02 10:19:14,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 80. [2018-02-02 10:19:14,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-02-02 10:19:14,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 89 transitions. [2018-02-02 10:19:14,426 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 89 transitions. Word has length 34 [2018-02-02 10:19:14,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:19:14,427 INFO L432 AbstractCegarLoop]: Abstraction has 80 states and 89 transitions. [2018-02-02 10:19:14,427 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 10:19:14,427 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 89 transitions. [2018-02-02 10:19:14,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-02-02 10:19:14,428 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:19:14,428 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:19:14,428 INFO L371 AbstractCegarLoop]: === Iteration 12 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 10:19:14,428 INFO L82 PathProgramCache]: Analyzing trace with hash 1199349870, now seen corresponding path program 2 times [2018-02-02 10:19:14,429 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:19:14,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:19:14,438 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:19:14,466 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:19:14,466 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:19:14,466 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-02-02 10:19:14,466 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:19:14,467 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:19:14,467 INFO L182 omatonBuilderFactory]: Interpolants [1744#(and (<= 10 entry_point_~len~0) (= entry_point_~i~1 0)), 1745#(<= (+ entry_point_~i~1 9) entry_point_~len~0), 1746#(<= (+ entry_point_~i~1 8) entry_point_~len~0), 1741#true, 1742#false, 1743#(<= 10 entry_point_~len~0)] [2018-02-02 10:19:14,467 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:19:14,467 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 10:19:14,468 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 10:19:14,468 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:19:14,468 INFO L87 Difference]: Start difference. First operand 80 states and 89 transitions. Second operand 6 states. [2018-02-02 10:19:14,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:19:14,506 INFO L93 Difference]: Finished difference Result 86 states and 95 transitions. [2018-02-02 10:19:14,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 10:19:14,507 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 38 [2018-02-02 10:19:14,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:19:14,507 INFO L225 Difference]: With dead ends: 86 [2018-02-02 10:19:14,508 INFO L226 Difference]: Without dead ends: 86 [2018-02-02 10:19:14,508 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2018-02-02 10:19:14,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-02-02 10:19:14,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 84. [2018-02-02 10:19:14,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-02-02 10:19:14,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 93 transitions. [2018-02-02 10:19:14,511 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 93 transitions. Word has length 38 [2018-02-02 10:19:14,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:19:14,511 INFO L432 AbstractCegarLoop]: Abstraction has 84 states and 93 transitions. [2018-02-02 10:19:14,511 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 10:19:14,511 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 93 transitions. [2018-02-02 10:19:14,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-02-02 10:19:14,512 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:19:14,512 INFO L351 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:19:14,512 INFO L371 AbstractCegarLoop]: === Iteration 13 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 10:19:14,513 INFO L82 PathProgramCache]: Analyzing trace with hash -176675913, now seen corresponding path program 3 times [2018-02-02 10:19:14,513 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:19:14,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:19:14,522 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:19:14,569 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:19:14,570 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:19:14,570 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-02-02 10:19:14,570 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:19:14,570 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:19:14,570 INFO L182 omatonBuilderFactory]: Interpolants [1921#true, 1922#false, 1923#(<= 10 entry_point_~len~0), 1924#(and (<= 10 entry_point_~len~0) (= entry_point_~i~1 0)), 1925#(<= (+ entry_point_~i~1 9) entry_point_~len~0), 1926#(<= (+ entry_point_~i~1 8) entry_point_~len~0), 1927#(<= (+ entry_point_~i~1 7) entry_point_~len~0)] [2018-02-02 10:19:14,571 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:19:14,571 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 10:19:14,571 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 10:19:14,571 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-02-02 10:19:14,571 INFO L87 Difference]: Start difference. First operand 84 states and 93 transitions. Second operand 7 states. [2018-02-02 10:19:14,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:19:14,616 INFO L93 Difference]: Finished difference Result 90 states and 99 transitions. [2018-02-02 10:19:14,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 10:19:14,617 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 42 [2018-02-02 10:19:14,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:19:14,618 INFO L225 Difference]: With dead ends: 90 [2018-02-02 10:19:14,618 INFO L226 Difference]: Without dead ends: 90 [2018-02-02 10:19:14,618 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2018-02-02 10:19:14,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-02-02 10:19:14,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 88. [2018-02-02 10:19:14,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-02-02 10:19:14,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 97 transitions. [2018-02-02 10:19:14,622 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 97 transitions. Word has length 42 [2018-02-02 10:19:14,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:19:14,622 INFO L432 AbstractCegarLoop]: Abstraction has 88 states and 97 transitions. [2018-02-02 10:19:14,622 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 10:19:14,622 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 97 transitions. [2018-02-02 10:19:14,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-02-02 10:19:14,623 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:19:14,623 INFO L351 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:19:14,623 INFO L371 AbstractCegarLoop]: === Iteration 14 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 10:19:14,623 INFO L82 PathProgramCache]: Analyzing trace with hash 1744755328, now seen corresponding path program 4 times [2018-02-02 10:19:14,624 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:19:14,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:19:14,633 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:19:14,696 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:19:14,697 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:19:14,697 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-02-02 10:19:14,697 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:19:14,697 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:19:14,697 INFO L182 omatonBuilderFactory]: Interpolants [2112#true, 2113#false, 2114#(<= 10 entry_point_~len~0), 2115#(and (<= 10 entry_point_~len~0) (= entry_point_~i~1 0)), 2116#(<= (+ entry_point_~i~1 9) entry_point_~len~0), 2117#(<= (+ entry_point_~i~1 8) entry_point_~len~0), 2118#(<= (+ entry_point_~i~1 7) entry_point_~len~0), 2119#(<= (+ entry_point_~i~1 6) entry_point_~len~0)] [2018-02-02 10:19:14,697 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:19:14,698 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 10:19:14,698 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 10:19:14,698 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2018-02-02 10:19:14,698 INFO L87 Difference]: Start difference. First operand 88 states and 97 transitions. Second operand 8 states. [2018-02-02 10:19:14,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:19:14,759 INFO L93 Difference]: Finished difference Result 94 states and 103 transitions. [2018-02-02 10:19:14,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 10:19:14,759 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 46 [2018-02-02 10:19:14,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:19:14,760 INFO L225 Difference]: With dead ends: 94 [2018-02-02 10:19:14,760 INFO L226 Difference]: Without dead ends: 94 [2018-02-02 10:19:14,760 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=56, Invalid=76, Unknown=0, NotChecked=0, Total=132 [2018-02-02 10:19:14,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-02-02 10:19:14,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 92. [2018-02-02 10:19:14,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-02-02 10:19:14,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 101 transitions. [2018-02-02 10:19:14,764 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 101 transitions. Word has length 46 [2018-02-02 10:19:14,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:19:14,764 INFO L432 AbstractCegarLoop]: Abstraction has 92 states and 101 transitions. [2018-02-02 10:19:14,764 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 10:19:14,764 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 101 transitions. [2018-02-02 10:19:14,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-02-02 10:19:14,765 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:19:14,765 INFO L351 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:19:14,765 INFO L371 AbstractCegarLoop]: === Iteration 15 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 10:19:14,765 INFO L82 PathProgramCache]: Analyzing trace with hash 927663305, now seen corresponding path program 5 times [2018-02-02 10:19:14,766 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:19:14,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:19:14,775 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:19:14,825 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:19:14,826 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:19:14,826 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-02-02 10:19:14,826 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:19:14,826 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:19:14,826 INFO L182 omatonBuilderFactory]: Interpolants [2320#(<= (+ entry_point_~i~1 7) entry_point_~len~0), 2321#(<= (+ entry_point_~i~1 6) entry_point_~len~0), 2322#(<= (+ entry_point_~i~1 5) entry_point_~len~0), 2314#true, 2315#false, 2316#(<= 10 entry_point_~len~0), 2317#(and (<= 10 entry_point_~len~0) (= entry_point_~i~1 0)), 2318#(<= (+ entry_point_~i~1 9) entry_point_~len~0), 2319#(<= (+ entry_point_~i~1 8) entry_point_~len~0)] [2018-02-02 10:19:14,826 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:19:14,827 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 10:19:14,827 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 10:19:14,827 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2018-02-02 10:19:14,827 INFO L87 Difference]: Start difference. First operand 92 states and 101 transitions. Second operand 9 states. [2018-02-02 10:19:14,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:19:14,901 INFO L93 Difference]: Finished difference Result 98 states and 107 transitions. [2018-02-02 10:19:14,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 10:19:14,903 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 50 [2018-02-02 10:19:14,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:19:14,903 INFO L225 Difference]: With dead ends: 98 [2018-02-02 10:19:14,904 INFO L226 Difference]: Without dead ends: 98 [2018-02-02 10:19:14,904 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=76, Invalid=106, Unknown=0, NotChecked=0, Total=182 [2018-02-02 10:19:14,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-02-02 10:19:14,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 96. [2018-02-02 10:19:14,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-02-02 10:19:14,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 105 transitions. [2018-02-02 10:19:14,907 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 105 transitions. Word has length 50 [2018-02-02 10:19:14,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:19:14,907 INFO L432 AbstractCegarLoop]: Abstraction has 96 states and 105 transitions. [2018-02-02 10:19:14,907 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 10:19:14,908 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 105 transitions. [2018-02-02 10:19:14,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-02-02 10:19:14,908 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:19:14,908 INFO L351 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:19:14,908 INFO L371 AbstractCegarLoop]: === Iteration 16 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 10:19:14,909 INFO L82 PathProgramCache]: Analyzing trace with hash -730406254, now seen corresponding path program 6 times [2018-02-02 10:19:14,909 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:19:14,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:19:14,920 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:19:14,987 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:19:14,987 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:19:14,987 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-02-02 10:19:14,988 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:19:14,988 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:19:14,988 INFO L182 omatonBuilderFactory]: Interpolants [2528#false, 2529#(<= 10 entry_point_~len~0), 2530#(and (<= 10 entry_point_~len~0) (= entry_point_~i~1 0)), 2531#(<= (+ entry_point_~i~1 9) entry_point_~len~0), 2532#(<= (+ entry_point_~i~1 8) entry_point_~len~0), 2533#(<= (+ entry_point_~i~1 7) entry_point_~len~0), 2534#(<= (+ entry_point_~i~1 6) entry_point_~len~0), 2535#(<= (+ entry_point_~i~1 5) entry_point_~len~0), 2536#(<= (+ entry_point_~i~1 4) entry_point_~len~0), 2527#true] [2018-02-02 10:19:14,988 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:19:14,988 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 10:19:14,989 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 10:19:14,989 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2018-02-02 10:19:14,989 INFO L87 Difference]: Start difference. First operand 96 states and 105 transitions. Second operand 10 states. [2018-02-02 10:19:15,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:19:15,079 INFO L93 Difference]: Finished difference Result 102 states and 111 transitions. [2018-02-02 10:19:15,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 10:19:15,079 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 54 [2018-02-02 10:19:15,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:19:15,080 INFO L225 Difference]: With dead ends: 102 [2018-02-02 10:19:15,080 INFO L226 Difference]: Without dead ends: 102 [2018-02-02 10:19:15,081 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=99, Invalid=141, Unknown=0, NotChecked=0, Total=240 [2018-02-02 10:19:15,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-02-02 10:19:15,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 100. [2018-02-02 10:19:15,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-02-02 10:19:15,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 109 transitions. [2018-02-02 10:19:15,084 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 109 transitions. Word has length 54 [2018-02-02 10:19:15,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:19:15,085 INFO L432 AbstractCegarLoop]: Abstraction has 100 states and 109 transitions. [2018-02-02 10:19:15,085 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 10:19:15,085 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 109 transitions. [2018-02-02 10:19:15,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-02-02 10:19:15,085 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:19:15,086 INFO L351 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:19:15,086 INFO L371 AbstractCegarLoop]: === Iteration 17 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 10:19:15,086 INFO L82 PathProgramCache]: Analyzing trace with hash 427602907, now seen corresponding path program 7 times [2018-02-02 10:19:15,087 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:19:15,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:19:15,097 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:19:15,172 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:19:15,173 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:19:15,173 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-02-02 10:19:15,173 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:19:15,173 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:19:15,173 INFO L182 omatonBuilderFactory]: Interpolants [2752#false, 2753#(<= 10 entry_point_~len~0), 2754#(and (<= 10 entry_point_~len~0) (= entry_point_~i~1 0)), 2755#(<= (+ entry_point_~i~1 9) entry_point_~len~0), 2756#(<= (+ entry_point_~i~1 8) entry_point_~len~0), 2757#(<= (+ entry_point_~i~1 7) entry_point_~len~0), 2758#(<= (+ entry_point_~i~1 6) entry_point_~len~0), 2759#(<= (+ entry_point_~i~1 5) entry_point_~len~0), 2760#(<= (+ entry_point_~i~1 4) entry_point_~len~0), 2761#(<= (+ entry_point_~i~1 3) entry_point_~len~0), 2751#true] [2018-02-02 10:19:15,174 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:19:15,174 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-02 10:19:15,174 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-02 10:19:15,174 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2018-02-02 10:19:15,174 INFO L87 Difference]: Start difference. First operand 100 states and 109 transitions. Second operand 11 states. [2018-02-02 10:19:15,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:19:15,243 INFO L93 Difference]: Finished difference Result 106 states and 115 transitions. [2018-02-02 10:19:15,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-02 10:19:15,243 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 58 [2018-02-02 10:19:15,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:19:15,244 INFO L225 Difference]: With dead ends: 106 [2018-02-02 10:19:15,244 INFO L226 Difference]: Without dead ends: 106 [2018-02-02 10:19:15,244 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=125, Invalid=181, Unknown=0, NotChecked=0, Total=306 [2018-02-02 10:19:15,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-02-02 10:19:15,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 104. [2018-02-02 10:19:15,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-02-02 10:19:15,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 113 transitions. [2018-02-02 10:19:15,248 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 113 transitions. Word has length 58 [2018-02-02 10:19:15,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:19:15,248 INFO L432 AbstractCegarLoop]: Abstraction has 104 states and 113 transitions. [2018-02-02 10:19:15,248 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-02 10:19:15,248 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 113 transitions. [2018-02-02 10:19:15,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-02-02 10:19:15,249 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:19:15,249 INFO L351 BasicCegarLoop]: trace histogram [9, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:19:15,249 INFO L371 AbstractCegarLoop]: === Iteration 18 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 10:19:15,250 INFO L82 PathProgramCache]: Analyzing trace with hash -650725212, now seen corresponding path program 8 times [2018-02-02 10:19:15,250 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:19:15,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:19:15,261 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:19:15,344 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 0 proven. 128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:19:15,345 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:19:15,345 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-02 10:19:15,345 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:19:15,345 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:19:15,346 INFO L182 omatonBuilderFactory]: Interpolants [2992#(<= (+ entry_point_~i~1 7) entry_point_~len~0), 2993#(<= (+ entry_point_~i~1 6) entry_point_~len~0), 2994#(<= (+ entry_point_~i~1 5) entry_point_~len~0), 2995#(<= (+ entry_point_~i~1 4) entry_point_~len~0), 2996#(<= (+ entry_point_~i~1 3) entry_point_~len~0), 2997#(<= (+ entry_point_~i~1 2) entry_point_~len~0), 2986#true, 2987#false, 2988#(<= 10 entry_point_~len~0), 2989#(and (<= 10 entry_point_~len~0) (= entry_point_~i~1 0)), 2990#(<= (+ entry_point_~i~1 9) entry_point_~len~0), 2991#(<= (+ entry_point_~i~1 8) entry_point_~len~0)] [2018-02-02 10:19:15,346 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 0 proven. 128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:19:15,346 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-02 10:19:15,346 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-02 10:19:15,347 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2018-02-02 10:19:15,347 INFO L87 Difference]: Start difference. First operand 104 states and 113 transitions. Second operand 12 states. [2018-02-02 10:19:15,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:19:15,434 INFO L93 Difference]: Finished difference Result 110 states and 119 transitions. [2018-02-02 10:19:15,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-02 10:19:15,434 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 62 [2018-02-02 10:19:15,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:19:15,435 INFO L225 Difference]: With dead ends: 110 [2018-02-02 10:19:15,435 INFO L226 Difference]: Without dead ends: 110 [2018-02-02 10:19:15,435 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=154, Invalid=226, Unknown=0, NotChecked=0, Total=380 [2018-02-02 10:19:15,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-02-02 10:19:15,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 108. [2018-02-02 10:19:15,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-02-02 10:19:15,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 117 transitions. [2018-02-02 10:19:15,439 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 117 transitions. Word has length 62 [2018-02-02 10:19:15,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:19:15,439 INFO L432 AbstractCegarLoop]: Abstraction has 108 states and 117 transitions. [2018-02-02 10:19:15,439 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-02 10:19:15,439 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 117 transitions. [2018-02-02 10:19:15,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-02-02 10:19:15,439 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:19:15,439 INFO L351 BasicCegarLoop]: trace histogram [10, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:19:15,439 INFO L371 AbstractCegarLoop]: === Iteration 19 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 10:19:15,440 INFO L82 PathProgramCache]: Analyzing trace with hash 1868509421, now seen corresponding path program 9 times [2018-02-02 10:19:15,440 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:19:15,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:19:15,447 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:19:15,519 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 0 proven. 162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:19:15,519 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:19:15,520 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-02-02 10:19:15,520 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:19:15,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:19:15,520 INFO L182 omatonBuilderFactory]: Interpolants [3232#true, 3233#false, 3234#(<= 10 entry_point_~len~0), 3235#(and (<= 10 entry_point_~len~0) (= entry_point_~i~1 0)), 3236#(<= (+ entry_point_~i~1 9) entry_point_~len~0), 3237#(<= (+ entry_point_~i~1 8) entry_point_~len~0), 3238#(<= (+ entry_point_~i~1 7) entry_point_~len~0), 3239#(<= (+ entry_point_~i~1 6) entry_point_~len~0), 3240#(<= (+ entry_point_~i~1 5) entry_point_~len~0), 3241#(<= (+ entry_point_~i~1 4) entry_point_~len~0), 3242#(<= (+ entry_point_~i~1 3) entry_point_~len~0), 3243#(<= (+ entry_point_~i~1 2) entry_point_~len~0), 3244#(<= (+ entry_point_~i~1 1) entry_point_~len~0)] [2018-02-02 10:19:15,520 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 0 proven. 162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:19:15,520 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-02 10:19:15,520 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-02 10:19:15,521 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2018-02-02 10:19:15,521 INFO L87 Difference]: Start difference. First operand 108 states and 117 transitions. Second operand 13 states. [2018-02-02 10:19:15,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:19:15,646 INFO L93 Difference]: Finished difference Result 112 states and 121 transitions. [2018-02-02 10:19:15,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-02 10:19:15,651 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 66 [2018-02-02 10:19:15,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:19:15,652 INFO L225 Difference]: With dead ends: 112 [2018-02-02 10:19:15,652 INFO L226 Difference]: Without dead ends: 112 [2018-02-02 10:19:15,652 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=186, Invalid=276, Unknown=0, NotChecked=0, Total=462 [2018-02-02 10:19:15,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-02-02 10:19:15,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2018-02-02 10:19:15,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-02-02 10:19:15,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 121 transitions. [2018-02-02 10:19:15,655 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 121 transitions. Word has length 66 [2018-02-02 10:19:15,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:19:15,655 INFO L432 AbstractCegarLoop]: Abstraction has 112 states and 121 transitions. [2018-02-02 10:19:15,655 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-02 10:19:15,655 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 121 transitions. [2018-02-02 10:19:15,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-02-02 10:19:15,656 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:19:15,656 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:19:15,656 INFO L371 AbstractCegarLoop]: === Iteration 20 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 10:19:15,656 INFO L82 PathProgramCache]: Analyzing trace with hash 1351638198, now seen corresponding path program 10 times [2018-02-02 10:19:15,657 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:19:15,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:19:15,668 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:19:15,705 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2018-02-02 10:19:15,705 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:19:15,705 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 10:19:15,705 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:19:15,706 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:19:15,706 INFO L182 omatonBuilderFactory]: Interpolants [3488#false, 3489#(<= 10 entry_point_~len~0), 3490#(and (= alloc_17_~i~0 0) (<= |alloc_17_#in~len| alloc_17_~len)), 3491#(<= |alloc_17_#in~len| 0), 3487#true] [2018-02-02 10:19:15,706 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2018-02-02 10:19:15,706 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 10:19:15,706 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 10:19:15,706 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:19:15,706 INFO L87 Difference]: Start difference. First operand 112 states and 121 transitions. Second operand 5 states. [2018-02-02 10:19:15,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:19:15,741 INFO L93 Difference]: Finished difference Result 137 states and 147 transitions. [2018-02-02 10:19:15,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 10:19:15,742 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 70 [2018-02-02 10:19:15,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:19:15,743 INFO L225 Difference]: With dead ends: 137 [2018-02-02 10:19:15,743 INFO L226 Difference]: Without dead ends: 134 [2018-02-02 10:19:15,743 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:19:15,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-02-02 10:19:15,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 111. [2018-02-02 10:19:15,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-02-02 10:19:15,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 119 transitions. [2018-02-02 10:19:15,746 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 119 transitions. Word has length 70 [2018-02-02 10:19:15,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:19:15,746 INFO L432 AbstractCegarLoop]: Abstraction has 111 states and 119 transitions. [2018-02-02 10:19:15,746 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 10:19:15,747 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 119 transitions. [2018-02-02 10:19:15,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-02-02 10:19:15,747 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:19:15,747 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:19:15,747 INFO L371 AbstractCegarLoop]: === Iteration 21 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 10:19:15,748 INFO L82 PathProgramCache]: Analyzing trace with hash 1434451296, now seen corresponding path program 1 times [2018-02-02 10:19:15,748 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:19:15,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:19:15,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:19:16,018 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 3 proven. 32 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2018-02-02 10:19:16,018 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:19:16,018 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-02-02 10:19:16,018 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:19:16,019 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:19:16,019 INFO L182 omatonBuilderFactory]: Interpolants [3744#(<= 10 entry_point_~len~0), 3745#(and (= (select |#valid| |ldv_malloc_#t~malloc1.base|) 1) (= 0 |ldv_malloc_#t~malloc1.offset|)), 3746#(and (= 0 |ldv_malloc_#res.offset|) (= (select |#valid| |ldv_malloc_#res.base|) 1)), 3747#(and (<= 10 entry_point_~len~0) (= (select |#valid| |entry_point_#t~ret8.base|) 1) (= 0 |entry_point_#t~ret8.offset|)), 3748#(and (<= 10 entry_point_~len~0) (= entry_point_~array~0.offset 0) (= (select |#valid| entry_point_~array~0.base) 1)), 3749#(and (<= (+ (* 4 entry_point_~i~1) entry_point_~array~0.offset 44) (+ (select |#length| entry_point_~array~0.base) (* 4 entry_point_~len~0))) (= entry_point_~array~0.offset 0) (= (select |#valid| entry_point_~array~0.base) 1)), 3750#(and (= entry_point_~array~0.offset 0) (= (select |#valid| entry_point_~array~0.base) 1) (<= (+ (* 4 entry_point_~i~1) entry_point_~array~0.offset 40) (+ (select |#length| entry_point_~array~0.base) (* 4 entry_point_~len~0)))), 3751#(and (<= (+ entry_point_~array~0.offset 40) (select |#length| entry_point_~array~0.base)) (= entry_point_~array~0.offset 0) (= (select |#valid| entry_point_~array~0.base) 1)), 3752#(and (= (select |#valid| |alloc_17_#in~array.base|) 1) (<= 40 (select |#length| |alloc_17_#in~array.base|)) (= 0 |alloc_17_#in~array.offset|)), 3753#(and (= (select |#valid| alloc_17_~array.base) 1) (= alloc_17_~i~0 0) (= alloc_17_~array.offset 0) (<= 40 (select |#length| alloc_17_~array.base))), 3754#(and (= |#valid| |old(#valid)|) (= |old(#length)| |#length|)), 3755#(and (= (store |old(#length)| |ldv_malloc_#t~malloc1.base| (select |#length| |ldv_malloc_#t~malloc1.base|)) |#length|) (= 0 (select |old(#valid)| |ldv_malloc_#t~malloc1.base|))), 3756#(and (or (= 0 (select |old(#valid)| (@diff |old(#length)| |#length|))) (= |old(#length)| |#length|)) (= |#length| (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|))))), 3757#(and (= alloc_17_~i~0 0) (= alloc_17_~array.offset 0) (<= 40 (select |#length| alloc_17_~array.base))), 3742#true, 3743#false] [2018-02-02 10:19:16,019 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 3 proven. 32 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2018-02-02 10:19:16,019 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-02 10:19:16,019 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-02 10:19:16,019 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2018-02-02 10:19:16,019 INFO L87 Difference]: Start difference. First operand 111 states and 119 transitions. Second operand 16 states. [2018-02-02 10:19:16,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:19:16,501 INFO L93 Difference]: Finished difference Result 172 states and 186 transitions. [2018-02-02 10:19:16,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-02 10:19:16,502 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 72 [2018-02-02 10:19:16,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:19:16,502 INFO L225 Difference]: With dead ends: 172 [2018-02-02 10:19:16,503 INFO L226 Difference]: Without dead ends: 172 [2018-02-02 10:19:16,503 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=122, Invalid=690, Unknown=0, NotChecked=0, Total=812 [2018-02-02 10:19:16,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2018-02-02 10:19:16,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 125. [2018-02-02 10:19:16,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-02-02 10:19:16,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 144 transitions. [2018-02-02 10:19:16,507 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 144 transitions. Word has length 72 [2018-02-02 10:19:16,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:19:16,507 INFO L432 AbstractCegarLoop]: Abstraction has 125 states and 144 transitions. [2018-02-02 10:19:16,507 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-02 10:19:16,507 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 144 transitions. [2018-02-02 10:19:16,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-02-02 10:19:16,508 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:19:16,508 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:19:16,508 INFO L371 AbstractCegarLoop]: === Iteration 22 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 10:19:16,508 INFO L82 PathProgramCache]: Analyzing trace with hash 1434451295, now seen corresponding path program 1 times [2018-02-02 10:19:16,509 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:19:16,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:19:16,523 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:19:16,650 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2018-02-02 10:19:16,650 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:19:16,650 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-02-02 10:19:16,650 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:19:16,650 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:19:16,650 INFO L182 omatonBuilderFactory]: Interpolants [4081#true, 4082#false, 4083#(= 1 (select |#valid| |ldv_malloc_#t~malloc1.base|)), 4084#(= 1 (select |#valid| |ldv_malloc_#res.base|)), 4085#(= 1 (select |#valid| |entry_point_#t~ret8.base|)), 4086#(= 1 (select |#valid| entry_point_~array~0.base)), 4087#(= 1 (select |#valid| |alloc_17_#in~array.base|)), 4088#(= 1 (select |#valid| alloc_17_~array.base)), 4089#(= |#valid| |old(#valid)|), 4090#(and (= 1 (select |#valid| |ldv_malloc_#t~malloc1.base|)) (= (store |old(#valid)| |ldv_malloc_#t~malloc1.base| (select |#valid| |ldv_malloc_#t~malloc1.base|)) |#valid|)), 4091#(and (or (= 1 (select |#valid| (@diff |old(#valid)| |#valid|))) (= |#valid| |old(#valid)|)) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|)))))] [2018-02-02 10:19:16,651 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2018-02-02 10:19:16,651 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-02 10:19:16,651 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-02 10:19:16,651 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-02-02 10:19:16,651 INFO L87 Difference]: Start difference. First operand 125 states and 144 transitions. Second operand 11 states. [2018-02-02 10:19:16,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:19:16,858 INFO L93 Difference]: Finished difference Result 159 states and 183 transitions. [2018-02-02 10:19:16,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-02 10:19:16,858 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 72 [2018-02-02 10:19:16,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:19:16,859 INFO L225 Difference]: With dead ends: 159 [2018-02-02 10:19:16,859 INFO L226 Difference]: Without dead ends: 159 [2018-02-02 10:19:16,859 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2018-02-02 10:19:16,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-02-02 10:19:16,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 109. [2018-02-02 10:19:16,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-02-02 10:19:16,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 118 transitions. [2018-02-02 10:19:16,861 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 118 transitions. Word has length 72 [2018-02-02 10:19:16,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:19:16,862 INFO L432 AbstractCegarLoop]: Abstraction has 109 states and 118 transitions. [2018-02-02 10:19:16,862 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-02 10:19:16,862 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 118 transitions. [2018-02-02 10:19:16,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-02-02 10:19:16,862 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:19:16,862 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 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] [2018-02-02 10:19:16,862 INFO L371 AbstractCegarLoop]: === Iteration 23 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 10:19:16,862 INFO L82 PathProgramCache]: Analyzing trace with hash 955550151, now seen corresponding path program 1 times [2018-02-02 10:19:16,863 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:19:16,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:19:16,874 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:19:16,909 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2018-02-02 10:19:16,910 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:19:16,910 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 10:19:16,910 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:19:16,910 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 10:19:16,910 INFO L182 omatonBuilderFactory]: Interpolants [4374#true, 4375#false, 4376#(= alloc_17_~i~0 0), 4377#(<= (+ alloc_17_~j~0 1) 0)] [2018-02-02 10:19:16,911 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2018-02-02 10:19:16,911 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 10:19:16,911 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 10:19:16,911 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 10:19:16,911 INFO L87 Difference]: Start difference. First operand 109 states and 118 transitions. Second operand 4 states. [2018-02-02 10:19:16,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:19:16,943 INFO L93 Difference]: Finished difference Result 120 states and 129 transitions. [2018-02-02 10:19:16,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 10:19:16,944 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 73 [2018-02-02 10:19:16,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:19:16,944 INFO L225 Difference]: With dead ends: 120 [2018-02-02 10:19:16,945 INFO L226 Difference]: Without dead ends: 120 [2018-02-02 10:19:16,945 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:19:16,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-02-02 10:19:16,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 114. [2018-02-02 10:19:16,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-02-02 10:19:16,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 123 transitions. [2018-02-02 10:19:16,948 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 123 transitions. Word has length 73 [2018-02-02 10:19:16,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:19:16,948 INFO L432 AbstractCegarLoop]: Abstraction has 114 states and 123 transitions. [2018-02-02 10:19:16,948 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 10:19:16,948 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 123 transitions. [2018-02-02 10:19:16,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-02-02 10:19:16,949 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:19:16,949 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:19:16,949 INFO L371 AbstractCegarLoop]: === Iteration 24 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 10:19:16,949 INFO L82 PathProgramCache]: Analyzing trace with hash 509492026, now seen corresponding path program 1 times [2018-02-02 10:19:16,950 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:19:16,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:19:16,965 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:19:17,125 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 202 trivial. 0 not checked. [2018-02-02 10:19:17,125 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:19:17,126 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-02-02 10:19:17,126 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:19:17,126 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 10:19:17,126 INFO L182 omatonBuilderFactory]: Interpolants [4614#true, 4615#false, 4616#(= |#valid| |old(#valid)|), 4617#(and (not (= 0 |ldv_malloc_#t~malloc1.base|)) (= (store |old(#valid)| |ldv_malloc_#t~malloc1.base| (select |#valid| |ldv_malloc_#t~malloc1.base|)) |#valid|) (= (select |old(#valid)| |ldv_malloc_#t~malloc1.base|) 0)), 4618#(and (= (select |old(#valid)| |ldv_malloc_#res.base|) 0) (= |#valid| (store |old(#valid)| |ldv_malloc_#res.base| (select |#valid| |ldv_malloc_#res.base|))) (not (= 0 |ldv_malloc_#res.base|))), 4619#(and (= |#valid| (store |old(#valid)| |entry_point_#t~ret8.base| (select |#valid| |entry_point_#t~ret8.base|))) (= (select |old(#valid)| |entry_point_#t~ret8.base|) 0) (not (= 0 |entry_point_#t~ret8.base|))), 4620#(and (= (select |old(#valid)| entry_point_~array~0.base) 0) (not (= 0 entry_point_~array~0.base)) (= |#valid| (store |old(#valid)| entry_point_~array~0.base (select |#valid| entry_point_~array~0.base))))] [2018-02-02 10:19:17,126 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 202 trivial. 0 not checked. [2018-02-02 10:19:17,127 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 10:19:17,127 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 10:19:17,127 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-02 10:19:17,127 INFO L87 Difference]: Start difference. First operand 114 states and 123 transitions. Second operand 7 states. [2018-02-02 10:19:17,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:19:17,250 INFO L93 Difference]: Finished difference Result 125 states and 133 transitions. [2018-02-02 10:19:17,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 10:19:17,250 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 80 [2018-02-02 10:19:17,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:19:17,251 INFO L225 Difference]: With dead ends: 125 [2018-02-02 10:19:17,251 INFO L226 Difference]: Without dead ends: 112 [2018-02-02 10:19:17,251 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-02-02 10:19:17,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-02-02 10:19:17,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2018-02-02 10:19:17,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-02-02 10:19:17,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 120 transitions. [2018-02-02 10:19:17,253 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 120 transitions. Word has length 80 [2018-02-02 10:19:17,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:19:17,254 INFO L432 AbstractCegarLoop]: Abstraction has 112 states and 120 transitions. [2018-02-02 10:19:17,254 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 10:19:17,254 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 120 transitions. [2018-02-02 10:19:17,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-02-02 10:19:17,255 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:19:17,255 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:19:17,255 INFO L371 AbstractCegarLoop]: === Iteration 25 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 10:19:17,255 INFO L82 PathProgramCache]: Analyzing trace with hash 2010390940, now seen corresponding path program 1 times [2018-02-02 10:19:17,256 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:19:17,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:19:17,266 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:19:17,304 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 203 trivial. 0 not checked. [2018-02-02 10:19:17,304 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:19:17,305 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 10:19:17,305 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:19:17,305 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 10:19:17,305 INFO L182 omatonBuilderFactory]: Interpolants [4864#(not (= 0 |ldv_malloc_#t~malloc1.base|)), 4865#(not (= 0 |ldv_malloc_#res.base|)), 4866#(not (= 0 |alloc_17_#t~ret3.base|)), 4867#(not (= 0 alloc_17_~p~0.base)), 4862#true, 4863#false] [2018-02-02 10:19:17,305 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 203 trivial. 0 not checked. [2018-02-02 10:19:17,306 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 10:19:17,306 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 10:19:17,306 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:19:17,306 INFO L87 Difference]: Start difference. First operand 112 states and 120 transitions. Second operand 6 states. [2018-02-02 10:19:17,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:19:17,329 INFO L93 Difference]: Finished difference Result 111 states and 117 transitions. [2018-02-02 10:19:17,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 10:19:17,329 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 82 [2018-02-02 10:19:17,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:19:17,330 INFO L225 Difference]: With dead ends: 111 [2018-02-02 10:19:17,330 INFO L226 Difference]: Without dead ends: 111 [2018-02-02 10:19:17,331 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-02-02 10:19:17,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-02-02 10:19:17,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 109. [2018-02-02 10:19:17,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-02-02 10:19:17,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 115 transitions. [2018-02-02 10:19:17,333 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 115 transitions. Word has length 82 [2018-02-02 10:19:17,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:19:17,333 INFO L432 AbstractCegarLoop]: Abstraction has 109 states and 115 transitions. [2018-02-02 10:19:17,334 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 10:19:17,334 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 115 transitions. [2018-02-02 10:19:17,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-02-02 10:19:17,334 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:19:17,334 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:19:17,334 INFO L371 AbstractCegarLoop]: === Iteration 26 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 10:19:17,336 INFO L82 PathProgramCache]: Analyzing trace with hash 732875601, now seen corresponding path program 1 times [2018-02-02 10:19:17,337 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:19:17,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:19:17,352 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:19:17,397 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2018-02-02 10:19:17,398 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:19:17,398 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-02-02 10:19:17,398 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:19:17,398 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-02 10:19:17,398 INFO L182 omatonBuilderFactory]: Interpolants [5092#true, 5093#false, 5094#(<= 10 entry_point_~len~0), 5095#(and (= alloc_17_~i~0 0) (<= |alloc_17_#in~len| alloc_17_~len)), 5096#(<= (+ alloc_17_~i~0 |alloc_17_#in~len|) (+ alloc_17_~len 1)), 5097#(<= |alloc_17_#in~len| 1)] [2018-02-02 10:19:17,399 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2018-02-02 10:19:17,399 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 10:19:17,399 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 10:19:17,399 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:19:17,399 INFO L87 Difference]: Start difference. First operand 109 states and 115 transitions. Second operand 6 states. [2018-02-02 10:19:17,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:19:17,438 INFO L93 Difference]: Finished difference Result 144 states and 154 transitions. [2018-02-02 10:19:17,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 10:19:17,438 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 83 [2018-02-02 10:19:17,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:19:17,439 INFO L225 Difference]: With dead ends: 144 [2018-02-02 10:19:17,439 INFO L226 Difference]: Without dead ends: 141 [2018-02-02 10:19:17,439 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-02-02 10:19:17,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-02-02 10:19:17,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 112. [2018-02-02 10:19:17,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-02-02 10:19:17,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 118 transitions. [2018-02-02 10:19:17,442 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 118 transitions. Word has length 83 [2018-02-02 10:19:17,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:19:17,443 INFO L432 AbstractCegarLoop]: Abstraction has 112 states and 118 transitions. [2018-02-02 10:19:17,443 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 10:19:17,443 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 118 transitions. [2018-02-02 10:19:17,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-02-02 10:19:17,443 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:19:17,443 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:19:17,443 INFO L371 AbstractCegarLoop]: === Iteration 27 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 10:19:17,444 INFO L82 PathProgramCache]: Analyzing trace with hash -490917573, now seen corresponding path program 1 times [2018-02-02 10:19:17,445 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:19:17,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:19:17,458 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:19:17,803 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 37 proven. 10 refuted. 0 times theorem prover too weak. 177 trivial. 0 not checked. [2018-02-02 10:19:17,804 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:19:17,804 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-02-02 10:19:17,804 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:19:17,804 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-02 10:19:17,804 INFO L182 omatonBuilderFactory]: Interpolants [5356#true, 5357#false, 5358#(and (= (select |#valid| |ldv_malloc_#t~malloc1.base|) 1) (= 0 |ldv_malloc_#t~malloc1.offset|)), 5359#(and (= 0 |ldv_malloc_#res.offset|) (= (select |#valid| |ldv_malloc_#res.base|) 1)), 5360#(and (= (select |#valid| |entry_point_#t~ret8.base|) 1) (= 0 |entry_point_#t~ret8.offset|)), 5361#(and (= entry_point_~array~0.offset 0) (= (select |#valid| entry_point_~array~0.base) 1)), 5362#(and (<= (+ (* 4 entry_point_~i~1) entry_point_~array~0.offset 4) (select |#length| entry_point_~array~0.base)) (= entry_point_~array~0.offset 0) (= (select |#valid| entry_point_~array~0.base) 1)), 5363#(and (<= (+ (* 4 entry_point_~i~1) entry_point_~array~0.offset) (select |#length| entry_point_~array~0.base)) (= entry_point_~array~0.offset 0) (= (select |#valid| entry_point_~array~0.base) 1)), 5364#(and (<= (+ (* 4 entry_point_~len~0) entry_point_~array~0.offset) (select |#length| entry_point_~array~0.base)) (= entry_point_~array~0.offset 0) (= (select |#valid| entry_point_~array~0.base) 1)), 5365#(and (<= (* 4 |alloc_17_#in~len|) (select |#length| |alloc_17_#in~array.base|)) (= (select |#valid| |alloc_17_#in~array.base|) 1) (= 0 |alloc_17_#in~array.offset|)), 5366#(and (<= (* 4 alloc_17_~len) (select |#length| alloc_17_~array.base)) (= (select |#valid| alloc_17_~array.base) 1) (= alloc_17_~array.offset 0)), 5367#(and (= |#valid| |old(#valid)|) (= |old(#length)| |#length|)), 5368#(and (= (store |old(#length)| |ldv_malloc_#t~malloc1.base| (select |#length| |ldv_malloc_#t~malloc1.base|)) |#length|) (= 0 (select |old(#valid)| |ldv_malloc_#t~malloc1.base|))), 5369#(and (or (= 0 (select |old(#valid)| (@diff |old(#length)| |#length|))) (= |old(#length)| |#length|)) (= |#length| (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|))))), 5370#(and (<= (* 4 alloc_17_~len) (select |#length| alloc_17_~array.base)) (= alloc_17_~array.offset 0)), 5371#(and (<= (* 4 alloc_17_~len) (select |#length| alloc_17_~array.base)) (= (select |#valid| alloc_17_~array.base) 1) (<= 0 (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset)) (= alloc_17_~array.offset 0)), 5372#(and (<= 4 (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset)) (<= (* 4 alloc_17_~len) (select |#length| alloc_17_~array.base)) (= (select |#valid| alloc_17_~array.base) 1) (= alloc_17_~array.offset 0)), 5373#(and (<= 4 (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset)) (<= (+ (* 4 alloc_17_~i~0) 4) (select |#length| alloc_17_~array.base)) (= (select |#valid| alloc_17_~array.base) 1) (= alloc_17_~array.offset 0)), 5374#(and (<= 4 (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset)) (<= (+ (* 4 alloc_17_~i~0) 4) (select |#length| alloc_17_~array.base)) (= alloc_17_~array.offset 0))] [2018-02-02 10:19:17,805 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 37 proven. 10 refuted. 0 times theorem prover too weak. 177 trivial. 0 not checked. [2018-02-02 10:19:17,805 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-02 10:19:17,805 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-02 10:19:17,805 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=294, Unknown=0, NotChecked=0, Total=342 [2018-02-02 10:19:17,805 INFO L87 Difference]: Start difference. First operand 112 states and 118 transitions. Second operand 19 states. [2018-02-02 10:19:18,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:19:18,301 INFO L93 Difference]: Finished difference Result 137 states and 147 transitions. [2018-02-02 10:19:18,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-02 10:19:18,302 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 85 [2018-02-02 10:19:18,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:19:18,302 INFO L225 Difference]: With dead ends: 137 [2018-02-02 10:19:18,302 INFO L226 Difference]: Without dead ends: 137 [2018-02-02 10:19:18,303 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 220 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=161, Invalid=1029, Unknown=0, NotChecked=0, Total=1190 [2018-02-02 10:19:18,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-02-02 10:19:18,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 111. [2018-02-02 10:19:18,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-02-02 10:19:18,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 117 transitions. [2018-02-02 10:19:18,306 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 117 transitions. Word has length 85 [2018-02-02 10:19:18,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:19:18,307 INFO L432 AbstractCegarLoop]: Abstraction has 111 states and 117 transitions. [2018-02-02 10:19:18,307 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-02 10:19:18,307 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 117 transitions. [2018-02-02 10:19:18,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-02-02 10:19:18,307 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:19:18,307 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:19:18,308 INFO L371 AbstractCegarLoop]: === Iteration 28 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 10:19:18,308 INFO L82 PathProgramCache]: Analyzing trace with hash 1398657356, now seen corresponding path program 1 times [2018-02-02 10:19:18,309 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:19:18,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:19:18,320 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:19:18,434 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 11 proven. 5 refuted. 0 times theorem prover too weak. 203 trivial. 0 not checked. [2018-02-02 10:19:18,434 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:19:18,434 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-02 10:19:18,434 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:19:18,434 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 10:19:18,435 INFO L182 omatonBuilderFactory]: Interpolants [5664#(and (<= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) (select |#length| alloc_17_~array.base)) (= alloc_17_~array.offset 0)), 5665#(= |old(#length)| |#length|), 5666#(and (<= (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset 4) (select |#length| alloc_17_~array.base)) (= alloc_17_~array.offset 0)), 5667#(and (<= (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset 4) (select |#length| alloc_17_~array.base)) (<= 0 alloc_17_~j~0) (= alloc_17_~array.offset 0)), 5655#true, 5656#false, 5657#(= 0 |ldv_malloc_#t~malloc1.offset|), 5658#(= 0 |ldv_malloc_#res.offset|), 5659#(= 0 |entry_point_#t~ret8.offset|), 5660#(= 0 entry_point_~array~0.offset), 5661#(= 0 |alloc_17_#in~array.offset|), 5662#(= alloc_17_~array.offset 0), 5663#(and (= alloc_17_~array.offset 0) (<= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset 4) (select |#length| alloc_17_~array.base)))] [2018-02-02 10:19:18,435 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 11 proven. 5 refuted. 0 times theorem prover too weak. 203 trivial. 0 not checked. [2018-02-02 10:19:18,435 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-02 10:19:18,435 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-02 10:19:18,435 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2018-02-02 10:19:18,435 INFO L87 Difference]: Start difference. First operand 111 states and 117 transitions. Second operand 13 states. [2018-02-02 10:19:18,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:19:18,607 INFO L93 Difference]: Finished difference Result 111 states and 117 transitions. [2018-02-02 10:19:18,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-02 10:19:18,607 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 86 [2018-02-02 10:19:18,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:19:18,608 INFO L225 Difference]: With dead ends: 111 [2018-02-02 10:19:18,608 INFO L226 Difference]: Without dead ends: 111 [2018-02-02 10:19:18,609 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=378, Unknown=0, NotChecked=0, Total=462 [2018-02-02 10:19:18,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-02-02 10:19:18,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 109. [2018-02-02 10:19:18,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-02-02 10:19:18,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 115 transitions. [2018-02-02 10:19:18,612 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 115 transitions. Word has length 86 [2018-02-02 10:19:18,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:19:18,613 INFO L432 AbstractCegarLoop]: Abstraction has 109 states and 115 transitions. [2018-02-02 10:19:18,613 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-02 10:19:18,613 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 115 transitions. [2018-02-02 10:19:18,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-02-02 10:19:18,613 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:19:18,613 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:19:18,614 INFO L371 AbstractCegarLoop]: === Iteration 29 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 10:19:18,614 INFO L82 PathProgramCache]: Analyzing trace with hash 408705067, now seen corresponding path program 1 times [2018-02-02 10:19:18,615 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:19:18,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:19:18,632 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:19:18,900 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2018-02-02 10:19:18,900 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:19:18,900 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-02 10:19:18,900 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:19:18,901 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-02-02 10:19:18,901 INFO L182 omatonBuilderFactory]: Interpolants [5920#(and (= alloc_17_~array.offset 0) (= 0 (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset)) (= 0 (select (select |#memory_$Pointer$.offset| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0))))), 5921#(= 0 |alloc_17_#t~mem6.offset|), 5907#true, 5908#false, 5909#(= 0 |ldv_malloc_#t~malloc1.offset|), 5910#(= 0 |ldv_malloc_#res.offset|), 5911#(= 0 |entry_point_#t~ret8.offset|), 5912#(= 0 entry_point_~array~0.offset), 5913#(= 0 |alloc_17_#in~array.offset|), 5914#(and (= alloc_17_~i~0 0) (= alloc_17_~array.offset 0)), 5915#(and (= alloc_17_~i~0 0) (= alloc_17_~array.offset 0) (= 0 |alloc_17_#t~ret3.offset|)), 5916#(and (= alloc_17_~i~0 0) (= alloc_17_~array.offset 0) (= 0 alloc_17_~p~0.offset)), 5917#(and (= alloc_17_~i~0 0) (= alloc_17_~array.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~i~0))))), 5918#(and (<= alloc_17_~i~0 1) (= alloc_17_~array.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| alloc_17_~array.base) 0))), 5919#(and (or (not (= 0 (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset))) (= 0 (select (select |#memory_$Pointer$.offset| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0))))) (= alloc_17_~array.offset 0) (<= alloc_17_~j~0 0))] [2018-02-02 10:19:18,901 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2018-02-02 10:19:18,901 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-02 10:19:18,901 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-02 10:19:18,901 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2018-02-02 10:19:18,901 INFO L87 Difference]: Start difference. First operand 109 states and 115 transitions. Second operand 15 states. [2018-02-02 10:19:19,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:19:19,126 INFO L93 Difference]: Finished difference Result 133 states and 143 transitions. [2018-02-02 10:19:19,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-02 10:19:19,126 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 87 [2018-02-02 10:19:19,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:19:19,127 INFO L225 Difference]: With dead ends: 133 [2018-02-02 10:19:19,127 INFO L226 Difference]: Without dead ends: 133 [2018-02-02 10:19:19,127 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=505, Unknown=0, NotChecked=0, Total=600 [2018-02-02 10:19:19,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-02-02 10:19:19,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 122. [2018-02-02 10:19:19,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-02-02 10:19:19,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 134 transitions. [2018-02-02 10:19:19,130 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 134 transitions. Word has length 87 [2018-02-02 10:19:19,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:19:19,131 INFO L432 AbstractCegarLoop]: Abstraction has 122 states and 134 transitions. [2018-02-02 10:19:19,131 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-02 10:19:19,131 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 134 transitions. [2018-02-02 10:19:19,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-02-02 10:19:19,131 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:19:19,131 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:19:19,131 INFO L371 AbstractCegarLoop]: === Iteration 30 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 10:19:19,132 INFO L82 PathProgramCache]: Analyzing trace with hash 408705068, now seen corresponding path program 1 times [2018-02-02 10:19:19,132 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:19:19,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:19:19,150 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:19:19,486 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 203 trivial. 0 not checked. [2018-02-02 10:19:19,486 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:19:19,486 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-02-02 10:19:19,487 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:19:19,487 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 10:19:19,487 INFO L182 omatonBuilderFactory]: Interpolants [6208#(and (= 1 (select |#valid| |alloc_17_#t~ret3.base|)) (= alloc_17_~i~0 0) (= alloc_17_~array.offset 0)), 6209#(and (= alloc_17_~i~0 0) (= alloc_17_~array.offset 0) (= 1 (select |#valid| alloc_17_~p~0.base))), 6210#(and (= alloc_17_~i~0 0) (= alloc_17_~array.offset 0) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~i~0)))))), 6211#(and (<= alloc_17_~i~0 1) (= alloc_17_~array.offset 0) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 0)))), 6212#(= |#valid| |old(#valid)|), 6213#(and (= alloc_17_~array.offset 0) (or (not (= 0 (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0)))))) (<= alloc_17_~j~0 0)), 6214#(and (= alloc_17_~array.offset 0) (= 0 (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0)))))), 6215#(= 1 (select |#valid| |alloc_17_#t~mem6.base|)), 6198#true, 6199#false, 6200#(= 0 |ldv_malloc_#t~malloc1.offset|), 6201#(= 0 |ldv_malloc_#res.offset|), 6202#(= 0 |entry_point_#t~ret8.offset|), 6203#(= 0 entry_point_~array~0.offset), 6204#(= 0 |alloc_17_#in~array.offset|), 6205#(and (= alloc_17_~i~0 0) (= alloc_17_~array.offset 0)), 6206#(= 1 (select |#valid| |ldv_malloc_#t~malloc1.base|)), 6207#(= 1 (select |#valid| |ldv_malloc_#res.base|))] [2018-02-02 10:19:19,487 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 203 trivial. 0 not checked. [2018-02-02 10:19:19,487 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-02 10:19:19,488 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-02 10:19:19,488 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=268, Unknown=0, NotChecked=0, Total=306 [2018-02-02 10:19:19,488 INFO L87 Difference]: Start difference. First operand 122 states and 134 transitions. Second operand 18 states. [2018-02-02 10:19:19,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:19:19,791 INFO L93 Difference]: Finished difference Result 127 states and 139 transitions. [2018-02-02 10:19:19,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-02 10:19:19,791 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 87 [2018-02-02 10:19:19,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:19:19,792 INFO L225 Difference]: With dead ends: 127 [2018-02-02 10:19:19,792 INFO L226 Difference]: Without dead ends: 127 [2018-02-02 10:19:19,793 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=110, Invalid=760, Unknown=0, NotChecked=0, Total=870 [2018-02-02 10:19:19,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-02-02 10:19:19,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 124. [2018-02-02 10:19:19,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-02-02 10:19:19,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 136 transitions. [2018-02-02 10:19:19,796 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 136 transitions. Word has length 87 [2018-02-02 10:19:19,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:19:19,797 INFO L432 AbstractCegarLoop]: Abstraction has 124 states and 136 transitions. [2018-02-02 10:19:19,797 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-02 10:19:19,797 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 136 transitions. [2018-02-02 10:19:19,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-02-02 10:19:19,797 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:19:19,797 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:19:19,798 INFO L371 AbstractCegarLoop]: === Iteration 31 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 10:19:19,798 INFO L82 PathProgramCache]: Analyzing trace with hash 1923546252, now seen corresponding path program 1 times [2018-02-02 10:19:19,798 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:19:19,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:19:19,816 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:19:20,145 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 5 proven. 12 refuted. 0 times theorem prover too weak. 202 trivial. 0 not checked. [2018-02-02 10:19:20,146 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:19:20,146 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-02-02 10:19:20,146 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:19:20,146 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 10:19:20,146 INFO L182 omatonBuilderFactory]: Interpolants [6496#(and (= 1 (select |#valid| entry_point_~array~0.base)) (= 0 entry_point_~array~0.offset)), 6497#(and (= 1 (select |#valid| |alloc_17_#in~array.base|)) (= 0 |alloc_17_#in~array.offset|)), 6498#(and (= alloc_17_~i~0 0) (= alloc_17_~array.offset 0) (= 1 (select |#valid| alloc_17_~array.base))), 6499#(= |#valid| |old(#valid)|), 6500#(= 0 (select |old(#valid)| |ldv_malloc_#t~malloc1.base|)), 6501#(= 0 (select |old(#valid)| |ldv_malloc_#res.base|)), 6502#(and (= alloc_17_~i~0 0) (= alloc_17_~array.offset 0) (not (= alloc_17_~array.base |alloc_17_#t~ret3.base|))), 6503#(and (= alloc_17_~i~0 0) (= alloc_17_~array.offset 0) (not (= alloc_17_~array.base alloc_17_~p~0.base))), 6504#(and (= alloc_17_~i~0 0) (= alloc_17_~array.offset 0) (= 1 (select |#valid| alloc_17_~array.base)) (not (= alloc_17_~array.base (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~i~0)))))), 6505#(and (<= alloc_17_~i~0 1) (= alloc_17_~array.offset 0) (= 1 (select |#valid| alloc_17_~array.base)) (not (= alloc_17_~array.base (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 0)))), 6506#(and (= alloc_17_~array.offset 0) (= 1 (select |#valid| alloc_17_~array.base)) (or (not (= alloc_17_~array.base (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0))))) (not (= 0 (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset)))) (<= alloc_17_~j~0 0)), 6507#(and (not (= alloc_17_~array.base (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0))))) (= alloc_17_~array.offset 0) (= 0 (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset)) (= 1 (select |#valid| alloc_17_~array.base))), 6508#(and (not (= alloc_17_~array.base |alloc_17_#t~mem6.base|)) (= 1 (select |#valid| alloc_17_~array.base))), 6509#(= 1 (select |#valid| alloc_17_~array.base)), 6491#true, 6492#false, 6493#(and (= 0 |ldv_malloc_#t~malloc1.offset|) (= 1 (select |#valid| |ldv_malloc_#t~malloc1.base|))), 6494#(and (= 0 |ldv_malloc_#res.offset|) (= 1 (select |#valid| |ldv_malloc_#res.base|))), 6495#(and (= 1 (select |#valid| |entry_point_#t~ret8.base|)) (= 0 |entry_point_#t~ret8.offset|))] [2018-02-02 10:19:20,146 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 5 proven. 12 refuted. 0 times theorem prover too weak. 202 trivial. 0 not checked. [2018-02-02 10:19:20,146 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-02 10:19:20,147 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-02 10:19:20,147 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=298, Unknown=0, NotChecked=0, Total=342 [2018-02-02 10:19:20,147 INFO L87 Difference]: Start difference. First operand 124 states and 136 transitions. Second operand 19 states. [2018-02-02 10:19:20,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:19:20,443 INFO L93 Difference]: Finished difference Result 129 states and 141 transitions. [2018-02-02 10:19:20,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-02 10:19:20,444 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 89 [2018-02-02 10:19:20,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:19:20,445 INFO L225 Difference]: With dead ends: 129 [2018-02-02 10:19:20,445 INFO L226 Difference]: Without dead ends: 129 [2018-02-02 10:19:20,445 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=94, Invalid=608, Unknown=0, NotChecked=0, Total=702 [2018-02-02 10:19:20,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-02-02 10:19:20,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 126. [2018-02-02 10:19:20,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-02-02 10:19:20,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 138 transitions. [2018-02-02 10:19:20,447 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 138 transitions. Word has length 89 [2018-02-02 10:19:20,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:19:20,448 INFO L432 AbstractCegarLoop]: Abstraction has 126 states and 138 transitions. [2018-02-02 10:19:20,448 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-02 10:19:20,448 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 138 transitions. [2018-02-02 10:19:20,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-02-02 10:19:20,449 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:19:20,449 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:19:20,449 INFO L371 AbstractCegarLoop]: === Iteration 32 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 10:19:20,449 INFO L82 PathProgramCache]: Analyzing trace with hash -1757191147, now seen corresponding path program 1 times [2018-02-02 10:19:20,450 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:19:20,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:19:20,456 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:19:20,531 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 209 trivial. 0 not checked. [2018-02-02 10:19:20,531 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:19:20,531 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-02-02 10:19:20,531 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:19:20,531 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-02-02 10:19:20,531 INFO L182 omatonBuilderFactory]: Interpolants [6784#(= 0 |ldv_malloc_#res.offset|), 6785#(= 0 |entry_point_#t~ret8.offset|), 6786#(= 0 entry_point_~array~0.offset), 6787#(or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset)), 6788#(or (not (= |alloc_17_#in~array.offset| 0)) (<= 0 alloc_17_~i~0)), 6789#(or (not (= |alloc_17_#in~array.offset| 0)) (<= 1 alloc_17_~i~0)), 6790#(or (<= 0 alloc_17_~j~0) (not (= |alloc_17_#in~array.offset| 0))), 6791#(not (= |alloc_17_#in~array.offset| 0)), 6781#true, 6782#false, 6783#(= 0 |ldv_malloc_#t~malloc1.offset|)] [2018-02-02 10:19:20,531 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 209 trivial. 0 not checked. [2018-02-02 10:19:20,532 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-02 10:19:20,532 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-02 10:19:20,532 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-02-02 10:19:20,532 INFO L87 Difference]: Start difference. First operand 126 states and 138 transitions. Second operand 11 states. [2018-02-02 10:19:20,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:19:20,617 INFO L93 Difference]: Finished difference Result 128 states and 139 transitions. [2018-02-02 10:19:20,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-02 10:19:20,617 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 93 [2018-02-02 10:19:20,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:19:20,618 INFO L225 Difference]: With dead ends: 128 [2018-02-02 10:19:20,618 INFO L226 Difference]: Without dead ends: 125 [2018-02-02 10:19:20,618 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2018-02-02 10:19:20,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-02-02 10:19:20,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2018-02-02 10:19:20,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-02-02 10:19:20,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 135 transitions. [2018-02-02 10:19:20,620 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 135 transitions. Word has length 93 [2018-02-02 10:19:20,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:19:20,621 INFO L432 AbstractCegarLoop]: Abstraction has 125 states and 135 transitions. [2018-02-02 10:19:20,621 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-02 10:19:20,621 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 135 transitions. [2018-02-02 10:19:20,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-02-02 10:19:20,621 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:19:20,622 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:19:20,622 INFO L371 AbstractCegarLoop]: === Iteration 33 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 10:19:20,622 INFO L82 PathProgramCache]: Analyzing trace with hash 988408539, now seen corresponding path program 1 times [2018-02-02 10:19:20,623 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:19:20,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:19:20,633 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:19:20,675 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 214 trivial. 0 not checked. [2018-02-02 10:19:20,676 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:19:20,676 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-02-02 10:19:20,676 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:19:20,676 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-02-02 10:19:20,676 INFO L182 omatonBuilderFactory]: Interpolants [7056#false, 7057#(= alloc_17_~i~0 0), 7058#(<= alloc_17_~i~0 1), 7059#(<= alloc_17_~j~0 0), 7060#(<= (+ alloc_17_~j~0 1) 0), 7055#true] [2018-02-02 10:19:20,678 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 214 trivial. 0 not checked. [2018-02-02 10:19:20,678 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 10:19:20,678 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 10:19:20,678 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:19:20,679 INFO L87 Difference]: Start difference. First operand 125 states and 135 transitions. Second operand 6 states. [2018-02-02 10:19:20,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:19:20,720 INFO L93 Difference]: Finished difference Result 128 states and 135 transitions. [2018-02-02 10:19:20,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 10:19:20,721 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 94 [2018-02-02 10:19:20,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:19:20,721 INFO L225 Difference]: With dead ends: 128 [2018-02-02 10:19:20,722 INFO L226 Difference]: Without dead ends: 128 [2018-02-02 10:19:20,722 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-02-02 10:19:20,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-02-02 10:19:20,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 121. [2018-02-02 10:19:20,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-02-02 10:19:20,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 128 transitions. [2018-02-02 10:19:20,725 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 128 transitions. Word has length 94 [2018-02-02 10:19:20,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:19:20,725 INFO L432 AbstractCegarLoop]: Abstraction has 121 states and 128 transitions. [2018-02-02 10:19:20,725 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 10:19:20,725 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 128 transitions. [2018-02-02 10:19:20,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-02-02 10:19:20,726 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:19:20,726 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:19:20,726 INFO L371 AbstractCegarLoop]: === Iteration 34 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 10:19:20,726 INFO L82 PathProgramCache]: Analyzing trace with hash -549703530, now seen corresponding path program 2 times [2018-02-02 10:19:20,728 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:19:20,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:19:20,739 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:19:20,794 INFO L134 CoverageAnalysis]: Checked inductivity of 229 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 218 trivial. 0 not checked. [2018-02-02 10:19:20,795 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:19:20,795 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-02-02 10:19:20,795 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:19:20,795 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:19:20,796 INFO L182 omatonBuilderFactory]: Interpolants [7314#true, 7315#false, 7316#(<= 10 entry_point_~len~0), 7317#(and (= alloc_17_~i~0 0) (<= |alloc_17_#in~len| alloc_17_~len)), 7318#(<= (+ alloc_17_~i~0 |alloc_17_#in~len|) (+ alloc_17_~len 1)), 7319#(<= (+ alloc_17_~i~0 |alloc_17_#in~len|) (+ alloc_17_~len 2)), 7320#(<= |alloc_17_#in~len| 2)] [2018-02-02 10:19:20,796 INFO L134 CoverageAnalysis]: Checked inductivity of 229 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 218 trivial. 0 not checked. [2018-02-02 10:19:20,796 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 10:19:20,797 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 10:19:20,797 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-02-02 10:19:20,797 INFO L87 Difference]: Start difference. First operand 121 states and 128 transitions. Second operand 7 states. [2018-02-02 10:19:20,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:19:20,855 INFO L93 Difference]: Finished difference Result 156 states and 166 transitions. [2018-02-02 10:19:20,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 10:19:20,856 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 96 [2018-02-02 10:19:20,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:19:20,857 INFO L225 Difference]: With dead ends: 156 [2018-02-02 10:19:20,857 INFO L226 Difference]: Without dead ends: 153 [2018-02-02 10:19:20,857 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-02-02 10:19:20,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2018-02-02 10:19:20,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 127. [2018-02-02 10:19:20,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-02-02 10:19:20,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 134 transitions. [2018-02-02 10:19:20,860 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 134 transitions. Word has length 96 [2018-02-02 10:19:20,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:19:20,860 INFO L432 AbstractCegarLoop]: Abstraction has 127 states and 134 transitions. [2018-02-02 10:19:20,861 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 10:19:20,861 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 134 transitions. [2018-02-02 10:19:20,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-02-02 10:19:20,861 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:19:20,861 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:19:20,861 INFO L371 AbstractCegarLoop]: === Iteration 35 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 10:19:20,862 INFO L82 PathProgramCache]: Analyzing trace with hash -659963202, now seen corresponding path program 1 times [2018-02-02 10:19:20,862 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:19:20,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:19:20,872 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:19:20,926 INFO L134 CoverageAnalysis]: Checked inductivity of 221 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 219 trivial. 0 not checked. [2018-02-02 10:19:20,926 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:19:20,926 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-02-02 10:19:20,927 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:19:20,927 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-02-02 10:19:20,927 INFO L182 omatonBuilderFactory]: Interpolants [7606#true, 7607#false, 7608#(= alloc_17_~array.base |alloc_17_#in~array.base|), 7609#(= 1 (select |#valid| |alloc_17_#in~array.base|)), 7610#(= 1 (select |#valid| entry_point_~array~0.base))] [2018-02-02 10:19:20,927 INFO L134 CoverageAnalysis]: Checked inductivity of 221 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 219 trivial. 0 not checked. [2018-02-02 10:19:20,927 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 10:19:20,928 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 10:19:20,928 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:19:20,928 INFO L87 Difference]: Start difference. First operand 127 states and 134 transitions. Second operand 5 states. [2018-02-02 10:19:20,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:19:20,969 INFO L93 Difference]: Finished difference Result 127 states and 134 transitions. [2018-02-02 10:19:20,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 10:19:20,970 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 97 [2018-02-02 10:19:20,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:19:20,970 INFO L225 Difference]: With dead ends: 127 [2018-02-02 10:19:20,971 INFO L226 Difference]: Without dead ends: 127 [2018-02-02 10:19:20,971 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:19:20,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-02-02 10:19:20,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 122. [2018-02-02 10:19:20,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-02-02 10:19:20,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 129 transitions. [2018-02-02 10:19:20,974 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 129 transitions. Word has length 97 [2018-02-02 10:19:20,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:19:20,974 INFO L432 AbstractCegarLoop]: Abstraction has 122 states and 129 transitions. [2018-02-02 10:19:20,974 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 10:19:20,974 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 129 transitions. [2018-02-02 10:19:20,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-02-02 10:19:20,975 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:19:20,975 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:19:20,975 INFO L371 AbstractCegarLoop]: === Iteration 36 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 10:19:20,976 INFO L82 PathProgramCache]: Analyzing trace with hash -797207824, now seen corresponding path program 2 times [2018-02-02 10:19:20,976 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:19:20,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:19:21,002 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:19:21,299 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 36 proven. 89 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2018-02-02 10:19:21,299 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:19:21,299 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-02-02 10:19:21,300 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:19:21,300 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-02-02 10:19:21,300 INFO L182 omatonBuilderFactory]: Interpolants [7872#(= 0 |alloc_17_#in~array.offset|), 7873#(and (= alloc_17_~i~0 0) (= alloc_17_~array.offset 0)), 7874#(= alloc_17_~array.offset 0), 7875#(and (= alloc_17_~array.offset 0) (= 0 |alloc_17_#t~ret3.offset|)), 7876#(and (= alloc_17_~array.offset 0) (= 0 alloc_17_~p~0.offset)), 7877#(and (= alloc_17_~array.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| alloc_17_~array.base) (* 4 alloc_17_~i~0)))), 7878#(and (= alloc_17_~array.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| alloc_17_~array.base) (+ (* 4 alloc_17_~i~0) (- 4))))), 7879#(and (= alloc_17_~array.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0))))), 7880#(= 0 |alloc_17_#t~mem6.offset|), 7862#true, 7863#false, 7864#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10)), 7865#(= 0 |ldv_malloc_#t~malloc1.offset|), 7866#(= 0 |ldv_malloc_#res.offset|), 7867#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10) (= 0 |entry_point_#t~ret8.offset|)), 7868#(and (<= 10 entry_point_~len~0) (= entry_point_~array~0.offset 0) (<= entry_point_~len~0 10)), 7869#(= entry_point_~array~0.offset 0), 7870#(and (<= (+ (* 4 entry_point_~i~1) 4) (* 4 entry_point_~len~0)) (= entry_point_~array~0.offset 0)), 7871#(and (<= (* 4 entry_point_~i~1) (* 4 entry_point_~len~0)) (= entry_point_~array~0.offset 0))] [2018-02-02 10:19:21,300 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 36 proven. 89 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2018-02-02 10:19:21,300 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-02 10:19:21,300 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-02 10:19:21,300 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2018-02-02 10:19:21,300 INFO L87 Difference]: Start difference. First operand 122 states and 129 transitions. Second operand 19 states. [2018-02-02 10:19:21,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:19:21,508 INFO L93 Difference]: Finished difference Result 128 states and 135 transitions. [2018-02-02 10:19:21,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-02 10:19:21,508 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 100 [2018-02-02 10:19:21,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:19:21,509 INFO L225 Difference]: With dead ends: 128 [2018-02-02 10:19:21,509 INFO L226 Difference]: Without dead ends: 128 [2018-02-02 10:19:21,509 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 3 SyntacticMatches, 9 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 218 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=142, Invalid=850, Unknown=0, NotChecked=0, Total=992 [2018-02-02 10:19:21,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-02-02 10:19:21,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 124. [2018-02-02 10:19:21,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-02-02 10:19:21,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 132 transitions. [2018-02-02 10:19:21,511 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 132 transitions. Word has length 100 [2018-02-02 10:19:21,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:19:21,511 INFO L432 AbstractCegarLoop]: Abstraction has 124 states and 132 transitions. [2018-02-02 10:19:21,511 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-02 10:19:21,511 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 132 transitions. [2018-02-02 10:19:21,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-02-02 10:19:21,512 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:19:21,512 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:19:21,512 INFO L371 AbstractCegarLoop]: === Iteration 37 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 10:19:21,512 INFO L82 PathProgramCache]: Analyzing trace with hash -797207823, now seen corresponding path program 2 times [2018-02-02 10:19:21,513 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:19:21,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:19:21,529 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:19:21,973 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 44 proven. 92 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2018-02-02 10:19:21,974 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:19:21,974 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-02-02 10:19:21,974 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:19:21,974 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-02-02 10:19:21,974 INFO L182 omatonBuilderFactory]: Interpolants [8160#false, 8161#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10)), 8162#(= 0 |ldv_malloc_#t~malloc1.offset|), 8163#(= 0 |ldv_malloc_#res.offset|), 8164#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10) (= 0 |entry_point_#t~ret8.offset|)), 8165#(and (<= 10 entry_point_~len~0) (= entry_point_~array~0.offset 0) (<= entry_point_~len~0 10)), 8166#(= entry_point_~array~0.offset 0), 8167#(and (<= (+ (* 4 entry_point_~i~1) 4) (* 4 entry_point_~len~0)) (= entry_point_~array~0.offset 0)), 8168#(and (<= (* 4 entry_point_~i~1) (* 4 entry_point_~len~0)) (= entry_point_~array~0.offset 0)), 8169#(= 0 |alloc_17_#in~array.offset|), 8170#(and (= alloc_17_~i~0 0) (= alloc_17_~array.offset 0)), 8171#(= alloc_17_~array.offset 0), 8172#(= 1 (select |#valid| |ldv_malloc_#t~malloc1.base|)), 8173#(= 1 (select |#valid| |ldv_malloc_#res.base|)), 8174#(and (= 1 (select |#valid| |alloc_17_#t~ret3.base|)) (= alloc_17_~array.offset 0)), 8175#(and (= alloc_17_~array.offset 0) (= 1 (select |#valid| alloc_17_~p~0.base))), 8176#(and (= alloc_17_~array.offset 0) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (* 4 alloc_17_~i~0))))), 8177#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~i~0) (- 4))))) (= alloc_17_~array.offset 0)), 8178#(= |#valid| |old(#valid)|), 8179#(and (= alloc_17_~array.offset 0) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0)))))), 8180#(= 1 (select |#valid| |alloc_17_#t~mem6.base|)), 8159#true] [2018-02-02 10:19:21,974 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 44 proven. 92 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2018-02-02 10:19:21,974 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-02 10:19:21,974 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-02 10:19:21,974 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=409, Unknown=0, NotChecked=0, Total=462 [2018-02-02 10:19:21,975 INFO L87 Difference]: Start difference. First operand 124 states and 132 transitions. Second operand 22 states. [2018-02-02 10:19:22,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:19:22,337 INFO L93 Difference]: Finished difference Result 126 states and 133 transitions. [2018-02-02 10:19:22,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-02-02 10:19:22,337 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 100 [2018-02-02 10:19:22,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:19:22,338 INFO L225 Difference]: With dead ends: 126 [2018-02-02 10:19:22,338 INFO L226 Difference]: Without dead ends: 126 [2018-02-02 10:19:22,338 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 3 SyntacticMatches, 9 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 382 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=182, Invalid=1458, Unknown=0, NotChecked=0, Total=1640 [2018-02-02 10:19:22,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-02-02 10:19:22,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 124. [2018-02-02 10:19:22,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-02-02 10:19:22,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 131 transitions. [2018-02-02 10:19:22,342 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 131 transitions. Word has length 100 [2018-02-02 10:19:22,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:19:22,342 INFO L432 AbstractCegarLoop]: Abstraction has 124 states and 131 transitions. [2018-02-02 10:19:22,342 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-02 10:19:22,342 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 131 transitions. [2018-02-02 10:19:22,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-02-02 10:19:22,343 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:19:22,343 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:19:22,343 INFO L371 AbstractCegarLoop]: === Iteration 38 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 10:19:22,343 INFO L82 PathProgramCache]: Analyzing trace with hash 1396569988, now seen corresponding path program 1 times [2018-02-02 10:19:22,344 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:19:22,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:19:22,366 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:19:23,598 INFO L134 CoverageAnalysis]: Checked inductivity of 221 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2018-02-02 10:19:23,598 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:19:23,599 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-02-02 10:19:23,599 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:19:23,599 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-02-02 10:19:23,599 INFO L182 omatonBuilderFactory]: Interpolants [8480#(and (or (not (= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) 0)) (not (= alloc_17_~array.offset 0)) (and (= |#valid| (store |old(#valid)| |alloc_17_#t~ret3.base| (select |#valid| |alloc_17_#t~ret3.base|))) (not (= 0 |alloc_17_#t~ret3.base|)) (= (select |old(#valid)| |alloc_17_#t~ret3.base|) 0))) (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset))), 8481#(and (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset)) (or (not (= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) 0)) (and (= |#valid| (store |old(#valid)| alloc_17_~p~0.base (select |#valid| alloc_17_~p~0.base))) (= 0 (select |old(#valid)| alloc_17_~p~0.base)) (not (= 0 alloc_17_~p~0.base))) (not (= alloc_17_~array.offset 0)))), 8482#(and (or (and (or (= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) 0) (< 0 (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset))) (or (and (not (= 0 (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~i~0))))) (= |#valid| (store |old(#valid)| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset)) (select |#valid| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset))))) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~i~0)))))) (not (= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) 0)))) (not (= alloc_17_~array.offset 0))) (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset))), 8483#(and (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset)) (or (and (not (= 0 (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 0))) (= |#valid| (store |old(#valid)| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 0) (select |#valid| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 0)))) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 0)))) (<= 5 (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset)) (not (= alloc_17_~array.offset 0)))), 8484#(and (or (not (= 0 (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset))) (not (= alloc_17_~array.offset 0)) (and (not (= 0 (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0))))) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0))))) (= |#valid| (store |old(#valid)| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset)) (select |#valid| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset))))))) (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset))), 8485#(and (or (and (<= 0 alloc_17_~j~0) (or (not (= 0 (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset))) (and (not (= 0 (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0))))) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0))))) (= |#valid| (store |old(#valid)| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset)) (select |#valid| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset)))))))) (not (= alloc_17_~array.offset 0))) (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset))), 8486#(and (or (and (or (not (= 0 (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset))) (and (not (= 0 |alloc_17_#t~mem6.base|)) (= (store |#valid| |alloc_17_#t~mem6.base| 0) (store |old(#valid)| |alloc_17_#t~mem6.base| (select (store |#valid| |alloc_17_#t~mem6.base| 0) |alloc_17_#t~mem6.base|))) (= 0 (select |old(#valid)| |alloc_17_#t~mem6.base|)))) (<= 0 (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset))) (not (= alloc_17_~array.offset 0))) (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset))), 8487#(and (or (and (<= 0 (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset)) (or (not (= 0 (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset))) (= |#valid| |old(#valid)|))) (not (= alloc_17_~array.offset 0))) (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset))), 8488#(or (<= 1 alloc_17_~j~0) (not (= |alloc_17_#in~array.offset| 0)) (= |#valid| |old(#valid)|)), 8489#(or (<= 0 alloc_17_~j~0) (not (= |alloc_17_#in~array.offset| 0)) (= |#valid| |old(#valid)|)), 8490#(or (not (= |alloc_17_#in~array.offset| 0)) (= |#valid| |old(#valid)|)), 8491#(and (not (= entry_point_~array~0.base 0)) (= (select |old(#valid)| entry_point_~array~0.base) (select (store |#valid| entry_point_~array~0.base 0) entry_point_~array~0.base)) (= (store |old(#valid)| entry_point_~array~0.base (select (store |#valid| entry_point_~array~0.base 0) entry_point_~array~0.base)) (store |#valid| entry_point_~array~0.base 0))), 8470#true, 8471#false, 8472#(= |#valid| |old(#valid)|), 8473#(and (not (= 0 |ldv_malloc_#t~malloc1.base|)) (= (select |#valid| |ldv_malloc_#t~malloc1.base|) 1) (= 0 |ldv_malloc_#t~malloc1.offset|) (= (store |old(#valid)| |ldv_malloc_#t~malloc1.base| (select |#valid| |ldv_malloc_#t~malloc1.base|)) |#valid|) (= (select |old(#valid)| |ldv_malloc_#t~malloc1.base|) 0)), 8474#(and (= (select |old(#valid)| |ldv_malloc_#res.base|) 0) (= 0 |ldv_malloc_#res.offset|) (not (= 0 |ldv_malloc_#res.base|)) (= (select |#valid| |ldv_malloc_#res.base|) 1) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))), 8475#(and (= (select |#valid| |entry_point_#t~ret8.base|) 1) (= (select |old(#valid)| |entry_point_#t~ret8.base|) 0) (= 0 |entry_point_#t~ret8.offset|) (not (= 0 |entry_point_#t~ret8.base|)) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))), 8476#(and (= (select |old(#valid)| entry_point_~array~0.base) 0) (= 0 entry_point_~array~0.offset) (= (select |#valid| entry_point_~array~0.base) 1) (not (= 0 entry_point_~array~0.base)) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))), 8477#(and (or (= |#valid| |old(#valid)|) (not (= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) 0)) (not (= alloc_17_~array.offset 0))) (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset))), 8478#(and (not (= 0 |ldv_malloc_#t~malloc1.base|)) (= (store |old(#valid)| |ldv_malloc_#t~malloc1.base| (select |#valid| |ldv_malloc_#t~malloc1.base|)) |#valid|) (= (select |old(#valid)| |ldv_malloc_#t~malloc1.base|) 0)), 8479#(and (= 0 (select |old(#valid)| |ldv_malloc_#res.base|)) (= |#valid| (store |old(#valid)| |ldv_malloc_#res.base| (select |#valid| |ldv_malloc_#res.base|))) (not (= 0 |ldv_malloc_#res.base|)))] [2018-02-02 10:19:23,599 INFO L134 CoverageAnalysis]: Checked inductivity of 221 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2018-02-02 10:19:23,599 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-02 10:19:23,600 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-02 10:19:23,600 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=407, Unknown=0, NotChecked=0, Total=462 [2018-02-02 10:19:23,600 INFO L87 Difference]: Start difference. First operand 124 states and 131 transitions. Second operand 22 states. [2018-02-02 10:19:24,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:19:24,743 INFO L93 Difference]: Finished difference Result 140 states and 147 transitions. [2018-02-02 10:19:24,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-02 10:19:24,744 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 100 [2018-02-02 10:19:24,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:19:24,744 INFO L225 Difference]: With dead ends: 140 [2018-02-02 10:19:24,744 INFO L226 Difference]: Without dead ends: 120 [2018-02-02 10:19:24,744 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 8 SyntacticMatches, 4 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=148, Invalid=974, Unknown=0, NotChecked=0, Total=1122 [2018-02-02 10:19:24,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-02-02 10:19:24,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 117. [2018-02-02 10:19:24,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-02-02 10:19:24,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 124 transitions. [2018-02-02 10:19:24,746 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 124 transitions. Word has length 100 [2018-02-02 10:19:24,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:19:24,746 INFO L432 AbstractCegarLoop]: Abstraction has 117 states and 124 transitions. [2018-02-02 10:19:24,746 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-02 10:19:24,746 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 124 transitions. [2018-02-02 10:19:24,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-02-02 10:19:24,747 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:19:24,747 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:19:24,747 INFO L371 AbstractCegarLoop]: === Iteration 39 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 10:19:24,747 INFO L82 PathProgramCache]: Analyzing trace with hash -1612539375, now seen corresponding path program 2 times [2018-02-02 10:19:24,748 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:19:24,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:19:24,764 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:19:25,286 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 48 proven. 92 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2018-02-02 10:19:25,286 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:19:25,286 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-02-02 10:19:25,286 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:19:25,287 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 13 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-02-02 10:19:25,287 INFO L182 omatonBuilderFactory]: Interpolants [8773#true, 8774#false, 8775#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10)), 8776#(= 0 |ldv_malloc_#t~malloc1.offset|), 8777#(= 0 |ldv_malloc_#res.offset|), 8778#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10) (= 0 |entry_point_#t~ret8.offset|)), 8779#(and (<= 10 entry_point_~len~0) (= entry_point_~array~0.offset 0) (<= entry_point_~len~0 10)), 8780#(= entry_point_~array~0.offset 0), 8781#(and (<= (+ (* 4 entry_point_~i~1) 4) (* 4 entry_point_~len~0)) (= entry_point_~array~0.offset 0)), 8782#(and (<= (* 4 entry_point_~i~1) (* 4 entry_point_~len~0)) (= entry_point_~array~0.offset 0)), 8783#(= 0 |alloc_17_#in~array.offset|), 8784#(and (= alloc_17_~i~0 0) (= alloc_17_~array.offset 0)), 8785#(and (= alloc_17_~i~0 0) (= alloc_17_~array.offset 0) (= 1 (select |#valid| alloc_17_~array.base))), 8786#(and (= alloc_17_~array.offset 0) (= 1 (select |#valid| alloc_17_~array.base))), 8787#(= |#valid| |old(#valid)|), 8788#(= 0 (select |old(#valid)| |ldv_malloc_#t~malloc1.base|)), 8789#(= 0 (select |old(#valid)| |ldv_malloc_#res.base|)), 8790#(and (= alloc_17_~array.offset 0) (not (= alloc_17_~array.base |alloc_17_#t~ret3.base|))), 8791#(and (= alloc_17_~array.offset 0) (not (= alloc_17_~array.base alloc_17_~p~0.base))), 8792#(and (= alloc_17_~array.offset 0) (= 1 (select |#valid| alloc_17_~array.base)) (not (= alloc_17_~array.base (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (* 4 alloc_17_~i~0))))), 8793#(and (= alloc_17_~array.offset 0) (= 1 (select |#valid| alloc_17_~array.base)) (not (= alloc_17_~array.base (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~i~0) (- 4)))))), 8794#(and (not (= alloc_17_~array.base (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0))))) (= alloc_17_~array.offset 0) (= 1 (select |#valid| alloc_17_~array.base))), 8795#(and (not (= alloc_17_~array.base |alloc_17_#t~mem6.base|)) (= 1 (select |#valid| alloc_17_~array.base))), 8796#(= 1 (select |#valid| alloc_17_~array.base))] [2018-02-02 10:19:25,287 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 48 proven. 92 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2018-02-02 10:19:25,287 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-02-02 10:19:25,287 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-02-02 10:19:25,288 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=490, Unknown=0, NotChecked=0, Total=552 [2018-02-02 10:19:25,288 INFO L87 Difference]: Start difference. First operand 117 states and 124 transitions. Second operand 24 states. [2018-02-02 10:19:25,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:19:25,741 INFO L93 Difference]: Finished difference Result 123 states and 129 transitions. [2018-02-02 10:19:25,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-02-02 10:19:25,741 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 102 [2018-02-02 10:19:25,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:19:25,742 INFO L225 Difference]: With dead ends: 123 [2018-02-02 10:19:25,742 INFO L226 Difference]: Without dead ends: 123 [2018-02-02 10:19:25,743 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 4 SyntacticMatches, 9 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 498 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=213, Invalid=1857, Unknown=0, NotChecked=0, Total=2070 [2018-02-02 10:19:25,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-02-02 10:19:25,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 117. [2018-02-02 10:19:25,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-02-02 10:19:25,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 123 transitions. [2018-02-02 10:19:25,746 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 123 transitions. Word has length 102 [2018-02-02 10:19:25,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:19:25,746 INFO L432 AbstractCegarLoop]: Abstraction has 117 states and 123 transitions. [2018-02-02 10:19:25,746 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-02-02 10:19:25,746 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 123 transitions. [2018-02-02 10:19:25,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-02-02 10:19:25,747 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:19:25,747 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:19:25,747 INFO L371 AbstractCegarLoop]: === Iteration 40 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 10:19:25,747 INFO L82 PathProgramCache]: Analyzing trace with hash -430114699, now seen corresponding path program 1 times [2018-02-02 10:19:25,748 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:19:25,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:19:25,772 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:19:26,168 INFO L134 CoverageAnalysis]: Checked inductivity of 251 backedges. 1 proven. 30 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2018-02-02 10:19:26,168 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:19:26,168 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-02-02 10:19:26,168 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:19:26,168 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-02-02 10:19:26,169 INFO L182 omatonBuilderFactory]: Interpolants [9088#(= 0 |alloc_17_#in~array.offset|), 9089#(and (= alloc_17_~i~0 0) (= alloc_17_~array.offset 0)), 9090#(and (= alloc_17_~i~0 0) (= alloc_17_~array.offset 0) (= 0 |alloc_17_#t~ret3.offset|)), 9091#(and (= alloc_17_~i~0 0) (= alloc_17_~array.offset 0) (= 0 alloc_17_~p~0.offset)), 9092#(and (= alloc_17_~i~0 0) (= alloc_17_~array.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~i~0))))), 9093#(and (<= (+ (div (+ 0 (- alloc_17_~array.offset)) 4) 1) alloc_17_~i~0) (<= alloc_17_~i~0 1) (= alloc_17_~array.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| alloc_17_~array.base) 0))), 9094#(and (<= alloc_17_~i~0 2) (= alloc_17_~array.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| alloc_17_~array.base) 0)) (<= (+ (div (+ 0 (- alloc_17_~array.offset)) 4) 2) alloc_17_~i~0)), 9095#(and (= alloc_17_~array.offset 0) (<= alloc_17_~j~0 1) (= 0 (select (store (select |#memory_$Pointer$.offset| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0)) 0) 0))), 9096#(and (= alloc_17_~array.offset 0) (<= alloc_17_~j~0 1) (= 0 (select (select |#memory_$Pointer$.offset| alloc_17_~array.base) 0))), 9097#(and (or (not (= 0 (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset))) (= 0 (select (select |#memory_$Pointer$.offset| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0))))) (= alloc_17_~array.offset 0) (<= alloc_17_~j~0 0)), 9098#(and (= alloc_17_~array.offset 0) (= 0 (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset)) (= 0 (select (select |#memory_$Pointer$.offset| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0))))), 9099#(= 0 |alloc_17_#t~mem6.offset|), 9082#true, 9083#false, 9084#(= 0 |ldv_malloc_#t~malloc1.offset|), 9085#(= 0 |ldv_malloc_#res.offset|), 9086#(= 0 |entry_point_#t~ret8.offset|), 9087#(= 0 entry_point_~array~0.offset)] [2018-02-02 10:19:26,169 INFO L134 CoverageAnalysis]: Checked inductivity of 251 backedges. 1 proven. 30 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2018-02-02 10:19:26,169 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-02 10:19:26,169 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-02 10:19:26,169 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=266, Unknown=0, NotChecked=0, Total=306 [2018-02-02 10:19:26,169 INFO L87 Difference]: Start difference. First operand 117 states and 123 transitions. Second operand 18 states. [2018-02-02 10:19:26,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:19:26,531 INFO L93 Difference]: Finished difference Result 146 states and 155 transitions. [2018-02-02 10:19:26,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-02-02 10:19:26,531 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 107 [2018-02-02 10:19:26,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:19:26,532 INFO L225 Difference]: With dead ends: 146 [2018-02-02 10:19:26,532 INFO L226 Difference]: Without dead ends: 146 [2018-02-02 10:19:26,532 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=132, Invalid=798, Unknown=0, NotChecked=0, Total=930 [2018-02-02 10:19:26,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-02-02 10:19:26,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 137. [2018-02-02 10:19:26,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-02-02 10:19:26,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 148 transitions. [2018-02-02 10:19:26,535 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 148 transitions. Word has length 107 [2018-02-02 10:19:26,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:19:26,535 INFO L432 AbstractCegarLoop]: Abstraction has 137 states and 148 transitions. [2018-02-02 10:19:26,535 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-02 10:19:26,535 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 148 transitions. [2018-02-02 10:19:26,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-02-02 10:19:26,536 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:19:26,536 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:19:26,537 INFO L371 AbstractCegarLoop]: === Iteration 41 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 10:19:26,537 INFO L82 PathProgramCache]: Analyzing trace with hash -430114698, now seen corresponding path program 2 times [2018-02-02 10:19:26,537 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:19:26,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:19:26,560 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:19:27,955 INFO L134 CoverageAnalysis]: Checked inductivity of 251 backedges. 10 proven. 134 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2018-02-02 10:19:27,956 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:19:27,956 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2018-02-02 10:19:27,956 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:19:27,956 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 10 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-02-02 10:19:27,956 INFO L182 omatonBuilderFactory]: Interpolants [9409#true, 9410#false, 9411#(= 0 (select |#valid| 0)), 9412#(and (<= 10 entry_point_~len~0) (= 0 (select |#valid| 0)) (<= entry_point_~len~0 10)), 9413#(= (select |old(#valid)| 0) (select |#valid| 0)), 9414#(and (= (select |old(#valid)| 0) (select |#valid| 0)) (= 0 |ldv_malloc_#t~malloc1.offset|)), 9415#(and (= 0 |ldv_malloc_#res.offset|) (= (select |old(#valid)| 0) (select |#valid| 0))), 9416#(and (<= 10 entry_point_~len~0) (= 0 (select |#valid| 0)) (<= entry_point_~len~0 10) (= 0 |entry_point_#t~ret8.offset|)), 9417#(and (<= 10 entry_point_~len~0) (= 0 (select |#valid| 0)) (= entry_point_~array~0.offset 0) (<= entry_point_~len~0 10)), 9418#(and (= entry_point_~array~0.offset 0) (= 0 (select |#valid| 0))), 9419#(and (<= (+ (* 4 entry_point_~i~1) 4) (* 4 entry_point_~len~0)) (or (<= (+ (* 4 entry_point_~i~1) 5) (* 4 entry_point_~len~0)) (= 0 (select |#valid| 0))) (= entry_point_~array~0.offset 0)), 9420#(and (or (<= (+ (* 4 entry_point_~i~1) 1) (* 4 entry_point_~len~0)) (and (<= (* 4 entry_point_~i~1) (* 4 entry_point_~len~0)) (= 0 (select |#valid| 0)))) (= entry_point_~array~0.offset 0)), 9421#(and (= 0 (select |#valid| 0)) (= 0 |alloc_17_#in~array.offset|)), 9422#(and (= alloc_17_~i~0 0) (= alloc_17_~array.offset 0) (= 0 (select |#valid| 0))), 9423#(and (= (select |old(#valid)| 0) (select |#valid| 0)) (= 1 (select |#valid| |ldv_malloc_#t~malloc1.base|))), 9424#(and (= (select |old(#valid)| 0) (select |#valid| 0)) (= 1 (select |#valid| |ldv_malloc_#res.base|))), 9425#(and (= 1 (select |#valid| |alloc_17_#t~ret3.base|)) (= alloc_17_~i~0 0) (= alloc_17_~array.offset 0) (= 0 (select |#valid| 0))), 9426#(and (= alloc_17_~i~0 0) (= alloc_17_~array.offset 0) (= 1 (select |#valid| alloc_17_~p~0.base)) (= 0 (select |#valid| 0))), 9427#(and (= alloc_17_~i~0 0) (= alloc_17_~array.offset 0) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~i~0))))) (= 0 (select |#valid| 0))), 9428#(and (or (and (= 0 (select |#valid| 0)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 0)))) (<= (* 4 alloc_17_~i~0) 3)) (= alloc_17_~array.offset 0) (<= (* 4 alloc_17_~i~0) 4)), 9429#(= |#valid| |old(#valid)|), 9430#(and (not (= 0 |ldv_malloc_#t~malloc1.base|)) (= (store |old(#valid)| |ldv_malloc_#t~malloc1.base| (select |#valid| |ldv_malloc_#t~malloc1.base|)) |#valid|) (= (select |old(#valid)| |ldv_malloc_#t~malloc1.base|) 0)), 9431#(and (= (select |old(#valid)| |ldv_malloc_#res.base|) 0) (not (= 0 |ldv_malloc_#res.base|)) (or (= |#valid| |old(#valid)|) (= |ldv_malloc_#res.base| (@diff |old(#valid)| |#valid|))) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))), 9432#(and (= alloc_17_~array.offset 0) (or (and (= 0 (select |#valid| 0)) (not (= 0 |alloc_17_#t~ret3.base|)) (<= (* 4 alloc_17_~i~0) 4) (not (= |alloc_17_#t~ret3.base| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 0))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 0)))) (<= (* 4 alloc_17_~i~0) 3))), 9433#(and (= alloc_17_~array.offset 0) (or (and (not (= 0 alloc_17_~p~0.base)) (= 0 (select |#valid| 0)) (<= (* 4 alloc_17_~i~0) 4) (not (= alloc_17_~p~0.base (select (store (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) alloc_17_~p~0.base) 0))) (= 1 (select |#valid| (select (store (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) alloc_17_~p~0.base) 0)))) (<= (* 4 alloc_17_~i~0) 3))), 9434#(and (or (and (= 0 (select |#valid| 0)) (not (= (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (* 4 alloc_17_~i~0)) (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 0))) (not (= 0 (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (* 4 alloc_17_~i~0)))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 0)))) (<= (* 4 alloc_17_~i~0) 3)) (= alloc_17_~array.offset 0) (<= (* 4 alloc_17_~i~0) 4)), 9435#(and (= alloc_17_~array.offset 0) (or (<= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) 7) (and (not (= (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~i~0) (- 4))) (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 0))) (<= (* 4 alloc_17_~i~0) 8) (= 0 (select |#valid| 0)) (not (= 0 (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~i~0) (- 4))))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 0)))))), 9436#(and (or (<= (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset) 3) (and (= 1 (select |#valid| (select (store (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0)) 0) 0))) (not (= 0 (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0))))) (<= alloc_17_~j~0 1) (not (= (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0))) (select (store (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0)) 0) 0))) (= 0 (select |#valid| 0)))) (= alloc_17_~array.offset 0)), 9437#(and (= alloc_17_~array.offset 0) (or (<= (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset) 3) (and (not (= 0 |alloc_17_#t~mem6.base|)) (or (= 0 (select |#valid| |alloc_17_#t~mem6.base|)) (and (<= alloc_17_~j~0 1) (or (not (= 1 (select |#valid| |alloc_17_#t~mem6.base|))) (= 1 (select (store |#valid| |alloc_17_#t~mem6.base| 0) (select (store (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0)) 0) 0))))))))), 9438#(and (= alloc_17_~array.offset 0) (or (<= (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset) 3) (and (= 1 (select |#valid| (select (store (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0)) 0) 0))) (<= alloc_17_~j~0 1)))), 9439#(and (= alloc_17_~array.offset 0) (or (and (not (= 0 (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset))) (<= alloc_17_~j~0 0)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0))))))), 9440#(and (= alloc_17_~array.offset 0) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0)))))), 9441#(= 1 (select |#valid| |alloc_17_#t~mem6.base|))] [2018-02-02 10:19:27,956 INFO L134 CoverageAnalysis]: Checked inductivity of 251 backedges. 10 proven. 134 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2018-02-02 10:19:27,957 INFO L409 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-02-02 10:19:27,957 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-02-02 10:19:27,957 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=941, Unknown=0, NotChecked=0, Total=1056 [2018-02-02 10:19:27,957 INFO L87 Difference]: Start difference. First operand 137 states and 148 transitions. Second operand 33 states. [2018-02-02 10:19:29,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:19:29,285 INFO L93 Difference]: Finished difference Result 145 states and 154 transitions. [2018-02-02 10:19:29,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-02-02 10:19:29,286 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 107 [2018-02-02 10:19:29,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:19:29,287 INFO L225 Difference]: With dead ends: 145 [2018-02-02 10:19:29,287 INFO L226 Difference]: Without dead ends: 145 [2018-02-02 10:19:29,287 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 5 SyntacticMatches, 11 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1091 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=456, Invalid=3326, Unknown=0, NotChecked=0, Total=3782 [2018-02-02 10:19:29,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-02-02 10:19:29,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 137. [2018-02-02 10:19:29,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-02-02 10:19:29,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 147 transitions. [2018-02-02 10:19:29,290 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 147 transitions. Word has length 107 [2018-02-02 10:19:29,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:19:29,290 INFO L432 AbstractCegarLoop]: Abstraction has 137 states and 147 transitions. [2018-02-02 10:19:29,291 INFO L433 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-02-02 10:19:29,291 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 147 transitions. [2018-02-02 10:19:29,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-02-02 10:19:29,291 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:19:29,292 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:19:29,292 INFO L371 AbstractCegarLoop]: === Iteration 42 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 10:19:29,292 INFO L82 PathProgramCache]: Analyzing trace with hash 2049065841, now seen corresponding path program 3 times [2018-02-02 10:19:29,293 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:19:29,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:19:29,312 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:19:29,376 INFO L134 CoverageAnalysis]: Checked inductivity of 263 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 236 trivial. 0 not checked. [2018-02-02 10:19:29,376 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:19:29,376 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-02-02 10:19:29,377 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:19:29,377 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-02-02 10:19:29,377 INFO L182 omatonBuilderFactory]: Interpolants [9782#true, 9783#false, 9784#(<= 10 entry_point_~len~0), 9785#(and (= alloc_17_~i~0 0) (<= |alloc_17_#in~len| alloc_17_~len)), 9786#(<= (+ alloc_17_~i~0 |alloc_17_#in~len|) (+ alloc_17_~len 1)), 9787#(<= (+ alloc_17_~i~0 |alloc_17_#in~len|) (+ alloc_17_~len 2)), 9788#(<= (+ alloc_17_~i~0 |alloc_17_#in~len|) (+ alloc_17_~len 3)), 9789#(<= |alloc_17_#in~len| 3)] [2018-02-02 10:19:29,377 INFO L134 CoverageAnalysis]: Checked inductivity of 263 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 236 trivial. 0 not checked. [2018-02-02 10:19:29,377 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 10:19:29,377 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 10:19:29,377 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-02-02 10:19:29,378 INFO L87 Difference]: Start difference. First operand 137 states and 147 transitions. Second operand 8 states. [2018-02-02 10:19:29,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:19:29,429 INFO L93 Difference]: Finished difference Result 180 states and 192 transitions. [2018-02-02 10:19:29,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 10:19:29,429 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 109 [2018-02-02 10:19:29,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:19:29,430 INFO L225 Difference]: With dead ends: 180 [2018-02-02 10:19:29,430 INFO L226 Difference]: Without dead ends: 177 [2018-02-02 10:19:29,430 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2018-02-02 10:19:29,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2018-02-02 10:19:29,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 143. [2018-02-02 10:19:29,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-02-02 10:19:29,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 153 transitions. [2018-02-02 10:19:29,433 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 153 transitions. Word has length 109 [2018-02-02 10:19:29,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:19:29,433 INFO L432 AbstractCegarLoop]: Abstraction has 143 states and 153 transitions. [2018-02-02 10:19:29,433 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 10:19:29,433 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 153 transitions. [2018-02-02 10:19:29,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-02-02 10:19:29,433 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:19:29,433 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:19:29,434 INFO L371 AbstractCegarLoop]: === Iteration 43 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 10:19:29,434 INFO L82 PathProgramCache]: Analyzing trace with hash -1023364522, now seen corresponding path program 1 times [2018-02-02 10:19:29,434 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:19:29,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:19:29,452 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:19:30,255 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 6 proven. 136 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2018-02-02 10:19:30,256 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:19:30,256 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-02-02 10:19:30,256 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:19:30,256 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 14 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-02-02 10:19:30,256 INFO L182 omatonBuilderFactory]: Interpolants [10115#true, 10116#false, 10117#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10)), 10118#(and (= (select |#valid| |ldv_malloc_#t~malloc1.base|) 1) (= 0 |ldv_malloc_#t~malloc1.offset|)), 10119#(and (= 0 |ldv_malloc_#res.offset|) (= (select |#valid| |ldv_malloc_#res.base|) 1)), 10120#(and (<= 10 entry_point_~len~0) (= (select |#valid| |entry_point_#t~ret8.base|) 1) (<= entry_point_~len~0 10) (= 0 |entry_point_#t~ret8.offset|)), 10121#(and (<= 10 entry_point_~len~0) (= entry_point_~array~0.offset 0) (<= entry_point_~len~0 10) (= (select |#valid| entry_point_~array~0.base) 1)), 10122#(and (= entry_point_~array~0.offset 0) (= (select |#valid| entry_point_~array~0.base) 1)), 10123#(and (or (<= (+ (* 4 entry_point_~i~1) 5) (* 4 entry_point_~len~0)) (= (select |#valid| entry_point_~array~0.base) 1)) (<= (+ (* 4 entry_point_~i~1) 4) (* 4 entry_point_~len~0)) (= entry_point_~array~0.offset 0)), 10124#(and (<= (* 4 entry_point_~i~1) (* 4 entry_point_~len~0)) (= entry_point_~array~0.offset 0) (or (= (select |#valid| entry_point_~array~0.base) 1) (<= (+ (* 4 entry_point_~i~1) 1) (* 4 entry_point_~len~0)))), 10125#(and (= (select |#valid| |alloc_17_#in~array.base|) 1) (= 0 |alloc_17_#in~array.offset|)), 10126#(and (= (select |#valid| alloc_17_~array.base) 1) (= alloc_17_~i~0 0) (= alloc_17_~array.offset 0)), 10127#(= |#valid| |old(#valid)|), 10128#(= 0 (select |old(#valid)| |ldv_malloc_#t~malloc1.base|)), 10129#(= 0 (select |old(#valid)| |ldv_malloc_#res.base|)), 10130#(and (= alloc_17_~i~0 0) (= alloc_17_~array.offset 0) (not (= alloc_17_~array.base |alloc_17_#t~ret3.base|))), 10131#(and (= alloc_17_~i~0 0) (= alloc_17_~array.offset 0) (not (= alloc_17_~array.base alloc_17_~p~0.base))), 10132#(and (= alloc_17_~i~0 0) (= alloc_17_~array.offset 0) (not (= alloc_17_~array.base (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~i~0)))))), 10133#(and (= alloc_17_~array.offset 0) (or (not (= alloc_17_~array.base (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 0))) (<= (* 4 alloc_17_~i~0) 3)) (<= (* 4 alloc_17_~i~0) 4)), 10134#(and (= alloc_17_~array.offset 0) (<= (* 4 alloc_17_~i~0) 8) (or (not (= alloc_17_~array.base (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 0))) (<= (* 4 alloc_17_~i~0) 7))), 10135#(and (= alloc_17_~array.offset 0) (or (not (= alloc_17_~array.base (select (store (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0)) 0) 0))) (<= (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset) 3)) (<= alloc_17_~j~0 1)), 10136#(and (= alloc_17_~array.offset 0) (= 1 (select |#valid| alloc_17_~array.base)) (<= alloc_17_~j~0 1) (or (<= (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset) 3) (not (= alloc_17_~array.base (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 0))))), 10137#(and (= alloc_17_~array.offset 0) (or (not (= 0 (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset))) (and (not (= alloc_17_~array.base (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0))))) (= 1 (select |#valid| alloc_17_~array.base)))) (<= alloc_17_~j~0 0)), 10138#(and (not (= alloc_17_~array.base (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0))))) (= alloc_17_~array.offset 0) (= 1 (select |#valid| alloc_17_~array.base)) (= 0 (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset))), 10139#(and (not (= alloc_17_~array.base |alloc_17_#t~mem6.base|)) (= 1 (select |#valid| alloc_17_~array.base))), 10140#(= 1 (select |#valid| alloc_17_~array.base))] [2018-02-02 10:19:30,257 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 6 proven. 136 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2018-02-02 10:19:30,257 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-02-02 10:19:30,257 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-02-02 10:19:30,257 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=579, Unknown=0, NotChecked=0, Total=650 [2018-02-02 10:19:30,257 INFO L87 Difference]: Start difference. First operand 143 states and 153 transitions. Second operand 26 states. [2018-02-02 10:19:30,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:19:30,750 INFO L93 Difference]: Finished difference Result 146 states and 155 transitions. [2018-02-02 10:19:30,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-02-02 10:19:30,750 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 109 [2018-02-02 10:19:30,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:19:30,751 INFO L225 Difference]: With dead ends: 146 [2018-02-02 10:19:30,751 INFO L226 Difference]: Without dead ends: 146 [2018-02-02 10:19:30,752 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 1 SyntacticMatches, 11 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 260 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=165, Invalid=1395, Unknown=0, NotChecked=0, Total=1560 [2018-02-02 10:19:30,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-02-02 10:19:30,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 143. [2018-02-02 10:19:30,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-02-02 10:19:30,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 152 transitions. [2018-02-02 10:19:30,753 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 152 transitions. Word has length 109 [2018-02-02 10:19:30,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:19:30,754 INFO L432 AbstractCegarLoop]: Abstraction has 143 states and 152 transitions. [2018-02-02 10:19:30,754 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-02-02 10:19:30,754 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 152 transitions. [2018-02-02 10:19:30,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-02-02 10:19:30,754 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:19:30,754 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:19:30,754 INFO L371 AbstractCegarLoop]: === Iteration 44 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 10:19:30,754 INFO L82 PathProgramCache]: Analyzing trace with hash -1303372102, now seen corresponding path program 2 times [2018-02-02 10:19:30,755 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:19:30,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:19:30,772 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:19:31,417 INFO L134 CoverageAnalysis]: Checked inductivity of 292 backedges. 37 proven. 142 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2018-02-02 10:19:31,417 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:19:31,417 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-02-02 10:19:31,417 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:19:31,418 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 5 proven. 14 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-02-02 10:19:31,418 INFO L182 omatonBuilderFactory]: Interpolants [10464#(and (<= 10 entry_point_~len~0) (= entry_point_~array~0.offset 0) (<= entry_point_~len~0 10)), 10465#(= entry_point_~array~0.offset 0), 10466#(and (<= (+ (* 4 entry_point_~i~1) 4) (* 4 entry_point_~len~0)) (= entry_point_~array~0.offset 0)), 10467#(and (<= (* 4 entry_point_~i~1) (* 4 entry_point_~len~0)) (= entry_point_~array~0.offset 0)), 10468#(= 0 |alloc_17_#in~array.offset|), 10469#(and (= alloc_17_~i~0 0) (= alloc_17_~array.offset 0)), 10470#(and (or (< 0 (+ (div ldv_malloc_~size 4294967296) 1)) (<= |ldv_malloc_#in~size| ldv_malloc_~size)) (or (<= (+ (div ldv_malloc_~size 4294967296) 1) 0) (and (<= ldv_malloc_~size |ldv_malloc_#in~size|) (or (< 0 (div ldv_malloc_~size 4294967296)) (<= |ldv_malloc_#in~size| ldv_malloc_~size))))), 10471#(= alloc_17_~array.offset 0), 10472#(and (= alloc_17_~array.offset 0) (= 0 |alloc_17_#t~ret3.offset|)), 10473#(and (= alloc_17_~array.offset 0) (= 0 alloc_17_~p~0.offset)), 10474#(and (= 0 (select (select |#memory_$Pointer$.offset| alloc_17_~array.base) (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset))) (= alloc_17_~array.offset 0)), 10475#(and (= alloc_17_~array.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| alloc_17_~array.base) (+ (* 4 alloc_17_~i~0) (- 4))))), 10476#(and (= alloc_17_~array.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| alloc_17_~array.base) (+ (* 4 alloc_17_~i~0) (- 8))))), 10477#(and (= 0 (select (store (select |#memory_$Pointer$.offset| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0)) 0) (+ (* 4 alloc_17_~j~0) (- 4)))) (= alloc_17_~array.offset 0)), 10478#(and (= alloc_17_~array.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0))))), 10479#(= 0 |alloc_17_#t~mem6.offset|), 10458#true, 10459#false, 10460#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10)), 10461#(= 0 |ldv_malloc_#t~malloc1.offset|), 10462#(= 0 |ldv_malloc_#res.offset|), 10463#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10) (= 0 |entry_point_#t~ret8.offset|))] [2018-02-02 10:19:31,418 INFO L134 CoverageAnalysis]: Checked inductivity of 292 backedges. 37 proven. 142 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2018-02-02 10:19:31,418 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-02 10:19:31,419 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-02 10:19:31,419 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=407, Unknown=0, NotChecked=0, Total=462 [2018-02-02 10:19:31,419 INFO L87 Difference]: Start difference. First operand 143 states and 152 transitions. Second operand 22 states. [2018-02-02 10:19:31,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:19:31,922 INFO L93 Difference]: Finished difference Result 153 states and 162 transitions. [2018-02-02 10:19:31,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-02-02 10:19:31,923 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 120 [2018-02-02 10:19:31,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:19:31,923 INFO L225 Difference]: With dead ends: 153 [2018-02-02 10:19:31,923 INFO L226 Difference]: Without dead ends: 153 [2018-02-02 10:19:31,924 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 5 SyntacticMatches, 11 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 403 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=225, Invalid=1497, Unknown=0, NotChecked=0, Total=1722 [2018-02-02 10:19:31,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2018-02-02 10:19:31,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 145. [2018-02-02 10:19:31,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-02-02 10:19:31,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 155 transitions. [2018-02-02 10:19:31,925 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 155 transitions. Word has length 120 [2018-02-02 10:19:31,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:19:31,925 INFO L432 AbstractCegarLoop]: Abstraction has 145 states and 155 transitions. [2018-02-02 10:19:31,925 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-02 10:19:31,925 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 155 transitions. [2018-02-02 10:19:31,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-02-02 10:19:31,926 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:19:31,926 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:19:31,926 INFO L371 AbstractCegarLoop]: === Iteration 45 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 10:19:31,926 INFO L82 PathProgramCache]: Analyzing trace with hash -1303372101, now seen corresponding path program 3 times [2018-02-02 10:19:31,927 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:19:31,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:19:31,940 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:19:33,402 INFO L134 CoverageAnalysis]: Checked inductivity of 292 backedges. 29 proven. 168 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2018-02-02 10:19:33,402 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:19:33,402 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2018-02-02 10:19:33,403 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:19:33,403 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 21 proven. 12 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-02-02 10:19:33,403 INFO L182 omatonBuilderFactory]: Interpolants [10818#true, 10819#false, 10820#(= 0 (select |#valid| 0)), 10821#(and (<= 10 entry_point_~len~0) (= 0 (select |#valid| 0)) (<= entry_point_~len~0 10)), 10822#(= (select |old(#valid)| 0) (select |#valid| 0)), 10823#(and (= (select |old(#valid)| 0) (select |#valid| 0)) (= 0 |ldv_malloc_#t~malloc1.offset|)), 10824#(and (= 0 |ldv_malloc_#res.offset|) (= (select |old(#valid)| 0) (select |#valid| 0))), 10825#(and (<= 10 entry_point_~len~0) (= 0 (select |#valid| 0)) (<= entry_point_~len~0 10) (= 0 |entry_point_#t~ret8.offset|)), 10826#(and (<= 10 entry_point_~len~0) (= 0 (select |#valid| 0)) (= entry_point_~array~0.offset 0) (<= entry_point_~len~0 10)), 10827#(and (= entry_point_~array~0.offset 0) (= 0 (select |#valid| 0))), 10828#(and (<= (+ (* 4 entry_point_~i~1) 4) (* 4 entry_point_~len~0)) (or (<= (+ (* 4 entry_point_~i~1) 5) (* 4 entry_point_~len~0)) (= 0 (select |#valid| 0))) (= entry_point_~array~0.offset 0)), 10829#(and (or (<= (+ (* 4 entry_point_~i~1) 1) (* 4 entry_point_~len~0)) (and (<= (* 4 entry_point_~i~1) (* 4 entry_point_~len~0)) (= 0 (select |#valid| 0)))) (= entry_point_~array~0.offset 0)), 10830#(and (= 0 (select |#valid| 0)) (= 0 |alloc_17_#in~array.offset|)), 10831#(and (= alloc_17_~i~0 0) (= alloc_17_~array.offset 0) (= 0 (select |#valid| 0))), 10832#(and (= alloc_17_~array.offset 0) (= 0 (select |#valid| 0))), 10833#(and (= (select |old(#valid)| 0) (select |#valid| 0)) (= 1 (select |#valid| |ldv_malloc_#t~malloc1.base|))), 10834#(and (= (select |old(#valid)| 0) (select |#valid| 0)) (= 1 (select |#valid| |ldv_malloc_#res.base|))), 10835#(and (= 1 (select |#valid| |alloc_17_#t~ret3.base|)) (= alloc_17_~array.offset 0) (= 0 (select |#valid| 0))), 10836#(and (= alloc_17_~array.offset 0) (= 1 (select |#valid| alloc_17_~p~0.base)) (= 0 (select |#valid| 0))), 10837#(and (= alloc_17_~array.offset 0) (= 0 (select |#valid| 0)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset))))), 10838#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~i~0) (- 4))))) (= alloc_17_~array.offset 0) (= 0 (select |#valid| 0))), 10839#(= |#valid| |old(#valid)|), 10840#(and (not (= 0 |ldv_malloc_#t~malloc1.base|)) (= (store |old(#valid)| |ldv_malloc_#t~malloc1.base| (select |#valid| |ldv_malloc_#t~malloc1.base|)) |#valid|) (= (select |old(#valid)| |ldv_malloc_#t~malloc1.base|) 0)), 10841#(and (= (select |old(#valid)| |ldv_malloc_#res.base|) 0) (not (= 0 |ldv_malloc_#res.base|)) (or (= |#valid| |old(#valid)|) (= |ldv_malloc_#res.base| (@diff |old(#valid)| |#valid|))) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))), 10842#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~i~0) (- 4))))) (= alloc_17_~array.offset 0) (not (= |alloc_17_#t~ret3.base| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~i~0) (- 4))))) (= 0 (select |#valid| 0)) (not (= 0 |alloc_17_#t~ret3.base|))), 10843#(and (= alloc_17_~array.offset 0) (= 1 (select |#valid| (select (store (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~i~0)) alloc_17_~p~0.base) (+ (* 4 alloc_17_~i~0) (- 4))))) (not (= 0 alloc_17_~p~0.base)) (= 0 (select |#valid| 0)) (not (= alloc_17_~p~0.base (select (store (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~i~0)) alloc_17_~p~0.base) (+ (* 4 alloc_17_~i~0) (- 4)))))), 10844#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~i~0) (- 4))))) (= alloc_17_~array.offset 0) (= 0 (select |#valid| 0)) (not (= (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (* 4 alloc_17_~i~0)) (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~i~0) (- 4))))) (not (= 0 (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (* 4 alloc_17_~i~0))))), 10845#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~i~0) (- 8))))) (= alloc_17_~array.offset 0) (not (= (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~i~0) (- 4))) (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~i~0) (- 8))))) (= 0 (select |#valid| 0)) (not (= 0 (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~i~0) (- 4)))))), 10846#(and (= alloc_17_~array.offset 0) (not (= 0 (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0))))) (not (= (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0))) (select (store (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0)) 0) (+ (* 4 alloc_17_~j~0) (- 4))))) (= 1 (select |#valid| (select (store (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0)) 0) (+ (* 4 alloc_17_~j~0) (- 4))))) (= 0 (select |#valid| 0))), 10847#(and (= alloc_17_~array.offset 0) (not (= 0 |alloc_17_#t~mem6.base|)) (or (not (= 1 (select |#valid| |alloc_17_#t~mem6.base|))) (= 1 (select (store |#valid| |alloc_17_#t~mem6.base| 0) (select (store (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0)) 0) (+ (* 4 alloc_17_~j~0) (- 4))))))), 10848#(and (= alloc_17_~array.offset 0) (= 1 (select |#valid| (select (store (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0)) 0) (+ (* 4 alloc_17_~j~0) (- 4)))))), 10849#(and (= alloc_17_~array.offset 0) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0)))))), 10850#(= 1 (select |#valid| |alloc_17_#t~mem6.base|))] [2018-02-02 10:19:33,403 INFO L134 CoverageAnalysis]: Checked inductivity of 292 backedges. 29 proven. 168 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2018-02-02 10:19:33,403 INFO L409 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-02-02 10:19:33,403 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-02-02 10:19:33,404 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=952, Unknown=0, NotChecked=0, Total=1056 [2018-02-02 10:19:33,404 INFO L87 Difference]: Start difference. First operand 145 states and 155 transitions. Second operand 33 states. [2018-02-02 10:19:34,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:19:34,618 INFO L93 Difference]: Finished difference Result 151 states and 160 transitions. [2018-02-02 10:19:34,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-02-02 10:19:34,618 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 120 [2018-02-02 10:19:34,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:19:34,619 INFO L225 Difference]: With dead ends: 151 [2018-02-02 10:19:34,619 INFO L226 Difference]: Without dead ends: 151 [2018-02-02 10:19:34,620 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 8 SyntacticMatches, 11 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1102 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=475, Invalid=3815, Unknown=0, NotChecked=0, Total=4290 [2018-02-02 10:19:34,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2018-02-02 10:19:34,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 145. [2018-02-02 10:19:34,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-02-02 10:19:34,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 154 transitions. [2018-02-02 10:19:34,623 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 154 transitions. Word has length 120 [2018-02-02 10:19:34,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:19:34,623 INFO L432 AbstractCegarLoop]: Abstraction has 145 states and 154 transitions. [2018-02-02 10:19:34,623 INFO L433 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-02-02 10:19:34,623 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 154 transitions. [2018-02-02 10:19:34,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-02-02 10:19:34,624 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:19:34,624 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:19:34,624 INFO L371 AbstractCegarLoop]: === Iteration 46 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 10:19:34,624 INFO L82 PathProgramCache]: Analyzing trace with hash 761110394, now seen corresponding path program 2 times [2018-02-02 10:19:34,625 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:19:34,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:19:34,655 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:19:38,837 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 0 proven. 141 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2018-02-02 10:19:38,838 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:19:38,838 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-02-02 10:19:38,838 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:19:38,838 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-02-02 10:19:38,838 INFO L182 omatonBuilderFactory]: Interpolants [11213#true, 11214#false, 11215#(= |#valid| |old(#valid)|), 11216#(and (<= 10 entry_point_~len~0) (= |#valid| |old(#valid)|) (<= entry_point_~len~0 10)), 11217#(and (not (= 0 |ldv_malloc_#t~malloc1.base|)) (= (select |#valid| |ldv_malloc_#t~malloc1.base|) 1) (= 0 |ldv_malloc_#t~malloc1.offset|) (= (store |old(#valid)| |ldv_malloc_#t~malloc1.base| (select |#valid| |ldv_malloc_#t~malloc1.base|)) |#valid|) (= (select |old(#valid)| |ldv_malloc_#t~malloc1.base|) 0)), 11218#(and (= (select |old(#valid)| |ldv_malloc_#res.base|) 0) (= 0 |ldv_malloc_#res.offset|) (not (= 0 |ldv_malloc_#res.base|)) (= (select |#valid| |ldv_malloc_#res.base|) 1) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))), 11219#(and (<= 10 entry_point_~len~0) (= (select |#valid| |entry_point_#t~ret8.base|) 1) (<= entry_point_~len~0 10) (= (select |old(#valid)| |entry_point_#t~ret8.base|) 0) (= 0 |entry_point_#t~ret8.offset|) (not (= 0 |entry_point_#t~ret8.base|)) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))), 11220#(and (= (select |old(#valid)| entry_point_~array~0.base) 0) (<= 10 entry_point_~len~0) (= entry_point_~array~0.offset 0) (<= entry_point_~len~0 10) (= (select |#valid| entry_point_~array~0.base) 1) (not (= 0 entry_point_~array~0.base)) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))), 11221#(and (= (select |old(#valid)| entry_point_~array~0.base) 0) (not (= entry_point_~array~0.base 0)) (= entry_point_~array~0.offset 0) (= (select |#valid| entry_point_~array~0.base) 1) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))), 11222#(and (<= (+ (* 4 entry_point_~i~1) 4) (* 4 entry_point_~len~0)) (= entry_point_~array~0.offset 0) (or (<= (+ (* 4 entry_point_~i~1) 5) (* 4 entry_point_~len~0)) (and (= (select |old(#valid)| entry_point_~array~0.base) 0) (not (= entry_point_~array~0.base 0)) (= (select |#valid| entry_point_~array~0.base) 1) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))))), 11223#(and (or (and (= (select |old(#valid)| entry_point_~array~0.base) 0) (<= (* 4 entry_point_~i~1) (* 4 entry_point_~len~0)) (not (= entry_point_~array~0.base 0)) (= (select |#valid| entry_point_~array~0.base) 1) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))) (<= (+ (* 4 entry_point_~i~1) 1) (* 4 entry_point_~len~0))) (= entry_point_~array~0.offset 0)), 11224#(and (or (and (= |#valid| |old(#valid)|) (= alloc_17_~array.base |alloc_17_#in~array.base|)) (not (= alloc_17_~array.offset 0))) (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset))), 11225#(and (not (= 0 |ldv_malloc_#t~malloc1.base|)) (= 1 (select |#valid| |ldv_malloc_#t~malloc1.base|)) (= (store |old(#valid)| |ldv_malloc_#t~malloc1.base| (select |#valid| |ldv_malloc_#t~malloc1.base|)) |#valid|) (= (select |old(#valid)| |ldv_malloc_#t~malloc1.base|) 0)), 11226#(and (= 1 (select |#valid| |ldv_malloc_#res.base|)) (= 0 (select |old(#valid)| |ldv_malloc_#res.base|)) (not (= 0 |ldv_malloc_#res.base|)) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))), 11227#(and (or (and (= 1 (select |#valid| |alloc_17_#t~ret3.base|)) (not (= 0 |alloc_17_#t~ret3.base|)) (= (select |old(#valid)| |alloc_17_#t~ret3.base|) 0) (= alloc_17_~array.base |alloc_17_#in~array.base|) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))) (not (= alloc_17_~array.offset 0))) (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset))), 11228#(and (or (not (= alloc_17_~array.offset 0)) (and (= 1 (select |#valid| alloc_17_~p~0.base)) (= 0 (select |old(#valid)| alloc_17_~p~0.base)) (not (= 0 alloc_17_~p~0.base)) (= alloc_17_~array.base |alloc_17_#in~array.base|) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|)))))) (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset))), 11229#(and (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset)) (or (and (or (and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~i~0))))) (not (= 0 (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~i~0))))) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~i~0))))) (= alloc_17_~array.base |alloc_17_#in~array.base|) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))) (not (= 0 (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset)))) (or (= 0 (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset)) (< 0 (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset)))) (not (= alloc_17_~array.offset 0)))), 11230#(and (or (and (not (= 0 (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 0))) (not (= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) 0)) (= alloc_17_~array.base |alloc_17_#in~array.base|) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 0))) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 0))) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))) (<= 5 (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset)) (not (= alloc_17_~array.offset 0))) (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset))), 11231#(and (not (= 0 |ldv_malloc_#t~malloc1.base|)) (= (store |old(#valid)| |ldv_malloc_#t~malloc1.base| (select |#valid| |ldv_malloc_#t~malloc1.base|)) |#valid|) (= (select |old(#valid)| |ldv_malloc_#t~malloc1.base|) 0)), 11232#(and (= (select |old(#valid)| |ldv_malloc_#res.base|) 0) (= |#valid| (store |old(#valid)| |ldv_malloc_#res.base| (select |#valid| |ldv_malloc_#res.base|))) (not (= 0 |ldv_malloc_#res.base|))), 11233#(and (or (and (not (= 0 (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 0))) (or (and (not (= |alloc_17_#in~array.base| |alloc_17_#t~ret3.base|)) (= (select |old(#valid)| |alloc_17_#t~ret3.base|) 0) (= |#valid| (store (store |old(#valid)| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 0) (select |#valid| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 0))) |alloc_17_#t~ret3.base| (select |#valid| |alloc_17_#t~ret3.base|))) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 0)))) (= alloc_17_~array.base |alloc_17_#t~ret3.base|)) (not (= 0 |alloc_17_#t~ret3.base|)) (not (= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) 0)) (not (= |alloc_17_#t~ret3.base| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 0)))) (<= 5 (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset)) (not (= alloc_17_~array.offset 0))) (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset))), 11234#(and (or (and (not (= 0 alloc_17_~p~0.base)) (or (and (= |#valid| (store (store |old(#valid)| (select (store (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) alloc_17_~p~0.base) 0) (select |#valid| (select (store (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) alloc_17_~p~0.base) 0))) alloc_17_~p~0.base (select |#valid| alloc_17_~p~0.base))) (not (= |alloc_17_#in~array.base| alloc_17_~p~0.base)) (= (select |old(#valid)| alloc_17_~p~0.base) 0) (= (select |old(#valid)| (select (store (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) alloc_17_~p~0.base) 0)) 0)) (= alloc_17_~array.base alloc_17_~p~0.base)) (not (= alloc_17_~p~0.base (select (store (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) alloc_17_~p~0.base) 0))) (not (= 0 (select (store (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) alloc_17_~p~0.base) 0)))) (<= 5 (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset)) (not (= alloc_17_~array.offset 0))) (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset))), 11235#(and (or (<= 5 (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset)) (not (= alloc_17_~array.offset 0)) (and (not (= 0 (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 0))) (or (= alloc_17_~array.base (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset))) (and (= |#valid| (store (store |old(#valid)| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 0) (select |#valid| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 0))) (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset)) (select |#valid| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset))))) (= (select |old(#valid)| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset))) 0) (not (= |alloc_17_#in~array.base| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset)))) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 0))))) (not (= 0 (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset)))) (not (= (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset)) (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 0))))) (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset))), 11236#(and (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset)) (or (and (not (= 0 (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 0))) (or (and (not (= |alloc_17_#in~array.base| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (- (+ (* (- 4) alloc_17_~i~0) 4)))))) (= |#valid| (store (store |old(#valid)| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 0) (select |#valid| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 0))) (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset (- 4))) (select |#valid| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset (- 4)))))) (= (select |old(#valid)| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (- (+ (* (- 4) alloc_17_~i~0) 4))))) 0) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 0)))) (= alloc_17_~array.base (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (- (+ (* (- 4) alloc_17_~i~0) 4)))))) (not (= 0 (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (- (+ (* (- 4) alloc_17_~i~0) 4)))))) (not (= (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (- (+ (* (- 4) alloc_17_~i~0) 4)))) (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 0)))) (not (= alloc_17_~array.offset 0)) (<= 9 (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset)))), 11237#(and (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset)) (or (and (or (= alloc_17_~array.base (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (- (* (- 4) alloc_17_~j~0))))) (and (= (select |old(#valid)| (select (store (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0)) 0) 0)) 0) (= (select |old(#valid)| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0)))) 0) (not (= |alloc_17_#in~array.base| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0))))) (= |#valid| (store (store |old(#valid)| (select (store (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset) 0) 0) (select |#valid| (select (store (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset) 0) 0))) (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset)) (select |#valid| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset))))))) (not (= 0 (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (- (* (- 4) alloc_17_~j~0)))))) (not (= (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (- (* (- 4) alloc_17_~j~0)))) (select (store (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0)) 0) 0))) (not (= 0 (select (store (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0)) 0) 0)))) (<= 5 (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset)) (not (= alloc_17_~array.offset 0)))), 11238#(and (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset)) (or (and (not (= 0 |alloc_17_#t~mem6.base|)) (not (= |alloc_17_#t~mem6.base| (select (store (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0)) 0) 0))) (or (and (= |alloc_17_#t~mem6.base| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0)))) (= alloc_17_~array.base (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (- (* (- 4) alloc_17_~j~0)))))) (and (not (= |alloc_17_#in~array.base| |alloc_17_#t~mem6.base|)) (= (select |old(#valid)| |alloc_17_#t~mem6.base|) (select (store |#valid| |alloc_17_#t~mem6.base| 0) |alloc_17_#t~mem6.base|)) (= 0 (select |old(#valid)| (select (store (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0)) 0) 0))) (= (store |#valid| |alloc_17_#t~mem6.base| 0) (store (store |old(#valid)| |alloc_17_#t~mem6.base| (select (store |#valid| |alloc_17_#t~mem6.base| 0) |alloc_17_#t~mem6.base|)) (select (store (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset) 0) 0) (select (store |#valid| |alloc_17_#t~mem6.base| 0) (select (store (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset) 0) 0)))))) (not (= 0 (select (store (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0)) 0) 0)))) (<= 5 (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset)) (not (= alloc_17_~array.offset 0)))), 11239#(and (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset)) (or (and (or (and (= alloc_17_~array.base (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (- (* (- 4) alloc_17_~j~0))))) (= (select |#valid| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0)))) 0)) (and (= |#valid| (store |old(#valid)| (select (store (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset) 0) 0) (select |#valid| (select (store (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset) 0) 0)))) (= (select |old(#valid)| (select (store (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0)) 0) 0)) 0))) (not (= 0 (select (store (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0)) 0) 0)))) (<= 5 (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset)) (not (= alloc_17_~array.offset 0)))), 11240#(and (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset)) (or (and (not (= 0 (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 0))) (= |#valid| (store |old(#valid)| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 0) (select |#valid| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 0)))) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 0)))) (<= 5 (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset)) (not (= alloc_17_~array.offset 0)))), 11241#(and (or (not (= 0 (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset))) (not (= alloc_17_~array.offset 0)) (and (not (= 0 (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0))))) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0))))) (= |#valid| (store |old(#valid)| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset)) (select |#valid| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset))))))) (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset))), 11242#(and (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset)) (or (and (<= 0 (* 4 alloc_17_~j~0)) (or (<= 1 (* 4 alloc_17_~j~0)) (and (not (= 0 (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0))))) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0))))) (= |#valid| (store |old(#valid)| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset)) (select |#valid| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset)))))))) (not (= alloc_17_~array.offset 0)))), 11243#(and (or (and (not (= 0 |alloc_17_#t~mem6.base|)) (<= 0 (* 4 alloc_17_~j~0)) (= (store |#valid| |alloc_17_#t~mem6.base| 0) (store |old(#valid)| |alloc_17_#t~mem6.base| (select (store |#valid| |alloc_17_#t~mem6.base| 0) |alloc_17_#t~mem6.base|))) (= 0 (select |old(#valid)| |alloc_17_#t~mem6.base|))) (<= 1 (* 4 alloc_17_~j~0)) (not (= alloc_17_~array.offset 0))) (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset))), 11244#(and (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset)) (or (and (= |#valid| |old(#valid)|) (<= 0 (* 4 alloc_17_~j~0))) (<= 1 (* 4 alloc_17_~j~0)) (not (= alloc_17_~array.offset 0)))), 11245#(or (not (= |alloc_17_#in~array.offset| 0)) (and (<= 0 (* 4 alloc_17_~j~0)) (or (= |#valid| |old(#valid)|) (<= 1 (* 4 alloc_17_~j~0))))), 11246#(or (and (or (= |#valid| |old(#valid)|) (<= 0 (+ (* 4 alloc_17_~j~0) 3))) (<= 0 (+ (* 4 alloc_17_~j~0) 4))) (not (= |alloc_17_#in~array.offset| 0))), 11247#(or (not (= |alloc_17_#in~array.offset| 0)) (= |#valid| |old(#valid)|)), 11248#(and (not (= entry_point_~array~0.base 0)) (= entry_point_~array~0.offset 0) (= (select |old(#valid)| entry_point_~array~0.base) (select (store |#valid| entry_point_~array~0.base 0) entry_point_~array~0.base)) (= (store |old(#valid)| entry_point_~array~0.base (select (store |#valid| entry_point_~array~0.base 0) entry_point_~array~0.base)) (store |#valid| entry_point_~array~0.base 0)))] [2018-02-02 10:19:38,839 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 0 proven. 141 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2018-02-02 10:19:38,839 INFO L409 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-02-02 10:19:38,839 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-02-02 10:19:38,840 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=1167, Unknown=0, NotChecked=0, Total=1260 [2018-02-02 10:19:38,840 INFO L87 Difference]: Start difference. First operand 145 states and 154 transitions. Second operand 36 states. [2018-02-02 10:19:40,498 WARN L146 SmtUtils]: Spent 107ms on a formula simplification. DAG size of input: 201 DAG size of output 94 [2018-02-02 10:19:40,799 WARN L146 SmtUtils]: Spent 153ms on a formula simplification. DAG size of input: 216 DAG size of output 115 [2018-02-02 10:19:41,165 WARN L146 SmtUtils]: Spent 266ms on a formula simplification. DAG size of input: 199 DAG size of output 139 [2018-02-02 10:19:41,497 WARN L146 SmtUtils]: Spent 252ms on a formula simplification. DAG size of input: 184 DAG size of output 118 [2018-02-02 10:19:41,741 WARN L146 SmtUtils]: Spent 146ms on a formula simplification. DAG size of input: 157 DAG size of output 77 [2018-02-02 10:19:41,958 WARN L146 SmtUtils]: Spent 121ms on a formula simplification. DAG size of input: 115 DAG size of output 80 [2018-02-02 10:19:42,264 WARN L146 SmtUtils]: Spent 153ms on a formula simplification. DAG size of input: 126 DAG size of output 91 [2018-02-02 10:19:43,115 WARN L146 SmtUtils]: Spent 111ms on a formula simplification. DAG size of input: 113 DAG size of output 72 [2018-02-02 10:19:43,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:19:43,368 INFO L93 Difference]: Finished difference Result 174 states and 184 transitions. [2018-02-02 10:19:43,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-02-02 10:19:43,368 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 120 [2018-02-02 10:19:43,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:19:43,369 INFO L225 Difference]: With dead ends: 174 [2018-02-02 10:19:43,369 INFO L226 Difference]: Without dead ends: 166 [2018-02-02 10:19:43,369 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 18 SyntacticMatches, 34 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 529 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=380, Invalid=3280, Unknown=0, NotChecked=0, Total=3660 [2018-02-02 10:19:43,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2018-02-02 10:19:43,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 157. [2018-02-02 10:19:43,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-02-02 10:19:43,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 167 transitions. [2018-02-02 10:19:43,371 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 167 transitions. Word has length 120 [2018-02-02 10:19:43,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:19:43,371 INFO L432 AbstractCegarLoop]: Abstraction has 157 states and 167 transitions. [2018-02-02 10:19:43,371 INFO L433 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-02-02 10:19:43,371 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 167 transitions. [2018-02-02 10:19:43,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-02-02 10:19:43,372 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:19:43,372 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:19:43,372 INFO L371 AbstractCegarLoop]: === Iteration 47 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 10:19:43,372 INFO L82 PathProgramCache]: Analyzing trace with hash 367324278, now seen corresponding path program 4 times [2018-02-02 10:19:43,373 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:19:43,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:19:43,381 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:19:43,464 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2018-02-02 10:19:43,464 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:19:43,465 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-02-02 10:19:43,465 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:19:43,465 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-02-02 10:19:43,465 INFO L182 omatonBuilderFactory]: Interpolants [11632#(<= 10 entry_point_~len~0), 11633#(and (= alloc_17_~i~0 0) (<= |alloc_17_#in~len| alloc_17_~len)), 11634#(<= (+ alloc_17_~i~0 |alloc_17_#in~len|) (+ alloc_17_~len 1)), 11635#(<= (+ alloc_17_~i~0 |alloc_17_#in~len|) (+ alloc_17_~len 2)), 11636#(<= (+ alloc_17_~i~0 |alloc_17_#in~len|) (+ alloc_17_~len 3)), 11637#(<= (+ alloc_17_~i~0 |alloc_17_#in~len|) (+ alloc_17_~len 4)), 11638#(<= |alloc_17_#in~len| 4), 11630#true, 11631#false] [2018-02-02 10:19:43,465 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2018-02-02 10:19:43,466 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 10:19:43,466 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 10:19:43,466 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2018-02-02 10:19:43,466 INFO L87 Difference]: Start difference. First operand 157 states and 167 transitions. Second operand 9 states. [2018-02-02 10:19:43,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:19:43,518 INFO L93 Difference]: Finished difference Result 239 states and 257 transitions. [2018-02-02 10:19:43,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 10:19:43,519 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 122 [2018-02-02 10:19:43,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:19:43,519 INFO L225 Difference]: With dead ends: 239 [2018-02-02 10:19:43,519 INFO L226 Difference]: Without dead ends: 236 [2018-02-02 10:19:43,519 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2018-02-02 10:19:43,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2018-02-02 10:19:43,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 164. [2018-02-02 10:19:43,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2018-02-02 10:19:43,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 176 transitions. [2018-02-02 10:19:43,523 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 176 transitions. Word has length 122 [2018-02-02 10:19:43,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:19:43,523 INFO L432 AbstractCegarLoop]: Abstraction has 164 states and 176 transitions. [2018-02-02 10:19:43,523 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 10:19:43,523 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 176 transitions. [2018-02-02 10:19:43,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-02-02 10:19:43,524 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:19:43,524 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:19:43,524 INFO L371 AbstractCegarLoop]: === Iteration 48 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 10:19:43,524 INFO L82 PathProgramCache]: Analyzing trace with hash 1589861211, now seen corresponding path program 2 times [2018-02-02 10:19:43,525 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:19:43,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:19:43,547 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:19:45,166 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 9 proven. 260 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-02-02 10:19:45,166 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:19:45,166 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2018-02-02 10:19:45,166 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:19:45,167 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 9 proven. 17 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-02-02 10:19:45,167 INFO L182 omatonBuilderFactory]: Interpolants [12044#true, 12045#false, 12046#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10)), 12047#(and (not (= 0 |ldv_malloc_#t~malloc1.base|)) (= 0 |ldv_malloc_#t~malloc1.offset|)), 12048#(and (= 0 |ldv_malloc_#res.offset|) (not (= 0 |ldv_malloc_#res.base|))), 12049#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10) (= 0 |entry_point_#t~ret8.offset|) (not (= 0 |entry_point_#t~ret8.base|))), 12050#(and (<= 10 entry_point_~len~0) (= entry_point_~array~0.offset 0) (<= entry_point_~len~0 10) (not (= 0 entry_point_~array~0.base))), 12051#(and (<= 10 entry_point_~len~0) (= entry_point_~array~0.offset 0) (<= entry_point_~len~0 10) (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~1))) entry_point_~array~0.base))), 12052#(and (not (= (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~1) entry_point_~array~0.offset) 0) (+ entry_point_~array~0.offset (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~1) 36)))) entry_point_~array~0.base)) (<= 10 entry_point_~len~0) (= entry_point_~array~0.offset 0) (<= entry_point_~len~0 10)), 12053#(and (not (= (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~1)) 0) (+ entry_point_~array~0.offset (+ (* 4 entry_point_~i~1) (+ (* (- 4) entry_point_~len~0) 32)))) entry_point_~array~0.base)) (= entry_point_~array~0.offset 0) (<= (+ (div (+ (+ entry_point_~array~0.offset (+ (* 4 entry_point_~i~1) (+ (* (- 4) entry_point_~len~0) 32))) (- entry_point_~array~0.offset)) 4) 2) entry_point_~i~1)), 12054#(and (not (= (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~1) entry_point_~array~0.offset) 0) (+ entry_point_~array~0.offset (+ (* 4 entry_point_~i~1) (+ (* (- 4) entry_point_~len~0) 28)))) entry_point_~array~0.base)) (= entry_point_~array~0.offset 0) (<= (+ (div (+ (- entry_point_~array~0.offset) (+ entry_point_~array~0.offset (+ (* 4 entry_point_~i~1) (+ (* (- 4) entry_point_~len~0) 28)))) 4) 3) entry_point_~i~1)), 12055#(and (not (= (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~1) entry_point_~array~0.offset) 0) (+ entry_point_~array~0.offset (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~1) 24)))) entry_point_~array~0.base)) (= entry_point_~array~0.offset 0) (<= (+ (div (+ (- entry_point_~array~0.offset) (+ entry_point_~array~0.offset (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~1) 24)))) 4) 4) entry_point_~i~1)), 12056#(and (= entry_point_~array~0.offset 0) (<= (+ (div (+ (- entry_point_~array~0.offset) (+ entry_point_~array~0.offset (+ (* 4 entry_point_~i~1) (+ (* (- 4) entry_point_~len~0) 20)))) 4) 5) entry_point_~i~1) (not (= (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~1)) 0) (+ entry_point_~array~0.offset (+ (* 4 entry_point_~i~1) (+ (* (- 4) entry_point_~len~0) 20)))) entry_point_~array~0.base))), 12057#(and (= entry_point_~array~0.offset 0) (<= (+ (div (+ (- entry_point_~array~0.offset) (+ entry_point_~array~0.offset (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~1) 16)))) 4) 6) entry_point_~i~1) (not (= (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~1) entry_point_~array~0.offset) 0) (+ entry_point_~array~0.offset (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~1) 16)))) entry_point_~array~0.base))), 12058#(and (not (= (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~1)) 0) (+ entry_point_~array~0.offset (+ (* 4 entry_point_~i~1) (+ (* (- 4) entry_point_~len~0) 12)))) entry_point_~array~0.base)) (= entry_point_~array~0.offset 0) (<= (+ (div (+ (- entry_point_~array~0.offset) (+ entry_point_~array~0.offset (+ (* 4 entry_point_~i~1) (+ (* (- 4) entry_point_~len~0) 12)))) 4) 7) entry_point_~i~1)), 12059#(and (= entry_point_~array~0.offset 0) (not (= (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~1) entry_point_~array~0.offset) 0) (+ entry_point_~array~0.offset (+ (* 4 entry_point_~i~1) (+ (* (- 4) entry_point_~len~0) 8)))) entry_point_~array~0.base))), 12060#(and (or (not (= (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~1) entry_point_~array~0.offset) 0) (+ entry_point_~array~0.offset 4)) entry_point_~array~0.base)) (<= (+ (* 4 entry_point_~i~1) 5) (* 4 entry_point_~len~0))) (<= (+ (* 4 entry_point_~i~1) 4) (* 4 entry_point_~len~0)) (= entry_point_~array~0.offset 0)), 12061#(and (= entry_point_~array~0.offset 0) (or (<= (+ (* 4 entry_point_~i~1) 5) (* 4 entry_point_~len~0)) (and (<= (+ (* 4 entry_point_~i~1) 4) (* 4 entry_point_~len~0)) (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset 4)) entry_point_~array~0.base))))), 12062#(and (<= (* 4 entry_point_~i~1) (* 4 entry_point_~len~0)) (or (<= (+ (* 4 entry_point_~i~1) 1) (* 4 entry_point_~len~0)) (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset 4)) entry_point_~array~0.base))) (= entry_point_~array~0.offset 0)), 12063#(and (= entry_point_~array~0.offset 0) (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset 4)) entry_point_~array~0.base))), 12064#(and (= 0 |alloc_17_#in~array.offset|) (not (= (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) 4) |alloc_17_#in~array.base|))), 12065#(and (= alloc_17_~i~0 0) (= alloc_17_~array.offset 0) (not (= (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 4) alloc_17_~array.base))), 12066#(and (= (select |#valid| alloc_17_~array.base) 1) (= alloc_17_~i~0 0) (= alloc_17_~array.offset 0) (not (= (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 4) alloc_17_~array.base))), 12067#(and (= (select |#valid| alloc_17_~array.base) 1) (= alloc_17_~array.offset 0)), 12068#(= |#valid| |old(#valid)|), 12069#(= 0 (select |old(#valid)| |ldv_malloc_#t~malloc1.base|)), 12070#(= 0 (select |old(#valid)| |ldv_malloc_#res.base|)), 12071#(and (= alloc_17_~array.offset 0) (not (= alloc_17_~array.base |alloc_17_#t~ret3.base|))), 12072#(and (= alloc_17_~array.offset 0) (not (= alloc_17_~array.base alloc_17_~p~0.base))), 12073#(and (= alloc_17_~array.offset 0) (not (= (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (* 4 alloc_17_~i~0)) alloc_17_~array.base))), 12074#(and (= alloc_17_~array.offset 0) (not (= (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~i~0) (- 4))) alloc_17_~array.base))), 12075#(and (= alloc_17_~array.offset 0) (not (= alloc_17_~array.base (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~i~0) (- 8)))))), 12076#(and (= alloc_17_~array.offset 0) (not (= (select (store (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0)) 0) (+ (* 4 alloc_17_~j~0) (- 4))) alloc_17_~array.base))), 12077#(and (= alloc_17_~array.offset 0) (= 1 (select |#valid| alloc_17_~array.base)) (not (= (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~j~0) (- 4))) alloc_17_~array.base))), 12078#(and (= alloc_17_~array.offset 0) (= 1 (select |#valid| alloc_17_~array.base)) (not (= (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0))) alloc_17_~array.base))), 12079#(and (not (= alloc_17_~array.base |alloc_17_#t~mem6.base|)) (= 1 (select |#valid| alloc_17_~array.base))), 12080#(= 1 (select |#valid| alloc_17_~array.base))] [2018-02-02 10:19:45,167 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 9 proven. 260 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-02-02 10:19:45,167 INFO L409 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-02-02 10:19:45,167 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-02-02 10:19:45,168 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=1245, Unknown=0, NotChecked=0, Total=1332 [2018-02-02 10:19:45,168 INFO L87 Difference]: Start difference. First operand 164 states and 176 transitions. Second operand 37 states. [2018-02-02 10:19:47,348 WARN L146 SmtUtils]: Spent 104ms on a formula simplification. DAG size of input: 126 DAG size of output 88 [2018-02-02 10:19:48,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:19:48,671 INFO L93 Difference]: Finished difference Result 174 states and 185 transitions. [2018-02-02 10:19:48,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-02-02 10:19:48,671 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 122 [2018-02-02 10:19:48,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:19:48,672 INFO L225 Difference]: With dead ends: 174 [2018-02-02 10:19:48,672 INFO L226 Difference]: Without dead ends: 174 [2018-02-02 10:19:48,674 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 1 SyntacticMatches, 11 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1711 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=791, Invalid=7581, Unknown=0, NotChecked=0, Total=8372 [2018-02-02 10:19:48,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2018-02-02 10:19:48,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 164. [2018-02-02 10:19:48,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2018-02-02 10:19:48,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 175 transitions. [2018-02-02 10:19:48,677 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 175 transitions. Word has length 122 [2018-02-02 10:19:48,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:19:48,677 INFO L432 AbstractCegarLoop]: Abstraction has 164 states and 175 transitions. [2018-02-02 10:19:48,677 INFO L433 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-02-02 10:19:48,677 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 175 transitions. [2018-02-02 10:19:48,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-02-02 10:19:48,678 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:19:48,678 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 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:19:48,678 INFO L371 AbstractCegarLoop]: === Iteration 49 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 10:19:48,679 INFO L82 PathProgramCache]: Analyzing trace with hash 1226012011, now seen corresponding path program 3 times [2018-02-02 10:19:48,680 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:19:48,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:19:48,705 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:19:49,467 INFO L134 CoverageAnalysis]: Checked inductivity of 303 backedges. 43 proven. 122 refuted. 0 times theorem prover too weak. 138 trivial. 0 not checked. [2018-02-02 10:19:49,467 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:19:49,467 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-02-02 10:19:49,467 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:19:49,468 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-02-02 10:19:49,468 INFO L182 omatonBuilderFactory]: Interpolants [12544#(and (or (and (<= alloc_17_~i~0 1) (= 0 (select (select |#memory_$Pointer$.offset| alloc_17_~array.base) 0))) (<= (* 4 alloc_17_~i~0) 3)) (= alloc_17_~array.offset 0)), 12545#(and (= alloc_17_~array.offset 0) (or (and (<= alloc_17_~i~0 2) (= 0 (select (select |#memory_$Pointer$.offset| alloc_17_~array.base) 0))) (<= (* 4 alloc_17_~i~0) 7))), 12546#(and (= alloc_17_~array.offset 0) (or (<= (* 4 alloc_17_~i~0) 11) (and (<= alloc_17_~i~0 3) (= 0 (select (select |#memory_$Pointer$.offset| alloc_17_~array.base) 0))))), 12547#(and (= alloc_17_~array.offset 0) (or (<= (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset) 7) (and (= 0 (select (store (select |#memory_$Pointer$.offset| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0)) 0) 0)) (<= alloc_17_~j~0 2)))), 12548#(and (or (<= (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset) 3) (and (<= alloc_17_~j~0 1) (= 0 (select (store (select |#memory_$Pointer$.offset| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0)) 0) 0)))) (= alloc_17_~array.offset 0)), 12549#(and (or (not (= 0 (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset))) (= 0 (select (select |#memory_$Pointer$.offset| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0))))) (= alloc_17_~array.offset 0) (<= alloc_17_~j~0 0)), 12550#(and (= alloc_17_~array.offset 0) (= 0 (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset)) (= 0 (select (select |#memory_$Pointer$.offset| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0))))), 12551#(= 0 |alloc_17_#t~mem6.offset|), 12529#true, 12530#false, 12531#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10)), 12532#(= 0 |ldv_malloc_#t~malloc1.offset|), 12533#(= 0 |ldv_malloc_#res.offset|), 12534#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10) (= 0 |entry_point_#t~ret8.offset|)), 12535#(and (<= 10 entry_point_~len~0) (= entry_point_~array~0.offset 0) (<= entry_point_~len~0 10)), 12536#(= entry_point_~array~0.offset 0), 12537#(and (<= (+ (* 4 entry_point_~i~1) 4) (* 4 entry_point_~len~0)) (= entry_point_~array~0.offset 0)), 12538#(and (<= (* 4 entry_point_~i~1) (* 4 entry_point_~len~0)) (= entry_point_~array~0.offset 0)), 12539#(= 0 |alloc_17_#in~array.offset|), 12540#(and (= alloc_17_~i~0 0) (= alloc_17_~array.offset 0)), 12541#(and (= alloc_17_~i~0 0) (= alloc_17_~array.offset 0) (= 0 |alloc_17_#t~ret3.offset|)), 12542#(and (= alloc_17_~i~0 0) (= alloc_17_~array.offset 0) (= 0 alloc_17_~p~0.offset)), 12543#(and (= alloc_17_~i~0 0) (= alloc_17_~array.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~i~0)))))] [2018-02-02 10:19:49,468 INFO L134 CoverageAnalysis]: Checked inductivity of 303 backedges. 43 proven. 122 refuted. 0 times theorem prover too weak. 138 trivial. 0 not checked. [2018-02-02 10:19:49,468 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-02 10:19:49,468 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-02 10:19:49,468 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=433, Unknown=0, NotChecked=0, Total=506 [2018-02-02 10:19:49,468 INFO L87 Difference]: Start difference. First operand 164 states and 175 transitions. Second operand 23 states. [2018-02-02 10:19:49,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:19:49,858 INFO L93 Difference]: Finished difference Result 198 states and 210 transitions. [2018-02-02 10:19:49,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-02-02 10:19:49,859 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 127 [2018-02-02 10:19:49,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:19:49,859 INFO L225 Difference]: With dead ends: 198 [2018-02-02 10:19:49,859 INFO L226 Difference]: Without dead ends: 198 [2018-02-02 10:19:49,860 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 3 SyntacticMatches, 15 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 652 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=317, Invalid=1753, Unknown=0, NotChecked=0, Total=2070 [2018-02-02 10:19:49,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2018-02-02 10:19:49,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 190. [2018-02-02 10:19:49,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2018-02-02 10:19:49,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 204 transitions. [2018-02-02 10:19:49,862 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 204 transitions. Word has length 127 [2018-02-02 10:19:49,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:19:49,862 INFO L432 AbstractCegarLoop]: Abstraction has 190 states and 204 transitions. [2018-02-02 10:19:49,862 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-02 10:19:49,862 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 204 transitions. [2018-02-02 10:19:49,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-02-02 10:19:49,863 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:19:49,863 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 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:19:49,863 INFO L371 AbstractCegarLoop]: === Iteration 50 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 10:19:49,863 INFO L82 PathProgramCache]: Analyzing trace with hash 1226012012, now seen corresponding path program 4 times [2018-02-02 10:19:49,864 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:19:49,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:19:49,882 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:19:51,677 INFO L134 CoverageAnalysis]: Checked inductivity of 303 backedges. 53 proven. 157 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2018-02-02 10:19:51,677 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:19:51,677 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-02-02 10:19:51,677 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:19:51,677 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 15 proven. 20 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-02-02 10:19:51,677 INFO L182 omatonBuilderFactory]: Interpolants [12992#(and (<= 10 entry_point_~len~0) (= entry_point_~array~0.offset 0) (<= entry_point_~len~0 10)), 12993#(= entry_point_~array~0.offset 0), 12994#(and (<= (+ (* 4 entry_point_~i~1) 4) (* 4 entry_point_~len~0)) (= entry_point_~array~0.offset 0)), 12995#(and (<= (* 4 entry_point_~i~1) (* 4 entry_point_~len~0)) (= entry_point_~array~0.offset 0)), 12996#(= 0 |alloc_17_#in~array.offset|), 12997#(and (= alloc_17_~i~0 0) (= alloc_17_~array.offset 0)), 12998#(and (or (< 0 (div ldv_malloc_~size 4294967296)) (and (or (<= ldv_malloc_~size |ldv_malloc_#in~size|) (<= (+ (div ldv_malloc_~size 4294967296) 1) 0)) (<= |ldv_malloc_#in~size| ldv_malloc_~size))) (or (<= ldv_malloc_~size |ldv_malloc_#in~size|) (<= (div ldv_malloc_~size 4294967296) 0))), 12999#(or (<= (+ |ldv_malloc_#in~size| 1) 0) (= 1 (select |#valid| |ldv_malloc_#t~malloc1.base|)) (<= 4294967296 |ldv_malloc_#in~size|)), 13000#(or (<= (+ |ldv_malloc_#in~size| 1) 0) (= 1 (select |#valid| |ldv_malloc_#res.base|)) (<= 4294967296 |ldv_malloc_#in~size|)), 13001#(and (= 1 (select |#valid| |alloc_17_#t~ret3.base|)) (= alloc_17_~i~0 0) (= alloc_17_~array.offset 0)), 13002#(and (= alloc_17_~i~0 0) (= alloc_17_~array.offset 0) (= 1 (select |#valid| alloc_17_~p~0.base))), 13003#(and (= alloc_17_~i~0 0) (= alloc_17_~array.offset 0) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~i~0)))))), 13004#(and (= alloc_17_~array.offset 0) (<= (* 4 alloc_17_~i~0) 4) (or (<= (* 4 alloc_17_~i~0) 3) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 0))))), 13005#(= |#valid| |old(#valid)|), 13006#(and (not (= 0 |ldv_malloc_#t~malloc1.base|)) (= (store |old(#valid)| |ldv_malloc_#t~malloc1.base| (select |#valid| |ldv_malloc_#t~malloc1.base|)) |#valid|) (= (select |old(#valid)| |ldv_malloc_#t~malloc1.base|) 0)), 13007#(and (= (select |old(#valid)| |ldv_malloc_#res.base|) 0) (not (= 0 |ldv_malloc_#res.base|)) (or (= |#valid| |old(#valid)|) (= (select |old(#valid)| (@diff |old(#valid)| |#valid|)) 0)) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))), 13008#(and (or (and (not (= (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 0) |alloc_17_#t~ret3.base|)) (<= (* 4 alloc_17_~i~0) 4) (not (= 0 |alloc_17_#t~ret3.base|)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 0)))) (<= (* 4 alloc_17_~i~0) 3)) (= alloc_17_~array.offset 0)), 13009#(and (= alloc_17_~array.offset 0) (<= (* 4 alloc_17_~i~0) 4) (or (and (not (= (select (store (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) alloc_17_~p~0.base) 0) alloc_17_~p~0.base)) (not (= 0 alloc_17_~p~0.base)) (= 1 (select |#valid| (select (store (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) alloc_17_~p~0.base) 0)))) (<= (* 4 alloc_17_~i~0) 3))), 13010#(and (= alloc_17_~array.offset 0) (<= (* 4 alloc_17_~i~0) 4) (or (<= (* 4 alloc_17_~i~0) 3) (and (not (= 0 (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset)))) (not (= (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 0) (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset)))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 0)))))), 13011#(and (= alloc_17_~array.offset 0) (<= (* 4 alloc_17_~i~0) 8) (or (and (not (= (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 0) (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~i~0) (- 4))))) (not (= 0 (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~i~0) (- 4))))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 0)))) (<= (* 4 alloc_17_~i~0) 7))), 13012#(and (= (select |old(#valid)| |ldv_malloc_#res.base|) 0) (not (= 0 |ldv_malloc_#res.base|)) (or (= |#valid| |old(#valid)|) (= |ldv_malloc_#res.base| (@diff |old(#valid)| |#valid|))) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))), 13013#(and (= alloc_17_~array.offset 0) (<= (* 4 alloc_17_~i~0) 8) (or (<= (* 4 alloc_17_~i~0) 7) (and (not (= (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 0) |alloc_17_#t~ret3.base|)) (not (= (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 0) (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~i~0) (- 4))))) (not (= 0 (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~i~0) (- 4))))) (not (= 0 |alloc_17_#t~ret3.base|)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 0)))))), 13014#(and (= alloc_17_~array.offset 0) (<= (* 4 alloc_17_~i~0) 8) (or (and (not (= 0 (select (store (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~i~0)) alloc_17_~p~0.base) (+ (* 4 alloc_17_~i~0) (- 4))))) (not (= (select (store (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~i~0)) alloc_17_~p~0.base) 0) alloc_17_~p~0.base)) (not (= 0 alloc_17_~p~0.base)) (= 1 (select |#valid| (select (store (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~i~0)) alloc_17_~p~0.base) 0))) (not (= (select (store (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~i~0)) alloc_17_~p~0.base) 0) (select (store (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~i~0)) alloc_17_~p~0.base) (+ (* 4 alloc_17_~i~0) (- 4)))))) (<= (* 4 alloc_17_~i~0) 7))), 13015#(and (= alloc_17_~array.offset 0) (or (and (not (= 0 (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 8))) (not (= (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 0) (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~i~0))))) (not (= (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 0) (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~i~0) (- 4))))) (<= (* 4 alloc_17_~i~0) 8) (not (= 0 (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~i~0) (- 4))))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 0)))) (<= (* 4 alloc_17_~i~0) 7))), 13016#(and (= alloc_17_~array.offset 0) (or (and (<= alloc_17_~i~0 3) (not (= 0 (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~i~0) (- 8))))) (not (= (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 0) (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 8))) (not (= 0 (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 8))) (not (= (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 0) (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~i~0) (- 8))))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 0)))) (<= (* 4 alloc_17_~i~0) 11))), 13017#(and (= alloc_17_~array.offset 0) (<= (* 4 alloc_17_~j~0) 8) (or (and (= 1 (select |#valid| (select (store (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0)) 0) 0))) (not (= (select (store (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0)) 0) 0) (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0))))) (not (= 0 (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0))))) (not (= (select (store (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0)) 0) 0) (select (store (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0)) 0) (+ (* 4 alloc_17_~j~0) (- 4))))) (not (= 0 (select (store (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0)) 0) (+ (* 4 alloc_17_~j~0) (- 4)))))) (<= (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset) 7))), 13018#(and (= alloc_17_~array.offset 0) (or (<= (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset) 7) (and (not (= (select (store (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0)) 0) 0) (select (store (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0)) 0) (+ (* 4 alloc_17_~j~0) (- 4))))) (not (= 0 |alloc_17_#t~mem6.base|)) (not (= 0 (select (store (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0)) 0) (+ (* 4 alloc_17_~j~0) (- 4))))) (= 1 (select (store |#valid| |alloc_17_#t~mem6.base| 0) (select (store (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0)) 0) 0))) (<= alloc_17_~j~0 2)))), 13019#(and (= alloc_17_~array.offset 0) (<= (* 4 alloc_17_~j~0) 8) (or (and (= 1 (select |#valid| (select (store (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0)) 0) 0))) (not (= (select (store (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0)) 0) 0) (select (store (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0)) 0) (+ (* 4 alloc_17_~j~0) (- 4))))) (not (= 0 (select (store (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0)) 0) (+ (* 4 alloc_17_~j~0) (- 4)))))) (<= (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset) 7))), 13020#(and (= alloc_17_~array.offset 0) (or (<= (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset) 3) (and (= 1 (select |#valid| (select (store (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0)) 0) 0))) (not (= (select (store (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0)) 0) 0) (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0))))) (not (= 0 (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0))))) (<= alloc_17_~j~0 1)))), 13021#(and (or (<= (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset) 3) (and (not (= 0 |alloc_17_#t~mem6.base|)) (or (not (= 1 (select |#valid| |alloc_17_#t~mem6.base|))) (and (<= alloc_17_~j~0 1) (= 1 (select (store |#valid| |alloc_17_#t~mem6.base| 0) (select (store (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0)) 0) 0))))))) (= alloc_17_~array.offset 0)), 13022#(and (= alloc_17_~array.offset 0) (or (<= (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset) 3) (and (= 1 (select |#valid| (select (store (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0)) 0) 0))) (<= alloc_17_~j~0 1)))), 13023#(and (= alloc_17_~array.offset 0) (or (and (= 0 (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0)))))) (<= (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset 1) 0))), 13024#(and (= alloc_17_~array.offset 0) (= 0 (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0)))))), 13025#(= 1 (select |#valid| |alloc_17_#t~mem6.base|)), 12986#true, 12987#false, 12988#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10)), 12989#(= 0 |ldv_malloc_#t~malloc1.offset|), 12990#(= 0 |ldv_malloc_#res.offset|), 12991#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10) (= 0 |entry_point_#t~ret8.offset|))] [2018-02-02 10:19:51,678 INFO L134 CoverageAnalysis]: Checked inductivity of 303 backedges. 53 proven. 157 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2018-02-02 10:19:51,678 INFO L409 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-02-02 10:19:51,678 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-02-02 10:19:51,678 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=1385, Unknown=0, NotChecked=0, Total=1560 [2018-02-02 10:19:51,678 INFO L87 Difference]: Start difference. First operand 190 states and 204 transitions. Second operand 40 states. [2018-02-02 10:19:53,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:19:53,090 INFO L93 Difference]: Finished difference Result 194 states and 206 transitions. [2018-02-02 10:19:53,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-02-02 10:19:53,091 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 127 [2018-02-02 10:19:53,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:19:53,091 INFO L225 Difference]: With dead ends: 194 [2018-02-02 10:19:53,091 INFO L226 Difference]: Without dead ends: 194 [2018-02-02 10:19:53,092 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 6 SyntacticMatches, 11 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1753 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=631, Invalid=5069, Unknown=0, NotChecked=0, Total=5700 [2018-02-02 10:19:53,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2018-02-02 10:19:53,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 190. [2018-02-02 10:19:53,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2018-02-02 10:19:53,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 203 transitions. [2018-02-02 10:19:53,095 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 203 transitions. Word has length 127 [2018-02-02 10:19:53,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:19:53,095 INFO L432 AbstractCegarLoop]: Abstraction has 190 states and 203 transitions. [2018-02-02 10:19:53,095 INFO L433 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-02-02 10:19:53,095 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 203 transitions. [2018-02-02 10:19:53,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-02-02 10:19:53,096 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:19:53,096 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:19:53,096 INFO L371 AbstractCegarLoop]: === Iteration 51 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 10:19:53,096 INFO L82 PathProgramCache]: Analyzing trace with hash 1829900415, now seen corresponding path program 3 times [2018-02-02 10:19:53,097 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:19:53,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:19:53,109 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:19:53,185 INFO L134 CoverageAnalysis]: Checked inductivity of 274 backedges. 27 proven. 17 refuted. 0 times theorem prover too weak. 230 trivial. 0 not checked. [2018-02-02 10:19:53,186 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:19:53,186 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-02-02 10:19:53,186 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:19:53,186 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-02-02 10:19:53,186 INFO L182 omatonBuilderFactory]: Interpolants [13488#(<= alloc_17_~j~0 0), 13489#(<= (+ alloc_17_~j~0 1) 0), 13482#true, 13483#false, 13484#(= alloc_17_~i~0 0), 13485#(<= alloc_17_~i~0 1), 13486#(<= alloc_17_~i~0 2), 13487#(<= alloc_17_~j~0 1)] [2018-02-02 10:19:53,187 INFO L134 CoverageAnalysis]: Checked inductivity of 274 backedges. 27 proven. 17 refuted. 0 times theorem prover too weak. 230 trivial. 0 not checked. [2018-02-02 10:19:53,187 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 10:19:53,187 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 10:19:53,187 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-02-02 10:19:53,187 INFO L87 Difference]: Start difference. First operand 190 states and 203 transitions. Second operand 8 states. [2018-02-02 10:19:53,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:19:53,231 INFO L93 Difference]: Finished difference Result 185 states and 196 transitions. [2018-02-02 10:19:53,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 10:19:53,231 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 127 [2018-02-02 10:19:53,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:19:53,232 INFO L225 Difference]: With dead ends: 185 [2018-02-02 10:19:53,232 INFO L226 Difference]: Without dead ends: 166 [2018-02-02 10:19:53,232 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2018-02-02 10:19:53,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2018-02-02 10:19:53,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 164. [2018-02-02 10:19:53,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2018-02-02 10:19:53,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 175 transitions. [2018-02-02 10:19:53,235 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 175 transitions. Word has length 127 [2018-02-02 10:19:53,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:19:53,235 INFO L432 AbstractCegarLoop]: Abstraction has 164 states and 175 transitions. [2018-02-02 10:19:53,235 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 10:19:53,236 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 175 transitions. [2018-02-02 10:19:53,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-02-02 10:19:53,236 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:19:53,236 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:19:53,236 INFO L371 AbstractCegarLoop]: === Iteration 52 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 10:19:53,237 INFO L82 PathProgramCache]: Analyzing trace with hash 1376504268, now seen corresponding path program 3 times [2018-02-02 10:19:53,237 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:19:53,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:19:53,266 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:19:53,944 INFO L134 CoverageAnalysis]: Checked inductivity of 307 backedges. 3 proven. 82 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2018-02-02 10:19:53,944 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:19:53,944 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-02-02 10:19:53,944 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:19:53,944 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 3 proven. 23 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-02-02 10:19:53,944 INFO L182 omatonBuilderFactory]: Interpolants [13856#(and (= alloc_17_~i~0 0) (= alloc_17_~array.offset 0) (not (= alloc_17_~array.base |alloc_17_#t~ret3.base|))), 13857#(and (= alloc_17_~i~0 0) (= alloc_17_~array.offset 0) (not (= alloc_17_~array.base alloc_17_~p~0.base))), 13858#(and (= alloc_17_~i~0 0) (= alloc_17_~array.offset 0) (not (= alloc_17_~array.base (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~i~0)))))), 13859#(and (<= alloc_17_~i~0 1) (<= (+ (div (+ 0 (- alloc_17_~array.offset)) 4) 1) alloc_17_~i~0) (= alloc_17_~array.offset 0) (not (= alloc_17_~array.base (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 0)))), 13860#(and (<= alloc_17_~i~0 2) (= alloc_17_~array.offset 0) (not (= alloc_17_~array.base (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 0))) (<= (+ (div (+ 0 (- alloc_17_~array.offset)) 4) 2) alloc_17_~i~0)), 13861#(and (<= alloc_17_~i~0 3) (= alloc_17_~array.offset 0) (not (= alloc_17_~array.base (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 0))) (<= (+ (div (+ 0 (- alloc_17_~array.offset)) 4) 3) alloc_17_~i~0)), 13862#(and (= alloc_17_~array.offset 0) (not (= alloc_17_~array.base (select (store (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0)) 0) 0))) (<= (+ (div (+ 0 (- alloc_17_~array.offset)) 4) 2) alloc_17_~j~0) (<= alloc_17_~j~0 2)), 13863#(and (= alloc_17_~array.offset 0) (<= alloc_17_~j~0 1) (not (= alloc_17_~array.base (select (store (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0)) 0) 0)))), 13864#(and (= alloc_17_~array.offset 0) (= 1 (select |#valid| alloc_17_~array.base)) (<= alloc_17_~j~0 1) (not (= alloc_17_~array.base (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 0)))), 13865#(and (= alloc_17_~array.offset 0) (= 1 (select |#valid| alloc_17_~array.base)) (or (not (= alloc_17_~array.base (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0))))) (not (= 0 (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset)))) (<= alloc_17_~j~0 0)), 13866#(and (not (= alloc_17_~array.base (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0))))) (= alloc_17_~array.offset 0) (= 0 (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset)) (= 1 (select |#valid| alloc_17_~array.base))), 13867#(and (not (= alloc_17_~array.base |alloc_17_#t~mem6.base|)) (= 1 (select |#valid| alloc_17_~array.base))), 13868#(= 1 (select |#valid| alloc_17_~array.base)), 13845#true, 13846#false, 13847#(and (= 0 |ldv_malloc_#t~malloc1.offset|) (= 1 (select |#valid| |ldv_malloc_#t~malloc1.base|))), 13848#(and (= 0 |ldv_malloc_#res.offset|) (= 1 (select |#valid| |ldv_malloc_#res.base|))), 13849#(and (= 1 (select |#valid| |entry_point_#t~ret8.base|)) (= 0 |entry_point_#t~ret8.offset|)), 13850#(and (= 1 (select |#valid| entry_point_~array~0.base)) (= 0 entry_point_~array~0.offset)), 13851#(and (= 1 (select |#valid| |alloc_17_#in~array.base|)) (= 0 |alloc_17_#in~array.offset|)), 13852#(and (= alloc_17_~i~0 0) (= alloc_17_~array.offset 0) (= 1 (select |#valid| alloc_17_~array.base))), 13853#(= |#valid| |old(#valid)|), 13854#(= 0 (select |old(#valid)| |ldv_malloc_#t~malloc1.base|)), 13855#(= 0 (select |old(#valid)| |ldv_malloc_#res.base|))] [2018-02-02 10:19:53,945 INFO L134 CoverageAnalysis]: Checked inductivity of 307 backedges. 3 proven. 82 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2018-02-02 10:19:53,945 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-02-02 10:19:53,945 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-02-02 10:19:53,945 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=500, Unknown=0, NotChecked=0, Total=552 [2018-02-02 10:19:53,945 INFO L87 Difference]: Start difference. First operand 164 states and 175 transitions. Second operand 24 states. [2018-02-02 10:19:54,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:19:54,630 INFO L93 Difference]: Finished difference Result 168 states and 179 transitions. [2018-02-02 10:19:54,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-02-02 10:19:54,631 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 129 [2018-02-02 10:19:54,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:19:54,631 INFO L225 Difference]: With dead ends: 168 [2018-02-02 10:19:54,631 INFO L226 Difference]: Without dead ends: 168 [2018-02-02 10:19:54,632 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 1 SyntacticMatches, 5 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=142, Invalid=1340, Unknown=0, NotChecked=0, Total=1482 [2018-02-02 10:19:54,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2018-02-02 10:19:54,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 168. [2018-02-02 10:19:54,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2018-02-02 10:19:54,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 179 transitions. [2018-02-02 10:19:54,635 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 179 transitions. Word has length 129 [2018-02-02 10:19:54,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:19:54,635 INFO L432 AbstractCegarLoop]: Abstraction has 168 states and 179 transitions. [2018-02-02 10:19:54,636 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-02-02 10:19:54,636 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 179 transitions. [2018-02-02 10:19:54,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2018-02-02 10:19:54,637 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:19:54,637 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:19:54,637 INFO L371 AbstractCegarLoop]: === Iteration 53 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 10:19:54,637 INFO L82 PathProgramCache]: Analyzing trace with hash -120466543, now seen corresponding path program 5 times [2018-02-02 10:19:54,637 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:19:54,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:19:54,646 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:19:54,738 INFO L134 CoverageAnalysis]: Checked inductivity of 370 backedges. 0 proven. 80 refuted. 0 times theorem prover too weak. 290 trivial. 0 not checked. [2018-02-02 10:19:54,739 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:19:54,739 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-02-02 10:19:54,739 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:19:54,739 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2018-02-02 10:19:54,739 INFO L182 omatonBuilderFactory]: Interpolants [14240#(<= (+ alloc_17_~i~0 |alloc_17_#in~len|) (+ alloc_17_~len 2)), 14241#(<= (+ alloc_17_~i~0 |alloc_17_#in~len|) (+ alloc_17_~len 3)), 14242#(<= (+ alloc_17_~i~0 |alloc_17_#in~len|) (+ alloc_17_~len 4)), 14243#(<= (+ alloc_17_~i~0 |alloc_17_#in~len|) (+ alloc_17_~len 5)), 14244#(<= |alloc_17_#in~len| 5), 14235#true, 14236#false, 14237#(<= 10 entry_point_~len~0), 14238#(and (= alloc_17_~i~0 0) (<= |alloc_17_#in~len| alloc_17_~len)), 14239#(<= (+ alloc_17_~i~0 |alloc_17_#in~len|) (+ alloc_17_~len 1))] [2018-02-02 10:19:54,740 INFO L134 CoverageAnalysis]: Checked inductivity of 370 backedges. 0 proven. 80 refuted. 0 times theorem prover too weak. 290 trivial. 0 not checked. [2018-02-02 10:19:54,740 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 10:19:54,740 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 10:19:54,740 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2018-02-02 10:19:54,740 INFO L87 Difference]: Start difference. First operand 168 states and 179 transitions. Second operand 10 states. [2018-02-02 10:19:54,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:19:54,786 INFO L93 Difference]: Finished difference Result 251 states and 267 transitions. [2018-02-02 10:19:54,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 10:19:54,787 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 135 [2018-02-02 10:19:54,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:19:54,787 INFO L225 Difference]: With dead ends: 251 [2018-02-02 10:19:54,788 INFO L226 Difference]: Without dead ends: 248 [2018-02-02 10:19:54,788 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2018-02-02 10:19:54,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2018-02-02 10:19:54,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 175. [2018-02-02 10:19:54,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2018-02-02 10:19:54,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 188 transitions. [2018-02-02 10:19:54,791 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 188 transitions. Word has length 135 [2018-02-02 10:19:54,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:19:54,792 INFO L432 AbstractCegarLoop]: Abstraction has 175 states and 188 transitions. [2018-02-02 10:19:54,792 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 10:19:54,792 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 188 transitions. [2018-02-02 10:19:54,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-02-02 10:19:54,793 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:19:54,793 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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:19:54,793 INFO L371 AbstractCegarLoop]: === Iteration 54 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 10:19:54,793 INFO L82 PathProgramCache]: Analyzing trace with hash 963668539, now seen corresponding path program 4 times [2018-02-02 10:19:54,794 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:19:54,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:19:54,806 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:19:54,884 INFO L134 CoverageAnalysis]: Checked inductivity of 327 backedges. 39 proven. 36 refuted. 0 times theorem prover too weak. 252 trivial. 0 not checked. [2018-02-02 10:19:54,884 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:19:54,885 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-02-02 10:19:54,885 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:19:54,885 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2018-02-02 10:19:54,885 INFO L182 omatonBuilderFactory]: Interpolants [14673#true, 14674#false, 14675#(= alloc_17_~i~0 0), 14676#(<= alloc_17_~i~0 1), 14677#(<= alloc_17_~i~0 2), 14678#(<= alloc_17_~i~0 3), 14679#(<= alloc_17_~j~0 2), 14680#(<= alloc_17_~j~0 1), 14681#(<= alloc_17_~j~0 0), 14682#(<= (+ alloc_17_~j~0 1) 0)] [2018-02-02 10:19:54,885 INFO L134 CoverageAnalysis]: Checked inductivity of 327 backedges. 39 proven. 36 refuted. 0 times theorem prover too weak. 252 trivial. 0 not checked. [2018-02-02 10:19:54,885 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 10:19:54,885 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 10:19:54,886 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2018-02-02 10:19:54,886 INFO L87 Difference]: Start difference. First operand 175 states and 188 transitions. Second operand 10 states. [2018-02-02 10:19:54,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:19:54,968 INFO L93 Difference]: Finished difference Result 176 states and 187 transitions. [2018-02-02 10:19:54,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-02 10:19:54,968 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 136 [2018-02-02 10:19:54,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:19:54,969 INFO L225 Difference]: With dead ends: 176 [2018-02-02 10:19:54,969 INFO L226 Difference]: Without dead ends: 176 [2018-02-02 10:19:54,969 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2018-02-02 10:19:54,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2018-02-02 10:19:54,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 171. [2018-02-02 10:19:54,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2018-02-02 10:19:54,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 182 transitions. [2018-02-02 10:19:54,972 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 182 transitions. Word has length 136 [2018-02-02 10:19:54,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:19:54,972 INFO L432 AbstractCegarLoop]: Abstraction has 171 states and 182 transitions. [2018-02-02 10:19:54,972 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 10:19:54,972 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 182 transitions. [2018-02-02 10:19:54,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-02-02 10:19:54,973 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:19:54,973 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 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:19:54,973 INFO L371 AbstractCegarLoop]: === Iteration 55 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 10:19:54,973 INFO L82 PathProgramCache]: Analyzing trace with hash -1221474512, now seen corresponding path program 4 times [2018-02-02 10:19:54,973 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:19:54,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:19:54,992 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:19:55,604 INFO L134 CoverageAnalysis]: Checked inductivity of 357 backedges. 42 proven. 155 refuted. 0 times theorem prover too weak. 160 trivial. 0 not checked. [2018-02-02 10:19:55,604 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:19:55,605 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-02-02 10:19:55,605 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:19:55,605 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2018-02-02 10:19:55,605 INFO L182 omatonBuilderFactory]: Interpolants [15040#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10)), 15041#(= 0 |ldv_malloc_#t~malloc1.offset|), 15042#(= 0 |ldv_malloc_#res.offset|), 15043#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10) (= 0 |entry_point_#t~ret8.offset|)), 15044#(and (<= 10 entry_point_~len~0) (= entry_point_~array~0.offset 0) (<= entry_point_~len~0 10)), 15045#(= entry_point_~array~0.offset 0), 15046#(and (<= (+ (* 4 entry_point_~i~1) 4) (* 4 entry_point_~len~0)) (= entry_point_~array~0.offset 0)), 15047#(and (<= (* 4 entry_point_~i~1) (* 4 entry_point_~len~0)) (= entry_point_~array~0.offset 0)), 15048#(= 0 |alloc_17_#in~array.offset|), 15049#(and (= alloc_17_~i~0 0) (= alloc_17_~array.offset 0)), 15050#(= alloc_17_~array.offset 0), 15051#(and (= alloc_17_~array.offset 0) (= 0 |alloc_17_#t~ret3.offset|)), 15052#(and (= alloc_17_~array.offset 0) (= 0 alloc_17_~p~0.offset)), 15053#(and (= 0 (select (select |#memory_$Pointer$.offset| alloc_17_~array.base) (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset))) (= alloc_17_~array.offset 0)), 15054#(and (= alloc_17_~array.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| alloc_17_~array.base) (+ (* 4 alloc_17_~i~0) (- 4))))), 15055#(and (= alloc_17_~array.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| alloc_17_~array.base) (+ (* 4 alloc_17_~i~0) (- 8))))), 15056#(and (= alloc_17_~array.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| alloc_17_~array.base) (+ (* 4 alloc_17_~i~0) (- 12))))), 15057#(and (= alloc_17_~array.offset 0) (= 0 (select (store (select |#memory_$Pointer$.offset| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0)) 0) (+ (* 4 alloc_17_~j~0) (- 8))))), 15058#(and (= 0 (select (store (select |#memory_$Pointer$.offset| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0)) 0) (+ (* 4 alloc_17_~j~0) (- 4)))) (= alloc_17_~array.offset 0)), 15059#(and (= alloc_17_~array.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0))))), 15060#(= 0 |alloc_17_#t~mem6.offset|), 15038#true, 15039#false] [2018-02-02 10:19:55,605 INFO L134 CoverageAnalysis]: Checked inductivity of 357 backedges. 42 proven. 155 refuted. 0 times theorem prover too weak. 160 trivial. 0 not checked. [2018-02-02 10:19:55,605 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-02 10:19:55,605 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-02 10:19:55,605 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=447, Unknown=0, NotChecked=0, Total=506 [2018-02-02 10:19:55,606 INFO L87 Difference]: Start difference. First operand 171 states and 182 transitions. Second operand 23 states. [2018-02-02 10:19:56,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:19:56,053 INFO L93 Difference]: Finished difference Result 177 states and 188 transitions. [2018-02-02 10:19:56,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-02-02 10:19:56,053 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 140 [2018-02-02 10:19:56,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:19:56,053 INFO L225 Difference]: With dead ends: 177 [2018-02-02 10:19:56,054 INFO L226 Difference]: Without dead ends: 177 [2018-02-02 10:19:56,054 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 3 SyntacticMatches, 15 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 483 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=303, Invalid=1767, Unknown=0, NotChecked=0, Total=2070 [2018-02-02 10:19:56,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2018-02-02 10:19:56,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 173. [2018-02-02 10:19:56,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2018-02-02 10:19:56,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 185 transitions. [2018-02-02 10:19:56,056 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 185 transitions. Word has length 140 [2018-02-02 10:19:56,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:19:56,056 INFO L432 AbstractCegarLoop]: Abstraction has 173 states and 185 transitions. [2018-02-02 10:19:56,056 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-02 10:19:56,056 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 185 transitions. [2018-02-02 10:19:56,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-02-02 10:19:56,056 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:19:56,056 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 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:19:56,056 INFO L371 AbstractCegarLoop]: === Iteration 56 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 10:19:56,057 INFO L82 PathProgramCache]: Analyzing trace with hash -1221474511, now seen corresponding path program 5 times [2018-02-02 10:19:56,057 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:19:56,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:19:56,083 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:19:56,274 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:19:56,277 INFO L168 Benchmark]: Toolchain (without parser) took 44675.84 ms. Allocated memory was 397.9 MB in the beginning and 1.6 GB in the end (delta: 1.2 GB). Free memory was 354.8 MB in the beginning and 1.5 GB in the end (delta: -1.2 GB). Peak memory consumption was 1.2 GB. Max. memory is 5.3 GB. [2018-02-02 10:19:56,278 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 397.9 MB. Free memory is still 361.4 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-02 10:19:56,279 INFO L168 Benchmark]: CACSL2BoogieTranslator took 167.23 ms. Allocated memory is still 397.9 MB. Free memory was 354.8 MB in the beginning and 341.6 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 5.3 GB. [2018-02-02 10:19:56,279 INFO L168 Benchmark]: Boogie Preprocessor took 24.35 ms. Allocated memory is still 397.9 MB. Free memory was 341.6 MB in the beginning and 340.3 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-02-02 10:19:56,279 INFO L168 Benchmark]: RCFGBuilder took 251.23 ms. Allocated memory is still 397.9 MB. Free memory was 340.3 MB in the beginning and 318.1 MB in the end (delta: 22.2 MB). Peak memory consumption was 22.2 MB. Max. memory is 5.3 GB. [2018-02-02 10:19:56,279 INFO L168 Benchmark]: TraceAbstraction took 44229.86 ms. Allocated memory was 397.9 MB in the beginning and 1.6 GB in the end (delta: 1.2 GB). Free memory was 318.1 MB in the beginning and 1.5 GB in the end (delta: -1.2 GB). Peak memory consumption was 1.2 GB. Max. memory is 5.3 GB. [2018-02-02 10:19:56,281 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.12 ms. Allocated memory is still 397.9 MB. Free memory is still 361.4 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 167.23 ms. Allocated memory is still 397.9 MB. Free memory was 354.8 MB in the beginning and 341.6 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 24.35 ms. Allocated memory is still 397.9 MB. Free memory was 341.6 MB in the beginning and 340.3 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 251.23 ms. Allocated memory is still 397.9 MB. Free memory was 340.3 MB in the beginning and 318.1 MB in the end (delta: 22.2 MB). Peak memory consumption was 22.2 MB. Max. memory is 5.3 GB. * TraceAbstraction took 44229.86 ms. Allocated memory was 397.9 MB in the beginning and 1.6 GB in the end (delta: 1.2 GB). Free memory was 318.1 MB in the beginning and 1.5 GB in the end (delta: -1.2 GB). Peak memory consumption was 1.2 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/memleaks_test17_3_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-02_10-19-56-288.csv Completed graceful shutdown