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_NoArray.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test17_3_false-valid-memtrack.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-26d9e06-m [2018-02-02 10:47:17,509 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-02 10:47:17,511 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-02 10:47:17,524 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-02 10:47:17,525 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-02 10:47:17,526 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-02 10:47:17,527 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-02 10:47:17,528 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-02 10:47:17,530 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-02 10:47:17,531 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-02 10:47:17,532 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-02 10:47:17,532 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-02 10:47:17,533 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-02 10:47:17,534 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-02 10:47:17,534 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-02 10:47:17,536 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-02 10:47:17,538 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-02 10:47:17,540 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-02 10:47:17,541 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-02 10:47:17,542 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-02 10:47:17,543 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-02 10:47:17,544 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-02 10:47:17,544 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-02 10:47:17,545 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-02 10:47:17,546 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-02 10:47:17,547 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-02 10:47:17,547 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-02 10:47:17,547 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-02 10:47:17,548 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-02 10:47:17,548 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-02 10:47:17,548 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-02 10:47:17,548 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_NoArray.epf [2018-02-02 10:47:17,559 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-02 10:47:17,559 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-02 10:47:17,560 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-02 10:47:17,560 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-02 10:47:17,560 INFO L133 SettingsManager]: * Use SBE=true [2018-02-02 10:47:17,560 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-02 10:47:17,561 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-02 10:47:17,561 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-02 10:47:17,561 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-02 10:47:17,561 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-02 10:47:17,561 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-02 10:47:17,561 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-02 10:47:17,561 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-02 10:47:17,561 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-02 10:47:17,561 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-02 10:47:17,561 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-02 10:47:17,562 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-02 10:47:17,562 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-02 10:47:17,562 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-02 10:47:17,562 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-02 10:47:17,562 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 10:47:17,562 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-02 10:47:17,562 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-02-02 10:47:17,562 INFO L133 SettingsManager]: * SMT solver=Internal_SMTInterpol_NoArrayInterpol [2018-02-02 10:47:17,591 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-02 10:47:17,600 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-02 10:47:17,602 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-02 10:47:17,603 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-02 10:47:17,604 INFO L276 PluginConnector]: CDTParser initialized [2018-02-02 10:47:17,604 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test17_3_false-valid-memtrack.i [2018-02-02 10:47:17,739 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-02 10:47:17,740 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-02 10:47:17,743 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-02 10:47:17,743 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-02 10:47:17,748 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-02 10:47:17,749 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 10:47:17" (1/1) ... [2018-02-02 10:47:17,751 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c9178f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:47:17, skipping insertion in model container [2018-02-02 10:47:17,752 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 10:47:17" (1/1) ... [2018-02-02 10:47:17,763 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 10:47:17,800 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 10:47:17,890 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 10:47:17,903 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 10:47:17,909 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:47:17 WrapperNode [2018-02-02 10:47:17,910 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-02 10:47:17,910 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-02 10:47:17,910 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-02 10:47:17,910 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-02 10:47:17,923 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:47:17" (1/1) ... [2018-02-02 10:47:17,923 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:47:17" (1/1) ... [2018-02-02 10:47:17,932 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:47:17" (1/1) ... [2018-02-02 10:47:17,932 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:47:17" (1/1) ... [2018-02-02 10:47:17,936 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:47:17" (1/1) ... [2018-02-02 10:47:17,939 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:47:17" (1/1) ... [2018-02-02 10:47:17,940 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:47:17" (1/1) ... [2018-02-02 10:47:17,942 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-02 10:47:17,943 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-02 10:47:17,943 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-02 10:47:17,943 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-02 10:47:17,944 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:47:17" (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:47:17,993 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-02 10:47:17,993 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-02 10:47:17,993 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-02-02 10:47:17,993 INFO L136 BoogieDeclarations]: Found implementation of procedure alloc_17 [2018-02-02 10:47:17,994 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-02-02 10:47:17,994 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-02 10:47:17,994 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-02 10:47:17,994 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-02 10:47:17,994 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-02 10:47:17,994 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-02 10:47:17,995 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-02 10:47:17,995 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-02 10:47:17,995 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-02 10:47:17,995 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-02 10:47:17,995 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-02-02 10:47:17,995 INFO L128 BoogieDeclarations]: Found specification of procedure alloc_17 [2018-02-02 10:47:17,995 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-02-02 10:47:17,995 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-02 10:47:17,995 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-02 10:47:17,996 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-02 10:47:18,205 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-02 10:47:18,206 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 10:47:18 BoogieIcfgContainer [2018-02-02 10:47:18,206 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-02 10:47:18,207 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-02 10:47:18,207 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-02 10:47:18,210 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-02 10:47:18,210 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.02 10:47:17" (1/3) ... [2018-02-02 10:47:18,211 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b07aa9b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 10:47:18, skipping insertion in model container [2018-02-02 10:47:18,211 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:47:17" (2/3) ... [2018-02-02 10:47:18,211 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b07aa9b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 10:47:18, skipping insertion in model container [2018-02-02 10:47:18,211 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 10:47:18" (3/3) ... [2018-02-02 10:47:18,213 INFO L107 eAbstractionObserver]: Analyzing ICFG memleaks_test17_3_false-valid-memtrack.i [2018-02-02 10:47:18,218 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-02-02 10:47:18,223 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 13 error locations. [2018-02-02 10:47:18,247 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-02 10:47:18,248 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-02 10:47:18,248 INFO L324 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-02-02 10:47:18,248 INFO L325 AbstractCegarLoop]: Backedges is CANONICAL [2018-02-02 10:47:18,248 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-02 10:47:18,248 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-02 10:47:18,248 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-02 10:47:18,249 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-02 10:47:18,249 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-02 10:47:18,259 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states. [2018-02-02 10:47:18,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-02 10:47:18,267 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:47:18,268 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:47:18,268 INFO L371 AbstractCegarLoop]: === Iteration 1 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 10:47:18,271 INFO L82 PathProgramCache]: Analyzing trace with hash 1525029176, now seen corresponding path program 1 times [2018-02-02 10:47:18,311 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:47:18,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:47:18,350 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:47:18,425 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:47:18,427 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:47:18,427 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-02 10:47:18,428 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:47:18,431 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:47:18,431 INFO L182 omatonBuilderFactory]: Interpolants [65#true, 66#false, 67#(= |#valid| |old(#valid)|)] [2018-02-02 10:47:18,431 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:47:18,432 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-02 10:47:18,444 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-02 10:47:18,444 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 10:47:18,446 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 3 states. [2018-02-02 10:47:18,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:47:18,670 INFO L93 Difference]: Finished difference Result 102 states and 118 transitions. [2018-02-02 10:47:18,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-02 10:47:18,672 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-02-02 10:47:18,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:47:18,681 INFO L225 Difference]: With dead ends: 102 [2018-02-02 10:47:18,681 INFO L226 Difference]: Without dead ends: 96 [2018-02-02 10:47:18,682 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:47:18,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-02-02 10:47:18,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 63. [2018-02-02 10:47:18,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-02-02 10:47:18,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 70 transitions. [2018-02-02 10:47:18,716 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 70 transitions. Word has length 17 [2018-02-02 10:47:18,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:47:18,716 INFO L432 AbstractCegarLoop]: Abstraction has 63 states and 70 transitions. [2018-02-02 10:47:18,716 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-02 10:47:18,716 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 70 transitions. [2018-02-02 10:47:18,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-02 10:47:18,717 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:47:18,717 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:47:18,717 INFO L371 AbstractCegarLoop]: === Iteration 2 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 10:47:18,717 INFO L82 PathProgramCache]: Analyzing trace with hash 1524292544, now seen corresponding path program 1 times [2018-02-02 10:47:18,718 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:47:18,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:47:18,731 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:47:18,780 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:47:18,780 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:47:18,781 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 10:47:18,781 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:47:18,781 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:47:18,781 INFO L182 omatonBuilderFactory]: Interpolants [233#true, 234#false, 235#(and (= 0 |ldv_malloc_#res.offset|) (= 0 |ldv_malloc_#res.base|)), 236#(and (= 0 |entry_point_#t~ret8.offset|) (= 0 |entry_point_#t~ret8.base|)), 237#(and (= entry_point_~array~0.base 0) (= 0 entry_point_~array~0.offset))] [2018-02-02 10:47:18,781 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:47:18,783 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 10:47:18,783 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 10:47:18,783 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:47:18,783 INFO L87 Difference]: Start difference. First operand 63 states and 70 transitions. Second operand 5 states. [2018-02-02 10:47:18,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:47:18,810 INFO L93 Difference]: Finished difference Result 65 states and 71 transitions. [2018-02-02 10:47:18,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 10:47:18,810 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-02-02 10:47:18,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:47:18,811 INFO L225 Difference]: With dead ends: 65 [2018-02-02 10:47:18,811 INFO L226 Difference]: Without dead ends: 63 [2018-02-02 10:47:18,812 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:47:18,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-02-02 10:47:18,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 61. [2018-02-02 10:47:18,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-02-02 10:47:18,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 67 transitions. [2018-02-02 10:47:18,817 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 67 transitions. Word has length 17 [2018-02-02 10:47:18,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:47:18,818 INFO L432 AbstractCegarLoop]: Abstraction has 61 states and 67 transitions. [2018-02-02 10:47:18,818 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 10:47:18,818 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 67 transitions. [2018-02-02 10:47:18,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-02 10:47:18,819 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:47:18,819 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:47:18,819 INFO L371 AbstractCegarLoop]: === Iteration 3 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 10:47:18,819 INFO L82 PathProgramCache]: Analyzing trace with hash -1268239334, now seen corresponding path program 1 times [2018-02-02 10:47:18,820 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:47:18,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:47:18,833 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:47:18,865 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:47:18,865 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:47:18,866 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 10:47:18,866 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:47:18,866 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:47:18,866 INFO L182 omatonBuilderFactory]: Interpolants [368#(not (= 0 |entry_point_#t~ret8.base|)), 369#(not (= 0 entry_point_~array~0.base)), 364#true, 365#false, 366#(not (= 0 |ldv_malloc_#t~malloc1.base|)), 367#(not (= 0 |ldv_malloc_#res.base|))] [2018-02-02 10:47:18,866 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:47:18,866 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 10:47:18,866 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 10:47:18,866 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:47:18,867 INFO L87 Difference]: Start difference. First operand 61 states and 67 transitions. Second operand 6 states. [2018-02-02 10:47:18,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:47:18,902 INFO L93 Difference]: Finished difference Result 61 states and 66 transitions. [2018-02-02 10:47:18,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 10:47:18,904 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-02-02 10:47:18,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:47:18,905 INFO L225 Difference]: With dead ends: 61 [2018-02-02 10:47:18,905 INFO L226 Difference]: Without dead ends: 61 [2018-02-02 10:47:18,905 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:47:18,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-02-02 10:47:18,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2018-02-02 10:47:18,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-02-02 10:47:18,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 66 transitions. [2018-02-02 10:47:18,908 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 66 transitions. Word has length 19 [2018-02-02 10:47:18,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:47:18,909 INFO L432 AbstractCegarLoop]: Abstraction has 61 states and 66 transitions. [2018-02-02 10:47:18,909 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 10:47:18,909 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 66 transitions. [2018-02-02 10:47:18,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-02 10:47:18,909 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:47:18,909 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:47:18,909 INFO L371 AbstractCegarLoop]: === Iteration 4 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 10:47:18,910 INFO L82 PathProgramCache]: Analyzing trace with hash -1268975966, now seen corresponding path program 1 times [2018-02-02 10:47:18,911 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:47:18,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:47:18,920 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:47:18,961 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:47:18,961 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:47:18,961 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 10:47:18,961 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:47:18,961 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:47:18,962 INFO L182 omatonBuilderFactory]: Interpolants [496#(= 1 (select |#valid| |ldv_malloc_#t~malloc1.base|)), 497#(= 1 (select |#valid| |ldv_malloc_#res.base|)), 498#(= 1 (select |#valid| |entry_point_#t~ret8.base|)), 499#(= 1 (select |#valid| entry_point_~array~0.base)), 494#true, 495#false] [2018-02-02 10:47:18,962 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:47:18,962 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 10:47:18,962 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 10:47:18,962 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:47:18,962 INFO L87 Difference]: Start difference. First operand 61 states and 66 transitions. Second operand 6 states. [2018-02-02 10:47:19,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:47:19,046 INFO L93 Difference]: Finished difference Result 60 states and 65 transitions. [2018-02-02 10:47:19,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 10:47:19,046 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-02-02 10:47:19,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:47:19,047 INFO L225 Difference]: With dead ends: 60 [2018-02-02 10:47:19,047 INFO L226 Difference]: Without dead ends: 60 [2018-02-02 10:47:19,047 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:47:19,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-02-02 10:47:19,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2018-02-02 10:47:19,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-02-02 10:47:19,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 65 transitions. [2018-02-02 10:47:19,050 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 65 transitions. Word has length 19 [2018-02-02 10:47:19,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:47:19,051 INFO L432 AbstractCegarLoop]: Abstraction has 60 states and 65 transitions. [2018-02-02 10:47:19,051 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 10:47:19,051 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 65 transitions. [2018-02-02 10:47:19,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-02 10:47:19,051 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:47:19,051 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:47:19,051 INFO L371 AbstractCegarLoop]: === Iteration 5 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 10:47:19,051 INFO L82 PathProgramCache]: Analyzing trace with hash -1268975965, now seen corresponding path program 1 times [2018-02-02 10:47:19,052 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:47:19,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:47:19,066 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:47:19,253 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:47:19,253 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:47:19,253 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-02 10:47:19,253 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:47:19,254 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:47:19,254 INFO L182 omatonBuilderFactory]: Interpolants [624#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10)), 625#(and (or (< 0 (div ldv_malloc_~size 4294967296)) (and (or (<= ldv_malloc_~size |ldv_malloc_#in~size|) (<= (+ (div ldv_malloc_~size 4294967296) 1) 0)) (<= |ldv_malloc_#in~size| ldv_malloc_~size))) (or (<= ldv_malloc_~size |ldv_malloc_#in~size|) (<= (div ldv_malloc_~size 4294967296) 0))), 626#(and (or (<= (+ |ldv_malloc_#in~size| 1) 0) (<= |ldv_malloc_#in~size| (select |#length| |ldv_malloc_#t~malloc1.base|)) (<= 2147483648 |ldv_malloc_#in~size|)) (= 0 |ldv_malloc_#t~malloc1.offset|)), 627#(and (= 0 |ldv_malloc_#res.offset|) (or (<= (+ |ldv_malloc_#in~size| 1) 0) (<= |ldv_malloc_#in~size| (select |#length| |ldv_malloc_#res.base|)) (<= 2147483648 |ldv_malloc_#in~size|))), 628#(and (= 0 |entry_point_#t~ret8.offset|) (<= 40 (select |#length| |entry_point_#t~ret8.base|))), 629#(and (<= 40 (select |#length| entry_point_~array~0.base)) (= entry_point_~array~0.offset 0)), 630#(and (<= 40 (select |#length| entry_point_~array~0.base)) (= entry_point_~array~0.offset 0) (= entry_point_~i~1 0)), 622#true, 623#false] [2018-02-02 10:47:19,254 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:47:19,255 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 10:47:19,255 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 10:47:19,255 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-02-02 10:47:19,255 INFO L87 Difference]: Start difference. First operand 60 states and 65 transitions. Second operand 9 states. [2018-02-02 10:47:19,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:47:19,456 INFO L93 Difference]: Finished difference Result 64 states and 69 transitions. [2018-02-02 10:47:19,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 10:47:19,456 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 19 [2018-02-02 10:47:19,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:47:19,457 INFO L225 Difference]: With dead ends: 64 [2018-02-02 10:47:19,457 INFO L226 Difference]: Without dead ends: 64 [2018-02-02 10:47:19,457 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2018-02-02 10:47:19,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-02-02 10:47:19,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 63. [2018-02-02 10:47:19,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-02-02 10:47:19,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 68 transitions. [2018-02-02 10:47:19,462 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 68 transitions. Word has length 19 [2018-02-02 10:47:19,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:47:19,463 INFO L432 AbstractCegarLoop]: Abstraction has 63 states and 68 transitions. [2018-02-02 10:47:19,463 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 10:47:19,463 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 68 transitions. [2018-02-02 10:47:19,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-02 10:47:19,463 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:47:19,463 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:47:19,464 INFO L371 AbstractCegarLoop]: === Iteration 6 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 10:47:19,464 INFO L82 PathProgramCache]: Analyzing trace with hash -1174934022, now seen corresponding path program 1 times [2018-02-02 10:47:19,464 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:47:19,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:47:19,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:47:19,719 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:47:19,719 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:47:19,719 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-02-02 10:47:19,720 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:47:19,720 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:47:19,720 INFO L182 omatonBuilderFactory]: Interpolants [768#true, 769#false, 770#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10)), 771#(and (or (< 0 (div ldv_malloc_~size 4294967296)) (<= |ldv_malloc_#in~size| ldv_malloc_~size)) (or (<= ldv_malloc_~size |ldv_malloc_#in~size|) (<= (div ldv_malloc_~size 4294967296) 0))), 772#(or (and (<= |ldv_malloc_#in~size| (select |#length| |ldv_malloc_#t~malloc1.base|)) (= 0 |ldv_malloc_#t~malloc1.offset|)) (<= 4294967296 |ldv_malloc_#in~size|) (<= (+ (select |#length| |ldv_malloc_#t~malloc1.base|) 1) 0)), 773#(or (<= (+ (select |#length| |ldv_malloc_#res.base|) 1) 0) (<= 4294967296 |ldv_malloc_#in~size|) (and (= 0 |ldv_malloc_#res.offset|) (<= |ldv_malloc_#in~size| (select |#length| |ldv_malloc_#res.base|)))), 774#(or (<= (+ (select |#length| |entry_point_#t~ret8.base|) 1) 0) (and (= 0 |entry_point_#t~ret8.offset|) (<= 40 (select |#length| |entry_point_#t~ret8.base|)))), 775#(or (<= (+ (select |#length| entry_point_~array~0.base) 1) 0) (and (<= 40 (select |#length| entry_point_~array~0.base)) (= entry_point_~array~0.offset 0))), 776#(and (or (<= (+ (select |#length| entry_point_~array~0.base) 1) 0) (and (<= 40 (select |#length| entry_point_~array~0.base)) (= entry_point_~array~0.offset 0))) (= entry_point_~i~1 0)), 777#(and (<= 40 (select |#length| entry_point_~array~0.base)) (= entry_point_~array~0.offset 0) (= entry_point_~i~1 0)), 778#(and (<= 4 (+ (* 4 entry_point_~i~1) entry_point_~array~0.offset)) (= entry_point_~array~0.offset 0) (<= (+ (* 4 entry_point_~i~1) 36) (select |#length| entry_point_~array~0.base)))] [2018-02-02 10:47:19,720 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:47:19,720 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-02 10:47:19,721 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-02 10:47:19,721 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-02-02 10:47:19,721 INFO L87 Difference]: Start difference. First operand 63 states and 68 transitions. Second operand 11 states. [2018-02-02 10:47:19,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:47:19,950 INFO L93 Difference]: Finished difference Result 69 states and 76 transitions. [2018-02-02 10:47:19,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-02 10:47:19,951 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 23 [2018-02-02 10:47:19,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:47:19,952 INFO L225 Difference]: With dead ends: 69 [2018-02-02 10:47:19,952 INFO L226 Difference]: Without dead ends: 69 [2018-02-02 10:47:19,953 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=61, Invalid=245, Unknown=0, NotChecked=0, Total=306 [2018-02-02 10:47:19,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-02-02 10:47:19,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 67. [2018-02-02 10:47:19,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-02-02 10:47:19,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 73 transitions. [2018-02-02 10:47:19,957 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 73 transitions. Word has length 23 [2018-02-02 10:47:19,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:47:19,957 INFO L432 AbstractCegarLoop]: Abstraction has 67 states and 73 transitions. [2018-02-02 10:47:19,958 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-02 10:47:19,958 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 73 transitions. [2018-02-02 10:47:19,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-02-02 10:47:19,958 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:47:19,959 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:47:19,959 INFO L371 AbstractCegarLoop]: === Iteration 7 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 10:47:19,959 INFO L82 PathProgramCache]: Analyzing trace with hash 614865, now seen corresponding path program 2 times [2018-02-02 10:47:19,960 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:47:19,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:47:19,973 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:47:20,166 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:47:20,166 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:47:20,166 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-02 10:47:20,166 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:47:20,166 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:47:20,167 INFO L182 omatonBuilderFactory]: Interpolants [929#true, 930#false, 931#(<= entry_point_~len~0 10), 932#(and (or (< 0 (div ldv_malloc_~size 4294967296)) (<= |ldv_malloc_#in~size| ldv_malloc_~size)) (or (<= ldv_malloc_~size |ldv_malloc_#in~size|) (<= (div ldv_malloc_~size 4294967296) 0))), 933#(or (and (<= |ldv_malloc_#in~size| (select |#length| |ldv_malloc_#t~malloc1.base|)) (= 0 |ldv_malloc_#t~malloc1.offset|)) (<= 4294967296 |ldv_malloc_#in~size|) (<= (+ (select |#length| |ldv_malloc_#t~malloc1.base|) 1) 0)), 934#(or (<= (+ (select |#length| |ldv_malloc_#res.base|) 1) 0) (<= 4294967296 |ldv_malloc_#in~size|) (and (= 0 |ldv_malloc_#res.offset|) (<= |ldv_malloc_#in~size| (select |#length| |ldv_malloc_#res.base|)))), 935#(or (<= (+ (select |#length| |entry_point_#t~ret8.base|) 1) 0) (and (<= (* 4 entry_point_~len~0) (select |#length| |entry_point_#t~ret8.base|)) (= 0 |entry_point_#t~ret8.offset|))), 936#(or (<= (+ (select |#length| entry_point_~array~0.base) 1) 0) (and (<= (* 4 entry_point_~len~0) (select |#length| entry_point_~array~0.base)) (= entry_point_~array~0.offset 0))), 937#(or (<= (+ (select |#length| entry_point_~array~0.base) 1) (+ (* 4 entry_point_~i~1) entry_point_~array~0.offset)) (and (<= (* 4 entry_point_~len~0) (select |#length| entry_point_~array~0.base)) (= entry_point_~array~0.offset 0))), 938#(or (<= (+ (select |#length| entry_point_~array~0.base) 5) (+ (* 4 entry_point_~i~1) entry_point_~array~0.offset)) (and (<= (* 4 entry_point_~len~0) (select |#length| entry_point_~array~0.base)) (= entry_point_~array~0.offset 0))), 939#(and (<= 0 (+ (* 4 entry_point_~i~1) entry_point_~array~0.offset)) (<= (* 4 entry_point_~len~0) (select |#length| entry_point_~array~0.base)) (= entry_point_~array~0.offset 0)), 940#(and (<= (* 4 entry_point_~len~0) (select |#length| entry_point_~array~0.base)) (<= 4 (+ (* 4 entry_point_~i~1) entry_point_~array~0.offset)) (= entry_point_~array~0.offset 0)), 941#(and (<= 4 (+ (* 4 entry_point_~i~1) entry_point_~array~0.offset)) (= entry_point_~array~0.offset 0) (<= (+ (* 4 entry_point_~i~1) 4) (select |#length| entry_point_~array~0.base)))] [2018-02-02 10:47:20,167 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:47:20,167 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-02 10:47:20,167 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-02 10:47:20,167 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2018-02-02 10:47:20,167 INFO L87 Difference]: Start difference. First operand 67 states and 73 transitions. Second operand 13 states. [2018-02-02 10:47:20,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:47:20,408 INFO L93 Difference]: Finished difference Result 66 states and 72 transitions. [2018-02-02 10:47:20,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-02 10:47:20,409 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 27 [2018-02-02 10:47:20,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:47:20,409 INFO L225 Difference]: With dead ends: 66 [2018-02-02 10:47:20,409 INFO L226 Difference]: Without dead ends: 66 [2018-02-02 10:47:20,410 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=301, Unknown=0, NotChecked=0, Total=380 [2018-02-02 10:47:20,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-02-02 10:47:20,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 61. [2018-02-02 10:47:20,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-02-02 10:47:20,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 66 transitions. [2018-02-02 10:47:20,412 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 66 transitions. Word has length 27 [2018-02-02 10:47:20,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:47:20,412 INFO L432 AbstractCegarLoop]: Abstraction has 61 states and 66 transitions. [2018-02-02 10:47:20,413 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-02 10:47:20,413 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 66 transitions. [2018-02-02 10:47:20,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-02-02 10:47:20,413 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:47:20,413 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:47:20,413 INFO L371 AbstractCegarLoop]: === Iteration 8 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 10:47:20,414 INFO L82 PathProgramCache]: Analyzing trace with hash 2025596221, now seen corresponding path program 1 times [2018-02-02 10:47:20,414 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:47:20,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:47:20,421 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:47:20,437 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:47:20,437 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:47:20,437 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 10:47:20,437 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:47:20,438 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:47:20,438 INFO L182 omatonBuilderFactory]: Interpolants [1083#true, 1084#false, 1085#(= 1 (select |#valid| entry_point_~array~0.base)), 1086#(= |#valid| |old(#valid)|)] [2018-02-02 10:47:20,438 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:47:20,438 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 10:47:20,438 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 10:47:20,438 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 10:47:20,439 INFO L87 Difference]: Start difference. First operand 61 states and 66 transitions. Second operand 4 states. [2018-02-02 10:47:20,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:47:20,482 INFO L93 Difference]: Finished difference Result 87 states and 97 transitions. [2018-02-02 10:47:20,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 10:47:20,482 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 31 [2018-02-02 10:47:20,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:47:20,483 INFO L225 Difference]: With dead ends: 87 [2018-02-02 10:47:20,483 INFO L226 Difference]: Without dead ends: 87 [2018-02-02 10:47:20,483 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 10:47:20,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-02-02 10:47:20,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 77. [2018-02-02 10:47:20,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-02-02 10:47:20,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 90 transitions. [2018-02-02 10:47:20,486 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 90 transitions. Word has length 31 [2018-02-02 10:47:20,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:47:20,486 INFO L432 AbstractCegarLoop]: Abstraction has 77 states and 90 transitions. [2018-02-02 10:47:20,487 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 10:47:20,487 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 90 transitions. [2018-02-02 10:47:20,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-02-02 10:47:20,488 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:47:20,488 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:47:20,488 INFO L371 AbstractCegarLoop]: === Iteration 9 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 10:47:20,488 INFO L82 PathProgramCache]: Analyzing trace with hash 2025596220, now seen corresponding path program 1 times [2018-02-02 10:47:20,489 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:47:20,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:47:20,498 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:47:20,596 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:47:20,597 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:47:20,597 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 10:47:20,597 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:47:20,597 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:47:20,597 INFO L182 omatonBuilderFactory]: Interpolants [1251#true, 1252#false, 1253#(= 0 |ldv_malloc_#t~malloc1.offset|), 1254#(= 0 |ldv_malloc_#res.offset|), 1255#(= 0 |entry_point_#t~ret8.offset|), 1256#(= 0 entry_point_~array~0.offset)] [2018-02-02 10:47:20,597 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:47:20,598 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 10:47:20,598 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 10:47:20,598 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:47:20,598 INFO L87 Difference]: Start difference. First operand 77 states and 90 transitions. Second operand 6 states. [2018-02-02 10:47:20,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:47:20,610 INFO L93 Difference]: Finished difference Result 76 states and 88 transitions. [2018-02-02 10:47:20,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 10:47:20,610 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2018-02-02 10:47:20,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:47:20,611 INFO L225 Difference]: With dead ends: 76 [2018-02-02 10:47:20,611 INFO L226 Difference]: Without dead ends: 76 [2018-02-02 10:47:20,611 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:47:20,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-02-02 10:47:20,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2018-02-02 10:47:20,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-02-02 10:47:20,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 88 transitions. [2018-02-02 10:47:20,616 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 88 transitions. Word has length 31 [2018-02-02 10:47:20,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:47:20,616 INFO L432 AbstractCegarLoop]: Abstraction has 76 states and 88 transitions. [2018-02-02 10:47:20,616 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 10:47:20,617 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 88 transitions. [2018-02-02 10:47:20,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-02-02 10:47:20,617 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:47:20,618 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:47:20,618 INFO L371 AbstractCegarLoop]: === Iteration 10 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 10:47:20,618 INFO L82 PathProgramCache]: Analyzing trace with hash 324245613, now seen corresponding path program 1 times [2018-02-02 10:47:20,619 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:47:20,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:47:20,633 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:47:20,688 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:47:20,688 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:47:20,688 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 10:47:20,688 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:47:20,689 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:47:20,689 INFO L182 omatonBuilderFactory]: Interpolants [1411#true, 1412#false, 1413#(and (= 0 |ldv_malloc_#res.offset|) (= 0 |ldv_malloc_#res.base|)), 1414#(and (= 0 |alloc_17_#t~ret3.base|) (= 0 |alloc_17_#t~ret3.offset|)), 1415#(and (= 0 alloc_17_~p~0.offset) (= alloc_17_~p~0.base 0))] [2018-02-02 10:47:20,689 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:47:20,689 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 10:47:20,689 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 10:47:20,690 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:47:20,690 INFO L87 Difference]: Start difference. First operand 76 states and 88 transitions. Second operand 5 states. [2018-02-02 10:47:20,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:47:20,703 INFO L93 Difference]: Finished difference Result 80 states and 89 transitions. [2018-02-02 10:47:20,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 10:47:20,704 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 34 [2018-02-02 10:47:20,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:47:20,705 INFO L225 Difference]: With dead ends: 80 [2018-02-02 10:47:20,705 INFO L226 Difference]: Without dead ends: 80 [2018-02-02 10:47:20,705 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:47:20,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-02-02 10:47:20,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 76. [2018-02-02 10:47:20,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-02-02 10:47:20,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 85 transitions. [2018-02-02 10:47:20,709 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 85 transitions. Word has length 34 [2018-02-02 10:47:20,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:47:20,709 INFO L432 AbstractCegarLoop]: Abstraction has 76 states and 85 transitions. [2018-02-02 10:47:20,709 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 10:47:20,710 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 85 transitions. [2018-02-02 10:47:20,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-02-02 10:47:20,710 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:47:20,716 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:47:20,716 INFO L371 AbstractCegarLoop]: === Iteration 11 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 10:47:20,717 INFO L82 PathProgramCache]: Analyzing trace with hash 246550693, now seen corresponding path program 1 times [2018-02-02 10:47:20,718 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:47:20,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:47:20,728 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:47:20,760 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:47:20,761 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:47:20,761 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-02-02 10:47:20,761 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:47:20,761 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:47:20,761 INFO L182 omatonBuilderFactory]: Interpolants [1572#true, 1573#false, 1574#(<= 10 entry_point_~len~0), 1575#(and (<= 10 entry_point_~len~0) (= entry_point_~i~1 0)), 1576#(<= (+ entry_point_~i~1 9) entry_point_~len~0)] [2018-02-02 10:47:20,762 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:47:20,762 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 10:47:20,762 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 10:47:20,763 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:47:20,763 INFO L87 Difference]: Start difference. First operand 76 states and 85 transitions. Second operand 5 states. [2018-02-02 10:47:20,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:47:20,810 INFO L93 Difference]: Finished difference Result 82 states and 91 transitions. [2018-02-02 10:47:20,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 10:47:20,812 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 34 [2018-02-02 10:47:20,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:47:20,812 INFO L225 Difference]: With dead ends: 82 [2018-02-02 10:47:20,813 INFO L226 Difference]: Without dead ends: 82 [2018-02-02 10:47:20,813 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:47:20,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-02-02 10:47:20,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 80. [2018-02-02 10:47:20,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-02-02 10:47:20,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 89 transitions. [2018-02-02 10:47:20,817 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 89 transitions. Word has length 34 [2018-02-02 10:47:20,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:47:20,817 INFO L432 AbstractCegarLoop]: Abstraction has 80 states and 89 transitions. [2018-02-02 10:47:20,817 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 10:47:20,817 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 89 transitions. [2018-02-02 10:47:20,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-02-02 10:47:20,818 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:47:20,818 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:47:20,818 INFO L371 AbstractCegarLoop]: === Iteration 12 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 10:47:20,818 INFO L82 PathProgramCache]: Analyzing trace with hash 1199349870, now seen corresponding path program 2 times [2018-02-02 10:47:20,823 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:47:20,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:47:20,834 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:47:20,876 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:47:20,876 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:47:20,876 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-02-02 10:47:20,876 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:47:20,876 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:47:20,876 INFO L182 omatonBuilderFactory]: Interpolants [1744#(and (<= 10 entry_point_~len~0) (= entry_point_~i~1 0)), 1745#(<= (+ entry_point_~i~1 9) entry_point_~len~0), 1746#(<= (+ entry_point_~i~1 8) entry_point_~len~0), 1741#true, 1742#false, 1743#(<= 10 entry_point_~len~0)] [2018-02-02 10:47:20,877 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:47:20,877 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 10:47:20,877 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 10:47:20,877 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:47:20,877 INFO L87 Difference]: Start difference. First operand 80 states and 89 transitions. Second operand 6 states. [2018-02-02 10:47:20,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:47:20,919 INFO L93 Difference]: Finished difference Result 86 states and 95 transitions. [2018-02-02 10:47:20,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 10:47:20,920 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 38 [2018-02-02 10:47:20,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:47:20,921 INFO L225 Difference]: With dead ends: 86 [2018-02-02 10:47:20,921 INFO L226 Difference]: Without dead ends: 86 [2018-02-02 10:47:20,921 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2018-02-02 10:47:20,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-02-02 10:47:20,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 84. [2018-02-02 10:47:20,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-02-02 10:47:20,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 93 transitions. [2018-02-02 10:47:20,925 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 93 transitions. Word has length 38 [2018-02-02 10:47:20,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:47:20,925 INFO L432 AbstractCegarLoop]: Abstraction has 84 states and 93 transitions. [2018-02-02 10:47:20,925 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 10:47:20,925 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 93 transitions. [2018-02-02 10:47:20,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-02-02 10:47:20,926 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:47:20,926 INFO L351 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:47:20,926 INFO L371 AbstractCegarLoop]: === Iteration 13 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 10:47:20,933 INFO L82 PathProgramCache]: Analyzing trace with hash -176675913, now seen corresponding path program 3 times [2018-02-02 10:47:20,934 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:47:20,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:47:20,944 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:47:20,975 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:47:20,976 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:47:20,976 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-02-02 10:47:20,976 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:47:20,976 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:47:20,976 INFO L182 omatonBuilderFactory]: Interpolants [1921#true, 1922#false, 1923#(<= 10 entry_point_~len~0), 1924#(and (<= 10 entry_point_~len~0) (= entry_point_~i~1 0)), 1925#(<= (+ entry_point_~i~1 9) entry_point_~len~0), 1926#(<= (+ entry_point_~i~1 8) entry_point_~len~0), 1927#(<= (+ entry_point_~i~1 7) entry_point_~len~0)] [2018-02-02 10:47:20,976 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:47:20,976 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 10:47:20,976 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 10:47:20,976 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-02-02 10:47:20,977 INFO L87 Difference]: Start difference. First operand 84 states and 93 transitions. Second operand 7 states. [2018-02-02 10:47:21,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:47:21,012 INFO L93 Difference]: Finished difference Result 90 states and 99 transitions. [2018-02-02 10:47:21,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 10:47:21,012 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 42 [2018-02-02 10:47:21,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:47:21,013 INFO L225 Difference]: With dead ends: 90 [2018-02-02 10:47:21,013 INFO L226 Difference]: Without dead ends: 90 [2018-02-02 10:47:21,013 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2018-02-02 10:47:21,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-02-02 10:47:21,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 88. [2018-02-02 10:47:21,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-02-02 10:47:21,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 97 transitions. [2018-02-02 10:47:21,016 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 97 transitions. Word has length 42 [2018-02-02 10:47:21,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:47:21,016 INFO L432 AbstractCegarLoop]: Abstraction has 88 states and 97 transitions. [2018-02-02 10:47:21,016 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 10:47:21,016 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 97 transitions. [2018-02-02 10:47:21,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-02-02 10:47:21,017 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:47:21,018 INFO L351 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:47:21,018 INFO L371 AbstractCegarLoop]: === Iteration 14 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 10:47:21,018 INFO L82 PathProgramCache]: Analyzing trace with hash 1744755328, now seen corresponding path program 4 times [2018-02-02 10:47:21,019 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:47:21,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:47:21,029 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:47:21,117 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:47:21,117 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:47:21,117 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-02-02 10:47:21,117 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:47:21,117 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:47:21,117 INFO L182 omatonBuilderFactory]: Interpolants [2112#true, 2113#false, 2114#(<= 10 entry_point_~len~0), 2115#(and (<= 10 entry_point_~len~0) (= entry_point_~i~1 0)), 2116#(<= (+ entry_point_~i~1 9) entry_point_~len~0), 2117#(<= (+ entry_point_~i~1 8) entry_point_~len~0), 2118#(<= (+ entry_point_~i~1 7) entry_point_~len~0), 2119#(<= (+ entry_point_~i~1 6) entry_point_~len~0)] [2018-02-02 10:47:21,117 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:47:21,117 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 10:47:21,118 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 10:47:21,118 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2018-02-02 10:47:21,118 INFO L87 Difference]: Start difference. First operand 88 states and 97 transitions. Second operand 8 states. [2018-02-02 10:47:21,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:47:21,199 INFO L93 Difference]: Finished difference Result 94 states and 103 transitions. [2018-02-02 10:47:21,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 10:47:21,199 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 46 [2018-02-02 10:47:21,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:47:21,200 INFO L225 Difference]: With dead ends: 94 [2018-02-02 10:47:21,200 INFO L226 Difference]: Without dead ends: 94 [2018-02-02 10:47:21,200 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=56, Invalid=76, Unknown=0, NotChecked=0, Total=132 [2018-02-02 10:47:21,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-02-02 10:47:21,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 92. [2018-02-02 10:47:21,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-02-02 10:47:21,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 101 transitions. [2018-02-02 10:47:21,203 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 101 transitions. Word has length 46 [2018-02-02 10:47:21,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:47:21,204 INFO L432 AbstractCegarLoop]: Abstraction has 92 states and 101 transitions. [2018-02-02 10:47:21,204 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 10:47:21,204 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 101 transitions. [2018-02-02 10:47:21,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-02-02 10:47:21,205 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:47:21,205 INFO L351 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:47:21,205 INFO L371 AbstractCegarLoop]: === Iteration 15 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 10:47:21,205 INFO L82 PathProgramCache]: Analyzing trace with hash 927663305, now seen corresponding path program 5 times [2018-02-02 10:47:21,206 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:47:21,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:47:21,214 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:47:21,267 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:47:21,267 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:47:21,267 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-02-02 10:47:21,267 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:47:21,268 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:47:21,268 INFO L182 omatonBuilderFactory]: Interpolants [2320#(<= (+ entry_point_~i~1 7) entry_point_~len~0), 2321#(<= (+ entry_point_~i~1 6) entry_point_~len~0), 2322#(<= (+ entry_point_~i~1 5) entry_point_~len~0), 2314#true, 2315#false, 2316#(<= 10 entry_point_~len~0), 2317#(and (<= 10 entry_point_~len~0) (= entry_point_~i~1 0)), 2318#(<= (+ entry_point_~i~1 9) entry_point_~len~0), 2319#(<= (+ entry_point_~i~1 8) entry_point_~len~0)] [2018-02-02 10:47:21,268 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:47:21,268 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 10:47:21,268 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 10:47:21,269 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2018-02-02 10:47:21,269 INFO L87 Difference]: Start difference. First operand 92 states and 101 transitions. Second operand 9 states. [2018-02-02 10:47:21,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:47:21,343 INFO L93 Difference]: Finished difference Result 98 states and 107 transitions. [2018-02-02 10:47:21,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 10:47:21,344 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 50 [2018-02-02 10:47:21,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:47:21,345 INFO L225 Difference]: With dead ends: 98 [2018-02-02 10:47:21,345 INFO L226 Difference]: Without dead ends: 98 [2018-02-02 10:47:21,345 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=76, Invalid=106, Unknown=0, NotChecked=0, Total=182 [2018-02-02 10:47:21,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-02-02 10:47:21,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 96. [2018-02-02 10:47:21,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-02-02 10:47:21,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 105 transitions. [2018-02-02 10:47:21,349 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 105 transitions. Word has length 50 [2018-02-02 10:47:21,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:47:21,349 INFO L432 AbstractCegarLoop]: Abstraction has 96 states and 105 transitions. [2018-02-02 10:47:21,349 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 10:47:21,349 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 105 transitions. [2018-02-02 10:47:21,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-02-02 10:47:21,350 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:47:21,350 INFO L351 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:47:21,350 INFO L371 AbstractCegarLoop]: === Iteration 16 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 10:47:21,351 INFO L82 PathProgramCache]: Analyzing trace with hash -730406254, now seen corresponding path program 6 times [2018-02-02 10:47:21,352 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:47:21,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:47:21,360 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:47:21,408 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:47:21,408 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:47:21,408 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-02-02 10:47:21,408 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:47:21,409 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:47:21,409 INFO L182 omatonBuilderFactory]: Interpolants [2528#false, 2529#(<= 10 entry_point_~len~0), 2530#(and (<= 10 entry_point_~len~0) (= entry_point_~i~1 0)), 2531#(<= (+ entry_point_~i~1 9) entry_point_~len~0), 2532#(<= (+ entry_point_~i~1 8) entry_point_~len~0), 2533#(<= (+ entry_point_~i~1 7) entry_point_~len~0), 2534#(<= (+ entry_point_~i~1 6) entry_point_~len~0), 2535#(<= (+ entry_point_~i~1 5) entry_point_~len~0), 2536#(<= (+ entry_point_~i~1 4) entry_point_~len~0), 2527#true] [2018-02-02 10:47:21,409 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:47:21,409 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 10:47:21,410 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 10:47:21,410 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2018-02-02 10:47:21,410 INFO L87 Difference]: Start difference. First operand 96 states and 105 transitions. Second operand 10 states. [2018-02-02 10:47:21,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:47:21,492 INFO L93 Difference]: Finished difference Result 102 states and 111 transitions. [2018-02-02 10:47:21,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 10:47:21,492 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 54 [2018-02-02 10:47:21,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:47:21,493 INFO L225 Difference]: With dead ends: 102 [2018-02-02 10:47:21,493 INFO L226 Difference]: Without dead ends: 102 [2018-02-02 10:47:21,493 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=99, Invalid=141, Unknown=0, NotChecked=0, Total=240 [2018-02-02 10:47:21,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-02-02 10:47:21,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 100. [2018-02-02 10:47:21,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-02-02 10:47:21,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 109 transitions. [2018-02-02 10:47:21,497 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 109 transitions. Word has length 54 [2018-02-02 10:47:21,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:47:21,497 INFO L432 AbstractCegarLoop]: Abstraction has 100 states and 109 transitions. [2018-02-02 10:47:21,497 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 10:47:21,497 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 109 transitions. [2018-02-02 10:47:21,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-02-02 10:47:21,498 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:47:21,498 INFO L351 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:47:21,498 INFO L371 AbstractCegarLoop]: === Iteration 17 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 10:47:21,498 INFO L82 PathProgramCache]: Analyzing trace with hash 427602907, now seen corresponding path program 7 times [2018-02-02 10:47:21,499 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:47:21,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:47:21,511 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:47:21,588 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:47:21,588 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:47:21,588 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-02-02 10:47:21,588 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:47:21,589 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:47:21,589 INFO L182 omatonBuilderFactory]: Interpolants [2752#false, 2753#(<= 10 entry_point_~len~0), 2754#(and (<= 10 entry_point_~len~0) (= entry_point_~i~1 0)), 2755#(<= (+ entry_point_~i~1 9) entry_point_~len~0), 2756#(<= (+ entry_point_~i~1 8) entry_point_~len~0), 2757#(<= (+ entry_point_~i~1 7) entry_point_~len~0), 2758#(<= (+ entry_point_~i~1 6) entry_point_~len~0), 2759#(<= (+ entry_point_~i~1 5) entry_point_~len~0), 2760#(<= (+ entry_point_~i~1 4) entry_point_~len~0), 2761#(<= (+ entry_point_~i~1 3) entry_point_~len~0), 2751#true] [2018-02-02 10:47:21,589 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:47:21,589 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-02 10:47:21,590 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-02 10:47:21,590 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2018-02-02 10:47:21,590 INFO L87 Difference]: Start difference. First operand 100 states and 109 transitions. Second operand 11 states. [2018-02-02 10:47:21,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:47:21,686 INFO L93 Difference]: Finished difference Result 106 states and 115 transitions. [2018-02-02 10:47:21,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-02 10:47:21,687 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 58 [2018-02-02 10:47:21,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:47:21,687 INFO L225 Difference]: With dead ends: 106 [2018-02-02 10:47:21,687 INFO L226 Difference]: Without dead ends: 106 [2018-02-02 10:47:21,688 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=125, Invalid=181, Unknown=0, NotChecked=0, Total=306 [2018-02-02 10:47:21,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-02-02 10:47:21,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 104. [2018-02-02 10:47:21,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-02-02 10:47:21,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 113 transitions. [2018-02-02 10:47:21,691 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 113 transitions. Word has length 58 [2018-02-02 10:47:21,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:47:21,691 INFO L432 AbstractCegarLoop]: Abstraction has 104 states and 113 transitions. [2018-02-02 10:47:21,691 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-02 10:47:21,691 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 113 transitions. [2018-02-02 10:47:21,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-02-02 10:47:21,692 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:47:21,692 INFO L351 BasicCegarLoop]: trace histogram [9, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:47:21,692 INFO L371 AbstractCegarLoop]: === Iteration 18 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 10:47:21,692 INFO L82 PathProgramCache]: Analyzing trace with hash -650725212, now seen corresponding path program 8 times [2018-02-02 10:47:21,693 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:47:21,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:47:21,704 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:47:21,787 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 0 proven. 128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:47:21,787 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:47:21,787 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-02 10:47:21,788 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:47:21,788 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:47:21,788 INFO L182 omatonBuilderFactory]: Interpolants [2992#(<= (+ entry_point_~i~1 7) entry_point_~len~0), 2993#(<= (+ entry_point_~i~1 6) entry_point_~len~0), 2994#(<= (+ entry_point_~i~1 5) entry_point_~len~0), 2995#(<= (+ entry_point_~i~1 4) entry_point_~len~0), 2996#(<= (+ entry_point_~i~1 3) entry_point_~len~0), 2997#(<= (+ entry_point_~i~1 2) entry_point_~len~0), 2986#true, 2987#false, 2988#(<= 10 entry_point_~len~0), 2989#(and (<= 10 entry_point_~len~0) (= entry_point_~i~1 0)), 2990#(<= (+ entry_point_~i~1 9) entry_point_~len~0), 2991#(<= (+ entry_point_~i~1 8) entry_point_~len~0)] [2018-02-02 10:47:21,788 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 0 proven. 128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:47:21,788 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-02 10:47:21,789 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-02 10:47:21,789 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2018-02-02 10:47:21,789 INFO L87 Difference]: Start difference. First operand 104 states and 113 transitions. Second operand 12 states. [2018-02-02 10:47:21,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:47:21,884 INFO L93 Difference]: Finished difference Result 110 states and 119 transitions. [2018-02-02 10:47:21,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-02 10:47:21,891 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 62 [2018-02-02 10:47:21,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:47:21,892 INFO L225 Difference]: With dead ends: 110 [2018-02-02 10:47:21,892 INFO L226 Difference]: Without dead ends: 110 [2018-02-02 10:47:21,892 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=154, Invalid=226, Unknown=0, NotChecked=0, Total=380 [2018-02-02 10:47:21,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-02-02 10:47:21,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 108. [2018-02-02 10:47:21,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-02-02 10:47:21,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 117 transitions. [2018-02-02 10:47:21,896 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 117 transitions. Word has length 62 [2018-02-02 10:47:21,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:47:21,896 INFO L432 AbstractCegarLoop]: Abstraction has 108 states and 117 transitions. [2018-02-02 10:47:21,896 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-02 10:47:21,896 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 117 transitions. [2018-02-02 10:47:21,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-02-02 10:47:21,897 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:47:21,897 INFO L351 BasicCegarLoop]: trace histogram [10, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:47:21,897 INFO L371 AbstractCegarLoop]: === Iteration 19 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 10:47:21,897 INFO L82 PathProgramCache]: Analyzing trace with hash 1868509421, now seen corresponding path program 9 times [2018-02-02 10:47:21,899 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:47:21,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:47:21,910 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:47:22,006 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 0 proven. 162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:47:22,006 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:47:22,007 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-02-02 10:47:22,007 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:47:22,007 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:47:22,007 INFO L182 omatonBuilderFactory]: Interpolants [3232#true, 3233#false, 3234#(<= 10 entry_point_~len~0), 3235#(and (<= 10 entry_point_~len~0) (= entry_point_~i~1 0)), 3236#(<= (+ entry_point_~i~1 9) entry_point_~len~0), 3237#(<= (+ entry_point_~i~1 8) entry_point_~len~0), 3238#(<= (+ entry_point_~i~1 7) entry_point_~len~0), 3239#(<= (+ entry_point_~i~1 6) entry_point_~len~0), 3240#(<= (+ entry_point_~i~1 5) entry_point_~len~0), 3241#(<= (+ entry_point_~i~1 4) entry_point_~len~0), 3242#(<= (+ entry_point_~i~1 3) entry_point_~len~0), 3243#(<= (+ entry_point_~i~1 2) entry_point_~len~0), 3244#(<= (+ entry_point_~i~1 1) entry_point_~len~0)] [2018-02-02 10:47:22,007 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 0 proven. 162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:47:22,007 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-02 10:47:22,008 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-02 10:47:22,008 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2018-02-02 10:47:22,008 INFO L87 Difference]: Start difference. First operand 108 states and 117 transitions. Second operand 13 states. [2018-02-02 10:47:22,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:47:22,118 INFO L93 Difference]: Finished difference Result 112 states and 121 transitions. [2018-02-02 10:47:22,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-02 10:47:22,118 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 66 [2018-02-02 10:47:22,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:47:22,119 INFO L225 Difference]: With dead ends: 112 [2018-02-02 10:47:22,119 INFO L226 Difference]: Without dead ends: 112 [2018-02-02 10:47:22,119 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=186, Invalid=276, Unknown=0, NotChecked=0, Total=462 [2018-02-02 10:47:22,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-02-02 10:47:22,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2018-02-02 10:47:22,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-02-02 10:47:22,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 121 transitions. [2018-02-02 10:47:22,122 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 121 transitions. Word has length 66 [2018-02-02 10:47:22,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:47:22,123 INFO L432 AbstractCegarLoop]: Abstraction has 112 states and 121 transitions. [2018-02-02 10:47:22,123 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-02 10:47:22,123 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 121 transitions. [2018-02-02 10:47:22,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-02-02 10:47:22,123 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:47:22,124 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:47:22,124 INFO L371 AbstractCegarLoop]: === Iteration 20 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 10:47:22,124 INFO L82 PathProgramCache]: Analyzing trace with hash 1351638198, now seen corresponding path program 10 times [2018-02-02 10:47:22,125 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:47:22,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:47:22,136 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:47:22,167 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2018-02-02 10:47:22,167 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:47:22,168 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 10:47:22,168 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:47:22,168 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:47:22,168 INFO L182 omatonBuilderFactory]: Interpolants [3488#false, 3489#(<= 10 entry_point_~len~0), 3490#(and (= alloc_17_~i~0 0) (<= |alloc_17_#in~len| alloc_17_~len)), 3491#(<= |alloc_17_#in~len| 0), 3487#true] [2018-02-02 10:47:22,168 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2018-02-02 10:47:22,168 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 10:47:22,168 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 10:47:22,169 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:47:22,169 INFO L87 Difference]: Start difference. First operand 112 states and 121 transitions. Second operand 5 states. [2018-02-02 10:47:22,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:47:22,198 INFO L93 Difference]: Finished difference Result 137 states and 147 transitions. [2018-02-02 10:47:22,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 10:47:22,199 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 70 [2018-02-02 10:47:22,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:47:22,199 INFO L225 Difference]: With dead ends: 137 [2018-02-02 10:47:22,199 INFO L226 Difference]: Without dead ends: 134 [2018-02-02 10:47:22,199 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:47:22,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-02-02 10:47:22,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 111. [2018-02-02 10:47:22,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-02-02 10:47:22,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 119 transitions. [2018-02-02 10:47:22,202 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 119 transitions. Word has length 70 [2018-02-02 10:47:22,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:47:22,203 INFO L432 AbstractCegarLoop]: Abstraction has 111 states and 119 transitions. [2018-02-02 10:47:22,203 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 10:47:22,203 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 119 transitions. [2018-02-02 10:47:22,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-02-02 10:47:22,203 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:47:22,203 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:47:22,203 INFO L371 AbstractCegarLoop]: === Iteration 21 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 10:47:22,204 INFO L82 PathProgramCache]: Analyzing trace with hash 1434451296, now seen corresponding path program 1 times [2018-02-02 10:47:22,204 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:47:22,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:47:22,222 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:47:22,233 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.UnsupportedOperationException: Unknown lemma type! at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.walkLeafNode(Interpolator.java:299) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.access$1(Interpolator.java:263) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator$ProofTreeWalker.walk(Interpolator.java:132) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:122) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:113) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.interpolate(Interpolator.java:220) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.getInterpolants(Interpolator.java:201) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.getInterpolants(SMTInterpol.java:915) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.managedscript.ManagedScript.getInterpolants(ManagedScript.java:192) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.computeCraigInterpolants(NestedInterpolantsBuilder.java:281) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.(NestedInterpolantsBuilder.java:164) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsTree(InterpolatingTraceCheckCraig.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolants(InterpolatingTraceCheckCraig.java:199) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:106) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructCraig(TraceCheckConstructor.java:222) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.FixedTraceAbstractionRefinementStrategy.getTraceCheck(FixedTraceAbstractionRefinementStrategy.java:131) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:231) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:205) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:397) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:381) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:316) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:292) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:147) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:115) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:119) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:324) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.runToolchainDefault(DefaultToolchainJob.java:221) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.BasicToolchainJob.run(BasicToolchainJob.java:134) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-02-02 10:47:22,236 INFO L168 Benchmark]: Toolchain (without parser) took 4496.58 ms. Allocated memory was 398.5 MB in the beginning and 668.5 MB in the end (delta: 270.0 MB). Free memory was 355.3 MB in the beginning and 450.0 MB in the end (delta: -94.6 MB). Peak memory consumption was 175.4 MB. Max. memory is 5.3 GB. [2018-02-02 10:47:22,237 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 398.5 MB. Free memory is still 362.0 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-02 10:47:22,237 INFO L168 Benchmark]: CACSL2BoogieTranslator took 166.92 ms. Allocated memory is still 398.5 MB. Free memory was 355.3 MB in the beginning and 342.1 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:47:22,237 INFO L168 Benchmark]: Boogie Preprocessor took 32.04 ms. Allocated memory is still 398.5 MB. Free memory was 342.1 MB in the beginning and 340.8 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-02-02 10:47:22,238 INFO L168 Benchmark]: RCFGBuilder took 263.38 ms. Allocated memory is still 398.5 MB. Free memory was 340.8 MB in the beginning and 318.8 MB in the end (delta: 22.0 MB). Peak memory consumption was 22.0 MB. Max. memory is 5.3 GB. [2018-02-02 10:47:22,238 INFO L168 Benchmark]: TraceAbstraction took 4028.84 ms. Allocated memory was 398.5 MB in the beginning and 668.5 MB in the end (delta: 270.0 MB). Free memory was 318.8 MB in the beginning and 450.0 MB in the end (delta: -131.2 MB). Peak memory consumption was 138.8 MB. Max. memory is 5.3 GB. [2018-02-02 10:47:22,239 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.16 ms. Allocated memory is still 398.5 MB. Free memory is still 362.0 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 166.92 ms. Allocated memory is still 398.5 MB. Free memory was 355.3 MB in the beginning and 342.1 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 32.04 ms. Allocated memory is still 398.5 MB. Free memory was 342.1 MB in the beginning and 340.8 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 263.38 ms. Allocated memory is still 398.5 MB. Free memory was 340.8 MB in the beginning and 318.8 MB in the end (delta: 22.0 MB). Peak memory consumption was 22.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 4028.84 ms. Allocated memory was 398.5 MB in the beginning and 668.5 MB in the end (delta: 270.0 MB). Free memory was 318.8 MB in the beginning and 450.0 MB in the end (delta: -131.2 MB). Peak memory consumption was 138.8 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: UnsupportedOperationException: Unknown lemma type! de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: UnsupportedOperationException: Unknown lemma type!: de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.walkLeafNode(Interpolator.java:299) RESULT: Ultimate could not prove your program: Toolchain returned no result. Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test17_3_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-02_10-47-22-246.csv Received shutdown request...