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/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test17_2_false-valid-free.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-a74eeac-m [2018-02-02 19:12:36,544 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-02 19:12:36,545 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-02 19:12:36,557 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-02 19:12:36,558 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-02 19:12:36,558 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-02 19:12:36,559 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-02 19:12:36,560 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-02 19:12:36,562 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-02 19:12:36,563 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-02 19:12:36,564 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-02 19:12:36,564 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-02 19:12:36,565 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-02 19:12:36,566 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-02 19:12:36,566 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-02 19:12:36,568 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-02 19:12:36,570 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-02 19:12:36,571 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-02 19:12:36,572 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-02 19:12:36,573 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-02 19:12:36,575 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-02 19:12:36,575 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-02 19:12:36,575 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-02 19:12:36,576 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-02 19:12:36,577 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-02 19:12:36,578 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-02 19:12:36,578 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-02 19:12:36,578 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-02 19:12:36,579 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-02 19:12:36,579 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-02 19:12:36,579 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-02 19:12:36,579 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf [2018-02-02 19:12:36,588 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-02 19:12:36,588 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-02 19:12:36,589 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-02 19:12:36,589 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-02 19:12:36,589 INFO L133 SettingsManager]: * Use SBE=true [2018-02-02 19:12:36,589 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-02 19:12:36,589 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-02 19:12:36,589 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-02 19:12:36,590 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-02 19:12:36,590 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-02 19:12:36,590 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-02 19:12:36,590 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-02 19:12:36,590 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-02 19:12:36,590 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-02 19:12:36,590 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-02 19:12:36,590 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-02 19:12:36,590 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-02 19:12:36,591 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-02 19:12:36,591 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-02 19:12:36,591 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-02 19:12:36,591 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 19:12:36,591 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-02 19:12:36,591 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-02 19:12:36,591 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-02 19:12:36,591 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-02-02 19:12:36,617 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-02 19:12:36,626 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-02 19:12:36,628 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-02 19:12:36,629 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-02 19:12:36,630 INFO L276 PluginConnector]: CDTParser initialized [2018-02-02 19:12:36,630 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test17_2_false-valid-free.i [2018-02-02 19:12:36,763 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-02 19:12:36,764 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-02 19:12:36,765 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-02 19:12:36,765 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-02 19:12:36,769 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-02 19:12:36,770 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 07:12:36" (1/1) ... [2018-02-02 19:12:36,772 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9f4e9ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 07:12:36, skipping insertion in model container [2018-02-02 19:12:36,772 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 07:12:36" (1/1) ... [2018-02-02 19:12:36,782 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 19:12:36,816 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 19:12:36,909 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 19:12:36,927 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 19:12:36,934 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 07:12:36 WrapperNode [2018-02-02 19:12:36,934 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-02 19:12:36,935 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-02 19:12:36,935 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-02 19:12:36,935 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-02 19:12:36,946 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 07:12:36" (1/1) ... [2018-02-02 19:12:36,946 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 07:12:36" (1/1) ... [2018-02-02 19:12:36,955 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 07:12:36" (1/1) ... [2018-02-02 19:12:36,955 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 07:12:36" (1/1) ... [2018-02-02 19:12:36,958 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 07:12:36" (1/1) ... [2018-02-02 19:12:36,961 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 07:12:36" (1/1) ... [2018-02-02 19:12:36,962 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 07:12:36" (1/1) ... [2018-02-02 19:12:36,964 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-02 19:12:36,964 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-02 19:12:36,965 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-02 19:12:36,965 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-02 19:12:36,966 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 07:12:36" (1/1) ... No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 19:12:36,998 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-02 19:12:36,998 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-02 19:12:36,998 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-02-02 19:12:36,998 INFO L136 BoogieDeclarations]: Found implementation of procedure alloc_unsafe_17 [2018-02-02 19:12:36,999 INFO L136 BoogieDeclarations]: Found implementation of procedure free_17 [2018-02-02 19:12:36,999 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-02-02 19:12:36,999 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-02 19:12:36,999 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-02 19:12:36,999 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-02 19:12:36,999 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-02 19:12:36,999 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-02 19:12:37,000 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-02 19:12:37,000 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-02 19:12:37,000 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-02 19:12:37,000 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-02 19:12:37,000 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-02-02 19:12:37,000 INFO L128 BoogieDeclarations]: Found specification of procedure alloc_unsafe_17 [2018-02-02 19:12:37,000 INFO L128 BoogieDeclarations]: Found specification of procedure free_17 [2018-02-02 19:12:37,000 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-02-02 19:12:37,000 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-02 19:12:37,000 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-02 19:12:37,001 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-02 19:12:37,234 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-02 19:12:37,235 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 07:12:37 BoogieIcfgContainer [2018-02-02 19:12:37,235 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-02 19:12:37,235 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-02 19:12:37,236 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-02 19:12:37,237 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-02 19:12:37,237 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.02 07:12:36" (1/3) ... [2018-02-02 19:12:37,238 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29017317 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 07:12:37, skipping insertion in model container [2018-02-02 19:12:37,238 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 07:12:36" (2/3) ... [2018-02-02 19:12:37,238 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29017317 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 07:12:37, skipping insertion in model container [2018-02-02 19:12:37,238 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 07:12:37" (3/3) ... [2018-02-02 19:12:37,239 INFO L107 eAbstractionObserver]: Analyzing ICFG memleaks_test17_2_false-valid-free.i [2018-02-02 19:12:37,244 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-02 19:12:37,250 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 15 error locations. [2018-02-02 19:12:37,279 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-02 19:12:37,279 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-02 19:12:37,279 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-02 19:12:37,279 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-02 19:12:37,279 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-02 19:12:37,280 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-02 19:12:37,280 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-02 19:12:37,280 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-02 19:12:37,280 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-02 19:12:37,292 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states. [2018-02-02 19:12:37,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-02 19:12:37,300 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:12:37,300 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 19:12:37,301 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation, alloc_unsafe_17Err1RequiresViolation, alloc_unsafe_17Err3RequiresViolation, alloc_unsafe_17Err2RequiresViolation, alloc_unsafe_17Err4RequiresViolation, alloc_unsafe_17Err0RequiresViolation, alloc_unsafe_17Err5RequiresViolation]=== [2018-02-02 19:12:37,303 INFO L82 PathProgramCache]: Analyzing trace with hash 1429677520, now seen corresponding path program 1 times [2018-02-02 19:12:37,304 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:12:37,305 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:12:37,339 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:12:37,339 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:12:37,339 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:12:37,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:12:37,376 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:12:37,434 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:12:37,436 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 19:12:37,436 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-02 19:12:37,437 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-02 19:12:37,514 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-02 19:12:37,515 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 19:12:37,517 INFO L87 Difference]: Start difference. First operand 72 states. Second operand 3 states. [2018-02-02 19:12:37,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:12:37,638 INFO L93 Difference]: Finished difference Result 122 states and 142 transitions. [2018-02-02 19:12:37,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-02 19:12:37,640 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-02-02 19:12:37,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:12:37,650 INFO L225 Difference]: With dead ends: 122 [2018-02-02 19:12:37,650 INFO L226 Difference]: Without dead ends: 116 [2018-02-02 19:12:37,652 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 19:12:37,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-02-02 19:12:37,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 73. [2018-02-02 19:12:37,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-02-02 19:12:37,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 81 transitions. [2018-02-02 19:12:37,690 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 81 transitions. Word has length 17 [2018-02-02 19:12:37,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:12:37,691 INFO L432 AbstractCegarLoop]: Abstraction has 73 states and 81 transitions. [2018-02-02 19:12:37,691 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-02 19:12:37,691 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 81 transitions. [2018-02-02 19:12:37,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-02 19:12:37,692 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:12:37,692 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 19:12:37,693 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation, alloc_unsafe_17Err1RequiresViolation, alloc_unsafe_17Err3RequiresViolation, alloc_unsafe_17Err2RequiresViolation, alloc_unsafe_17Err4RequiresViolation, alloc_unsafe_17Err0RequiresViolation, alloc_unsafe_17Err5RequiresViolation]=== [2018-02-02 19:12:37,693 INFO L82 PathProgramCache]: Analyzing trace with hash 1429687667, now seen corresponding path program 1 times [2018-02-02 19:12:37,693 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:12:37,693 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:12:37,695 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:12:37,695 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:12:37,695 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:12:37,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:12:37,707 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:12:37,759 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:12:37,759 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 19:12:37,759 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 19:12:37,760 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 19:12:37,760 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 19:12:37,760 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 19:12:37,760 INFO L87 Difference]: Start difference. First operand 73 states and 81 transitions. Second operand 5 states. [2018-02-02 19:12:37,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:12:37,781 INFO L93 Difference]: Finished difference Result 75 states and 82 transitions. [2018-02-02 19:12:37,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 19:12:37,781 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-02-02 19:12:37,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:12:37,782 INFO L225 Difference]: With dead ends: 75 [2018-02-02 19:12:37,782 INFO L226 Difference]: Without dead ends: 73 [2018-02-02 19:12:37,783 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 19:12:37,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-02-02 19:12:37,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 71. [2018-02-02 19:12:37,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-02-02 19:12:37,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 78 transitions. [2018-02-02 19:12:37,787 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 78 transitions. Word has length 17 [2018-02-02 19:12:37,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:12:37,787 INFO L432 AbstractCegarLoop]: Abstraction has 71 states and 78 transitions. [2018-02-02 19:12:37,787 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 19:12:37,788 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 78 transitions. [2018-02-02 19:12:37,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-02 19:12:37,788 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:12:37,788 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 19:12:37,788 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation, alloc_unsafe_17Err1RequiresViolation, alloc_unsafe_17Err3RequiresViolation, alloc_unsafe_17Err2RequiresViolation, alloc_unsafe_17Err4RequiresViolation, alloc_unsafe_17Err0RequiresViolation, alloc_unsafe_17Err5RequiresViolation]=== [2018-02-02 19:12:37,788 INFO L82 PathProgramCache]: Analyzing trace with hash 1294678610, now seen corresponding path program 1 times [2018-02-02 19:12:37,788 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:12:37,789 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:12:37,790 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:12:37,790 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:12:37,790 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:12:37,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:12:37,805 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:12:37,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-02-02 19:12:37,851 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 19:12:37,851 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 19:12:37,851 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 19:12:37,851 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 19:12:37,851 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 19:12:37,852 INFO L87 Difference]: Start difference. First operand 71 states and 78 transitions. Second operand 6 states. [2018-02-02 19:12:37,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:12:37,888 INFO L93 Difference]: Finished difference Result 71 states and 77 transitions. [2018-02-02 19:12:37,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 19:12:37,888 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-02-02 19:12:37,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:12:37,889 INFO L225 Difference]: With dead ends: 71 [2018-02-02 19:12:37,889 INFO L226 Difference]: Without dead ends: 71 [2018-02-02 19:12:37,890 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-02-02 19:12:37,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-02-02 19:12:37,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2018-02-02 19:12:37,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-02-02 19:12:37,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 77 transitions. [2018-02-02 19:12:37,895 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 77 transitions. Word has length 19 [2018-02-02 19:12:37,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:12:37,895 INFO L432 AbstractCegarLoop]: Abstraction has 71 states and 77 transitions. [2018-02-02 19:12:37,895 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 19:12:37,895 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 77 transitions. [2018-02-02 19:12:37,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-02 19:12:37,896 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:12:37,896 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 19:12:37,896 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation, alloc_unsafe_17Err1RequiresViolation, alloc_unsafe_17Err3RequiresViolation, alloc_unsafe_17Err2RequiresViolation, alloc_unsafe_17Err4RequiresViolation, alloc_unsafe_17Err0RequiresViolation, alloc_unsafe_17Err5RequiresViolation]=== [2018-02-02 19:12:37,896 INFO L82 PathProgramCache]: Analyzing trace with hash 1294688757, now seen corresponding path program 1 times [2018-02-02 19:12:37,896 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:12:37,896 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:12:37,898 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:12:37,898 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:12:37,898 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:12:37,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:12:37,909 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:12:37,950 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:12:37,950 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 19:12:37,950 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 19:12:37,951 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 19:12:37,951 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 19:12:37,951 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 19:12:37,951 INFO L87 Difference]: Start difference. First operand 71 states and 77 transitions. Second operand 6 states. [2018-02-02 19:12:38,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:12:38,009 INFO L93 Difference]: Finished difference Result 70 states and 76 transitions. [2018-02-02 19:12:38,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 19:12:38,010 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-02-02 19:12:38,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:12:38,010 INFO L225 Difference]: With dead ends: 70 [2018-02-02 19:12:38,010 INFO L226 Difference]: Without dead ends: 70 [2018-02-02 19:12:38,011 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-02-02 19:12:38,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-02-02 19:12:38,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2018-02-02 19:12:38,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-02-02 19:12:38,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 76 transitions. [2018-02-02 19:12:38,014 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 76 transitions. Word has length 19 [2018-02-02 19:12:38,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:12:38,014 INFO L432 AbstractCegarLoop]: Abstraction has 70 states and 76 transitions. [2018-02-02 19:12:38,014 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 19:12:38,014 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 76 transitions. [2018-02-02 19:12:38,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-02 19:12:38,014 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:12:38,014 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 19:12:38,014 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation, alloc_unsafe_17Err1RequiresViolation, alloc_unsafe_17Err3RequiresViolation, alloc_unsafe_17Err2RequiresViolation, alloc_unsafe_17Err4RequiresViolation, alloc_unsafe_17Err0RequiresViolation, alloc_unsafe_17Err5RequiresViolation]=== [2018-02-02 19:12:38,015 INFO L82 PathProgramCache]: Analyzing trace with hash 1294688758, now seen corresponding path program 1 times [2018-02-02 19:12:38,015 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:12:38,015 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:12:38,015 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:12:38,016 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:12:38,016 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:12:38,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:12:38,025 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:12:38,180 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:12:38,180 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 19:12:38,180 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-02 19:12:38,181 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 19:12:38,181 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 19:12:38,181 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-02-02 19:12:38,181 INFO L87 Difference]: Start difference. First operand 70 states and 76 transitions. Second operand 9 states. [2018-02-02 19:12:38,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:12:38,382 INFO L93 Difference]: Finished difference Result 74 states and 80 transitions. [2018-02-02 19:12:38,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 19:12:38,382 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 19 [2018-02-02 19:12:38,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:12:38,383 INFO L225 Difference]: With dead ends: 74 [2018-02-02 19:12:38,383 INFO L226 Difference]: Without dead ends: 74 [2018-02-02 19:12:38,383 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2018-02-02 19:12:38,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-02-02 19:12:38,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 73. [2018-02-02 19:12:38,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-02-02 19:12:38,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 79 transitions. [2018-02-02 19:12:38,388 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 79 transitions. Word has length 19 [2018-02-02 19:12:38,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:12:38,388 INFO L432 AbstractCegarLoop]: Abstraction has 73 states and 79 transitions. [2018-02-02 19:12:38,388 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 19:12:38,389 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 79 transitions. [2018-02-02 19:12:38,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-02 19:12:38,389 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:12:38,389 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 19:12:38,389 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation, alloc_unsafe_17Err1RequiresViolation, alloc_unsafe_17Err3RequiresViolation, alloc_unsafe_17Err2RequiresViolation, alloc_unsafe_17Err4RequiresViolation, alloc_unsafe_17Err0RequiresViolation, alloc_unsafe_17Err5RequiresViolation]=== [2018-02-02 19:12:38,390 INFO L82 PathProgramCache]: Analyzing trace with hash 607378637, now seen corresponding path program 1 times [2018-02-02 19:12:38,390 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:12:38,390 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:12:38,391 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:12:38,391 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:12:38,391 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:12:38,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:12:38,403 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:12:38,594 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:12:38,594 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 19:12:38,595 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-02 19:12:38,604 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:12:38,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:12:38,627 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 19:12:38,687 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-02-02 19:12:38,689 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 19:12:38,700 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-02-02 19:12:38,700 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 19:12:38,711 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-02 19:12:38,711 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:36 [2018-02-02 19:12:38,842 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:12:38,874 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 19:12:38,874 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 18 [2018-02-02 19:12:38,874 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-02 19:12:38,874 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-02 19:12:38,875 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=297, Unknown=0, NotChecked=0, Total=342 [2018-02-02 19:12:38,875 INFO L87 Difference]: Start difference. First operand 73 states and 79 transitions. Second operand 19 states. [2018-02-02 19:12:39,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:12:39,161 INFO L93 Difference]: Finished difference Result 79 states and 85 transitions. [2018-02-02 19:12:39,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-02 19:12:39,161 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 23 [2018-02-02 19:12:39,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:12:39,162 INFO L225 Difference]: With dead ends: 79 [2018-02-02 19:12:39,162 INFO L226 Difference]: Without dead ends: 79 [2018-02-02 19:12:39,162 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=114, Invalid=588, Unknown=0, NotChecked=0, Total=702 [2018-02-02 19:12:39,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-02-02 19:12:39,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2018-02-02 19:12:39,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-02-02 19:12:39,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 85 transitions. [2018-02-02 19:12:39,165 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 85 transitions. Word has length 23 [2018-02-02 19:12:39,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:12:39,166 INFO L432 AbstractCegarLoop]: Abstraction has 79 states and 85 transitions. [2018-02-02 19:12:39,166 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-02 19:12:39,166 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 85 transitions. [2018-02-02 19:12:39,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-02-02 19:12:39,166 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:12:39,166 INFO L351 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 19:12:39,166 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation, alloc_unsafe_17Err1RequiresViolation, alloc_unsafe_17Err3RequiresViolation, alloc_unsafe_17Err2RequiresViolation, alloc_unsafe_17Err4RequiresViolation, alloc_unsafe_17Err0RequiresViolation, alloc_unsafe_17Err5RequiresViolation]=== [2018-02-02 19:12:39,166 INFO L82 PathProgramCache]: Analyzing trace with hash 376259064, now seen corresponding path program 1 times [2018-02-02 19:12:39,167 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:12:39,167 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:12:39,167 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:12:39,168 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:12:39,168 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:12:39,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:12:39,175 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:12:39,242 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-02-02 19:12:39,242 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 19:12:39,242 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-02 19:12:39,242 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 19:12:39,242 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 19:12:39,243 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-02-02 19:12:39,243 INFO L87 Difference]: Start difference. First operand 79 states and 85 transitions. Second operand 8 states. [2018-02-02 19:12:39,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:12:39,341 INFO L93 Difference]: Finished difference Result 103 states and 115 transitions. [2018-02-02 19:12:39,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 19:12:39,341 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 38 [2018-02-02 19:12:39,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:12:39,342 INFO L225 Difference]: With dead ends: 103 [2018-02-02 19:12:39,342 INFO L226 Difference]: Without dead ends: 103 [2018-02-02 19:12:39,342 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-02-02 19:12:39,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-02-02 19:12:39,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 83. [2018-02-02 19:12:39,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-02-02 19:12:39,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 91 transitions. [2018-02-02 19:12:39,348 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 91 transitions. Word has length 38 [2018-02-02 19:12:39,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:12:39,348 INFO L432 AbstractCegarLoop]: Abstraction has 83 states and 91 transitions. [2018-02-02 19:12:39,348 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 19:12:39,348 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 91 transitions. [2018-02-02 19:12:39,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-02-02 19:12:39,349 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:12:39,349 INFO L351 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 19:12:39,349 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation, alloc_unsafe_17Err1RequiresViolation, alloc_unsafe_17Err3RequiresViolation, alloc_unsafe_17Err2RequiresViolation, alloc_unsafe_17Err4RequiresViolation, alloc_unsafe_17Err0RequiresViolation, alloc_unsafe_17Err5RequiresViolation]=== [2018-02-02 19:12:39,349 INFO L82 PathProgramCache]: Analyzing trace with hash 376259065, now seen corresponding path program 1 times [2018-02-02 19:12:39,350 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:12:39,350 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:12:39,351 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:12:39,351 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:12:39,351 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:12:39,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:12:39,362 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:12:39,407 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:12:39,407 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 19:12:39,407 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-02 19:12:39,412 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:12:39,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:12:39,431 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 19:12:39,454 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:12:39,481 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 19:12:39,481 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2018-02-02 19:12:39,481 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-02 19:12:39,481 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-02 19:12:39,482 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=61, Unknown=0, NotChecked=0, Total=110 [2018-02-02 19:12:39,482 INFO L87 Difference]: Start difference. First operand 83 states and 91 transitions. Second operand 11 states. [2018-02-02 19:12:39,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:12:39,511 INFO L93 Difference]: Finished difference Result 89 states and 97 transitions. [2018-02-02 19:12:39,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 19:12:39,511 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 38 [2018-02-02 19:12:39,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:12:39,512 INFO L225 Difference]: With dead ends: 89 [2018-02-02 19:12:39,512 INFO L226 Difference]: Without dead ends: 89 [2018-02-02 19:12:39,513 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=49, Invalid=61, Unknown=0, NotChecked=0, Total=110 [2018-02-02 19:12:39,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-02-02 19:12:39,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 87. [2018-02-02 19:12:39,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-02-02 19:12:39,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 95 transitions. [2018-02-02 19:12:39,517 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 95 transitions. Word has length 38 [2018-02-02 19:12:39,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:12:39,517 INFO L432 AbstractCegarLoop]: Abstraction has 87 states and 95 transitions. [2018-02-02 19:12:39,517 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-02 19:12:39,517 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 95 transitions. [2018-02-02 19:12:39,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-02-02 19:12:39,518 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:12:39,518 INFO L351 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 19:12:39,521 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation, alloc_unsafe_17Err1RequiresViolation, alloc_unsafe_17Err3RequiresViolation, alloc_unsafe_17Err2RequiresViolation, alloc_unsafe_17Err4RequiresViolation, alloc_unsafe_17Err0RequiresViolation, alloc_unsafe_17Err5RequiresViolation]=== [2018-02-02 19:12:39,521 INFO L82 PathProgramCache]: Analyzing trace with hash 997822914, now seen corresponding path program 2 times [2018-02-02 19:12:39,521 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:12:39,521 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:12:39,522 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:12:39,522 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:12:39,522 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:12:39,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:12:39,533 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:12:39,571 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:12:39,571 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 19:12:39,571 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-02 19:12:39,576 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-02 19:12:39,600 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-02-02 19:12:39,600 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 19:12:39,602 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 19:12:39,634 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-02-02 19:12:39,652 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-02-02 19:12:39,653 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 10 [2018-02-02 19:12:39,653 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 19:12:39,653 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 19:12:39,653 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2018-02-02 19:12:39,654 INFO L87 Difference]: Start difference. First operand 87 states and 95 transitions. Second operand 10 states. [2018-02-02 19:12:39,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:12:39,760 INFO L93 Difference]: Finished difference Result 116 states and 128 transitions. [2018-02-02 19:12:39,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 19:12:39,760 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 42 [2018-02-02 19:12:39,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:12:39,761 INFO L225 Difference]: With dead ends: 116 [2018-02-02 19:12:39,761 INFO L226 Difference]: Without dead ends: 116 [2018-02-02 19:12:39,762 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=64, Invalid=146, Unknown=0, NotChecked=0, Total=210 [2018-02-02 19:12:39,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-02-02 19:12:39,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 93. [2018-02-02 19:12:39,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-02-02 19:12:39,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 101 transitions. [2018-02-02 19:12:39,766 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 101 transitions. Word has length 42 [2018-02-02 19:12:39,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:12:39,766 INFO L432 AbstractCegarLoop]: Abstraction has 93 states and 101 transitions. [2018-02-02 19:12:39,767 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 19:12:39,767 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 101 transitions. [2018-02-02 19:12:39,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-02-02 19:12:39,767 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:12:39,767 INFO L351 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 19:12:39,767 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation, alloc_unsafe_17Err1RequiresViolation, alloc_unsafe_17Err3RequiresViolation, alloc_unsafe_17Err2RequiresViolation, alloc_unsafe_17Err4RequiresViolation, alloc_unsafe_17Err0RequiresViolation, alloc_unsafe_17Err5RequiresViolation]=== [2018-02-02 19:12:39,767 INFO L82 PathProgramCache]: Analyzing trace with hash -362065032, now seen corresponding path program 1 times [2018-02-02 19:12:39,767 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:12:39,767 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:12:39,768 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:12:39,768 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 19:12:39,768 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:12:39,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:12:39,779 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:12:39,817 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2018-02-02 19:12:39,817 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 19:12:39,817 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 19:12:39,817 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 19:12:39,818 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 19:12:39,818 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 19:12:39,818 INFO L87 Difference]: Start difference. First operand 93 states and 101 transitions. Second operand 5 states. [2018-02-02 19:12:39,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:12:39,826 INFO L93 Difference]: Finished difference Result 108 states and 117 transitions. [2018-02-02 19:12:39,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 19:12:39,827 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 50 [2018-02-02 19:12:39,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:12:39,827 INFO L225 Difference]: With dead ends: 108 [2018-02-02 19:12:39,827 INFO L226 Difference]: Without dead ends: 108 [2018-02-02 19:12:39,828 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 19:12:39,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-02-02 19:12:39,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 95. [2018-02-02 19:12:39,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-02-02 19:12:39,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 103 transitions. [2018-02-02 19:12:39,830 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 103 transitions. Word has length 50 [2018-02-02 19:12:39,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:12:39,830 INFO L432 AbstractCegarLoop]: Abstraction has 95 states and 103 transitions. [2018-02-02 19:12:39,830 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 19:12:39,830 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 103 transitions. [2018-02-02 19:12:39,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-02-02 19:12:39,831 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:12:39,831 INFO L351 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 19:12:39,831 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation, alloc_unsafe_17Err1RequiresViolation, alloc_unsafe_17Err3RequiresViolation, alloc_unsafe_17Err2RequiresViolation, alloc_unsafe_17Err4RequiresViolation, alloc_unsafe_17Err0RequiresViolation, alloc_unsafe_17Err5RequiresViolation]=== [2018-02-02 19:12:39,831 INFO L82 PathProgramCache]: Analyzing trace with hash -1169426246, now seen corresponding path program 1 times [2018-02-02 19:12:39,831 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:12:39,831 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:12:39,832 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:12:39,832 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:12:39,832 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:12:39,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:12:39,840 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:12:39,908 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-02 19:12:39,908 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 19:12:39,908 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-02 19:12:39,917 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:12:39,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:12:39,945 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 19:12:40,021 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 6 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:12:40,041 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 19:12:40,041 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2018-02-02 19:12:40,041 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-02 19:12:40,041 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-02 19:12:40,041 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=120, Unknown=0, NotChecked=0, Total=210 [2018-02-02 19:12:40,041 INFO L87 Difference]: Start difference. First operand 95 states and 103 transitions. Second operand 15 states. [2018-02-02 19:12:40,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:12:40,077 INFO L93 Difference]: Finished difference Result 101 states and 109 transitions. [2018-02-02 19:12:40,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 19:12:40,078 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 52 [2018-02-02 19:12:40,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:12:40,078 INFO L225 Difference]: With dead ends: 101 [2018-02-02 19:12:40,078 INFO L226 Difference]: Without dead ends: 101 [2018-02-02 19:12:40,078 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=120, Unknown=0, NotChecked=0, Total=210 [2018-02-02 19:12:40,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-02-02 19:12:40,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 99. [2018-02-02 19:12:40,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-02-02 19:12:40,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 107 transitions. [2018-02-02 19:12:40,080 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 107 transitions. Word has length 52 [2018-02-02 19:12:40,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:12:40,081 INFO L432 AbstractCegarLoop]: Abstraction has 99 states and 107 transitions. [2018-02-02 19:12:40,081 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-02 19:12:40,081 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 107 transitions. [2018-02-02 19:12:40,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-02-02 19:12:40,081 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:12:40,081 INFO L351 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 19:12:40,081 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation, alloc_unsafe_17Err1RequiresViolation, alloc_unsafe_17Err3RequiresViolation, alloc_unsafe_17Err2RequiresViolation, alloc_unsafe_17Err4RequiresViolation, alloc_unsafe_17Err0RequiresViolation, alloc_unsafe_17Err5RequiresViolation]=== [2018-02-02 19:12:40,081 INFO L82 PathProgramCache]: Analyzing trace with hash 1567126723, now seen corresponding path program 2 times [2018-02-02 19:12:40,082 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:12:40,082 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:12:40,082 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:12:40,082 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:12:40,082 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:12:40,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:12:40,089 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:12:40,166 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-02 19:12:40,166 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 19:12:40,166 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-02 19:12:40,171 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-02 19:12:40,197 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-02 19:12:40,197 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 19:12:40,200 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 19:12:40,282 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 6 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:12:40,313 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 19:12:40,313 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2018-02-02 19:12:40,313 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-02 19:12:40,313 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-02 19:12:40,313 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=157, Unknown=0, NotChecked=0, Total=272 [2018-02-02 19:12:40,314 INFO L87 Difference]: Start difference. First operand 99 states and 107 transitions. Second operand 17 states. [2018-02-02 19:12:40,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:12:40,412 INFO L93 Difference]: Finished difference Result 105 states and 113 transitions. [2018-02-02 19:12:40,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 19:12:40,412 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 56 [2018-02-02 19:12:40,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:12:40,413 INFO L225 Difference]: With dead ends: 105 [2018-02-02 19:12:40,413 INFO L226 Difference]: Without dead ends: 105 [2018-02-02 19:12:40,413 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=115, Invalid=157, Unknown=0, NotChecked=0, Total=272 [2018-02-02 19:12:40,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-02-02 19:12:40,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 103. [2018-02-02 19:12:40,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-02-02 19:12:40,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 111 transitions. [2018-02-02 19:12:40,416 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 111 transitions. Word has length 56 [2018-02-02 19:12:40,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:12:40,416 INFO L432 AbstractCegarLoop]: Abstraction has 103 states and 111 transitions. [2018-02-02 19:12:40,416 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-02 19:12:40,416 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 111 transitions. [2018-02-02 19:12:40,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-02-02 19:12:40,417 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:12:40,417 INFO L351 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 19:12:40,417 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation, alloc_unsafe_17Err1RequiresViolation, alloc_unsafe_17Err3RequiresViolation, alloc_unsafe_17Err2RequiresViolation, alloc_unsafe_17Err4RequiresViolation, alloc_unsafe_17Err0RequiresViolation, alloc_unsafe_17Err5RequiresViolation]=== [2018-02-02 19:12:40,418 INFO L82 PathProgramCache]: Analyzing trace with hash -429538228, now seen corresponding path program 3 times [2018-02-02 19:12:40,418 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:12:40,418 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:12:40,419 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:12:40,419 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 19:12:40,419 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:12:40,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:12:40,430 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:12:40,500 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-02 19:12:40,500 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 19:12:40,501 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-02 19:12:40,506 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-02 19:12:40,527 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-02-02 19:12:40,527 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 19:12:40,530 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 19:12:40,544 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-02-02 19:12:40,544 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 19:12:40,545 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:12:40,545 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-02 19:12:40,592 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#t~malloc1.base| Int)) (= |c_#valid| (store |c_old(#valid)| |ldv_malloc_#t~malloc1.base| 1))) is different from true [2018-02-02 19:12:40,599 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 12 treesize of output 11 [2018-02-02 19:12:40,600 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 19:12:40,603 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-02-02 19:12:40,603 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:11 [2018-02-02 19:12:40,615 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 98 trivial. 3 not checked. [2018-02-02 19:12:40,646 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 19:12:40,646 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 19 [2018-02-02 19:12:40,647 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-02 19:12:40,647 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-02 19:12:40,647 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=245, Unknown=1, NotChecked=32, Total=342 [2018-02-02 19:12:40,647 INFO L87 Difference]: Start difference. First operand 103 states and 111 transitions. Second operand 19 states. [2018-02-02 19:12:40,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:12:40,986 INFO L93 Difference]: Finished difference Result 146 states and 161 transitions. [2018-02-02 19:12:40,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-02 19:12:40,986 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 60 [2018-02-02 19:12:40,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:12:40,987 INFO L225 Difference]: With dead ends: 146 [2018-02-02 19:12:40,987 INFO L226 Difference]: Without dead ends: 146 [2018-02-02 19:12:40,988 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=203, Invalid=921, Unknown=2, NotChecked=64, Total=1190 [2018-02-02 19:12:40,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-02-02 19:12:40,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 115. [2018-02-02 19:12:40,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-02-02 19:12:40,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 127 transitions. [2018-02-02 19:12:40,993 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 127 transitions. Word has length 60 [2018-02-02 19:12:40,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:12:40,993 INFO L432 AbstractCegarLoop]: Abstraction has 115 states and 127 transitions. [2018-02-02 19:12:40,993 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-02 19:12:40,993 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 127 transitions. [2018-02-02 19:12:40,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-02-02 19:12:40,994 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:12:40,994 INFO L351 BasicCegarLoop]: trace histogram [9, 8, 8, 8, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 19:12:40,995 INFO L371 AbstractCegarLoop]: === Iteration 14 === [mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation, alloc_unsafe_17Err1RequiresViolation, alloc_unsafe_17Err3RequiresViolation, alloc_unsafe_17Err2RequiresViolation, alloc_unsafe_17Err4RequiresViolation, alloc_unsafe_17Err0RequiresViolation, alloc_unsafe_17Err5RequiresViolation]=== [2018-02-02 19:12:40,995 INFO L82 PathProgramCache]: Analyzing trace with hash 162408278, now seen corresponding path program 1 times [2018-02-02 19:12:40,995 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:12:40,995 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:12:40,996 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:12:40,996 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 19:12:40,996 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:12:41,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:12:41,005 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:12:41,079 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 0 proven. 128 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-02 19:12:41,079 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 19:12:41,079 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-02 19:12:41,084 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:12:41,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:12:41,102 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 19:12:41,181 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 6 proven. 128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:12:41,198 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 19:12:41,198 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 21 [2018-02-02 19:12:41,198 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-02 19:12:41,199 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-02 19:12:41,199 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=246, Unknown=0, NotChecked=0, Total=420 [2018-02-02 19:12:41,199 INFO L87 Difference]: Start difference. First operand 115 states and 127 transitions. Second operand 21 states. [2018-02-02 19:12:41,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:12:41,245 INFO L93 Difference]: Finished difference Result 121 states and 133 transitions. [2018-02-02 19:12:41,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-02 19:12:41,245 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 64 [2018-02-02 19:12:41,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:12:41,246 INFO L225 Difference]: With dead ends: 121 [2018-02-02 19:12:41,246 INFO L226 Difference]: Without dead ends: 121 [2018-02-02 19:12:41,246 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=174, Invalid=246, Unknown=0, NotChecked=0, Total=420 [2018-02-02 19:12:41,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-02-02 19:12:41,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 119. [2018-02-02 19:12:41,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-02-02 19:12:41,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 131 transitions. [2018-02-02 19:12:41,250 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 131 transitions. Word has length 64 [2018-02-02 19:12:41,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:12:41,250 INFO L432 AbstractCegarLoop]: Abstraction has 119 states and 131 transitions. [2018-02-02 19:12:41,250 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-02 19:12:41,250 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 131 transitions. [2018-02-02 19:12:41,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-02-02 19:12:41,251 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:12:41,251 INFO L351 BasicCegarLoop]: trace histogram [10, 9, 9, 9, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 19:12:41,251 INFO L371 AbstractCegarLoop]: === Iteration 15 === [mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation, alloc_unsafe_17Err1RequiresViolation, alloc_unsafe_17Err3RequiresViolation, alloc_unsafe_17Err2RequiresViolation, alloc_unsafe_17Err4RequiresViolation, alloc_unsafe_17Err0RequiresViolation, alloc_unsafe_17Err5RequiresViolation]=== [2018-02-02 19:12:41,252 INFO L82 PathProgramCache]: Analyzing trace with hash -1131684385, now seen corresponding path program 2 times [2018-02-02 19:12:41,252 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:12:41,252 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:12:41,253 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:12:41,253 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:12:41,253 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:12:41,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:12:41,265 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:12:41,365 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 0 proven. 162 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-02 19:12:41,365 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 19:12:41,365 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-02 19:12:41,377 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-02 19:12:41,407 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-02 19:12:41,407 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 19:12:41,410 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 19:12:41,496 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 6 proven. 162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:12:41,513 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 19:12:41,513 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 23 [2018-02-02 19:12:41,514 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-02 19:12:41,514 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-02 19:12:41,514 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=208, Invalid=298, Unknown=0, NotChecked=0, Total=506 [2018-02-02 19:12:41,514 INFO L87 Difference]: Start difference. First operand 119 states and 131 transitions. Second operand 23 states. [2018-02-02 19:12:41,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:12:41,570 INFO L93 Difference]: Finished difference Result 125 states and 137 transitions. [2018-02-02 19:12:41,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-02 19:12:41,571 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 68 [2018-02-02 19:12:41,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:12:41,571 INFO L225 Difference]: With dead ends: 125 [2018-02-02 19:12:41,571 INFO L226 Difference]: Without dead ends: 125 [2018-02-02 19:12:41,572 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=223, Invalid=329, Unknown=0, NotChecked=0, Total=552 [2018-02-02 19:12:41,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-02-02 19:12:41,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 123. [2018-02-02 19:12:41,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-02-02 19:12:41,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 135 transitions. [2018-02-02 19:12:41,574 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 135 transitions. Word has length 68 [2018-02-02 19:12:41,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:12:41,574 INFO L432 AbstractCegarLoop]: Abstraction has 123 states and 135 transitions. [2018-02-02 19:12:41,574 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-02 19:12:41,574 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 135 transitions. [2018-02-02 19:12:41,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-02-02 19:12:41,575 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:12:41,575 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 19:12:41,575 INFO L371 AbstractCegarLoop]: === Iteration 16 === [mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation, alloc_unsafe_17Err1RequiresViolation, alloc_unsafe_17Err3RequiresViolation, alloc_unsafe_17Err2RequiresViolation, alloc_unsafe_17Err4RequiresViolation, alloc_unsafe_17Err0RequiresViolation, alloc_unsafe_17Err5RequiresViolation]=== [2018-02-02 19:12:41,575 INFO L82 PathProgramCache]: Analyzing trace with hash -987158552, now seen corresponding path program 3 times [2018-02-02 19:12:41,575 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:12:41,575 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:12:41,576 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:12:41,576 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 19:12:41,576 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:12:41,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:12:41,595 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:12:41,845 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 3 proven. 67 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2018-02-02 19:12:41,846 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 19:12:41,846 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-02 19:12:41,851 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-02 19:12:41,864 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-02-02 19:12:41,864 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 19:12:41,866 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 19:12:41,888 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-02-02 19:12:41,888 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 19:12:41,899 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 26 treesize of output 25 [2018-02-02 19:12:41,899 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 19:12:41,910 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-02-02 19:12:41,910 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-02 19:12:41,911 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 25 treesize of output 24 [2018-02-02 19:12:41,912 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 19:12:41,930 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-02 19:12:41,931 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:50, output treesize:46 [2018-02-02 19:12:42,131 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:12:42,135 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 35 treesize of output 38 [2018-02-02 19:12:42,135 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 19:12:42,162 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:12:42,162 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:12:42,163 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 34 treesize of output 28 [2018-02-02 19:12:42,163 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 19:12:42,196 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:12:42,197 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:12:42,197 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 37 treesize of output 50 [2018-02-02 19:12:42,197 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-02 19:12:42,216 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:12:42,217 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:12:42,217 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 36 treesize of output 30 [2018-02-02 19:12:42,218 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 19:12:42,232 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-1 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-02-02 19:12:42,233 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:73, output treesize:55 [2018-02-02 19:12:42,293 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2018-02-02 19:12:42,309 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 19:12:42,310 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 12] total 26 [2018-02-02 19:12:42,310 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-02-02 19:12:42,310 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-02-02 19:12:42,310 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=633, Unknown=1, NotChecked=0, Total=702 [2018-02-02 19:12:42,311 INFO L87 Difference]: Start difference. First operand 123 states and 135 transitions. Second operand 27 states. [2018-02-02 19:13:04,978 WARN L143 SmtUtils]: Spent 14090ms on a formula simplification that was a NOOP. DAG size: 52 [2018-02-02 19:13:29,252 WARN L146 SmtUtils]: Spent 24217ms on a formula simplification. DAG size of input: 56 DAG size of output 56 [2018-02-02 19:13:29,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:13:29,438 INFO L93 Difference]: Finished difference Result 215 states and 242 transitions. [2018-02-02 19:13:29,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-02 19:13:29,438 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 72 [2018-02-02 19:13:29,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:13:29,439 INFO L225 Difference]: With dead ends: 215 [2018-02-02 19:13:29,439 INFO L226 Difference]: Without dead ends: 215 [2018-02-02 19:13:29,440 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 63 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 325 ImplicationChecksByTransitivity, 39.4s TimeCoverageRelationStatistics Valid=197, Invalid=1521, Unknown=4, NotChecked=0, Total=1722 [2018-02-02 19:13:29,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2018-02-02 19:13:29,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 138. [2018-02-02 19:13:29,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-02-02 19:13:29,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 156 transitions. [2018-02-02 19:13:29,443 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 156 transitions. Word has length 72 [2018-02-02 19:13:29,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:13:29,444 INFO L432 AbstractCegarLoop]: Abstraction has 138 states and 156 transitions. [2018-02-02 19:13:29,444 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-02-02 19:13:29,444 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 156 transitions. [2018-02-02 19:13:29,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-02-02 19:13:29,445 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:13:29,445 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 19:13:29,445 INFO L371 AbstractCegarLoop]: === Iteration 17 === [mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation, alloc_unsafe_17Err1RequiresViolation, alloc_unsafe_17Err3RequiresViolation, alloc_unsafe_17Err2RequiresViolation, alloc_unsafe_17Err4RequiresViolation, alloc_unsafe_17Err0RequiresViolation, alloc_unsafe_17Err5RequiresViolation]=== [2018-02-02 19:13:29,445 INFO L82 PathProgramCache]: Analyzing trace with hash -262763435, now seen corresponding path program 1 times [2018-02-02 19:13:29,445 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:13:29,445 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:13:29,446 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:13:29,446 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 19:13:29,446 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:13:29,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:13:29,457 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:13:29,483 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2018-02-02 19:13:29,483 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 19:13:29,483 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 19:13:29,484 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 19:13:29,484 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 19:13:29,484 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 19:13:29,484 INFO L87 Difference]: Start difference. First operand 138 states and 156 transitions. Second operand 4 states. [2018-02-02 19:13:29,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:13:29,504 INFO L93 Difference]: Finished difference Result 145 states and 162 transitions. [2018-02-02 19:13:29,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 19:13:29,505 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 73 [2018-02-02 19:13:29,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:13:29,505 INFO L225 Difference]: With dead ends: 145 [2018-02-02 19:13:29,505 INFO L226 Difference]: Without dead ends: 145 [2018-02-02 19:13:29,505 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-02 19:13:29,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-02-02 19:13:29,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 141. [2018-02-02 19:13:29,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-02-02 19:13:29,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 158 transitions. [2018-02-02 19:13:29,508 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 158 transitions. Word has length 73 [2018-02-02 19:13:29,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:13:29,509 INFO L432 AbstractCegarLoop]: Abstraction has 141 states and 158 transitions. [2018-02-02 19:13:29,509 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 19:13:29,509 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 158 transitions. [2018-02-02 19:13:29,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-02-02 19:13:29,509 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:13:29,510 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 19:13:29,510 INFO L371 AbstractCegarLoop]: === Iteration 18 === [mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation, alloc_unsafe_17Err1RequiresViolation, alloc_unsafe_17Err3RequiresViolation, alloc_unsafe_17Err2RequiresViolation, alloc_unsafe_17Err4RequiresViolation, alloc_unsafe_17Err0RequiresViolation, alloc_unsafe_17Err5RequiresViolation]=== [2018-02-02 19:13:29,510 INFO L82 PathProgramCache]: Analyzing trace with hash 1862067708, now seen corresponding path program 1 times [2018-02-02 19:13:29,510 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:13:29,510 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:13:29,511 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:13:29,511 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:13:29,511 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:13:29,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:13:29,519 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:13:29,608 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 203 trivial. 0 not checked. [2018-02-02 19:13:29,608 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 19:13:29,608 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-02 19:13:29,615 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:13:29,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:13:29,641 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 19:13:29,707 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2018-02-02 19:13:29,729 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 19:13:29,730 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 6] total 16 [2018-02-02 19:13:29,730 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-02 19:13:29,730 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-02 19:13:29,730 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2018-02-02 19:13:29,730 INFO L87 Difference]: Start difference. First operand 141 states and 158 transitions. Second operand 16 states. [2018-02-02 19:13:30,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:13:30,014 INFO L93 Difference]: Finished difference Result 193 states and 215 transitions. [2018-02-02 19:13:30,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-02 19:13:30,014 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 79 [2018-02-02 19:13:30,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:13:30,015 INFO L225 Difference]: With dead ends: 193 [2018-02-02 19:13:30,015 INFO L226 Difference]: Without dead ends: 193 [2018-02-02 19:13:30,016 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=213, Invalid=909, Unknown=0, NotChecked=0, Total=1122 [2018-02-02 19:13:30,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2018-02-02 19:13:30,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 138. [2018-02-02 19:13:30,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-02-02 19:13:30,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 152 transitions. [2018-02-02 19:13:30,020 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 152 transitions. Word has length 79 [2018-02-02 19:13:30,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:13:30,021 INFO L432 AbstractCegarLoop]: Abstraction has 138 states and 152 transitions. [2018-02-02 19:13:30,021 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-02 19:13:30,021 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 152 transitions. [2018-02-02 19:13:30,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-02-02 19:13:30,021 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:13:30,022 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 19:13:30,022 INFO L371 AbstractCegarLoop]: === Iteration 19 === [mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation, alloc_unsafe_17Err1RequiresViolation, alloc_unsafe_17Err3RequiresViolation, alloc_unsafe_17Err2RequiresViolation, alloc_unsafe_17Err4RequiresViolation, alloc_unsafe_17Err0RequiresViolation, alloc_unsafe_17Err5RequiresViolation]=== [2018-02-02 19:13:30,022 INFO L82 PathProgramCache]: Analyzing trace with hash 449519656, now seen corresponding path program 1 times [2018-02-02 19:13:30,022 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:13:30,022 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:13:30,023 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:13:30,023 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:13:30,023 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:13:30,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:13:30,033 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:13:30,108 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2018-02-02 19:13:30,109 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 19:13:30,109 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-02 19:13:30,114 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:13:30,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:13:30,136 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 19:13:30,138 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-02-02 19:13:30,138 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 19:13:30,139 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:13:30,139 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-02 19:13:30,161 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2018-02-02 19:13:30,179 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 19:13:30,179 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-02-02 19:13:30,179 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 19:13:30,179 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 19:13:30,179 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-02-02 19:13:30,180 INFO L87 Difference]: Start difference. First operand 138 states and 152 transitions. Second operand 9 states. [2018-02-02 19:13:30,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:13:30,298 INFO L93 Difference]: Finished difference Result 163 states and 179 transitions. [2018-02-02 19:13:30,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-02 19:13:30,298 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 81 [2018-02-02 19:13:30,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:13:30,299 INFO L225 Difference]: With dead ends: 163 [2018-02-02 19:13:30,299 INFO L226 Difference]: Without dead ends: 163 [2018-02-02 19:13:30,299 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 81 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2018-02-02 19:13:30,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2018-02-02 19:13:30,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 152. [2018-02-02 19:13:30,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-02-02 19:13:30,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 169 transitions. [2018-02-02 19:13:30,301 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 169 transitions. Word has length 81 [2018-02-02 19:13:30,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:13:30,302 INFO L432 AbstractCegarLoop]: Abstraction has 152 states and 169 transitions. [2018-02-02 19:13:30,302 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 19:13:30,302 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 169 transitions. [2018-02-02 19:13:30,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-02-02 19:13:30,302 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:13:30,302 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 19:13:30,302 INFO L371 AbstractCegarLoop]: === Iteration 20 === [mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation, alloc_unsafe_17Err1RequiresViolation, alloc_unsafe_17Err3RequiresViolation, alloc_unsafe_17Err2RequiresViolation, alloc_unsafe_17Err4RequiresViolation, alloc_unsafe_17Err0RequiresViolation, alloc_unsafe_17Err5RequiresViolation]=== [2018-02-02 19:13:30,302 INFO L82 PathProgramCache]: Analyzing trace with hash 449519657, now seen corresponding path program 1 times [2018-02-02 19:13:30,302 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:13:30,303 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:13:30,303 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:13:30,303 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:13:30,303 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:13:30,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:13:30,310 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:13:30,427 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 31 proven. 2 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2018-02-02 19:13:30,427 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 19:13:30,427 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-02 19:13:30,432 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:13:30,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:13:30,460 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 19:13:30,479 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 14 treesize of output 13 [2018-02-02 19:13:30,480 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 19:13:30,507 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-02-02 19:13:30,507 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 19:13:30,517 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-02-02 19:13:30,517 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:30 [2018-02-02 19:13:33,536 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 138 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:13:33,735 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 19:13:33,735 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 20] total 30 [2018-02-02 19:13:33,735 INFO L409 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-02-02 19:13:33,735 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-02-02 19:13:33,736 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=817, Unknown=1, NotChecked=0, Total=930 [2018-02-02 19:13:33,736 INFO L87 Difference]: Start difference. First operand 152 states and 169 transitions. Second operand 31 states. [2018-02-02 19:14:20,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:14:20,685 INFO L93 Difference]: Finished difference Result 175 states and 191 transitions. [2018-02-02 19:14:20,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-02-02 19:14:20,685 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 81 [2018-02-02 19:14:20,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:14:20,685 INFO L225 Difference]: With dead ends: 175 [2018-02-02 19:14:20,686 INFO L226 Difference]: Without dead ends: 175 [2018-02-02 19:14:20,686 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 66 SyntacticMatches, 1 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 567 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=544, Invalid=2994, Unknown=2, NotChecked=0, Total=3540 [2018-02-02 19:14:20,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2018-02-02 19:14:20,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 160. [2018-02-02 19:14:20,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2018-02-02 19:14:20,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 180 transitions. [2018-02-02 19:14:20,690 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 180 transitions. Word has length 81 [2018-02-02 19:14:20,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:14:20,690 INFO L432 AbstractCegarLoop]: Abstraction has 160 states and 180 transitions. [2018-02-02 19:14:20,690 INFO L433 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-02-02 19:14:20,690 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 180 transitions. [2018-02-02 19:14:20,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-02-02 19:14:20,691 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:14:20,691 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 19:14:20,691 INFO L371 AbstractCegarLoop]: === Iteration 21 === [mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation, alloc_unsafe_17Err1RequiresViolation, alloc_unsafe_17Err3RequiresViolation, alloc_unsafe_17Err2RequiresViolation, alloc_unsafe_17Err4RequiresViolation, alloc_unsafe_17Err0RequiresViolation, alloc_unsafe_17Err5RequiresViolation]=== [2018-02-02 19:14:20,692 INFO L82 PathProgramCache]: Analyzing trace with hash 1050207497, now seen corresponding path program 1 times [2018-02-02 19:14:20,692 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:14:20,692 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:14:20,692 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:14:20,693 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:14:20,693 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:14:20,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:14:20,713 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. Received shutdown request... [2018-02-02 19:14:20,905 FATAL L265 ToolchainWalker]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Timeout exceeded at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.walkLeafNode(Interpolator.java:265) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.access$1(Interpolator.java:263) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator$ProofTreeWalker.walk(Interpolator.java:132) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:122) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:113) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.interpolate(Interpolator.java:220) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.getInterpolants(Interpolator.java:201) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.getInterpolants(SMTInterpol.java:915) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.managedscript.ManagedScript.getInterpolants(ManagedScript.java:192) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.computeCraigInterpolants(NestedInterpolantsBuilder.java:281) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.(NestedInterpolantsBuilder.java:164) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsTree(InterpolatingTraceCheckCraig.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolants(InterpolatingTraceCheckCraig.java:199) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:106) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructCraig(TraceCheckConstructor.java:222) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.MultiTrackTraceAbstractionRefinementStrategy.getTraceCheck(MultiTrackTraceAbstractionRefinementStrategy.java:222) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:231) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:205) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:397) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:381) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:316) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:292) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:147) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:115) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:119) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:324) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.runToolchainDefault(DefaultToolchainJob.java:221) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.BasicToolchainJob.run(BasicToolchainJob.java:134) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-02-02 19:14:20,908 INFO L168 Benchmark]: Toolchain (without parser) took 104144.59 ms. Allocated memory was 402.7 MB in the beginning and 725.6 MB in the end (delta: 323.0 MB). Free memory was 356.6 MB in the beginning and 537.2 MB in the end (delta: -180.6 MB). Peak memory consumption was 272.2 MB. Max. memory is 5.3 GB. [2018-02-02 19:14:20,909 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 402.7 MB. Free memory is still 363.3 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-02 19:14:20,909 INFO L168 Benchmark]: CACSL2BoogieTranslator took 169.69 ms. Allocated memory is still 402.7 MB. Free memory was 356.6 MB in the beginning and 343.4 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 5.3 GB. [2018-02-02 19:14:20,909 INFO L168 Benchmark]: Boogie Preprocessor took 29.67 ms. Allocated memory is still 402.7 MB. Free memory was 343.4 MB in the beginning and 342.1 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-02-02 19:14:20,909 INFO L168 Benchmark]: RCFGBuilder took 270.46 ms. Allocated memory is still 402.7 MB. Free memory was 342.1 MB in the beginning and 318.1 MB in the end (delta: 24.0 MB). Peak memory consumption was 24.0 MB. Max. memory is 5.3 GB. [2018-02-02 19:14:20,910 INFO L168 Benchmark]: TraceAbstraction took 103671.80 ms. Allocated memory was 402.7 MB in the beginning and 725.6 MB in the end (delta: 323.0 MB). Free memory was 318.1 MB in the beginning and 537.2 MB in the end (delta: -219.2 MB). Peak memory consumption was 233.6 MB. Max. memory is 5.3 GB. [2018-02-02 19:14:20,911 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12 ms. Allocated memory is still 402.7 MB. Free memory is still 363.3 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 169.69 ms. Allocated memory is still 402.7 MB. Free memory was 356.6 MB in the beginning and 343.4 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 29.67 ms. Allocated memory is still 402.7 MB. Free memory was 343.4 MB in the beginning and 342.1 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 270.46 ms. Allocated memory is still 402.7 MB. Free memory was 342.1 MB in the beginning and 318.1 MB in the end (delta: 24.0 MB). Peak memory consumption was 24.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 103671.80 ms. Allocated memory was 402.7 MB in the beginning and 725.6 MB in the end (delta: 323.0 MB). Free memory was 318.1 MB in the beginning and 537.2 MB in the end (delta: -219.2 MB). Peak memory consumption was 233.6 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: Timeout exceeded de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: Timeout exceeded: de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.walkLeafNode(Interpolator.java:265) RESULT: Ultimate could not prove your program: Toolchain returned no result. Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test17_2_false-valid-free.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-02_19-14-20-916.csv Completed graceful shutdown