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_2_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-26d9e06-m [2018-02-02 10:22:25,955 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-02 10:22:25,956 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-02 10:22:25,967 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-02 10:22:25,967 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-02 10:22:25,968 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-02 10:22:25,969 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-02 10:22:25,970 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-02 10:22:25,972 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-02 10:22:25,972 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-02 10:22:25,973 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-02 10:22:25,973 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-02 10:22:25,974 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-02 10:22:25,975 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-02 10:22:25,976 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-02 10:22:25,978 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-02 10:22:25,979 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-02 10:22:25,981 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-02 10:22:25,981 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-02 10:22:25,982 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-02 10:22:25,984 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-02 10:22:25,984 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-02 10:22:25,984 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-02 10:22:25,984 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-02 10:22:25,985 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-02 10:22:25,985 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-02 10:22:25,985 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-02 10:22:25,986 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-02 10:22:25,986 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-02 10:22:25,986 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-02 10:22:25,986 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-02 10:22:25,987 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:22:25,993 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-02 10:22:25,993 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-02 10:22:25,994 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-02 10:22:25,994 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-02 10:22:25,994 INFO L133 SettingsManager]: * Use SBE=true [2018-02-02 10:22:25,994 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-02 10:22:25,994 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-02 10:22:25,994 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-02 10:22:25,994 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-02 10:22:25,994 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-02 10:22:25,994 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-02 10:22:25,995 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-02 10:22:25,995 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-02 10:22:25,995 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-02 10:22:25,995 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-02 10:22:25,995 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-02 10:22:25,995 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-02 10:22:25,995 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-02 10:22:25,995 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-02 10:22:25,995 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-02 10:22:25,995 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 10:22:25,995 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-02 10:22:25,996 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-02-02 10:22:26,015 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-02 10:22:26,023 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-02 10:22:26,025 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-02 10:22:26,026 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-02 10:22:26,026 INFO L276 PluginConnector]: CDTParser initialized [2018-02-02 10:22:26,027 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test17_2_true-valid-memsafety_true-termination.i [2018-02-02 10:22:26,173 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-02 10:22:26,174 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-02 10:22:26,175 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-02 10:22:26,175 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-02 10:22:26,183 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-02 10:22:26,183 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 10:22:26" (1/1) ... [2018-02-02 10:22:26,186 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@270c7f26 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:22:26, skipping insertion in model container [2018-02-02 10:22:26,186 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 10:22:26" (1/1) ... [2018-02-02 10:22:26,196 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 10:22:26,230 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 10:22:26,319 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 10:22:26,337 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 10:22:26,345 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:22:26 WrapperNode [2018-02-02 10:22:26,345 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-02 10:22:26,346 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-02 10:22:26,346 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-02 10:22:26,346 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-02 10:22:26,359 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:22:26" (1/1) ... [2018-02-02 10:22:26,359 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:22:26" (1/1) ... [2018-02-02 10:22:26,366 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:22:26" (1/1) ... [2018-02-02 10:22:26,366 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:22:26" (1/1) ... [2018-02-02 10:22:26,370 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:22:26" (1/1) ... [2018-02-02 10:22:26,373 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:22:26" (1/1) ... [2018-02-02 10:22:26,374 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:22:26" (1/1) ... [2018-02-02 10:22:26,375 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-02 10:22:26,376 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-02 10:22:26,376 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-02 10:22:26,376 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-02 10:22:26,377 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:22:26" (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:22:26,424 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-02 10:22:26,424 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-02 10:22:26,424 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_positive [2018-02-02 10:22:26,425 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-02-02 10:22:26,425 INFO L136 BoogieDeclarations]: Found implementation of procedure alloc_17 [2018-02-02 10:22:26,425 INFO L136 BoogieDeclarations]: Found implementation of procedure free_17 [2018-02-02 10:22:26,425 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-02-02 10:22:26,425 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-02 10:22:26,425 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-02 10:22:26,425 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-02 10:22:26,425 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-02 10:22:26,425 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-02 10:22:26,426 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-02 10:22:26,426 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-02 10:22:26,426 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-02 10:22:26,426 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-02 10:22:26,426 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_positive [2018-02-02 10:22:26,426 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-02-02 10:22:26,426 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2018-02-02 10:22:26,426 INFO L128 BoogieDeclarations]: Found specification of procedure alloc_17 [2018-02-02 10:22:26,426 INFO L128 BoogieDeclarations]: Found specification of procedure free_17 [2018-02-02 10:22:26,427 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-02-02 10:22:26,427 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-02 10:22:26,427 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-02 10:22:26,427 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-02 10:22:26,620 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-02 10:22:26,620 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 10:22:26 BoogieIcfgContainer [2018-02-02 10:22:26,620 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-02 10:22:26,621 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-02 10:22:26,621 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-02 10:22:26,622 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-02 10:22:26,623 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.02 10:22:26" (1/3) ... [2018-02-02 10:22:26,623 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@cf0680b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 10:22:26, skipping insertion in model container [2018-02-02 10:22:26,623 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:22:26" (2/3) ... [2018-02-02 10:22:26,624 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@cf0680b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 10:22:26, skipping insertion in model container [2018-02-02 10:22:26,624 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 10:22:26" (3/3) ... [2018-02-02 10:22:26,626 INFO L107 eAbstractionObserver]: Analyzing ICFG memleaks_test17_2_true-valid-memsafety_true-termination.i [2018-02-02 10:22:26,633 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-02-02 10:22:26,637 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 17 error locations. [2018-02-02 10:22:26,669 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-02 10:22:26,670 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-02 10:22:26,670 INFO L324 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-02-02 10:22:26,670 INFO L325 AbstractCegarLoop]: Backedges is CANONICAL [2018-02-02 10:22:26,670 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-02 10:22:26,670 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-02 10:22:26,670 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-02 10:22:26,670 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-02 10:22:26,671 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-02 10:22:26,683 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states. [2018-02-02 10:22:26,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-02 10:22:26,692 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:22:26,693 INFO L351 BasicCegarLoop]: trace histogram [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:22:26,693 INFO L371 AbstractCegarLoop]: === Iteration 1 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 10:22:26,697 INFO L82 PathProgramCache]: Analyzing trace with hash 280514151, now seen corresponding path program 1 times [2018-02-02 10:22:26,747 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:22:26,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:22:26,790 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:22:26,864 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:22:26,866 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:22:26,866 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-02 10:22:26,866 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:22:26,867 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:22:26,867 INFO L182 omatonBuilderFactory]: Interpolants [85#true, 86#false, 87#(= |#valid| |old(#valid)|)] [2018-02-02 10:22:26,867 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:22:26,868 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-02 10:22:26,876 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-02 10:22:26,877 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 10:22:26,878 INFO L87 Difference]: Start difference. First operand 82 states. Second operand 3 states. [2018-02-02 10:22:27,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:22:27,090 INFO L93 Difference]: Finished difference Result 133 states and 154 transitions. [2018-02-02 10:22:27,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-02 10:22:27,091 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-02-02 10:22:27,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:22:27,101 INFO L225 Difference]: With dead ends: 133 [2018-02-02 10:22:27,101 INFO L226 Difference]: Without dead ends: 127 [2018-02-02 10:22:27,102 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:22:27,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-02-02 10:22:27,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 83. [2018-02-02 10:22:27,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-02-02 10:22:27,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 92 transitions. [2018-02-02 10:22:27,138 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 92 transitions. Word has length 23 [2018-02-02 10:22:27,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:22:27,139 INFO L432 AbstractCegarLoop]: Abstraction has 83 states and 92 transitions. [2018-02-02 10:22:27,139 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-02 10:22:27,139 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 92 transitions. [2018-02-02 10:22:27,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-02 10:22:27,140 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:22:27,140 INFO L351 BasicCegarLoop]: trace histogram [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:22:27,140 INFO L371 AbstractCegarLoop]: === Iteration 2 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 10:22:27,140 INFO L82 PathProgramCache]: Analyzing trace with hash 279746761, now seen corresponding path program 1 times [2018-02-02 10:22:27,142 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:22:27,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:22:27,157 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:22:27,206 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:22:27,206 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:22:27,206 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 10:22:27,206 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:22:27,207 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:22:27,207 INFO L182 omatonBuilderFactory]: Interpolants [304#true, 305#false, 306#(and (= 0 |ldv_malloc_#res.offset|) (= 0 |ldv_malloc_#res.base|)), 307#(and (= 0 |entry_point_#t~ret12.base|) (= 0 |entry_point_#t~ret12.offset|)), 308#(and (= entry_point_~array~0.base 0) (= 0 entry_point_~array~0.offset))] [2018-02-02 10:22:27,207 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:22:27,208 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 10:22:27,208 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 10:22:27,208 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:22:27,208 INFO L87 Difference]: Start difference. First operand 83 states and 92 transitions. Second operand 5 states. [2018-02-02 10:22:27,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:22:27,227 INFO L93 Difference]: Finished difference Result 85 states and 93 transitions. [2018-02-02 10:22:27,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 10:22:27,227 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2018-02-02 10:22:27,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:22:27,228 INFO L225 Difference]: With dead ends: 85 [2018-02-02 10:22:27,228 INFO L226 Difference]: Without dead ends: 83 [2018-02-02 10:22:27,228 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:22:27,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-02-02 10:22:27,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 81. [2018-02-02 10:22:27,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-02-02 10:22:27,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 89 transitions. [2018-02-02 10:22:27,233 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 89 transitions. Word has length 23 [2018-02-02 10:22:27,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:22:27,233 INFO L432 AbstractCegarLoop]: Abstraction has 81 states and 89 transitions. [2018-02-02 10:22:27,233 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 10:22:27,233 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 89 transitions. [2018-02-02 10:22:27,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-02-02 10:22:27,233 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:22:27,234 INFO L351 BasicCegarLoop]: trace histogram [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:22:27,234 INFO L371 AbstractCegarLoop]: === Iteration 3 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 10:22:27,234 INFO L82 PathProgramCache]: Analyzing trace with hash -1161746679, now seen corresponding path program 1 times [2018-02-02 10:22:27,235 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:22:27,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:22:27,250 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:22:27,285 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:22:27,285 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:22:27,285 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 10:22:27,285 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:22:27,285 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:22:27,286 INFO L182 omatonBuilderFactory]: Interpolants [480#(not (= entry_point_~array~0.base 0)), 475#true, 476#false, 477#(not (= |ldv_malloc_#t~malloc2.base| 0)), 478#(not (= |ldv_malloc_#res.base| 0)), 479#(not (= |entry_point_#t~ret12.base| 0))] [2018-02-02 10:22:27,286 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:22:27,286 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 10:22:27,286 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 10:22:27,286 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:22:27,286 INFO L87 Difference]: Start difference. First operand 81 states and 89 transitions. Second operand 6 states. [2018-02-02 10:22:27,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:22:27,328 INFO L93 Difference]: Finished difference Result 81 states and 88 transitions. [2018-02-02 10:22:27,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 10:22:27,329 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2018-02-02 10:22:27,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:22:27,330 INFO L225 Difference]: With dead ends: 81 [2018-02-02 10:22:27,330 INFO L226 Difference]: Without dead ends: 81 [2018-02-02 10:22:27,330 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:22:27,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-02-02 10:22:27,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2018-02-02 10:22:27,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-02-02 10:22:27,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 88 transitions. [2018-02-02 10:22:27,335 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 88 transitions. Word has length 25 [2018-02-02 10:22:27,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:22:27,336 INFO L432 AbstractCegarLoop]: Abstraction has 81 states and 88 transitions. [2018-02-02 10:22:27,336 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 10:22:27,336 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 88 transitions. [2018-02-02 10:22:27,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-02-02 10:22:27,336 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:22:27,337 INFO L351 BasicCegarLoop]: trace histogram [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:22:27,337 INFO L371 AbstractCegarLoop]: === Iteration 4 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 10:22:27,337 INFO L82 PathProgramCache]: Analyzing trace with hash -1162514069, now seen corresponding path program 1 times [2018-02-02 10:22:27,338 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:22:27,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:22:27,351 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:22:27,389 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:22:27,390 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:22:27,390 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 10:22:27,390 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:22:27,390 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:22:27,390 INFO L182 omatonBuilderFactory]: Interpolants [645#true, 646#false, 647#(= 1 (select |#valid| |ldv_malloc_#t~malloc2.base|)), 648#(= 1 (select |#valid| |ldv_malloc_#res.base|)), 649#(= 1 (select |#valid| |entry_point_#t~ret12.base|)), 650#(= 1 (select |#valid| entry_point_~array~0.base))] [2018-02-02 10:22:27,390 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:22:27,391 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 10:22:27,391 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 10:22:27,391 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:22:27,391 INFO L87 Difference]: Start difference. First operand 81 states and 88 transitions. Second operand 6 states. [2018-02-02 10:22:27,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:22:27,472 INFO L93 Difference]: Finished difference Result 80 states and 87 transitions. [2018-02-02 10:22:27,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 10:22:27,473 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2018-02-02 10:22:27,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:22:27,474 INFO L225 Difference]: With dead ends: 80 [2018-02-02 10:22:27,474 INFO L226 Difference]: Without dead ends: 80 [2018-02-02 10:22:27,474 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:22:27,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-02-02 10:22:27,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2018-02-02 10:22:27,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-02-02 10:22:27,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 87 transitions. [2018-02-02 10:22:27,479 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 87 transitions. Word has length 25 [2018-02-02 10:22:27,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:22:27,479 INFO L432 AbstractCegarLoop]: Abstraction has 80 states and 87 transitions. [2018-02-02 10:22:27,479 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 10:22:27,479 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 87 transitions. [2018-02-02 10:22:27,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-02-02 10:22:27,480 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:22:27,480 INFO L351 BasicCegarLoop]: trace histogram [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:22:27,480 INFO L371 AbstractCegarLoop]: === Iteration 5 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 10:22:27,480 INFO L82 PathProgramCache]: Analyzing trace with hash -1162514068, now seen corresponding path program 1 times [2018-02-02 10:22:27,481 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:22:27,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:22:27,503 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:22:27,721 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:22:27,722 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:22:27,722 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-02-02 10:22:27,722 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:22:27,722 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:22:27,722 INFO L182 omatonBuilderFactory]: Interpolants [816#(<= 1 |entry_point_#t~ret11|), 817#(and (<= entry_point_~len~0 16777215) (<= 1 entry_point_~len~0)), 818#(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) 1) 0))), 819#(and (= 0 |ldv_malloc_#t~malloc2.offset|) (or (<= |ldv_malloc_#in~size| (select |#length| |ldv_malloc_#t~malloc2.base|)) (<= (+ |ldv_malloc_#in~size| 1) 0) (<= 2147483648 |ldv_malloc_#in~size|))), 820#(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|))), 821#(and (<= 4 (select |#length| |entry_point_#t~ret12.base|)) (= 0 |entry_point_#t~ret12.offset|)), 822#(and (= entry_point_~array~0.offset 0) (<= 4 (select |#length| entry_point_~array~0.base))), 823#(and (= entry_point_~array~0.offset 0) (<= 4 (select |#length| entry_point_~array~0.base)) (= entry_point_~i~2 0)), 813#true, 814#false, 815#(<= 1 |ldv_positive_#res|)] [2018-02-02 10:22:27,723 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:22:27,723 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-02 10:22:27,723 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-02 10:22:27,723 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2018-02-02 10:22:27,724 INFO L87 Difference]: Start difference. First operand 80 states and 87 transitions. Second operand 11 states. [2018-02-02 10:22:27,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:22:27,966 INFO L93 Difference]: Finished difference Result 84 states and 91 transitions. [2018-02-02 10:22:27,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-02 10:22:27,967 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 25 [2018-02-02 10:22:27,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:22:27,968 INFO L225 Difference]: With dead ends: 84 [2018-02-02 10:22:27,968 INFO L226 Difference]: Without dead ends: 84 [2018-02-02 10:22:27,969 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2018-02-02 10:22:27,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-02-02 10:22:27,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 83. [2018-02-02 10:22:27,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-02-02 10:22:27,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 90 transitions. [2018-02-02 10:22:27,973 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 90 transitions. Word has length 25 [2018-02-02 10:22:27,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:22:27,974 INFO L432 AbstractCegarLoop]: Abstraction has 83 states and 90 transitions. [2018-02-02 10:22:27,974 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-02 10:22:27,974 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 90 transitions. [2018-02-02 10:22:27,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-02-02 10:22:27,975 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:22:27,975 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:22:27,975 INFO L371 AbstractCegarLoop]: === Iteration 6 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 10:22:27,975 INFO L82 PathProgramCache]: Analyzing trace with hash -1767740413, now seen corresponding path program 1 times [2018-02-02 10:22:27,976 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:22:27,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:22:27,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:22:28,208 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:22:28,208 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:22:28,208 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-02-02 10:22:28,209 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:22:28,209 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:22:28,209 INFO L182 omatonBuilderFactory]: Interpolants [1008#(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))), 1009#(and (<= 0 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset)) (<= (* 4 entry_point_~len~0) (select |#length| entry_point_~array~0.base)) (= entry_point_~array~0.offset 0)), 1010#(and (<= (* 4 entry_point_~len~0) (select |#length| entry_point_~array~0.base)) (= entry_point_~array~0.offset 0) (<= 4 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset))), 1011#(and (<= (+ (* 4 entry_point_~i~2) 4) (select |#length| entry_point_~array~0.base)) (= entry_point_~array~0.offset 0) (<= 4 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset))), 1001#true, 1002#false, 1003#(<= entry_point_~len~0 16777215), 1004#(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))), 1005#(or (<= (+ (select |#length| |ldv_malloc_#t~malloc2.base|) 4294967296) |ldv_malloc_#in~size|) (<= (+ (select |#length| |ldv_malloc_#t~malloc2.base|) 1) 0) (and (<= |ldv_malloc_#in~size| (select |#length| |ldv_malloc_#t~malloc2.base|)) (= 0 |ldv_malloc_#t~malloc2.offset|))), 1006#(or (<= (+ (select |#length| |ldv_malloc_#res.base|) 4294967296) |ldv_malloc_#in~size|) (<= (+ (select |#length| |ldv_malloc_#res.base|) 1) 0) (and (= 0 |ldv_malloc_#res.offset|) (<= |ldv_malloc_#in~size| (select |#length| |ldv_malloc_#res.base|)))), 1007#(or (<= (+ (select |#length| |entry_point_#t~ret12.base|) 1) 0) (and (<= (* 4 entry_point_~len~0) (select |#length| |entry_point_#t~ret12.base|)) (= 0 |entry_point_#t~ret12.offset|)))] [2018-02-02 10:22:28,209 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:22:28,210 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-02 10:22:28,210 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-02 10:22:28,210 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-02-02 10:22:28,210 INFO L87 Difference]: Start difference. First operand 83 states and 90 transitions. Second operand 11 states. [2018-02-02 10:22:28,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:22:28,416 INFO L93 Difference]: Finished difference Result 83 states and 90 transitions. [2018-02-02 10:22:28,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-02 10:22:28,416 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 29 [2018-02-02 10:22:28,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:22:28,417 INFO L225 Difference]: With dead ends: 83 [2018-02-02 10:22:28,417 INFO L226 Difference]: Without dead ends: 83 [2018-02-02 10:22:28,417 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=64, Invalid=242, Unknown=0, NotChecked=0, Total=306 [2018-02-02 10:22:28,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-02-02 10:22:28,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 81. [2018-02-02 10:22:28,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-02-02 10:22:28,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 88 transitions. [2018-02-02 10:22:28,423 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 88 transitions. Word has length 29 [2018-02-02 10:22:28,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:22:28,423 INFO L432 AbstractCegarLoop]: Abstraction has 81 states and 88 transitions. [2018-02-02 10:22:28,423 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-02 10:22:28,423 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 88 transitions. [2018-02-02 10:22:28,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-02-02 10:22:28,424 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:22:28,424 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, 1, 1, 1, 1, 1, 1] [2018-02-02 10:22:28,424 INFO L371 AbstractCegarLoop]: === Iteration 7 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 10:22:28,424 INFO L82 PathProgramCache]: Analyzing trace with hash 1224527730, now seen corresponding path program 1 times [2018-02-02 10:22:28,427 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:22:28,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:22:28,435 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:22:28,471 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:22:28,471 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:22:28,471 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 10:22:28,471 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:22:28,471 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:22:28,471 INFO L182 omatonBuilderFactory]: Interpolants [1190#true, 1191#false, 1192#(and (= 0 |ldv_malloc_#res.offset|) (= 0 |ldv_malloc_#res.base|)), 1193#(and (= 0 |alloc_17_#t~ret4.offset|) (= 0 |alloc_17_#t~ret4.base|)), 1194#(and (= 0 alloc_17_~p~0.offset) (= alloc_17_~p~0.base 0))] [2018-02-02 10:22:28,471 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:22:28,472 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 10:22:28,472 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 10:22:28,472 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:22:28,472 INFO L87 Difference]: Start difference. First operand 81 states and 88 transitions. Second operand 5 states. [2018-02-02 10:22:28,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:22:28,489 INFO L93 Difference]: Finished difference Result 85 states and 92 transitions. [2018-02-02 10:22:28,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 10:22:28,490 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2018-02-02 10:22:28,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:22:28,491 INFO L225 Difference]: With dead ends: 85 [2018-02-02 10:22:28,491 INFO L226 Difference]: Without dead ends: 85 [2018-02-02 10:22:28,491 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:22:28,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-02-02 10:22:28,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 83. [2018-02-02 10:22:28,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-02-02 10:22:28,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 90 transitions. [2018-02-02 10:22:28,496 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 90 transitions. Word has length 40 [2018-02-02 10:22:28,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:22:28,496 INFO L432 AbstractCegarLoop]: Abstraction has 83 states and 90 transitions. [2018-02-02 10:22:28,496 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 10:22:28,496 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 90 transitions. [2018-02-02 10:22:28,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-02-02 10:22:28,497 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:22:28,498 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, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:22:28,498 INFO L371 AbstractCegarLoop]: === Iteration 8 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 10:22:28,498 INFO L82 PathProgramCache]: Analyzing trace with hash 755727615, now seen corresponding path program 1 times [2018-02-02 10:22:28,499 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:22:28,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:22:28,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:22:28,551 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:22:28,551 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:22:28,551 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 10:22:28,552 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:22:28,552 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:22:28,552 INFO L182 omatonBuilderFactory]: Interpolants [1363#true, 1364#false, 1365#(= 1 (select |#valid| entry_point_~array~0.base)), 1366#(= |#valid| |old(#valid)|), 1367#(= 1 (select |#valid| |free_17_#in~array.base|)), 1368#(= 1 (select |#valid| free_17_~array.base))] [2018-02-02 10:22:28,552 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:22:28,552 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 10:22:28,553 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 10:22:28,553 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:22:28,553 INFO L87 Difference]: Start difference. First operand 83 states and 90 transitions. Second operand 6 states. [2018-02-02 10:22:28,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:22:28,662 INFO L93 Difference]: Finished difference Result 126 states and 140 transitions. [2018-02-02 10:22:28,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 10:22:28,663 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 41 [2018-02-02 10:22:28,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:22:28,664 INFO L225 Difference]: With dead ends: 126 [2018-02-02 10:22:28,664 INFO L226 Difference]: Without dead ends: 126 [2018-02-02 10:22:28,664 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-02-02 10:22:28,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-02-02 10:22:28,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 108. [2018-02-02 10:22:28,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-02-02 10:22:28,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 124 transitions. [2018-02-02 10:22:28,670 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 124 transitions. Word has length 41 [2018-02-02 10:22:28,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:22:28,671 INFO L432 AbstractCegarLoop]: Abstraction has 108 states and 124 transitions. [2018-02-02 10:22:28,671 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 10:22:28,671 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 124 transitions. [2018-02-02 10:22:28,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-02-02 10:22:28,672 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:22:28,672 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, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:22:28,672 INFO L371 AbstractCegarLoop]: === Iteration 9 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 10:22:28,673 INFO L82 PathProgramCache]: Analyzing trace with hash 755727616, now seen corresponding path program 1 times [2018-02-02 10:22:28,674 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:22:28,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:22:28,684 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:22:28,723 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:22:28,724 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:22:28,724 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-02 10:22:28,724 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:22:28,724 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:22:28,724 INFO L182 omatonBuilderFactory]: Interpolants [1609#true, 1610#false, 1611#(<= 1 |ldv_positive_#res|), 1612#(<= 1 |entry_point_#t~ret11|), 1613#(<= 1 entry_point_~len~0), 1614#(and (= alloc_17_~i~0 0) (= alloc_17_~len |alloc_17_#in~len|)), 1615#(<= |alloc_17_#in~len| 0)] [2018-02-02 10:22:28,725 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:22:28,725 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 10:22:28,725 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 10:22:28,725 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-02 10:22:28,725 INFO L87 Difference]: Start difference. First operand 108 states and 124 transitions. Second operand 7 states. [2018-02-02 10:22:28,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:22:28,766 INFO L93 Difference]: Finished difference Result 133 states and 150 transitions. [2018-02-02 10:22:28,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 10:22:28,766 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 41 [2018-02-02 10:22:28,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:22:28,767 INFO L225 Difference]: With dead ends: 133 [2018-02-02 10:22:28,767 INFO L226 Difference]: Without dead ends: 130 [2018-02-02 10:22:28,767 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-02-02 10:22:28,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-02-02 10:22:28,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 107. [2018-02-02 10:22:28,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-02-02 10:22:28,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 122 transitions. [2018-02-02 10:22:28,770 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 122 transitions. Word has length 41 [2018-02-02 10:22:28,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:22:28,771 INFO L432 AbstractCegarLoop]: Abstraction has 107 states and 122 transitions. [2018-02-02 10:22:28,771 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 10:22:28,771 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 122 transitions. [2018-02-02 10:22:28,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-02-02 10:22:28,771 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:22:28,772 INFO L351 BasicCegarLoop]: trace histogram [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:22:28,772 INFO L371 AbstractCegarLoop]: === Iteration 10 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 10:22:28,772 INFO L82 PathProgramCache]: Analyzing trace with hash 1441386836, now seen corresponding path program 1 times [2018-02-02 10:22:28,772 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:22:28,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:22:28,783 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:22:28,887 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 10:22:28,888 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:22:28,888 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-02-02 10:22:28,888 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:22:28,888 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:22:28,889 INFO L182 omatonBuilderFactory]: Interpolants [1858#true, 1859#false, 1860#(= 1 (select |#valid| |ldv_malloc_#t~malloc2.base|)), 1861#(= 1 (select |#valid| |ldv_malloc_#res.base|)), 1862#(= 1 (select |#valid| |entry_point_#t~ret12.base|)), 1863#(= 1 (select |#valid| entry_point_~array~0.base)), 1864#(= 1 (select |#valid| |alloc_17_#in~array.base|)), 1865#(= 1 (select |#valid| alloc_17_~array.base)), 1866#(= |#valid| |old(#valid)|), 1867#(and (= 1 (select |#valid| |ldv_malloc_#t~malloc2.base|)) (= |#valid| (store |old(#valid)| |ldv_malloc_#t~malloc2.base| (select |#valid| |ldv_malloc_#t~malloc2.base|)))), 1868#(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:22:28,889 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 10:22:28,889 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-02 10:22:28,889 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-02 10:22:28,889 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-02-02 10:22:28,889 INFO L87 Difference]: Start difference. First operand 107 states and 122 transitions. Second operand 11 states. [2018-02-02 10:22:29,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:22:29,154 INFO L93 Difference]: Finished difference Result 153 states and 175 transitions. [2018-02-02 10:22:29,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-02 10:22:29,154 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 42 [2018-02-02 10:22:29,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:22:29,156 INFO L225 Difference]: With dead ends: 153 [2018-02-02 10:22:29,156 INFO L226 Difference]: Without dead ends: 153 [2018-02-02 10:22:29,156 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:22:29,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2018-02-02 10:22:29,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 112. [2018-02-02 10:22:29,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-02-02 10:22:29,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 130 transitions. [2018-02-02 10:22:29,162 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 130 transitions. Word has length 42 [2018-02-02 10:22:29,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:22:29,163 INFO L432 AbstractCegarLoop]: Abstraction has 112 states and 130 transitions. [2018-02-02 10:22:29,163 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-02 10:22:29,163 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 130 transitions. [2018-02-02 10:22:29,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-02-02 10:22:29,164 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:22:29,164 INFO L351 BasicCegarLoop]: trace histogram [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:22:29,164 INFO L371 AbstractCegarLoop]: === Iteration 11 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 10:22:29,165 INFO L82 PathProgramCache]: Analyzing trace with hash 1441386837, now seen corresponding path program 1 times [2018-02-02 10:22:29,166 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:22:29,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:22:29,176 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:22:29,297 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:22:29,298 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:22:29,298 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-02 10:22:29,298 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:22:29,298 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:22:29,298 INFO L182 omatonBuilderFactory]: Interpolants [2148#true, 2149#false, 2150#(and (= (select |#valid| |ldv_malloc_#t~malloc2.base|) 1) (= 0 |ldv_malloc_#t~malloc2.offset|)), 2151#(and (= 0 |ldv_malloc_#res.offset|) (= (select |#valid| |ldv_malloc_#res.base|) 1)), 2152#(and (= (select |#valid| |entry_point_#t~ret12.base|) 1) (= 0 |entry_point_#t~ret12.offset|)), 2153#(and (= 0 entry_point_~array~0.offset) (= (select |#valid| entry_point_~array~0.base) 1)), 2154#(and (= 0 entry_point_~array~0.offset) (= (select |#valid| entry_point_~array~0.base) 1) (<= 4 (select |#length| entry_point_~array~0.base))), 2155#(and (= (select |#valid| |alloc_17_#in~array.base|) 1) (<= 4 (select |#length| |alloc_17_#in~array.base|)) (= 0 |alloc_17_#in~array.offset|)), 2156#(and (= (select |#valid| alloc_17_~array.base) 1) (= alloc_17_~i~0 0) (= alloc_17_~array.offset 0) (<= 4 (select |#length| alloc_17_~array.base))), 2157#(and (= |#valid| |old(#valid)|) (= |old(#length)| |#length|)), 2158#(and (= |#length| (store |old(#length)| |ldv_malloc_#t~malloc2.base| (select |#length| |ldv_malloc_#t~malloc2.base|))) (= 0 (select |old(#valid)| |ldv_malloc_#t~malloc2.base|))), 2159#(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|))))), 2160#(and (= alloc_17_~i~0 0) (= alloc_17_~array.offset 0) (<= 4 (select |#length| alloc_17_~array.base)))] [2018-02-02 10:22:29,299 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:22:29,299 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-02 10:22:29,299 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-02 10:22:29,299 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2018-02-02 10:22:29,299 INFO L87 Difference]: Start difference. First operand 112 states and 130 transitions. Second operand 13 states. [2018-02-02 10:22:29,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:22:29,798 INFO L93 Difference]: Finished difference Result 186 states and 211 transitions. [2018-02-02 10:22:29,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-02 10:22:29,798 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 42 [2018-02-02 10:22:29,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:22:29,800 INFO L225 Difference]: With dead ends: 186 [2018-02-02 10:22:29,800 INFO L226 Difference]: Without dead ends: 186 [2018-02-02 10:22:29,801 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=384, Unknown=0, NotChecked=0, Total=462 [2018-02-02 10:22:29,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2018-02-02 10:22:29,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 116. [2018-02-02 10:22:29,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-02-02 10:22:29,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 135 transitions. [2018-02-02 10:22:29,806 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 135 transitions. Word has length 42 [2018-02-02 10:22:29,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:22:29,806 INFO L432 AbstractCegarLoop]: Abstraction has 116 states and 135 transitions. [2018-02-02 10:22:29,807 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-02 10:22:29,807 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 135 transitions. [2018-02-02 10:22:29,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-02-02 10:22:29,808 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:22:29,808 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:22:29,808 INFO L371 AbstractCegarLoop]: === Iteration 12 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 10:22:29,808 INFO L82 PathProgramCache]: Analyzing trace with hash -1548167688, now seen corresponding path program 1 times [2018-02-02 10:22:29,810 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:22:29,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:22:29,820 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:22:29,845 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:22:29,845 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:22:29,845 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 10:22:29,845 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:22:29,846 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:22:29,846 INFO L182 omatonBuilderFactory]: Interpolants [2481#true, 2482#false, 2483#(= alloc_17_~i~0 0), 2484#(<= (+ alloc_17_~j~0 1) 0)] [2018-02-02 10:22:29,846 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:22:29,846 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 10:22:29,846 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 10:22:29,846 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 10:22:29,847 INFO L87 Difference]: Start difference. First operand 116 states and 135 transitions. Second operand 4 states. [2018-02-02 10:22:29,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:22:29,876 INFO L93 Difference]: Finished difference Result 125 states and 143 transitions. [2018-02-02 10:22:29,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 10:22:29,876 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 43 [2018-02-02 10:22:29,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:22:29,877 INFO L225 Difference]: With dead ends: 125 [2018-02-02 10:22:29,877 INFO L226 Difference]: Without dead ends: 125 [2018-02-02 10:22:29,878 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:22:29,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-02-02 10:22:29,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 119. [2018-02-02 10:22:29,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-02-02 10:22:29,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 137 transitions. [2018-02-02 10:22:29,882 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 137 transitions. Word has length 43 [2018-02-02 10:22:29,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:22:29,882 INFO L432 AbstractCegarLoop]: Abstraction has 119 states and 137 transitions. [2018-02-02 10:22:29,882 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 10:22:29,883 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 137 transitions. [2018-02-02 10:22:29,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-02-02 10:22:29,883 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:22:29,884 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:22:29,884 INFO L371 AbstractCegarLoop]: === Iteration 13 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 10:22:29,884 INFO L82 PathProgramCache]: Analyzing trace with hash 1943737008, now seen corresponding path program 1 times [2018-02-02 10:22:29,885 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:22:29,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:22:29,894 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:22:30,000 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:22:30,001 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:22:30,001 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-02-02 10:22:30,001 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:22:30,001 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:22:30,001 INFO L182 omatonBuilderFactory]: Interpolants [2736#(= 0 entry_point_~array~0.offset), 2737#(and (= 0 entry_point_~array~0.offset) (<= 4 (select |#length| entry_point_~array~0.base))), 2738#(= |old(#length)| |#length|), 2739#(and (= 0 |free_17_#in~array.offset|) (<= 4 (select |#length| |free_17_#in~array.base|))), 2740#(and (<= 4 (select |#length| free_17_~array.base)) (= free_17_~i~1 0) (= free_17_~array.offset 0)), 2731#true, 2732#false, 2733#(= 0 |ldv_malloc_#t~malloc2.offset|), 2734#(= 0 |ldv_malloc_#res.offset|), 2735#(= 0 |entry_point_#t~ret12.offset|)] [2018-02-02 10:22:30,001 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:22:30,002 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 10:22:30,002 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 10:22:30,002 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-02-02 10:22:30,002 INFO L87 Difference]: Start difference. First operand 119 states and 137 transitions. Second operand 10 states. [2018-02-02 10:22:30,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:22:30,173 INFO L93 Difference]: Finished difference Result 140 states and 156 transitions. [2018-02-02 10:22:30,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-02 10:22:30,173 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 51 [2018-02-02 10:22:30,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:22:30,174 INFO L225 Difference]: With dead ends: 140 [2018-02-02 10:22:30,174 INFO L226 Difference]: Without dead ends: 140 [2018-02-02 10:22:30,174 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2018-02-02 10:22:30,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2018-02-02 10:22:30,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 125. [2018-02-02 10:22:30,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-02-02 10:22:30,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 145 transitions. [2018-02-02 10:22:30,178 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 145 transitions. Word has length 51 [2018-02-02 10:22:30,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:22:30,178 INFO L432 AbstractCegarLoop]: Abstraction has 125 states and 145 transitions. [2018-02-02 10:22:30,178 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 10:22:30,179 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 145 transitions. [2018-02-02 10:22:30,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-02-02 10:22:30,179 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:22:30,179 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:22:30,180 INFO L371 AbstractCegarLoop]: === Iteration 14 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 10:22:30,180 INFO L82 PathProgramCache]: Analyzing trace with hash 126305131, now seen corresponding path program 1 times [2018-02-02 10:22:30,181 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:22:30,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:22:30,194 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:22:30,356 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 10:22:30,356 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:22:30,356 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-02 10:22:30,356 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:22:30,357 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:22:30,357 INFO L182 omatonBuilderFactory]: Interpolants [3014#true, 3015#false, 3016#(= 0 |ldv_malloc_#t~malloc2.offset|), 3017#(= 0 |ldv_malloc_#res.offset|), 3018#(= 0 |entry_point_#t~ret12.offset|), 3019#(= entry_point_~array~0.offset 0), 3020#(and (= 0 entry_point_~array~0.offset) (= entry_point_~i~2 0)), 3021#(and (= entry_point_~array~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset))) (= entry_point_~i~2 0)), 3022#(and (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) 0)) (= 0 entry_point_~array~0.offset)), 3023#(= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|), 3024#(and (= 0 |free_17_#in~array.offset|) (= 0 (select (select |#memory_$Pointer$.offset| |free_17_#in~array.base|) 0))), 3025#(and (= 0 (select (select |#memory_$Pointer$.offset| free_17_~array.base) (+ (* 4 free_17_~i~1) free_17_~array.offset))) (= 0 (+ (* 4 free_17_~i~1) free_17_~array.offset))), 3026#(= 0 |free_17_#t~mem10.offset|)] [2018-02-02 10:22:30,357 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 10:22:30,357 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-02 10:22:30,358 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-02 10:22:30,358 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2018-02-02 10:22:30,358 INFO L87 Difference]: Start difference. First operand 125 states and 145 transitions. Second operand 13 states. [2018-02-02 10:22:30,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:22:30,638 INFO L93 Difference]: Finished difference Result 164 states and 187 transitions. [2018-02-02 10:22:30,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-02 10:22:30,640 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 52 [2018-02-02 10:22:30,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:22:30,641 INFO L225 Difference]: With dead ends: 164 [2018-02-02 10:22:30,641 INFO L226 Difference]: Without dead ends: 164 [2018-02-02 10:22:30,641 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=464, Unknown=0, NotChecked=0, Total=552 [2018-02-02 10:22:30,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2018-02-02 10:22:30,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 146. [2018-02-02 10:22:30,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-02-02 10:22:30,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 176 transitions. [2018-02-02 10:22:30,646 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 176 transitions. Word has length 52 [2018-02-02 10:22:30,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:22:30,646 INFO L432 AbstractCegarLoop]: Abstraction has 146 states and 176 transitions. [2018-02-02 10:22:30,646 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-02 10:22:30,646 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 176 transitions. [2018-02-02 10:22:30,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-02-02 10:22:30,647 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:22:30,647 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:22:30,648 INFO L371 AbstractCegarLoop]: === Iteration 15 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 10:22:30,648 INFO L82 PathProgramCache]: Analyzing trace with hash 126305132, now seen corresponding path program 1 times [2018-02-02 10:22:30,649 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:22:30,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:22:30,659 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:22:30,802 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 10:22:30,802 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:22:30,803 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-02 10:22:30,803 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:22:30,803 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:22:30,803 INFO L182 omatonBuilderFactory]: Interpolants [3360#true, 3361#false, 3362#(= 0 |ldv_malloc_#t~malloc2.offset|), 3363#(= 0 |ldv_malloc_#res.offset|), 3364#(= 0 |entry_point_#t~ret12.offset|), 3365#(= entry_point_~array~0.offset 0), 3366#(and (= 0 entry_point_~array~0.offset) (= entry_point_~i~2 0)), 3367#(and (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset))) (= 0 entry_point_~array~0.offset) (= entry_point_~i~2 0)), 3368#(and (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0)) (= 0 entry_point_~array~0.offset)), 3369#(= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|), 3370#(and (= 0 (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) 0)) (= 0 |free_17_#in~array.offset|)), 3371#(and (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (* 4 free_17_~i~1) free_17_~array.offset))) (= 0 (+ (* 4 free_17_~i~1) free_17_~array.offset))), 3372#(= 0 |free_17_#t~mem10.base|)] [2018-02-02 10:22:30,803 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 10:22:30,804 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-02 10:22:30,804 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-02 10:22:30,804 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2018-02-02 10:22:30,804 INFO L87 Difference]: Start difference. First operand 146 states and 176 transitions. Second operand 13 states. [2018-02-02 10:22:31,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:22:31,028 INFO L93 Difference]: Finished difference Result 163 states and 185 transitions. [2018-02-02 10:22:31,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-02 10:22:31,028 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 52 [2018-02-02 10:22:31,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:22:31,029 INFO L225 Difference]: With dead ends: 163 [2018-02-02 10:22:31,029 INFO L226 Difference]: Without dead ends: 163 [2018-02-02 10:22:31,029 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=387, Unknown=0, NotChecked=0, Total=462 [2018-02-02 10:22:31,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2018-02-02 10:22:31,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 146. [2018-02-02 10:22:31,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-02-02 10:22:31,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 174 transitions. [2018-02-02 10:22:31,032 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 174 transitions. Word has length 52 [2018-02-02 10:22:31,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:22:31,032 INFO L432 AbstractCegarLoop]: Abstraction has 146 states and 174 transitions. [2018-02-02 10:22:31,032 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-02 10:22:31,032 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 174 transitions. [2018-02-02 10:22:31,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-02-02 10:22:31,033 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:22:31,033 INFO L351 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1] [2018-02-02 10:22:31,033 INFO L371 AbstractCegarLoop]: === Iteration 16 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 10:22:31,033 INFO L82 PathProgramCache]: Analyzing trace with hash 2101833613, now seen corresponding path program 1 times [2018-02-02 10:22:31,034 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:22:31,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:22:31,038 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:22:31,074 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-02-02 10:22:31,074 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:22:31,074 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 10:22:31,074 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:22:31,077 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:22:31,078 INFO L182 omatonBuilderFactory]: Interpolants [3701#true, 3702#false, 3703#(not (= |ldv_malloc_#t~malloc2.base| 0)), 3704#(not (= |ldv_malloc_#res.base| 0)), 3705#(not (= |alloc_17_#t~ret4.base| 0)), 3706#(not (= alloc_17_~p~0.base 0))] [2018-02-02 10:22:31,078 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-02-02 10:22:31,078 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 10:22:31,078 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 10:22:31,078 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:22:31,078 INFO L87 Difference]: Start difference. First operand 146 states and 174 transitions. Second operand 6 states. [2018-02-02 10:22:31,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:22:31,101 INFO L93 Difference]: Finished difference Result 125 states and 143 transitions. [2018-02-02 10:22:31,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 10:22:31,101 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 53 [2018-02-02 10:22:31,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:22:31,102 INFO L225 Difference]: With dead ends: 125 [2018-02-02 10:22:31,102 INFO L226 Difference]: Without dead ends: 125 [2018-02-02 10:22:31,102 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:22:31,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-02-02 10:22:31,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 123. [2018-02-02 10:22:31,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-02-02 10:22:31,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 141 transitions. [2018-02-02 10:22:31,107 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 141 transitions. Word has length 53 [2018-02-02 10:22:31,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:22:31,108 INFO L432 AbstractCegarLoop]: Abstraction has 123 states and 141 transitions. [2018-02-02 10:22:31,108 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 10:22:31,108 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 141 transitions. [2018-02-02 10:22:31,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-02-02 10:22:31,108 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:22:31,108 INFO L351 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1] [2018-02-02 10:22:31,109 INFO L371 AbstractCegarLoop]: === Iteration 17 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 10:22:31,109 INFO L82 PathProgramCache]: Analyzing trace with hash -1018243012, now seen corresponding path program 1 times [2018-02-02 10:22:31,109 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:22:31,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:22:31,118 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:22:31,152 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-02-02 10:22:31,152 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:22:31,152 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-02-02 10:22:31,153 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:22:31,153 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:22:31,153 INFO L182 omatonBuilderFactory]: Interpolants [3959#true, 3960#false, 3961#(= alloc_17_~array.base |alloc_17_#in~array.base|), 3962#(= 1 (select |#valid| |alloc_17_#in~array.base|)), 3963#(= 1 (select |#valid| entry_point_~array~0.base)), 3964#(= 1 (select |#valid| |free_17_#in~array.base|)), 3965#(= 1 (select |#valid| free_17_~array.base))] [2018-02-02 10:22:31,153 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-02-02 10:22:31,153 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 10:22:31,154 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 10:22:31,154 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-02 10:22:31,154 INFO L87 Difference]: Start difference. First operand 123 states and 141 transitions. Second operand 7 states. [2018-02-02 10:22:31,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:22:31,230 INFO L93 Difference]: Finished difference Result 142 states and 162 transitions. [2018-02-02 10:22:31,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 10:22:31,230 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2018-02-02 10:22:31,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:22:31,230 INFO L225 Difference]: With dead ends: 142 [2018-02-02 10:22:31,230 INFO L226 Difference]: Without dead ends: 142 [2018-02-02 10:22:31,231 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 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:22:31,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2018-02-02 10:22:31,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 129. [2018-02-02 10:22:31,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-02-02 10:22:31,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 148 transitions. [2018-02-02 10:22:31,233 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 148 transitions. Word has length 54 [2018-02-02 10:22:31,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:22:31,233 INFO L432 AbstractCegarLoop]: Abstraction has 129 states and 148 transitions. [2018-02-02 10:22:31,233 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 10:22:31,233 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 148 transitions. [2018-02-02 10:22:31,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-02-02 10:22:31,233 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:22:31,233 INFO L351 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1] [2018-02-02 10:22:31,233 INFO L371 AbstractCegarLoop]: === Iteration 18 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 10:22:31,234 INFO L82 PathProgramCache]: Analyzing trace with hash -1018243011, now seen corresponding path program 1 times [2018-02-02 10:22:31,234 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:22:31,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:22:31,240 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:22:31,360 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-02-02 10:22:31,360 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:22:31,360 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-02-02 10:22:31,360 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:22:31,360 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 10:22:31,361 INFO L182 omatonBuilderFactory]: Interpolants [4241#true, 4242#false, 4243#(= 0 |ldv_malloc_#t~malloc2.offset|), 4244#(= 0 |ldv_malloc_#res.offset|), 4245#(= 0 |entry_point_#t~ret12.offset|), 4246#(= 0 entry_point_~array~0.offset), 4247#(and (or (= alloc_17_~len |alloc_17_#in~len|) (not (= alloc_17_~array.offset 0))) (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset)) (= alloc_17_~array.base |alloc_17_#in~array.base|)), 4248#(or (and (<= (+ (* 4 alloc_17_~i~0) 4) (select |#length| |alloc_17_#in~array.base|)) (= alloc_17_~len |alloc_17_#in~len|)) (not (= |alloc_17_#in~array.offset| 0))), 4249#(or (not (= |alloc_17_#in~array.offset| 0)) (and (= alloc_17_~len |alloc_17_#in~len|) (<= (* 4 alloc_17_~i~0) (select |#length| |alloc_17_#in~array.base|)))), 4250#(or (<= (* 4 |alloc_17_#in~len|) (select |#length| |alloc_17_#in~array.base|)) (not (= |alloc_17_#in~array.offset| 0))), 4251#(and (= 0 entry_point_~array~0.offset) (<= (* 4 entry_point_~len~0) (select |#length| entry_point_~array~0.base))), 4252#(and (<= (* 4 |free_17_#in~len|) (select |#length| |free_17_#in~array.base|)) (= 0 |free_17_#in~array.offset|)), 4253#(and (<= (* 4 free_17_~len) (select |#length| free_17_~array.base)) (= free_17_~i~1 0) (= free_17_~array.offset 0)), 4254#(and (<= (+ (* 4 free_17_~i~1) 4) (select |#length| free_17_~array.base)) (= free_17_~i~1 0) (= free_17_~array.offset 0))] [2018-02-02 10:22:31,361 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-02-02 10:22:31,361 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-02 10:22:31,361 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-02 10:22:31,361 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2018-02-02 10:22:31,361 INFO L87 Difference]: Start difference. First operand 129 states and 148 transitions. Second operand 14 states. [2018-02-02 10:22:31,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:22:31,633 INFO L93 Difference]: Finished difference Result 161 states and 182 transitions. [2018-02-02 10:22:31,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-02 10:22:31,633 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 54 [2018-02-02 10:22:31,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:22:31,634 INFO L225 Difference]: With dead ends: 161 [2018-02-02 10:22:31,634 INFO L226 Difference]: Without dead ends: 161 [2018-02-02 10:22:31,634 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=323, Unknown=0, NotChecked=0, Total=380 [2018-02-02 10:22:31,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2018-02-02 10:22:31,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 147. [2018-02-02 10:22:31,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-02-02 10:22:31,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 172 transitions. [2018-02-02 10:22:31,637 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 172 transitions. Word has length 54 [2018-02-02 10:22:31,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:22:31,638 INFO L432 AbstractCegarLoop]: Abstraction has 147 states and 172 transitions. [2018-02-02 10:22:31,638 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-02 10:22:31,638 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 172 transitions. [2018-02-02 10:22:31,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-02-02 10:22:31,639 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:22:31,639 INFO L351 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1] [2018-02-02 10:22:31,639 INFO L371 AbstractCegarLoop]: === Iteration 19 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 10:22:31,639 INFO L82 PathProgramCache]: Analyzing trace with hash -1500762242, now seen corresponding path program 1 times [2018-02-02 10:22:31,640 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:22:31,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:22:31,654 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:22:32,117 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-02 10:22:32,117 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:22:32,117 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-02-02 10:22:32,117 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:22:32,118 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:22:32,118 INFO L182 omatonBuilderFactory]: Interpolants [4576#false, 4577#(= 0 |ldv_malloc_#t~malloc2.offset|), 4578#(= 0 |ldv_malloc_#res.offset|), 4579#(= 0 |entry_point_#t~ret12.offset|), 4580#(= 0 entry_point_~array~0.offset), 4581#(and (= 0 entry_point_~array~0.offset) (= entry_point_~i~2 0)), 4582#(and (= 0 entry_point_~array~0.offset) (<= entry_point_~i~2 1)), 4583#(and (= 0 entry_point_~array~0.offset) (<= entry_point_~len~0 1)), 4584#(and (or (<= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) 0) (and (or (= alloc_17_~len |alloc_17_#in~len|) (not (= alloc_17_~array.offset 0))) (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset)))) (or (not (= 0 (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset))) (= alloc_17_~array.base |alloc_17_#in~array.base|))), 4585#(and (or (<= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) 0) (and (or (and (= alloc_17_~len |alloc_17_#in~len|) (<= (+ alloc_17_~i~0 1) alloc_17_~len)) (not (= alloc_17_~array.offset 0))) (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset)))) (or (not (= 0 (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset))) (= alloc_17_~array.base |alloc_17_#in~array.base|))), 4586#(and (or (<= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) 0) (and (or (and (= alloc_17_~len |alloc_17_#in~len|) (<= (+ alloc_17_~i~0 1) alloc_17_~len)) (not (= alloc_17_~array.offset 0))) (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset)))) (or (and (= 0 |alloc_17_#t~ret4.offset|) (= alloc_17_~array.base |alloc_17_#in~array.base|)) (not (= 0 (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset))))), 4587#(and (or (<= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) 0) (and (or (and (= alloc_17_~len |alloc_17_#in~len|) (<= (+ alloc_17_~i~0 1) alloc_17_~len)) (not (= alloc_17_~array.offset 0))) (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset)))) (or (not (= 0 (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset))) (and (= 0 alloc_17_~p~0.offset) (= alloc_17_~array.base |alloc_17_#in~array.base|)))), 4588#(or (and (<= 2 alloc_17_~len) (= alloc_17_~len |alloc_17_#in~len|)) (= 0 (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) 0)) (not (= |alloc_17_#in~array.offset| 0))), 4589#(or (<= 2 |alloc_17_#in~len|) (= 0 (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) 0)) (not (= |alloc_17_#in~array.offset| 0))), 4590#(and (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) 0)) (= 0 entry_point_~array~0.offset) (<= entry_point_~len~0 1)), 4591#(and (= 0 |free_17_#in~array.offset|) (<= |free_17_#in~len| 1) (= 0 (select (select |#memory_$Pointer$.offset| |free_17_#in~array.base|) 0))), 4592#(and (or (and (or (<= free_17_~len 1) (<= (+ (* 4 free_17_~i~1) free_17_~array.offset) 0)) (= free_17_~array.offset 0)) (= 0 (+ (* 4 free_17_~i~1) free_17_~array.offset))) (or (= 0 (select (select |#memory_$Pointer$.offset| free_17_~array.base) (+ (* 4 free_17_~i~1) free_17_~array.offset))) (not (= 0 (+ (* 4 free_17_~i~1) free_17_~array.offset))))), 4593#(and (or (= 0 (select (select |#memory_$Pointer$.offset| free_17_~array.base) (+ (* 4 free_17_~i~1) free_17_~array.offset))) (not (= 0 (+ (* 4 free_17_~i~1) free_17_~array.offset)))) (or (and (<= free_17_~i~1 0) (= free_17_~array.offset 0)) (= 0 (+ (* 4 free_17_~i~1) free_17_~array.offset)))), 4594#(= 0 |free_17_#t~mem10.offset|), 4575#true] [2018-02-02 10:22:32,118 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-02 10:22:32,118 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-02 10:22:32,118 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-02 10:22:32,119 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=330, Unknown=0, NotChecked=0, Total=380 [2018-02-02 10:22:32,119 INFO L87 Difference]: Start difference. First operand 147 states and 172 transitions. Second operand 20 states. [2018-02-02 10:22:32,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:22:32,412 INFO L93 Difference]: Finished difference Result 259 states and 317 transitions. [2018-02-02 10:22:32,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-02 10:22:32,412 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 55 [2018-02-02 10:22:32,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:22:32,413 INFO L225 Difference]: With dead ends: 259 [2018-02-02 10:22:32,413 INFO L226 Difference]: Without dead ends: 259 [2018-02-02 10:22:32,414 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=90, Invalid=612, Unknown=0, NotChecked=0, Total=702 [2018-02-02 10:22:32,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2018-02-02 10:22:32,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 219. [2018-02-02 10:22:32,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2018-02-02 10:22:32,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 281 transitions. [2018-02-02 10:22:32,421 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 281 transitions. Word has length 55 [2018-02-02 10:22:32,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:22:32,421 INFO L432 AbstractCegarLoop]: Abstraction has 219 states and 281 transitions. [2018-02-02 10:22:32,421 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-02 10:22:32,422 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 281 transitions. [2018-02-02 10:22:32,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-02-02 10:22:32,422 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:22:32,422 INFO L351 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1] [2018-02-02 10:22:32,423 INFO L371 AbstractCegarLoop]: === Iteration 20 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 10:22:32,423 INFO L82 PathProgramCache]: Analyzing trace with hash -1500762241, now seen corresponding path program 1 times [2018-02-02 10:22:32,423 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:22:32,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:22:32,437 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:22:33,006 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 10:22:33,007 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:22:33,007 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-02-02 10:22:33,007 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:22:33,007 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 10:22:33,007 INFO L182 omatonBuilderFactory]: Interpolants [5088#false, 5089#(= 0 |ldv_malloc_#t~malloc2.offset|), 5090#(= 0 |ldv_malloc_#res.offset|), 5091#(= 0 |entry_point_#t~ret12.offset|), 5092#(= 0 entry_point_~array~0.offset), 5093#(and (= 0 entry_point_~array~0.offset) (= entry_point_~i~2 0)), 5094#(and (= 0 entry_point_~array~0.offset) (<= entry_point_~i~2 1)), 5095#(and (= 0 entry_point_~array~0.offset) (<= entry_point_~len~0 1)), 5096#(and (or (<= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) 0) (and (or (= alloc_17_~len |alloc_17_#in~len|) (not (= alloc_17_~array.offset 0))) (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset)))) (or (not (= 0 (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset))) (= alloc_17_~array.base |alloc_17_#in~array.base|))), 5097#(and (or (<= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) 0) (and (or (and (= alloc_17_~len |alloc_17_#in~len|) (<= (+ alloc_17_~i~0 1) alloc_17_~len)) (not (= alloc_17_~array.offset 0))) (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset)))) (or (not (= 0 (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset))) (= alloc_17_~array.base |alloc_17_#in~array.base|))), 5098#(= 1 (select |#valid| |ldv_malloc_#t~malloc2.base|)), 5099#(= 1 (select |#valid| |ldv_malloc_#res.base|)), 5100#(and (or (not (= 0 (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset))) (and (= 1 (select |#valid| |alloc_17_#t~ret4.base|)) (= alloc_17_~array.base |alloc_17_#in~array.base|))) (or (<= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) 0) (and (or (and (= alloc_17_~len |alloc_17_#in~len|) (<= (+ alloc_17_~i~0 1) alloc_17_~len)) (not (= alloc_17_~array.offset 0))) (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset))))), 5101#(and (or (<= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) 0) (and (or (and (= alloc_17_~len |alloc_17_#in~len|) (<= (+ alloc_17_~i~0 1) alloc_17_~len)) (not (= alloc_17_~array.offset 0))) (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset)))) (or (and (= 1 (select |#valid| alloc_17_~p~0.base)) (= alloc_17_~array.base |alloc_17_#in~array.base|)) (not (= 0 (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset))))), 5102#(or (and (<= 2 alloc_17_~len) (= alloc_17_~len |alloc_17_#in~len|)) (not (= |alloc_17_#in~array.offset| 0)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) 0)))), 5103#(or (<= 2 |alloc_17_#in~len|) (not (= |alloc_17_#in~array.offset| 0)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) 0)))), 5104#(and (= 0 entry_point_~array~0.offset) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (<= entry_point_~len~0 1)), 5105#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) 0))) (= 0 |free_17_#in~array.offset|) (<= |free_17_#in~len| 1)), 5106#(and (or (and (or (<= free_17_~len 1) (<= (+ (* 4 free_17_~i~1) free_17_~array.offset) 0)) (= free_17_~array.offset 0)) (= 0 (+ (* 4 free_17_~i~1) free_17_~array.offset))) (or (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (* 4 free_17_~i~1) free_17_~array.offset)))) (not (= 0 (+ (* 4 free_17_~i~1) free_17_~array.offset))))), 5107#(and (or (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (* 4 free_17_~i~1) free_17_~array.offset)))) (not (= 0 (+ (* 4 free_17_~i~1) free_17_~array.offset)))) (or (and (<= free_17_~i~1 0) (= free_17_~array.offset 0)) (= 0 (+ (* 4 free_17_~i~1) free_17_~array.offset)))), 5108#(= 1 (select |#valid| |free_17_#t~mem10.base|)), 5087#true] [2018-02-02 10:22:33,007 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 10:22:33,007 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-02 10:22:33,007 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-02 10:22:33,007 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=408, Unknown=0, NotChecked=0, Total=462 [2018-02-02 10:22:33,008 INFO L87 Difference]: Start difference. First operand 219 states and 281 transitions. Second operand 22 states. [2018-02-02 10:22:33,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:22:33,343 INFO L93 Difference]: Finished difference Result 235 states and 304 transitions. [2018-02-02 10:22:33,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-02 10:22:33,344 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 55 [2018-02-02 10:22:33,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:22:33,345 INFO L225 Difference]: With dead ends: 235 [2018-02-02 10:22:33,345 INFO L226 Difference]: Without dead ends: 235 [2018-02-02 10:22:33,345 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=96, Invalid=716, Unknown=0, NotChecked=0, Total=812 [2018-02-02 10:22:33,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2018-02-02 10:22:33,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 202. [2018-02-02 10:22:33,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2018-02-02 10:22:33,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 257 transitions. [2018-02-02 10:22:33,352 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 257 transitions. Word has length 55 [2018-02-02 10:22:33,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:22:33,352 INFO L432 AbstractCegarLoop]: Abstraction has 202 states and 257 transitions. [2018-02-02 10:22:33,352 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-02 10:22:33,352 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 257 transitions. [2018-02-02 10:22:33,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-02-02 10:22:33,353 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:22:33,353 INFO L351 BasicCegarLoop]: trace histogram [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, 1, 1, 1] [2018-02-02 10:22:33,353 INFO L371 AbstractCegarLoop]: === Iteration 21 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 10:22:33,353 INFO L82 PathProgramCache]: Analyzing trace with hash -2041198635, now seen corresponding path program 2 times [2018-02-02 10:22:33,354 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:22:33,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:22:33,364 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:22:33,448 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 10:22:33,448 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:22:33,448 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-02 10:22:33,448 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:22:33,448 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 10:22:33,449 INFO L182 omatonBuilderFactory]: Interpolants [5568#(and (= entry_point_~array~0.offset 0) (<= 8 (+ (* 4 entry_point_~len~0) entry_point_~array~0.offset))), 5569#(and (= alloc_17_~i~0 0) (= alloc_17_~len |alloc_17_#in~len|)), 5570#(and (<= alloc_17_~i~0 1) (= alloc_17_~len |alloc_17_#in~len|)), 5571#(<= |alloc_17_#in~len| 1), 5560#true, 5561#false, 5562#(= 0 |ldv_malloc_#t~malloc2.offset|), 5563#(= 0 |ldv_malloc_#res.offset|), 5564#(= 0 |entry_point_#t~ret12.offset|), 5565#(= entry_point_~array~0.offset 0), 5566#(and (<= 0 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset)) (= entry_point_~array~0.offset 0)), 5567#(and (= entry_point_~array~0.offset 0) (<= 4 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset)))] [2018-02-02 10:22:33,449 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 10:22:33,449 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-02 10:22:33,449 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-02 10:22:33,449 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2018-02-02 10:22:33,449 INFO L87 Difference]: Start difference. First operand 202 states and 257 transitions. Second operand 12 states. [2018-02-02 10:22:33,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:22:33,591 INFO L93 Difference]: Finished difference Result 225 states and 282 transitions. [2018-02-02 10:22:33,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-02 10:22:33,591 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 59 [2018-02-02 10:22:33,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:22:33,592 INFO L225 Difference]: With dead ends: 225 [2018-02-02 10:22:33,592 INFO L226 Difference]: Without dead ends: 225 [2018-02-02 10:22:33,592 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2018-02-02 10:22:33,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2018-02-02 10:22:33,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 202. [2018-02-02 10:22:33,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2018-02-02 10:22:33,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 256 transitions. [2018-02-02 10:22:33,597 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 256 transitions. Word has length 59 [2018-02-02 10:22:33,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:22:33,598 INFO L432 AbstractCegarLoop]: Abstraction has 202 states and 256 transitions. [2018-02-02 10:22:33,598 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-02 10:22:33,598 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 256 transitions. [2018-02-02 10:22:33,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-02-02 10:22:33,598 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:22:33,599 INFO L351 BasicCegarLoop]: trace histogram [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, 1, 1, 1] [2018-02-02 10:22:33,599 INFO L371 AbstractCegarLoop]: === Iteration 22 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 10:22:33,599 INFO L82 PathProgramCache]: Analyzing trace with hash -2012095048, now seen corresponding path program 1 times [2018-02-02 10:22:33,600 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:22:33,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:22:33,606 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:22:33,711 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-02-02 10:22:33,712 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:22:33,712 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-02-02 10:22:33,712 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:22:33,712 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-02-02 10:22:33,712 INFO L182 omatonBuilderFactory]: Interpolants [6016#(and (= alloc_17_~array.offset 0) (<= (* 4 alloc_17_~len) (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset 4))), 6017#(and (= alloc_17_~array.offset 0) (<= (* 4 alloc_17_~len) (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset))), 6005#true, 6006#false, 6007#(= 0 |ldv_malloc_#t~malloc2.offset|), 6008#(= 0 |ldv_malloc_#res.offset|), 6009#(= 0 |entry_point_#t~ret12.offset|), 6010#(= 0 entry_point_~array~0.offset), 6011#(and (= 0 entry_point_~array~0.offset) (= entry_point_~i~2 0)), 6012#(and (= 0 entry_point_~array~0.offset) (<= entry_point_~i~2 1)), 6013#(and (= 0 entry_point_~array~0.offset) (<= entry_point_~len~0 1)), 6014#(and (= 0 |alloc_17_#in~array.offset|) (<= |alloc_17_#in~len| 1)), 6015#(and (= alloc_17_~array.offset 0) (<= alloc_17_~len 1))] [2018-02-02 10:22:33,712 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-02-02 10:22:33,713 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-02 10:22:33,713 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-02 10:22:33,713 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2018-02-02 10:22:33,713 INFO L87 Difference]: Start difference. First operand 202 states and 256 transitions. Second operand 13 states. [2018-02-02 10:22:33,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:22:33,814 INFO L93 Difference]: Finished difference Result 207 states and 246 transitions. [2018-02-02 10:22:33,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-02 10:22:33,814 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 55 [2018-02-02 10:22:33,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:22:33,815 INFO L225 Difference]: With dead ends: 207 [2018-02-02 10:22:33,815 INFO L226 Difference]: Without dead ends: 204 [2018-02-02 10:22:33,815 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2018-02-02 10:22:33,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2018-02-02 10:22:33,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 174. [2018-02-02 10:22:33,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2018-02-02 10:22:33,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 202 transitions. [2018-02-02 10:22:33,820 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 202 transitions. Word has length 55 [2018-02-02 10:22:33,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:22:33,820 INFO L432 AbstractCegarLoop]: Abstraction has 174 states and 202 transitions. [2018-02-02 10:22:33,820 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-02 10:22:33,820 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 202 transitions. [2018-02-02 10:22:33,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-02-02 10:22:33,821 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:22:33,821 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, 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:22:33,821 INFO L371 AbstractCegarLoop]: === Iteration 23 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 10:22:33,821 INFO L82 PathProgramCache]: Analyzing trace with hash 1345976352, now seen corresponding path program 1 times [2018-02-02 10:22:33,822 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:22:33,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:22:33,828 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:22:33,867 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:22:33,867 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:22:33,867 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-02 10:22:33,867 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:22:33,867 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:22:33,867 INFO L182 omatonBuilderFactory]: Interpolants [6407#true, 6408#false, 6409#(<= 1 |ldv_positive_#res|), 6410#(<= 1 |entry_point_#t~ret11|), 6411#(<= 1 entry_point_~len~0), 6412#(and (= free_17_~i~1 0) (= free_17_~len |free_17_#in~len|)), 6413#(<= |free_17_#in~len| 0)] [2018-02-02 10:22:33,867 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:22:33,867 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 10:22:33,868 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 10:22:33,868 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-02 10:22:33,868 INFO L87 Difference]: Start difference. First operand 174 states and 202 transitions. Second operand 7 states. [2018-02-02 10:22:33,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:22:33,892 INFO L93 Difference]: Finished difference Result 186 states and 212 transitions. [2018-02-02 10:22:33,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 10:22:33,892 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 56 [2018-02-02 10:22:33,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:22:33,892 INFO L225 Difference]: With dead ends: 186 [2018-02-02 10:22:33,893 INFO L226 Difference]: Without dead ends: 178 [2018-02-02 10:22:33,893 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-02-02 10:22:33,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2018-02-02 10:22:33,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 165. [2018-02-02 10:22:33,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-02-02 10:22:33,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 189 transitions. [2018-02-02 10:22:33,896 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 189 transitions. Word has length 56 [2018-02-02 10:22:33,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:22:33,896 INFO L432 AbstractCegarLoop]: Abstraction has 165 states and 189 transitions. [2018-02-02 10:22:33,896 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 10:22:33,896 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 189 transitions. [2018-02-02 10:22:33,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-02-02 10:22:33,897 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:22:33,897 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:22:33,897 INFO L371 AbstractCegarLoop]: === Iteration 24 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 10:22:33,897 INFO L82 PathProgramCache]: Analyzing trace with hash -1550179515, now seen corresponding path program 1 times [2018-02-02 10:22:33,898 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:22:33,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:22:33,903 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:22:33,979 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 10:22:33,979 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:22:33,979 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-02-02 10:22:33,979 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:22:33,979 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:22:33,979 INFO L182 omatonBuilderFactory]: Interpolants [6767#true, 6768#false, 6769#(= 0 |ldv_malloc_#t~malloc2.offset|), 6770#(= 0 |ldv_malloc_#res.offset|), 6771#(= 0 |entry_point_#t~ret12.offset|), 6772#(= 0 entry_point_~array~0.offset), 6773#(and (= 0 entry_point_~array~0.offset) (= entry_point_~i~2 0)), 6774#(and (= 0 entry_point_~array~0.offset) (<= entry_point_~i~2 1)), 6775#(and (= 0 entry_point_~array~0.offset) (<= entry_point_~len~0 1)), 6776#(and (= 0 |free_17_#in~array.offset|) (<= |free_17_#in~len| 1)), 6777#(and (<= free_17_~len 1) (= free_17_~array.offset 0)), 6778#(<= free_17_~len (+ free_17_~i~1 1)), 6779#(<= free_17_~len free_17_~i~1)] [2018-02-02 10:22:33,979 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 10:22:33,979 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-02 10:22:33,980 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-02 10:22:33,980 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2018-02-02 10:22:33,980 INFO L87 Difference]: Start difference. First operand 165 states and 189 transitions. Second operand 13 states. [2018-02-02 10:22:34,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:22:34,059 INFO L93 Difference]: Finished difference Result 184 states and 208 transitions. [2018-02-02 10:22:34,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-02 10:22:34,059 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 57 [2018-02-02 10:22:34,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:22:34,060 INFO L225 Difference]: With dead ends: 184 [2018-02-02 10:22:34,060 INFO L226 Difference]: Without dead ends: 184 [2018-02-02 10:22:34,060 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2018-02-02 10:22:34,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2018-02-02 10:22:34,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 178. [2018-02-02 10:22:34,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2018-02-02 10:22:34,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 202 transitions. [2018-02-02 10:22:34,063 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 202 transitions. Word has length 57 [2018-02-02 10:22:34,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:22:34,064 INFO L432 AbstractCegarLoop]: Abstraction has 178 states and 202 transitions. [2018-02-02 10:22:34,064 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-02 10:22:34,064 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 202 transitions. [2018-02-02 10:22:34,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-02-02 10:22:34,064 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:22:34,064 INFO L351 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:22:34,064 INFO L371 AbstractCegarLoop]: === Iteration 25 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 10:22:34,065 INFO L82 PathProgramCache]: Analyzing trace with hash 631093502, now seen corresponding path program 1 times [2018-02-02 10:22:34,065 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:22:34,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:22:34,072 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:22:34,371 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:22:34,371 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:22:34,371 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-02-02 10:22:34,371 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:22:34,372 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:22:34,372 INFO L182 omatonBuilderFactory]: Interpolants [7151#true, 7152#false, 7153#(and (not (= |ldv_malloc_#t~malloc2.base| 0)) (= 0 |ldv_malloc_#t~malloc2.offset|)), 7154#(and (= 0 |ldv_malloc_#res.offset|) (not (= |ldv_malloc_#res.base| 0))), 7155#(or (and (= 0 |entry_point_#t~ret12.offset|) (not (= |entry_point_#t~ret12.base| 0))) (<= 2 entry_point_~len~0)), 7156#(or (<= 2 entry_point_~len~0) (and (not (= entry_point_~array~0.base 0)) (= entry_point_~array~0.offset 0))), 7157#(or (and (or (<= (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (<= entry_point_~len~0 1)) (or (not (= 0 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset))) (not (= entry_point_~array~0.base 0))) (= entry_point_~array~0.offset 0)) (and (<= 2 entry_point_~len~0) (= entry_point_~i~2 0))), 7158#(or (and (or (not (= 0 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset))) (not (= entry_point_~array~0.base 0))) (= entry_point_~array~0.offset 0) (<= entry_point_~i~2 0)) (and (<= 2 entry_point_~len~0) (= entry_point_~i~2 0))), 7159#(or (and (= 1 (select |#valid| entry_point_~array~0.base)) (= 0 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset)) (= entry_point_~array~0.offset 0) (not (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset))))) (and (<= 2 entry_point_~len~0) (= entry_point_~i~2 0))), 7160#(or (and (= 1 (select |#valid| entry_point_~array~0.base)) (= entry_point_~array~0.offset 0) (not (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0)))) (<= (+ entry_point_~i~2 1) entry_point_~len~0)), 7161#(and (= 1 (select |#valid| entry_point_~array~0.base)) (= entry_point_~array~0.offset 0) (not (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0)))), 7162#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)), 7163#(= |#valid| |old(#valid)|), 7164#(and (= |#valid| |old(#valid)|) (= free_17_~array.base |free_17_#in~array.base|) (or (and (not (= free_17_~array.offset 0)) (= |free_17_#in~array.offset| free_17_~array.offset)) (<= (+ (* 4 free_17_~i~1) free_17_~array.offset) 0))), 7165#(or (and (= |#valid| |old(#valid)|) (= 1 (select (store |#valid| |free_17_#t~mem10.base| 0) |free_17_#in~array.base|))) (= (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) 0) |free_17_#in~array.base|) (not (= |free_17_#in~array.offset| 0))), 7166#(or (= |#valid| |old(#valid)|) (= (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) 0) |free_17_#in~array.base|) (= 1 (select |#valid| |free_17_#in~array.base|)) (not (= |free_17_#in~array.offset| 0))), 7167#(= 1 (select |#valid| entry_point_~array~0.base))] [2018-02-02 10:22:34,372 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:22:34,372 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-02 10:22:34,372 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-02 10:22:34,372 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2018-02-02 10:22:34,372 INFO L87 Difference]: Start difference. First operand 178 states and 202 transitions. Second operand 17 states. [2018-02-02 10:22:34,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:22:34,803 INFO L93 Difference]: Finished difference Result 218 states and 257 transitions. [2018-02-02 10:22:34,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-02 10:22:34,803 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 59 [2018-02-02 10:22:34,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:22:34,804 INFO L225 Difference]: With dead ends: 218 [2018-02-02 10:22:34,804 INFO L226 Difference]: Without dead ends: 218 [2018-02-02 10:22:34,804 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=101, Invalid=549, Unknown=0, NotChecked=0, Total=650 [2018-02-02 10:22:34,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2018-02-02 10:22:34,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 183. [2018-02-02 10:22:34,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2018-02-02 10:22:34,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 208 transitions. [2018-02-02 10:22:34,808 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 208 transitions. Word has length 59 [2018-02-02 10:22:34,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:22:34,809 INFO L432 AbstractCegarLoop]: Abstraction has 183 states and 208 transitions. [2018-02-02 10:22:34,809 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-02 10:22:34,809 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 208 transitions. [2018-02-02 10:22:34,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-02-02 10:22:34,810 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:22:34,810 INFO L351 BasicCegarLoop]: trace histogram [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] [2018-02-02 10:22:34,810 INFO L371 AbstractCegarLoop]: === Iteration 26 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 10:22:34,810 INFO L82 PathProgramCache]: Analyzing trace with hash 1742435855, now seen corresponding path program 2 times [2018-02-02 10:22:34,811 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:22:34,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:22:34,823 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:22:35,121 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 13 proven. 10 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-02-02 10:22:35,122 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:22:35,122 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-02-02 10:22:35,122 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:22:35,122 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:22:35,122 INFO L182 omatonBuilderFactory]: Interpolants [7587#true, 7588#false, 7589#(and (= (select |#valid| |ldv_malloc_#t~malloc2.base|) 1) (= 0 |ldv_malloc_#t~malloc2.offset|)), 7590#(and (= 0 |ldv_malloc_#res.offset|) (= (select |#valid| |ldv_malloc_#res.base|) 1)), 7591#(and (= (select |#valid| |entry_point_#t~ret12.base|) 1) (= 0 |entry_point_#t~ret12.offset|)), 7592#(and (= entry_point_~array~0.offset 0) (= (select |#valid| entry_point_~array~0.base) 1)), 7593#(and (<= (+ (* 4 entry_point_~i~2) 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)), 7594#(and (<= (+ (* 4 entry_point_~i~2) 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)), 7595#(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)), 7596#(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|)), 7597#(and (<= (* 4 alloc_17_~len) (select |#length| alloc_17_~array.base)) (= (select |#valid| alloc_17_~array.base) 1) (= alloc_17_~array.offset 0)), 7598#(and (= |#valid| |old(#valid)|) (= |old(#length)| |#length|)), 7599#(and (= |#length| (store |old(#length)| |ldv_malloc_#t~malloc2.base| (select |#length| |ldv_malloc_#t~malloc2.base|))) (= 0 (select |old(#valid)| |ldv_malloc_#t~malloc2.base|))), 7600#(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|))))), 7601#(and (<= (* 4 alloc_17_~len) (select |#length| alloc_17_~array.base)) (= alloc_17_~array.offset 0)), 7602#(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)), 7603#(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)), 7604#(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)), 7605#(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:22:35,122 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 13 proven. 10 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-02-02 10:22:35,123 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-02 10:22:35,123 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-02 10:22:35,123 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=294, Unknown=0, NotChecked=0, Total=342 [2018-02-02 10:22:35,123 INFO L87 Difference]: Start difference. First operand 183 states and 208 transitions. Second operand 19 states. [2018-02-02 10:22:35,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:22:35,733 INFO L93 Difference]: Finished difference Result 219 states and 249 transitions. [2018-02-02 10:22:35,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-02 10:22:35,733 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 59 [2018-02-02 10:22:35,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:22:35,734 INFO L225 Difference]: With dead ends: 219 [2018-02-02 10:22:35,734 INFO L226 Difference]: Without dead ends: 219 [2018-02-02 10:22:35,734 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 7 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:22:35,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2018-02-02 10:22:35,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 182. [2018-02-02 10:22:35,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2018-02-02 10:22:35,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 207 transitions. [2018-02-02 10:22:35,737 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 207 transitions. Word has length 59 [2018-02-02 10:22:35,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:22:35,737 INFO L432 AbstractCegarLoop]: Abstraction has 182 states and 207 transitions. [2018-02-02 10:22:35,737 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-02 10:22:35,737 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 207 transitions. [2018-02-02 10:22:35,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-02-02 10:22:35,738 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:22:35,738 INFO L351 BasicCegarLoop]: trace histogram [3, 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, 1, 1, 1, 1] [2018-02-02 10:22:35,738 INFO L371 AbstractCegarLoop]: === Iteration 27 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 10:22:35,738 INFO L82 PathProgramCache]: Analyzing trace with hash -805582722, now seen corresponding path program 1 times [2018-02-02 10:22:35,739 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:22:35,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:22:35,744 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:22:35,852 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 11 proven. 5 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-02-02 10:22:35,853 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:22:35,853 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-02 10:22:35,853 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:22:35,853 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:22:35,853 INFO L182 omatonBuilderFactory]: Interpolants [8039#true, 8040#false, 8041#(= 0 |ldv_malloc_#t~malloc2.offset|), 8042#(= 0 |ldv_malloc_#res.offset|), 8043#(= 0 |entry_point_#t~ret12.offset|), 8044#(= 0 entry_point_~array~0.offset), 8045#(= 0 |alloc_17_#in~array.offset|), 8046#(= alloc_17_~array.offset 0), 8047#(and (= alloc_17_~array.offset 0) (<= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset 4) (select |#length| alloc_17_~array.base))), 8048#(and (<= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) (select |#length| alloc_17_~array.base)) (= alloc_17_~array.offset 0)), 8049#(= |old(#length)| |#length|), 8050#(and (<= (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset 4) (select |#length| alloc_17_~array.base)) (= alloc_17_~array.offset 0)), 8051#(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))] [2018-02-02 10:22:35,853 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 11 proven. 5 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-02-02 10:22:35,854 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-02 10:22:35,854 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-02 10:22:35,854 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2018-02-02 10:22:35,854 INFO L87 Difference]: Start difference. First operand 182 states and 207 transitions. Second operand 13 states. [2018-02-02 10:22:36,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:22:36,156 INFO L93 Difference]: Finished difference Result 180 states and 205 transitions. [2018-02-02 10:22:36,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-02 10:22:36,189 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 60 [2018-02-02 10:22:36,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:22:36,190 INFO L225 Difference]: With dead ends: 180 [2018-02-02 10:22:36,190 INFO L226 Difference]: Without dead ends: 180 [2018-02-02 10:22:36,191 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:22:36,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2018-02-02 10:22:36,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 180. [2018-02-02 10:22:36,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2018-02-02 10:22:36,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 205 transitions. [2018-02-02 10:22:36,195 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 205 transitions. Word has length 60 [2018-02-02 10:22:36,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:22:36,195 INFO L432 AbstractCegarLoop]: Abstraction has 180 states and 205 transitions. [2018-02-02 10:22:36,195 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-02 10:22:36,195 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 205 transitions. [2018-02-02 10:22:36,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-02-02 10:22:36,196 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:22:36,196 INFO L351 BasicCegarLoop]: trace histogram [3, 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, 1, 1, 1, 1, 1] [2018-02-02 10:22:36,196 INFO L371 AbstractCegarLoop]: === Iteration 28 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 10:22:36,196 INFO L82 PathProgramCache]: Analyzing trace with hash 796739391, now seen corresponding path program 1 times [2018-02-02 10:22:36,197 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:22:36,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:22:36,212 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:22:36,591 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-02-02 10:22:36,592 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:22:36,592 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-02-02 10:22:36,592 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:22:36,592 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:22:36,593 INFO L182 omatonBuilderFactory]: Interpolants [8448#(and (= alloc_17_~array.offset 0) (or (= 0 (select (select |#memory_$Pointer$.offset| alloc_17_~array.base) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset))) (not (= 0 (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset)))) (<= alloc_17_~j~0 0)), 8449#(and (= 0 (select (select |#memory_$Pointer$.offset| alloc_17_~array.base) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset))) (= alloc_17_~array.offset 0) (= 0 (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset))), 8450#(= 0 |alloc_17_#t~mem7.offset|), 8431#true, 8432#false, 8433#(= 0 |ldv_malloc_#t~malloc2.offset|), 8434#(= 0 |ldv_malloc_#res.offset|), 8435#(= 0 |entry_point_#t~ret12.offset|), 8436#(= 0 entry_point_~array~0.offset), 8437#(and (= 0 entry_point_~array~0.offset) (= entry_point_~i~2 0)), 8438#(and (= 0 entry_point_~array~0.offset) (<= entry_point_~i~2 1)), 8439#(and (<= entry_point_~i~2 2) (= 0 entry_point_~array~0.offset)), 8440#(and (= 0 entry_point_~array~0.offset) (<= entry_point_~len~0 2)), 8441#(and (= 0 |alloc_17_#in~array.offset|) (<= |alloc_17_#in~len| 2)), 8442#(and (or (<= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) 0) (<= alloc_17_~len 2)) (= alloc_17_~array.offset 0) (or (<= alloc_17_~len 2) (not (= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) 0)))), 8443#(and (or (<= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) 0) (<= alloc_17_~len 2)) (or (and (= 0 |alloc_17_#t~ret4.offset|) (<= alloc_17_~len 2)) (not (= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) 0))) (= alloc_17_~array.offset 0)), 8444#(and (or (<= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) 0) (<= alloc_17_~len 2)) (= alloc_17_~array.offset 0) (or (and (<= alloc_17_~len 2) (= 0 alloc_17_~p~0.offset)) (not (= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) 0)))), 8445#(and (<= 0 (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset)) (= alloc_17_~array.offset 0) (<= alloc_17_~len 2) (or (= 0 (select (select |#memory_$Pointer$.offset| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~i~0)))) (not (= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) 0)))), 8446#(and (= alloc_17_~array.offset 0) (or (<= (* 4 alloc_17_~len) (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset 3)) (and (<= alloc_17_~len 2) (= 0 (select (select |#memory_$Pointer$.offset| alloc_17_~array.base) 0))))), 8447#(and (<= alloc_17_~i~0 1) (= alloc_17_~array.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| alloc_17_~array.base) 0)))] [2018-02-02 10:22:36,593 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-02-02 10:22:36,593 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-02 10:22:36,593 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-02 10:22:36,593 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=332, Unknown=0, NotChecked=0, Total=380 [2018-02-02 10:22:36,594 INFO L87 Difference]: Start difference. First operand 180 states and 205 transitions. Second operand 20 states. [2018-02-02 10:22:37,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:22:37,371 INFO L93 Difference]: Finished difference Result 251 states and 288 transitions. [2018-02-02 10:22:37,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-02 10:22:37,372 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 61 [2018-02-02 10:22:37,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:22:37,373 INFO L225 Difference]: With dead ends: 251 [2018-02-02 10:22:37,373 INFO L226 Difference]: Without dead ends: 251 [2018-02-02 10:22:37,373 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 200 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=182, Invalid=940, Unknown=0, NotChecked=0, Total=1122 [2018-02-02 10:22:37,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2018-02-02 10:22:37,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 231. [2018-02-02 10:22:37,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2018-02-02 10:22:37,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 266 transitions. [2018-02-02 10:22:37,378 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 266 transitions. Word has length 61 [2018-02-02 10:22:37,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:22:37,379 INFO L432 AbstractCegarLoop]: Abstraction has 231 states and 266 transitions. [2018-02-02 10:22:37,379 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-02 10:22:37,379 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 266 transitions. [2018-02-02 10:22:37,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-02-02 10:22:37,379 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:22:37,380 INFO L351 BasicCegarLoop]: trace histogram [3, 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, 1, 1, 1, 1, 1] [2018-02-02 10:22:37,380 INFO L371 AbstractCegarLoop]: === Iteration 29 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 10:22:37,380 INFO L82 PathProgramCache]: Analyzing trace with hash 796739392, now seen corresponding path program 1 times [2018-02-02 10:22:37,381 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:22:37,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:22:37,393 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:22:37,935 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 4 proven. 20 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 10:22:37,935 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:22:37,935 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-02-02 10:22:37,935 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:22:37,936 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:22:37,936 INFO L182 omatonBuilderFactory]: Interpolants [8962#true, 8963#false, 8964#(= 0 |ldv_malloc_#t~malloc2.offset|), 8965#(= 0 |ldv_malloc_#res.offset|), 8966#(= 0 |entry_point_#t~ret12.offset|), 8967#(= 0 entry_point_~array~0.offset), 8968#(and (= 0 entry_point_~array~0.offset) (= entry_point_~i~2 0)), 8969#(and (= 0 entry_point_~array~0.offset) (<= entry_point_~i~2 1)), 8970#(and (<= entry_point_~i~2 2) (= 0 entry_point_~array~0.offset)), 8971#(and (= 0 entry_point_~array~0.offset) (<= entry_point_~len~0 2)), 8972#(and (= 0 |alloc_17_#in~array.offset|) (<= |alloc_17_#in~len| 2)), 8973#(and (or (<= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) 0) (<= alloc_17_~len 2)) (= alloc_17_~array.offset 0) (or (<= alloc_17_~len 2) (not (= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) 0)))), 8974#(= 1 (select |#valid| |ldv_malloc_#t~malloc2.base|)), 8975#(= 1 (select |#valid| |ldv_malloc_#res.base|)), 8976#(and (or (<= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) 0) (<= alloc_17_~len 2)) (or (and (<= alloc_17_~len 2) (= 1 (select |#valid| |alloc_17_#t~ret4.base|))) (not (= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) 0))) (= alloc_17_~array.offset 0)), 8977#(and (or (<= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) 0) (<= alloc_17_~len 2)) (or (and (= 1 (select |#valid| alloc_17_~p~0.base)) (<= alloc_17_~len 2)) (not (= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) 0))) (= alloc_17_~array.offset 0)), 8978#(and (<= 0 (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset)) (= alloc_17_~array.offset 0) (or (= 1 (select |#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))) (<= alloc_17_~len 2)), 8979#(and (or (and (<= alloc_17_~len 2) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 0)))) (<= (* 4 alloc_17_~len) (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset 3))) (= alloc_17_~array.offset 0)), 8980#(and (<= alloc_17_~i~0 1) (= alloc_17_~array.offset 0) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 0)))), 8981#(= |#valid| |old(#valid)|), 8982#(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) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset))))) (<= alloc_17_~j~0 0)), 8983#(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) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset))))), 8984#(= 1 (select |#valid| |alloc_17_#t~mem7.base|))] [2018-02-02 10:22:37,936 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 4 proven. 20 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 10:22:37,936 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-02 10:22:37,937 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-02 10:22:37,937 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=452, Unknown=0, NotChecked=0, Total=506 [2018-02-02 10:22:37,937 INFO L87 Difference]: Start difference. First operand 231 states and 266 transitions. Second operand 23 states. [2018-02-02 10:22:38,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:22:38,660 INFO L93 Difference]: Finished difference Result 260 states and 299 transitions. [2018-02-02 10:22:38,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-02-02 10:22:38,660 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 61 [2018-02-02 10:22:38,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:22:38,661 INFO L225 Difference]: With dead ends: 260 [2018-02-02 10:22:38,661 INFO L226 Difference]: Without dead ends: 260 [2018-02-02 10:22:38,661 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 383 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=219, Invalid=1587, Unknown=0, NotChecked=0, Total=1806 [2018-02-02 10:22:38,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2018-02-02 10:22:38,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 233. [2018-02-02 10:22:38,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2018-02-02 10:22:38,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 268 transitions. [2018-02-02 10:22:38,666 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 268 transitions. Word has length 61 [2018-02-02 10:22:38,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:22:38,666 INFO L432 AbstractCegarLoop]: Abstraction has 233 states and 268 transitions. [2018-02-02 10:22:38,666 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-02 10:22:38,666 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 268 transitions. [2018-02-02 10:22:38,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-02-02 10:22:38,667 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:22:38,667 INFO L351 BasicCegarLoop]: trace histogram [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, 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:22:38,667 INFO L371 AbstractCegarLoop]: === Iteration 30 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 10:22:38,667 INFO L82 PathProgramCache]: Analyzing trace with hash -1218510372, now seen corresponding path program 2 times [2018-02-02 10:22:38,668 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:22:38,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:22:38,678 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:22:38,986 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:22:38,986 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:22:38,986 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-02-02 10:22:38,986 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:22:38,987 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:22:38,987 INFO L182 omatonBuilderFactory]: Interpolants [9518#true, 9519#false, 9520#(= 0 |ldv_malloc_#t~malloc2.offset|), 9521#(= 0 |ldv_malloc_#res.offset|), 9522#(= 0 |entry_point_#t~ret12.offset|), 9523#(= 0 entry_point_~array~0.offset), 9524#(and (= 0 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset)) (= 0 entry_point_~array~0.offset)), 9525#(and (= 1 (select |#valid| entry_point_~array~0.base)) (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset))) (= 0 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset)) (= 0 entry_point_~array~0.offset)), 9526#(and (= 1 (select |#valid| entry_point_~array~0.base)) (= entry_point_~array~0.offset 0) (<= 4 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset)) (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) 0))), 9527#(and (= 1 (select |#valid| entry_point_~array~0.base)) (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0)) (= entry_point_~array~0.offset 0) (< 1 entry_point_~i~2)), 9528#(and (= 1 (select |#valid| entry_point_~array~0.base)) (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0)) (= entry_point_~array~0.offset 0)), 9529#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)), 9530#(= |#valid| |old(#valid)|), 9531#(and (= 0 (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) 0)) (= 0 |free_17_#in~array.offset|) (= 1 (select |#valid| |free_17_#in~array.base|))), 9532#(and (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (* 4 free_17_~i~1) free_17_~array.offset))) (= 1 (select |#valid| free_17_~array.base))), 9533#(and (= 1 (select |#valid| free_17_~array.base)) (= 0 |free_17_#t~mem10.base|)), 9534#(= 1 (select |#valid| free_17_~array.base))] [2018-02-02 10:22:38,987 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:22:38,987 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-02 10:22:38,987 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-02 10:22:38,988 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2018-02-02 10:22:38,988 INFO L87 Difference]: Start difference. First operand 233 states and 268 transitions. Second operand 17 states. [2018-02-02 10:22:39,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:22:39,402 INFO L93 Difference]: Finished difference Result 263 states and 300 transitions. [2018-02-02 10:22:39,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-02 10:22:39,402 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 61 [2018-02-02 10:22:39,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:22:39,403 INFO L225 Difference]: With dead ends: 263 [2018-02-02 10:22:39,404 INFO L226 Difference]: Without dead ends: 263 [2018-02-02 10:22:39,404 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=93, Invalid=459, Unknown=0, NotChecked=0, Total=552 [2018-02-02 10:22:39,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2018-02-02 10:22:39,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 251. [2018-02-02 10:22:39,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251 states. [2018-02-02 10:22:39,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 287 transitions. [2018-02-02 10:22:39,409 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 287 transitions. Word has length 61 [2018-02-02 10:22:39,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:22:39,409 INFO L432 AbstractCegarLoop]: Abstraction has 251 states and 287 transitions. [2018-02-02 10:22:39,409 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-02 10:22:39,409 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 287 transitions. [2018-02-02 10:22:39,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-02-02 10:22:39,410 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:22:39,410 INFO L351 BasicCegarLoop]: trace histogram [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, 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:22:39,410 INFO L371 AbstractCegarLoop]: === Iteration 31 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 10:22:39,410 INFO L82 PathProgramCache]: Analyzing trace with hash -1218510371, now seen corresponding path program 1 times [2018-02-02 10:22:39,411 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:22:39,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:22:39,418 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:22:39,576 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 10:22:39,577 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:22:39,577 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-02 10:22:39,577 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:22:39,577 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:22:39,577 INFO L182 omatonBuilderFactory]: Interpolants [10063#true, 10064#false, 10065#(= 0 |ldv_malloc_#t~malloc2.offset|), 10066#(= 0 |ldv_malloc_#res.offset|), 10067#(= 0 |entry_point_#t~ret12.offset|), 10068#(= entry_point_~array~0.offset 0), 10069#(and (<= (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset 4) (select |#length| entry_point_~array~0.base)) (= entry_point_~array~0.offset 0)), 10070#(and (<= (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) (select |#length| entry_point_~array~0.base)) (= entry_point_~array~0.offset 0)), 10071#(and (<= (+ (* 4 entry_point_~len~0) entry_point_~array~0.offset) (select |#length| entry_point_~array~0.base)) (= entry_point_~array~0.offset 0)), 10072#(= |old(#length)| |#length|), 10073#(and (<= (* 4 |free_17_#in~len|) (select |#length| |free_17_#in~array.base|)) (= 0 |free_17_#in~array.offset|)), 10074#(and (<= (* 4 free_17_~len) (select |#length| free_17_~array.base)) (= free_17_~array.offset 0)), 10075#(and (<= (* 4 free_17_~len) (select |#length| free_17_~array.base)) (<= 0 (+ (* 4 free_17_~i~1) free_17_~array.offset)) (= free_17_~array.offset 0)), 10076#(and (<= 4 (+ (* 4 free_17_~i~1) free_17_~array.offset)) (<= (* 4 free_17_~len) (select |#length| free_17_~array.base)) (= free_17_~array.offset 0)), 10077#(and (<= 4 (+ (* 4 free_17_~i~1) free_17_~array.offset)) (<= (+ (* 4 free_17_~i~1) 4) (select |#length| free_17_~array.base)) (= free_17_~array.offset 0))] [2018-02-02 10:22:39,577 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 10:22:39,578 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-02 10:22:39,578 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-02 10:22:39,578 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2018-02-02 10:22:39,578 INFO L87 Difference]: Start difference. First operand 251 states and 287 transitions. Second operand 15 states. [2018-02-02 10:22:39,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:22:39,834 INFO L93 Difference]: Finished difference Result 258 states and 289 transitions. [2018-02-02 10:22:39,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-02 10:22:39,834 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 61 [2018-02-02 10:22:39,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:22:39,835 INFO L225 Difference]: With dead ends: 258 [2018-02-02 10:22:39,836 INFO L226 Difference]: Without dead ends: 258 [2018-02-02 10:22:39,836 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=384, Unknown=0, NotChecked=0, Total=462 [2018-02-02 10:22:39,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2018-02-02 10:22:39,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 251. [2018-02-02 10:22:39,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251 states. [2018-02-02 10:22:39,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 285 transitions. [2018-02-02 10:22:39,841 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 285 transitions. Word has length 61 [2018-02-02 10:22:39,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:22:39,841 INFO L432 AbstractCegarLoop]: Abstraction has 251 states and 285 transitions. [2018-02-02 10:22:39,841 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-02 10:22:39,841 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 285 transitions. [2018-02-02 10:22:39,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-02-02 10:22:39,842 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:22:39,842 INFO L351 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:22:39,842 INFO L371 AbstractCegarLoop]: === Iteration 32 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 10:22:39,843 INFO L82 PathProgramCache]: Analyzing trace with hash -1523736181, now seen corresponding path program 1 times [2018-02-02 10:22:39,843 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:22:39,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:22:39,854 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:22:40,503 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:22:40,503 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:22:40,503 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-02-02 10:22:40,503 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:22:40,504 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:22:40,504 INFO L182 omatonBuilderFactory]: Interpolants [10624#(or (and (= (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) 0) |free_17_#in~array.base|) (= (select |#valid| |free_17_#in~array.base|) 0)) (= |#valid| |old(#valid)|) (= 1 (select |#valid| |free_17_#in~array.base|)) (not (= |free_17_#in~array.offset| 0)) (<= 2 |free_17_#in~len|)), 10625#(= 1 (select |#valid| entry_point_~array~0.base)), 10601#true, 10602#false, 10603#(and (= 0 |ldv_malloc_#t~malloc2.offset|) (= 1 (select |#valid| |ldv_malloc_#t~malloc2.base|))), 10604#(and (= 0 |ldv_malloc_#res.offset|) (= 1 (select |#valid| |ldv_malloc_#res.base|))), 10605#(and (= 0 |entry_point_#t~ret12.offset|) (= 1 (select |#valid| |entry_point_#t~ret12.base|))), 10606#(and (= 1 (select |#valid| entry_point_~array~0.base)) (= 0 entry_point_~array~0.offset)), 10607#(and (= 1 (select |#valid| entry_point_~array~0.base)) (= 0 entry_point_~array~0.offset) (= entry_point_~i~2 0)), 10608#(and (= 1 (select |#valid| entry_point_~array~0.base)) (= 0 entry_point_~array~0.offset) (<= entry_point_~i~2 1)), 10609#(and (= 1 (select |#valid| entry_point_~array~0.base)) (= 0 entry_point_~array~0.offset) (<= entry_point_~len~0 1)), 10610#(= |#valid| |old(#valid)|), 10611#(and (or (<= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) 0) (and (or (= alloc_17_~len |alloc_17_#in~len|) (not (= alloc_17_~array.offset 0))) (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset)))) (or (not (= 0 (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset))) (= |#valid| |old(#valid)|)) (= alloc_17_~array.base |alloc_17_#in~array.base|)), 10612#(and (or (<= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) 0) (and (or (and (= alloc_17_~len |alloc_17_#in~len|) (<= (+ alloc_17_~i~0 1) alloc_17_~len)) (not (= alloc_17_~array.offset 0))) (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset)))) (or (not (= 0 (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset))) (= |#valid| |old(#valid)|)) (= alloc_17_~array.base |alloc_17_#in~array.base|)), 10613#(= 0 (select |old(#valid)| |ldv_malloc_#t~malloc2.base|)), 10614#(= 0 (select |old(#valid)| |ldv_malloc_#res.base|)), 10615#(and (or (<= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) 0) (and (or (and (= alloc_17_~len |alloc_17_#in~len|) (<= (+ alloc_17_~i~0 1) alloc_17_~len)) (not (= alloc_17_~array.offset 0))) (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset)))) (or (= 0 (select |old(#valid)| |alloc_17_#t~ret4.base|)) (not (= 0 (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset)))) (= alloc_17_~array.base |alloc_17_#in~array.base|)), 10616#(and (or (<= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) 0) (and (or (and (= alloc_17_~len |alloc_17_#in~len|) (<= (+ alloc_17_~i~0 1) alloc_17_~len)) (not (= alloc_17_~array.offset 0))) (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset)))) (or (= 0 (select |old(#valid)| alloc_17_~p~0.base)) (not (= 0 (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset)))) (= alloc_17_~array.base |alloc_17_#in~array.base|)), 10617#(and (= 1 (select |#valid| |alloc_17_#in~array.base|)) (or (and (<= 2 alloc_17_~len) (= alloc_17_~len |alloc_17_#in~len|)) (not (= |alloc_17_#in~array.offset| 0)) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) 0))))), 10618#(and (or (<= 2 |alloc_17_#in~len|) (not (= |alloc_17_#in~array.offset| 0)) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) 0)))) (= 1 (select |#valid| |alloc_17_#in~array.base|))), 10619#(and (= 1 (select |#valid| entry_point_~array~0.base)) (= 0 entry_point_~array~0.offset) (<= entry_point_~len~0 1) (not (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0)))), 10620#(and (= |#valid| |old(#valid)|) (= free_17_~array.base |free_17_#in~array.base|) (or (= 0 (+ (* 4 free_17_~i~1) free_17_~array.offset)) (and (or (= |free_17_#in~array.offset| free_17_~array.offset) (= free_17_~array.offset 0)) (or (not (= free_17_~array.offset 0)) (= free_17_~len |free_17_#in~len|))))), 10621#(and (or (= 0 (+ (* 4 free_17_~i~1) free_17_~array.offset)) (and (or (= |free_17_#in~array.offset| free_17_~array.offset) (= free_17_~array.offset 0)) (or (not (= free_17_~array.offset 0)) (and (or (<= (+ (* 4 free_17_~i~1) free_17_~array.offset) 0) (<= (+ free_17_~i~1 1) free_17_~len)) (= free_17_~len |free_17_#in~len|))))) (= |#valid| |old(#valid)|) (= free_17_~array.base |free_17_#in~array.base|)), 10622#(and (or (and (<= 2 free_17_~len) (= free_17_~len |free_17_#in~len|)) (= 1 (select (store |#valid| |free_17_#t~mem10.base| 0) |free_17_#in~array.base|)) (not (= |free_17_#in~array.offset| 0)) (and (= |free_17_#t~mem10.base| |free_17_#in~array.base|) (= (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) 0) |free_17_#in~array.base|))) (= |#valid| |old(#valid)|)), 10623#(or (and (<= 2 free_17_~len) (= free_17_~len |free_17_#in~len|)) (and (= (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) 0) |free_17_#in~array.base|) (= (select |#valid| |free_17_#in~array.base|) 0)) (= |#valid| |old(#valid)|) (= 1 (select |#valid| |free_17_#in~array.base|)) (not (= |free_17_#in~array.offset| 0)))] [2018-02-02 10:22:40,504 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:22:40,504 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-02-02 10:22:40,504 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-02-02 10:22:40,505 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=527, Unknown=0, NotChecked=0, Total=600 [2018-02-02 10:22:40,505 INFO L87 Difference]: Start difference. First operand 251 states and 285 transitions. Second operand 25 states. [2018-02-02 10:22:41,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:22:41,047 INFO L93 Difference]: Finished difference Result 306 states and 359 transitions. [2018-02-02 10:22:41,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-02 10:22:41,048 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 62 [2018-02-02 10:22:41,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:22:41,049 INFO L225 Difference]: With dead ends: 306 [2018-02-02 10:22:41,049 INFO L226 Difference]: Without dead ends: 306 [2018-02-02 10:22:41,049 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=118, Invalid=874, Unknown=0, NotChecked=0, Total=992 [2018-02-02 10:22:41,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2018-02-02 10:22:41,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 236. [2018-02-02 10:22:41,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2018-02-02 10:22:41,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 270 transitions. [2018-02-02 10:22:41,052 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 270 transitions. Word has length 62 [2018-02-02 10:22:41,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:22:41,052 INFO L432 AbstractCegarLoop]: Abstraction has 236 states and 270 transitions. [2018-02-02 10:22:41,052 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-02-02 10:22:41,052 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 270 transitions. [2018-02-02 10:22:41,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-02-02 10:22:41,053 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:22:41,053 INFO L351 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:22:41,053 INFO L371 AbstractCegarLoop]: === Iteration 33 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 10:22:41,053 INFO L82 PathProgramCache]: Analyzing trace with hash 1834734922, now seen corresponding path program 1 times [2018-02-02 10:22:41,054 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:22:41,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:22:41,060 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:22:41,526 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 10:22:41,526 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:22:41,527 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-02-02 10:22:41,527 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:22:41,527 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:22:41,527 INFO L182 omatonBuilderFactory]: Interpolants [11182#true, 11183#false, 11184#(= |#valid| |old(#valid)|), 11185#(and (not (= |ldv_malloc_#t~malloc2.base| 0)) (= (select |old(#valid)| |ldv_malloc_#t~malloc2.base|) 0) (= 0 |ldv_malloc_#t~malloc2.offset|) (= |#valid| (store |old(#valid)| |ldv_malloc_#t~malloc2.base| (select |#valid| |ldv_malloc_#t~malloc2.base|)))), 11186#(and (= (select |old(#valid)| |ldv_malloc_#res.base|) 0) (= 0 |ldv_malloc_#res.offset|) (= |#valid| (store |old(#valid)| |ldv_malloc_#res.base| (select |#valid| |ldv_malloc_#res.base|))) (not (= |ldv_malloc_#res.base| 0))), 11187#(and (= |#valid| (store |old(#valid)| |entry_point_#t~ret12.base| (select |#valid| |entry_point_#t~ret12.base|))) (= 0 |entry_point_#t~ret12.offset|) (not (= |entry_point_#t~ret12.base| 0)) (= (select |old(#valid)| |entry_point_#t~ret12.base|) 0)), 11188#(and (= (select |old(#valid)| entry_point_~array~0.base) 0) (not (= entry_point_~array~0.base 0)) (= entry_point_~array~0.offset 0) (= |#valid| (store |old(#valid)| entry_point_~array~0.base (select |#valid| entry_point_~array~0.base)))), 11189#(and (= (select |old(#valid)| entry_point_~array~0.base) 0) (= 0 entry_point_~array~0.offset) (not (= entry_point_~array~0.base 0)) (= |#valid| (store |old(#valid)| entry_point_~array~0.base (select |#valid| entry_point_~array~0.base))) (= entry_point_~i~2 0)), 11190#(and (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset))) (= (select |old(#valid)| entry_point_~array~0.base) 0) (= 0 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset)) (not (= entry_point_~array~0.base 0)) (= |#valid| (store |old(#valid)| entry_point_~array~0.base (select |#valid| entry_point_~array~0.base))) (= entry_point_~i~2 0)), 11191#(and (= (select |old(#valid)| entry_point_~array~0.base) 0) (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0)) (= 0 entry_point_~array~0.offset) (not (= entry_point_~array~0.base 0)) (<= entry_point_~i~2 1) (= |#valid| (store |old(#valid)| entry_point_~array~0.base (select |#valid| entry_point_~array~0.base)))), 11192#(and (= (select |old(#valid)| entry_point_~array~0.base) 0) (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0)) (= 0 entry_point_~array~0.offset) (not (= entry_point_~array~0.base 0)) (<= entry_point_~len~0 1) (= |#valid| (store |old(#valid)| entry_point_~array~0.base (select |#valid| entry_point_~array~0.base)))), 11193#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)), 11194#(and (or (and (= |#valid| |old(#valid)|) (= free_17_~array.base |free_17_#in~array.base|)) (not (= 0 (+ (* 4 free_17_~i~1) free_17_~array.offset)))) (or (= 0 (+ (* 4 free_17_~i~1) free_17_~array.offset)) (and (or (= |free_17_#in~array.offset| free_17_~array.offset) (= free_17_~array.offset 0)) (or (not (= free_17_~array.offset 0)) (= free_17_~len |free_17_#in~len|))))), 11195#(and (or (and (= |#valid| |old(#valid)|) (= free_17_~array.base |free_17_#in~array.base|)) (not (= 0 (+ (* 4 free_17_~i~1) free_17_~array.offset)))) (or (= 0 (+ (* 4 free_17_~i~1) free_17_~array.offset)) (and (or (= |free_17_#in~array.offset| free_17_~array.offset) (= free_17_~array.offset 0)) (or (not (= free_17_~array.offset 0)) (and (or (<= (+ (* 4 free_17_~i~1) free_17_~array.offset) 0) (<= (+ free_17_~i~1 1) free_17_~len)) (= free_17_~len |free_17_#in~len|)))))), 11196#(or (and (<= 2 free_17_~len) (= free_17_~len |free_17_#in~len|)) (and (= |#valid| |old(#valid)|) (= |free_17_#t~mem10.base| (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) 0))) (not (= |free_17_#in~array.offset| 0))), 11197#(or (and (<= 2 free_17_~len) (= free_17_~len |free_17_#in~len|)) (= |#valid| |old(#valid)|) (not (= 0 (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) 0))) (not (= |free_17_#in~array.offset| 0))), 11198#(or (= |#valid| |old(#valid)|) (not (= 0 (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) 0))) (not (= |free_17_#in~array.offset| 0)) (<= 2 |free_17_#in~len|)), 11199#(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)))] [2018-02-02 10:22:41,527 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 10:22:41,528 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-02 10:22:41,528 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-02 10:22:41,528 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=253, Unknown=0, NotChecked=0, Total=306 [2018-02-02 10:22:41,528 INFO L87 Difference]: Start difference. First operand 236 states and 270 transitions. Second operand 18 states. [2018-02-02 10:22:41,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:22:41,963 INFO L93 Difference]: Finished difference Result 272 states and 317 transitions. [2018-02-02 10:22:41,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-02 10:22:41,964 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 62 [2018-02-02 10:22:41,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:22:41,965 INFO L225 Difference]: With dead ends: 272 [2018-02-02 10:22:41,965 INFO L226 Difference]: Without dead ends: 258 [2018-02-02 10:22:41,965 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=91, Invalid=415, Unknown=0, NotChecked=0, Total=506 [2018-02-02 10:22:41,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2018-02-02 10:22:41,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 230. [2018-02-02 10:22:41,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2018-02-02 10:22:41,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 263 transitions. [2018-02-02 10:22:41,968 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 263 transitions. Word has length 62 [2018-02-02 10:22:41,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:22:41,968 INFO L432 AbstractCegarLoop]: Abstraction has 230 states and 263 transitions. [2018-02-02 10:22:41,968 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-02 10:22:41,968 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 263 transitions. [2018-02-02 10:22:41,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-02-02 10:22:41,969 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:22:41,969 INFO L351 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:22:41,969 INFO L371 AbstractCegarLoop]: === Iteration 34 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 10:22:41,969 INFO L82 PathProgramCache]: Analyzing trace with hash 880884190, now seen corresponding path program 1 times [2018-02-02 10:22:41,969 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:22:41,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:22:41,976 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:22:42,163 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 10:22:42,164 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:22:42,164 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-02 10:22:42,164 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:22:42,164 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:22:42,164 INFO L182 omatonBuilderFactory]: Interpolants [11712#true, 11713#false, 11714#(= 0 |ldv_malloc_#t~malloc2.offset|), 11715#(= 0 |ldv_malloc_#res.offset|), 11716#(= 0 |entry_point_#t~ret12.offset|), 11717#(= entry_point_~array~0.offset 0), 11718#(and (= entry_point_~array~0.offset 0) (= entry_point_~i~2 0)), 11719#(and (= entry_point_~array~0.offset 0) (<= 4 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset)) (<= entry_point_~i~2 1)), 11720#(and (= entry_point_~array~0.offset 0) (<= 4 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset)) (<= entry_point_~i~2 1) (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset)))), 11721#(and (= entry_point_~array~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ 4 entry_point_~array~0.offset)))), 11722#(= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|), 11723#(and (= 0 (select (select |#memory_$Pointer$.offset| |free_17_#in~array.base|) 4)) (= 0 |free_17_#in~array.offset|)), 11724#(and (= (+ (* 4 free_17_~i~1) free_17_~array.offset) 0) (= 0 (select (select |#memory_$Pointer$.offset| free_17_~array.base) 4))), 11725#(= 0 (select (select |#memory_$Pointer$.offset| free_17_~array.base) (+ (* 4 free_17_~i~1) free_17_~array.offset))), 11726#(= 0 |free_17_#t~mem10.offset|)] [2018-02-02 10:22:42,165 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 10:22:42,165 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-02 10:22:42,165 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-02 10:22:42,165 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2018-02-02 10:22:42,165 INFO L87 Difference]: Start difference. First operand 230 states and 263 transitions. Second operand 15 states. [2018-02-02 10:22:42,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:22:42,455 INFO L93 Difference]: Finished difference Result 244 states and 274 transitions. [2018-02-02 10:22:42,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-02 10:22:42,455 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 62 [2018-02-02 10:22:42,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:22:42,456 INFO L225 Difference]: With dead ends: 244 [2018-02-02 10:22:42,456 INFO L226 Difference]: Without dead ends: 244 [2018-02-02 10:22:42,456 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=109, Invalid=647, Unknown=0, NotChecked=0, Total=756 [2018-02-02 10:22:42,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2018-02-02 10:22:42,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 231. [2018-02-02 10:22:42,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2018-02-02 10:22:42,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 265 transitions. [2018-02-02 10:22:42,460 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 265 transitions. Word has length 62 [2018-02-02 10:22:42,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:22:42,460 INFO L432 AbstractCegarLoop]: Abstraction has 231 states and 265 transitions. [2018-02-02 10:22:42,460 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-02 10:22:42,460 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 265 transitions. [2018-02-02 10:22:42,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-02-02 10:22:42,460 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:22:42,460 INFO L351 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:22:42,460 INFO L371 AbstractCegarLoop]: === Iteration 35 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 10:22:42,460 INFO L82 PathProgramCache]: Analyzing trace with hash 880884191, now seen corresponding path program 1 times [2018-02-02 10:22:42,461 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:22:42,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:22:42,467 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:22:42,716 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 10:22:42,716 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:22:42,716 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-02 10:22:42,716 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:22:42,717 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:22:42,717 INFO L182 omatonBuilderFactory]: Interpolants [12229#true, 12230#false, 12231#(= 0 |ldv_malloc_#t~malloc2.offset|), 12232#(= 0 |ldv_malloc_#res.offset|), 12233#(= 0 |entry_point_#t~ret12.offset|), 12234#(= entry_point_~array~0.offset 0), 12235#(and (= entry_point_~array~0.offset 0) (= entry_point_~i~2 0)), 12236#(and (= entry_point_~array~0.offset 0) (<= 4 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset)) (<= entry_point_~i~2 1)), 12237#(and (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset))) (= entry_point_~array~0.offset 0) (<= 4 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset)) (<= entry_point_~i~2 1)), 12238#(and (= entry_point_~array~0.offset 0) (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ 4 entry_point_~array~0.offset)))), 12239#(= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|), 12240#(and (= 0 |free_17_#in~array.offset|) (= 0 (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) 4))), 12241#(and (= (+ (* 4 free_17_~i~1) free_17_~array.offset) 0) (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) 4))), 12242#(= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (* 4 free_17_~i~1) free_17_~array.offset))), 12243#(= 0 |free_17_#t~mem10.base|)] [2018-02-02 10:22:42,717 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 10:22:42,717 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-02 10:22:42,717 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-02 10:22:42,717 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2018-02-02 10:22:42,718 INFO L87 Difference]: Start difference. First operand 231 states and 265 transitions. Second operand 15 states. [2018-02-02 10:22:43,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:22:43,101 INFO L93 Difference]: Finished difference Result 243 states and 273 transitions. [2018-02-02 10:22:43,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-02 10:22:43,102 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 62 [2018-02-02 10:22:43,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:22:43,103 INFO L225 Difference]: With dead ends: 243 [2018-02-02 10:22:43,103 INFO L226 Difference]: Without dead ends: 243 [2018-02-02 10:22:43,103 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=86, Invalid=514, Unknown=0, NotChecked=0, Total=600 [2018-02-02 10:22:43,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2018-02-02 10:22:43,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 231. [2018-02-02 10:22:43,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2018-02-02 10:22:43,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 264 transitions. [2018-02-02 10:22:43,108 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 264 transitions. Word has length 62 [2018-02-02 10:22:43,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:22:43,108 INFO L432 AbstractCegarLoop]: Abstraction has 231 states and 264 transitions. [2018-02-02 10:22:43,108 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-02 10:22:43,108 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 264 transitions. [2018-02-02 10:22:43,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-02-02 10:22:43,109 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:22:43,109 INFO L351 BasicCegarLoop]: trace histogram [3, 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, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:22:43,109 INFO L371 AbstractCegarLoop]: === Iteration 36 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 10:22:43,109 INFO L82 PathProgramCache]: Analyzing trace with hash 1162377056, now seen corresponding path program 1 times [2018-02-02 10:22:43,110 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:22:43,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:22:43,119 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:22:43,512 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 7 proven. 18 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 10:22:43,512 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:22:43,512 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-02-02 10:22:43,512 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:22:43,513 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:22:43,513 INFO L182 omatonBuilderFactory]: Interpolants [12739#true, 12740#false, 12741#(and (= (select |#valid| |ldv_malloc_#t~malloc2.base|) 1) (= 0 |ldv_malloc_#t~malloc2.offset|)), 12742#(and (= 0 |ldv_malloc_#res.offset|) (= (select |#valid| |ldv_malloc_#res.base|) 1)), 12743#(and (= (select |#valid| |entry_point_#t~ret12.base|) 1) (= 0 |entry_point_#t~ret12.offset|)), 12744#(and (= entry_point_~array~0.offset 0) (= (select |#valid| entry_point_~array~0.base) 1)), 12745#(and (= entry_point_~array~0.offset 0) (= (select |#valid| entry_point_~array~0.base) 1) (= entry_point_~i~2 0)), 12746#(and (<= (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 4) (= entry_point_~array~0.offset 0) (= (select |#valid| entry_point_~array~0.base) 1)), 12747#(and (<= (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 8) (= entry_point_~array~0.offset 0) (= (select |#valid| entry_point_~array~0.base) 1)), 12748#(and (<= (+ (* 4 entry_point_~len~0) entry_point_~array~0.offset) 8) (= entry_point_~array~0.offset 0) (= (select |#valid| entry_point_~array~0.base) 1)), 12749#(and (= (select |#valid| |alloc_17_#in~array.base|) 1) (= 0 |alloc_17_#in~array.offset|) (<= |alloc_17_#in~len| 2)), 12750#(and (= alloc_17_~array.offset 0) (or (= (select |#valid| alloc_17_~array.base) 1) (not (= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) 0))) (<= alloc_17_~len 2)), 12751#(= |#valid| |old(#valid)|), 12752#(= 0 (select |old(#valid)| |ldv_malloc_#t~malloc2.base|)), 12753#(= 0 (select |old(#valid)| |ldv_malloc_#res.base|)), 12754#(and (= alloc_17_~array.offset 0) (<= alloc_17_~len 2) (or (not (= alloc_17_~array.base |alloc_17_#t~ret4.base|)) (not (= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) 0)))), 12755#(and (= alloc_17_~array.offset 0) (<= alloc_17_~len 2) (or (not (= alloc_17_~array.base alloc_17_~p~0.base)) (not (= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) 0)))), 12756#(and (<= 0 (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset)) (= 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_~i~0))))) (not (= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) 0))) (<= alloc_17_~len 2)), 12757#(and (= alloc_17_~array.offset 0) (= 1 (select |#valid| alloc_17_~array.base)) (<= alloc_17_~len 2) (or (not (= alloc_17_~array.base (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 0))) (<= (* 4 alloc_17_~len) (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset 3)))), 12758#(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)))), 12759#(and (= alloc_17_~array.offset 0) (= 1 (select |#valid| alloc_17_~array.base)) (<= alloc_17_~j~0 0) (or (not (= (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset) 0)) (not (= alloc_17_~array.base (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset)))))), 12760#(and (<= 0 alloc_17_~j~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) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset)))) (<= alloc_17_~j~0 0)), 12761#(and (= 1 (select |#valid| alloc_17_~array.base)) (not (= alloc_17_~array.base |alloc_17_#t~mem7.base|))), 12762#(= 1 (select |#valid| alloc_17_~array.base))] [2018-02-02 10:22:43,513 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 7 proven. 18 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 10:22:43,513 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-02-02 10:22:43,513 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-02-02 10:22:43,514 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=491, Unknown=0, NotChecked=0, Total=552 [2018-02-02 10:22:43,514 INFO L87 Difference]: Start difference. First operand 231 states and 264 transitions. Second operand 24 states. [2018-02-02 10:22:44,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:22:44,252 INFO L93 Difference]: Finished difference Result 253 states and 291 transitions. [2018-02-02 10:22:44,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-02-02 10:22:44,252 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 63 [2018-02-02 10:22:44,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:22:44,253 INFO L225 Difference]: With dead ends: 253 [2018-02-02 10:22:44,253 INFO L226 Difference]: Without dead ends: 253 [2018-02-02 10:22:44,254 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 360 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=221, Invalid=1585, Unknown=0, NotChecked=0, Total=1806 [2018-02-02 10:22:44,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2018-02-02 10:22:44,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 233. [2018-02-02 10:22:44,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2018-02-02 10:22:44,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 266 transitions. [2018-02-02 10:22:44,258 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 266 transitions. Word has length 63 [2018-02-02 10:22:44,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:22:44,258 INFO L432 AbstractCegarLoop]: Abstraction has 233 states and 266 transitions. [2018-02-02 10:22:44,258 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-02-02 10:22:44,259 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 266 transitions. [2018-02-02 10:22:44,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-02-02 10:22:44,259 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:22:44,259 INFO L351 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:22:44,259 INFO L371 AbstractCegarLoop]: === Iteration 37 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 10:22:44,260 INFO L82 PathProgramCache]: Analyzing trace with hash -115145315, now seen corresponding path program 1 times [2018-02-02 10:22:44,260 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:22:44,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:22:44,272 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:22:44,869 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-02-02 10:22:44,869 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:22:44,869 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-02-02 10:22:44,869 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:22:44,870 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 10:22:44,870 INFO L182 omatonBuilderFactory]: Interpolants [13287#true, 13288#false, 13289#(= |#valid| |old(#valid)|), 13290#(and (not (= |ldv_malloc_#t~malloc2.base| 0)) (= (select |old(#valid)| |ldv_malloc_#t~malloc2.base|) 0) (= 0 |ldv_malloc_#t~malloc2.offset|) (= 1 (select |#valid| |ldv_malloc_#t~malloc2.base|)) (= |#valid| (store |old(#valid)| |ldv_malloc_#t~malloc2.base| (select |#valid| |ldv_malloc_#t~malloc2.base|)))), 13291#(and (= (select |old(#valid)| |ldv_malloc_#res.base|) 0) (= 0 |ldv_malloc_#res.offset|) (= 1 (select |#valid| |ldv_malloc_#res.base|)) (not (= |ldv_malloc_#res.base| 0)) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))), 13292#(and (= 0 |entry_point_#t~ret12.offset|) (not (= |entry_point_#t~ret12.base| 0)) (= (select |old(#valid)| |entry_point_#t~ret12.base|) 0) (= 1 (select |#valid| |entry_point_#t~ret12.base|)) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))), 13293#(and (= 1 (select |#valid| entry_point_~array~0.base)) (= (select |old(#valid)| entry_point_~array~0.base) 0) (= 0 entry_point_~array~0.offset) (not (= entry_point_~array~0.base 0)) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))), 13294#(and (or (= 0 (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset)) (and (= alloc_17_~i~0 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset))) (or (and (= |#valid| |old(#valid)|) (= alloc_17_~array.base |alloc_17_#in~array.base|)) (not (= 0 (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset))))), 13295#(and (not (= |ldv_malloc_#t~malloc2.base| 0)) (= (select |old(#valid)| |ldv_malloc_#t~malloc2.base|) 0) (= 1 (select |#valid| |ldv_malloc_#t~malloc2.base|)) (= |#valid| (store |old(#valid)| |ldv_malloc_#t~malloc2.base| (select |#valid| |ldv_malloc_#t~malloc2.base|)))), 13296#(and (= (select |old(#valid)| |ldv_malloc_#res.base|) 0) (= |#valid| (store |old(#valid)| |ldv_malloc_#res.base| (select |#valid| |ldv_malloc_#res.base|))) (= (select |#valid| |ldv_malloc_#res.base|) 1) (not (= |ldv_malloc_#res.base| 0))), 13297#(and (or (= 0 (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset)) (and (= alloc_17_~i~0 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset))) (or (not (= 0 (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset))) (and (not (= |alloc_17_#t~ret4.base| 0)) (= (store |old(#valid)| |alloc_17_#t~ret4.base| (select |#valid| |alloc_17_#t~ret4.base|)) |#valid|) (= 1 (select |#valid| |alloc_17_#t~ret4.base|)) (= (select |old(#valid)| |alloc_17_#t~ret4.base|) 0) (= alloc_17_~array.base |alloc_17_#in~array.base|)))), 13298#(and (or (= 0 (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset)) (and (= alloc_17_~i~0 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset))) (or (and (not (= alloc_17_~p~0.base 0)) (= |#valid| (store |old(#valid)| alloc_17_~p~0.base (select |#valid| alloc_17_~p~0.base))) (= (select |old(#valid)| alloc_17_~p~0.base) 0) (= 1 (select |#valid| alloc_17_~p~0.base)) (= alloc_17_~array.base |alloc_17_#in~array.base|)) (not (= 0 (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset))))), 13299#(or (and (= alloc_17_~i~0 0) (not (= |alloc_17_#in~array.offset| 0))) (and (= (select |old(#valid)| (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) 0)) 0) (not (= (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) 0) 0)) (= |#valid| (store |old(#valid)| (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) 0) (select |#valid| (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) 0)))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) 0)) 1))), 13300#(or (not (= |alloc_17_#in~array.offset| 0)) (and (= (select |old(#valid)| (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) 0)) 0) (not (= (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) 0) 0)) (= |#valid| (store |old(#valid)| (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) 0) (select |#valid| (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) 0)))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) 0)) 1))), 13301#(and (= (select |old(#valid)| entry_point_~array~0.base) 0) (= 0 entry_point_~array~0.offset) (not (= entry_point_~array~0.base 0)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (not (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0) 0)) (= (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0)) 0) (= |#valid| (store (store |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0) (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) entry_point_~array~0.base (select |#valid| entry_point_~array~0.base)))), 13302#(and (or (and (= |#valid| |old(#valid)|) (= free_17_~array.base |free_17_#in~array.base|)) (not (= 0 (+ (* 4 free_17_~i~1) free_17_~array.offset)))) (or (= 0 (+ (* 4 free_17_~i~1) free_17_~array.offset)) (and (not (= free_17_~array.offset 0)) (= |free_17_#in~array.offset| free_17_~array.offset)))), 13303#(or (and (= |#valid| |old(#valid)|) (= |free_17_#t~mem10.base| (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) 0))) (not (= |free_17_#in~array.offset| 0))), 13304#(or (= 0 (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) 0)) (not (= |free_17_#in~array.offset| 0)) (and (= |#valid| (store |old(#valid)| (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) 0) (select |#valid| (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) 0)))) (= 0 (select |#valid| (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) 0))))), 13305#(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)))] [2018-02-02 10:22:44,870 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-02-02 10:22:44,870 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-02 10:22:44,870 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-02 10:22:44,870 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=303, Unknown=0, NotChecked=0, Total=342 [2018-02-02 10:22:44,871 INFO L87 Difference]: Start difference. First operand 233 states and 266 transitions. Second operand 19 states. [2018-02-02 10:22:45,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:22:45,564 INFO L93 Difference]: Finished difference Result 292 states and 341 transitions. [2018-02-02 10:22:45,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-02 10:22:45,564 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 65 [2018-02-02 10:22:45,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:22:45,565 INFO L225 Difference]: With dead ends: 292 [2018-02-02 10:22:45,565 INFO L226 Difference]: Without dead ends: 261 [2018-02-02 10:22:45,565 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=68, Invalid=532, Unknown=0, NotChecked=0, Total=600 [2018-02-02 10:22:45,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2018-02-02 10:22:45,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 235. [2018-02-02 10:22:45,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235 states. [2018-02-02 10:22:45,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 280 transitions. [2018-02-02 10:22:45,568 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 280 transitions. Word has length 65 [2018-02-02 10:22:45,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:22:45,568 INFO L432 AbstractCegarLoop]: Abstraction has 235 states and 280 transitions. [2018-02-02 10:22:45,568 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-02 10:22:45,569 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 280 transitions. [2018-02-02 10:22:45,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-02-02 10:22:45,569 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:22:45,569 INFO L351 BasicCegarLoop]: trace histogram [4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:22:45,569 INFO L371 AbstractCegarLoop]: === Iteration 38 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 10:22:45,570 INFO L82 PathProgramCache]: Analyzing trace with hash 32703062, now seen corresponding path program 2 times [2018-02-02 10:22:45,570 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:22:45,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:22:45,576 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:22:45,767 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-02-02 10:22:45,767 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:22:45,767 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-02 10:22:45,767 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:22:45,767 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:22:45,767 INFO L182 omatonBuilderFactory]: Interpolants [13856#(and (<= alloc_17_~i~0 1) (= alloc_17_~array.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| alloc_17_~array.base) 0))), 13857#(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)), 13858#(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))))), 13859#(= 0 |alloc_17_#t~mem7.offset|), 13845#true, 13846#false, 13847#(= 0 |ldv_malloc_#t~malloc2.offset|), 13848#(= 0 |ldv_malloc_#res.offset|), 13849#(= 0 |entry_point_#t~ret12.offset|), 13850#(= 0 entry_point_~array~0.offset), 13851#(= 0 |alloc_17_#in~array.offset|), 13852#(and (= alloc_17_~i~0 0) (= alloc_17_~array.offset 0)), 13853#(and (= 0 |alloc_17_#t~ret4.offset|) (= alloc_17_~i~0 0) (= alloc_17_~array.offset 0)), 13854#(and (= alloc_17_~i~0 0) (= alloc_17_~array.offset 0) (= 0 alloc_17_~p~0.offset)), 13855#(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:22:45,767 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-02-02 10:22:45,768 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-02 10:22:45,768 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-02 10:22:45,768 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2018-02-02 10:22:45,768 INFO L87 Difference]: Start difference. First operand 235 states and 280 transitions. Second operand 15 states. [2018-02-02 10:22:46,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:22:46,008 INFO L93 Difference]: Finished difference Result 267 states and 316 transitions. [2018-02-02 10:22:46,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-02 10:22:46,008 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 65 [2018-02-02 10:22:46,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:22:46,009 INFO L225 Difference]: With dead ends: 267 [2018-02-02 10:22:46,009 INFO L226 Difference]: Without dead ends: 267 [2018-02-02 10:22:46,009 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=103, Invalid=547, Unknown=0, NotChecked=0, Total=650 [2018-02-02 10:22:46,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2018-02-02 10:22:46,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 242. [2018-02-02 10:22:46,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2018-02-02 10:22:46,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 290 transitions. [2018-02-02 10:22:46,012 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 290 transitions. Word has length 65 [2018-02-02 10:22:46,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:22:46,012 INFO L432 AbstractCegarLoop]: Abstraction has 242 states and 290 transitions. [2018-02-02 10:22:46,012 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-02 10:22:46,012 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 290 transitions. [2018-02-02 10:22:46,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-02-02 10:22:46,013 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:22:46,013 INFO L351 BasicCegarLoop]: trace histogram [4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:22:46,013 INFO L371 AbstractCegarLoop]: === Iteration 39 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 10:22:46,013 INFO L82 PathProgramCache]: Analyzing trace with hash 32703063, now seen corresponding path program 2 times [2018-02-02 10:22:46,013 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:22:46,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:22:46,019 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:22:46,304 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-02-02 10:22:46,304 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:22:46,304 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-02-02 10:22:46,304 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:22:46,304 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:22:46,304 INFO L182 omatonBuilderFactory]: Interpolants [14400#(= 1 (select |#valid| |ldv_malloc_#t~malloc2.base|)), 14401#(= 1 (select |#valid| |ldv_malloc_#res.base|)), 14402#(and (= alloc_17_~i~0 0) (= alloc_17_~array.offset 0) (= 1 (select |#valid| |alloc_17_#t~ret4.base|))), 14403#(and (= alloc_17_~i~0 0) (= alloc_17_~array.offset 0) (= 1 (select |#valid| alloc_17_~p~0.base))), 14404#(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)))))), 14405#(and (<= alloc_17_~i~0 1) (= alloc_17_~array.offset 0) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 0)))), 14406#(= |#valid| |old(#valid)|), 14407#(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)), 14408#(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)))))), 14409#(= 1 (select |#valid| |alloc_17_#t~mem7.base|)), 14392#true, 14393#false, 14394#(= 0 |ldv_malloc_#t~malloc2.offset|), 14395#(= 0 |ldv_malloc_#res.offset|), 14396#(= 0 |entry_point_#t~ret12.offset|), 14397#(= 0 entry_point_~array~0.offset), 14398#(= 0 |alloc_17_#in~array.offset|), 14399#(and (= alloc_17_~i~0 0) (= alloc_17_~array.offset 0))] [2018-02-02 10:22:46,305 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-02-02 10:22:46,305 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-02 10:22:46,305 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-02 10:22:46,305 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=268, Unknown=0, NotChecked=0, Total=306 [2018-02-02 10:22:46,305 INFO L87 Difference]: Start difference. First operand 242 states and 290 transitions. Second operand 18 states. [2018-02-02 10:22:46,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:22:46,731 INFO L93 Difference]: Finished difference Result 251 states and 297 transitions. [2018-02-02 10:22:46,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-02 10:22:46,731 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 65 [2018-02-02 10:22:46,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:22:46,732 INFO L225 Difference]: With dead ends: 251 [2018-02-02 10:22:46,732 INFO L226 Difference]: Without dead ends: 251 [2018-02-02 10:22:46,732 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=118, Invalid=812, Unknown=0, NotChecked=0, Total=930 [2018-02-02 10:22:46,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2018-02-02 10:22:46,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 244. [2018-02-02 10:22:46,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 244 states. [2018-02-02 10:22:46,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 292 transitions. [2018-02-02 10:22:46,736 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 292 transitions. Word has length 65 [2018-02-02 10:22:46,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:22:46,736 INFO L432 AbstractCegarLoop]: Abstraction has 244 states and 292 transitions. [2018-02-02 10:22:46,736 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-02 10:22:46,736 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 292 transitions. [2018-02-02 10:22:46,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-02-02 10:22:46,736 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:22:46,736 INFO L351 BasicCegarLoop]: trace histogram [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, 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:22:46,736 INFO L371 AbstractCegarLoop]: === Iteration 40 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 10:22:46,736 INFO L82 PathProgramCache]: Analyzing trace with hash -375554797, now seen corresponding path program 2 times [2018-02-02 10:22:46,737 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:22:46,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:22:46,742 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:22:46,833 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 10:22:46,833 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:22:46,833 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-02 10:22:46,833 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:22:46,833 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:22:46,833 INFO L182 omatonBuilderFactory]: Interpolants [14931#true, 14932#false, 14933#(= 0 |ldv_malloc_#t~malloc2.offset|), 14934#(= 0 |ldv_malloc_#res.offset|), 14935#(= 0 |entry_point_#t~ret12.offset|), 14936#(= entry_point_~array~0.offset 0), 14937#(and (<= 0 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset)) (= entry_point_~array~0.offset 0)), 14938#(and (= entry_point_~array~0.offset 0) (<= 4 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset))), 14939#(and (= entry_point_~array~0.offset 0) (<= 8 (+ (* 4 entry_point_~len~0) entry_point_~array~0.offset))), 14940#(and (= free_17_~i~1 0) (= free_17_~len |free_17_#in~len|)), 14941#(and (= free_17_~len |free_17_#in~len|) (<= free_17_~i~1 1)), 14942#(<= |free_17_#in~len| 1)] [2018-02-02 10:22:46,833 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 10:22:46,834 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-02 10:22:46,834 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-02 10:22:46,834 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2018-02-02 10:22:46,834 INFO L87 Difference]: Start difference. First operand 244 states and 292 transitions. Second operand 12 states. [2018-02-02 10:22:46,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:22:46,920 INFO L93 Difference]: Finished difference Result 267 states and 313 transitions. [2018-02-02 10:22:46,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-02 10:22:46,921 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 66 [2018-02-02 10:22:46,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:22:46,921 INFO L225 Difference]: With dead ends: 267 [2018-02-02 10:22:46,921 INFO L226 Difference]: Without dead ends: 261 [2018-02-02 10:22:46,921 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2018-02-02 10:22:46,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2018-02-02 10:22:46,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 229. [2018-02-02 10:22:46,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2018-02-02 10:22:46,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 271 transitions. [2018-02-02 10:22:46,926 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 271 transitions. Word has length 66 [2018-02-02 10:22:46,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:22:46,926 INFO L432 AbstractCegarLoop]: Abstraction has 229 states and 271 transitions. [2018-02-02 10:22:46,926 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-02 10:22:46,926 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 271 transitions. [2018-02-02 10:22:46,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-02-02 10:22:46,927 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:22:46,927 INFO L351 BasicCegarLoop]: trace histogram [3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:22:46,927 INFO L371 AbstractCegarLoop]: === Iteration 41 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 10:22:46,927 INFO L82 PathProgramCache]: Analyzing trace with hash -1965154507, now seen corresponding path program 1 times [2018-02-02 10:22:46,928 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:22:46,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:22:46,935 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:22:46,978 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 8 proven. 5 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-02-02 10:22:46,978 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:22:46,978 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-02-02 10:22:46,978 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:22:46,978 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-02 10:22:46,979 INFO L182 omatonBuilderFactory]: Interpolants [15446#true, 15447#false, 15448#(= alloc_17_~array.base |alloc_17_#in~array.base|), 15449#(= 1 (select |#valid| |alloc_17_#in~array.base|)), 15450#(= |#valid| |old(#valid)|), 15451#(= 1 (select |#valid| entry_point_~array~0.base)), 15452#(= 1 (select |#valid| |free_17_#in~array.base|)), 15453#(= 1 (select |#valid| free_17_~array.base))] [2018-02-02 10:22:46,979 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 8 proven. 5 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-02-02 10:22:46,979 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 10:22:46,979 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 10:22:46,979 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-02-02 10:22:46,979 INFO L87 Difference]: Start difference. First operand 229 states and 271 transitions. Second operand 8 states. [2018-02-02 10:22:47,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:22:47,122 INFO L93 Difference]: Finished difference Result 232 states and 270 transitions. [2018-02-02 10:22:47,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-02 10:22:47,123 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 68 [2018-02-02 10:22:47,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:22:47,124 INFO L225 Difference]: With dead ends: 232 [2018-02-02 10:22:47,124 INFO L226 Difference]: Without dead ends: 232 [2018-02-02 10:22:47,124 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2018-02-02 10:22:47,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2018-02-02 10:22:47,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 215. [2018-02-02 10:22:47,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2018-02-02 10:22:47,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 253 transitions. [2018-02-02 10:22:47,128 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 253 transitions. Word has length 68 [2018-02-02 10:22:47,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:22:47,128 INFO L432 AbstractCegarLoop]: Abstraction has 215 states and 253 transitions. [2018-02-02 10:22:47,128 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 10:22:47,128 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 253 transitions. [2018-02-02 10:22:47,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-02-02 10:22:47,129 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:22:47,129 INFO L351 BasicCegarLoop]: trace histogram [3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:22:47,129 INFO L371 AbstractCegarLoop]: === Iteration 42 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 10:22:47,129 INFO L82 PathProgramCache]: Analyzing trace with hash -1965154506, now seen corresponding path program 1 times [2018-02-02 10:22:47,130 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:22:47,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:22:47,137 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:22:47,215 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-02-02 10:22:47,215 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:22:47,215 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-02-02 10:22:47,215 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:22:47,215 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:22:47,216 INFO L182 omatonBuilderFactory]: Interpolants [15920#(or (<= 0 alloc_17_~j~0) (not (= |alloc_17_#in~array.offset| 0))), 15921#(not (= |alloc_17_#in~array.offset| 0)), 15911#true, 15912#false, 15913#(= 0 |ldv_malloc_#t~malloc2.offset|), 15914#(= 0 |ldv_malloc_#res.offset|), 15915#(= 0 |entry_point_#t~ret12.offset|), 15916#(= 0 entry_point_~array~0.offset), 15917#(or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset)), 15918#(or (not (= |alloc_17_#in~array.offset| 0)) (<= 0 alloc_17_~i~0)), 15919#(or (not (= |alloc_17_#in~array.offset| 0)) (<= 1 alloc_17_~i~0))] [2018-02-02 10:22:47,216 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-02-02 10:22:47,216 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-02 10:22:47,216 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-02 10:22:47,216 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-02-02 10:22:47,216 INFO L87 Difference]: Start difference. First operand 215 states and 253 transitions. Second operand 11 states. [2018-02-02 10:22:47,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:22:47,319 INFO L93 Difference]: Finished difference Result 223 states and 260 transitions. [2018-02-02 10:22:47,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-02 10:22:47,320 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 68 [2018-02-02 10:22:47,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:22:47,320 INFO L225 Difference]: With dead ends: 223 [2018-02-02 10:22:47,320 INFO L226 Difference]: Without dead ends: 217 [2018-02-02 10:22:47,320 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:22:47,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2018-02-02 10:22:47,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 217. [2018-02-02 10:22:47,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2018-02-02 10:22:47,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 253 transitions. [2018-02-02 10:22:47,322 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 253 transitions. Word has length 68 [2018-02-02 10:22:47,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:22:47,323 INFO L432 AbstractCegarLoop]: Abstraction has 217 states and 253 transitions. [2018-02-02 10:22:47,323 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-02 10:22:47,323 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 253 transitions. [2018-02-02 10:22:47,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-02-02 10:22:47,323 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:22:47,323 INFO L351 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:22:47,323 INFO L371 AbstractCegarLoop]: === Iteration 43 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 10:22:47,323 INFO L82 PathProgramCache]: Analyzing trace with hash 916929714, now seen corresponding path program 3 times [2018-02-02 10:22:47,324 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:22:47,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:22:47,328 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:22:47,456 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 2 proven. 20 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 10:22:47,456 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:22:47,456 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-02-02 10:22:47,456 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:22:47,457 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:22:47,457 INFO L182 omatonBuilderFactory]: Interpolants [16384#(and (<= (* 4 free_17_~len) (+ (* 4 free_17_~i~1) free_17_~array.offset 8)) (= free_17_~array.offset 0)), 16385#(and (<= (* 4 free_17_~len) (+ (* 4 free_17_~i~1) free_17_~array.offset 4)) (= free_17_~array.offset 0)), 16386#(<= free_17_~len (+ free_17_~i~1 1)), 16387#(<= free_17_~len free_17_~i~1), 16372#true, 16373#false, 16374#(= 0 |ldv_malloc_#t~malloc2.offset|), 16375#(= 0 |ldv_malloc_#res.offset|), 16376#(= 0 |entry_point_#t~ret12.offset|), 16377#(= 0 entry_point_~array~0.offset), 16378#(and (= 0 entry_point_~array~0.offset) (= entry_point_~i~2 0)), 16379#(and (= 0 entry_point_~array~0.offset) (<= entry_point_~i~2 1)), 16380#(and (<= entry_point_~i~2 2) (= 0 entry_point_~array~0.offset)), 16381#(and (= 0 entry_point_~array~0.offset) (<= entry_point_~len~0 2)), 16382#(and (= 0 |free_17_#in~array.offset|) (<= |free_17_#in~len| 2)), 16383#(and (<= free_17_~len 2) (= free_17_~array.offset 0))] [2018-02-02 10:22:47,457 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 2 proven. 20 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 10:22:47,457 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-02 10:22:47,457 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-02 10:22:47,457 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2018-02-02 10:22:47,458 INFO L87 Difference]: Start difference. First operand 217 states and 253 transitions. Second operand 16 states. [2018-02-02 10:22:47,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:22:47,568 INFO L93 Difference]: Finished difference Result 287 states and 329 transitions. [2018-02-02 10:22:47,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-02 10:22:47,569 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 67 [2018-02-02 10:22:47,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:22:47,569 INFO L225 Difference]: With dead ends: 287 [2018-02-02 10:22:47,569 INFO L226 Difference]: Without dead ends: 287 [2018-02-02 10:22:47,570 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=349, Unknown=0, NotChecked=0, Total=420 [2018-02-02 10:22:47,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2018-02-02 10:22:47,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 274. [2018-02-02 10:22:47,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 274 states. [2018-02-02 10:22:47,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 323 transitions. [2018-02-02 10:22:47,574 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 323 transitions. Word has length 67 [2018-02-02 10:22:47,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:22:47,574 INFO L432 AbstractCegarLoop]: Abstraction has 274 states and 323 transitions. [2018-02-02 10:22:47,574 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-02 10:22:47,574 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 323 transitions. [2018-02-02 10:22:47,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-02-02 10:22:47,575 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:22:47,575 INFO L351 BasicCegarLoop]: trace histogram [4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:22:47,575 INFO L371 AbstractCegarLoop]: === Iteration 44 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 10:22:47,575 INFO L82 PathProgramCache]: Analyzing trace with hash 1362872503, now seen corresponding path program 2 times [2018-02-02 10:22:47,576 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:22:47,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:22:47,588 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:22:47,936 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 5 proven. 12 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-02-02 10:22:47,936 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:22:47,936 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-02-02 10:22:47,936 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:22:47,936 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:22:47,937 INFO L182 omatonBuilderFactory]: Interpolants [16960#true, 16961#false, 16962#(and (= (select |#valid| |ldv_malloc_#t~malloc2.base|) 1) (= 0 |ldv_malloc_#t~malloc2.offset|)), 16963#(and (= 0 |ldv_malloc_#res.offset|) (= (select |#valid| |ldv_malloc_#res.base|) 1)), 16964#(and (= (select |#valid| |entry_point_#t~ret12.base|) 1) (= 0 |entry_point_#t~ret12.offset|)), 16965#(and (= 0 entry_point_~array~0.offset) (= (select |#valid| entry_point_~array~0.base) 1)), 16966#(and (= (select |#valid| |alloc_17_#in~array.base|) 1) (= 0 |alloc_17_#in~array.offset|)), 16967#(and (= (select |#valid| alloc_17_~array.base) 1) (= alloc_17_~i~0 0) (= alloc_17_~array.offset 0)), 16968#(= |#valid| |old(#valid)|), 16969#(= 0 (select |old(#valid)| |ldv_malloc_#t~malloc2.base|)), 16970#(= 0 (select |old(#valid)| |ldv_malloc_#res.base|)), 16971#(and (not (= alloc_17_~array.base |alloc_17_#t~ret4.base|)) (= alloc_17_~i~0 0) (= alloc_17_~array.offset 0)), 16972#(and (= alloc_17_~i~0 0) (= alloc_17_~array.offset 0) (not (= alloc_17_~array.base alloc_17_~p~0.base))), 16973#(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)))))), 16974#(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)))), 16975#(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)), 16976#(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))), 16977#(and (= 1 (select |#valid| alloc_17_~array.base)) (not (= alloc_17_~array.base |alloc_17_#t~mem7.base|))), 16978#(= 1 (select |#valid| alloc_17_~array.base))] [2018-02-02 10:22:47,937 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 5 proven. 12 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-02-02 10:22:47,937 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-02 10:22:47,937 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-02 10:22:47,937 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=299, Unknown=0, NotChecked=0, Total=342 [2018-02-02 10:22:47,937 INFO L87 Difference]: Start difference. First operand 274 states and 323 transitions. Second operand 19 states. [2018-02-02 10:22:48,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:22:48,310 INFO L93 Difference]: Finished difference Result 289 states and 337 transitions. [2018-02-02 10:22:48,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-02 10:22:48,310 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 67 [2018-02-02 10:22:48,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:22:48,311 INFO L225 Difference]: With dead ends: 289 [2018-02-02 10:22:48,311 INFO L226 Difference]: Without dead ends: 289 [2018-02-02 10:22:48,311 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=102, Invalid=654, Unknown=0, NotChecked=0, Total=756 [2018-02-02 10:22:48,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2018-02-02 10:22:48,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 276. [2018-02-02 10:22:48,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 276 states. [2018-02-02 10:22:48,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 325 transitions. [2018-02-02 10:22:48,316 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 325 transitions. Word has length 67 [2018-02-02 10:22:48,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:22:48,316 INFO L432 AbstractCegarLoop]: Abstraction has 276 states and 325 transitions. [2018-02-02 10:22:48,316 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-02 10:22:48,316 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 325 transitions. [2018-02-02 10:22:48,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-02-02 10:22:48,317 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:22:48,317 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:22:48,317 INFO L371 AbstractCegarLoop]: === Iteration 45 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 10:22:48,317 INFO L82 PathProgramCache]: Analyzing trace with hash 2118087437, now seen corresponding path program 1 times [2018-02-02 10:22:48,318 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:22:48,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:22:48,326 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:22:48,370 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-02-02 10:22:48,370 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:22:48,370 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-02-02 10:22:48,370 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:22:48,371 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:22:48,371 INFO L182 omatonBuilderFactory]: Interpolants [17562#true, 17563#false, 17564#(= alloc_17_~i~0 0), 17565#(<= alloc_17_~i~0 1), 17566#(<= alloc_17_~j~0 0), 17567#(<= (+ alloc_17_~j~0 1) 0)] [2018-02-02 10:22:48,371 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-02-02 10:22:48,371 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 10:22:48,371 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 10:22:48,371 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:22:48,371 INFO L87 Difference]: Start difference. First operand 276 states and 325 transitions. Second operand 6 states. [2018-02-02 10:22:48,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:22:48,412 INFO L93 Difference]: Finished difference Result 299 states and 347 transitions. [2018-02-02 10:22:48,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 10:22:48,413 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 68 [2018-02-02 10:22:48,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:22:48,414 INFO L225 Difference]: With dead ends: 299 [2018-02-02 10:22:48,414 INFO L226 Difference]: Without dead ends: 299 [2018-02-02 10:22:48,414 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2018-02-02 10:22:48,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2018-02-02 10:22:48,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 285. [2018-02-02 10:22:48,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 285 states. [2018-02-02 10:22:48,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 333 transitions. [2018-02-02 10:22:48,419 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 333 transitions. Word has length 68 [2018-02-02 10:22:48,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:22:48,419 INFO L432 AbstractCegarLoop]: Abstraction has 285 states and 333 transitions. [2018-02-02 10:22:48,419 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 10:22:48,419 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 333 transitions. [2018-02-02 10:22:48,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-02-02 10:22:48,420 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:22:48,420 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:22:48,420 INFO L371 AbstractCegarLoop]: === Iteration 46 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 10:22:48,421 INFO L82 PathProgramCache]: Analyzing trace with hash 701115179, now seen corresponding path program 2 times [2018-02-02 10:22:48,421 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:22:48,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:22:48,450 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:22:48,723 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 10:22:48,723 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:22:48,723 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-02-02 10:22:48,723 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:22:48,723 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:22:48,724 INFO L182 omatonBuilderFactory]: Interpolants [18158#true, 18159#false, 18160#(= 0 |ldv_malloc_#t~malloc2.offset|), 18161#(= 0 |ldv_malloc_#res.offset|), 18162#(= 0 |entry_point_#t~ret12.offset|), 18163#(= entry_point_~array~0.offset 0), 18164#(and (= entry_point_~array~0.offset 0) (= entry_point_~i~2 0)), 18165#(and (= entry_point_~array~0.offset 0) (<= 4 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset)) (<= entry_point_~i~2 1)), 18166#(and (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset))) (= entry_point_~array~0.offset 0) (<= 4 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset)) (<= entry_point_~i~2 1)), 18167#(and (= entry_point_~array~0.offset 0) (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ 4 entry_point_~array~0.offset)))), 18168#(= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|), 18169#(and (or (= |free_17_#in~array.offset| free_17_~array.offset) (= free_17_~array.offset 0)) (= free_17_~array.base |free_17_#in~array.base|) (or (not (= free_17_~array.offset 0)) (= free_17_~i~1 0))), 18170#(and (or (= |free_17_#in~array.offset| free_17_~array.offset) (= free_17_~array.offset 0)) (= free_17_~array.base |free_17_#in~array.base|) (<= 0 (+ (* 4 free_17_~i~1) free_17_~array.offset)) (or (not (= free_17_~array.offset 0)) (= free_17_~i~1 0))), 18171#(and (or (not (= free_17_~array.offset 0)) (<= free_17_~i~1 1)) (or (= |free_17_#in~array.offset| free_17_~array.offset) (= free_17_~array.offset 0)) (<= 4 (+ (* 4 free_17_~i~1) free_17_~array.offset)) (= free_17_~array.base |free_17_#in~array.base|)), 18172#(and (= 1 (select |#valid| |free_17_#in~array.base|)) (or (not (= |free_17_#in~array.offset| 0)) (= |free_17_#t~mem10.base| (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) (+ (- (+ (* 4 free_17_~i~1) (- 4))) (* 4 free_17_~i~1)))))), 18173#(or (not (= 0 (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) (+ (- (+ (* 4 free_17_~i~1) (- 4))) (* 4 free_17_~i~1))))) (= 1 (select |#valid| |free_17_#in~array.base|)) (not (= |free_17_#in~array.offset| 0))), 18174#(= 1 (select |#valid| entry_point_~array~0.base))] [2018-02-02 10:22:48,724 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 10:22:48,724 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-02 10:22:48,724 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-02 10:22:48,724 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2018-02-02 10:22:48,724 INFO L87 Difference]: Start difference. First operand 285 states and 333 transitions. Second operand 17 states. [2018-02-02 10:22:49,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:22:49,268 INFO L93 Difference]: Finished difference Result 329 states and 388 transitions. [2018-02-02 10:22:49,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-02 10:22:49,269 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 69 [2018-02-02 10:22:49,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:22:49,269 INFO L225 Difference]: With dead ends: 329 [2018-02-02 10:22:49,269 INFO L226 Difference]: Without dead ends: 329 [2018-02-02 10:22:49,270 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 237 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=135, Invalid=987, Unknown=0, NotChecked=0, Total=1122 [2018-02-02 10:22:49,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2018-02-02 10:22:49,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 292. [2018-02-02 10:22:49,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 292 states. [2018-02-02 10:22:49,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 341 transitions. [2018-02-02 10:22:49,273 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 341 transitions. Word has length 69 [2018-02-02 10:22:49,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:22:49,273 INFO L432 AbstractCegarLoop]: Abstraction has 292 states and 341 transitions. [2018-02-02 10:22:49,273 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-02 10:22:49,273 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 341 transitions. [2018-02-02 10:22:49,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-02-02 10:22:49,273 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:22:49,274 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:22:49,274 INFO L371 AbstractCegarLoop]: === Iteration 47 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 10:22:49,274 INFO L82 PathProgramCache]: Analyzing trace with hash 881428740, now seen corresponding path program 3 times [2018-02-02 10:22:49,275 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:22:49,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:22:49,287 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:22:49,717 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 4 proven. 17 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-02-02 10:22:49,718 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:22:49,718 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-02-02 10:22:49,718 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:22:49,718 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-02-02 10:22:49,718 INFO L182 omatonBuilderFactory]: Interpolants [18848#(= 0 |free_17_#t~mem10.offset|), 18831#true, 18832#false, 18833#(= 0 |ldv_malloc_#t~malloc2.offset|), 18834#(= 0 |ldv_malloc_#res.offset|), 18835#(= 0 |entry_point_#t~ret12.offset|), 18836#(= 0 entry_point_~array~0.offset), 18837#(and (or (= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) 0) (and (= alloc_17_~i~0 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset))) (or (not (= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) 0)) (= alloc_17_~array.base |alloc_17_#in~array.base|))), 18838#(and (or (and (= 0 |alloc_17_#t~ret4.offset|) (= alloc_17_~array.base |alloc_17_#in~array.base|)) (not (= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) 0))) (or (= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) 0) (and (= alloc_17_~i~0 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset)))), 18839#(and (or (not (= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) 0)) (and (= 0 alloc_17_~p~0.offset) (= alloc_17_~array.base |alloc_17_#in~array.base|))) (or (= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) 0) (and (= alloc_17_~i~0 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset)))), 18840#(and (or (and (= 0 (select (select |#memory_$Pointer$.offset| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~i~0)))) (= alloc_17_~array.base |alloc_17_#in~array.base|)) (not (= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) 0))) (or (= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) 0) (and (= alloc_17_~i~0 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset)))), 18841#(or (and (= 0 (select (select |#memory_$Pointer$.offset| 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|)) (and (= |alloc_17_#in~array.offset| alloc_17_~array.offset) (not (= alloc_17_~array.offset 0)))), 18842#(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))), 18843#(or (and (= 0 (select (store (select |#memory_$Pointer$.offset| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~i~0)) alloc_17_~p~0.offset) 0)) (= alloc_17_~array.base |alloc_17_#in~array.base|)) (and (= |alloc_17_#in~array.offset| alloc_17_~array.offset) (not (= alloc_17_~array.offset 0)))), 18844#(or (= 0 (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) 0)) (not (= |alloc_17_#in~array.offset| 0))), 18845#(and (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) 0)) (= 0 entry_point_~array~0.offset)), 18846#(and (= 0 |free_17_#in~array.offset|) (= 0 (select (select |#memory_$Pointer$.offset| |free_17_#in~array.base|) 0))), 18847#(or (= 0 (select (select |#memory_$Pointer$.offset| free_17_~array.base) (+ (* 4 free_17_~i~1) free_17_~array.offset))) (and (<= (+ (* 4 free_17_~i~1) free_17_~array.offset) 0) (not (= 0 (+ (* 4 free_17_~i~1) free_17_~array.offset)))))] [2018-02-02 10:22:49,718 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 4 proven. 17 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-02-02 10:22:49,718 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-02 10:22:49,718 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-02 10:22:49,718 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2018-02-02 10:22:49,718 INFO L87 Difference]: Start difference. First operand 292 states and 341 transitions. Second operand 18 states. [2018-02-02 10:22:50,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:22:50,057 INFO L93 Difference]: Finished difference Result 447 states and 524 transitions. [2018-02-02 10:22:50,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-02-02 10:22:50,057 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 72 [2018-02-02 10:22:50,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:22:50,058 INFO L225 Difference]: With dead ends: 447 [2018-02-02 10:22:50,058 INFO L226 Difference]: Without dead ends: 447 [2018-02-02 10:22:50,059 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=78, Invalid=522, Unknown=0, NotChecked=0, Total=600 [2018-02-02 10:22:50,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states. [2018-02-02 10:22:50,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 422. [2018-02-02 10:22:50,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 422 states. [2018-02-02 10:22:50,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 508 transitions. [2018-02-02 10:22:50,063 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 508 transitions. Word has length 72 [2018-02-02 10:22:50,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:22:50,063 INFO L432 AbstractCegarLoop]: Abstraction has 422 states and 508 transitions. [2018-02-02 10:22:50,063 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-02 10:22:50,063 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 508 transitions. [2018-02-02 10:22:50,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-02-02 10:22:50,064 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:22:50,064 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:22:50,064 INFO L371 AbstractCegarLoop]: === Iteration 48 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 10:22:50,064 INFO L82 PathProgramCache]: Analyzing trace with hash 881428741, now seen corresponding path program 2 times [2018-02-02 10:22:50,065 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:22:50,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:22:50,073 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:22:50,661 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 7 proven. 21 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-02-02 10:22:50,662 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:22:50,662 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-02-02 10:22:50,662 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:22:50,662 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-02-02 10:22:50,663 INFO L182 omatonBuilderFactory]: Interpolants [19744#(and (= alloc_17_~i~0 0) (or (and (= 1 (select |#valid| alloc_17_~p~0.base)) (= 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))), 19745#(and (or (and (= 1 (select |#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|)) (not (= alloc_17_~array.offset 0))) (= alloc_17_~i~0 0) (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset))), 19746#(and (or (and (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)))) (not (= alloc_17_~array.offset 0))) (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset))), 19747#(= |#valid| |old(#valid)|), 19748#(and (= 1 (select |#valid| |ldv_malloc_#t~malloc2.base|)) (= |#valid| (store |old(#valid)| |ldv_malloc_#t~malloc2.base| (select |#valid| |ldv_malloc_#t~malloc2.base|)))), 19749#(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|))))), 19750#(and (or (and (= 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))) (= 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))), 19751#(or (not (= |alloc_17_#in~array.offset| 0)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) 0)))), 19752#(and (= 0 entry_point_~array~0.offset) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0)))), 19753#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) 0))) (= 0 |free_17_#in~array.offset|)), 19754#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (* 4 free_17_~i~1) free_17_~array.offset)))) (= free_17_~i~1 0) (= free_17_~array.offset 0)), 19755#(= 1 (select |#valid| |free_17_#t~mem10.base|)), 19733#true, 19734#false, 19735#(= 0 |ldv_malloc_#t~malloc2.offset|), 19736#(= 0 |ldv_malloc_#res.offset|), 19737#(= 0 |entry_point_#t~ret12.offset|), 19738#(= 0 entry_point_~array~0.offset), 19739#(and (= alloc_17_~i~0 0) (or (not (= 0 (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset))) (= alloc_17_~array.base |alloc_17_#in~array.base|)) (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset))), 19740#(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))), 19741#(or (<= (+ |ldv_malloc_#in~size| 1) 0) (= 1 (select |#valid| |ldv_malloc_#t~malloc2.base|)) (<= 4294967296 |ldv_malloc_#in~size|)), 19742#(or (<= (+ |ldv_malloc_#in~size| 1) 0) (= 1 (select |#valid| |ldv_malloc_#res.base|)) (<= 4294967296 |ldv_malloc_#in~size|)), 19743#(and (= alloc_17_~i~0 0) (or (and (= 1 (select |#valid| |alloc_17_#t~ret4.base|)) (= 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)))] [2018-02-02 10:22:50,663 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 7 proven. 21 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-02-02 10:22:50,663 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-02 10:22:50,663 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-02 10:22:50,663 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=452, Unknown=0, NotChecked=0, Total=506 [2018-02-02 10:22:50,664 INFO L87 Difference]: Start difference. First operand 422 states and 508 transitions. Second operand 23 states. [2018-02-02 10:22:51,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:22:51,463 INFO L93 Difference]: Finished difference Result 435 states and 516 transitions. [2018-02-02 10:22:51,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-02 10:22:51,464 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 72 [2018-02-02 10:22:51,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:22:51,465 INFO L225 Difference]: With dead ends: 435 [2018-02-02 10:22:51,465 INFO L226 Difference]: Without dead ends: 435 [2018-02-02 10:22:51,465 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 199 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=143, Invalid=1189, Unknown=0, NotChecked=0, Total=1332 [2018-02-02 10:22:51,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2018-02-02 10:22:51,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 422. [2018-02-02 10:22:51,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 422 states. [2018-02-02 10:22:51,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 506 transitions. [2018-02-02 10:22:51,469 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 506 transitions. Word has length 72 [2018-02-02 10:22:51,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:22:51,469 INFO L432 AbstractCegarLoop]: Abstraction has 422 states and 506 transitions. [2018-02-02 10:22:51,469 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-02 10:22:51,469 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 506 transitions. [2018-02-02 10:22:51,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-02-02 10:22:51,469 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:22:51,469 INFO L351 BasicCegarLoop]: trace histogram [4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:22:51,469 INFO L371 AbstractCegarLoop]: === Iteration 49 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 10:22:51,469 INFO L82 PathProgramCache]: Analyzing trace with hash -1957426551, now seen corresponding path program 4 times [2018-02-02 10:22:51,470 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:22:51,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:22:51,476 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:22:51,811 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 10:22:51,812 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:22:51,812 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-02-02 10:22:51,812 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:22:51,812 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:22:51,812 INFO L182 omatonBuilderFactory]: Interpolants [20641#true, 20642#false, 20643#(= 0 |ldv_malloc_#t~malloc2.offset|), 20644#(= 0 |ldv_malloc_#res.offset|), 20645#(= 0 |entry_point_#t~ret12.offset|), 20646#(= entry_point_~array~0.offset 0), 20647#(and (= entry_point_~array~0.offset 0) (= entry_point_~i~2 0)), 20648#(and (= entry_point_~array~0.offset 0) (<= 4 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset)) (<= entry_point_~i~2 1)), 20649#(and (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset))) (= entry_point_~array~0.offset 0) (<= 4 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset)) (<= entry_point_~i~2 1)), 20650#(and (= entry_point_~array~0.offset 0) (or (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~2)) 0) (+ entry_point_~array~0.offset 4))) (<= entry_point_~i~2 1))), 20651#(and (or (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset 4))) (<= entry_point_~i~2 2)) (= entry_point_~array~0.offset 0)), 20652#(and (or (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset 4))) (<= entry_point_~len~0 2)) (= entry_point_~array~0.offset 0)), 20653#(= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|), 20654#(and (= 0 |free_17_#in~array.offset|) (or (= 0 (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) 4)) (<= |free_17_#in~len| 2))), 20655#(and (or (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) 4)) (<= free_17_~len 2)) (= free_17_~i~1 0) (= free_17_~array.offset 0)), 20656#(and (or (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (* 4 free_17_~i~1) free_17_~array.offset))) (<= (* 4 free_17_~len) (+ (* 4 free_17_~i~1) free_17_~array.offset 4))) (= free_17_~array.offset 0)), 20657#(and (or (<= free_17_~len (+ free_17_~i~1 1)) (= 0 |free_17_#t~mem10.base|)) (= 1 (select |#valid| free_17_~array.base))), 20658#(or (= 1 (select |#valid| free_17_~array.base)) (<= free_17_~len (+ free_17_~i~1 1))), 20659#(or (= 1 (select |#valid| free_17_~array.base)) (<= free_17_~len free_17_~i~1)), 20660#(= 1 (select |#valid| free_17_~array.base))] [2018-02-02 10:22:51,812 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 10:22:51,813 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-02 10:22:51,813 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-02 10:22:51,813 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=322, Unknown=0, NotChecked=0, Total=380 [2018-02-02 10:22:51,813 INFO L87 Difference]: Start difference. First operand 422 states and 506 transitions. Second operand 20 states. [2018-02-02 10:22:52,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:22:52,347 INFO L93 Difference]: Finished difference Result 433 states and 514 transitions. [2018-02-02 10:22:52,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-02 10:22:52,348 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 71 [2018-02-02 10:22:52,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:22:52,349 INFO L225 Difference]: With dead ends: 433 [2018-02-02 10:22:52,349 INFO L226 Difference]: Without dead ends: 433 [2018-02-02 10:22:52,349 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 7 SyntacticMatches, 3 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 341 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=188, Invalid=1218, Unknown=0, NotChecked=0, Total=1406 [2018-02-02 10:22:52,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433 states. [2018-02-02 10:22:52,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433 to 423. [2018-02-02 10:22:52,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 423 states. [2018-02-02 10:22:52,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 507 transitions. [2018-02-02 10:22:52,353 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 507 transitions. Word has length 71 [2018-02-02 10:22:52,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:22:52,353 INFO L432 AbstractCegarLoop]: Abstraction has 423 states and 507 transitions. [2018-02-02 10:22:52,353 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-02 10:22:52,354 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 507 transitions. [2018-02-02 10:22:52,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-02-02 10:22:52,354 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:22:52,354 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:22:52,354 INFO L371 AbstractCegarLoop]: === Iteration 50 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 10:22:52,355 INFO L82 PathProgramCache]: Analyzing trace with hash 496408573, now seen corresponding path program 3 times [2018-02-02 10:22:52,355 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:22:52,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:22:52,365 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:22:52,967 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 10:22:52,967 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:22:52,967 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-02-02 10:22:52,967 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:22:52,967 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:22:52,967 INFO L182 omatonBuilderFactory]: Interpolants [21568#(and (or (= |free_17_#in~array.offset| free_17_~array.offset) (= free_17_~array.offset 0)) (or (not (= free_17_~array.offset 0)) (and (= |free_17_#t~mem10.base| (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (* 4 free_17_~i~1) free_17_~array.offset))) (= |#valid| |old(#valid)|) (= free_17_~array.base |free_17_#in~array.base|) (= free_17_~i~1 0)))), 21569#(and (or (= |free_17_#in~array.offset| free_17_~array.offset) (= free_17_~array.offset 0)) (or (not (= free_17_~array.offset 0)) (and (or (and (= free_17_~array.base |free_17_#in~array.base|) (not (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (* 4 free_17_~i~1) free_17_~array.offset))))) (and (= |#valid| |old(#valid)|) (= free_17_~array.base |free_17_#in~array.base|))) (= free_17_~i~1 0)))), 21570#(and (or (= |free_17_#in~array.offset| free_17_~array.offset) (= free_17_~array.offset 0)) (or (not (= free_17_~array.offset 0)) (and (<= 1 free_17_~i~1) (or (and (= |#valid| |old(#valid)|) (= free_17_~array.base |free_17_#in~array.base|)) (and (not (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) 0))) (= free_17_~array.base |free_17_#in~array.base|))) (<= free_17_~i~1 1)))), 21571#(or (not (= 0 (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) 0))) (not (= |free_17_#in~array.offset| 0)) (and (= |#valid| |old(#valid)|) (= |free_17_#t~mem10.base| (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) (+ (- (+ (* 4 free_17_~i~1) (- 4))) (* 4 free_17_~i~1)))))), 21572#(or (= |#valid| |old(#valid)|) (not (= 0 (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) (+ (- (+ (* 4 free_17_~i~1) (- 4))) (* 4 free_17_~i~1))))) (not (= 0 (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) 0))) (not (= |free_17_#in~array.offset| 0))), 21573#(and (= |old(#valid)| (store |#valid| entry_point_~array~0.base (select |old(#valid)| entry_point_~array~0.base))) (not (= entry_point_~array~0.base 0)) (= (select (store |#valid| entry_point_~array~0.base 0) entry_point_~array~0.base) (select |old(#valid)| entry_point_~array~0.base))), 21554#true, 21555#false, 21556#(= |#valid| |old(#valid)|), 21557#(and (not (= |ldv_malloc_#t~malloc2.base| 0)) (= (store |#valid| |ldv_malloc_#t~malloc2.base| (select |old(#valid)| |ldv_malloc_#t~malloc2.base|)) |old(#valid)|) (= 0 |ldv_malloc_#t~malloc2.offset|) (= 0 (select |old(#valid)| |ldv_malloc_#t~malloc2.base|))), 21558#(and (= (store |#valid| |ldv_malloc_#res.base| (select |old(#valid)| |ldv_malloc_#res.base|)) |old(#valid)|) (= 0 |ldv_malloc_#res.offset|) (= 0 (select |old(#valid)| |ldv_malloc_#res.base|)) (not (= |ldv_malloc_#res.base| 0))), 21559#(and (= |old(#valid)| (store |#valid| |entry_point_#t~ret12.base| (select |old(#valid)| |entry_point_#t~ret12.base|))) (= 0 (select |old(#valid)| |entry_point_#t~ret12.base|)) (= 0 |entry_point_#t~ret12.offset|) (not (= |entry_point_#t~ret12.base| 0))), 21560#(and (= |old(#valid)| (store |#valid| entry_point_~array~0.base (select |old(#valid)| entry_point_~array~0.base))) (not (= entry_point_~array~0.base 0)) (= entry_point_~array~0.offset 0) (= 0 (select |old(#valid)| entry_point_~array~0.base))), 21561#(and (= 0 entry_point_~array~0.offset) (= |old(#valid)| (store |#valid| entry_point_~array~0.base (select |old(#valid)| entry_point_~array~0.base))) (not (= entry_point_~array~0.base 0)) (= 0 (select |old(#valid)| entry_point_~array~0.base)) (= entry_point_~i~2 0)), 21562#(and (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset))) (= 0 entry_point_~array~0.offset) (= |old(#valid)| (store |#valid| entry_point_~array~0.base (select |old(#valid)| entry_point_~array~0.base))) (not (= entry_point_~array~0.base 0)) (= 0 (select |old(#valid)| entry_point_~array~0.base)) (= entry_point_~i~2 0)), 21563#(and (<= (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 4) (= 0 entry_point_~array~0.offset) (= |old(#valid)| (store |#valid| entry_point_~array~0.base (select |old(#valid)| entry_point_~array~0.base))) (not (= entry_point_~array~0.base 0)) (<= 4 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset)) (= 0 (select |old(#valid)| entry_point_~array~0.base)) (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) 0))), 21564#(and (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset))) (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0)) (<= (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 4) (= 0 entry_point_~array~0.offset) (= |old(#valid)| (store |#valid| entry_point_~array~0.base (select |old(#valid)| entry_point_~array~0.base))) (not (= entry_point_~array~0.base 0)) (<= 4 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset)) (= 0 (select |old(#valid)| entry_point_~array~0.base))), 21565#(and (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0)) (= 0 entry_point_~array~0.offset) (= |old(#valid)| (store |#valid| entry_point_~array~0.base (select |old(#valid)| entry_point_~array~0.base))) (not (= entry_point_~array~0.base 0)) (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (+ (- entry_point_~array~0.offset) 4)))) (= 0 (select |old(#valid)| entry_point_~array~0.base))), 21566#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)), 21567#(and (or (= |free_17_#in~array.offset| free_17_~array.offset) (= free_17_~array.offset 0)) (or (not (= free_17_~array.offset 0)) (and (= |#valid| |old(#valid)|) (= free_17_~array.base |free_17_#in~array.base|) (= free_17_~i~1 0))))] [2018-02-02 10:22:52,967 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 10:22:52,967 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-02 10:22:52,968 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-02 10:22:52,968 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=318, Unknown=0, NotChecked=0, Total=380 [2018-02-02 10:22:52,968 INFO L87 Difference]: Start difference. First operand 423 states and 507 transitions. Second operand 20 states. [2018-02-02 10:22:53,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:22:53,507 INFO L93 Difference]: Finished difference Result 478 states and 588 transitions. [2018-02-02 10:22:53,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-02 10:22:53,507 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 72 [2018-02-02 10:22:53,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:22:53,508 INFO L225 Difference]: With dead ends: 478 [2018-02-02 10:22:53,508 INFO L226 Difference]: Without dead ends: 445 [2018-02-02 10:22:53,509 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=105, Invalid=545, Unknown=0, NotChecked=0, Total=650 [2018-02-02 10:22:53,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 445 states. [2018-02-02 10:22:53,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 445 to 393. [2018-02-02 10:22:53,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2018-02-02 10:22:53,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 475 transitions. [2018-02-02 10:22:53,512 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 475 transitions. Word has length 72 [2018-02-02 10:22:53,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:22:53,513 INFO L432 AbstractCegarLoop]: Abstraction has 393 states and 475 transitions. [2018-02-02 10:22:53,513 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-02 10:22:53,513 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 475 transitions. [2018-02-02 10:22:53,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-02-02 10:22:53,514 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:22:53,514 INFO L351 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:22:53,514 INFO L371 AbstractCegarLoop]: === Iteration 51 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 10:22:53,514 INFO L82 PathProgramCache]: Analyzing trace with hash -550680879, now seen corresponding path program 2 times [2018-02-02 10:22:53,515 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:22:53,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:22:53,525 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:22:54,118 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 4 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:22:54,119 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:22:54,119 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-02-02 10:22:54,119 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:22:54,119 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:22:54,119 INFO L182 omatonBuilderFactory]: Interpolants [22464#(or (<= (+ (select |#length| entry_point_~array~0.base) 1) 0) (and (or (<= (+ entry_point_~len~0 1) 0) (<= (select |#length| entry_point_~array~0.base) (* 4 entry_point_~len~0))) (= entry_point_~array~0.offset 0) (= entry_point_~i~2 0))), 22465#(or (<= (+ (select |#length| entry_point_~array~0.base) 1) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset)) (and (or (<= (+ (* 4 entry_point_~len~0) 1) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset)) (<= (select |#length| entry_point_~array~0.base) (* 4 entry_point_~len~0))) (= entry_point_~array~0.offset 0) (= entry_point_~i~2 0))), 22466#(or (<= (+ (select |#length| entry_point_~array~0.base) 5) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset)) (and (= entry_point_~array~0.offset 0) (<= entry_point_~i~2 1) (or (<= (+ (* 4 entry_point_~len~0) 5) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset)) (<= (select |#length| entry_point_~array~0.base) (* 4 entry_point_~len~0))))), 22467#(or (<= (+ (select |#length| entry_point_~array~0.base) 9) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset)) (and (<= entry_point_~i~2 2) (or (<= (select |#length| entry_point_~array~0.base) (* 4 entry_point_~len~0)) (<= (+ (* 4 entry_point_~len~0) 9) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset))) (= entry_point_~array~0.offset 0))), 22468#(or (and (<= entry_point_~i~2 2) (= entry_point_~array~0.offset 0) (<= (select |#length| entry_point_~array~0.base) (* 4 entry_point_~len~0))) (<= (+ (select |#length| entry_point_~array~0.base) 9) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset))), 22469#(and (<= entry_point_~i~2 2) (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~2)))) (= entry_point_~array~0.offset 0) (<= (select |#length| entry_point_~array~0.base) (* 4 entry_point_~len~0))), 22470#(and (or (<= (+ (select |#length| entry_point_~array~0.base) (* 4 entry_point_~i~2)) (+ (* 4 entry_point_~len~0) 11)) (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ entry_point_~array~0.offset (+ (* (- 4) entry_point_~len~0) (+ (select |#length| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) (- 4)))))))) (<= (+ (select |#length| entry_point_~array~0.base) (* 4 entry_point_~i~2)) (+ (* 4 entry_point_~len~0) 12)) (= entry_point_~array~0.offset 0)), 22471#(and (or (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ entry_point_~array~0.offset (+ (select |#length| entry_point_~array~0.base) (- 4))))) (<= (select |#length| entry_point_~array~0.base) 11)) (<= (select |#length| entry_point_~array~0.base) 12) (= entry_point_~array~0.offset 0)), 22472#(and (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 22473#(= |old(#length)| |#length|), 22474#(and (<= (select |#length| |free_17_#in~array.base|) 12) (or (<= (select |#length| |free_17_#in~array.base|) 11) (= 0 (select (select |#memory_$Pointer$.offset| |free_17_#in~array.base|) (+ (select |#length| |free_17_#in~array.base|) (- 4)))))), 22475#(and (<= (select |#length| free_17_~array.base) 12) (or (= 0 (select (select |#memory_$Pointer$.offset| free_17_~array.base) (+ (select |#length| free_17_~array.base) (- 4)))) (<= (select |#length| free_17_~array.base) 11))), 22476#(and (or (<= (select |#length| free_17_~array.base) (+ (* 4 free_17_~i~1) free_17_~array.offset 11)) (= 0 (select (select |#memory_$Pointer$.offset| free_17_~array.base) (+ (select |#length| free_17_~array.base) (- 4))))) (<= (select |#length| free_17_~array.base) (+ (* 4 free_17_~i~1) free_17_~array.offset 12))), 22477#(and (<= (select |#length| free_17_~array.base) (+ (* 4 free_17_~i~1) free_17_~array.offset 8)) (or (= 0 (select (select |#memory_$Pointer$.offset| free_17_~array.base) (+ (select |#length| free_17_~array.base) (- 4)))) (<= (select |#length| free_17_~array.base) (+ (* 4 free_17_~i~1) free_17_~array.offset 7)))), 22478#(or (= 0 (select (select |#memory_$Pointer$.offset| free_17_~array.base) (+ (* 4 free_17_~i~1) free_17_~array.offset))) (<= (select |#length| free_17_~array.base) (+ (* 4 free_17_~i~1) free_17_~array.offset 3))), 22479#(= 0 |free_17_#t~mem10.offset|), 22457#true, 22458#false, 22459#(and (or (< 0 (+ (div ldv_malloc_~size 4294967296) 1)) (<= |ldv_malloc_#in~size| ldv_malloc_~size)) (or (<= ldv_malloc_~size |ldv_malloc_#in~size|) (<= (+ (div ldv_malloc_~size 4294967296) 1) 0))), 22460#(or (<= (+ (select |#length| |ldv_malloc_#t~malloc2.base|) 1) 0) (and (= 0 |ldv_malloc_#t~malloc2.offset|) (or (<= (select |#length| |ldv_malloc_#t~malloc2.base|) |ldv_malloc_#in~size|) (<= (+ |ldv_malloc_#in~size| 1) 0)))), 22461#(or (<= (+ (select |#length| |ldv_malloc_#res.base|) 1) 0) (and (= 0 |ldv_malloc_#res.offset|) (or (<= (+ |ldv_malloc_#in~size| 1) 0) (<= (select |#length| |ldv_malloc_#res.base|) |ldv_malloc_#in~size|)))), 22462#(or (and (or (<= (+ entry_point_~len~0 1) 0) (<= (select |#length| |entry_point_#t~ret12.base|) (* 4 entry_point_~len~0))) (= 0 |entry_point_#t~ret12.offset|)) (<= (+ (select |#length| |entry_point_#t~ret12.base|) 1) 0)), 22463#(or (<= (+ (select |#length| entry_point_~array~0.base) 1) 0) (and (or (<= (+ entry_point_~len~0 1) 0) (<= (select |#length| entry_point_~array~0.base) (* 4 entry_point_~len~0))) (= entry_point_~array~0.offset 0)))] [2018-02-02 10:22:54,120 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 4 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:22:54,120 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-02 10:22:54,120 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-02 10:22:54,120 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=455, Unknown=0, NotChecked=0, Total=506 [2018-02-02 10:22:54,120 INFO L87 Difference]: Start difference. First operand 393 states and 475 transitions. Second operand 23 states. [2018-02-02 10:22:55,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:22:55,162 INFO L93 Difference]: Finished difference Result 436 states and 525 transitions. [2018-02-02 10:22:55,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-02 10:22:55,162 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 72 [2018-02-02 10:22:55,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:22:55,164 INFO L225 Difference]: With dead ends: 436 [2018-02-02 10:22:55,164 INFO L226 Difference]: Without dead ends: 436 [2018-02-02 10:22:55,164 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 237 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=193, Invalid=1447, Unknown=0, NotChecked=0, Total=1640 [2018-02-02 10:22:55,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2018-02-02 10:22:55,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 424. [2018-02-02 10:22:55,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 424 states. [2018-02-02 10:22:55,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 424 states and 515 transitions. [2018-02-02 10:22:55,168 INFO L78 Accepts]: Start accepts. Automaton has 424 states and 515 transitions. Word has length 72 [2018-02-02 10:22:55,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:22:55,169 INFO L432 AbstractCegarLoop]: Abstraction has 424 states and 515 transitions. [2018-02-02 10:22:55,169 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-02 10:22:55,169 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 515 transitions. [2018-02-02 10:22:55,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-02-02 10:22:55,170 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:22:55,170 INFO L351 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:22:55,170 INFO L371 AbstractCegarLoop]: === Iteration 52 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 10:22:55,170 INFO L82 PathProgramCache]: Analyzing trace with hash -550680878, now seen corresponding path program 2 times [2018-02-02 10:22:55,171 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:22:55,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:22:55,177 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:22:55,707 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 4 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:22:55,707 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:22:55,707 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-02-02 10:22:55,707 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:22:55,708 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:22:55,708 INFO L182 omatonBuilderFactory]: Interpolants [23392#(= |old(#length)| |#length|), 23393#(and (<= (select |#length| |free_17_#in~array.base|) 12) (or (<= (select |#length| |free_17_#in~array.base|) 11) (= 0 (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) (+ (select |#length| |free_17_#in~array.base|) (- 4)))))), 23394#(and (or (<= (select |#length| free_17_~array.base) 11) (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (select |#length| free_17_~array.base) (- 4))))) (<= (select |#length| free_17_~array.base) 12)), 23395#(and (or (<= (select |#length| free_17_~array.base) (+ (* 4 free_17_~i~1) free_17_~array.offset 11)) (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (select |#length| free_17_~array.base) (- 4))))) (<= (select |#length| free_17_~array.base) (+ (* 4 free_17_~i~1) free_17_~array.offset 12))), 23396#(and (or (<= (select |#length| free_17_~array.base) (+ (* 4 free_17_~i~1) free_17_~array.offset 7)) (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (select |#length| free_17_~array.base) (- 4))))) (<= (select |#length| free_17_~array.base) (+ (* 4 free_17_~i~1) free_17_~array.offset 8))), 23397#(or (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (* 4 free_17_~i~1) free_17_~array.offset))) (<= (select |#length| free_17_~array.base) (+ (* 4 free_17_~i~1) free_17_~array.offset 3))), 23398#(= 0 |free_17_#t~mem10.base|), 23376#true, 23377#false, 23378#(and (or (< 0 (+ (div ldv_malloc_~size 4294967296) 1)) (<= |ldv_malloc_#in~size| ldv_malloc_~size)) (or (<= ldv_malloc_~size |ldv_malloc_#in~size|) (<= (+ (div ldv_malloc_~size 4294967296) 1) 0))), 23379#(or (<= (+ (select |#length| |ldv_malloc_#t~malloc2.base|) 1) 0) (and (= 0 |ldv_malloc_#t~malloc2.offset|) (or (<= (select |#length| |ldv_malloc_#t~malloc2.base|) |ldv_malloc_#in~size|) (<= (+ |ldv_malloc_#in~size| 1) 0)))), 23380#(or (<= (+ (select |#length| |ldv_malloc_#res.base|) 1) 0) (and (= 0 |ldv_malloc_#res.offset|) (or (<= (+ |ldv_malloc_#in~size| 1) 0) (<= (select |#length| |ldv_malloc_#res.base|) |ldv_malloc_#in~size|)))), 23381#(or (and (or (<= (+ entry_point_~len~0 1) 0) (<= (select |#length| |entry_point_#t~ret12.base|) (* 4 entry_point_~len~0))) (= 0 |entry_point_#t~ret12.offset|)) (<= (+ (select |#length| |entry_point_#t~ret12.base|) 1) 0)), 23382#(or (<= (+ (select |#length| entry_point_~array~0.base) 1) 0) (and (or (<= (+ entry_point_~len~0 1) 0) (<= (select |#length| entry_point_~array~0.base) (* 4 entry_point_~len~0))) (= entry_point_~array~0.offset 0))), 23383#(or (<= (+ (select |#length| entry_point_~array~0.base) 1) 0) (and (or (<= (+ entry_point_~len~0 1) 0) (<= (select |#length| entry_point_~array~0.base) (* 4 entry_point_~len~0))) (= entry_point_~array~0.offset 0) (= entry_point_~i~2 0))), 23384#(or (<= (+ (select |#length| entry_point_~array~0.base) 1) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset)) (and (or (<= (+ (* 4 entry_point_~len~0) 1) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset)) (<= (select |#length| entry_point_~array~0.base) (* 4 entry_point_~len~0))) (= entry_point_~array~0.offset 0) (= entry_point_~i~2 0))), 23385#(or (<= (+ (select |#length| entry_point_~array~0.base) 5) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset)) (and (= entry_point_~array~0.offset 0) (<= entry_point_~i~2 1) (or (<= (+ (* 4 entry_point_~len~0) 5) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset)) (<= (select |#length| entry_point_~array~0.base) (* 4 entry_point_~len~0))))), 23386#(or (<= (+ (select |#length| entry_point_~array~0.base) 9) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset)) (and (<= entry_point_~i~2 2) (or (<= (select |#length| entry_point_~array~0.base) (* 4 entry_point_~len~0)) (<= (+ (* 4 entry_point_~len~0) 9) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset))) (= entry_point_~array~0.offset 0))), 23387#(or (and (<= entry_point_~i~2 2) (= entry_point_~array~0.offset 0) (<= (select |#length| entry_point_~array~0.base) (* 4 entry_point_~len~0))) (<= (+ (select |#length| entry_point_~array~0.base) 9) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset))), 23388#(and (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~2)))) (<= entry_point_~i~2 2) (= entry_point_~array~0.offset 0) (<= (select |#length| entry_point_~array~0.base) (* 4 entry_point_~len~0))), 23389#(and (or (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (+ (* (- 4) entry_point_~len~0) (+ (select |#length| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) (- 4))))))) (<= (+ (select |#length| entry_point_~array~0.base) (* 4 entry_point_~i~2)) (+ (* 4 entry_point_~len~0) 11))) (= entry_point_~array~0.offset 0) (<= (+ (select |#length| entry_point_~array~0.base) (* 4 entry_point_~i~2)) (+ (* 4 entry_point_~len~0) 12))), 23390#(and (<= (select |#length| entry_point_~array~0.base) 12) (= entry_point_~array~0.offset 0) (or (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (+ (select |#length| entry_point_~array~0.base) (- 4))))) (<= (select |#length| entry_point_~array~0.base) 11))), 23391#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|))] [2018-02-02 10:22:55,708 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 4 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:22:55,708 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-02 10:22:55,708 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-02 10:22:55,708 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=455, Unknown=0, NotChecked=0, Total=506 [2018-02-02 10:22:55,708 INFO L87 Difference]: Start difference. First operand 424 states and 515 transitions. Second operand 23 states. [2018-02-02 10:22:56,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:22:56,665 INFO L93 Difference]: Finished difference Result 435 states and 524 transitions. [2018-02-02 10:22:56,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-02 10:22:56,666 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 72 [2018-02-02 10:22:56,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:22:56,667 INFO L225 Difference]: With dead ends: 435 [2018-02-02 10:22:56,667 INFO L226 Difference]: Without dead ends: 435 [2018-02-02 10:22:56,667 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=158, Invalid=1248, Unknown=0, NotChecked=0, Total=1406 [2018-02-02 10:22:56,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2018-02-02 10:22:56,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 424. [2018-02-02 10:22:56,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 424 states. [2018-02-02 10:22:56,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 424 states and 514 transitions. [2018-02-02 10:22:56,670 INFO L78 Accepts]: Start accepts. Automaton has 424 states and 514 transitions. Word has length 72 [2018-02-02 10:22:56,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:22:56,670 INFO L432 AbstractCegarLoop]: Abstraction has 424 states and 514 transitions. [2018-02-02 10:22:56,670 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-02 10:22:56,670 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 514 transitions. [2018-02-02 10:22:56,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-02-02 10:22:56,671 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:22:56,671 INFO L351 BasicCegarLoop]: trace histogram [5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:22:56,671 INFO L371 AbstractCegarLoop]: === Iteration 53 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 10:22:56,671 INFO L82 PathProgramCache]: Analyzing trace with hash -698710182, now seen corresponding path program 3 times [2018-02-02 10:22:56,672 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:22:56,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:22:56,680 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:22:56,935 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 2 proven. 46 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 10:22:56,935 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:22:56,935 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-02-02 10:22:56,935 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:22:56,935 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:22:56,935 INFO L182 omatonBuilderFactory]: Interpolants [24288#true, 24289#false, 24290#(= 0 |ldv_malloc_#t~malloc2.offset|), 24291#(= 0 |ldv_malloc_#res.offset|), 24292#(= 0 |entry_point_#t~ret12.offset|), 24293#(= entry_point_~array~0.offset 0), 24294#(and (= entry_point_~array~0.offset 0) (= entry_point_~i~2 0)), 24295#(and (= entry_point_~array~0.offset 0) (<= 4 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset)) (<= entry_point_~i~2 1)), 24296#(and (<= entry_point_~i~2 2) (= entry_point_~array~0.offset 0) (<= 8 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset))), 24297#(and (<= entry_point_~i~2 2) (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~2)))) (= entry_point_~array~0.offset 0) (<= 8 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset))), 24298#(and (= entry_point_~array~0.offset 0) (= 0 (select (store (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ (+ (- entry_point_~array~0.offset) 8) entry_point_~array~0.offset)))), 24299#(and (= entry_point_~array~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ (+ (- entry_point_~array~0.offset) 8) entry_point_~array~0.offset)))), 24300#(= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|), 24301#(and (= 0 |free_17_#in~array.offset|) (= 0 (select (select |#memory_$Pointer$.offset| |free_17_#in~array.base|) 8))), 24302#(and (= free_17_~i~1 0) (= 0 (select (select |#memory_$Pointer$.offset| free_17_~array.base) 8)) (= free_17_~array.offset 0)), 24303#(and (= free_17_~array.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| free_17_~array.base) (+ (* 4 free_17_~i~1) 4)))), 24304#(and (= 0 (select (select |#memory_$Pointer$.offset| free_17_~array.base) (+ free_17_~array.offset (* 4 free_17_~i~1)))) (= free_17_~array.offset 0)), 24305#(= 0 |free_17_#t~mem10.offset|)] [2018-02-02 10:22:56,936 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 2 proven. 46 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 10:22:56,936 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-02 10:22:56,936 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-02 10:22:56,936 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=262, Unknown=0, NotChecked=0, Total=306 [2018-02-02 10:22:56,936 INFO L87 Difference]: Start difference. First operand 424 states and 514 transitions. Second operand 18 states. [2018-02-02 10:22:57,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:22:57,367 INFO L93 Difference]: Finished difference Result 442 states and 529 transitions. [2018-02-02 10:22:57,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-02-02 10:22:57,368 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 76 [2018-02-02 10:22:57,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:22:57,369 INFO L225 Difference]: With dead ends: 442 [2018-02-02 10:22:57,370 INFO L226 Difference]: Without dead ends: 442 [2018-02-02 10:22:57,370 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 234 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=136, Invalid=920, Unknown=0, NotChecked=0, Total=1056 [2018-02-02 10:22:57,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442 states. [2018-02-02 10:22:57,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 425. [2018-02-02 10:22:57,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 425 states. [2018-02-02 10:22:57,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 516 transitions. [2018-02-02 10:22:57,376 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 516 transitions. Word has length 76 [2018-02-02 10:22:57,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:22:57,377 INFO L432 AbstractCegarLoop]: Abstraction has 425 states and 516 transitions. [2018-02-02 10:22:57,377 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-02 10:22:57,377 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 516 transitions. [2018-02-02 10:22:57,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-02-02 10:22:57,378 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:22:57,378 INFO L351 BasicCegarLoop]: trace histogram [5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:22:57,378 INFO L371 AbstractCegarLoop]: === Iteration 54 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 10:22:57,378 INFO L82 PathProgramCache]: Analyzing trace with hash -698710181, now seen corresponding path program 3 times [2018-02-02 10:22:57,379 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:22:57,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:22:57,390 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:22:57,770 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 2 proven. 46 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 10:22:57,771 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:22:57,771 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-02-02 10:22:57,771 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:22:57,771 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:22:57,771 INFO L182 omatonBuilderFactory]: Interpolants [25216#(and (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset 8))) (= entry_point_~array~0.offset 0) (<= (+ entry_point_~i~2 1) entry_point_~len~0)), 25217#(and (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset 8))) (= entry_point_~array~0.offset 0) (<= entry_point_~i~2 entry_point_~len~0)), 25218#(and (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset 8))) (= entry_point_~array~0.offset 0)), 25219#(= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|), 25220#(and (= 0 |free_17_#in~array.offset|) (= 0 (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) 8))), 25221#(and (= free_17_~i~1 0) (= free_17_~array.offset 0) (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) 8))), 25222#(and (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (* 4 free_17_~i~1) (+ free_17_~array.offset 4)))) (= free_17_~array.offset 0)), 25223#(and (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ free_17_~array.offset (* 4 free_17_~i~1)))) (= free_17_~array.offset 0)), 25224#(= 0 |free_17_#t~mem10.base|), 25204#true, 25205#false, 25206#(= 0 |ldv_malloc_#t~malloc2.offset|), 25207#(= 0 |ldv_malloc_#res.offset|), 25208#(= 0 |entry_point_#t~ret12.offset|), 25209#(= 0 entry_point_~array~0.offset), 25210#(and (= entry_point_~array~0.offset 0) (= entry_point_~i~2 0)), 25211#(and (<= 1 entry_point_~i~2) (= entry_point_~array~0.offset 0) (<= entry_point_~i~2 1)), 25212#(and (<= entry_point_~i~2 2) (<= 2 entry_point_~i~2) (= entry_point_~array~0.offset 0)), 25213#(and (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~2)))) (<= entry_point_~i~2 2) (<= 2 entry_point_~i~2) (= entry_point_~array~0.offset 0)), 25214#(and (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ entry_point_~array~0.offset 8))) (= entry_point_~array~0.offset 0)), 25215#(and (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ entry_point_~array~0.offset 8))) (= entry_point_~array~0.offset 0) (<= (+ entry_point_~i~2 1) entry_point_~len~0))] [2018-02-02 10:22:57,771 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 2 proven. 46 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 10:22:57,772 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-02 10:22:57,772 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-02 10:22:57,772 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=360, Unknown=0, NotChecked=0, Total=420 [2018-02-02 10:22:57,772 INFO L87 Difference]: Start difference. First operand 425 states and 516 transitions. Second operand 21 states. [2018-02-02 10:22:58,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:22:58,294 INFO L93 Difference]: Finished difference Result 441 states and 528 transitions. [2018-02-02 10:22:58,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-02 10:22:58,294 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 76 [2018-02-02 10:22:58,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:22:58,295 INFO L225 Difference]: With dead ends: 441 [2018-02-02 10:22:58,295 INFO L226 Difference]: Without dead ends: 441 [2018-02-02 10:22:58,295 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 256 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=136, Invalid=986, Unknown=0, NotChecked=0, Total=1122 [2018-02-02 10:22:58,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 441 states. [2018-02-02 10:22:58,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 441 to 425. [2018-02-02 10:22:58,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 425 states. [2018-02-02 10:22:58,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 515 transitions. [2018-02-02 10:22:58,299 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 515 transitions. Word has length 76 [2018-02-02 10:22:58,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:22:58,299 INFO L432 AbstractCegarLoop]: Abstraction has 425 states and 515 transitions. [2018-02-02 10:22:58,300 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-02 10:22:58,300 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 515 transitions. [2018-02-02 10:22:58,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-02-02 10:22:58,300 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:22:58,300 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:22:58,300 INFO L371 AbstractCegarLoop]: === Iteration 55 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 10:22:58,301 INFO L82 PathProgramCache]: Analyzing trace with hash 2142667465, now seen corresponding path program 1 times [2018-02-02 10:22:58,301 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:22:58,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:22:58,310 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:22:58,468 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-02-02 10:22:58,468 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:22:58,468 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-02 10:22:58,468 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:22:58,469 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:22:58,469 INFO L182 omatonBuilderFactory]: Interpolants [26118#true, 26119#false, 26120#(= 0 |ldv_malloc_#t~malloc2.offset|), 26121#(= 0 |ldv_malloc_#res.offset|), 26122#(= 0 |entry_point_#t~ret12.offset|), 26123#(= 0 entry_point_~array~0.offset), 26124#(and (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset)) (= alloc_17_~array.base |alloc_17_#in~array.base|)), 26125#(and (or (<= 0 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)) (= alloc_17_~array.base |alloc_17_#in~array.base|)), 26126#(and (or (not (= alloc_17_~array.offset 0)) (<= (+ alloc_17_~array.offset 4) (select |#length| alloc_17_~array.base))) (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset)) (= alloc_17_~array.base |alloc_17_#in~array.base|)), 26127#(or (<= 4 (select |#length| |alloc_17_#in~array.base|)) (not (= |alloc_17_#in~array.offset| 0))), 26128#(and (= 0 entry_point_~array~0.offset) (<= 4 (select |#length| entry_point_~array~0.base))), 26129#(and (= 0 |free_17_#in~array.offset|) (<= 4 (select |#length| |free_17_#in~array.base|))), 26130#(and (<= 4 (select |#length| free_17_~array.base)) (= free_17_~i~1 0) (= free_17_~array.offset 0))] [2018-02-02 10:22:58,469 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-02-02 10:22:58,469 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-02 10:22:58,469 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-02 10:22:58,470 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2018-02-02 10:22:58,470 INFO L87 Difference]: Start difference. First operand 425 states and 515 transitions. Second operand 13 states. [2018-02-02 10:22:58,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:22:58,578 INFO L93 Difference]: Finished difference Result 436 states and 517 transitions. [2018-02-02 10:22:58,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-02 10:22:58,578 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 75 [2018-02-02 10:22:58,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:22:58,579 INFO L225 Difference]: With dead ends: 436 [2018-02-02 10:22:58,579 INFO L226 Difference]: Without dead ends: 436 [2018-02-02 10:22:58,579 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2018-02-02 10:22:58,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2018-02-02 10:22:58,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 383. [2018-02-02 10:22:58,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2018-02-02 10:22:58,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 455 transitions. [2018-02-02 10:22:58,586 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 455 transitions. Word has length 75 [2018-02-02 10:22:58,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:22:58,586 INFO L432 AbstractCegarLoop]: Abstraction has 383 states and 455 transitions. [2018-02-02 10:22:58,586 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-02 10:22:58,586 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 455 transitions. [2018-02-02 10:22:58,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-02-02 10:22:58,587 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:22:58,587 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:22:58,587 INFO L371 AbstractCegarLoop]: === Iteration 56 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 10:22:58,588 INFO L82 PathProgramCache]: Analyzing trace with hash 1998182003, now seen corresponding path program 1 times [2018-02-02 10:22:58,588 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:22:58,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:22:58,599 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:22:58,820 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-02-02 10:22:58,820 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:22:58,820 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-02-02 10:22:58,820 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:22:58,820 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:22:58,820 INFO L182 omatonBuilderFactory]: Interpolants [26956#true, 26957#false, 26958#(= 0 |ldv_malloc_#t~malloc2.offset|), 26959#(= 0 |ldv_malloc_#res.offset|), 26960#(= 0 |entry_point_#t~ret12.offset|), 26961#(= 0 entry_point_~array~0.offset), 26962#(and (or (not (= alloc_17_~array.offset 0)) (= alloc_17_~array.base |alloc_17_#in~array.base|)) (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset))), 26963#(and (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset)) (or (not (= 0 (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset))) (not (= alloc_17_~array.offset 0)) (= alloc_17_~array.base |alloc_17_#in~array.base|))), 26964#(and (or (and (or (= 0 (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset)) (< 0 (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset))) (or (not (= 0 (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset))) (= 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))), 26965#(or (<= 1 alloc_17_~j~0) (not (= |alloc_17_#in~array.offset| 0)) (= 0 (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) 0))), 26966#(or (<= 0 alloc_17_~j~0) (not (= |alloc_17_#in~array.offset| 0)) (= 0 (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) 0))), 26967#(or (not (= |alloc_17_#in~array.offset| 0)) (= 0 (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) 0))), 26968#(and (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0)) (= 0 entry_point_~array~0.offset)), 26969#(and (= 0 (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) 0)) (= 0 |free_17_#in~array.offset|)), 26970#(and (or (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (* 4 free_17_~i~1) free_17_~array.offset))) (not (= 0 (+ (* 4 free_17_~i~1) free_17_~array.offset)))) (<= (+ (* 4 free_17_~i~1) free_17_~array.offset) 0)), 26971#(= 0 |free_17_#t~mem10.base|)] [2018-02-02 10:22:58,820 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-02-02 10:22:58,821 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-02 10:22:58,821 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-02 10:22:58,821 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2018-02-02 10:22:58,821 INFO L87 Difference]: Start difference. First operand 383 states and 455 transitions. Second operand 16 states. [2018-02-02 10:22:59,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:22:59,030 INFO L93 Difference]: Finished difference Result 434 states and 511 transitions. [2018-02-02 10:22:59,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-02 10:22:59,030 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 76 [2018-02-02 10:22:59,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:22:59,031 INFO L225 Difference]: With dead ends: 434 [2018-02-02 10:22:59,031 INFO L226 Difference]: Without dead ends: 434 [2018-02-02 10:22:59,031 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=427, Unknown=0, NotChecked=0, Total=506 [2018-02-02 10:22:59,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2018-02-02 10:22:59,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 383. [2018-02-02 10:22:59,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2018-02-02 10:22:59,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 455 transitions. [2018-02-02 10:22:59,035 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 455 transitions. Word has length 76 [2018-02-02 10:22:59,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:22:59,035 INFO L432 AbstractCegarLoop]: Abstraction has 383 states and 455 transitions. [2018-02-02 10:22:59,035 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-02 10:22:59,035 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 455 transitions. [2018-02-02 10:22:59,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-02-02 10:22:59,035 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:22:59,035 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:22:59,035 INFO L371 AbstractCegarLoop]: === Iteration 57 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 10:22:59,036 INFO L82 PathProgramCache]: Analyzing trace with hash 189822284, now seen corresponding path program 1 times [2018-02-02 10:22:59,036 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:22:59,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:22:59,048 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:22:59,870 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 3 proven. 34 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 10:22:59,870 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:22:59,871 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-02-02 10:22:59,871 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:22:59,871 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 10:22:59,871 INFO L182 omatonBuilderFactory]: Interpolants [27803#true, 27804#false, 27805#(and (= (select |#valid| |ldv_malloc_#t~malloc2.base|) 1) (= 0 |ldv_malloc_#t~malloc2.offset|)), 27806#(and (= 0 |ldv_malloc_#res.offset|) (= (select |#valid| |ldv_malloc_#res.base|) 1)), 27807#(and (= (select |#valid| |entry_point_#t~ret12.base|) 1) (= 0 |entry_point_#t~ret12.offset|)), 27808#(and (= 0 entry_point_~array~0.offset) (= (select |#valid| entry_point_~array~0.base) 1)), 27809#(and (= 0 entry_point_~array~0.offset) (= (select |#valid| entry_point_~array~0.base) 1) (= entry_point_~i~2 0)), 27810#(and (= 0 entry_point_~array~0.offset) (<= entry_point_~i~2 1) (= (select |#valid| entry_point_~array~0.base) 1)), 27811#(and (<= entry_point_~i~2 2) (= 0 entry_point_~array~0.offset) (= (select |#valid| entry_point_~array~0.base) 1)), 27812#(and (= 0 entry_point_~array~0.offset) (<= entry_point_~len~0 2) (= (select |#valid| entry_point_~array~0.base) 1)), 27813#(= |#valid| |old(#valid)|), 27814#(and (or (and (= alloc_17_~len |alloc_17_#in~len|) (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset))) (= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) 0)) (or (and (= |#valid| |old(#valid)|) (= alloc_17_~array.base |alloc_17_#in~array.base|)) (not (= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) 0)))), 27815#(and (or (<= ldv_malloc_~size |ldv_malloc_#in~size|) (<= (div ldv_malloc_~size 4294967296) 0)) (or (< 0 (div ldv_malloc_~size 4294967296)) (and (or (<= ldv_malloc_~size |ldv_malloc_#in~size|) (<= (+ (div ldv_malloc_~size 4294967296) 1) 0)) (= |#valid| |old(#valid)|) (<= |ldv_malloc_#in~size| ldv_malloc_~size)))), 27816#(or (<= (+ |ldv_malloc_#in~size| 1) 0) (<= 4294967296 |ldv_malloc_#in~size|) (= 0 (select |old(#valid)| |ldv_malloc_#t~malloc2.base|))), 27817#(or (<= (+ |ldv_malloc_#in~size| 1) 0) (= 0 (select |old(#valid)| |ldv_malloc_#res.base|)) (<= 4294967296 |ldv_malloc_#in~size|)), 27818#(and (or (not (= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) 0)) (and (= 0 (select |old(#valid)| |alloc_17_#t~ret4.base|)) (= alloc_17_~array.base |alloc_17_#in~array.base|))) (or (and (= alloc_17_~len |alloc_17_#in~len|) (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset))) (= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) 0))), 27819#(and (or (and (= alloc_17_~len |alloc_17_#in~len|) (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset))) (= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) 0)) (or (not (= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) 0)) (and (= 0 (select |old(#valid)| alloc_17_~p~0.base)) (= alloc_17_~array.base |alloc_17_#in~array.base|)))), 27820#(and (or (and (= 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|)) (not (= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) 0))) (or (= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) 0) (and (= alloc_17_~len |alloc_17_#in~len|) (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset)) (or (< 0 (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset)) (not (= alloc_17_~array.offset 0)))))), 27821#(or (and (not (= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) 0)) (= alloc_17_~array.base |alloc_17_#in~array.base|) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 0)))) (and (= alloc_17_~len |alloc_17_#in~len|) (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset)) (or (<= 5 (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset)) (not (= alloc_17_~array.offset 0))))), 27822#(or (and (= alloc_17_~len |alloc_17_#in~len|) (or (<= 9 (+ (* 4 alloc_17_~len) 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))) (and (not (= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) 0)) (= alloc_17_~array.base |alloc_17_#in~array.base|) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 0))))), 27823#(or (and (= 0 (select |old(#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))) (= alloc_17_~array.base |alloc_17_#in~array.base|)) (and (= alloc_17_~len |alloc_17_#in~len|) (or (<= 9 (+ (* 4 alloc_17_~len) 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)))), 27824#(or (and (= 1 (select |#valid| |alloc_17_#in~array.base|)) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) 0)))) (and (= alloc_17_~len |alloc_17_#in~len|) (or (not (= |alloc_17_#in~array.offset| 0)) (<= 3 alloc_17_~len)))), 27825#(or (<= 3 |alloc_17_#in~len|) (not (= |alloc_17_#in~array.offset| 0)) (and (= 1 (select |#valid| |alloc_17_#in~array.base|)) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) 0))))), 27826#(and (= 1 (select |#valid| entry_point_~array~0.base)) (= 0 entry_point_~array~0.offset) (not (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0)))), 27827#(and (not (= |free_17_#in~array.base| (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) 0))) (= 0 |free_17_#in~array.offset|) (= 1 (select |#valid| |free_17_#in~array.base|))), 27828#(and (not (= free_17_~array.base (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (* 4 free_17_~i~1) free_17_~array.offset)))) (= 0 (+ (* 4 free_17_~i~1) free_17_~array.offset)) (= 1 (select |#valid| free_17_~array.base))), 27829#(and (not (= free_17_~array.base |free_17_#t~mem10.base|)) (= 1 (select |#valid| free_17_~array.base))), 27830#(= 1 (select |#valid| free_17_~array.base))] [2018-02-02 10:22:59,872 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 3 proven. 34 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 10:22:59,872 INFO L409 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-02-02 10:22:59,872 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-02-02 10:22:59,872 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=691, Unknown=0, NotChecked=0, Total=756 [2018-02-02 10:22:59,872 INFO L87 Difference]: Start difference. First operand 383 states and 455 transitions. Second operand 28 states. [2018-02-02 10:23:00,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:23:00,907 INFO L93 Difference]: Finished difference Result 406 states and 478 transitions. [2018-02-02 10:23:00,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-02-02 10:23:00,907 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 77 [2018-02-02 10:23:00,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:23:00,908 INFO L225 Difference]: With dead ends: 406 [2018-02-02 10:23:00,908 INFO L226 Difference]: Without dead ends: 406 [2018-02-02 10:23:00,909 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 283 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=152, Invalid=1654, Unknown=0, NotChecked=0, Total=1806 [2018-02-02 10:23:00,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2018-02-02 10:23:00,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 397. [2018-02-02 10:23:00,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2018-02-02 10:23:00,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 471 transitions. [2018-02-02 10:23:00,912 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 471 transitions. Word has length 77 [2018-02-02 10:23:00,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:23:00,912 INFO L432 AbstractCegarLoop]: Abstraction has 397 states and 471 transitions. [2018-02-02 10:23:00,912 INFO L433 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-02-02 10:23:00,912 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 471 transitions. [2018-02-02 10:23:00,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-02-02 10:23:00,912 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:23:00,912 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:23:00,913 INFO L371 AbstractCegarLoop]: === Iteration 58 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 10:23:00,913 INFO L82 PathProgramCache]: Analyzing trace with hash 189822285, now seen corresponding path program 1 times [2018-02-02 10:23:00,913 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:23:00,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:23:00,919 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:23:01,114 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-02-02 10:23:01,114 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:23:01,115 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-02-02 10:23:01,115 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:23:01,115 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-02-02 10:23:01,115 INFO L182 omatonBuilderFactory]: Interpolants [28672#(and (or (<= (+ (* 4 alloc_17_~i~0) 4) (select |#length| |alloc_17_#in~array.base|)) (not (= |alloc_17_#in~array.offset| 0))) (= alloc_17_~len |alloc_17_#in~len|)), 28673#(and (= alloc_17_~len |alloc_17_#in~len|) (or (not (= |alloc_17_#in~array.offset| 0)) (<= (* 4 alloc_17_~i~0) (select |#length| |alloc_17_#in~array.base|)))), 28674#(or (<= (* 4 |alloc_17_#in~len|) (select |#length| |alloc_17_#in~array.base|)) (not (= |alloc_17_#in~array.offset| 0))), 28675#(and (= 0 entry_point_~array~0.offset) (<= (* 4 entry_point_~len~0) (select |#length| entry_point_~array~0.base))), 28676#(and (<= (* 4 |free_17_#in~len|) (select |#length| |free_17_#in~array.base|)) (= 0 |free_17_#in~array.offset|)), 28677#(and (<= (* 4 free_17_~len) (select |#length| free_17_~array.base)) (= free_17_~array.offset 0)), 28678#(and (<= (* 4 free_17_~len) (select |#length| free_17_~array.base)) (<= 0 (+ (* 4 free_17_~i~1) free_17_~array.offset)) (= free_17_~array.offset 0)), 28679#(and (<= 4 (+ (* 4 free_17_~i~1) free_17_~array.offset)) (<= (* 4 free_17_~len) (select |#length| free_17_~array.base)) (= free_17_~array.offset 0)), 28680#(and (<= 4 (+ (* 4 free_17_~i~1) free_17_~array.offset)) (<= (+ (* 4 free_17_~i~1) 4) (select |#length| free_17_~array.base)) (= free_17_~array.offset 0)), 28665#true, 28666#false, 28667#(= 0 |ldv_malloc_#t~malloc2.offset|), 28668#(= 0 |ldv_malloc_#res.offset|), 28669#(= 0 |entry_point_#t~ret12.offset|), 28670#(= 0 entry_point_~array~0.offset), 28671#(and (= alloc_17_~len |alloc_17_#in~len|) (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset)) (= alloc_17_~array.base |alloc_17_#in~array.base|))] [2018-02-02 10:23:01,115 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-02-02 10:23:01,115 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-02 10:23:01,115 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-02 10:23:01,116 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2018-02-02 10:23:01,116 INFO L87 Difference]: Start difference. First operand 397 states and 471 transitions. Second operand 16 states. [2018-02-02 10:23:01,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:23:01,440 INFO L93 Difference]: Finished difference Result 434 states and 506 transitions. [2018-02-02 10:23:01,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-02 10:23:01,440 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 77 [2018-02-02 10:23:01,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:23:01,441 INFO L225 Difference]: With dead ends: 434 [2018-02-02 10:23:01,441 INFO L226 Difference]: Without dead ends: 434 [2018-02-02 10:23:01,441 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=431, Unknown=0, NotChecked=0, Total=506 [2018-02-02 10:23:01,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2018-02-02 10:23:01,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 425. [2018-02-02 10:23:01,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 425 states. [2018-02-02 10:23:01,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 502 transitions. [2018-02-02 10:23:01,446 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 502 transitions. Word has length 77 [2018-02-02 10:23:01,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:23:01,446 INFO L432 AbstractCegarLoop]: Abstraction has 425 states and 502 transitions. [2018-02-02 10:23:01,446 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-02 10:23:01,446 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 502 transitions. [2018-02-02 10:23:01,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-02-02 10:23:01,447 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:23:01,447 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:23:01,447 INFO L371 AbstractCegarLoop]: === Iteration 59 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 10:23:01,447 INFO L82 PathProgramCache]: Analyzing trace with hash 1589523566, now seen corresponding path program 1 times [2018-02-02 10:23:01,448 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:23:01,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:23:01,455 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:23:01,996 WARN L146 SmtUtils]: Spent 246ms on a formula simplification. DAG size of input: 15 DAG size of output 14 [2018-02-02 10:23:02,170 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 3 proven. 26 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-02-02 10:23:02,170 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:23:02,171 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-02-02 10:23:02,171 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:23:02,171 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-02-02 10:23:02,171 INFO L182 omatonBuilderFactory]: Interpolants [29568#(and (= 0 (select (select |#memory_$Pointer$.offset| |free_17_#in~array.base|) 4)) (= 0 |free_17_#in~array.offset|)), 29569#(and (= free_17_~i~1 0) (= free_17_~array.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| free_17_~array.base) 4))), 29570#(= 0 (select (select |#memory_$Pointer$.offset| free_17_~array.base) (+ free_17_~array.offset (* 4 free_17_~i~1)))), 29571#(= 0 |free_17_#t~mem10.offset|), 29554#true, 29555#false, 29556#(= 0 |ldv_malloc_#t~malloc2.offset|), 29557#(= 0 |ldv_malloc_#res.offset|), 29558#(= 0 |entry_point_#t~ret12.offset|), 29559#(= entry_point_~array~0.offset 0), 29560#(and (= entry_point_~array~0.offset 0) (= entry_point_~i~2 0)), 29561#(and (<= (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 4) (= 0 entry_point_~array~0.offset) (<= 4 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset))), 29562#(and (= alloc_17_~i~0 0) (or (not (= alloc_17_~array.offset 0)) (= alloc_17_~array.base |alloc_17_#in~array.base|)) (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset))), 29563#(and (or (not (= alloc_17_~array.offset 0)) (and (<= 4 (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset)) (<= alloc_17_~i~0 1) (= alloc_17_~array.base |alloc_17_#in~array.base|))) (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset))), 29564#(and (or (and (<= 4 (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset)) (<= alloc_17_~i~0 1) (= 0 |alloc_17_#t~ret4.offset|) (= 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))), 29565#(and (or (and (<= 4 (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset)) (<= alloc_17_~i~0 1) (= 0 alloc_17_~p~0.offset) (= 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))), 29566#(or (not (= |alloc_17_#in~array.offset| 0)) (= 0 (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (+ (* 4 alloc_17_~i~0) (- (+ (* 4 alloc_17_~i~0) (- 4))))))), 29567#(and (= 0 entry_point_~array~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ entry_point_~array~0.offset (+ (- entry_point_~array~0.offset) 4)))))] [2018-02-02 10:23:02,171 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 3 proven. 26 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-02-02 10:23:02,172 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-02 10:23:02,172 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-02 10:23:02,172 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=268, Unknown=0, NotChecked=0, Total=306 [2018-02-02 10:23:02,172 INFO L87 Difference]: Start difference. First operand 425 states and 502 transitions. Second operand 18 states. [2018-02-02 10:23:02,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:23:02,517 INFO L93 Difference]: Finished difference Result 459 states and 530 transitions. [2018-02-02 10:23:02,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-02 10:23:02,518 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 78 [2018-02-02 10:23:02,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:23:02,519 INFO L225 Difference]: With dead ends: 459 [2018-02-02 10:23:02,519 INFO L226 Difference]: Without dead ends: 459 [2018-02-02 10:23:02,519 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 3 SyntacticMatches, 5 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=93, Invalid=719, Unknown=0, NotChecked=0, Total=812 [2018-02-02 10:23:02,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2018-02-02 10:23:02,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 429. [2018-02-02 10:23:02,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 429 states. [2018-02-02 10:23:02,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 509 transitions. [2018-02-02 10:23:02,524 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 509 transitions. Word has length 78 [2018-02-02 10:23:02,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:23:02,525 INFO L432 AbstractCegarLoop]: Abstraction has 429 states and 509 transitions. [2018-02-02 10:23:02,525 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-02 10:23:02,525 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 509 transitions. [2018-02-02 10:23:02,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-02-02 10:23:02,526 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:23:02,526 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:23:02,526 INFO L371 AbstractCegarLoop]: === Iteration 60 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 10:23:02,526 INFO L82 PathProgramCache]: Analyzing trace with hash 1589523567, now seen corresponding path program 1 times [2018-02-02 10:23:02,527 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:23:02,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:23:02,539 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:23:03,252 WARN L491 AbstractCegarLoop]: Verification canceled [2018-02-02 10:23:03,257 WARN L185 ceAbstractionStarter]: Timeout [2018-02-02 10:23:03,257 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.02 10:23:03 BoogieIcfgContainer [2018-02-02 10:23:03,257 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-02 10:23:03,258 INFO L168 Benchmark]: Toolchain (without parser) took 37083.89 ms. Allocated memory was 394.3 MB in the beginning and 1.2 GB in the end (delta: 760.7 MB). Free memory was 350.9 MB in the beginning and 840.4 MB in the end (delta: -489.5 MB). Peak memory consumption was 271.3 MB. Max. memory is 5.3 GB. [2018-02-02 10:23:03,259 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 394.3 MB. Free memory is still 357.6 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-02 10:23:03,259 INFO L168 Benchmark]: CACSL2BoogieTranslator took 170.26 ms. Allocated memory is still 394.3 MB. Free memory was 350.9 MB in the beginning and 337.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:23:03,260 INFO L168 Benchmark]: Boogie Preprocessor took 29.70 ms. Allocated memory is still 394.3 MB. Free memory was 337.6 MB in the beginning and 336.3 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 5.3 GB. [2018-02-02 10:23:03,260 INFO L168 Benchmark]: RCFGBuilder took 244.59 ms. Allocated memory is still 394.3 MB. Free memory was 335.0 MB in the beginning and 309.6 MB in the end (delta: 25.3 MB). Peak memory consumption was 25.3 MB. Max. memory is 5.3 GB. [2018-02-02 10:23:03,260 INFO L168 Benchmark]: TraceAbstraction took 36636.56 ms. Allocated memory was 394.3 MB in the beginning and 1.2 GB in the end (delta: 760.7 MB). Free memory was 309.6 MB in the beginning and 840.4 MB in the end (delta: -530.7 MB). Peak memory consumption was 230.0 MB. Max. memory is 5.3 GB. [2018-02-02 10:23:03,262 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13 ms. Allocated memory is still 394.3 MB. Free memory is still 357.6 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 170.26 ms. Allocated memory is still 394.3 MB. Free memory was 350.9 MB in the beginning and 337.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 29.70 ms. Allocated memory is still 394.3 MB. Free memory was 337.6 MB in the beginning and 336.3 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 5.3 GB. * RCFGBuilder took 244.59 ms. Allocated memory is still 394.3 MB. Free memory was 335.0 MB in the beginning and 309.6 MB in the end (delta: 25.3 MB). Peak memory consumption was 25.3 MB. Max. memory is 5.3 GB. * TraceAbstraction took 36636.56 ms. Allocated memory was 394.3 MB in the beginning and 1.2 GB in the end (delta: 760.7 MB). Free memory was 309.6 MB in the beginning and 840.4 MB in the end (delta: -530.7 MB). Peak memory consumption was 230.0 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1452). Cancelled while BasicCegarLoop was analyzing trace of length 79 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 23 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1453). Cancelled while BasicCegarLoop was analyzing trace of length 79 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 23 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1452). Cancelled while BasicCegarLoop was analyzing trace of length 79 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 23 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1447). Cancelled while BasicCegarLoop was analyzing trace of length 79 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 23 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1447). Cancelled while BasicCegarLoop was analyzing trace of length 79 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 23 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1453). Cancelled while BasicCegarLoop was analyzing trace of length 79 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 23 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1452). Cancelled while BasicCegarLoop was analyzing trace of length 79 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 23 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1452). Cancelled while BasicCegarLoop was analyzing trace of length 79 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 23 known predicates. - TimeoutResultAtElement [Line: 1480]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 1480). Cancelled while BasicCegarLoop was analyzing trace of length 79 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 23 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1461). Cancelled while BasicCegarLoop was analyzing trace of length 79 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 23 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1461). Cancelled while BasicCegarLoop was analyzing trace of length 79 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 23 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1461). Cancelled while BasicCegarLoop was analyzing trace of length 79 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 23 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1461). Cancelled while BasicCegarLoop was analyzing trace of length 79 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 23 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1472). Cancelled while BasicCegarLoop was analyzing trace of length 79 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 23 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1472). Cancelled while BasicCegarLoop was analyzing trace of length 79 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 23 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1476). Cancelled while BasicCegarLoop was analyzing trace of length 79 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 23 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1476). Cancelled while BasicCegarLoop was analyzing trace of length 79 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 23 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 8 procedures, 82 locations, 17 error locations. TIMEOUT Result, 36.5s OverallTime, 60 OverallIterations, 5 TraceHistogramMax, 19.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 4381 SDtfs, 5274 SDslu, 29739 SDs, 0 SdLazy, 25670 SolverSat, 1428 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 10.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1462 GetRequests, 228 SyntacticMatches, 38 SemanticMatches, 1196 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5508 ImplicationChecksByTransitivity, 18.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=429occurred in iteration=59, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 507/1137 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 59 MinimizatonAttempts, 1206 StatesRemovedByMinimization, 55 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 14.5s InterpolantComputationTime, 3419 NumberOfCodeBlocks, 3419 NumberOfCodeBlocksAsserted, 59 NumberOfCheckSat, 3360 ConstructedInterpolants, 0 QuantifiedInterpolants, 1698776 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 59 InterpolantComputations, 11 PerfectInterpolantSequences, 507/1137 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test17_2_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-02_10-23-03-268.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test17_2_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-02_10-23-03-268.csv Completed graceful shutdown