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/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test17_2_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-24 12:28:21,583 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-24 12:28:21,585 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-24 12:28:21,599 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-24 12:28:21,599 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-24 12:28:21,600 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-24 12:28:21,602 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-24 12:28:21,603 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-24 12:28:21,605 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-24 12:28:21,606 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-24 12:28:21,606 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-24 12:28:21,606 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-24 12:28:21,607 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-24 12:28:21,608 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-24 12:28:21,609 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-24 12:28:21,611 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-24 12:28:21,613 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-24 12:28:21,615 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-24 12:28:21,617 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-24 12:28:21,618 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-24 12:28:21,620 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-24 12:28:21,620 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-24 12:28:21,620 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-24 12:28:21,621 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-24 12:28:21,622 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-24 12:28:21,624 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-24 12:28:21,624 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-24 12:28:21,625 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-24 12:28:21,625 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-24 12:28:21,625 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-24 12:28:21,626 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-24 12:28:21,626 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ.epf [2018-01-24 12:28:21,636 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-24 12:28:21,636 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-24 12:28:21,637 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-24 12:28:21,637 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-24 12:28:21,637 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-24 12:28:21,637 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-24 12:28:21,637 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-24 12:28:21,638 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-24 12:28:21,638 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-24 12:28:21,638 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-24 12:28:21,639 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-24 12:28:21,639 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-24 12:28:21,639 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-24 12:28:21,639 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-24 12:28:21,639 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-24 12:28:21,640 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-24 12:28:21,640 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-24 12:28:21,640 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-24 12:28:21,640 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-24 12:28:21,640 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-24 12:28:21,641 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-24 12:28:21,641 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-24 12:28:21,641 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-24 12:28:21,641 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 12:28:21,641 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-24 12:28:21,641 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-24 12:28:21,642 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-24 12:28:21,642 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-24 12:28:21,642 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-24 12:28:21,642 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-24 12:28:21,642 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-24 12:28:21,643 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-24 12:28:21,643 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-24 12:28:21,644 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-24 12:28:21,679 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-24 12:28:21,692 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-24 12:28:21,696 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-24 12:28:21,698 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-24 12:28:21,699 INFO L276 PluginConnector]: CDTParser initialized [2018-01-24 12:28:21,699 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test17_2_true-valid-memsafety_true-termination.i [2018-01-24 12:28:21,907 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-24 12:28:21,912 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-24 12:28:21,913 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-24 12:28:21,913 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-24 12:28:21,919 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-24 12:28:21,920 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 12:28:21" (1/1) ... [2018-01-24 12:28:21,922 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@43c0846 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:28:21, skipping insertion in model container [2018-01-24 12:28:21,923 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 12:28:21" (1/1) ... [2018-01-24 12:28:21,936 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 12:28:21,983 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 12:28:22,106 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 12:28:22,126 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 12:28:22,136 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:28:22 WrapperNode [2018-01-24 12:28:22,137 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-24 12:28:22,137 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-24 12:28:22,138 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-24 12:28:22,138 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-24 12:28:22,155 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:28:22" (1/1) ... [2018-01-24 12:28:22,155 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:28:22" (1/1) ... [2018-01-24 12:28:22,166 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:28:22" (1/1) ... [2018-01-24 12:28:22,166 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:28:22" (1/1) ... [2018-01-24 12:28:22,170 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:28:22" (1/1) ... [2018-01-24 12:28:22,174 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:28:22" (1/1) ... [2018-01-24 12:28:22,175 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:28:22" (1/1) ... [2018-01-24 12:28:22,177 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-24 12:28:22,177 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-24 12:28:22,177 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-24 12:28:22,177 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-24 12:28:22,182 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:28:22" (1/1) ... No working directory specified, using /storage/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-01-24 12:28:22,231 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-24 12:28:22,231 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-24 12:28:22,231 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_positive [2018-01-24 12:28:22,231 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-01-24 12:28:22,231 INFO L136 BoogieDeclarations]: Found implementation of procedure alloc_17 [2018-01-24 12:28:22,231 INFO L136 BoogieDeclarations]: Found implementation of procedure free_17 [2018-01-24 12:28:22,231 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-01-24 12:28:22,232 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-24 12:28:22,232 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-24 12:28:22,232 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-24 12:28:22,232 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-24 12:28:22,232 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-24 12:28:22,232 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-24 12:28:22,233 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-24 12:28:22,233 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-24 12:28:22,233 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-24 12:28:22,233 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_positive [2018-01-24 12:28:22,233 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-01-24 12:28:22,233 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2018-01-24 12:28:22,234 INFO L128 BoogieDeclarations]: Found specification of procedure alloc_17 [2018-01-24 12:28:22,234 INFO L128 BoogieDeclarations]: Found specification of procedure free_17 [2018-01-24 12:28:22,234 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-01-24 12:28:22,234 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-24 12:28:22,234 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-24 12:28:22,234 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-24 12:28:22,513 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-24 12:28:22,514 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 12:28:22 BoogieIcfgContainer [2018-01-24 12:28:22,514 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-24 12:28:22,515 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-24 12:28:22,515 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-24 12:28:22,517 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-24 12:28:22,517 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.01 12:28:21" (1/3) ... [2018-01-24 12:28:22,519 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@300ce48f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 12:28:22, skipping insertion in model container [2018-01-24 12:28:22,519 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:28:22" (2/3) ... [2018-01-24 12:28:22,519 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@300ce48f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 12:28:22, skipping insertion in model container [2018-01-24 12:28:22,519 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 12:28:22" (3/3) ... [2018-01-24 12:28:22,521 INFO L105 eAbstractionObserver]: Analyzing ICFG memleaks_test17_2_true-valid-memsafety_true-termination.i [2018-01-24 12:28:22,531 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-24 12:28:22,538 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 17 error locations. [2018-01-24 12:28:22,581 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-24 12:28:22,582 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-24 12:28:22,582 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-24 12:28:22,582 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-24 12:28:22,582 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-24 12:28:22,582 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-24 12:28:22,583 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-24 12:28:22,583 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-24 12:28:22,584 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-24 12:28:22,606 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states. [2018-01-24 12:28:22,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-24 12:28:22,613 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:28:22,614 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:28:22,615 INFO L371 AbstractCegarLoop]: === Iteration 1 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-24 12:28:22,620 INFO L82 PathProgramCache]: Analyzing trace with hash 280514151, now seen corresponding path program 1 times [2018-01-24 12:28:22,622 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:28:22,623 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:28:22,678 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:28:22,678 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:28:22,678 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:28:22,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:28:22,740 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:28:22,851 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:28:22,854 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:28:22,854 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-24 12:28:22,856 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-24 12:28:22,941 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-24 12:28:22,942 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 12:28:22,944 INFO L87 Difference]: Start difference. First operand 82 states. Second operand 3 states. [2018-01-24 12:28:23,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:28:23,144 INFO L93 Difference]: Finished difference Result 193 states and 234 transitions. [2018-01-24 12:28:23,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-24 12:28:23,146 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-01-24 12:28:23,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:28:23,156 INFO L225 Difference]: With dead ends: 193 [2018-01-24 12:28:23,157 INFO L226 Difference]: Without dead ends: 127 [2018-01-24 12:28:23,160 INFO L525 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-01-24 12:28:23,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-01-24 12:28:23,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 83. [2018-01-24 12:28:23,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-01-24 12:28:23,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 92 transitions. [2018-01-24 12:28:23,203 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 92 transitions. Word has length 23 [2018-01-24 12:28:23,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:28:23,204 INFO L432 AbstractCegarLoop]: Abstraction has 83 states and 92 transitions. [2018-01-24 12:28:23,204 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-24 12:28:23,204 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 92 transitions. [2018-01-24 12:28:23,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-24 12:28:23,206 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:28:23,206 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:28:23,206 INFO L371 AbstractCegarLoop]: === Iteration 2 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-24 12:28:23,206 INFO L82 PathProgramCache]: Analyzing trace with hash 279746761, now seen corresponding path program 1 times [2018-01-24 12:28:23,206 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:28:23,207 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:28:23,208 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:28:23,209 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:28:23,209 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:28:23,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:28:23,227 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:28:23,296 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:28:23,296 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:28:23,297 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 12:28:23,298 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 12:28:23,299 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 12:28:23,299 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 12:28:23,299 INFO L87 Difference]: Start difference. First operand 83 states and 92 transitions. Second operand 5 states. [2018-01-24 12:28:23,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:28:23,328 INFO L93 Difference]: Finished difference Result 150 states and 164 transitions. [2018-01-24 12:28:23,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 12:28:23,329 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2018-01-24 12:28:23,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:28:23,331 INFO L225 Difference]: With dead ends: 150 [2018-01-24 12:28:23,331 INFO L226 Difference]: Without dead ends: 83 [2018-01-24 12:28:23,332 INFO L525 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-01-24 12:28:23,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-01-24 12:28:23,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 81. [2018-01-24 12:28:23,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-01-24 12:28:23,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 89 transitions. [2018-01-24 12:28:23,343 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 89 transitions. Word has length 23 [2018-01-24 12:28:23,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:28:23,344 INFO L432 AbstractCegarLoop]: Abstraction has 81 states and 89 transitions. [2018-01-24 12:28:23,344 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 12:28:23,344 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 89 transitions. [2018-01-24 12:28:23,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-24 12:28:23,345 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:28:23,345 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:28:23,345 INFO L371 AbstractCegarLoop]: === Iteration 3 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-24 12:28:23,345 INFO L82 PathProgramCache]: Analyzing trace with hash -1161746679, now seen corresponding path program 1 times [2018-01-24 12:28:23,346 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:28:23,346 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:28:23,347 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:28:23,348 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:28:23,348 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:28:23,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:28:23,369 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:28:23,416 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:28:23,416 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:28:23,416 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-24 12:28:23,417 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 12:28:23,417 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 12:28:23,417 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 12:28:23,417 INFO L87 Difference]: Start difference. First operand 81 states and 89 transitions. Second operand 6 states. [2018-01-24 12:28:23,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:28:23,495 INFO L93 Difference]: Finished difference Result 85 states and 92 transitions. [2018-01-24 12:28:23,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 12:28:23,496 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2018-01-24 12:28:23,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:28:23,497 INFO L225 Difference]: With dead ends: 85 [2018-01-24 12:28:23,497 INFO L226 Difference]: Without dead ends: 81 [2018-01-24 12:28:23,498 INFO L525 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-01-24 12:28:23,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-01-24 12:28:23,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2018-01-24 12:28:23,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-01-24 12:28:23,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 88 transitions. [2018-01-24 12:28:23,507 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 88 transitions. Word has length 25 [2018-01-24 12:28:23,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:28:23,508 INFO L432 AbstractCegarLoop]: Abstraction has 81 states and 88 transitions. [2018-01-24 12:28:23,508 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 12:28:23,508 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 88 transitions. [2018-01-24 12:28:23,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-24 12:28:23,509 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:28:23,509 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:28:23,509 INFO L371 AbstractCegarLoop]: === Iteration 4 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-24 12:28:23,509 INFO L82 PathProgramCache]: Analyzing trace with hash -1162514069, now seen corresponding path program 1 times [2018-01-24 12:28:23,509 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:28:23,510 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:28:23,511 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:28:23,511 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:28:23,511 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:28:23,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:28:23,527 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:28:23,583 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:28:23,584 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:28:23,584 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 12:28:23,584 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 12:28:23,584 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 12:28:23,584 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 12:28:23,585 INFO L87 Difference]: Start difference. First operand 81 states and 88 transitions. Second operand 6 states. [2018-01-24 12:28:23,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:28:23,736 INFO L93 Difference]: Finished difference Result 81 states and 88 transitions. [2018-01-24 12:28:23,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 12:28:23,736 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2018-01-24 12:28:23,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:28:23,738 INFO L225 Difference]: With dead ends: 81 [2018-01-24 12:28:23,738 INFO L226 Difference]: Without dead ends: 80 [2018-01-24 12:28:23,738 INFO L525 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-01-24 12:28:23,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-01-24 12:28:23,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2018-01-24 12:28:23,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-01-24 12:28:23,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 87 transitions. [2018-01-24 12:28:23,747 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 87 transitions. Word has length 25 [2018-01-24 12:28:23,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:28:23,748 INFO L432 AbstractCegarLoop]: Abstraction has 80 states and 87 transitions. [2018-01-24 12:28:23,748 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 12:28:23,748 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 87 transitions. [2018-01-24 12:28:23,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-24 12:28:23,749 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:28:23,749 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:28:23,749 INFO L371 AbstractCegarLoop]: === Iteration 5 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-24 12:28:23,749 INFO L82 PathProgramCache]: Analyzing trace with hash -1162514068, now seen corresponding path program 1 times [2018-01-24 12:28:23,750 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:28:23,750 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:28:23,751 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:28:23,752 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:28:23,752 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:28:23,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:28:23,780 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:28:24,091 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:28:24,092 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:28:24,092 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-01-24 12:28:24,092 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-24 12:28:24,093 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-24 12:28:24,093 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2018-01-24 12:28:24,093 INFO L87 Difference]: Start difference. First operand 80 states and 87 transitions. Second operand 11 states. [2018-01-24 12:28:24,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:28:24,345 INFO L93 Difference]: Finished difference Result 144 states and 156 transitions. [2018-01-24 12:28:24,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-24 12:28:24,345 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 25 [2018-01-24 12:28:24,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:28:24,347 INFO L225 Difference]: With dead ends: 144 [2018-01-24 12:28:24,347 INFO L226 Difference]: Without dead ends: 84 [2018-01-24 12:28:24,348 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2018-01-24 12:28:24,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-01-24 12:28:24,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 83. [2018-01-24 12:28:24,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-01-24 12:28:24,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 90 transitions. [2018-01-24 12:28:24,356 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 90 transitions. Word has length 25 [2018-01-24 12:28:24,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:28:24,357 INFO L432 AbstractCegarLoop]: Abstraction has 83 states and 90 transitions. [2018-01-24 12:28:24,357 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-24 12:28:24,357 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 90 transitions. [2018-01-24 12:28:24,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-01-24 12:28:24,358 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:28:24,358 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:28:24,359 INFO L371 AbstractCegarLoop]: === Iteration 6 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-24 12:28:24,359 INFO L82 PathProgramCache]: Analyzing trace with hash -1767740413, now seen corresponding path program 1 times [2018-01-24 12:28:24,359 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:28:24,359 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:28:24,361 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:28:24,361 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:28:24,361 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:28:24,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:28:24,379 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:28:24,654 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:28:24,655 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:28:24,655 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 12:28:24,664 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:28:24,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:28:24,699 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:28:24,753 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 16 [2018-01-24 12:28:24,754 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:28:24,766 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-01-24 12:28:24,767 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:28:24,776 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 12:28:24,777 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:36 [2018-01-24 12:28:25,083 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:28:25,113 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 12:28:25,113 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 19 [2018-01-24 12:28:25,114 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-01-24 12:28:25,114 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-01-24 12:28:25,114 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=318, Unknown=0, NotChecked=0, Total=380 [2018-01-24 12:28:25,114 INFO L87 Difference]: Start difference. First operand 83 states and 90 transitions. Second operand 20 states. [2018-01-24 12:28:27,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:28:27,998 INFO L93 Difference]: Finished difference Result 84 states and 91 transitions. [2018-01-24 12:28:27,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-24 12:28:27,999 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 29 [2018-01-24 12:28:27,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:28:28,000 INFO L225 Difference]: With dead ends: 84 [2018-01-24 12:28:28,000 INFO L226 Difference]: Without dead ends: 83 [2018-01-24 12:28:28,001 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 19 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=87, Invalid=419, Unknown=0, NotChecked=0, Total=506 [2018-01-24 12:28:28,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-01-24 12:28:28,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 81. [2018-01-24 12:28:28,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-01-24 12:28:28,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 88 transitions. [2018-01-24 12:28:28,010 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 88 transitions. Word has length 29 [2018-01-24 12:28:28,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:28:28,011 INFO L432 AbstractCegarLoop]: Abstraction has 81 states and 88 transitions. [2018-01-24 12:28:28,011 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-01-24 12:28:28,011 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 88 transitions. [2018-01-24 12:28:28,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-01-24 12:28:28,012 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:28:28,012 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:28:28,013 INFO L371 AbstractCegarLoop]: === Iteration 7 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-24 12:28:28,013 INFO L82 PathProgramCache]: Analyzing trace with hash 1224527730, now seen corresponding path program 1 times [2018-01-24 12:28:28,013 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:28:28,013 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:28:28,014 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:28:28,015 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:28:28,015 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:28:28,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:28:28,031 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:28:28,089 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-01-24 12:28:28,089 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:28:28,089 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 12:28:28,089 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 12:28:28,090 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 12:28:28,090 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 12:28:28,090 INFO L87 Difference]: Start difference. First operand 81 states and 88 transitions. Second operand 5 states. [2018-01-24 12:28:28,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:28:28,111 INFO L93 Difference]: Finished difference Result 142 states and 154 transitions. [2018-01-24 12:28:28,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 12:28:28,112 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2018-01-24 12:28:28,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:28:28,113 INFO L225 Difference]: With dead ends: 142 [2018-01-24 12:28:28,113 INFO L226 Difference]: Without dead ends: 85 [2018-01-24 12:28:28,114 INFO L525 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-01-24 12:28:28,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-01-24 12:28:28,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 83. [2018-01-24 12:28:28,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-01-24 12:28:28,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 90 transitions. [2018-01-24 12:28:28,124 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 90 transitions. Word has length 40 [2018-01-24 12:28:28,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:28:28,124 INFO L432 AbstractCegarLoop]: Abstraction has 83 states and 90 transitions. [2018-01-24 12:28:28,124 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 12:28:28,124 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 90 transitions. [2018-01-24 12:28:28,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-01-24 12:28:28,126 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:28:28,126 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:28:28,126 INFO L371 AbstractCegarLoop]: === Iteration 8 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-24 12:28:28,127 INFO L82 PathProgramCache]: Analyzing trace with hash 755727615, now seen corresponding path program 1 times [2018-01-24 12:28:28,127 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:28:28,127 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:28:28,128 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:28:28,128 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:28:28,128 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:28:28,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:28:28,142 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:28:28,209 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:28:28,209 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:28:28,209 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 12:28:28,210 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 12:28:28,210 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 12:28:28,210 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 12:28:28,210 INFO L87 Difference]: Start difference. First operand 83 states and 90 transitions. Second operand 6 states. [2018-01-24 12:28:28,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:28:28,397 INFO L93 Difference]: Finished difference Result 128 states and 142 transitions. [2018-01-24 12:28:28,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-24 12:28:28,397 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 41 [2018-01-24 12:28:28,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:28:28,399 INFO L225 Difference]: With dead ends: 128 [2018-01-24 12:28:28,399 INFO L226 Difference]: Without dead ends: 126 [2018-01-24 12:28:28,399 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-01-24 12:28:28,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-01-24 12:28:28,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 108. [2018-01-24 12:28:28,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-01-24 12:28:28,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 124 transitions. [2018-01-24 12:28:28,412 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 124 transitions. Word has length 41 [2018-01-24 12:28:28,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:28:28,412 INFO L432 AbstractCegarLoop]: Abstraction has 108 states and 124 transitions. [2018-01-24 12:28:28,412 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 12:28:28,412 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 124 transitions. [2018-01-24 12:28:28,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-01-24 12:28:28,414 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:28:28,414 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:28:28,415 INFO L371 AbstractCegarLoop]: === Iteration 9 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-24 12:28:28,415 INFO L82 PathProgramCache]: Analyzing trace with hash 755727616, now seen corresponding path program 1 times [2018-01-24 12:28:28,415 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:28:28,415 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:28:28,416 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:28:28,417 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:28:28,417 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:28:28,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:28:28,431 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:28:28,528 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:28:28,528 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:28:28,528 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-01-24 12:28:28,528 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-24 12:28:28,529 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-24 12:28:28,529 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-01-24 12:28:28,529 INFO L87 Difference]: Start difference. First operand 108 states and 124 transitions. Second operand 10 states. [2018-01-24 12:28:28,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:28:28,626 INFO L93 Difference]: Finished difference Result 161 states and 183 transitions. [2018-01-24 12:28:28,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-24 12:28:28,626 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 41 [2018-01-24 12:28:28,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:28:28,627 INFO L225 Difference]: With dead ends: 161 [2018-01-24 12:28:28,627 INFO L226 Difference]: Without dead ends: 130 [2018-01-24 12:28:28,628 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2018-01-24 12:28:28,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-01-24 12:28:28,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 106. [2018-01-24 12:28:28,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-01-24 12:28:28,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 120 transitions. [2018-01-24 12:28:28,637 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 120 transitions. Word has length 41 [2018-01-24 12:28:28,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:28:28,637 INFO L432 AbstractCegarLoop]: Abstraction has 106 states and 120 transitions. [2018-01-24 12:28:28,637 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-24 12:28:28,637 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 120 transitions. [2018-01-24 12:28:28,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-01-24 12:28:28,638 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:28:28,638 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:28:28,638 INFO L371 AbstractCegarLoop]: === Iteration 10 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-24 12:28:28,638 INFO L82 PathProgramCache]: Analyzing trace with hash 1441386836, now seen corresponding path program 1 times [2018-01-24 12:28:28,639 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:28:28,639 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:28:28,640 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:28:28,640 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:28:28,640 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:28:28,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:28:28,657 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:28:28,790 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-24 12:28:28,791 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:28:28,791 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 12:28:28,796 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:28:28,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:28:28,835 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:28:28,851 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-24 12:28:28,852 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:28:28,859 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:28:28,859 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-24 12:28:28,924 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:28:28,925 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:28:28,927 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-01-24 12:28:28,928 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:28:28,935 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 12:28:28,936 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:15 [2018-01-24 12:28:28,960 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-24 12:28:28,979 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 12:28:28,979 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 12 [2018-01-24 12:28:28,980 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-01-24 12:28:28,980 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-01-24 12:28:28,980 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2018-01-24 12:28:28,980 INFO L87 Difference]: Start difference. First operand 106 states and 120 transitions. Second operand 13 states. [2018-01-24 12:28:29,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:28:29,571 INFO L93 Difference]: Finished difference Result 153 states and 179 transitions. [2018-01-24 12:28:29,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-01-24 12:28:29,571 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 42 [2018-01-24 12:28:29,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:28:29,574 INFO L225 Difference]: With dead ends: 153 [2018-01-24 12:28:29,574 INFO L226 Difference]: Without dead ends: 150 [2018-01-24 12:28:29,574 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 39 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=77, Invalid=343, Unknown=0, NotChecked=0, Total=420 [2018-01-24 12:28:29,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-01-24 12:28:29,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 111. [2018-01-24 12:28:29,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-01-24 12:28:29,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 128 transitions. [2018-01-24 12:28:29,588 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 128 transitions. Word has length 42 [2018-01-24 12:28:29,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:28:29,588 INFO L432 AbstractCegarLoop]: Abstraction has 111 states and 128 transitions. [2018-01-24 12:28:29,589 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-01-24 12:28:29,589 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 128 transitions. [2018-01-24 12:28:29,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-01-24 12:28:29,590 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:28:29,590 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:28:29,590 INFO L371 AbstractCegarLoop]: === Iteration 11 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-24 12:28:29,590 INFO L82 PathProgramCache]: Analyzing trace with hash 1441386837, now seen corresponding path program 1 times [2018-01-24 12:28:29,590 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:28:29,590 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:28:29,592 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:28:29,592 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:28:29,592 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:28:29,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:28:29,606 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:28:29,918 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:28:29,918 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:28:29,919 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 12:28:29,924 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:28:29,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:28:29,948 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:28:29,961 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2018-01-24 12:28:29,961 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:28:29,993 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-01-24 12:28:29,994 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:28:30,009 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2018-01-24 12:28:30,009 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 12:28:30,011 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2018-01-24 12:28:30,012 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 12:28:30,035 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-01-24 12:28:30,036 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:44, output treesize:40 [2018-01-24 12:28:30,578 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:28:30,579 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:28:30,581 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 64 [2018-01-24 12:28:30,581 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:28:30,638 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:28:30,639 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:28:30,639 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 44 [2018-01-24 12:28:30,640 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:28:30,672 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:28:30,673 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 52 [2018-01-24 12:28:30,674 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 12:28:30,704 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:28:30,705 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:28:30,705 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 42 [2018-01-24 12:28:30,706 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 12:28:30,737 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 4 dim-1 vars, End of recursive call: 6 dim-0 vars, and 2 xjuncts. [2018-01-24 12:28:30,737 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 10 variables, input treesize:101, output treesize:83 [2018-01-24 12:28:30,835 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:28:30,869 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 12:28:30,869 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 22 [2018-01-24 12:28:30,870 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-01-24 12:28:30,870 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-01-24 12:28:30,870 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=454, Unknown=2, NotChecked=0, Total=506 [2018-01-24 12:28:30,871 INFO L87 Difference]: Start difference. First operand 111 states and 128 transitions. Second operand 23 states. [2018-01-24 12:28:33,161 WARN L146 SmtUtils]: Spent 2080ms on a formula simplification. DAG size of input: 60 DAG size of output 56 [2018-01-24 12:28:37,377 WARN L146 SmtUtils]: Spent 4161ms on a formula simplification. DAG size of input: 77 DAG size of output 72 [2018-01-24 12:28:43,417 WARN L146 SmtUtils]: Spent 5991ms on a formula simplification. DAG size of input: 53 DAG size of output 52 [2018-01-24 12:29:14,096 WARN L146 SmtUtils]: Spent 20594ms on a formula simplification. DAG size of input: 68 DAG size of output 65 Received shutdown request... [2018-01-24 12:29:36,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-01-24 12:29:36,432 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-24 12:29:36,436 WARN L187 ceAbstractionStarter]: Timeout [2018-01-24 12:29:36,436 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.01 12:29:36 BoogieIcfgContainer [2018-01-24 12:29:36,436 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-24 12:29:36,437 INFO L168 Benchmark]: Toolchain (without parser) took 74529.24 ms. Allocated memory was 302.0 MB in the beginning and 546.8 MB in the end (delta: 244.8 MB). Free memory was 260.9 MB in the beginning and 375.4 MB in the end (delta: -114.5 MB). Peak memory consumption was 130.3 MB. Max. memory is 5.3 GB. [2018-01-24 12:29:36,438 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 302.0 MB. Free memory is still 267.9 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-24 12:29:36,438 INFO L168 Benchmark]: CACSL2BoogieTranslator took 224.09 ms. Allocated memory is still 302.0 MB. Free memory was 260.9 MB in the beginning and 246.9 MB in the end (delta: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 5.3 GB. [2018-01-24 12:29:36,439 INFO L168 Benchmark]: Boogie Preprocessor took 39.39 ms. Allocated memory is still 302.0 MB. Free memory was 246.9 MB in the beginning and 245.9 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 5.3 GB. [2018-01-24 12:29:36,439 INFO L168 Benchmark]: RCFGBuilder took 337.02 ms. Allocated memory is still 302.0 MB. Free memory was 244.9 MB in the beginning and 221.9 MB in the end (delta: 23.0 MB). Peak memory consumption was 23.0 MB. Max. memory is 5.3 GB. [2018-01-24 12:29:36,440 INFO L168 Benchmark]: TraceAbstraction took 73921.57 ms. Allocated memory was 302.0 MB in the beginning and 546.8 MB in the end (delta: 244.8 MB). Free memory was 221.9 MB in the beginning and 375.4 MB in the end (delta: -153.5 MB). Peak memory consumption was 91.3 MB. Max. memory is 5.3 GB. [2018-01-24 12:29:36,441 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.20 ms. Allocated memory is still 302.0 MB. Free memory is still 267.9 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 224.09 ms. Allocated memory is still 302.0 MB. Free memory was 260.9 MB in the beginning and 246.9 MB in the end (delta: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 39.39 ms. Allocated memory is still 302.0 MB. Free memory was 246.9 MB in the beginning and 245.9 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 5.3 GB. * RCFGBuilder took 337.02 ms. Allocated memory is still 302.0 MB. Free memory was 244.9 MB in the beginning and 221.9 MB in the end (delta: 23.0 MB). Peak memory consumption was 23.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 73921.57 ms. Allocated memory was 302.0 MB in the beginning and 546.8 MB in the end (delta: 244.8 MB). Free memory was 221.9 MB in the beginning and 375.4 MB in the end (delta: -153.5 MB). Peak memory consumption was 91.3 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1452). Cancelled while BasicCegarLoop was constructing difference of abstraction (111states) and interpolant automaton (currently 17 states, 23 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 72. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1453). Cancelled while BasicCegarLoop was constructing difference of abstraction (111states) and interpolant automaton (currently 17 states, 23 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 72. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1452). Cancelled while BasicCegarLoop was constructing difference of abstraction (111states) and interpolant automaton (currently 17 states, 23 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 72. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1447). Cancelled while BasicCegarLoop was constructing difference of abstraction (111states) and interpolant automaton (currently 17 states, 23 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 72. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1447). Cancelled while BasicCegarLoop was constructing difference of abstraction (111states) and interpolant automaton (currently 17 states, 23 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 72. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1453). Cancelled while BasicCegarLoop was constructing difference of abstraction (111states) and interpolant automaton (currently 17 states, 23 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 72. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1452). Cancelled while BasicCegarLoop was constructing difference of abstraction (111states) and interpolant automaton (currently 17 states, 23 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 72. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1452). Cancelled while BasicCegarLoop was constructing difference of abstraction (111states) and interpolant automaton (currently 17 states, 23 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 72. - TimeoutResultAtElement [Line: 1480]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 1480). Cancelled while BasicCegarLoop was constructing difference of abstraction (111states) and interpolant automaton (currently 17 states, 23 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 72. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1461). Cancelled while BasicCegarLoop was constructing difference of abstraction (111states) and interpolant automaton (currently 17 states, 23 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 72. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1461). Cancelled while BasicCegarLoop was constructing difference of abstraction (111states) and interpolant automaton (currently 17 states, 23 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 72. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1461). Cancelled while BasicCegarLoop was constructing difference of abstraction (111states) and interpolant automaton (currently 17 states, 23 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 72. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1461). Cancelled while BasicCegarLoop was constructing difference of abstraction (111states) and interpolant automaton (currently 17 states, 23 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 72. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1472). Cancelled while BasicCegarLoop was constructing difference of abstraction (111states) and interpolant automaton (currently 17 states, 23 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 72. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1472). Cancelled while BasicCegarLoop was constructing difference of abstraction (111states) and interpolant automaton (currently 17 states, 23 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 72. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1476). Cancelled while BasicCegarLoop was constructing difference of abstraction (111states) and interpolant automaton (currently 17 states, 23 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 72. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1476). Cancelled while BasicCegarLoop was constructing difference of abstraction (111states) and interpolant automaton (currently 17 states, 23 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 72. - StatisticsResult: Ultimate Automizer benchmark data CFG has 8 procedures, 82 locations, 17 error locations. TIMEOUT Result, 73.8s OverallTime, 11 OverallIterations, 2 TraceHistogramMax, 70.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 824 SDtfs, 633 SDslu, 3971 SDs, 0 SdLazy, 2401 SolverSat, 132 SolverUnsat, 21 SolverUnknown, 0 SolverNotchecked, 11.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 236 GetRequests, 108 SyntacticMatches, 5 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 280 ImplicationChecksByTransitivity, 37.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=111occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 10 MinimizatonAttempts, 132 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.9s InterpolantComputationTime, 469 NumberOfCodeBlocks, 469 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 455 ConstructedInterpolants, 29 QuantifiedInterpolants, 115930 SizeOfPredicates, 17 NumberOfNonLiveVariables, 424 ConjunctsInSsa, 80 ConjunctsInUnsatCore, 14 InterpolantComputations, 8 PerfectInterpolantSequences, 31/48 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test17_2_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-24_12-29-36-451.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test17_2_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-24_12-29-36-451.csv Completed graceful shutdown