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_test17_2_false-valid-free.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-5f7ec6e [2018-01-31 08:43:45,491 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-31 08:43:45,492 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-31 08:43:45,510 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-31 08:43:45,511 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-31 08:43:45,511 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-31 08:43:45,513 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-31 08:43:45,514 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-31 08:43:45,516 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-31 08:43:45,517 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-31 08:43:45,518 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-31 08:43:45,518 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-31 08:43:45,519 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-31 08:43:45,522 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-31 08:43:45,523 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-31 08:43:45,535 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-31 08:43:45,538 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-31 08:43:45,541 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-31 08:43:45,543 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-31 08:43:45,544 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-31 08:43:45,549 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-31 08:43:45,550 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-31 08:43:45,550 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-31 08:43:45,551 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-31 08:43:45,551 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-31 08:43:45,556 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-31 08:43:45,556 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-31 08:43:45,557 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-31 08:43:45,557 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-31 08:43:45,557 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-31 08:43:45,558 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-31 08:43:45,558 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 08:43:45,575 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-31 08:43:45,575 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-31 08:43:45,576 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-31 08:43:45,576 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-31 08:43:45,576 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-31 08:43:45,577 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-31 08:43:45,577 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-31 08:43:45,577 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-31 08:43:45,577 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-31 08:43:45,578 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-31 08:43:45,578 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-31 08:43:45,579 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-31 08:43:45,579 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-31 08:43:45,579 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-31 08:43:45,579 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-31 08:43:45,579 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-31 08:43:45,579 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-31 08:43:45,580 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-31 08:43:45,580 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-31 08:43:45,580 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-01-31 08:43:45,580 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-31 08:43:45,580 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-31 08:43:45,580 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-31 08:43:45,581 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-31 08:43:45,581 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-31 08:43:45,581 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-31 08:43:45,581 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-31 08:43:45,581 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-31 08:43:45,582 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-31 08:43:45,582 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-31 08:43:45,583 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-31 08:43:45,583 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-31 08:43:45,584 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-31 08:43:45,584 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-31 08:43:45,635 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-31 08:43:45,650 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-31 08:43:45,655 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-31 08:43:45,656 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-31 08:43:45,657 INFO L276 PluginConnector]: CDTParser initialized [2018-01-31 08:43:45,658 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test17_2_false-valid-free.i [2018-01-31 08:43:45,868 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-31 08:43:45,878 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-31 08:43:45,879 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-31 08:43:45,879 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-31 08:43:45,885 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-31 08:43:45,886 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 08:43:45" (1/1) ... [2018-01-31 08:43:45,889 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c884762 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:43:45, skipping insertion in model container [2018-01-31 08:43:45,890 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 08:43:45" (1/1) ... [2018-01-31 08:43:45,909 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-31 08:43:45,992 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-31 08:43:46,179 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-31 08:43:46,209 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-31 08:43:46,225 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:43:46 WrapperNode [2018-01-31 08:43:46,226 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-31 08:43:46,226 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-31 08:43:46,227 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-31 08:43:46,227 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-31 08:43:46,251 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:43:46" (1/1) ... [2018-01-31 08:43:46,251 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:43:46" (1/1) ... [2018-01-31 08:43:46,262 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:43:46" (1/1) ... [2018-01-31 08:43:46,262 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:43:46" (1/1) ... [2018-01-31 08:43:46,267 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:43:46" (1/1) ... [2018-01-31 08:43:46,271 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:43:46" (1/1) ... [2018-01-31 08:43:46,272 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:43:46" (1/1) ... [2018-01-31 08:43:46,274 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-31 08:43:46,275 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-31 08:43:46,275 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-31 08:43:46,275 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-31 08:43:46,276 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:43:46" (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 08:43:46,338 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-31 08:43:46,338 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-31 08:43:46,338 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-01-31 08:43:46,338 INFO L136 BoogieDeclarations]: Found implementation of procedure alloc_unsafe_17 [2018-01-31 08:43:46,338 INFO L136 BoogieDeclarations]: Found implementation of procedure free_17 [2018-01-31 08:43:46,338 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-01-31 08:43:46,339 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-31 08:43:46,339 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-31 08:43:46,339 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-31 08:43:46,339 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-31 08:43:46,339 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-31 08:43:46,339 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-31 08:43:46,339 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-31 08:43:46,340 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-31 08:43:46,340 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-31 08:43:46,340 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-01-31 08:43:46,340 INFO L128 BoogieDeclarations]: Found specification of procedure alloc_unsafe_17 [2018-01-31 08:43:46,340 INFO L128 BoogieDeclarations]: Found specification of procedure free_17 [2018-01-31 08:43:46,340 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-01-31 08:43:46,340 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-31 08:43:46,341 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-31 08:43:46,341 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-31 08:43:46,925 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-31 08:43:46,926 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 08:43:46 BoogieIcfgContainer [2018-01-31 08:43:46,926 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-31 08:43:46,927 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-31 08:43:46,928 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-31 08:43:46,932 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-31 08:43:46,932 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.01 08:43:45" (1/3) ... [2018-01-31 08:43:46,933 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@406b36fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 08:43:46, skipping insertion in model container [2018-01-31 08:43:46,933 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:43:46" (2/3) ... [2018-01-31 08:43:46,933 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@406b36fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 08:43:46, skipping insertion in model container [2018-01-31 08:43:46,933 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 08:43:46" (3/3) ... [2018-01-31 08:43:46,935 INFO L107 eAbstractionObserver]: Analyzing ICFG memleaks_test17_2_false-valid-free.i [2018-01-31 08:43:46,944 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-31 08:43:46,953 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 15 error locations. [2018-01-31 08:43:46,988 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-31 08:43:46,988 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-31 08:43:46,989 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-31 08:43:46,989 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-31 08:43:46,989 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-31 08:43:46,989 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-31 08:43:46,989 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-31 08:43:46,989 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-31 08:43:46,990 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-31 08:43:47,013 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states. [2018-01-31 08:43:47,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-31 08:43:47,023 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:43:47,025 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] [2018-01-31 08:43:47,025 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation, alloc_unsafe_17Err1RequiresViolation, alloc_unsafe_17Err3RequiresViolation, alloc_unsafe_17Err2RequiresViolation, alloc_unsafe_17Err4RequiresViolation, alloc_unsafe_17Err0RequiresViolation, alloc_unsafe_17Err5RequiresViolation]=== [2018-01-31 08:43:47,031 INFO L82 PathProgramCache]: Analyzing trace with hash -1597802234, now seen corresponding path program 1 times [2018-01-31 08:43:47,033 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:43:47,034 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:43:47,101 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:43:47,101 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:43:47,101 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:43:47,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:43:47,176 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:43:47,334 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 08:43:47,338 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:43:47,339 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-31 08:43:47,341 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-31 08:43:47,483 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-31 08:43:47,483 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-31 08:43:47,486 INFO L87 Difference]: Start difference. First operand 97 states. Second operand 3 states. [2018-01-31 08:43:47,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:43:47,955 INFO L93 Difference]: Finished difference Result 230 states and 270 transitions. [2018-01-31 08:43:47,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-31 08:43:47,957 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-01-31 08:43:47,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:43:47,969 INFO L225 Difference]: With dead ends: 230 [2018-01-31 08:43:47,970 INFO L226 Difference]: Without dead ends: 149 [2018-01-31 08:43:47,974 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 08:43:47,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2018-01-31 08:43:48,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 99. [2018-01-31 08:43:48,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-01-31 08:43:48,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 107 transitions. [2018-01-31 08:43:48,027 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 107 transitions. Word has length 23 [2018-01-31 08:43:48,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:43:48,027 INFO L432 AbstractCegarLoop]: Abstraction has 99 states and 107 transitions. [2018-01-31 08:43:48,027 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-31 08:43:48,027 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 107 transitions. [2018-01-31 08:43:48,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-31 08:43:48,029 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:43:48,030 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-01-31 08:43:48,030 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation, alloc_unsafe_17Err1RequiresViolation, alloc_unsafe_17Err3RequiresViolation, alloc_unsafe_17Err2RequiresViolation, alloc_unsafe_17Err4RequiresViolation, alloc_unsafe_17Err0RequiresViolation, alloc_unsafe_17Err5RequiresViolation]=== [2018-01-31 08:43:48,030 INFO L82 PathProgramCache]: Analyzing trace with hash -442809342, now seen corresponding path program 1 times [2018-01-31 08:43:48,030 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:43:48,031 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:43:48,032 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:43:48,033 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:43:48,033 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:43:48,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:43:48,053 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:43:48,155 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 08:43:48,156 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:43:48,156 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-31 08:43:48,158 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-31 08:43:48,158 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-31 08:43:48,158 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-31 08:43:48,159 INFO L87 Difference]: Start difference. First operand 99 states and 107 transitions. Second operand 6 states. [2018-01-31 08:43:48,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:43:48,407 INFO L93 Difference]: Finished difference Result 120 states and 131 transitions. [2018-01-31 08:43:48,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-31 08:43:48,442 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2018-01-31 08:43:48,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:43:48,444 INFO L225 Difference]: With dead ends: 120 [2018-01-31 08:43:48,445 INFO L226 Difference]: Without dead ends: 116 [2018-01-31 08:43:48,445 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 08:43:48,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-01-31 08:43:48,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 94. [2018-01-31 08:43:48,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-01-31 08:43:48,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 100 transitions. [2018-01-31 08:43:48,457 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 100 transitions. Word has length 24 [2018-01-31 08:43:48,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:43:48,458 INFO L432 AbstractCegarLoop]: Abstraction has 94 states and 100 transitions. [2018-01-31 08:43:48,458 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-31 08:43:48,458 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 100 transitions. [2018-01-31 08:43:48,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-31 08:43:48,459 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:43:48,459 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-01-31 08:43:48,459 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation, alloc_unsafe_17Err1RequiresViolation, alloc_unsafe_17Err3RequiresViolation, alloc_unsafe_17Err2RequiresViolation, alloc_unsafe_17Err4RequiresViolation, alloc_unsafe_17Err0RequiresViolation, alloc_unsafe_17Err5RequiresViolation]=== [2018-01-31 08:43:48,459 INFO L82 PathProgramCache]: Analyzing trace with hash 2007837378, now seen corresponding path program 1 times [2018-01-31 08:43:48,460 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:43:48,460 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:43:48,461 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:43:48,462 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:43:48,462 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:43:48,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:43:48,475 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:43:48,593 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 08:43:48,594 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:43:48,594 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-31 08:43:48,594 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-31 08:43:48,594 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-31 08:43:48,594 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-31 08:43:48,595 INFO L87 Difference]: Start difference. First operand 94 states and 100 transitions. Second operand 5 states. [2018-01-31 08:43:48,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:43:48,640 INFO L93 Difference]: Finished difference Result 180 states and 192 transitions. [2018-01-31 08:43:48,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-31 08:43:48,642 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2018-01-31 08:43:48,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:43:48,643 INFO L225 Difference]: With dead ends: 180 [2018-01-31 08:43:48,643 INFO L226 Difference]: Without dead ends: 96 [2018-01-31 08:43:48,644 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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 08:43:48,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-01-31 08:43:48,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2018-01-31 08:43:48,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-01-31 08:43:48,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 102 transitions. [2018-01-31 08:43:48,656 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 102 transitions. Word has length 24 [2018-01-31 08:43:48,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:43:48,656 INFO L432 AbstractCegarLoop]: Abstraction has 96 states and 102 transitions. [2018-01-31 08:43:48,656 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-31 08:43:48,657 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 102 transitions. [2018-01-31 08:43:48,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-31 08:43:48,658 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:43:48,658 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] [2018-01-31 08:43:48,658 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation, alloc_unsafe_17Err1RequiresViolation, alloc_unsafe_17Err3RequiresViolation, alloc_unsafe_17Err2RequiresViolation, alloc_unsafe_17Err4RequiresViolation, alloc_unsafe_17Err0RequiresViolation, alloc_unsafe_17Err5RequiresViolation]=== [2018-01-31 08:43:48,658 INFO L82 PathProgramCache]: Analyzing trace with hash -842088634, now seen corresponding path program 1 times [2018-01-31 08:43:48,658 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:43:48,659 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:43:48,660 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:43:48,660 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:43:48,660 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:43:48,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:43:48,686 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:43:49,298 WARN L146 SmtUtils]: Spent 393ms on a formula simplification. DAG size of input: 19 DAG size of output 17 [2018-01-31 08:43:49,558 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 08:43:49,558 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:43:49,558 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-31 08:43:49,559 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-31 08:43:49,559 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-31 08:43:49,559 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-01-31 08:43:49,559 INFO L87 Difference]: Start difference. First operand 96 states and 102 transitions. Second operand 9 states. [2018-01-31 08:43:50,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:43:50,119 INFO L93 Difference]: Finished difference Result 177 states and 188 transitions. [2018-01-31 08:43:50,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-31 08:43:50,120 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2018-01-31 08:43:50,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:43:50,121 INFO L225 Difference]: With dead ends: 177 [2018-01-31 08:43:50,121 INFO L226 Difference]: Without dead ends: 102 [2018-01-31 08:43:50,122 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2018-01-31 08:43:50,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-01-31 08:43:50,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 99. [2018-01-31 08:43:50,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-01-31 08:43:50,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 106 transitions. [2018-01-31 08:43:50,131 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 106 transitions. Word has length 25 [2018-01-31 08:43:50,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:43:50,131 INFO L432 AbstractCegarLoop]: Abstraction has 99 states and 106 transitions. [2018-01-31 08:43:50,131 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-31 08:43:50,131 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 106 transitions. [2018-01-31 08:43:50,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-31 08:43:50,132 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:43:50,132 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] [2018-01-31 08:43:50,133 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation, alloc_unsafe_17Err1RequiresViolation, alloc_unsafe_17Err3RequiresViolation, alloc_unsafe_17Err2RequiresViolation, alloc_unsafe_17Err4RequiresViolation, alloc_unsafe_17Err0RequiresViolation, alloc_unsafe_17Err5RequiresViolation]=== [2018-01-31 08:43:50,133 INFO L82 PathProgramCache]: Analyzing trace with hash -842088635, now seen corresponding path program 1 times [2018-01-31 08:43:50,133 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:43:50,133 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:43:50,134 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:43:50,135 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:43:50,135 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:43:50,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:43:50,147 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:43:50,266 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 08:43:50,266 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:43:50,266 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-31 08:43:50,266 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-31 08:43:50,267 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-31 08:43:50,267 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-31 08:43:50,267 INFO L87 Difference]: Start difference. First operand 99 states and 106 transitions. Second operand 6 states. [2018-01-31 08:43:50,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:43:50,555 INFO L93 Difference]: Finished difference Result 99 states and 106 transitions. [2018-01-31 08:43:50,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-31 08:43:50,555 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2018-01-31 08:43:50,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:43:50,556 INFO L225 Difference]: With dead ends: 99 [2018-01-31 08:43:50,556 INFO L226 Difference]: Without dead ends: 98 [2018-01-31 08:43:50,557 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 08:43:50,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-01-31 08:43:50,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2018-01-31 08:43:50,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-01-31 08:43:50,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 104 transitions. [2018-01-31 08:43:50,567 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 104 transitions. Word has length 25 [2018-01-31 08:43:50,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:43:50,568 INFO L432 AbstractCegarLoop]: Abstraction has 98 states and 104 transitions. [2018-01-31 08:43:50,568 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-31 08:43:50,568 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 104 transitions. [2018-01-31 08:43:50,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-01-31 08:43:50,569 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:43:50,569 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:43:50,569 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation, alloc_unsafe_17Err1RequiresViolation, alloc_unsafe_17Err3RequiresViolation, alloc_unsafe_17Err2RequiresViolation, alloc_unsafe_17Err4RequiresViolation, alloc_unsafe_17Err0RequiresViolation, alloc_unsafe_17Err5RequiresViolation]=== [2018-01-31 08:43:50,570 INFO L82 PathProgramCache]: Analyzing trace with hash 1945442076, now seen corresponding path program 1 times [2018-01-31 08:43:50,570 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:43:50,570 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:43:50,571 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:43:50,571 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:43:50,572 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:43:50,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:43:50,593 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:43:51,012 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:43:51,012 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:43:51,013 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 08:43:51,019 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:43:51,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:43:51,063 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:43:51,123 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-01-31 08:43:51,126 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:43:51,145 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 16 [2018-01-31 08:43:51,146 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:43:51,169 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-31 08:43:51,169 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:36 [2018-01-31 08:43:51,734 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:43:51,765 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:43:51,765 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 19 [2018-01-31 08:43:51,765 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-01-31 08:43:51,766 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-01-31 08:43:51,766 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=323, Unknown=0, NotChecked=0, Total=380 [2018-01-31 08:43:51,766 INFO L87 Difference]: Start difference. First operand 98 states and 104 transitions. Second operand 20 states. [2018-01-31 08:43:52,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:43:52,232 INFO L93 Difference]: Finished difference Result 181 states and 192 transitions. [2018-01-31 08:43:52,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-01-31 08:43:52,232 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 31 [2018-01-31 08:43:52,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:43:52,233 INFO L225 Difference]: With dead ends: 181 [2018-01-31 08:43:52,233 INFO L226 Difference]: Without dead ends: 106 [2018-01-31 08:43:52,234 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 22 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=131, Invalid=681, Unknown=0, NotChecked=0, Total=812 [2018-01-31 08:43:52,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-01-31 08:43:52,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 104. [2018-01-31 08:43:52,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-01-31 08:43:52,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 110 transitions. [2018-01-31 08:43:52,244 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 110 transitions. Word has length 31 [2018-01-31 08:43:52,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:43:52,245 INFO L432 AbstractCegarLoop]: Abstraction has 104 states and 110 transitions. [2018-01-31 08:43:52,245 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-01-31 08:43:52,245 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 110 transitions. [2018-01-31 08:43:52,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-01-31 08:43:52,246 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:43:52,246 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:43:52,246 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation, alloc_unsafe_17Err1RequiresViolation, alloc_unsafe_17Err3RequiresViolation, alloc_unsafe_17Err2RequiresViolation, alloc_unsafe_17Err4RequiresViolation, alloc_unsafe_17Err0RequiresViolation, alloc_unsafe_17Err5RequiresViolation]=== [2018-01-31 08:43:52,247 INFO L82 PathProgramCache]: Analyzing trace with hash -600590734, now seen corresponding path program 2 times [2018-01-31 08:43:52,247 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:43:52,247 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:43:52,248 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:43:52,249 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:43:52,249 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:43:52,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:43:52,273 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:43:52,819 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:43:52,819 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:43:52,819 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 08:43:52,834 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-31 08:43:52,854 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:43:52,859 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:43:52,874 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 08:43:52,877 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:43:52,896 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-01-31 08:43:52,896 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:43:52,908 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 16 [2018-01-31 08:43:52,909 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:43:52,919 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-31 08:43:52,920 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:36 [2018-01-31 08:43:53,511 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:43:53,531 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:43:53,546 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 25 [2018-01-31 08:43:53,546 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-01-31 08:43:53,547 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-01-31 08:43:53,547 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=566, Unknown=0, NotChecked=0, Total=650 [2018-01-31 08:43:53,547 INFO L87 Difference]: Start difference. First operand 104 states and 110 transitions. Second operand 26 states. [2018-01-31 08:43:54,232 WARN L146 SmtUtils]: Spent 107ms on a formula simplification. DAG size of input: 29 DAG size of output 26 [2018-01-31 08:43:54,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:43:54,816 INFO L93 Difference]: Finished difference Result 186 states and 198 transitions. [2018-01-31 08:43:54,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-01-31 08:43:54,817 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 37 [2018-01-31 08:43:54,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:43:54,818 INFO L225 Difference]: With dead ends: 186 [2018-01-31 08:43:54,818 INFO L226 Difference]: Without dead ends: 111 [2018-01-31 08:43:54,819 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 309 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=245, Invalid=1315, Unknown=0, NotChecked=0, Total=1560 [2018-01-31 08:43:54,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-01-31 08:43:54,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 108. [2018-01-31 08:43:54,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-01-31 08:43:54,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 114 transitions. [2018-01-31 08:43:54,830 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 114 transitions. Word has length 37 [2018-01-31 08:43:54,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:43:54,831 INFO L432 AbstractCegarLoop]: Abstraction has 108 states and 114 transitions. [2018-01-31 08:43:54,831 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-01-31 08:43:54,831 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 114 transitions. [2018-01-31 08:43:54,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-01-31 08:43:54,832 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:43:54,833 INFO L351 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:43:54,833 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation, alloc_unsafe_17Err1RequiresViolation, alloc_unsafe_17Err3RequiresViolation, alloc_unsafe_17Err2RequiresViolation, alloc_unsafe_17Err4RequiresViolation, alloc_unsafe_17Err0RequiresViolation, alloc_unsafe_17Err5RequiresViolation]=== [2018-01-31 08:43:54,833 INFO L82 PathProgramCache]: Analyzing trace with hash -1544818454, now seen corresponding path program 1 times [2018-01-31 08:43:54,833 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:43:54,833 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:43:54,835 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:43:54,835 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-31 08:43:54,835 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:43:54,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:43:54,859 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:43:55,000 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-01-31 08:43:55,001 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:43:55,001 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-31 08:43:55,001 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-31 08:43:55,001 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-31 08:43:55,001 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-31 08:43:55,001 INFO L87 Difference]: Start difference. First operand 108 states and 114 transitions. Second operand 5 states. [2018-01-31 08:43:55,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:43:55,184 INFO L93 Difference]: Finished difference Result 134 states and 147 transitions. [2018-01-31 08:43:55,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-31 08:43:55,184 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 54 [2018-01-31 08:43:55,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:43:55,185 INFO L225 Difference]: With dead ends: 134 [2018-01-31 08:43:55,186 INFO L226 Difference]: Without dead ends: 133 [2018-01-31 08:43:55,186 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-31 08:43:55,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-01-31 08:43:55,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 112. [2018-01-31 08:43:55,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-01-31 08:43:55,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 120 transitions. [2018-01-31 08:43:55,196 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 120 transitions. Word has length 54 [2018-01-31 08:43:55,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:43:55,196 INFO L432 AbstractCegarLoop]: Abstraction has 112 states and 120 transitions. [2018-01-31 08:43:55,196 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-31 08:43:55,197 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 120 transitions. [2018-01-31 08:43:55,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-01-31 08:43:55,198 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:43:55,198 INFO L351 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:43:55,198 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation, alloc_unsafe_17Err1RequiresViolation, alloc_unsafe_17Err3RequiresViolation, alloc_unsafe_17Err2RequiresViolation, alloc_unsafe_17Err4RequiresViolation, alloc_unsafe_17Err0RequiresViolation, alloc_unsafe_17Err5RequiresViolation]=== [2018-01-31 08:43:55,199 INFO L82 PathProgramCache]: Analyzing trace with hash -1544818453, now seen corresponding path program 1 times [2018-01-31 08:43:55,199 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:43:55,199 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:43:55,200 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:43:55,200 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:43:55,200 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:43:55,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:43:55,214 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:43:55,454 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:43:55,455 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:43:55,455 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 08:43:55,468 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:43:55,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:43:55,505 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:43:55,934 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:43:55,953 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:43:55,953 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2018-01-31 08:43:55,954 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-01-31 08:43:55,954 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-01-31 08:43:55,954 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2018-01-31 08:43:55,954 INFO L87 Difference]: Start difference. First operand 112 states and 120 transitions. Second operand 17 states. [2018-01-31 08:43:56,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:43:56,071 INFO L93 Difference]: Finished difference Result 199 states and 214 transitions. [2018-01-31 08:43:56,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-01-31 08:43:56,072 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 54 [2018-01-31 08:43:56,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:43:56,074 INFO L225 Difference]: With dead ends: 199 [2018-01-31 08:43:56,074 INFO L226 Difference]: Without dead ends: 121 [2018-01-31 08:43:56,075 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=166, Invalid=340, Unknown=0, NotChecked=0, Total=506 [2018-01-31 08:43:56,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-01-31 08:43:56,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 118. [2018-01-31 08:43:56,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-01-31 08:43:56,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 126 transitions. [2018-01-31 08:43:56,088 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 126 transitions. Word has length 54 [2018-01-31 08:43:56,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:43:56,088 INFO L432 AbstractCegarLoop]: Abstraction has 118 states and 126 transitions. [2018-01-31 08:43:56,088 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-01-31 08:43:56,088 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 126 transitions. [2018-01-31 08:43:56,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-01-31 08:43:56,090 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:43:56,090 INFO L351 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:43:56,090 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation, alloc_unsafe_17Err1RequiresViolation, alloc_unsafe_17Err3RequiresViolation, alloc_unsafe_17Err2RequiresViolation, alloc_unsafe_17Err4RequiresViolation, alloc_unsafe_17Err0RequiresViolation, alloc_unsafe_17Err5RequiresViolation]=== [2018-01-31 08:43:56,090 INFO L82 PathProgramCache]: Analyzing trace with hash 1982886101, now seen corresponding path program 2 times [2018-01-31 08:43:56,090 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:43:56,090 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:43:56,092 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:43:56,092 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:43:56,092 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:43:56,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:43:56,108 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:43:56,350 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:43:56,351 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:43:56,351 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 08:43:56,356 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-31 08:43:56,372 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:43:56,374 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 08:43:56,376 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:43:56,501 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2018-01-31 08:43:56,520 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-31 08:43:56,520 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [12] total 15 [2018-01-31 08:43:56,521 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-01-31 08:43:56,521 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-01-31 08:43:56,521 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2018-01-31 08:43:56,521 INFO L87 Difference]: Start difference. First operand 118 states and 126 transitions. Second operand 15 states. [2018-01-31 08:43:57,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:43:57,119 INFO L93 Difference]: Finished difference Result 232 states and 253 transitions. [2018-01-31 08:43:57,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-01-31 08:43:57,119 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 60 [2018-01-31 08:43:57,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:43:57,120 INFO L225 Difference]: With dead ends: 232 [2018-01-31 08:43:57,121 INFO L226 Difference]: Without dead ends: 154 [2018-01-31 08:43:57,121 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 166 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=207, Invalid=605, Unknown=0, NotChecked=0, Total=812 [2018-01-31 08:43:57,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-01-31 08:43:57,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 126. [2018-01-31 08:43:57,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-01-31 08:43:57,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 134 transitions. [2018-01-31 08:43:57,136 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 134 transitions. Word has length 60 [2018-01-31 08:43:57,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:43:57,137 INFO L432 AbstractCegarLoop]: Abstraction has 126 states and 134 transitions. [2018-01-31 08:43:57,138 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-01-31 08:43:57,138 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 134 transitions. [2018-01-31 08:43:57,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-01-31 08:43:57,140 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:43:57,140 INFO L351 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:43:57,140 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation, alloc_unsafe_17Err1RequiresViolation, alloc_unsafe_17Err3RequiresViolation, alloc_unsafe_17Err2RequiresViolation, alloc_unsafe_17Err4RequiresViolation, alloc_unsafe_17Err0RequiresViolation, alloc_unsafe_17Err5RequiresViolation]=== [2018-01-31 08:43:57,140 INFO L82 PathProgramCache]: Analyzing trace with hash -1687986405, now seen corresponding path program 1 times [2018-01-31 08:43:57,140 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:43:57,140 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:43:57,144 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:43:57,144 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-31 08:43:57,144 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:43:57,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:43:57,166 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:43:57,267 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2018-01-31 08:43:57,267 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:43:57,267 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-31 08:43:57,268 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-31 08:43:57,268 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-31 08:43:57,268 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-31 08:43:57,268 INFO L87 Difference]: Start difference. First operand 126 states and 134 transitions. Second operand 5 states. [2018-01-31 08:43:57,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:43:57,362 INFO L93 Difference]: Finished difference Result 216 states and 232 transitions. [2018-01-31 08:43:57,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-31 08:43:57,362 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 74 [2018-01-31 08:43:57,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:43:57,363 INFO L225 Difference]: With dead ends: 216 [2018-01-31 08:43:57,363 INFO L226 Difference]: Without dead ends: 144 [2018-01-31 08:43:57,364 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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 08:43:57,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2018-01-31 08:43:57,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 129. [2018-01-31 08:43:57,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-01-31 08:43:57,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 137 transitions. [2018-01-31 08:43:57,372 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 137 transitions. Word has length 74 [2018-01-31 08:43:57,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:43:57,373 INFO L432 AbstractCegarLoop]: Abstraction has 129 states and 137 transitions. [2018-01-31 08:43:57,373 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-31 08:43:57,373 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 137 transitions. [2018-01-31 08:43:57,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-01-31 08:43:57,374 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:43:57,374 INFO L351 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:43:57,374 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation, alloc_unsafe_17Err1RequiresViolation, alloc_unsafe_17Err3RequiresViolation, alloc_unsafe_17Err2RequiresViolation, alloc_unsafe_17Err4RequiresViolation, alloc_unsafe_17Err0RequiresViolation, alloc_unsafe_17Err5RequiresViolation]=== [2018-01-31 08:43:57,374 INFO L82 PathProgramCache]: Analyzing trace with hash -1026474647, now seen corresponding path program 1 times [2018-01-31 08:43:57,374 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:43:57,374 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:43:57,375 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:43:57,375 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:43:57,376 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:43:57,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:43:57,391 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:43:57,517 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-01-31 08:43:57,517 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:43:57,518 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 08:43:57,523 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:43:57,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:43:57,565 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:43:57,753 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 8 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:43:57,785 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:43:57,785 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 25 [2018-01-31 08:43:57,785 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-01-31 08:43:57,786 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-01-31 08:43:57,786 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=445, Unknown=0, NotChecked=0, Total=600 [2018-01-31 08:43:57,786 INFO L87 Difference]: Start difference. First operand 129 states and 137 transitions. Second operand 25 states. [2018-01-31 08:43:58,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:43:58,058 INFO L93 Difference]: Finished difference Result 221 states and 236 transitions. [2018-01-31 08:43:58,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-01-31 08:43:58,060 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 75 [2018-01-31 08:43:58,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:43:58,061 INFO L225 Difference]: With dead ends: 221 [2018-01-31 08:43:58,061 INFO L226 Difference]: Without dead ends: 138 [2018-01-31 08:43:58,062 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 318 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=360, Invalid=830, Unknown=0, NotChecked=0, Total=1190 [2018-01-31 08:43:58,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-01-31 08:43:58,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 135. [2018-01-31 08:43:58,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-01-31 08:43:58,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 143 transitions. [2018-01-31 08:43:58,072 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 143 transitions. Word has length 75 [2018-01-31 08:43:58,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:43:58,072 INFO L432 AbstractCegarLoop]: Abstraction has 135 states and 143 transitions. [2018-01-31 08:43:58,072 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-01-31 08:43:58,073 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 143 transitions. [2018-01-31 08:43:58,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-01-31 08:43:58,074 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:43:58,074 INFO L351 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 6, 6, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:43:58,074 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation, alloc_unsafe_17Err1RequiresViolation, alloc_unsafe_17Err3RequiresViolation, alloc_unsafe_17Err2RequiresViolation, alloc_unsafe_17Err4RequiresViolation, alloc_unsafe_17Err0RequiresViolation, alloc_unsafe_17Err5RequiresViolation]=== [2018-01-31 08:43:58,074 INFO L82 PathProgramCache]: Analyzing trace with hash 283030463, now seen corresponding path program 2 times [2018-01-31 08:43:58,074 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:43:58,074 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:43:58,075 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:43:58,075 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:43:58,075 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:43:58,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:43:58,090 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:43:58,905 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 102 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-01-31 08:43:58,906 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:43:58,935 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 08:43:58,942 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-31 08:43:58,955 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:43:58,967 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:43:58,968 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 08:43:58,972 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:43:59,166 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 8 proven. 102 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:43:59,189 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:43:59,189 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 29 [2018-01-31 08:43:59,189 INFO L409 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-01-31 08:43:59,190 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-01-31 08:43:59,190 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=202, Invalid=610, Unknown=0, NotChecked=0, Total=812 [2018-01-31 08:43:59,190 INFO L87 Difference]: Start difference. First operand 135 states and 143 transitions. Second operand 29 states. [2018-01-31 08:43:59,679 WARN L143 SmtUtils]: Spent 102ms on a formula simplification that was a NOOP. DAG size: 9 [2018-01-31 08:43:59,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:43:59,767 INFO L93 Difference]: Finished difference Result 227 states and 242 transitions. [2018-01-31 08:43:59,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-01-31 08:43:59,767 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 81 [2018-01-31 08:43:59,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:43:59,769 INFO L225 Difference]: With dead ends: 227 [2018-01-31 08:43:59,769 INFO L226 Difference]: Without dead ends: 144 [2018-01-31 08:43:59,770 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 462 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=484, Invalid=1156, Unknown=0, NotChecked=0, Total=1640 [2018-01-31 08:43:59,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2018-01-31 08:43:59,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 141. [2018-01-31 08:43:59,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-01-31 08:43:59,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 149 transitions. [2018-01-31 08:43:59,782 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 149 transitions. Word has length 81 [2018-01-31 08:43:59,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:43:59,782 INFO L432 AbstractCegarLoop]: Abstraction has 141 states and 149 transitions. [2018-01-31 08:43:59,782 INFO L433 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-01-31 08:43:59,782 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 149 transitions. [2018-01-31 08:43:59,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-01-31 08:43:59,783 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:43:59,784 INFO L351 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 7, 7, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:43:59,784 INFO L371 AbstractCegarLoop]: === Iteration 14 === [mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation, alloc_unsafe_17Err1RequiresViolation, alloc_unsafe_17Err3RequiresViolation, alloc_unsafe_17Err2RequiresViolation, alloc_unsafe_17Err4RequiresViolation, alloc_unsafe_17Err0RequiresViolation, alloc_unsafe_17Err5RequiresViolation]=== [2018-01-31 08:43:59,784 INFO L82 PathProgramCache]: Analyzing trace with hash -975990379, now seen corresponding path program 3 times [2018-01-31 08:43:59,784 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:43:59,784 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:43:59,785 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:43:59,785 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-31 08:43:59,785 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:43:59,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:43:59,801 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:44:00,016 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 0 proven. 140 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-01-31 08:44:00,017 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:44:00,017 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 08:44:00,023 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-31 08:44:00,036 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 08:44:00,042 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 08:44:00,043 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 08:44:00,048 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:44:00,061 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 08:44:00,061 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:44:00,063 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:44:00,063 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-31 08:44:00,145 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#t~malloc1.base| Int)) (= |c_#valid| (store |c_old(#valid)| |ldv_malloc_#t~malloc1.base| 1))) is different from true [2018-01-31 08:44:00,151 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-01-31 08:44:00,152 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:44:00,154 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 08:44:00,155 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:11 [2018-01-31 08:44:00,174 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 140 trivial. 3 not checked. [2018-01-31 08:44:00,193 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:44:00,193 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 9] total 26 [2018-01-31 08:44:00,194 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-01-31 08:44:00,194 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-01-31 08:44:00,195 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=503, Unknown=1, NotChecked=46, Total=650 [2018-01-31 08:44:00,195 INFO L87 Difference]: Start difference. First operand 141 states and 149 transitions. Second operand 26 states. [2018-01-31 08:44:01,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:44:01,055 INFO L93 Difference]: Finished difference Result 272 states and 298 transitions. [2018-01-31 08:44:01,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-01-31 08:44:01,055 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 87 [2018-01-31 08:44:01,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:44:01,057 INFO L225 Difference]: With dead ends: 272 [2018-01-31 08:44:01,057 INFO L226 Difference]: Without dead ends: 189 [2018-01-31 08:44:01,058 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 79 SyntacticMatches, 1 SemanticMatches, 55 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 659 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=589, Invalid=2493, Unknown=2, NotChecked=108, Total=3192 [2018-01-31 08:44:01,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2018-01-31 08:44:01,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 156. [2018-01-31 08:44:01,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2018-01-31 08:44:01,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 168 transitions. [2018-01-31 08:44:01,072 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 168 transitions. Word has length 87 [2018-01-31 08:44:01,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:44:01,073 INFO L432 AbstractCegarLoop]: Abstraction has 156 states and 168 transitions. [2018-01-31 08:44:01,073 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-01-31 08:44:01,073 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 168 transitions. [2018-01-31 08:44:01,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-01-31 08:44:01,074 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:44:01,074 INFO L351 BasicCegarLoop]: trace histogram [9, 8, 8, 8, 8, 8, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:44:01,074 INFO L371 AbstractCegarLoop]: === Iteration 15 === [mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation, alloc_unsafe_17Err1RequiresViolation, alloc_unsafe_17Err3RequiresViolation, alloc_unsafe_17Err2RequiresViolation, alloc_unsafe_17Err4RequiresViolation, alloc_unsafe_17Err0RequiresViolation, alloc_unsafe_17Err5RequiresViolation]=== [2018-01-31 08:44:01,074 INFO L82 PathProgramCache]: Analyzing trace with hash -312199444, now seen corresponding path program 1 times [2018-01-31 08:44:01,074 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:44:01,074 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:44:01,075 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:44:01,075 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-31 08:44:01,075 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:44:01,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:44:01,090 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:44:01,732 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 0 proven. 184 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-01-31 08:44:01,732 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:44:01,732 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 08:44:01,737 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:44:01,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:44:01,772 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:44:02,057 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 8 proven. 184 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:44:02,090 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:44:02,090 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 37 [2018-01-31 08:44:02,090 INFO L409 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-01-31 08:44:02,091 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-01-31 08:44:02,091 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=314, Invalid=1018, Unknown=0, NotChecked=0, Total=1332 [2018-01-31 08:44:02,091 INFO L87 Difference]: Start difference. First operand 156 states and 168 transitions. Second operand 37 states. [2018-01-31 08:44:02,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:44:02,739 INFO L93 Difference]: Finished difference Result 257 states and 280 transitions. [2018-01-31 08:44:02,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-01-31 08:44:02,739 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 93 [2018-01-31 08:44:02,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:44:02,741 INFO L225 Difference]: With dead ends: 257 [2018-01-31 08:44:02,741 INFO L226 Difference]: Without dead ends: 165 [2018-01-31 08:44:02,742 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 828 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=786, Invalid=1970, Unknown=0, NotChecked=0, Total=2756 [2018-01-31 08:44:02,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2018-01-31 08:44:02,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 162. [2018-01-31 08:44:02,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2018-01-31 08:44:02,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 174 transitions. [2018-01-31 08:44:02,758 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 174 transitions. Word has length 93 [2018-01-31 08:44:02,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:44:02,758 INFO L432 AbstractCegarLoop]: Abstraction has 162 states and 174 transitions. [2018-01-31 08:44:02,758 INFO L433 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-01-31 08:44:02,759 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 174 transitions. [2018-01-31 08:44:02,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-01-31 08:44:02,760 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:44:02,760 INFO L351 BasicCegarLoop]: trace histogram [10, 9, 9, 9, 9, 9, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:44:02,760 INFO L371 AbstractCegarLoop]: === Iteration 16 === [mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation, alloc_unsafe_17Err1RequiresViolation, alloc_unsafe_17Err3RequiresViolation, alloc_unsafe_17Err2RequiresViolation, alloc_unsafe_17Err4RequiresViolation, alloc_unsafe_17Err0RequiresViolation, alloc_unsafe_17Err5RequiresViolation]=== [2018-01-31 08:44:02,760 INFO L82 PathProgramCache]: Analyzing trace with hash 1383924674, now seen corresponding path program 2 times [2018-01-31 08:44:02,760 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:44:02,760 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:44:02,763 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:44:02,763 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:44:02,763 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:44:02,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:44:02,782 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:44:03,129 INFO L134 CoverageAnalysis]: Checked inductivity of 242 backedges. 0 proven. 234 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-01-31 08:44:03,129 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:44:03,129 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 08:44:03,135 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-31 08:44:03,148 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:44:03,161 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:44:03,163 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 08:44:03,166 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:44:03,437 INFO L134 CoverageAnalysis]: Checked inductivity of 242 backedges. 8 proven. 234 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:44:03,457 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:44:03,457 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 41 [2018-01-31 08:44:03,457 INFO L409 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-01-31 08:44:03,457 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-01-31 08:44:03,458 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=379, Invalid=1261, Unknown=0, NotChecked=0, Total=1640 [2018-01-31 08:44:03,458 INFO L87 Difference]: Start difference. First operand 162 states and 174 transitions. Second operand 41 states. [2018-01-31 08:44:04,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:44:04,232 INFO L93 Difference]: Finished difference Result 263 states and 286 transitions. [2018-01-31 08:44:04,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-01-31 08:44:04,264 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 99 [2018-01-31 08:44:04,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:44:04,265 INFO L225 Difference]: With dead ends: 263 [2018-01-31 08:44:04,265 INFO L226 Difference]: Without dead ends: 171 [2018-01-31 08:44:04,266 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1104 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=997, Invalid=2543, Unknown=0, NotChecked=0, Total=3540 [2018-01-31 08:44:04,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2018-01-31 08:44:04,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 168. [2018-01-31 08:44:04,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2018-01-31 08:44:04,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 180 transitions. [2018-01-31 08:44:04,278 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 180 transitions. Word has length 99 [2018-01-31 08:44:04,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:44:04,278 INFO L432 AbstractCegarLoop]: Abstraction has 168 states and 180 transitions. [2018-01-31 08:44:04,278 INFO L433 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-01-31 08:44:04,278 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 180 transitions. [2018-01-31 08:44:04,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-01-31 08:44:04,279 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:44:04,280 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:44:04,280 INFO L371 AbstractCegarLoop]: === Iteration 17 === [mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation, alloc_unsafe_17Err1RequiresViolation, alloc_unsafe_17Err3RequiresViolation, alloc_unsafe_17Err2RequiresViolation, alloc_unsafe_17Err4RequiresViolation, alloc_unsafe_17Err0RequiresViolation, alloc_unsafe_17Err5RequiresViolation]=== [2018-01-31 08:44:04,280 INFO L82 PathProgramCache]: Analyzing trace with hash 893540376, now seen corresponding path program 3 times [2018-01-31 08:44:04,280 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:44:04,280 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:44:04,281 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:44:04,281 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-31 08:44:04,281 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:44:04,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:44:04,310 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:44:05,147 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 5 proven. 167 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2018-01-31 08:44:05,148 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:44:05,148 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 08:44:05,154 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-31 08:44:05,171 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 08:44:05,177 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 08:44:05,178 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 08:44:05,182 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:44:05,219 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2018-01-31 08:44:05,219 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:44:05,235 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2018-01-31 08:44:05,235 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:44:05,250 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2018-01-31 08:44:05,250 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-31 08:44:05,251 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2018-01-31 08:44:05,252 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-31 08:44:05,265 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-31 08:44:05,265 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:50, output treesize:46 [2018-01-31 08:44:05,673 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:44:05,676 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 38 [2018-01-31 08:44:05,677 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:44:05,701 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:44:05,702 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:44:05,702 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 28 [2018-01-31 08:44:05,703 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:44:05,766 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:44:05,767 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:44:05,768 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 50 [2018-01-31 08:44:05,768 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-31 08:44:05,793 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:44:05,793 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:44:05,794 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 30 [2018-01-31 08:44:05,794 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-31 08:44:05,814 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-1 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-01-31 08:44:05,814 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:73, output treesize:55 [2018-01-31 08:44:05,931 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 290 trivial. 0 not checked. [2018-01-31 08:44:05,950 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:44:05,951 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 13] total 35 [2018-01-31 08:44:05,951 INFO L409 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-01-31 08:44:05,951 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-01-31 08:44:05,952 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=1158, Unknown=1, NotChecked=0, Total=1260 [2018-01-31 08:44:05,952 INFO L87 Difference]: Start difference. First operand 168 states and 180 transitions. Second operand 36 states. [2018-01-31 08:44:06,223 WARN L146 SmtUtils]: Spent 125ms on a formula simplification. DAG size of input: 55 DAG size of output 52 [2018-01-31 08:44:06,390 WARN L146 SmtUtils]: Spent 111ms on a formula simplification. DAG size of input: 67 DAG size of output 64 [2018-01-31 08:44:32,086 WARN L143 SmtUtils]: Spent 14133ms on a formula simplification that was a NOOP. DAG size: 52 [2018-01-31 08:44:52,389 WARN L146 SmtUtils]: Spent 20237ms on a formula simplification. DAG size of input: 56 DAG size of output 56 [2018-01-31 08:44:53,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:44:53,202 INFO L93 Difference]: Finished difference Result 276 states and 304 transitions. [2018-01-31 08:44:53,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-01-31 08:44:53,203 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 105 [2018-01-31 08:44:53,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:44:53,204 INFO L225 Difference]: With dead ends: 276 [2018-01-31 08:44:53,204 INFO L226 Difference]: Without dead ends: 274 [2018-01-31 08:44:53,206 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1048 ImplicationChecksByTransitivity, 37.4s TimeCoverageRelationStatistics Valid=516, Invalid=3770, Unknown=4, NotChecked=0, Total=4290 [2018-01-31 08:44:53,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2018-01-31 08:44:53,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 172. [2018-01-31 08:44:53,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2018-01-31 08:44:53,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 186 transitions. [2018-01-31 08:44:53,233 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 186 transitions. Word has length 105 [2018-01-31 08:44:53,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:44:53,234 INFO L432 AbstractCegarLoop]: Abstraction has 172 states and 186 transitions. [2018-01-31 08:44:53,234 INFO L433 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-01-31 08:44:53,234 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 186 transitions. [2018-01-31 08:44:53,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-01-31 08:44:53,235 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:44:53,235 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:44:53,235 INFO L371 AbstractCegarLoop]: === Iteration 18 === [mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation, alloc_unsafe_17Err1RequiresViolation, alloc_unsafe_17Err3RequiresViolation, alloc_unsafe_17Err2RequiresViolation, alloc_unsafe_17Err4RequiresViolation, alloc_unsafe_17Err0RequiresViolation, alloc_unsafe_17Err5RequiresViolation]=== [2018-01-31 08:44:53,236 INFO L82 PathProgramCache]: Analyzing trace with hash 1266036338, now seen corresponding path program 1 times [2018-01-31 08:44:53,236 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:44:53,236 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:44:53,237 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:44:53,237 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-31 08:44:53,237 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:44:53,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:44:53,256 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:44:53,444 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 295 trivial. 0 not checked. [2018-01-31 08:44:53,444 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:44:53,444 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-31 08:44:53,445 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-31 08:44:53,445 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-31 08:44:53,445 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-31 08:44:53,445 INFO L87 Difference]: Start difference. First operand 172 states and 186 transitions. Second operand 4 states. [2018-01-31 08:44:53,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:44:53,655 INFO L93 Difference]: Finished difference Result 230 states and 248 transitions. [2018-01-31 08:44:53,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-31 08:44:53,655 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 107 [2018-01-31 08:44:53,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:44:53,656 INFO L225 Difference]: With dead ends: 230 [2018-01-31 08:44:53,656 INFO L226 Difference]: Without dead ends: 183 [2018-01-31 08:44:53,657 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-31 08:44:53,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2018-01-31 08:44:53,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 178. [2018-01-31 08:44:53,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2018-01-31 08:44:53,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 192 transitions. [2018-01-31 08:44:53,685 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 192 transitions. Word has length 107 [2018-01-31 08:44:53,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:44:53,686 INFO L432 AbstractCegarLoop]: Abstraction has 178 states and 192 transitions. [2018-01-31 08:44:53,686 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-31 08:44:53,686 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 192 transitions. [2018-01-31 08:44:53,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-01-31 08:44:53,687 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:44:53,687 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:44:53,687 INFO L371 AbstractCegarLoop]: === Iteration 19 === [mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation, alloc_unsafe_17Err1RequiresViolation, alloc_unsafe_17Err3RequiresViolation, alloc_unsafe_17Err2RequiresViolation, alloc_unsafe_17Err4RequiresViolation, alloc_unsafe_17Err0RequiresViolation, alloc_unsafe_17Err5RequiresViolation]=== [2018-01-31 08:44:53,687 INFO L82 PathProgramCache]: Analyzing trace with hash 1171291026, now seen corresponding path program 1 times [2018-01-31 08:44:53,688 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:44:53,688 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:44:53,690 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:44:53,690 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:44:53,690 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:44:53,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:44:53,711 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:44:54,387 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 295 trivial. 0 not checked. [2018-01-31 08:44:54,387 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:44:54,387 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 08:44:54,392 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:44:54,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:44:54,424 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:44:54,536 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 298 trivial. 0 not checked. [2018-01-31 08:44:54,556 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:44:54,556 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 8] total 20 [2018-01-31 08:44:54,556 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-01-31 08:44:54,556 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-01-31 08:44:54,557 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=330, Unknown=0, NotChecked=0, Total=380 [2018-01-31 08:44:54,557 INFO L87 Difference]: Start difference. First operand 178 states and 192 transitions. Second operand 20 states. [2018-01-31 08:44:55,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:44:55,365 INFO L93 Difference]: Finished difference Result 277 states and 303 transitions. [2018-01-31 08:44:55,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-01-31 08:44:55,365 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 114 [2018-01-31 08:44:55,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:44:55,366 INFO L225 Difference]: With dead ends: 277 [2018-01-31 08:44:55,367 INFO L226 Difference]: Without dead ends: 220 [2018-01-31 08:44:55,367 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 203 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=217, Invalid=1043, Unknown=0, NotChecked=0, Total=1260 [2018-01-31 08:44:55,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2018-01-31 08:44:55,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 183. [2018-01-31 08:44:55,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2018-01-31 08:44:55,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 197 transitions. [2018-01-31 08:44:55,396 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 197 transitions. Word has length 114 [2018-01-31 08:44:55,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:44:55,397 INFO L432 AbstractCegarLoop]: Abstraction has 183 states and 197 transitions. [2018-01-31 08:44:55,397 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-01-31 08:44:55,397 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 197 transitions. [2018-01-31 08:44:55,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-01-31 08:44:55,398 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:44:55,398 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:44:55,398 INFO L371 AbstractCegarLoop]: === Iteration 20 === [mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation, alloc_unsafe_17Err1RequiresViolation, alloc_unsafe_17Err3RequiresViolation, alloc_unsafe_17Err2RequiresViolation, alloc_unsafe_17Err4RequiresViolation, alloc_unsafe_17Err0RequiresViolation, alloc_unsafe_17Err5RequiresViolation]=== [2018-01-31 08:44:55,399 INFO L82 PathProgramCache]: Analyzing trace with hash -1072528742, now seen corresponding path program 1 times [2018-01-31 08:44:55,399 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:44:55,399 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:44:55,400 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:44:55,400 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:44:55,401 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:44:55,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:44:55,419 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:44:55,862 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 261 trivial. 0 not checked. [2018-01-31 08:44:55,862 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:44:55,862 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-31 08:44:55,862 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-31 08:44:55,863 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-31 08:44:55,863 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-31 08:44:55,863 INFO L87 Difference]: Start difference. First operand 183 states and 197 transitions. Second operand 6 states. [2018-01-31 08:44:55,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:44:55,971 INFO L93 Difference]: Finished difference Result 213 states and 229 transitions. [2018-01-31 08:44:55,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-31 08:44:55,971 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 119 [2018-01-31 08:44:55,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:44:55,973 INFO L225 Difference]: With dead ends: 213 [2018-01-31 08:44:55,973 INFO L226 Difference]: Without dead ends: 212 [2018-01-31 08:44:55,974 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-01-31 08:44:55,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2018-01-31 08:44:56,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 201. [2018-01-31 08:44:56,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2018-01-31 08:44:56,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 218 transitions. [2018-01-31 08:44:56,006 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 218 transitions. Word has length 119 [2018-01-31 08:44:56,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:44:56,007 INFO L432 AbstractCegarLoop]: Abstraction has 201 states and 218 transitions. [2018-01-31 08:44:56,007 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-31 08:44:56,007 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 218 transitions. [2018-01-31 08:44:56,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-01-31 08:44:56,008 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:44:56,008 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:44:56,008 INFO L371 AbstractCegarLoop]: === Iteration 21 === [mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation, alloc_unsafe_17Err1RequiresViolation, alloc_unsafe_17Err3RequiresViolation, alloc_unsafe_17Err2RequiresViolation, alloc_unsafe_17Err4RequiresViolation, alloc_unsafe_17Err0RequiresViolation, alloc_unsafe_17Err5RequiresViolation]=== [2018-01-31 08:44:56,008 INFO L82 PathProgramCache]: Analyzing trace with hash -1072528741, now seen corresponding path program 1 times [2018-01-31 08:44:56,009 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:44:56,009 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:44:56,010 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:44:56,010 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:44:56,010 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:44:56,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:44:56,035 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:44:56,557 WARN L143 SmtUtils]: Spent 172ms on a formula simplification that was a NOOP. DAG size: 12 [2018-01-31 08:44:56,779 WARN L143 SmtUtils]: Spent 153ms on a formula simplification that was a NOOP. DAG size: 15 [2018-01-31 08:44:57,008 WARN L143 SmtUtils]: Spent 138ms on a formula simplification that was a NOOP. DAG size: 15 [2018-01-31 08:44:57,240 WARN L143 SmtUtils]: Spent 117ms on a formula simplification that was a NOOP. DAG size: 16 [2018-01-31 08:44:57,579 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 1 proven. 126 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2018-01-31 08:44:57,580 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:44:57,580 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 08:44:57,585 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:44:57,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:44:57,630 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:44:57,636 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-01-31 08:44:57,637 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:44:57,704 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 16 [2018-01-31 08:44:57,704 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:44:57,713 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-01-31 08:44:57,713 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:30 [2018-01-31 08:45:06,391 WARN L143 SmtUtils]: Spent 246ms on a formula simplification that was a NOOP. DAG size: 27 [2018-01-31 08:45:07,250 WARN L143 SmtUtils]: Spent 183ms on a formula simplification that was a NOOP. DAG size: 27 [2018-01-31 08:45:09,742 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 211 proven. 84 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:45:09,769 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:45:09,769 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 30] total 47 [2018-01-31 08:45:09,769 INFO L409 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-01-31 08:45:09,769 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-01-31 08:45:09,770 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=204, Invalid=2048, Unknown=4, NotChecked=0, Total=2256 [2018-01-31 08:45:09,770 INFO L87 Difference]: Start difference. First operand 201 states and 218 transitions. Second operand 48 states. [2018-01-31 08:45:12,175 WARN L143 SmtUtils]: Spent 2084ms on a formula simplification that was a NOOP. DAG size: 53 [2018-01-31 08:45:16,247 WARN L143 SmtUtils]: Spent 4026ms on a formula simplification that was a NOOP. DAG size: 35 [2018-01-31 08:45:16,566 WARN L143 SmtUtils]: Spent 153ms on a formula simplification that was a NOOP. DAG size: 35 [2018-01-31 08:45:19,204 WARN L146 SmtUtils]: Spent 157ms on a formula simplification. DAG size of input: 60 DAG size of output 42 [2018-01-31 08:45:21,344 WARN L146 SmtUtils]: Spent 2081ms on a formula simplification. DAG size of input: 59 DAG size of output 47 [2018-01-31 08:45:23,438 WARN L146 SmtUtils]: Spent 2056ms on a formula simplification. DAG size of input: 49 DAG size of output 44 [2018-01-31 08:45:23,645 WARN L146 SmtUtils]: Spent 108ms on a formula simplification. DAG size of input: 57 DAG size of output 49 [2018-01-31 08:45:28,474 WARN L146 SmtUtils]: Spent 114ms on a formula simplification. DAG size of input: 45 DAG size of output 44 [2018-01-31 08:45:30,862 WARN L146 SmtUtils]: Spent 2119ms on a formula simplification. DAG size of input: 53 DAG size of output 49 [2018-01-31 08:45:37,540 WARN L146 SmtUtils]: Spent 100ms on a formula simplification. DAG size of input: 53 DAG size of output 49 [2018-01-31 08:45:40,555 WARN L146 SmtUtils]: Spent 813ms on a formula simplification. DAG size of input: 44 DAG size of output 43 [2018-01-31 08:45:40,955 WARN L146 SmtUtils]: Spent 186ms on a formula simplification. DAG size of input: 54 DAG size of output 50 [2018-01-31 08:45:41,178 WARN L146 SmtUtils]: Spent 186ms on a formula simplification. DAG size of input: 45 DAG size of output 44 [2018-01-31 08:45:41,691 WARN L146 SmtUtils]: Spent 155ms on a formula simplification. DAG size of input: 55 DAG size of output 51 [2018-01-31 08:45:42,082 WARN L146 SmtUtils]: Spent 107ms on a formula simplification. DAG size of input: 45 DAG size of output 44 [2018-01-31 08:45:42,925 WARN L146 SmtUtils]: Spent 626ms on a formula simplification. DAG size of input: 55 DAG size of output 51 [2018-01-31 08:46:01,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:46:01,084 INFO L93 Difference]: Finished difference Result 227 states and 243 transitions. [2018-01-31 08:46:01,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-01-31 08:46:01,084 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 119 [2018-01-31 08:46:01,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:46:01,086 INFO L225 Difference]: With dead ends: 227 [2018-01-31 08:46:01,086 INFO L226 Difference]: Without dead ends: 226 [2018-01-31 08:46:01,088 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1941 ImplicationChecksByTransitivity, 38.0s TimeCoverageRelationStatistics Valid=1194, Invalid=7541, Unknown=7, NotChecked=0, Total=8742 [2018-01-31 08:46:01,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2018-01-31 08:46:01,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 211. [2018-01-31 08:46:01,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2018-01-31 08:46:01,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 231 transitions. [2018-01-31 08:46:01,122 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 231 transitions. Word has length 119 [2018-01-31 08:46:01,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:46:01,123 INFO L432 AbstractCegarLoop]: Abstraction has 211 states and 231 transitions. [2018-01-31 08:46:01,123 INFO L433 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-01-31 08:46:01,123 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 231 transitions. [2018-01-31 08:46:01,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-01-31 08:46:01,124 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:46:01,124 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 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, 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 08:46:01,124 INFO L371 AbstractCegarLoop]: === Iteration 22 === [mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation, alloc_unsafe_17Err1RequiresViolation, alloc_unsafe_17Err3RequiresViolation, alloc_unsafe_17Err2RequiresViolation, alloc_unsafe_17Err4RequiresViolation, alloc_unsafe_17Err0RequiresViolation, alloc_unsafe_17Err5RequiresViolation]=== [2018-01-31 08:46:01,124 INFO L82 PathProgramCache]: Analyzing trace with hash -1805836304, now seen corresponding path program 1 times [2018-01-31 08:46:01,124 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:46:01,124 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:46:01,125 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:46:01,125 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:46:01,126 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:46:01,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:46:01,141 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:46:01,506 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 295 trivial. 0 not checked. [2018-01-31 08:46:01,506 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:46:01,506 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-31 08:46:01,507 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-31 08:46:01,507 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-31 08:46:01,507 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-31 08:46:01,507 INFO L87 Difference]: Start difference. First operand 211 states and 231 transitions. Second operand 6 states. [2018-01-31 08:46:01,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:46:01,722 INFO L93 Difference]: Finished difference Result 290 states and 319 transitions. [2018-01-31 08:46:01,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-31 08:46:01,722 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 120 [2018-01-31 08:46:01,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:46:01,724 INFO L225 Difference]: With dead ends: 290 [2018-01-31 08:46:01,724 INFO L226 Difference]: Without dead ends: 230 [2018-01-31 08:46:01,725 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-01-31 08:46:01,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2018-01-31 08:46:01,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 208. [2018-01-31 08:46:01,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2018-01-31 08:46:01,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 226 transitions. [2018-01-31 08:46:01,755 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 226 transitions. Word has length 120 [2018-01-31 08:46:01,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:46:01,755 INFO L432 AbstractCegarLoop]: Abstraction has 208 states and 226 transitions. [2018-01-31 08:46:01,755 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-31 08:46:01,756 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 226 transitions. [2018-01-31 08:46:01,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-01-31 08:46:01,756 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:46:01,757 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:46:01,757 INFO L371 AbstractCegarLoop]: === Iteration 23 === [mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation, alloc_unsafe_17Err1RequiresViolation, alloc_unsafe_17Err3RequiresViolation, alloc_unsafe_17Err2RequiresViolation, alloc_unsafe_17Err4RequiresViolation, alloc_unsafe_17Err0RequiresViolation, alloc_unsafe_17Err5RequiresViolation]=== [2018-01-31 08:46:01,757 INFO L82 PathProgramCache]: Analyzing trace with hash 1111347431, now seen corresponding path program 1 times [2018-01-31 08:46:01,757 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:46:01,757 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:46:01,760 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:46:01,760 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:46:01,760 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:46:01,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:46:01,786 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:46:02,843 WARN L143 SmtUtils]: Spent 164ms on a formula simplification that was a NOOP. DAG size: 14 [2018-01-31 08:46:03,056 WARN L143 SmtUtils]: Spent 140ms on a formula simplification that was a NOOP. DAG size: 15 [2018-01-31 08:46:05,054 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 90 proven. 204 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-01-31 08:46:05,055 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:46:05,055 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 08:46:05,060 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:46:05,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:46:05,096 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:46:05,257 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-01-31 08:46:05,258 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 12 treesize of output 11 [2018-01-31 08:46:05,259 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:46:05,260 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:46:05,264 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:46:05,264 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:18 [2018-01-31 08:46:05,421 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-01-31 08:46:05,433 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:46:05,434 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-01-31 08:46:05,434 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:46:05,438 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:46:05,443 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:46:05,443 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:25 [2018-01-31 08:46:05,577 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 25 [2018-01-31 08:46:05,579 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:46:05,579 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:46:05,580 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:46:05,581 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 25 treesize of output 52 [2018-01-31 08:46:05,581 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:46:05,590 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:46:05,615 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:46:05,615 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:38, output treesize:34 [2018-01-31 08:46:05,830 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 34 [2018-01-31 08:46:05,833 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:46:05,834 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:46:05,835 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:46:05,836 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:46:05,836 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:46:05,837 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:46:05,838 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 93 [2018-01-31 08:46:05,838 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:46:05,850 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:46:05,859 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-31 08:46:05,859 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:54, output treesize:50 [2018-01-31 08:46:06,065 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 43 [2018-01-31 08:46:06,078 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:46:06,079 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:46:06,080 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:46:06,081 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:46:06,081 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:46:06,082 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:46:06,083 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:46:06,084 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:46:06,112 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:46:06,113 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:46:06,114 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 146 [2018-01-31 08:46:06,115 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:46:06,133 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:46:06,145 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-31 08:46:06,146 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:70, output treesize:66 [2018-01-31 08:46:06,972 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 52 [2018-01-31 08:46:06,975 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:46:06,976 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:46:06,977 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:46:06,978 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:46:06,979 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:46:06,980 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:46:06,981 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:46:06,981 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:46:06,982 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:46:06,983 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:46:06,984 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:46:06,985 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:46:06,986 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:46:06,986 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:46:06,996 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:46:06,998 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 211 [2018-01-31 08:46:06,998 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:46:07,026 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:46:07,042 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-01-31 08:46:07,042 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:86, output treesize:82 [2018-01-31 08:46:07,395 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 61 [2018-01-31 08:46:07,438 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:46:07,460 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:46:07,463 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:46:07,464 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:46:07,465 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:46:07,466 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:46:07,467 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:46:07,468 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:46:07,469 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:46:07,470 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:46:07,471 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:46:07,472 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:46:07,473 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:46:07,474 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:46:07,475 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:46:07,475 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:46:07,476 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:46:07,477 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:46:07,478 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:46:07,479 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:46:07,480 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:46:07,481 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 288 [2018-01-31 08:46:07,482 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:46:07,525 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:46:07,544 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-01-31 08:46:07,545 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:102, output treesize:98 [2018-01-31 08:46:08,196 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 70 [2018-01-31 08:46:08,200 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:46:08,201 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:46:08,202 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:46:08,203 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:46:08,204 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:46:08,205 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:46:08,206 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:46:08,207 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:46:08,208 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:46:08,209 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:46:08,210 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:46:08,210 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:46:08,211 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:46:08,212 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:46:08,213 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:46:08,214 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:46:08,215 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:46:08,216 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:46:08,217 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:46:08,218 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:46:08,223 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:46:08,224 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:46:08,226 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:46:08,227 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:46:08,228 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:46:08,229 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:46:08,230 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:46:08,231 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:46:08,232 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 377 [2018-01-31 08:46:08,233 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:46:08,307 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:46:08,331 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2018-01-31 08:46:08,331 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:118, output treesize:114 [2018-01-31 08:46:12,487 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 79 [2018-01-31 08:46:12,491 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:46:12,492 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:46:12,493 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:46:12,494 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:46:12,495 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:46:12,496 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:46:12,497 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:46:12,498 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:46:12,501 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:46:12,502 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:46:12,503 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:46:12,504 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:46:12,505 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:46:12,506 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:46:12,507 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:46:12,508 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:46:12,509 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:46:12,510 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:46:12,511 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:46:12,512 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:46:12,513 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:46:12,514 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:46:12,515 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:46:12,516 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:46:12,545 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:46:12,551 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:46:12,552 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:46:12,553 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:46:12,554 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:46:12,555 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:46:12,556 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:46:12,557 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:46:12,558 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:46:12,559 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:46:12,560 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:46:12,561 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:46:12,563 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 36 disjoint index pairs (out of 28 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 478 [2018-01-31 08:46:12,563 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:46:12,646 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:46:12,679 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2018-01-31 08:46:12,680 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:134, output treesize:130 Received shutdown request... [2018-01-31 08:46:17,780 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-01-31 08:46:17,780 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-31 08:46:17,784 WARN L185 ceAbstractionStarter]: Timeout [2018-01-31 08:46:17,785 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.01 08:46:17 BoogieIcfgContainer [2018-01-31 08:46:17,785 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-31 08:46:17,786 INFO L168 Benchmark]: Toolchain (without parser) took 151916.81 ms. Allocated memory was 309.3 MB in the beginning and 657.5 MB in the end (delta: 348.1 MB). Free memory was 268.0 MB in the beginning and 372.8 MB in the end (delta: -104.7 MB). Peak memory consumption was 243.4 MB. Max. memory is 5.3 GB. [2018-01-31 08:46:17,787 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 309.3 MB. Free memory is still 275.0 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-31 08:46:17,787 INFO L168 Benchmark]: CACSL2BoogieTranslator took 347.37 ms. Allocated memory is still 309.3 MB. Free memory was 268.0 MB in the beginning and 254.0 MB in the end (delta: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 5.3 GB. [2018-01-31 08:46:17,787 INFO L168 Benchmark]: Boogie Preprocessor took 48.13 ms. Allocated memory is still 309.3 MB. Free memory was 254.0 MB in the beginning and 253.0 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 5.3 GB. [2018-01-31 08:46:17,788 INFO L168 Benchmark]: RCFGBuilder took 650.84 ms. Allocated memory is still 309.3 MB. Free memory was 253.0 MB in the beginning and 228.6 MB in the end (delta: 24.5 MB). Peak memory consumption was 24.5 MB. Max. memory is 5.3 GB. [2018-01-31 08:46:17,788 INFO L168 Benchmark]: TraceAbstraction took 150857.23 ms. Allocated memory was 309.3 MB in the beginning and 657.5 MB in the end (delta: 348.1 MB). Free memory was 227.6 MB in the beginning and 372.8 MB in the end (delta: -145.2 MB). Peak memory consumption was 202.9 MB. Max. memory is 5.3 GB. [2018-01-31 08:46:17,789 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.17 ms. Allocated memory is still 309.3 MB. Free memory is still 275.0 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 347.37 ms. Allocated memory is still 309.3 MB. Free memory was 268.0 MB in the beginning and 254.0 MB in the end (delta: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 48.13 ms. Allocated memory is still 309.3 MB. Free memory was 254.0 MB in the beginning and 253.0 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 5.3 GB. * RCFGBuilder took 650.84 ms. Allocated memory is still 309.3 MB. Free memory was 253.0 MB in the beginning and 228.6 MB in the end (delta: 24.5 MB). Peak memory consumption was 24.5 MB. Max. memory is 5.3 GB. * TraceAbstraction took 150857.23 ms. Allocated memory was 309.3 MB in the beginning and 657.5 MB in the end (delta: 348.1 MB). Free memory was 227.6 MB in the beginning and 372.8 MB in the end (delta: -145.2 MB). Peak memory consumption was 202.9 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1477]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 1477). Cancelled while BasicCegarLoop was analyzing trace of length 121 with TraceHistMax 11, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 68 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1460). Cancelled while BasicCegarLoop was analyzing trace of length 121 with TraceHistMax 11, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 68 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1460). Cancelled while BasicCegarLoop was analyzing trace of length 121 with TraceHistMax 11, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 68 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1460). Cancelled while BasicCegarLoop was analyzing trace of length 121 with TraceHistMax 11, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 68 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1460). Cancelled while BasicCegarLoop was analyzing trace of length 121 with TraceHistMax 11, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 68 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1470). Cancelled while BasicCegarLoop was analyzing trace of length 121 with TraceHistMax 11, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 68 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1470). Cancelled while BasicCegarLoop was analyzing trace of length 121 with TraceHistMax 11, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 68 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1474). Cancelled while BasicCegarLoop was analyzing trace of length 121 with TraceHistMax 11, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 68 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1474). Cancelled while BasicCegarLoop was analyzing trace of length 121 with TraceHistMax 11, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 68 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1446). Cancelled while BasicCegarLoop was analyzing trace of length 121 with TraceHistMax 11, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 68 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1451). Cancelled while BasicCegarLoop was analyzing trace of length 121 with TraceHistMax 11, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 68 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1451). Cancelled while BasicCegarLoop was analyzing trace of length 121 with TraceHistMax 11, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 68 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1451). Cancelled while BasicCegarLoop was analyzing trace of length 121 with TraceHistMax 11, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 68 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1446). Cancelled while BasicCegarLoop was analyzing trace of length 121 with TraceHistMax 11, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 68 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1451). Cancelled while BasicCegarLoop was analyzing trace of length 121 with TraceHistMax 11, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 68 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 97 locations, 15 error locations. TIMEOUT Result, 150.8s OverallTime, 23 OverallIterations, 11 TraceHistogramMax, 107.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2055 SDtfs, 2377 SDslu, 16423 SDs, 0 SdLazy, 6751 SolverSat, 423 SolverUnsat, 40 SolverUnknown, 0 SolverNotchecked, 41.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1444 GetRequests, 847 SyntacticMatches, 4 SemanticMatches, 593 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 7314 ImplicationChecksByTransitivity, 87.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=211occurred in iteration=21, 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.3s AutomataMinimizationTime, 22 MinimizatonAttempts, 384 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 25.0s InterpolantComputationTime, 2505 NumberOfCodeBlocks, 2379 NumberOfCodeBlocksAsserted, 39 NumberOfCheckSat, 2471 ConstructedInterpolants, 104 QuantifiedInterpolants, 1484198 SizeOfPredicates, 139 NumberOfNonLiveVariables, 2247 ConjunctsInSsa, 252 ConjunctsInUnsatCore, 34 InterpolantComputations, 11 PerfectInterpolantSequences, 2653/4479 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test17_2_false-valid-free.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-31_08-46-17-798.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test17_2_false-valid-free.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-31_08-46-17-798.csv Completed graceful shutdown