java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/cav18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_z3.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test6_1_false-valid-memtrack_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-26d9e06-m [2018-02-02 11:05:54,432 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-02 11:05:54,433 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-02 11:05:54,446 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-02 11:05:54,446 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-02 11:05:54,447 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-02 11:05:54,448 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-02 11:05:54,449 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-02 11:05:54,451 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-02 11:05:54,452 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-02 11:05:54,453 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-02 11:05:54,453 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-02 11:05:54,454 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-02 11:05:54,455 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-02 11:05:54,455 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-02 11:05:54,457 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-02 11:05:54,459 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-02 11:05:54,460 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-02 11:05:54,461 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-02 11:05:54,462 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-02 11:05:54,463 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-02 11:05:54,463 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-02 11:05:54,464 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-02 11:05:54,464 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-02 11:05:54,465 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-02 11:05:54,466 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-02 11:05:54,466 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-02 11:05:54,467 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-02 11:05:54,467 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-02 11:05:54,467 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-02 11:05:54,467 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-02 11:05:54,468 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cav18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_z3.epf [2018-02-02 11:05:54,477 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-02 11:05:54,477 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-02 11:05:54,478 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-02 11:05:54,478 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-02 11:05:54,478 INFO L133 SettingsManager]: * Use SBE=true [2018-02-02 11:05:54,478 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-02 11:05:54,478 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-02 11:05:54,478 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-02 11:05:54,479 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-02 11:05:54,479 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-02 11:05:54,479 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-02 11:05:54,479 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-02 11:05:54,479 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-02 11:05:54,479 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-02 11:05:54,479 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-02 11:05:54,479 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-02 11:05:54,480 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-02 11:05:54,480 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-02 11:05:54,480 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-02 11:05:54,480 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-02 11:05:54,480 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 11:05:54,480 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-02 11:05:54,481 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2018-02-02 11:05:54,481 INFO L133 SettingsManager]: * SMT solver=External_Z3InterpolationMode [2018-02-02 11:05:54,481 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-02 11:05:54,510 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-02 11:05:54,525 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-02 11:05:54,528 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-02 11:05:54,529 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-02 11:05:54,529 INFO L276 PluginConnector]: CDTParser initialized [2018-02-02 11:05:54,529 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test6_1_false-valid-memtrack_true-termination.i [2018-02-02 11:05:54,667 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-02 11:05:54,668 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-02 11:05:54,669 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-02 11:05:54,669 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-02 11:05:54,675 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-02 11:05:54,676 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 11:05:54" (1/1) ... [2018-02-02 11:05:54,679 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6c2b8cf4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 11:05:54, skipping insertion in model container [2018-02-02 11:05:54,679 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 11:05:54" (1/1) ... [2018-02-02 11:05:54,694 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 11:05:54,732 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 11:05:54,819 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 11:05:54,832 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 11:05:54,837 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 11:05:54 WrapperNode [2018-02-02 11:05:54,838 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-02 11:05:54,838 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-02 11:05:54,839 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-02 11:05:54,839 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-02 11:05:54,851 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 11:05:54" (1/1) ... [2018-02-02 11:05:54,852 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 11:05:54" (1/1) ... [2018-02-02 11:05:54,860 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 11:05:54" (1/1) ... [2018-02-02 11:05:54,860 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 11:05:54" (1/1) ... [2018-02-02 11:05:54,864 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 11:05:54" (1/1) ... [2018-02-02 11:05:54,865 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 11:05:54" (1/1) ... [2018-02-02 11:05:54,866 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 11:05:54" (1/1) ... [2018-02-02 11:05:54,867 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-02 11:05:54,868 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-02 11:05:54,868 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-02 11:05:54,868 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-02 11:05:54,868 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 11:05:54" (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 11:05:54,904 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-02 11:05:54,904 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-02 11:05:54,904 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-02-02 11:05:54,904 INFO L136 BoogieDeclarations]: Found implementation of procedure f6 [2018-02-02 11:05:54,904 INFO L136 BoogieDeclarations]: Found implementation of procedure g6 [2018-02-02 11:05:54,904 INFO L136 BoogieDeclarations]: Found implementation of procedure probe2_6 [2018-02-02 11:05:54,904 INFO L136 BoogieDeclarations]: Found implementation of procedure disconnect_6 [2018-02-02 11:05:54,905 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-02-02 11:05:54,905 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-02 11:05:54,905 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-02 11:05:54,905 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-02 11:05:54,905 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-02 11:05:54,905 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-02 11:05:54,905 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-02 11:05:54,905 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-02 11:05:54,905 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-02 11:05:54,905 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-02 11:05:54,905 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-02-02 11:05:54,905 INFO L128 BoogieDeclarations]: Found specification of procedure f6 [2018-02-02 11:05:54,906 INFO L128 BoogieDeclarations]: Found specification of procedure g6 [2018-02-02 11:05:54,906 INFO L128 BoogieDeclarations]: Found specification of procedure probe2_6 [2018-02-02 11:05:54,906 INFO L128 BoogieDeclarations]: Found specification of procedure disconnect_6 [2018-02-02 11:05:54,906 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-02-02 11:05:54,906 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-02 11:05:54,906 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-02 11:05:54,906 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-02 11:05:55,054 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-02 11:05:55,055 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 11:05:55 BoogieIcfgContainer [2018-02-02 11:05:55,055 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-02 11:05:55,055 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-02 11:05:55,056 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-02 11:05:55,057 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-02 11:05:55,058 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.02 11:05:54" (1/3) ... [2018-02-02 11:05:55,058 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28ccf0bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 11:05:55, skipping insertion in model container [2018-02-02 11:05:55,058 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 11:05:54" (2/3) ... [2018-02-02 11:05:55,059 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28ccf0bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 11:05:55, skipping insertion in model container [2018-02-02 11:05:55,059 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 11:05:55" (3/3) ... [2018-02-02 11:05:55,060 INFO L107 eAbstractionObserver]: Analyzing ICFG memleaks_test6_1_false-valid-memtrack_true-termination.i [2018-02-02 11:05:55,066 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2018-02-02 11:05:55,071 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 13 error locations. [2018-02-02 11:05:55,106 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-02 11:05:55,106 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-02 11:05:55,107 INFO L324 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2018-02-02 11:05:55,107 INFO L325 AbstractCegarLoop]: Backedges is CANONICAL [2018-02-02 11:05:55,107 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-02 11:05:55,107 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-02 11:05:55,107 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-02 11:05:55,107 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-02 11:05:55,108 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-02 11:05:55,120 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states. [2018-02-02 11:05:55,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-02-02 11:05:55,127 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 11:05:55,128 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-02-02 11:05:55,128 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, probe2_6Err1RequiresViolation, probe2_6Err0RequiresViolation, probe2_6Err2RequiresViolation, probe2_6Err3RequiresViolation]=== [2018-02-02 11:05:55,132 INFO L82 PathProgramCache]: Analyzing trace with hash 3232357, now seen corresponding path program 1 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-02 11:05:55,143 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 11:05:55,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:05:55,190 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 11:05:55,220 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 11:05:55,220 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-02 11:05:55,221 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 11:05:55,221 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 11:05:55,222 INFO L182 omatonBuilderFactory]: Interpolants [69#true, 70#false, 71#(= 1 (select |#valid| |~#a6.base|))] [2018-02-02 11:05:55,222 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 11:05:55,223 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-02 11:05:55,233 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-02 11:05:55,233 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 11:05:55,235 INFO L87 Difference]: Start difference. First operand 66 states. Second operand 3 states. [2018-02-02 11:05:55,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 11:05:55,318 INFO L93 Difference]: Finished difference Result 79 states and 85 transitions. [2018-02-02 11:05:55,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-02 11:05:55,320 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2018-02-02 11:05:55,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 11:05:55,330 INFO L225 Difference]: With dead ends: 79 [2018-02-02 11:05:55,330 INFO L226 Difference]: Without dead ends: 76 [2018-02-02 11:05:55,332 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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 11:05:55,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-02-02 11:05:55,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 67. [2018-02-02 11:05:55,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-02-02 11:05:55,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 73 transitions. [2018-02-02 11:05:55,368 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 73 transitions. Word has length 4 [2018-02-02 11:05:55,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 11:05:55,368 INFO L432 AbstractCegarLoop]: Abstraction has 67 states and 73 transitions. [2018-02-02 11:05:55,368 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-02 11:05:55,368 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 73 transitions. [2018-02-02 11:05:55,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-02-02 11:05:55,368 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 11:05:55,369 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-02-02 11:05:55,369 INFO L371 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, probe2_6Err1RequiresViolation, probe2_6Err0RequiresViolation, probe2_6Err2RequiresViolation, probe2_6Err3RequiresViolation]=== [2018-02-02 11:05:55,369 INFO L82 PathProgramCache]: Analyzing trace with hash 3232358, now seen corresponding path program 1 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-02 11:05:55,372 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 11:05:55,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:05:55,382 WARN L195 Executor]: ExternalInterpolator (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in) stderr output: WARNING: array quantifier [2018-02-02 11:05:55,385 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-02 11:05:55,386 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-02 11:05:55,387 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-02 11:05:55,387 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-02 11:05:55,412 WARN L1033 $PredicateComparison]: unable to prove that (exists ((%0 (Array Int Int))) (! (forall ((%1 Int)) (! (= (store %0 %1 4) (store |c_#length| %1 4)) :qid itp)) :qid itp)) is different from true [2018-02-02 11:05:55,439 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 11:05:55,469 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 11:05:55,469 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-02 11:05:55,469 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 11:05:55,469 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 11:05:55,470 INFO L182 omatonBuilderFactory]: Interpolants [218#true, 219#false, 220#(exists ((%0 (Array Int Int))) (! (forall ((%1 Int)) (! (= (store %0 %1 4) (store |#length| %1 4)) :qid itp)) :qid itp)), 221#(and (= 4 (select |#length| |~#a6.base|)) (<= (+ |~#a6.offset| 4) (select |#length| |~#a6.base|)) (<= 0 |~#a6.offset|))] [2018-02-02 11:05:55,470 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 11:05:55,521 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 11:05:55,521 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 11:05:55,522 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=4, Unknown=1, NotChecked=2, Total=12 [2018-02-02 11:05:55,522 INFO L87 Difference]: Start difference. First operand 67 states and 73 transitions. Second operand 4 states. [2018-02-02 11:05:55,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 11:05:55,581 INFO L93 Difference]: Finished difference Result 116 states and 126 transitions. [2018-02-02 11:05:55,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 11:05:55,582 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2018-02-02 11:05:55,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 11:05:55,583 INFO L225 Difference]: With dead ends: 116 [2018-02-02 11:05:55,584 INFO L226 Difference]: Without dead ends: 116 [2018-02-02 11:05:55,584 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=4, Unknown=1, NotChecked=2, Total=12 [2018-02-02 11:05:55,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-02-02 11:05:55,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 103. [2018-02-02 11:05:55,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-02-02 11:05:55,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 123 transitions. [2018-02-02 11:05:55,593 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 123 transitions. Word has length 4 [2018-02-02 11:05:55,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 11:05:55,593 INFO L432 AbstractCegarLoop]: Abstraction has 103 states and 123 transitions. [2018-02-02 11:05:55,594 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 11:05:55,594 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 123 transitions. [2018-02-02 11:05:55,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-02-02 11:05:55,595 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 11:05:55,595 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 11:05:55,595 INFO L371 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, probe2_6Err1RequiresViolation, probe2_6Err0RequiresViolation, probe2_6Err2RequiresViolation, probe2_6Err3RequiresViolation]=== [2018-02-02 11:05:55,595 INFO L82 PathProgramCache]: Analyzing trace with hash -293037669, now seen corresponding path program 1 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-02 11:05:55,598 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 11:05:55,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:05:55,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:05:55,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:05:55,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:05:55,692 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 11:05:55,710 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 11:05:55,710 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-02-02 11:05:55,710 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 11:05:55,710 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 11:05:55,711 INFO L182 omatonBuilderFactory]: Interpolants [467#(= |probe2_6_#res| 3), 468#(and (= |#valid| |old(#valid)|) (= |old(#length)| |#length|)), 441#true, 442#false, 458#(= 3 |entry_point_#t~ret9|), 459#(not (= 0 entry_point_~ret~1)), 460#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |~#a6.offset| |old(~#a6.offset)|) (= |old(#length)| |#length|) (= |~#a6.base| |old(~#a6.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 461#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 462#(= 3 probe2_6_~ret~0)] [2018-02-02 11:05:55,711 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 11:05:55,711 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 11:05:55,711 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 11:05:55,711 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-02-02 11:05:55,712 INFO L87 Difference]: Start difference. First operand 103 states and 123 transitions. Second operand 9 states. [2018-02-02 11:05:56,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 11:05:56,126 INFO L93 Difference]: Finished difference Result 131 states and 150 transitions. [2018-02-02 11:05:56,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-02 11:05:56,127 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 24 [2018-02-02 11:05:56,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 11:05:56,129 INFO L225 Difference]: With dead ends: 131 [2018-02-02 11:05:56,130 INFO L226 Difference]: Without dead ends: 122 [2018-02-02 11:05:56,130 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2018-02-02 11:05:56,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-02-02 11:05:56,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 106. [2018-02-02 11:05:56,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-02-02 11:05:56,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 124 transitions. [2018-02-02 11:05:56,139 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 124 transitions. Word has length 24 [2018-02-02 11:05:56,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 11:05:56,140 INFO L432 AbstractCegarLoop]: Abstraction has 106 states and 124 transitions. [2018-02-02 11:05:56,140 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 11:05:56,140 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 124 transitions. [2018-02-02 11:05:56,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-02-02 11:05:56,141 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 11:05:56,141 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 11:05:56,141 INFO L371 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, probe2_6Err1RequiresViolation, probe2_6Err0RequiresViolation, probe2_6Err2RequiresViolation, probe2_6Err3RequiresViolation]=== [2018-02-02 11:05:56,141 INFO L82 PathProgramCache]: Analyzing trace with hash -2126392044, now seen corresponding path program 1 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-02 11:05:56,144 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 11:05:56,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:05:56,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:05:56,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:05:56,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:05:56,223 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 11:05:56,251 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 11:05:56,251 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 11:05:56,251 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 11:05:56,251 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 11:05:56,252 INFO L182 omatonBuilderFactory]: Interpolants [736#(= 0 |ldv_malloc_#res.offset|), 729#(= 0 |probe2_6_#t~ret4.offset|), 730#(= 0 probe2_6_~p~0.offset), 718#true, 734#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |~#a6.offset| |old(~#a6.offset)|) (= |old(#length)| |#length|) (= |~#a6.base| |old(~#a6.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 719#false, 735#(and (= |#valid| |old(#valid)|) (= |old(#length)| |#length|))] [2018-02-02 11:05:56,252 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 11:05:56,252 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 11:05:56,252 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 11:05:56,252 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-02-02 11:05:56,252 INFO L87 Difference]: Start difference. First operand 106 states and 124 transitions. Second operand 7 states. [2018-02-02 11:05:56,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 11:05:56,538 INFO L93 Difference]: Finished difference Result 115 states and 131 transitions. [2018-02-02 11:05:56,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 11:05:56,540 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2018-02-02 11:05:56,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 11:05:56,541 INFO L225 Difference]: With dead ends: 115 [2018-02-02 11:05:56,541 INFO L226 Difference]: Without dead ends: 115 [2018-02-02 11:05:56,542 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2018-02-02 11:05:56,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-02-02 11:05:56,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 106. [2018-02-02 11:05:56,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-02-02 11:05:56,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 123 transitions. [2018-02-02 11:05:56,550 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 123 transitions. Word has length 24 [2018-02-02 11:05:56,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 11:05:56,550 INFO L432 AbstractCegarLoop]: Abstraction has 106 states and 123 transitions. [2018-02-02 11:05:56,550 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 11:05:56,550 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 123 transitions. [2018-02-02 11:05:56,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-02-02 11:05:56,551 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 11:05:56,551 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 11:05:56,551 INFO L371 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, probe2_6Err1RequiresViolation, probe2_6Err0RequiresViolation, probe2_6Err2RequiresViolation, probe2_6Err3RequiresViolation]=== [2018-02-02 11:05:56,551 INFO L82 PathProgramCache]: Analyzing trace with hash -2126392043, now seen corresponding path program 1 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-02 11:05:56,555 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 11:05:56,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:05:56,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:05:56,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:05:56,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:05:56,621 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 11:05:56,646 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 11:05:56,646 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 11:05:56,646 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 11:05:56,647 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 11:05:56,647 INFO L182 omatonBuilderFactory]: Interpolants [977#(= 0 |probe2_6_#t~ret4.base|), 978#(= 0 probe2_6_~p~0.base), 966#true, 982#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |~#a6.offset| |old(~#a6.offset)|) (= |old(#length)| |#length|) (= |~#a6.base| |old(~#a6.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 967#false, 983#(and (= |#valid| |old(#valid)|) (= |old(#length)| |#length|)), 984#(= 0 |ldv_malloc_#res.base|)] [2018-02-02 11:05:56,647 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 11:05:56,647 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 11:05:56,647 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 11:05:56,647 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-02-02 11:05:56,647 INFO L87 Difference]: Start difference. First operand 106 states and 123 transitions. Second operand 7 states. [2018-02-02 11:05:56,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 11:05:56,836 INFO L93 Difference]: Finished difference Result 118 states and 132 transitions. [2018-02-02 11:05:56,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 11:05:56,837 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2018-02-02 11:05:56,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 11:05:56,837 INFO L225 Difference]: With dead ends: 118 [2018-02-02 11:05:56,837 INFO L226 Difference]: Without dead ends: 115 [2018-02-02 11:05:56,838 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2018-02-02 11:05:56,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-02-02 11:05:56,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 107. [2018-02-02 11:05:56,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-02-02 11:05:56,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 123 transitions. [2018-02-02 11:05:56,842 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 123 transitions. Word has length 24 [2018-02-02 11:05:56,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 11:05:56,842 INFO L432 AbstractCegarLoop]: Abstraction has 107 states and 123 transitions. [2018-02-02 11:05:56,842 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 11:05:56,842 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 123 transitions. [2018-02-02 11:05:56,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-02-02 11:05:56,843 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 11:05:56,843 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 11:05:56,843 INFO L371 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, probe2_6Err1RequiresViolation, probe2_6Err0RequiresViolation, probe2_6Err2RequiresViolation, probe2_6Err3RequiresViolation]=== [2018-02-02 11:05:56,843 INFO L82 PathProgramCache]: Analyzing trace with hash 1815899569, now seen corresponding path program 1 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-02 11:05:56,845 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 11:05:56,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:05:56,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:05:56,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:05:56,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:05:56,903 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 11:05:56,920 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 11:05:56,921 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-02-02 11:05:56,921 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 11:05:56,921 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 11:05:56,921 INFO L182 omatonBuilderFactory]: Interpolants [1248#(not (= 0 |ldv_malloc_#t~malloc1.base|)), 1249#(not (= 0 |ldv_malloc_#res.base|)), 1218#true, 1219#false, 1237#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |~#a6.offset| |old(~#a6.offset)|) (= |old(#length)| |#length|) (= |~#a6.base| |old(~#a6.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 1238#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 1245#(not (= 0 |probe2_6_#t~ret4.base|)), 1246#(not (= 0 probe2_6_~p~0.base)), 1247#(and (= |#valid| |old(#valid)|) (= |old(#length)| |#length|))] [2018-02-02 11:05:56,921 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 11:05:56,921 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 11:05:56,922 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 11:05:56,922 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-02-02 11:05:56,922 INFO L87 Difference]: Start difference. First operand 107 states and 123 transitions. Second operand 9 states. [2018-02-02 11:05:57,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 11:05:57,072 INFO L93 Difference]: Finished difference Result 111 states and 126 transitions. [2018-02-02 11:05:57,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 11:05:57,072 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 24 [2018-02-02 11:05:57,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 11:05:57,073 INFO L225 Difference]: With dead ends: 111 [2018-02-02 11:05:57,073 INFO L226 Difference]: Without dead ends: 111 [2018-02-02 11:05:57,073 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2018-02-02 11:05:57,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-02-02 11:05:57,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 103. [2018-02-02 11:05:57,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-02-02 11:05:57,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 118 transitions. [2018-02-02 11:05:57,076 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 118 transitions. Word has length 24 [2018-02-02 11:05:57,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 11:05:57,077 INFO L432 AbstractCegarLoop]: Abstraction has 103 states and 118 transitions. [2018-02-02 11:05:57,077 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 11:05:57,077 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 118 transitions. [2018-02-02 11:05:57,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-02-02 11:05:57,077 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 11:05:57,077 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 11:05:57,077 INFO L371 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, probe2_6Err1RequiresViolation, probe2_6Err0RequiresViolation, probe2_6Err2RequiresViolation, probe2_6Err3RequiresViolation]=== [2018-02-02 11:05:57,077 INFO L82 PathProgramCache]: Analyzing trace with hash -510641866, now seen corresponding path program 1 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-02 11:05:57,080 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 11:05:57,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:05:57,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:05:57,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:05:57,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:05:57,134 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 11:05:57,149 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 11:05:57,149 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-02 11:05:57,150 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 11:05:57,150 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 11:05:57,150 INFO L182 omatonBuilderFactory]: Interpolants [1479#(= 0 |probe2_6_#t~ret4.offset|), 1480#(= 0 probe2_6_~p~0.offset), 1466#true, 1467#false, 1484#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |~#a6.offset| |old(~#a6.offset)|) (= |old(#length)| |#length|) (= |~#a6.base| |old(~#a6.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 1485#(and (= |#valid| |old(#valid)|) (= |old(#length)| |#length|)), 1486#(= 0 |ldv_malloc_#t~malloc1.offset|), 1487#(= 0 |ldv_malloc_#res.offset|)] [2018-02-02 11:05:57,150 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 11:05:57,150 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 11:05:57,150 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 11:05:57,150 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-02-02 11:05:57,151 INFO L87 Difference]: Start difference. First operand 103 states and 118 transitions. Second operand 8 states. [2018-02-02 11:05:57,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 11:05:57,317 INFO L93 Difference]: Finished difference Result 110 states and 125 transitions. [2018-02-02 11:05:57,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-02 11:05:57,318 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 26 [2018-02-02 11:05:57,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 11:05:57,318 INFO L225 Difference]: With dead ends: 110 [2018-02-02 11:05:57,318 INFO L226 Difference]: Without dead ends: 110 [2018-02-02 11:05:57,319 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2018-02-02 11:05:57,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-02-02 11:05:57,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 102. [2018-02-02 11:05:57,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-02-02 11:05:57,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 117 transitions. [2018-02-02 11:05:57,322 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 117 transitions. Word has length 26 [2018-02-02 11:05:57,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 11:05:57,322 INFO L432 AbstractCegarLoop]: Abstraction has 102 states and 117 transitions. [2018-02-02 11:05:57,322 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 11:05:57,322 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 117 transitions. [2018-02-02 11:05:57,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-02-02 11:05:57,322 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 11:05:57,322 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 11:05:57,323 INFO L371 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, probe2_6Err1RequiresViolation, probe2_6Err0RequiresViolation, probe2_6Err2RequiresViolation, probe2_6Err3RequiresViolation]=== [2018-02-02 11:05:57,323 INFO L82 PathProgramCache]: Analyzing trace with hash -510641865, now seen corresponding path program 1 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-02 11:05:57,328 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 11:05:57,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:05:57,341 WARN L195 Executor]: ExternalInterpolator (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in) stderr output: WARNING: array quantifier [2018-02-02 11:05:57,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:05:57,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:05:57,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:05:57,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 11:05:57,452 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 11:05:57,452 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-02 11:05:57,452 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 11:05:57,453 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 11:05:57,453 INFO L182 omatonBuilderFactory]: Interpolants [1728#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |~#a6.offset| |old(~#a6.offset)|) (= |old(#length)| |#length|) (= |~#a6.base| |old(~#a6.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 1729#(and (= |#valid| |old(#valid)|) (= |old(#length)| |#length|)), 1730#(= |#valid| |old(#valid)|), 1731#(= |#valid| (store |old(#valid)| |ldv_malloc_#t~malloc1.base| 1)), 1732#(= |#valid| (store |old(#valid)| |ldv_malloc_#res.base| 1)), 1723#(= 1 (select |#valid| |probe2_6_#t~ret4.base|)), 1724#(= 1 (select |#valid| probe2_6_~p~0.base)), 1710#true, 1711#false] [2018-02-02 11:05:57,453 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 11:05:57,453 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 11:05:57,453 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 11:05:57,454 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-02-02 11:05:57,454 INFO L87 Difference]: Start difference. First operand 102 states and 117 transitions. Second operand 9 states. [2018-02-02 11:05:57,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 11:05:57,623 INFO L93 Difference]: Finished difference Result 109 states and 124 transitions. [2018-02-02 11:05:57,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 11:05:57,624 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 26 [2018-02-02 11:05:57,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 11:05:57,625 INFO L225 Difference]: With dead ends: 109 [2018-02-02 11:05:57,625 INFO L226 Difference]: Without dead ends: 109 [2018-02-02 11:05:57,625 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2018-02-02 11:05:57,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-02-02 11:05:57,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 101. [2018-02-02 11:05:57,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-02-02 11:05:57,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 116 transitions. [2018-02-02 11:05:57,630 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 116 transitions. Word has length 26 [2018-02-02 11:05:57,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 11:05:57,630 INFO L432 AbstractCegarLoop]: Abstraction has 101 states and 116 transitions. [2018-02-02 11:05:57,630 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 11:05:57,630 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 116 transitions. [2018-02-02 11:05:57,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-02-02 11:05:57,631 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 11:05:57,631 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 11:05:57,631 INFO L371 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, probe2_6Err1RequiresViolation, probe2_6Err0RequiresViolation, probe2_6Err2RequiresViolation, probe2_6Err3RequiresViolation]=== [2018-02-02 11:05:57,631 INFO L82 PathProgramCache]: Analyzing trace with hash 188610762, now seen corresponding path program 1 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-02 11:05:57,634 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 11:05:57,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:05:57,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:05:57,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:05:57,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:05:57,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:05:57,672 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 11:05:57,688 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 11:05:57,688 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-02 11:05:57,688 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 11:05:57,688 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 11:05:57,688 INFO L182 omatonBuilderFactory]: Interpolants [1956#(and (= 0 |probe2_6_#t~ret4.offset|) (= 0 |probe2_6_#t~ret4.base|)), 1957#(and (= probe2_6_~p~0.base 0) (= probe2_6_~p~0.offset 0)), 1945#true, 1946#false, 1964#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |~#a6.offset| |old(~#a6.offset)|) (= |old(#length)| |#length|) (= |~#a6.base| |old(~#a6.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 1965#(and (= |#valid| |old(#valid)|) (= |old(#length)| |#length|)), 1966#(and (= 0 |ldv_malloc_#res.offset|) (= 0 |ldv_malloc_#res.base|))] [2018-02-02 11:05:57,688 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 11:05:57,688 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 11:05:57,688 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 11:05:57,689 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-02-02 11:05:57,689 INFO L87 Difference]: Start difference. First operand 101 states and 116 transitions. Second operand 7 states. [2018-02-02 11:05:57,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 11:05:57,804 INFO L93 Difference]: Finished difference Result 68 states and 72 transitions. [2018-02-02 11:05:57,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 11:05:57,804 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 30 [2018-02-02 11:05:57,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 11:05:57,805 INFO L225 Difference]: With dead ends: 68 [2018-02-02 11:05:57,805 INFO L226 Difference]: Without dead ends: 64 [2018-02-02 11:05:57,805 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-02-02 11:05:57,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-02-02 11:05:57,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2018-02-02 11:05:57,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-02-02 11:05:57,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 68 transitions. [2018-02-02 11:05:57,807 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 68 transitions. Word has length 30 [2018-02-02 11:05:57,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 11:05:57,807 INFO L432 AbstractCegarLoop]: Abstraction has 64 states and 68 transitions. [2018-02-02 11:05:57,807 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 11:05:57,807 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 68 transitions. [2018-02-02 11:05:57,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-02-02 11:05:57,808 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 11:05:57,808 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 11:05:57,808 INFO L371 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, probe2_6Err1RequiresViolation, probe2_6Err0RequiresViolation, probe2_6Err2RequiresViolation, probe2_6Err3RequiresViolation]=== [2018-02-02 11:05:57,809 INFO L82 PathProgramCache]: Analyzing trace with hash 1858419564, now seen corresponding path program 1 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-02 11:05:57,814 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 11:05:57,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:05:57,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:05:57,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:05:57,863 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-02 11:05:57,864 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-02 11:05:57,864 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-02 11:05:57,864 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-02 11:05:57,864 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-02 11:05:57,864 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-02 11:05:57,878 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 6 Received shutdown request... [2018-02-02 11:07:20,101 WARN L491 AbstractCegarLoop]: Verification canceled [2018-02-02 11:07:20,104 WARN L185 ceAbstractionStarter]: Timeout [2018-02-02 11:07:20,105 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.02 11:07:20 BoogieIcfgContainer [2018-02-02 11:07:20,105 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-02 11:07:20,105 INFO L168 Benchmark]: Toolchain (without parser) took 85437.70 ms. Allocated memory was 402.1 MB in the beginning and 685.2 MB in the end (delta: 283.1 MB). Free memory was 356.1 MB in the beginning and 488.9 MB in the end (delta: -132.8 MB). Peak memory consumption was 150.3 MB. Max. memory is 5.3 GB. [2018-02-02 11:07:20,106 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 402.1 MB. Free memory is still 362.8 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-02 11:07:20,106 INFO L168 Benchmark]: CACSL2BoogieTranslator took 168.90 ms. Allocated memory is still 402.1 MB. Free memory was 356.1 MB in the beginning and 342.9 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 5.3 GB. [2018-02-02 11:07:20,107 INFO L168 Benchmark]: Boogie Preprocessor took 28.83 ms. Allocated memory is still 402.1 MB. Free memory was 342.9 MB in the beginning and 341.6 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-02-02 11:07:20,107 INFO L168 Benchmark]: RCFGBuilder took 187.58 ms. Allocated memory is still 402.1 MB. Free memory was 341.6 MB in the beginning and 319.1 MB in the end (delta: 22.5 MB). Peak memory consumption was 22.5 MB. Max. memory is 5.3 GB. [2018-02-02 11:07:20,107 INFO L168 Benchmark]: TraceAbstraction took 85049.20 ms. Allocated memory was 402.1 MB in the beginning and 685.2 MB in the end (delta: 283.1 MB). Free memory was 319.1 MB in the beginning and 488.9 MB in the end (delta: -169.8 MB). Peak memory consumption was 113.3 MB. Max. memory is 5.3 GB. [2018-02-02 11:07:20,109 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.10 ms. Allocated memory is still 402.1 MB. Free memory is still 362.8 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 168.90 ms. Allocated memory is still 402.1 MB. Free memory was 356.1 MB in the beginning and 342.9 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 28.83 ms. Allocated memory is still 402.1 MB. Free memory was 342.9 MB in the beginning and 341.6 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 187.58 ms. Allocated memory is still 402.1 MB. Free memory was 341.6 MB in the beginning and 319.1 MB in the end (delta: 22.5 MB). Peak memory consumption was 22.5 MB. Max. memory is 5.3 GB. * TraceAbstraction took 85049.20 ms. Allocated memory was 402.1 MB in the beginning and 685.2 MB in the end (delta: 283.1 MB). Free memory was 319.1 MB in the beginning and 488.9 MB in the end (delta: -169.8 MB). Peak memory consumption was 113.3 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1467). Cancelled while BasicCegarLoop was analyzing trace of length 33 with TraceHistMax 1, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PartialQuantifierElimination was eliminating quantifiers from formula with 2 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 76. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1467). Cancelled while BasicCegarLoop was analyzing trace of length 33 with TraceHistMax 1, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PartialQuantifierElimination was eliminating quantifiers from formula with 2 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 76. - TimeoutResultAtElement [Line: 1478]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 1478). Cancelled while BasicCegarLoop was analyzing trace of length 33 with TraceHistMax 1, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PartialQuantifierElimination was eliminating quantifiers from formula with 2 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 76. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1463). Cancelled while BasicCegarLoop was analyzing trace of length 33 with TraceHistMax 1, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PartialQuantifierElimination was eliminating quantifiers from formula with 2 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 76. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1463). Cancelled while BasicCegarLoop was analyzing trace of length 33 with TraceHistMax 1, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PartialQuantifierElimination was eliminating quantifiers from formula with 2 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 76. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1463). Cancelled while BasicCegarLoop was analyzing trace of length 33 with TraceHistMax 1, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PartialQuantifierElimination was eliminating quantifiers from formula with 2 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 76. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1463). Cancelled while BasicCegarLoop was analyzing trace of length 33 with TraceHistMax 1, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PartialQuantifierElimination was eliminating quantifiers from formula with 2 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 76. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1475). Cancelled while BasicCegarLoop was analyzing trace of length 33 with TraceHistMax 1, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PartialQuantifierElimination was eliminating quantifiers from formula with 2 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 76. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1475). Cancelled while BasicCegarLoop was analyzing trace of length 33 with TraceHistMax 1, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PartialQuantifierElimination was eliminating quantifiers from formula with 2 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 76. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1454). Cancelled while BasicCegarLoop was analyzing trace of length 33 with TraceHistMax 1, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PartialQuantifierElimination was eliminating quantifiers from formula with 2 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 76. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1454). Cancelled while BasicCegarLoop was analyzing trace of length 33 with TraceHistMax 1, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PartialQuantifierElimination was eliminating quantifiers from formula with 2 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 76. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1458). Cancelled while BasicCegarLoop was analyzing trace of length 33 with TraceHistMax 1, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PartialQuantifierElimination was eliminating quantifiers from formula with 2 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 76. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1458). Cancelled while BasicCegarLoop was analyzing trace of length 33 with TraceHistMax 1, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PartialQuantifierElimination was eliminating quantifiers from formula with 2 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 76. - StatisticsResult: Ultimate Automizer benchmark data CFG has 9 procedures, 66 locations, 13 error locations. TIMEOUT Result, 85.0s OverallTime, 10 OverallIterations, 1 TraceHistogramMax, 1.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 523 SDtfs, 451 SDslu, 1134 SDs, 0 SdLazy, 1672 SolverSat, 149 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 107 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=107occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 9 MinimizatonAttempts, 79 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 186 NumberOfCodeBlocks, 186 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 177 ConstructedInterpolants, 2 QuantifiedInterpolants, 13683 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test6_1_false-valid-memtrack_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_z3.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-02_11-07-20-118.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test6_1_false-valid-memtrack_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_z3.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-02_11-07-20-118.csv Completed graceful shutdown