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_z3.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test6_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-ccafca9-m [2018-02-04 04:52:24,491 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-04 04:52:24,492 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-04 04:52:24,502 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-04 04:52:24,502 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-04 04:52:24,503 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-04 04:52:24,503 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-04 04:52:24,505 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-04 04:52:24,506 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-04 04:52:24,507 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-04 04:52:24,508 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-04 04:52:24,508 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-04 04:52:24,509 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-04 04:52:24,510 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-04 04:52:24,511 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-04 04:52:24,512 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-04 04:52:24,514 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-04 04:52:24,519 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-04 04:52:24,520 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-04 04:52:24,521 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-04 04:52:24,523 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-04 04:52:24,523 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-04 04:52:24,524 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-04 04:52:24,525 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-04 04:52:24,525 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-04 04:52:24,526 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-04 04:52:24,526 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-04 04:52:24,527 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-04 04:52:24,527 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-04 04:52:24,528 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-04 04:52:24,528 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-04 04:52:24,528 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_z3.epf [2018-02-04 04:52:24,538 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-04 04:52:24,539 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-04 04:52:24,540 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-04 04:52:24,540 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-04 04:52:24,540 INFO L133 SettingsManager]: * Use SBE=true [2018-02-04 04:52:24,540 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-04 04:52:24,540 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-04 04:52:24,541 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-04 04:52:24,541 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-04 04:52:24,541 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-04 04:52:24,541 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-04 04:52:24,541 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-04 04:52:24,541 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-04 04:52:24,542 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-04 04:52:24,542 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-04 04:52:24,542 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-04 04:52:24,542 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-04 04:52:24,542 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-04 04:52:24,542 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-04 04:52:24,542 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-04 04:52:24,543 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 04:52:24,543 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-04 04:52:24,543 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2018-02-04 04:52:24,543 INFO L133 SettingsManager]: * SMT solver=External_Z3InterpolationMode [2018-02-04 04:52:24,543 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 04:52:24,575 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-04 04:52:24,589 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-04 04:52:24,595 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-04 04:52:24,597 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-04 04:52:24,597 INFO L276 PluginConnector]: CDTParser initialized [2018-02-04 04:52:24,598 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test6_true-valid-memsafety_true-termination.i [2018-02-04 04:52:24,760 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-04 04:52:24,761 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-04 04:52:24,762 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-04 04:52:24,762 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-04 04:52:24,767 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-04 04:52:24,767 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 04:52:24" (1/1) ... [2018-02-04 04:52:24,770 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6d34c095 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:52:24, skipping insertion in model container [2018-02-04 04:52:24,770 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 04:52:24" (1/1) ... [2018-02-04 04:52:24,784 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 04:52:24,820 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 04:52:24,911 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 04:52:24,923 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 04:52:24,930 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:52:24 WrapperNode [2018-02-04 04:52:24,930 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-04 04:52:24,931 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-04 04:52:24,931 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-04 04:52:24,931 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-04 04:52:24,944 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:52:24" (1/1) ... [2018-02-04 04:52:24,944 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:52:24" (1/1) ... [2018-02-04 04:52:24,953 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:52:24" (1/1) ... [2018-02-04 04:52:24,953 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:52:24" (1/1) ... [2018-02-04 04:52:24,955 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:52:24" (1/1) ... [2018-02-04 04:52:24,957 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:52:24" (1/1) ... [2018-02-04 04:52:24,958 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:52:24" (1/1) ... [2018-02-04 04:52:24,959 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-04 04:52:24,959 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-04 04:52:24,959 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-04 04:52:24,959 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-04 04:52:24,960 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:52:24" (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-04 04:52:24,994 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-04 04:52:24,994 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-04 04:52:24,994 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-02-04 04:52:24,995 INFO L136 BoogieDeclarations]: Found implementation of procedure f6 [2018-02-04 04:52:24,995 INFO L136 BoogieDeclarations]: Found implementation of procedure g6 [2018-02-04 04:52:24,995 INFO L136 BoogieDeclarations]: Found implementation of procedure probe1_6 [2018-02-04 04:52:24,995 INFO L136 BoogieDeclarations]: Found implementation of procedure disconnect_6 [2018-02-04 04:52:24,995 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-02-04 04:52:24,995 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-04 04:52:24,995 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-04 04:52:24,995 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-04 04:52:24,995 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-04 04:52:24,995 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-04 04:52:24,996 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-04 04:52:24,996 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-04 04:52:24,996 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-04 04:52:24,996 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-04 04:52:24,996 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-02-04 04:52:24,996 INFO L128 BoogieDeclarations]: Found specification of procedure f6 [2018-02-04 04:52:24,996 INFO L128 BoogieDeclarations]: Found specification of procedure g6 [2018-02-04 04:52:24,996 INFO L128 BoogieDeclarations]: Found specification of procedure probe1_6 [2018-02-04 04:52:24,996 INFO L128 BoogieDeclarations]: Found specification of procedure disconnect_6 [2018-02-04 04:52:24,996 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-02-04 04:52:24,996 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-04 04:52:24,996 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-04 04:52:24,996 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-04 04:52:25,207 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-04 04:52:25,208 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 04:52:25 BoogieIcfgContainer [2018-02-04 04:52:25,208 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-04 04:52:25,208 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-04 04:52:25,209 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-04 04:52:25,211 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-04 04:52:25,212 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 04:52:24" (1/3) ... [2018-02-04 04:52:25,213 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38d5d576 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 04:52:25, skipping insertion in model container [2018-02-04 04:52:25,213 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:52:24" (2/3) ... [2018-02-04 04:52:25,214 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38d5d576 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 04:52:25, skipping insertion in model container [2018-02-04 04:52:25,214 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 04:52:25" (3/3) ... [2018-02-04 04:52:25,215 INFO L107 eAbstractionObserver]: Analyzing ICFG memleaks_test6_true-valid-memsafety_true-termination.i [2018-02-04 04:52:25,222 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2018-02-04 04:52:25,226 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 13 error locations. [2018-02-04 04:52:25,249 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-04 04:52:25,249 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-04 04:52:25,249 INFO L324 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2018-02-04 04:52:25,249 INFO L325 AbstractCegarLoop]: Backedges is CANONICAL [2018-02-04 04:52:25,250 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-04 04:52:25,250 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-04 04:52:25,250 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-04 04:52:25,250 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-04 04:52:25,250 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-04 04:52:25,261 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states. [2018-02-04 04:52:25,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-02-04 04:52:25,269 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:52:25,269 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-02-04 04:52:25,269 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-02-04 04:52:25,273 INFO L82 PathProgramCache]: Analyzing trace with hash 3262148, 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-04 04:52:25,282 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:52:25,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:52:25,322 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-04 04:52:25,342 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 04:52:25,343 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 04:52:25,343 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:52:25,344 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-04 04:52:25,344 INFO L182 omatonBuilderFactory]: Interpolants [69#true, 70#false, 71#(= 1 (select |#valid| |~#a6.base|))] [2018-02-04 04:52:25,344 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-04 04:52:25,345 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 04:52:25,355 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 04:52:25,355 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 04:52:25,357 INFO L87 Difference]: Start difference. First operand 66 states. Second operand 3 states. [2018-02-04 04:52:25,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:52:25,439 INFO L93 Difference]: Finished difference Result 79 states and 85 transitions. [2018-02-04 04:52:25,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 04:52:25,440 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2018-02-04 04:52:25,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:52:25,451 INFO L225 Difference]: With dead ends: 79 [2018-02-04 04:52:25,451 INFO L226 Difference]: Without dead ends: 76 [2018-02-04 04:52:25,453 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-04 04:52:25,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-02-04 04:52:25,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 67. [2018-02-04 04:52:25,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-02-04 04:52:25,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 73 transitions. [2018-02-04 04:52:25,486 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 73 transitions. Word has length 4 [2018-02-04 04:52:25,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:52:25,486 INFO L432 AbstractCegarLoop]: Abstraction has 67 states and 73 transitions. [2018-02-04 04:52:25,486 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 04:52:25,487 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 73 transitions. [2018-02-04 04:52:25,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-02-04 04:52:25,487 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:52:25,487 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-02-04 04:52:25,487 INFO L371 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-02-04 04:52:25,487 INFO L82 PathProgramCache]: Analyzing trace with hash 3262149, 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-04 04:52:25,490 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:52:25,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:52:25,507 WARN L195 Executor]: ExternalInterpolator (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in) stderr output: WARNING: array quantifier [2018-02-04 04:52:25,511 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-04 04:52:25,512 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-04 04:52:25,513 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-04 04:52:25,513 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-04 04:52:25,615 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-04 04:52:25,650 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-04 04:52:25,678 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 04:52:25,678 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 04:52:25,678 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:52:25,678 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-04 04:52:25,679 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-04 04:52:25,679 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-04 04:52:25,680 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 04:52:25,680 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 04:52:25,680 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=4, Unknown=1, NotChecked=2, Total=12 [2018-02-04 04:52:25,681 INFO L87 Difference]: Start difference. First operand 67 states and 73 transitions. Second operand 4 states. [2018-02-04 04:52:25,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:52:25,734 INFO L93 Difference]: Finished difference Result 116 states and 126 transitions. [2018-02-04 04:52:25,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 04:52:25,734 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2018-02-04 04:52:25,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:52:25,736 INFO L225 Difference]: With dead ends: 116 [2018-02-04 04:52:25,736 INFO L226 Difference]: Without dead ends: 116 [2018-02-04 04:52:25,737 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-04 04:52:25,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-02-04 04:52:25,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 103. [2018-02-04 04:52:25,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-02-04 04:52:25,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 123 transitions. [2018-02-04 04:52:25,753 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 123 transitions. Word has length 4 [2018-02-04 04:52:25,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:52:25,753 INFO L432 AbstractCegarLoop]: Abstraction has 103 states and 123 transitions. [2018-02-04 04:52:25,753 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 04:52:25,753 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 123 transitions. [2018-02-04 04:52:25,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-02-04 04:52:25,754 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:52:25,755 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-04 04:52:25,755 INFO L371 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-02-04 04:52:25,755 INFO L82 PathProgramCache]: Analyzing trace with hash -1144751463, 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) [2018-02-04 04:52:25,761 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 04:52:25,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:52:25,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:52:25,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:52:25,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:52:25,875 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-04 04:52:25,894 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 04:52:25,894 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-02-04 04:52:25,894 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:52:25,895 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-04 04:52:25,895 INFO L182 omatonBuilderFactory]: Interpolants [467#(= |probe1_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 probe1_6_~ret~0)] [2018-02-04 04:52:25,895 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-04 04:52:25,895 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 04:52:25,896 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 04:52:25,896 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-02-04 04:52:25,896 INFO L87 Difference]: Start difference. First operand 103 states and 123 transitions. Second operand 9 states. [2018-02-04 04:52:26,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:52:26,246 INFO L93 Difference]: Finished difference Result 126 states and 143 transitions. [2018-02-04 04:52:26,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-04 04:52:26,247 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 24 [2018-02-04 04:52:26,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:52:26,250 INFO L225 Difference]: With dead ends: 126 [2018-02-04 04:52:26,250 INFO L226 Difference]: Without dead ends: 117 [2018-02-04 04:52:26,250 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-04 04:52:26,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-02-04 04:52:26,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 106. [2018-02-04 04:52:26,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-02-04 04:52:26,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 124 transitions. [2018-02-04 04:52:26,264 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 124 transitions. Word has length 24 [2018-02-04 04:52:26,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:52:26,264 INFO L432 AbstractCegarLoop]: Abstraction has 106 states and 124 transitions. [2018-02-04 04:52:26,265 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 04:52:26,265 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 124 transitions. [2018-02-04 04:52:26,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-02-04 04:52:26,265 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:52:26,265 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-04 04:52:26,266 INFO L371 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-02-04 04:52:26,266 INFO L82 PathProgramCache]: Analyzing trace with hash 1288261138, 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-04 04:52:26,270 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:52:26,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:52:26,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:52:26,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:52:26,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:52:26,321 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-04 04:52:26,342 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 04:52:26,342 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 04:52:26,342 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:52:26,342 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-04 04:52:26,343 INFO L182 omatonBuilderFactory]: Interpolants [724#(= 0 |probe1_6_#t~ret4.offset|), 725#(= 0 probe1_6_~p~0.offset), 713#true, 729#(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)|)), 714#false, 730#(and (= |#valid| |old(#valid)|) (= |old(#length)| |#length|)), 731#(= 0 |ldv_malloc_#res.offset|)] [2018-02-04 04:52:26,343 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-04 04:52:26,343 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 04:52:26,343 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 04:52:26,343 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-02-04 04:52:26,343 INFO L87 Difference]: Start difference. First operand 106 states and 124 transitions. Second operand 7 states. [2018-02-04 04:52:26,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:52:26,561 INFO L93 Difference]: Finished difference Result 110 states and 125 transitions. [2018-02-04 04:52:26,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 04:52:26,562 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2018-02-04 04:52:26,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:52:26,563 INFO L225 Difference]: With dead ends: 110 [2018-02-04 04:52:26,563 INFO L226 Difference]: Without dead ends: 110 [2018-02-04 04:52:26,563 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-04 04:52:26,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-02-04 04:52:26,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 106. [2018-02-04 04:52:26,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-02-04 04:52:26,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 123 transitions. [2018-02-04 04:52:26,570 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 123 transitions. Word has length 24 [2018-02-04 04:52:26,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:52:26,570 INFO L432 AbstractCegarLoop]: Abstraction has 106 states and 123 transitions. [2018-02-04 04:52:26,570 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 04:52:26,570 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 123 transitions. [2018-02-04 04:52:26,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-02-04 04:52:26,571 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:52:26,571 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-04 04:52:26,571 INFO L371 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-02-04 04:52:26,571 INFO L82 PathProgramCache]: Analyzing trace with hash 1288261139, 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) [2018-02-04 04:52:26,582 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 04:52:26,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:52:26,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:52:26,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:52:26,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:52:26,651 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-04 04:52:26,680 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 04:52:26,681 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 04:52:26,681 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:52:26,681 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-04 04:52:26,681 INFO L182 omatonBuilderFactory]: Interpolants [967#(= 0 |probe1_6_#t~ret4.base|), 968#(= 0 probe1_6_~p~0.base), 956#true, 972#(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)|)), 957#false, 973#(and (= |#valid| |old(#valid)|) (= |old(#length)| |#length|)), 974#(= 0 |ldv_malloc_#res.base|)] [2018-02-04 04:52:26,681 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-04 04:52:26,682 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 04:52:26,682 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 04:52:26,682 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-02-04 04:52:26,682 INFO L87 Difference]: Start difference. First operand 106 states and 123 transitions. Second operand 7 states. [2018-02-04 04:52:26,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:52:26,898 INFO L93 Difference]: Finished difference Result 114 states and 128 transitions. [2018-02-04 04:52:26,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 04:52:26,898 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2018-02-04 04:52:26,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:52:26,899 INFO L225 Difference]: With dead ends: 114 [2018-02-04 04:52:26,899 INFO L226 Difference]: Without dead ends: 111 [2018-02-04 04:52:26,899 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-04 04:52:26,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-02-04 04:52:26,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 107. [2018-02-04 04:52:26,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-02-04 04:52:26,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 123 transitions. [2018-02-04 04:52:26,905 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 123 transitions. Word has length 24 [2018-02-04 04:52:26,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:52:26,905 INFO L432 AbstractCegarLoop]: Abstraction has 107 states and 123 transitions. [2018-02-04 04:52:26,906 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 04:52:26,906 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 123 transitions. [2018-02-04 04:52:26,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-02-04 04:52:26,906 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:52:26,906 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-04 04:52:26,906 INFO L371 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-02-04 04:52:26,907 INFO L82 PathProgramCache]: Analyzing trace with hash 1988329134, 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-04 04:52:26,911 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:52:26,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:52:26,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:52:26,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:52:26,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:52:26,981 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-04 04:52:26,997 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 04:52:26,997 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-02-04 04:52:26,997 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:52:26,998 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-04 04:52:26,998 INFO L182 omatonBuilderFactory]: Interpolants [1232#(not (= 0 probe1_6_~p~0.base)), 1233#(and (= |#valid| |old(#valid)|) (= |old(#length)| |#length|)), 1234#(not (= 0 |ldv_malloc_#t~malloc1.base|)), 1235#(not (= 0 |ldv_malloc_#res.base|)), 1204#true, 1205#false, 1223#(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)|)), 1224#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 1231#(not (= 0 |probe1_6_#t~ret4.base|))] [2018-02-04 04:52:26,998 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-04 04:52:26,998 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 04:52:26,998 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 04:52:26,998 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-02-04 04:52:26,999 INFO L87 Difference]: Start difference. First operand 107 states and 123 transitions. Second operand 9 states. [2018-02-04 04:52:27,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:52:27,106 INFO L93 Difference]: Finished difference Result 106 states and 120 transitions. [2018-02-04 04:52:27,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 04:52:27,106 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 24 [2018-02-04 04:52:27,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:52:27,107 INFO L225 Difference]: With dead ends: 106 [2018-02-04 04:52:27,107 INFO L226 Difference]: Without dead ends: 106 [2018-02-04 04:52:27,107 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-04 04:52:27,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-02-04 04:52:27,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 103. [2018-02-04 04:52:27,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-02-04 04:52:27,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 118 transitions. [2018-02-04 04:52:27,112 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 118 transitions. Word has length 24 [2018-02-04 04:52:27,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:52:27,112 INFO L432 AbstractCegarLoop]: Abstraction has 103 states and 118 transitions. [2018-02-04 04:52:27,112 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 04:52:27,112 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 118 transitions. [2018-02-04 04:52:27,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-02-04 04:52:27,113 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:52:27,113 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-04 04:52:27,113 INFO L371 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-02-04 04:52:27,114 INFO L82 PathProgramCache]: Analyzing trace with hash 1956813492, 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-04 04:52:27,117 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:52:27,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:52:27,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:52:27,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:52:27,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:52:27,154 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-04 04:52:27,171 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 04:52:27,171 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-04 04:52:27,171 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:52:27,171 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-04 04:52:27,171 INFO L182 omatonBuilderFactory]: Interpolants [1460#(= 0 |probe1_6_#t~ret4.offset|), 1461#(= 0 probe1_6_~p~0.offset), 1447#true, 1448#false, 1465#(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)|)), 1466#(and (= |#valid| |old(#valid)|) (= |old(#length)| |#length|)), 1467#(= 0 |ldv_malloc_#t~malloc1.offset|), 1468#(= 0 |ldv_malloc_#res.offset|)] [2018-02-04 04:52:27,171 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-04 04:52:27,172 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 04:52:27,172 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 04:52:27,172 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-02-04 04:52:27,172 INFO L87 Difference]: Start difference. First operand 103 states and 118 transitions. Second operand 8 states. [2018-02-04 04:52:27,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:52:27,347 INFO L93 Difference]: Finished difference Result 105 states and 119 transitions. [2018-02-04 04:52:27,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-04 04:52:27,348 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 26 [2018-02-04 04:52:27,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:52:27,348 INFO L225 Difference]: With dead ends: 105 [2018-02-04 04:52:27,348 INFO L226 Difference]: Without dead ends: 105 [2018-02-04 04:52:27,349 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-04 04:52:27,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-02-04 04:52:27,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 102. [2018-02-04 04:52:27,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-02-04 04:52:27,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 117 transitions. [2018-02-04 04:52:27,353 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 117 transitions. Word has length 26 [2018-02-04 04:52:27,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:52:27,354 INFO L432 AbstractCegarLoop]: Abstraction has 102 states and 117 transitions. [2018-02-04 04:52:27,354 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 04:52:27,354 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 117 transitions. [2018-02-04 04:52:27,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-02-04 04:52:27,355 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:52:27,355 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-04 04:52:27,355 INFO L371 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-02-04 04:52:27,355 INFO L82 PathProgramCache]: Analyzing trace with hash 1956813493, 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-04 04:52:27,357 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:52:27,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:52:27,366 WARN L195 Executor]: ExternalInterpolator (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in) stderr output: WARNING: array quantifier [2018-02-04 04:52:27,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:52:27,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:52:27,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:52:27,416 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:52:27,433 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 04:52:27,433 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-04 04:52:27,433 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:52:27,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-04 04:52:27,434 INFO L182 omatonBuilderFactory]: Interpolants [1699#(= 1 (select |#valid| |probe1_6_#t~ret4.base|)), 1700#(= 1 (select |#valid| probe1_6_~p~0.base)), 1686#true, 1687#false, 1704#(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)|)), 1705#(and (= |#valid| |old(#valid)|) (= |old(#length)| |#length|)), 1706#(= |#valid| |old(#valid)|), 1707#(= |#valid| (store |old(#valid)| |ldv_malloc_#t~malloc1.base| 1)), 1708#(= |#valid| (store |old(#valid)| |ldv_malloc_#res.base| 1))] [2018-02-04 04:52:27,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-04 04:52:27,434 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 04:52:27,434 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 04:52:27,434 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-02-04 04:52:27,434 INFO L87 Difference]: Start difference. First operand 102 states and 117 transitions. Second operand 9 states. [2018-02-04 04:52:27,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:52:27,637 INFO L93 Difference]: Finished difference Result 104 states and 118 transitions. [2018-02-04 04:52:27,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 04:52:27,638 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 26 [2018-02-04 04:52:27,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:52:27,639 INFO L225 Difference]: With dead ends: 104 [2018-02-04 04:52:27,639 INFO L226 Difference]: Without dead ends: 104 [2018-02-04 04:52:27,639 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-04 04:52:27,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-02-04 04:52:27,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 101. [2018-02-04 04:52:27,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-02-04 04:52:27,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 116 transitions. [2018-02-04 04:52:27,644 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 116 transitions. Word has length 26 [2018-02-04 04:52:27,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:52:27,645 INFO L432 AbstractCegarLoop]: Abstraction has 101 states and 116 transitions. [2018-02-04 04:52:27,645 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 04:52:27,645 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 116 transitions. [2018-02-04 04:52:27,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-02-04 04:52:27,646 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:52:27,646 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-04 04:52:27,646 INFO L371 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-02-04 04:52:27,646 INFO L82 PathProgramCache]: Analyzing trace with hash 1035644871, 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-04 04:52:27,649 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:52:27,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:52:27,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:52:27,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:52:27,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:52:27,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:52:27,699 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-04 04:52:27,728 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 04:52:27,728 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-04 04:52:27,729 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:52:27,729 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-04 04:52:27,729 INFO L182 omatonBuilderFactory]: Interpolants [1936#(and (= |#valid| |old(#valid)|) (= |old(#length)| |#length|)), 1937#(and (= 0 |ldv_malloc_#res.offset|) (= 0 |ldv_malloc_#res.base|)), 1927#(and (= 0 |probe1_6_#t~ret4.base|) (= 0 |probe1_6_#t~ret4.offset|)), 1928#(and (= probe1_6_~p~0.offset 0) (= probe1_6_~p~0.base 0)), 1916#true, 1917#false, 1935#(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)|))] [2018-02-04 04:52:27,729 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-04 04:52:27,729 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 04:52:27,729 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 04:52:27,729 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-02-04 04:52:27,730 INFO L87 Difference]: Start difference. First operand 101 states and 116 transitions. Second operand 7 states. [2018-02-04 04:52:27,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:52:27,815 INFO L93 Difference]: Finished difference Result 68 states and 72 transitions. [2018-02-04 04:52:27,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 04:52:27,815 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 30 [2018-02-04 04:52:27,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:52:27,815 INFO L225 Difference]: With dead ends: 68 [2018-02-04 04:52:27,815 INFO L226 Difference]: Without dead ends: 64 [2018-02-04 04:52:27,816 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-04 04:52:27,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-02-04 04:52:27,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2018-02-04 04:52:27,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-02-04 04:52:27,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 68 transitions. [2018-02-04 04:52:27,817 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 68 transitions. Word has length 30 [2018-02-04 04:52:27,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:52:27,817 INFO L432 AbstractCegarLoop]: Abstraction has 64 states and 68 transitions. [2018-02-04 04:52:27,818 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 04:52:27,818 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 68 transitions. [2018-02-04 04:52:27,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-02-04 04:52:27,818 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:52:27,818 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-04 04:52:27,819 INFO L371 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-02-04 04:52:27,819 INFO L82 PathProgramCache]: Analyzing trace with hash 840727273, 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-04 04:52:27,824 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:52:27,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:52:27,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:52:27,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:52:27,862 WARN L195 Executor]: ExternalInterpolator (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in) stderr output: WARNING: array quantifier [2018-02-04 04:52:27,876 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-04 04:52:27,877 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-04 04:52:27,877 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-04 04:52:27,877 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-04 04:52:27,877 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-04 04:52:27,878 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-04 04:52:27,896 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-02-04 04:56:06,500 WARN L143 SmtUtils]: Spent 218590ms on a formula simplification that was a NOOP. DAG size: 76 [2018-02-04 04:56:10,505 WARN L686 Elim1Store]: solver failed to check if following not equals relation is implied: (= %0 v_prenex_5) [2018-02-04 04:56:12,508 WARN L669 Elim1Store]: solver failed to check if following equality is implied: (= 1 (select v_prenex_1 v_prenex_5)) [2018-02-04 04:56:14,509 WARN L686 Elim1Store]: solver failed to check if following not equals relation is implied: (= 1 (select v_prenex_1 v_prenex_5)) [2018-02-04 04:56:14,509 INFO L303 Elim1Store]: Index analysis took 8008 ms Received shutdown request... [2018-02-04 04:56:18,515 WARN L491 AbstractCegarLoop]: Verification canceled [2018-02-04 04:56:18,518 WARN L185 ceAbstractionStarter]: Timeout [2018-02-04 04:56:18,519 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.02 04:56:18 BoogieIcfgContainer [2018-02-04 04:56:18,519 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-04 04:56:18,519 INFO L168 Benchmark]: Toolchain (without parser) took 233758.74 ms. Allocated memory was 403.2 MB in the beginning and 655.9 MB in the end (delta: 252.7 MB). Free memory was 360.1 MB in the beginning and 449.6 MB in the end (delta: -89.5 MB). Peak memory consumption was 163.2 MB. Max. memory is 5.3 GB. [2018-02-04 04:56:18,520 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 403.2 MB. Free memory is still 365.3 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 04:56:18,520 INFO L168 Benchmark]: CACSL2BoogieTranslator took 168.48 ms. Allocated memory is still 403.2 MB. Free memory was 360.1 MB in the beginning and 346.8 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 5.3 GB. [2018-02-04 04:56:18,521 INFO L168 Benchmark]: Boogie Preprocessor took 28.35 ms. Allocated memory is still 403.2 MB. Free memory was 346.8 MB in the beginning and 344.2 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. [2018-02-04 04:56:18,521 INFO L168 Benchmark]: RCFGBuilder took 248.82 ms. Allocated memory is still 403.2 MB. Free memory was 344.2 MB in the beginning and 322.2 MB in the end (delta: 22.0 MB). Peak memory consumption was 22.0 MB. Max. memory is 5.3 GB. [2018-02-04 04:56:18,521 INFO L168 Benchmark]: TraceAbstraction took 233310.45 ms. Allocated memory was 403.2 MB in the beginning and 655.9 MB in the end (delta: 252.7 MB). Free memory was 322.2 MB in the beginning and 449.6 MB in the end (delta: -127.3 MB). Peak memory consumption was 125.4 MB. Max. memory is 5.3 GB. [2018-02-04 04:56:18,523 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.18 ms. Allocated memory is still 403.2 MB. Free memory is still 365.3 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 168.48 ms. Allocated memory is still 403.2 MB. Free memory was 360.1 MB in the beginning and 346.8 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.35 ms. Allocated memory is still 403.2 MB. Free memory was 346.8 MB in the beginning and 344.2 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 248.82 ms. Allocated memory is still 403.2 MB. Free memory was 344.2 MB in the beginning and 322.2 MB in the end (delta: 22.0 MB). Peak memory consumption was 22.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 233310.45 ms. Allocated memory was 403.2 MB in the beginning and 655.9 MB in the end (delta: 252.7 MB). Free memory was 322.2 MB in the beginning and 449.6 MB in the end (delta: -127.3 MB). Peak memory consumption was 125.4 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 1466). 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 13. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1466). 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 13. - TimeoutResultAtElement [Line: 1476]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 1476). 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 13. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1462). 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 13. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1462). 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 13. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1462). 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 13. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1462). 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 13. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1473). 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 13. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1473). 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 13. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1453). 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 13. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1457). 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 13. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1457). 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 13. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1453). 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 13. - StatisticsResult: Ultimate Automizer benchmark data CFG has 9 procedures, 66 locations, 13 error locations. TIMEOUT Result, 233.2s OverallTime, 10 OverallIterations, 1 TraceHistogramMax, 1.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 518 SDtfs, 471 SDslu, 1140 SDs, 0 SdLazy, 1502 SolverSat, 163 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 107 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.5s 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, 50 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.5s 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_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_z3.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-04_04-56-18-531.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test6_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_z3.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-04_04-56-18-531.csv Completed graceful shutdown