java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test4_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-5f7ec6e [2018-01-31 09:02:20,241 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-31 09:02:20,243 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-31 09:02:20,261 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-31 09:02:20,262 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-31 09:02:20,263 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-31 09:02:20,265 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-31 09:02:20,267 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-31 09:02:20,270 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-31 09:02:20,270 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-31 09:02:20,272 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-31 09:02:20,273 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-31 09:02:20,274 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-31 09:02:20,275 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-31 09:02:20,289 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-31 09:02:20,291 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-31 09:02:20,293 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-31 09:02:20,297 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-31 09:02:20,299 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-31 09:02:20,300 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-31 09:02:20,304 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-31 09:02:20,305 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-31 09:02:20,305 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-31 09:02:20,306 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-31 09:02:20,310 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-31 09:02:20,311 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-31 09:02:20,311 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-31 09:02:20,312 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-31 09:02:20,312 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-31 09:02:20,312 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-31 09:02:20,313 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-31 09:02:20,316 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf [2018-01-31 09:02:20,332 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-31 09:02:20,332 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-31 09:02:20,333 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-31 09:02:20,333 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-31 09:02:20,333 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-31 09:02:20,333 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-31 09:02:20,334 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-31 09:02:20,336 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-31 09:02:20,336 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-31 09:02:20,336 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-31 09:02:20,336 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-31 09:02:20,337 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-31 09:02:20,337 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-31 09:02:20,337 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-31 09:02:20,337 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-31 09:02:20,337 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-31 09:02:20,337 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-31 09:02:20,338 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-31 09:02:20,338 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-31 09:02:20,338 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-01-31 09:02:20,338 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-31 09:02:20,338 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-31 09:02:20,338 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-31 09:02:20,339 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-31 09:02:20,339 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-31 09:02:20,340 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-31 09:02:20,340 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-31 09:02:20,340 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-31 09:02:20,340 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-31 09:02:20,340 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-31 09:02:20,340 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-31 09:02:20,341 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-31 09:02:20,341 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-31 09:02:20,342 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-31 09:02:20,393 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-31 09:02:20,406 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-31 09:02:20,409 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-31 09:02:20,411 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-31 09:02:20,412 INFO L276 PluginConnector]: CDTParser initialized [2018-01-31 09:02:20,412 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test4_true-valid-memsafety_true-termination.i [2018-01-31 09:02:20,604 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-31 09:02:20,611 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-31 09:02:20,612 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-31 09:02:20,612 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-31 09:02:20,619 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-31 09:02:20,620 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 09:02:20" (1/1) ... [2018-01-31 09:02:20,626 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2888d76 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:02:20, skipping insertion in model container [2018-01-31 09:02:20,626 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 09:02:20" (1/1) ... [2018-01-31 09:02:20,645 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-31 09:02:20,722 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-31 09:02:20,875 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-31 09:02:20,895 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-31 09:02:20,901 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:02:20 WrapperNode [2018-01-31 09:02:20,901 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-31 09:02:20,902 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-31 09:02:20,902 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-31 09:02:20,902 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-31 09:02:20,912 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:02:20" (1/1) ... [2018-01-31 09:02:20,913 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:02:20" (1/1) ... [2018-01-31 09:02:20,922 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:02:20" (1/1) ... [2018-01-31 09:02:20,922 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:02:20" (1/1) ... [2018-01-31 09:02:20,926 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:02:20" (1/1) ... [2018-01-31 09:02:20,931 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:02:20" (1/1) ... [2018-01-31 09:02:20,932 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:02:20" (1/1) ... [2018-01-31 09:02:20,935 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-31 09:02:20,936 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-31 09:02:20,936 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-31 09:02:20,936 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-31 09:02:20,937 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:02:20" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-31 09:02:21,005 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-31 09:02:21,005 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-31 09:02:21,005 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-01-31 09:02:21,005 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-01-31 09:02:21,006 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-31 09:02:21,006 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-31 09:02:21,006 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-31 09:02:21,006 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-31 09:02:21,006 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-31 09:02:21,006 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-31 09:02:21,006 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-31 09:02:21,007 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-01-31 09:02:21,007 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-01-31 09:02:21,007 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-31 09:02:21,007 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-31 09:02:21,007 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-31 09:02:21,362 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-31 09:02:21,362 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 09:02:21 BoogieIcfgContainer [2018-01-31 09:02:21,363 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-31 09:02:21,364 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-31 09:02:21,364 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-31 09:02:21,368 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-31 09:02:21,369 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.01 09:02:20" (1/3) ... [2018-01-31 09:02:21,369 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31b1362f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 09:02:21, skipping insertion in model container [2018-01-31 09:02:21,370 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:02:20" (2/3) ... [2018-01-31 09:02:21,370 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31b1362f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 09:02:21, skipping insertion in model container [2018-01-31 09:02:21,370 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 09:02:21" (3/3) ... [2018-01-31 09:02:21,372 INFO L107 eAbstractionObserver]: Analyzing ICFG memleaks_test4_true-valid-memsafety_true-termination.i [2018-01-31 09:02:21,381 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-31 09:02:21,388 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2018-01-31 09:02:21,432 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-31 09:02:21,433 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-31 09:02:21,433 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-31 09:02:21,433 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-31 09:02:21,433 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-31 09:02:21,433 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-31 09:02:21,433 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-31 09:02:21,434 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-31 09:02:21,434 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-31 09:02:21,452 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states. [2018-01-31 09:02:21,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-01-31 09:02:21,459 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:02:21,460 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] [2018-01-31 09:02:21,460 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-31 09:02:21,466 INFO L82 PathProgramCache]: Analyzing trace with hash -465475539, now seen corresponding path program 1 times [2018-01-31 09:02:21,468 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:02:21,469 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:02:21,533 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:02:21,533 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:02:21,533 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:02:21,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:02:21,581 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:02:21,674 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 09:02:21,677 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 09:02:21,677 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-31 09:02:21,678 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-31 09:02:21,688 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-31 09:02:21,689 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-31 09:02:21,691 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 3 states. [2018-01-31 09:02:21,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:02:21,846 INFO L93 Difference]: Finished difference Result 52 states and 58 transitions. [2018-01-31 09:02:21,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-31 09:02:21,937 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-01-31 09:02:21,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:02:21,955 INFO L225 Difference]: With dead ends: 52 [2018-01-31 09:02:21,956 INFO L226 Difference]: Without dead ends: 45 [2018-01-31 09:02:21,961 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-31 09:02:21,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-01-31 09:02:21,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 39. [2018-01-31 09:02:22,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-01-31 09:02:22,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 42 transitions. [2018-01-31 09:02:22,003 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 42 transitions. Word has length 21 [2018-01-31 09:02:22,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:02:22,003 INFO L432 AbstractCegarLoop]: Abstraction has 39 states and 42 transitions. [2018-01-31 09:02:22,003 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-31 09:02:22,003 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2018-01-31 09:02:22,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-31 09:02:22,005 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:02:22,005 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] [2018-01-31 09:02:22,005 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-31 09:02:22,006 INFO L82 PathProgramCache]: Analyzing trace with hash -1682892646, now seen corresponding path program 1 times [2018-01-31 09:02:22,006 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:02:22,006 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:02:22,008 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:02:22,008 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:02:22,008 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:02:22,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:02:22,044 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:02:22,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-01-31 09:02:22,222 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 09:02:22,222 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-31 09:02:22,224 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-31 09:02:22,224 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-31 09:02:22,224 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-31 09:02:22,225 INFO L87 Difference]: Start difference. First operand 39 states and 42 transitions. Second operand 6 states. [2018-01-31 09:02:22,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:02:22,485 INFO L93 Difference]: Finished difference Result 53 states and 58 transitions. [2018-01-31 09:02:22,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-31 09:02:22,486 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2018-01-31 09:02:22,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:02:22,487 INFO L225 Difference]: With dead ends: 53 [2018-01-31 09:02:22,488 INFO L226 Difference]: Without dead ends: 49 [2018-01-31 09:02:22,489 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-01-31 09:02:22,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-01-31 09:02:22,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 34. [2018-01-31 09:02:22,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-01-31 09:02:22,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 35 transitions. [2018-01-31 09:02:22,496 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 35 transitions. Word has length 22 [2018-01-31 09:02:22,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:02:22,496 INFO L432 AbstractCegarLoop]: Abstraction has 34 states and 35 transitions. [2018-01-31 09:02:22,496 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-31 09:02:22,497 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2018-01-31 09:02:22,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-01-31 09:02:22,498 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:02:22,498 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:02:22,499 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-31 09:02:22,499 INFO L82 PathProgramCache]: Analyzing trace with hash 313499979, now seen corresponding path program 1 times [2018-01-31 09:02:22,500 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:02:22,500 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:02:22,502 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:02:22,502 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:02:22,502 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:02:22,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:02:22,535 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:02:22,625 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-01-31 09:02:22,626 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 09:02:22,626 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 09:02:22,640 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:02:22,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:02:22,693 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 09:02:22,789 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-01-31 09:02:22,812 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-31 09:02:22,812 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2018-01-31 09:02:22,812 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-31 09:02:22,813 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-31 09:02:22,813 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-01-31 09:02:22,813 INFO L87 Difference]: Start difference. First operand 34 states and 35 transitions. Second operand 8 states. [2018-01-31 09:02:22,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:02:22,973 INFO L93 Difference]: Finished difference Result 71 states and 74 transitions. [2018-01-31 09:02:22,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-31 09:02:22,973 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 29 [2018-01-31 09:02:22,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:02:22,974 INFO L225 Difference]: With dead ends: 71 [2018-01-31 09:02:22,975 INFO L226 Difference]: Without dead ends: 45 [2018-01-31 09:02:22,975 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2018-01-31 09:02:22,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-01-31 09:02:22,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 39. [2018-01-31 09:02:22,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-01-31 09:02:22,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 41 transitions. [2018-01-31 09:02:22,984 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 41 transitions. Word has length 29 [2018-01-31 09:02:22,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:02:22,984 INFO L432 AbstractCegarLoop]: Abstraction has 39 states and 41 transitions. [2018-01-31 09:02:22,984 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-31 09:02:22,984 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 41 transitions. [2018-01-31 09:02:22,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-01-31 09:02:22,986 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:02:22,986 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:02:22,986 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-31 09:02:22,987 INFO L82 PathProgramCache]: Analyzing trace with hash 412259511, now seen corresponding path program 1 times [2018-01-31 09:02:22,987 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:02:22,987 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:02:22,989 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:02:22,989 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:02:22,991 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:02:23,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:02:23,021 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:02:23,090 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-31 09:02:23,090 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 09:02:23,090 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-31 09:02:23,091 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-31 09:02:23,091 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-31 09:02:23,091 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-31 09:02:23,091 INFO L87 Difference]: Start difference. First operand 39 states and 41 transitions. Second operand 5 states. [2018-01-31 09:02:23,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:02:23,171 INFO L93 Difference]: Finished difference Result 40 states and 41 transitions. [2018-01-31 09:02:23,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-31 09:02:23,171 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2018-01-31 09:02:23,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:02:23,173 INFO L225 Difference]: With dead ends: 40 [2018-01-31 09:02:23,173 INFO L226 Difference]: Without dead ends: 39 [2018-01-31 09:02:23,173 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-31 09:02:23,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-01-31 09:02:23,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-01-31 09:02:23,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-01-31 09:02:23,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2018-01-31 09:02:23,180 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 30 [2018-01-31 09:02:23,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:02:23,180 INFO L432 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2018-01-31 09:02:23,180 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-31 09:02:23,180 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2018-01-31 09:02:23,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-01-31 09:02:23,181 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:02:23,181 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:02:23,182 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-31 09:02:23,182 INFO L82 PathProgramCache]: Analyzing trace with hash 749686255, now seen corresponding path program 1 times [2018-01-31 09:02:23,182 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:02:23,182 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:02:23,184 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:02:23,185 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:02:23,185 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:02:23,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:02:23,222 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:02:23,289 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-01-31 09:02:23,289 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 09:02:23,289 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-31 09:02:23,290 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-31 09:02:23,290 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-31 09:02:23,290 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-31 09:02:23,290 INFO L87 Difference]: Start difference. First operand 39 states and 40 transitions. Second operand 6 states. [2018-01-31 09:02:23,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:02:23,642 INFO L93 Difference]: Finished difference Result 39 states and 40 transitions. [2018-01-31 09:02:23,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-31 09:02:23,643 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2018-01-31 09:02:23,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:02:23,644 INFO L225 Difference]: With dead ends: 39 [2018-01-31 09:02:23,645 INFO L226 Difference]: Without dead ends: 38 [2018-01-31 09:02:23,645 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-01-31 09:02:23,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-01-31 09:02:23,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-01-31 09:02:23,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-01-31 09:02:23,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 39 transitions. [2018-01-31 09:02:23,655 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 39 transitions. Word has length 31 [2018-01-31 09:02:23,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:02:23,655 INFO L432 AbstractCegarLoop]: Abstraction has 38 states and 39 transitions. [2018-01-31 09:02:23,655 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-31 09:02:23,655 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 39 transitions. [2018-01-31 09:02:23,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-01-31 09:02:23,656 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:02:23,657 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:02:23,657 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-31 09:02:23,657 INFO L82 PathProgramCache]: Analyzing trace with hash 749686254, now seen corresponding path program 1 times [2018-01-31 09:02:23,657 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:02:23,657 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:02:23,661 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:02:23,661 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:02:23,661 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:02:23,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:02:23,693 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:02:23,857 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-01-31 09:02:23,858 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 09:02:23,858 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-31 09:02:23,858 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-31 09:02:23,858 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-31 09:02:23,859 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-31 09:02:23,859 INFO L87 Difference]: Start difference. First operand 38 states and 39 transitions. Second operand 6 states. [2018-01-31 09:02:23,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:02:23,892 INFO L93 Difference]: Finished difference Result 38 states and 39 transitions. [2018-01-31 09:02:23,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-31 09:02:23,893 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2018-01-31 09:02:23,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:02:23,894 INFO L225 Difference]: With dead ends: 38 [2018-01-31 09:02:23,895 INFO L226 Difference]: Without dead ends: 37 [2018-01-31 09:02:23,895 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-01-31 09:02:23,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-01-31 09:02:23,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 34. [2018-01-31 09:02:23,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-01-31 09:02:23,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 35 transitions. [2018-01-31 09:02:23,902 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 35 transitions. Word has length 31 [2018-01-31 09:02:23,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:02:23,903 INFO L432 AbstractCegarLoop]: Abstraction has 34 states and 35 transitions. [2018-01-31 09:02:23,903 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-31 09:02:23,903 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2018-01-31 09:02:23,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-01-31 09:02:23,904 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:02:23,904 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:02:23,904 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-31 09:02:23,905 INFO L82 PathProgramCache]: Analyzing trace with hash -104857044, now seen corresponding path program 1 times [2018-01-31 09:02:23,905 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:02:23,905 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:02:23,906 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:02:23,906 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:02:23,907 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:02:23,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:02:23,923 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:02:23,990 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-31 09:02:23,991 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 09:02:23,991 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 09:02:24,011 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:02:24,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:02:24,047 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 09:02:24,071 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-31 09:02:24,092 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 09:02:24,093 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-01-31 09:02:24,093 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-31 09:02:24,093 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-31 09:02:24,093 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-31 09:02:24,093 INFO L87 Difference]: Start difference. First operand 34 states and 35 transitions. Second operand 6 states. [2018-01-31 09:02:24,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:02:24,138 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2018-01-31 09:02:24,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-31 09:02:24,139 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2018-01-31 09:02:24,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:02:24,139 INFO L225 Difference]: With dead ends: 34 [2018-01-31 09:02:24,140 INFO L226 Difference]: Without dead ends: 33 [2018-01-31 09:02:24,140 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 29 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-01-31 09:02:24,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-01-31 09:02:24,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-01-31 09:02:24,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-01-31 09:02:24,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2018-01-31 09:02:24,145 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 31 [2018-01-31 09:02:24,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:02:24,146 INFO L432 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2018-01-31 09:02:24,146 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-31 09:02:24,146 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2018-01-31 09:02:24,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-01-31 09:02:24,147 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:02:24,147 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:02:24,147 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-31 09:02:24,148 INFO L82 PathProgramCache]: Analyzing trace with hash -104857043, now seen corresponding path program 1 times [2018-01-31 09:02:24,148 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:02:24,148 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:02:24,149 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:02:24,149 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:02:24,150 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:02:24,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:02:24,162 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:02:24,445 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 09:02:24,445 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 09:02:24,445 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 09:02:24,452 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:02:24,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:02:24,487 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 09:02:24,536 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-31 09:02:24,538 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 09:02:24,568 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 09:02:24,568 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-31 09:02:24,756 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 09:02:24,777 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 09:02:24,777 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-01-31 09:02:24,777 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-31 09:02:24,778 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-31 09:02:24,778 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-01-31 09:02:24,778 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand 10 states. [2018-01-31 09:02:24,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:02:24,997 INFO L93 Difference]: Finished difference Result 38 states and 39 transitions. [2018-01-31 09:02:24,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-31 09:02:24,997 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 31 [2018-01-31 09:02:24,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:02:24,998 INFO L225 Difference]: With dead ends: 38 [2018-01-31 09:02:24,998 INFO L226 Difference]: Without dead ends: 37 [2018-01-31 09:02:24,999 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 30 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2018-01-31 09:02:24,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-01-31 09:02:25,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-01-31 09:02:25,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-01-31 09:02:25,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2018-01-31 09:02:25,003 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 38 transitions. Word has length 31 [2018-01-31 09:02:25,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:02:25,004 INFO L432 AbstractCegarLoop]: Abstraction has 37 states and 38 transitions. [2018-01-31 09:02:25,004 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-31 09:02:25,004 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2018-01-31 09:02:25,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-01-31 09:02:25,005 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:02:25,005 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:02:25,005 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-31 09:02:25,005 INFO L82 PathProgramCache]: Analyzing trace with hash 1765437398, now seen corresponding path program 1 times [2018-01-31 09:02:25,005 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:02:25,005 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:02:25,007 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:02:25,008 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:02:25,008 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:02:25,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:02:25,026 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:02:25,473 WARN L143 SmtUtils]: Spent 128ms on a formula simplification that was a NOOP. DAG size: 17 [2018-01-31 09:02:25,512 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 09:02:25,512 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 09:02:25,512 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 09:02:25,520 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:02:25,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:02:25,543 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 09:02:25,547 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-31 09:02:25,547 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 09:02:25,548 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 09:02:25,548 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-31 09:02:25,606 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:02:25,607 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:02:25,610 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-01-31 09:02:25,610 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 09:02:25,618 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 09:02:25,618 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:19 [2018-01-31 09:02:25,668 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:02:25,669 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 15 [2018-01-31 09:02:25,670 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 09:02:25,694 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-31 09:02:25,694 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:15 [2018-01-31 09:02:25,754 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 09:02:25,787 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-31 09:02:25,787 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [10] total 15 [2018-01-31 09:02:25,788 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-01-31 09:02:25,788 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-01-31 09:02:25,788 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2018-01-31 09:02:25,789 INFO L87 Difference]: Start difference. First operand 37 states and 38 transitions. Second operand 16 states. [2018-01-31 09:02:26,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:02:26,211 INFO L93 Difference]: Finished difference Result 37 states and 38 transitions. [2018-01-31 09:02:26,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-31 09:02:26,211 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 32 [2018-01-31 09:02:26,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:02:26,212 INFO L225 Difference]: With dead ends: 37 [2018-01-31 09:02:26,212 INFO L226 Difference]: Without dead ends: 36 [2018-01-31 09:02:26,213 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 26 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=64, Invalid=316, Unknown=0, NotChecked=0, Total=380 [2018-01-31 09:02:26,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-01-31 09:02:26,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 32. [2018-01-31 09:02:26,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-01-31 09:02:26,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 33 transitions. [2018-01-31 09:02:26,218 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 33 transitions. Word has length 32 [2018-01-31 09:02:26,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:02:26,218 INFO L432 AbstractCegarLoop]: Abstraction has 32 states and 33 transitions. [2018-01-31 09:02:26,218 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-01-31 09:02:26,218 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2018-01-31 09:02:26,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-01-31 09:02:26,219 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:02:26,219 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:02:26,220 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-31 09:02:26,220 INFO L82 PathProgramCache]: Analyzing trace with hash -1354964509, now seen corresponding path program 1 times [2018-01-31 09:02:26,220 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:02:26,220 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:02:26,222 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:02:26,222 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:02:26,222 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:02:26,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:02:26,235 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:02:26,707 WARN L143 SmtUtils]: Spent 105ms on a formula simplification that was a NOOP. DAG size: 11 [2018-01-31 09:02:27,593 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-31 09:02:27,593 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 09:02:27,593 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 09:02:27,606 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:02:27,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:02:27,633 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 09:02:27,841 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-31 09:02:27,861 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 09:02:27,861 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11] total 17 [2018-01-31 09:02:27,862 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-01-31 09:02:27,862 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-01-31 09:02:27,862 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=251, Unknown=13, NotChecked=0, Total=306 [2018-01-31 09:02:27,862 INFO L87 Difference]: Start difference. First operand 32 states and 33 transitions. Second operand 18 states. [2018-01-31 09:02:28,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:02:28,263 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2018-01-31 09:02:28,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-01-31 09:02:28,264 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 34 [2018-01-31 09:02:28,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:02:28,265 INFO L225 Difference]: With dead ends: 40 [2018-01-31 09:02:28,265 INFO L226 Difference]: Without dead ends: 28 [2018-01-31 09:02:28,265 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 30 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=105, Invalid=584, Unknown=13, NotChecked=0, Total=702 [2018-01-31 09:02:28,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-01-31 09:02:28,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-01-31 09:02:28,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-01-31 09:02:28,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2018-01-31 09:02:28,271 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 34 [2018-01-31 09:02:28,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:02:28,271 INFO L432 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2018-01-31 09:02:28,272 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-01-31 09:02:28,272 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2018-01-31 09:02:28,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-01-31 09:02:28,272 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:02:28,273 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:02:28,273 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-31 09:02:28,273 INFO L82 PathProgramCache]: Analyzing trace with hash -2024003686, now seen corresponding path program 1 times [2018-01-31 09:02:28,273 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:02:28,273 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:02:28,274 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:02:28,275 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:02:28,275 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:02:28,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:02:28,290 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:02:28,911 WARN L146 SmtUtils]: Spent 163ms on a formula simplification. DAG size of input: 40 DAG size of output 20 [2018-01-31 09:02:28,915 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-01-31 09:02:28,916 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 09:02:28,916 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-31 09:02:28,916 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-31 09:02:28,916 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-31 09:02:28,916 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-01-31 09:02:28,917 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 10 states. [2018-01-31 09:02:29,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:02:29,173 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2018-01-31 09:02:29,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-01-31 09:02:29,174 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 35 [2018-01-31 09:02:29,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:02:29,174 INFO L225 Difference]: With dead ends: 28 [2018-01-31 09:02:29,174 INFO L226 Difference]: Without dead ends: 0 [2018-01-31 09:02:29,175 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 5 SyntacticMatches, 5 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2018-01-31 09:02:29,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-31 09:02:29,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-31 09:02:29,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-31 09:02:29,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-31 09:02:29,175 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 35 [2018-01-31 09:02:29,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:02:29,175 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-31 09:02:29,176 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-31 09:02:29,176 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-31 09:02:29,176 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-31 09:02:29,180 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-01-31 09:02:29,235 INFO L395 ceAbstractionStarter]: At program point ldv_mallocENTRY(lines 1072 1078) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-31 09:02:29,235 INFO L399 ceAbstractionStarter]: For program point L1073(line 1073) no Hoare annotation was computed. [2018-01-31 09:02:29,235 INFO L399 ceAbstractionStarter]: For program point L1073''(line 1073) no Hoare annotation was computed. [2018-01-31 09:02:29,235 INFO L399 ceAbstractionStarter]: For program point L1073'''(line 1073) no Hoare annotation was computed. [2018-01-31 09:02:29,236 INFO L399 ceAbstractionStarter]: For program point L1074'(line 1074) no Hoare annotation was computed. [2018-01-31 09:02:29,236 INFO L399 ceAbstractionStarter]: For program point ldv_mallocEXIT(lines 1072 1078) no Hoare annotation was computed. [2018-01-31 09:02:29,236 INFO L399 ceAbstractionStarter]: For program point L1073'(lines 1073 1077) no Hoare annotation was computed. [2018-01-31 09:02:29,236 INFO L399 ceAbstractionStarter]: For program point ldv_mallocFINAL(lines 1072 1078) no Hoare annotation was computed. [2018-01-31 09:02:29,236 INFO L399 ceAbstractionStarter]: For program point L1074(line 1074) no Hoare annotation was computed. [2018-01-31 09:02:29,236 INFO L399 ceAbstractionStarter]: For program point L1076(line 1076) no Hoare annotation was computed. [2018-01-31 09:02:29,236 INFO L399 ceAbstractionStarter]: For program point L1(lines 1 1444) no Hoare annotation was computed. [2018-01-31 09:02:29,236 INFO L399 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(lines 1 1444) no Hoare annotation was computed. [2018-01-31 09:02:29,236 INFO L395 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(lines 1 1444) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-31 09:02:29,236 INFO L399 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(lines 1 1444) no Hoare annotation was computed. [2018-01-31 09:02:29,236 INFO L402 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(lines 1 1444) the Hoare annotation is: true [2018-01-31 09:02:29,236 INFO L399 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 1444) no Hoare annotation was computed. [2018-01-31 09:02:29,236 INFO L402 ceAbstractionStarter]: At program point L1(lines 1 1444) the Hoare annotation is: true [2018-01-31 09:02:29,237 INFO L399 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 1444) no Hoare annotation was computed. [2018-01-31 09:02:29,237 INFO L395 ceAbstractionStarter]: At program point mainENTRY(lines 1442 1444) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-31 09:02:29,237 INFO L399 ceAbstractionStarter]: For program point mainFINAL(lines 1442 1444) no Hoare annotation was computed. [2018-01-31 09:02:29,237 INFO L399 ceAbstractionStarter]: For program point mainEXIT(lines 1442 1444) no Hoare annotation was computed. [2018-01-31 09:02:29,237 INFO L399 ceAbstractionStarter]: For program point mainErr0EnsuresViolation(lines 1442 1444) no Hoare annotation was computed. [2018-01-31 09:02:29,237 INFO L399 ceAbstractionStarter]: For program point entry_pointErr1RequiresViolation(lines 1 1444) no Hoare annotation was computed. [2018-01-31 09:02:29,237 INFO L399 ceAbstractionStarter]: For program point entry_pointErr2RequiresViolation(lines 1 1444) no Hoare annotation was computed. [2018-01-31 09:02:29,237 INFO L399 ceAbstractionStarter]: For program point entry_pointEXIT(lines 1433 1440) no Hoare annotation was computed. [2018-01-31 09:02:29,237 INFO L399 ceAbstractionStarter]: For program point L1434'(line 1434) no Hoare annotation was computed. [2018-01-31 09:02:29,237 INFO L399 ceAbstractionStarter]: For program point L1435'(lines 1435 1439) no Hoare annotation was computed. [2018-01-31 09:02:29,238 INFO L399 ceAbstractionStarter]: For program point L1436'(line 1436) no Hoare annotation was computed. [2018-01-31 09:02:29,238 INFO L399 ceAbstractionStarter]: For program point L1437'(line 1437) no Hoare annotation was computed. [2018-01-31 09:02:29,238 INFO L395 ceAbstractionStarter]: At program point entry_pointENTRY(lines 1433 1440) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-31 09:02:29,238 INFO L395 ceAbstractionStarter]: At program point L1436(line 1436) the Hoare annotation is: (let ((.cse0 (select |old(#valid)| entry_point_~p~7.base))) (and (not (= 0 entry_point_~p~7.base)) (= 0 .cse0) (= 1 (select |#valid| entry_point_~p~7.base)) (= entry_point_~p~7.offset 0) (= (store |#valid| entry_point_~p~7.base .cse0) |old(#valid)|))) [2018-01-31 09:02:29,238 INFO L399 ceAbstractionStarter]: For program point entry_pointErr0RequiresViolation(lines 1 1444) no Hoare annotation was computed. [2018-01-31 09:02:29,238 INFO L399 ceAbstractionStarter]: For program point entry_pointErr3RequiresViolation(lines 1 1444) no Hoare annotation was computed. [2018-01-31 09:02:29,238 INFO L399 ceAbstractionStarter]: For program point L1437(line 1437) no Hoare annotation was computed. [2018-01-31 09:02:29,238 INFO L399 ceAbstractionStarter]: For program point L1434(line 1434) no Hoare annotation was computed. [2018-01-31 09:02:29,238 INFO L399 ceAbstractionStarter]: For program point L1435(lines 1435 1439) no Hoare annotation was computed. [2018-01-31 09:02:29,238 INFO L399 ceAbstractionStarter]: For program point L1436''(line 1436) no Hoare annotation was computed. [2018-01-31 09:02:29,242 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.01 09:02:29 BoogieIcfgContainer [2018-01-31 09:02:29,242 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-31 09:02:29,243 INFO L168 Benchmark]: Toolchain (without parser) took 8638.22 ms. Allocated memory was 302.5 MB in the beginning and 511.2 MB in the end (delta: 208.7 MB). Free memory was 259.2 MB in the beginning and 395.4 MB in the end (delta: -136.2 MB). Peak memory consumption was 72.5 MB. Max. memory is 5.3 GB. [2018-01-31 09:02:29,244 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 302.5 MB. Free memory is still 266.2 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-31 09:02:29,244 INFO L168 Benchmark]: CACSL2BoogieTranslator took 289.68 ms. Allocated memory is still 302.5 MB. Free memory was 259.2 MB in the beginning and 246.3 MB in the end (delta: 13.0 MB). Peak memory consumption was 13.0 MB. Max. memory is 5.3 GB. [2018-01-31 09:02:29,244 INFO L168 Benchmark]: Boogie Preprocessor took 33.27 ms. Allocated memory is still 302.5 MB. Free memory was 246.3 MB in the beginning and 245.3 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 5.3 GB. [2018-01-31 09:02:29,245 INFO L168 Benchmark]: RCFGBuilder took 427.03 ms. Allocated memory is still 302.5 MB. Free memory was 245.3 MB in the beginning and 230.3 MB in the end (delta: 15.0 MB). Peak memory consumption was 15.0 MB. Max. memory is 5.3 GB. [2018-01-31 09:02:29,245 INFO L168 Benchmark]: TraceAbstraction took 7878.47 ms. Allocated memory was 302.5 MB in the beginning and 511.2 MB in the end (delta: 208.7 MB). Free memory was 230.3 MB in the beginning and 395.4 MB in the end (delta: -165.1 MB). Peak memory consumption was 43.6 MB. Max. memory is 5.3 GB. [2018-01-31 09:02:29,247 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 302.5 MB. Free memory is still 266.2 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 289.68 ms. Allocated memory is still 302.5 MB. Free memory was 259.2 MB in the beginning and 246.3 MB in the end (delta: 13.0 MB). Peak memory consumption was 13.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 33.27 ms. Allocated memory is still 302.5 MB. Free memory was 246.3 MB in the beginning and 245.3 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 5.3 GB. * RCFGBuilder took 427.03 ms. Allocated memory is still 302.5 MB. Free memory was 245.3 MB in the beginning and 230.3 MB in the end (delta: 15.0 MB). Peak memory consumption was 15.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 7878.47 ms. Allocated memory was 302.5 MB in the beginning and 511.2 MB in the end (delta: 208.7 MB). Free memory was 230.3 MB in the beginning and 395.4 MB in the end (delta: -165.1 MB). Peak memory consumption was 43.6 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1442]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 1]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 1]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 1]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 1]: free always succeeds For all program executions holds that free always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 5 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 37 locations, 5 error locations. SAFE Result, 7.8s OverallTime, 11 OverallIterations, 2 TraceHistogramMax, 2.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 336 SDtfs, 108 SDslu, 1185 SDs, 0 SdLazy, 710 SolverSat, 37 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 275 GetRequests, 157 SyntacticMatches, 14 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 4.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=39occurred in iteration=1, 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, 11 MinimizatonAttempts, 34 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 9 PreInvPairs, 10 NumberOfFragments, 40 HoareAnnotationTreeSize, 9 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 6 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 4.3s InterpolantComputationTime, 484 NumberOfCodeBlocks, 484 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 468 ConstructedInterpolants, 4 QuantifiedInterpolants, 65419 SizeOfPredicates, 18 NumberOfNonLiveVariables, 490 ConjunctsInSsa, 82 ConjunctsInUnsatCore, 16 InterpolantComputations, 8 PerfectInterpolantSequences, 72/89 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test4_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-31_09-02-29-256.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test4_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-31_09-02-29-256.csv Received shutdown request...