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.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test17_2_false-valid-free.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-24 12:19:05,829 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-24 12:19:05,893 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-24 12:19:05,908 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-24 12:19:05,908 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-24 12:19:05,909 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-24 12:19:05,911 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-24 12:19:05,912 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-24 12:19:05,914 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-24 12:19:05,915 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-24 12:19:05,916 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-24 12:19:05,916 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-24 12:19:05,916 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-24 12:19:05,917 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-24 12:19:05,918 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-24 12:19:05,920 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-24 12:19:05,922 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-24 12:19:05,925 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-24 12:19:05,926 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-24 12:19:05,927 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-24 12:19:05,930 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-24 12:19:05,930 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-24 12:19:05,930 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-24 12:19:05,932 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-24 12:19:05,933 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-24 12:19:05,934 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-24 12:19:05,934 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-24 12:19:05,935 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-24 12:19:05,935 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-24 12:19:05,935 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-24 12:19:05,936 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-24 12:19:05,936 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.epf [2018-01-24 12:19:05,947 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-24 12:19:05,947 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-24 12:19:05,948 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-24 12:19:05,948 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-24 12:19:05,948 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-24 12:19:05,948 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-24 12:19:05,949 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-24 12:19:05,949 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-24 12:19:05,949 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-24 12:19:05,950 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-24 12:19:05,950 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-24 12:19:05,950 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-24 12:19:05,950 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-24 12:19:05,950 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-24 12:19:05,951 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-24 12:19:05,951 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-24 12:19:05,951 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-24 12:19:05,951 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-24 12:19:05,951 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-24 12:19:05,952 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-24 12:19:05,952 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-24 12:19:05,952 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-24 12:19:05,952 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-24 12:19:05,952 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 12:19:05,952 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-24 12:19:05,953 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-24 12:19:05,953 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-24 12:19:05,953 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-24 12:19:05,953 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-24 12:19:05,953 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-24 12:19:05,954 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-24 12:19:05,954 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-24 12:19:05,955 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-24 12:19:05,955 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-24 12:19:05,990 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-24 12:19:06,002 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-24 12:19:06,005 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-24 12:19:06,006 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-24 12:19:06,006 INFO L276 PluginConnector]: CDTParser initialized [2018-01-24 12:19:06,007 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-24 12:19:06,206 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-24 12:19:06,213 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-24 12:19:06,214 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-24 12:19:06,214 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-24 12:19:06,221 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-24 12:19:06,222 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 12:19:06" (1/1) ... [2018-01-24 12:19:06,225 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@19a251b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:19:06, skipping insertion in model container [2018-01-24 12:19:06,225 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 12:19:06" (1/1) ... [2018-01-24 12:19:06,240 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 12:19:06,290 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 12:19:06,403 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 12:19:06,423 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 12:19:06,432 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:19:06 WrapperNode [2018-01-24 12:19:06,432 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-24 12:19:06,433 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-24 12:19:06,433 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-24 12:19:06,433 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-24 12:19:06,450 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:19:06" (1/1) ... [2018-01-24 12:19:06,450 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:19:06" (1/1) ... [2018-01-24 12:19:06,461 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:19:06" (1/1) ... [2018-01-24 12:19:06,462 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:19:06" (1/1) ... [2018-01-24 12:19:06,465 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:19:06" (1/1) ... [2018-01-24 12:19:06,469 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:19:06" (1/1) ... [2018-01-24 12:19:06,470 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:19:06" (1/1) ... [2018-01-24 12:19:06,471 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-24 12:19:06,472 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-24 12:19:06,472 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-24 12:19:06,472 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-24 12:19:06,473 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:19:06" (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-24 12:19:06,520 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-24 12:19:06,521 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-24 12:19:06,521 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-01-24 12:19:06,521 INFO L136 BoogieDeclarations]: Found implementation of procedure alloc_unsafe_17 [2018-01-24 12:19:06,521 INFO L136 BoogieDeclarations]: Found implementation of procedure free_17 [2018-01-24 12:19:06,521 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-01-24 12:19:06,521 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-24 12:19:06,521 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-24 12:19:06,521 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-24 12:19:06,521 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-24 12:19:06,522 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-24 12:19:06,522 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-24 12:19:06,522 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-24 12:19:06,522 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-24 12:19:06,522 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-24 12:19:06,522 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-01-24 12:19:06,523 INFO L128 BoogieDeclarations]: Found specification of procedure alloc_unsafe_17 [2018-01-24 12:19:06,523 INFO L128 BoogieDeclarations]: Found specification of procedure free_17 [2018-01-24 12:19:06,523 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-01-24 12:19:06,523 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-24 12:19:06,523 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-24 12:19:06,523 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-24 12:19:06,799 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-24 12:19:06,800 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 12:19:06 BoogieIcfgContainer [2018-01-24 12:19:06,800 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-24 12:19:06,801 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-24 12:19:06,801 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-24 12:19:06,803 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-24 12:19:06,803 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.01 12:19:06" (1/3) ... [2018-01-24 12:19:06,804 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d785675 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 12:19:06, skipping insertion in model container [2018-01-24 12:19:06,804 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:19:06" (2/3) ... [2018-01-24 12:19:06,804 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d785675 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 12:19:06, skipping insertion in model container [2018-01-24 12:19:06,804 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 12:19:06" (3/3) ... [2018-01-24 12:19:06,806 INFO L105 eAbstractionObserver]: Analyzing ICFG memleaks_test17_2_false-valid-free.i [2018-01-24 12:19:06,812 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-24 12:19:06,819 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 15 error locations. [2018-01-24 12:19:06,869 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-24 12:19:06,870 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-24 12:19:06,870 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-24 12:19:06,870 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-24 12:19:06,870 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-24 12:19:06,870 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-24 12:19:06,870 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-24 12:19:06,870 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-24 12:19:06,871 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-24 12:19:06,893 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states. [2018-01-24 12:19:06,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-01-24 12:19:06,899 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:19:06,900 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:19:06,900 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-24 12:19:06,906 INFO L82 PathProgramCache]: Analyzing trace with hash 1429677520, now seen corresponding path program 1 times [2018-01-24 12:19:06,908 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:19:06,909 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:19:06,956 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:19:06,956 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:19:06,956 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:19:07,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:19:07,010 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:19:07,107 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-24 12:19:07,110 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:19:07,111 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-24 12:19:07,113 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-24 12:19:07,124 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-24 12:19:07,125 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 12:19:07,127 INFO L87 Difference]: Start difference. First operand 72 states. Second operand 3 states. [2018-01-24 12:19:07,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:19:07,408 INFO L93 Difference]: Finished difference Result 178 states and 218 transitions. [2018-01-24 12:19:07,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-24 12:19:07,410 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-01-24 12:19:07,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:19:07,425 INFO L225 Difference]: With dead ends: 178 [2018-01-24 12:19:07,425 INFO L226 Difference]: Without dead ends: 116 [2018-01-24 12:19:07,430 INFO L525 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-24 12:19:07,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-01-24 12:19:07,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 73. [2018-01-24 12:19:07,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-01-24 12:19:07,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 81 transitions. [2018-01-24 12:19:07,482 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 81 transitions. Word has length 17 [2018-01-24 12:19:07,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:19:07,483 INFO L432 AbstractCegarLoop]: Abstraction has 73 states and 81 transitions. [2018-01-24 12:19:07,483 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-24 12:19:07,483 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 81 transitions. [2018-01-24 12:19:07,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-01-24 12:19:07,484 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:19:07,485 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:19:07,485 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-24 12:19:07,485 INFO L82 PathProgramCache]: Analyzing trace with hash 1429687667, now seen corresponding path program 1 times [2018-01-24 12:19:07,485 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:19:07,485 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:19:07,487 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:19:07,488 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:19:07,488 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:19:07,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:19:07,506 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:19:07,585 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-24 12:19:07,585 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:19:07,586 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 12:19:07,587 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 12:19:07,588 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 12:19:07,588 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 12:19:07,588 INFO L87 Difference]: Start difference. First operand 73 states and 81 transitions. Second operand 5 states. [2018-01-24 12:19:07,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:19:07,642 INFO L93 Difference]: Finished difference Result 136 states and 149 transitions. [2018-01-24 12:19:07,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 12:19:07,645 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-01-24 12:19:07,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:19:07,647 INFO L225 Difference]: With dead ends: 136 [2018-01-24 12:19:07,648 INFO L226 Difference]: Without dead ends: 73 [2018-01-24 12:19:07,649 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 12:19:07,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-01-24 12:19:07,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 71. [2018-01-24 12:19:07,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-01-24 12:19:07,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 78 transitions. [2018-01-24 12:19:07,659 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 78 transitions. Word has length 17 [2018-01-24 12:19:07,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:19:07,660 INFO L432 AbstractCegarLoop]: Abstraction has 71 states and 78 transitions. [2018-01-24 12:19:07,660 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 12:19:07,660 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 78 transitions. [2018-01-24 12:19:07,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-24 12:19:07,661 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:19:07,661 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:19:07,661 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-24 12:19:07,661 INFO L82 PathProgramCache]: Analyzing trace with hash 1294678610, now seen corresponding path program 1 times [2018-01-24 12:19:07,661 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:19:07,662 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:19:07,663 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:19:07,663 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:19:07,663 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:19:07,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:19:07,681 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:19:07,756 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-24 12:19:07,756 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:19:07,756 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-24 12:19:07,757 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 12:19:07,757 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 12:19:07,757 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 12:19:07,757 INFO L87 Difference]: Start difference. First operand 71 states and 78 transitions. Second operand 6 states. [2018-01-24 12:19:07,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:19:07,825 INFO L93 Difference]: Finished difference Result 75 states and 81 transitions. [2018-01-24 12:19:07,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 12:19:07,825 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-01-24 12:19:07,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:19:07,827 INFO L225 Difference]: With dead ends: 75 [2018-01-24 12:19:07,827 INFO L226 Difference]: Without dead ends: 71 [2018-01-24 12:19:07,827 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-01-24 12:19:07,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-01-24 12:19:07,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2018-01-24 12:19:07,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-01-24 12:19:07,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 77 transitions. [2018-01-24 12:19:07,836 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 77 transitions. Word has length 19 [2018-01-24 12:19:07,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:19:07,837 INFO L432 AbstractCegarLoop]: Abstraction has 71 states and 77 transitions. [2018-01-24 12:19:07,837 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 12:19:07,837 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 77 transitions. [2018-01-24 12:19:07,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-24 12:19:07,838 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:19:07,838 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:19:07,838 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-24 12:19:07,839 INFO L82 PathProgramCache]: Analyzing trace with hash 1294688757, now seen corresponding path program 1 times [2018-01-24 12:19:07,839 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:19:07,839 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:19:07,841 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:19:07,841 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:19:07,841 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:19:07,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:19:07,855 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:19:07,912 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-24 12:19:07,912 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:19:07,912 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 12:19:07,913 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 12:19:07,913 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 12:19:07,913 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 12:19:07,914 INFO L87 Difference]: Start difference. First operand 71 states and 77 transitions. Second operand 6 states. [2018-01-24 12:19:08,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:19:08,017 INFO L93 Difference]: Finished difference Result 71 states and 77 transitions. [2018-01-24 12:19:08,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 12:19:08,018 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-01-24 12:19:08,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:19:08,019 INFO L225 Difference]: With dead ends: 71 [2018-01-24 12:19:08,019 INFO L226 Difference]: Without dead ends: 70 [2018-01-24 12:19:08,020 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-01-24 12:19:08,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-01-24 12:19:08,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2018-01-24 12:19:08,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-01-24 12:19:08,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 76 transitions. [2018-01-24 12:19:08,028 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 76 transitions. Word has length 19 [2018-01-24 12:19:08,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:19:08,029 INFO L432 AbstractCegarLoop]: Abstraction has 70 states and 76 transitions. [2018-01-24 12:19:08,029 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 12:19:08,029 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 76 transitions. [2018-01-24 12:19:08,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-24 12:19:08,030 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:19:08,030 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:19:08,030 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-24 12:19:08,030 INFO L82 PathProgramCache]: Analyzing trace with hash 1294688758, now seen corresponding path program 1 times [2018-01-24 12:19:08,031 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:19:08,031 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:19:08,032 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:19:08,032 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:19:08,032 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:19:08,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:19:08,052 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:19:08,353 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-24 12:19:08,354 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:19:08,354 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-24 12:19:08,354 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-24 12:19:08,355 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-24 12:19:08,355 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-01-24 12:19:08,355 INFO L87 Difference]: Start difference. First operand 70 states and 76 transitions. Second operand 9 states. [2018-01-24 12:19:08,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:19:08,607 INFO L93 Difference]: Finished difference Result 130 states and 141 transitions. [2018-01-24 12:19:08,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-24 12:19:08,608 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 19 [2018-01-24 12:19:08,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:19:08,609 INFO L225 Difference]: With dead ends: 130 [2018-01-24 12:19:08,609 INFO L226 Difference]: Without dead ends: 74 [2018-01-24 12:19:08,610 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2018-01-24 12:19:08,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-01-24 12:19:08,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 73. [2018-01-24 12:19:08,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-01-24 12:19:08,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 79 transitions. [2018-01-24 12:19:08,619 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 79 transitions. Word has length 19 [2018-01-24 12:19:08,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:19:08,619 INFO L432 AbstractCegarLoop]: Abstraction has 73 states and 79 transitions. [2018-01-24 12:19:08,620 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-24 12:19:08,620 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 79 transitions. [2018-01-24 12:19:08,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-24 12:19:08,621 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:19:08,621 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:19:08,621 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-24 12:19:08,621 INFO L82 PathProgramCache]: Analyzing trace with hash 607378637, now seen corresponding path program 1 times [2018-01-24 12:19:08,622 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:19:08,622 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:19:08,623 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:19:08,623 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:19:08,623 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:19:08,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:19:08,640 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:19:08,931 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:19:08,931 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:19:08,932 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-24 12:19:08,940 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:19:08,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:19:08,974 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:19:09,055 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-24 12:19:09,057 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:19:09,070 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-24 12:19:09,070 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:19:09,082 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 12:19:09,082 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:36 [2018-01-24 12:19:09,262 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-24 12:19:09,283 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 12:19:09,283 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 18 [2018-01-24 12:19:09,284 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-01-24 12:19:09,284 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-01-24 12:19:09,284 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=297, Unknown=0, NotChecked=0, Total=342 [2018-01-24 12:19:09,284 INFO L87 Difference]: Start difference. First operand 73 states and 79 transitions. Second operand 19 states. [2018-01-24 12:19:09,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:19:09,607 INFO L93 Difference]: Finished difference Result 135 states and 148 transitions. [2018-01-24 12:19:09,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-24 12:19:09,607 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 23 [2018-01-24 12:19:09,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:19:09,608 INFO L225 Difference]: With dead ends: 135 [2018-01-24 12:19:09,609 INFO L226 Difference]: Without dead ends: 79 [2018-01-24 12:19:09,609 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=114, Invalid=588, Unknown=0, NotChecked=0, Total=702 [2018-01-24 12:19:09,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-01-24 12:19:09,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2018-01-24 12:19:09,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-01-24 12:19:09,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 85 transitions. [2018-01-24 12:19:09,617 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 85 transitions. Word has length 23 [2018-01-24 12:19:09,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:19:09,618 INFO L432 AbstractCegarLoop]: Abstraction has 79 states and 85 transitions. [2018-01-24 12:19:09,618 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-01-24 12:19:09,618 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 85 transitions. [2018-01-24 12:19:09,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-01-24 12:19:09,620 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:19:09,620 INFO L322 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:19:09,620 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-24 12:19:09,620 INFO L82 PathProgramCache]: Analyzing trace with hash 376259064, now seen corresponding path program 1 times [2018-01-24 12:19:09,620 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:19:09,621 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:19:09,622 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:19:09,622 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:19:09,622 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:19:09,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:19:09,641 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:19:09,786 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-01-24 12:19:09,787 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:19:09,787 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-24 12:19:09,787 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-24 12:19:09,788 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-24 12:19:09,788 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-01-24 12:19:09,788 INFO L87 Difference]: Start difference. First operand 79 states and 85 transitions. Second operand 8 states. [2018-01-24 12:19:09,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:19:09,974 INFO L93 Difference]: Finished difference Result 104 states and 117 transitions. [2018-01-24 12:19:09,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-24 12:19:09,974 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 38 [2018-01-24 12:19:09,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:19:09,976 INFO L225 Difference]: With dead ends: 104 [2018-01-24 12:19:09,976 INFO L226 Difference]: Without dead ends: 103 [2018-01-24 12:19:09,977 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-01-24 12:19:09,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-01-24 12:19:09,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 83. [2018-01-24 12:19:09,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-01-24 12:19:09,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 91 transitions. [2018-01-24 12:19:09,987 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 91 transitions. Word has length 38 [2018-01-24 12:19:09,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:19:09,987 INFO L432 AbstractCegarLoop]: Abstraction has 83 states and 91 transitions. [2018-01-24 12:19:09,987 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-24 12:19:09,987 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 91 transitions. [2018-01-24 12:19:09,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-01-24 12:19:09,989 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:19:09,989 INFO L322 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:19:09,989 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-24 12:19:09,989 INFO L82 PathProgramCache]: Analyzing trace with hash 376259065, now seen corresponding path program 1 times [2018-01-24 12:19:09,989 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:19:09,989 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:19:09,990 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:19:09,991 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:19:09,991 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:19:10,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:19:10,006 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:19:10,059 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:19:10,060 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:19:10,060 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-24 12:19:10,066 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:19:10,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:19:10,089 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:19:10,136 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:19:10,161 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 12:19:10,161 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2018-01-24 12:19:10,162 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-24 12:19:10,162 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-24 12:19:10,162 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=61, Unknown=0, NotChecked=0, Total=110 [2018-01-24 12:19:10,162 INFO L87 Difference]: Start difference. First operand 83 states and 91 transitions. Second operand 11 states. [2018-01-24 12:19:10,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:19:10,210 INFO L93 Difference]: Finished difference Result 148 states and 163 transitions. [2018-01-24 12:19:10,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-24 12:19:10,210 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 38 [2018-01-24 12:19:10,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:19:10,211 INFO L225 Difference]: With dead ends: 148 [2018-01-24 12:19:10,211 INFO L226 Difference]: Without dead ends: 89 [2018-01-24 12:19:10,212 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=49, Invalid=61, Unknown=0, NotChecked=0, Total=110 [2018-01-24 12:19:10,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-01-24 12:19:10,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 87. [2018-01-24 12:19:10,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-01-24 12:19:10,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 95 transitions. [2018-01-24 12:19:10,219 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 95 transitions. Word has length 38 [2018-01-24 12:19:10,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:19:10,220 INFO L432 AbstractCegarLoop]: Abstraction has 87 states and 95 transitions. [2018-01-24 12:19:10,220 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-24 12:19:10,220 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 95 transitions. [2018-01-24 12:19:10,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-01-24 12:19:10,221 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:19:10,222 INFO L322 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:19:10,222 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-24 12:19:10,222 INFO L82 PathProgramCache]: Analyzing trace with hash 997822914, now seen corresponding path program 2 times [2018-01-24 12:19:10,222 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:19:10,222 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:19:10,223 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:19:10,224 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:19:10,224 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:19:10,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:19:10,241 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:19:10,341 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:19:10,341 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:19:10,341 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-24 12:19:10,352 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-24 12:19:10,373 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 12:19:10,376 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 12:19:10,379 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:19:10,403 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-01-24 12:19:10,437 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-24 12:19:10,437 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 10 [2018-01-24 12:19:10,437 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-24 12:19:10,438 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-24 12:19:10,438 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2018-01-24 12:19:10,438 INFO L87 Difference]: Start difference. First operand 87 states and 95 transitions. Second operand 10 states. [2018-01-24 12:19:10,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:19:10,697 INFO L93 Difference]: Finished difference Result 175 states and 196 transitions. [2018-01-24 12:19:10,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-24 12:19:10,697 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 42 [2018-01-24 12:19:10,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:19:10,699 INFO L225 Difference]: With dead ends: 175 [2018-01-24 12:19:10,699 INFO L226 Difference]: Without dead ends: 116 [2018-01-24 12:19:10,699 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=146, Unknown=0, NotChecked=0, Total=210 [2018-01-24 12:19:10,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-01-24 12:19:10,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 93. [2018-01-24 12:19:10,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-01-24 12:19:10,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 101 transitions. [2018-01-24 12:19:10,710 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 101 transitions. Word has length 42 [2018-01-24 12:19:10,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:19:10,710 INFO L432 AbstractCegarLoop]: Abstraction has 93 states and 101 transitions. [2018-01-24 12:19:10,710 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-24 12:19:10,710 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 101 transitions. [2018-01-24 12:19:10,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-01-24 12:19:10,712 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:19:10,712 INFO L322 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:19:10,712 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-24 12:19:10,712 INFO L82 PathProgramCache]: Analyzing trace with hash -362065032, now seen corresponding path program 1 times [2018-01-24 12:19:10,712 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:19:10,713 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:19:10,714 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:19:10,714 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-24 12:19:10,714 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:19:10,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:19:10,729 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:19:10,782 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2018-01-24 12:19:10,782 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:19:10,782 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 12:19:10,783 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 12:19:10,783 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 12:19:10,783 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 12:19:10,783 INFO L87 Difference]: Start difference. First operand 93 states and 101 transitions. Second operand 5 states. [2018-01-24 12:19:10,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:19:10,811 INFO L93 Difference]: Finished difference Result 165 states and 181 transitions. [2018-01-24 12:19:10,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 12:19:10,812 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 50 [2018-01-24 12:19:10,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:19:10,813 INFO L225 Difference]: With dead ends: 165 [2018-01-24 12:19:10,813 INFO L226 Difference]: Without dead ends: 108 [2018-01-24 12:19:10,814 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 12:19:10,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-01-24 12:19:10,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 95. [2018-01-24 12:19:10,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-01-24 12:19:10,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 103 transitions. [2018-01-24 12:19:10,824 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 103 transitions. Word has length 50 [2018-01-24 12:19:10,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:19:10,824 INFO L432 AbstractCegarLoop]: Abstraction has 95 states and 103 transitions. [2018-01-24 12:19:10,824 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 12:19:10,825 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 103 transitions. [2018-01-24 12:19:10,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-01-24 12:19:10,826 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:19:10,826 INFO L322 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:19:10,826 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-24 12:19:10,826 INFO L82 PathProgramCache]: Analyzing trace with hash -1169426246, now seen corresponding path program 1 times [2018-01-24 12:19:10,826 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:19:10,827 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:19:10,828 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:19:10,828 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:19:10,828 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:19:10,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:19:10,849 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:19:10,955 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-01-24 12:19:10,955 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:19:10,955 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-24 12:19:10,965 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:19:10,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:19:10,997 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:19:11,135 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 6 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:19:11,168 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 12:19:11,168 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2018-01-24 12:19:11,169 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-01-24 12:19:11,169 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-01-24 12:19:11,169 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=120, Unknown=0, NotChecked=0, Total=210 [2018-01-24 12:19:11,169 INFO L87 Difference]: Start difference. First operand 95 states and 103 transitions. Second operand 15 states. [2018-01-24 12:19:11,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:19:11,257 INFO L93 Difference]: Finished difference Result 164 states and 179 transitions. [2018-01-24 12:19:11,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-24 12:19:11,257 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 52 [2018-01-24 12:19:11,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:19:11,258 INFO L225 Difference]: With dead ends: 164 [2018-01-24 12:19:11,259 INFO L226 Difference]: Without dead ends: 101 [2018-01-24 12:19:11,259 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=120, Unknown=0, NotChecked=0, Total=210 [2018-01-24 12:19:11,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-01-24 12:19:11,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 99. [2018-01-24 12:19:11,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-01-24 12:19:11,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 107 transitions. [2018-01-24 12:19:11,267 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 107 transitions. Word has length 52 [2018-01-24 12:19:11,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:19:11,267 INFO L432 AbstractCegarLoop]: Abstraction has 99 states and 107 transitions. [2018-01-24 12:19:11,267 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-01-24 12:19:11,267 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 107 transitions. [2018-01-24 12:19:11,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-01-24 12:19:11,268 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:19:11,268 INFO L322 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:19:11,268 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-24 12:19:11,268 INFO L82 PathProgramCache]: Analyzing trace with hash 1567126723, now seen corresponding path program 2 times [2018-01-24 12:19:11,268 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:19:11,268 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:19:11,269 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:19:11,269 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:19:11,269 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:19:11,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:19:11,286 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:19:11,380 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-01-24 12:19:11,380 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:19:11,380 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-24 12:19:11,386 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-24 12:19:11,398 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 12:19:11,409 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 12:19:11,411 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 12:19:11,415 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:19:11,502 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 6 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:19:11,527 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 12:19:11,528 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2018-01-24 12:19:11,528 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-01-24 12:19:11,528 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-01-24 12:19:11,529 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=157, Unknown=0, NotChecked=0, Total=272 [2018-01-24 12:19:11,529 INFO L87 Difference]: Start difference. First operand 99 states and 107 transitions. Second operand 17 states. [2018-01-24 12:19:11,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:19:11,741 INFO L93 Difference]: Finished difference Result 168 states and 183 transitions. [2018-01-24 12:19:11,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-24 12:19:11,742 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 56 [2018-01-24 12:19:11,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:19:11,743 INFO L225 Difference]: With dead ends: 168 [2018-01-24 12:19:11,743 INFO L226 Difference]: Without dead ends: 105 [2018-01-24 12:19:11,744 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=115, Invalid=157, Unknown=0, NotChecked=0, Total=272 [2018-01-24 12:19:11,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-01-24 12:19:11,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 103. [2018-01-24 12:19:11,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-01-24 12:19:11,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 111 transitions. [2018-01-24 12:19:11,751 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 111 transitions. Word has length 56 [2018-01-24 12:19:11,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:19:11,751 INFO L432 AbstractCegarLoop]: Abstraction has 103 states and 111 transitions. [2018-01-24 12:19:11,751 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-01-24 12:19:11,751 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 111 transitions. [2018-01-24 12:19:11,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-01-24 12:19:11,752 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:19:11,752 INFO L322 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:19:11,753 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-24 12:19:11,753 INFO L82 PathProgramCache]: Analyzing trace with hash -429538228, now seen corresponding path program 3 times [2018-01-24 12:19:11,753 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:19:11,753 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:19:11,754 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:19:11,755 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-24 12:19:11,755 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:19:11,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:19:11,768 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:19:11,982 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-01-24 12:19:11,982 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:19:11,982 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-24 12:19:11,991 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-24 12:19:12,006 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-24 12:19:12,015 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-24 12:19:12,016 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 12:19:12,021 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:19:12,024 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-24 12:19:12,025 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:19:12,037 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:19:12,037 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-24 12:19:12,100 WARN L1029 $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-24 12:19:12,110 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-24 12:19:12,111 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:19:12,118 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-24 12:19:12,118 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:11 [2018-01-24 12:19:12,140 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 98 trivial. 3 not checked. [2018-01-24 12:19:12,162 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 12:19:12,162 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 19 [2018-01-24 12:19:12,162 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-01-24 12:19:12,163 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-01-24 12:19:12,163 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=245, Unknown=1, NotChecked=32, Total=342 [2018-01-24 12:19:12,163 INFO L87 Difference]: Start difference. First operand 103 states and 111 transitions. Second operand 19 states. [2018-01-24 12:19:12,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:19:12,687 INFO L93 Difference]: Finished difference Result 209 states and 235 transitions. [2018-01-24 12:19:12,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-01-24 12:19:12,687 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 60 [2018-01-24 12:19:12,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:19:12,689 INFO L225 Difference]: With dead ends: 209 [2018-01-24 12:19:12,689 INFO L226 Difference]: Without dead ends: 146 [2018-01-24 12:19:12,690 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=203, Invalid=921, Unknown=2, NotChecked=64, Total=1190 [2018-01-24 12:19:12,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-01-24 12:19:12,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 115. [2018-01-24 12:19:12,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-01-24 12:19:12,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 127 transitions. [2018-01-24 12:19:12,702 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 127 transitions. Word has length 60 [2018-01-24 12:19:12,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:19:12,702 INFO L432 AbstractCegarLoop]: Abstraction has 115 states and 127 transitions. [2018-01-24 12:19:12,703 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-01-24 12:19:12,703 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 127 transitions. [2018-01-24 12:19:12,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-01-24 12:19:12,704 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:19:12,704 INFO L322 BasicCegarLoop]: trace histogram [9, 8, 8, 8, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:19:12,704 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-24 12:19:12,704 INFO L82 PathProgramCache]: Analyzing trace with hash 162408278, now seen corresponding path program 1 times [2018-01-24 12:19:12,704 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:19:12,705 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:19:12,706 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:19:12,706 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-24 12:19:12,706 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:19:12,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:19:12,723 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:19:12,822 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 0 proven. 128 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-01-24 12:19:12,822 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:19:12,822 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-24 12:19:12,827 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:19:12,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:19:12,852 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:19:12,943 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 6 proven. 128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:19:12,963 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 12:19:12,964 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 21 [2018-01-24 12:19:12,964 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-01-24 12:19:12,964 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-01-24 12:19:12,965 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=246, Unknown=0, NotChecked=0, Total=420 [2018-01-24 12:19:12,965 INFO L87 Difference]: Start difference. First operand 115 states and 127 transitions. Second operand 21 states. [2018-01-24 12:19:13,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:19:13,033 INFO L93 Difference]: Finished difference Result 192 states and 215 transitions. [2018-01-24 12:19:13,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-24 12:19:13,033 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 64 [2018-01-24 12:19:13,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:19:13,034 INFO L225 Difference]: With dead ends: 192 [2018-01-24 12:19:13,034 INFO L226 Difference]: Without dead ends: 121 [2018-01-24 12:19:13,035 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=174, Invalid=246, Unknown=0, NotChecked=0, Total=420 [2018-01-24 12:19:13,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-01-24 12:19:13,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 119. [2018-01-24 12:19:13,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-01-24 12:19:13,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 131 transitions. [2018-01-24 12:19:13,046 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 131 transitions. Word has length 64 [2018-01-24 12:19:13,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:19:13,046 INFO L432 AbstractCegarLoop]: Abstraction has 119 states and 131 transitions. [2018-01-24 12:19:13,047 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-01-24 12:19:13,047 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 131 transitions. [2018-01-24 12:19:13,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-01-24 12:19:13,047 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:19:13,048 INFO L322 BasicCegarLoop]: trace histogram [10, 9, 9, 9, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:19:13,048 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-24 12:19:13,048 INFO L82 PathProgramCache]: Analyzing trace with hash -1131684385, now seen corresponding path program 2 times [2018-01-24 12:19:13,048 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:19:13,048 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:19:13,049 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:19:13,049 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:19:13,050 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:19:13,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:19:13,069 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:19:13,233 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 0 proven. 162 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-01-24 12:19:13,233 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:19:13,233 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-24 12:19:13,239 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-24 12:19:13,255 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 12:19:13,271 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 12:19:13,275 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 12:19:13,278 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:19:13,413 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 6 proven. 162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:19:13,435 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 12:19:13,435 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 23 [2018-01-24 12:19:13,435 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-01-24 12:19:13,435 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-01-24 12:19:13,436 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=208, Invalid=298, Unknown=0, NotChecked=0, Total=506 [2018-01-24 12:19:13,436 INFO L87 Difference]: Start difference. First operand 119 states and 131 transitions. Second operand 23 states. [2018-01-24 12:19:13,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:19:13,579 INFO L93 Difference]: Finished difference Result 196 states and 219 transitions. [2018-01-24 12:19:13,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-01-24 12:19:13,580 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 68 [2018-01-24 12:19:13,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:19:13,581 INFO L225 Difference]: With dead ends: 196 [2018-01-24 12:19:13,581 INFO L226 Difference]: Without dead ends: 125 [2018-01-24 12:19:13,582 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=223, Invalid=329, Unknown=0, NotChecked=0, Total=552 [2018-01-24 12:19:13,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-01-24 12:19:13,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 123. [2018-01-24 12:19:13,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-01-24 12:19:13,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 135 transitions. [2018-01-24 12:19:13,595 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 135 transitions. Word has length 68 [2018-01-24 12:19:13,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:19:13,595 INFO L432 AbstractCegarLoop]: Abstraction has 123 states and 135 transitions. [2018-01-24 12:19:13,595 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-01-24 12:19:13,595 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 135 transitions. [2018-01-24 12:19:13,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-01-24 12:19:13,596 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:19:13,596 INFO L322 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:19:13,596 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-24 12:19:13,597 INFO L82 PathProgramCache]: Analyzing trace with hash -987158552, now seen corresponding path program 3 times [2018-01-24 12:19:13,597 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:19:13,597 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:19:13,598 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:19:13,598 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-24 12:19:13,598 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:19:13,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:19:13,624 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:19:14,017 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 3 proven. 67 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2018-01-24 12:19:14,018 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:19:14,018 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-24 12:19:14,023 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-24 12:19:14,035 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-24 12:19:14,040 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-24 12:19:14,042 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 12:19:14,045 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:19:14,078 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-24 12:19:14,079 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:19:14,093 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-24 12:19:14,093 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:19:14,107 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-24 12:19:14,107 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 12:19:14,109 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-24 12:19:14,109 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 12:19:14,121 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 12:19:14,122 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:50, output treesize:46 [2018-01-24 12:19:14,390 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:19:14,393 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-24 12:19:14,394 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:19:14,422 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:19:14,423 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:19:14,423 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-24 12:19:14,424 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:19:14,450 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:19:14,451 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:19:14,452 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-24 12:19:14,452 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 12:19:14,546 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:19:14,547 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:19:14,548 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-24 12:19:14,548 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 12:19:14,643 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-24 12:19:14,643 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:73, output treesize:55 [2018-01-24 12:19:14,751 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2018-01-24 12:19:14,781 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 12:19:14,782 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 12] total 26 [2018-01-24 12:19:14,782 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-01-24 12:19:14,782 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-01-24 12:19:14,782 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=633, Unknown=1, NotChecked=0, Total=702 [2018-01-24 12:19:14,782 INFO L87 Difference]: Start difference. First operand 123 states and 135 transitions. Second operand 27 states. [2018-01-24 12:19:15,136 WARN L146 SmtUtils]: Spent 112ms on a formula simplification. DAG size of input: 67 DAG size of output 64 [2018-01-24 12:19:39,232 WARN L143 SmtUtils]: Spent 14356ms on a formula simplification that was a NOOP. DAG size: 52 [2018-01-24 12:19:59,704 WARN L146 SmtUtils]: Spent 20402ms on a formula simplification. DAG size of input: 56 DAG size of output 56 [2018-01-24 12:20:14,361 WARN L143 SmtUtils]: Spent 14070ms on a formula simplification that was a NOOP. DAG size: 45 Received shutdown request... [2018-01-24 12:20:18,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-01-24 12:20:18,890 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-24 12:20:18,894 WARN L187 ceAbstractionStarter]: Timeout [2018-01-24 12:20:18,895 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.01 12:20:18 BoogieIcfgContainer [2018-01-24 12:20:18,895 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-24 12:20:18,895 INFO L168 Benchmark]: Toolchain (without parser) took 72689.20 ms. Allocated memory was 299.9 MB in the beginning and 584.6 MB in the end (delta: 284.7 MB). Free memory was 258.8 MB in the beginning and 489.8 MB in the end (delta: -231.0 MB). Peak memory consumption was 53.7 MB. Max. memory is 5.3 GB. [2018-01-24 12:20:18,896 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 299.9 MB. Free memory is still 264.8 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-24 12:20:18,896 INFO L168 Benchmark]: CACSL2BoogieTranslator took 218.99 ms. Allocated memory is still 299.9 MB. Free memory was 258.8 MB in the beginning and 244.8 MB in the end (delta: 13.9 MB). Peak memory consumption was 13.9 MB. Max. memory is 5.3 GB. [2018-01-24 12:20:18,897 INFO L168 Benchmark]: Boogie Preprocessor took 38.62 ms. Allocated memory is still 299.9 MB. Free memory was 244.8 MB in the beginning and 242.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-24 12:20:18,897 INFO L168 Benchmark]: RCFGBuilder took 328.28 ms. Allocated memory is still 299.9 MB. Free memory was 242.9 MB in the beginning and 221.6 MB in the end (delta: 21.2 MB). Peak memory consumption was 21.2 MB. Max. memory is 5.3 GB. [2018-01-24 12:20:18,897 INFO L168 Benchmark]: TraceAbstraction took 72093.92 ms. Allocated memory was 299.9 MB in the beginning and 584.6 MB in the end (delta: 284.7 MB). Free memory was 221.6 MB in the beginning and 489.8 MB in the end (delta: -268.1 MB). Peak memory consumption was 16.6 MB. Max. memory is 5.3 GB. [2018-01-24 12:20:18,899 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.13 ms. Allocated memory is still 299.9 MB. Free memory is still 264.8 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 218.99 ms. Allocated memory is still 299.9 MB. Free memory was 258.8 MB in the beginning and 244.8 MB in the end (delta: 13.9 MB). Peak memory consumption was 13.9 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 38.62 ms. Allocated memory is still 299.9 MB. Free memory was 244.8 MB in the beginning and 242.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 328.28 ms. Allocated memory is still 299.9 MB. Free memory was 242.9 MB in the beginning and 221.6 MB in the end (delta: 21.2 MB). Peak memory consumption was 21.2 MB. Max. memory is 5.3 GB. * TraceAbstraction took 72093.92 ms. Allocated memory was 299.9 MB in the beginning and 584.6 MB in the end (delta: 284.7 MB). Free memory was 221.6 MB in the beginning and 489.8 MB in the end (delta: -268.1 MB). Peak memory consumption was 16.6 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 constructing difference of abstraction (123states) and interpolant automaton (currently 22 states, 27 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 49. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1460). Cancelled while BasicCegarLoop was constructing difference of abstraction (123states) and interpolant automaton (currently 22 states, 27 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 49. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1460). Cancelled while BasicCegarLoop was constructing difference of abstraction (123states) and interpolant automaton (currently 22 states, 27 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 49. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1460). Cancelled while BasicCegarLoop was constructing difference of abstraction (123states) and interpolant automaton (currently 22 states, 27 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 49. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1460). Cancelled while BasicCegarLoop was constructing difference of abstraction (123states) and interpolant automaton (currently 22 states, 27 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 49. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1470). Cancelled while BasicCegarLoop was constructing difference of abstraction (123states) and interpolant automaton (currently 22 states, 27 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 49. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1470). Cancelled while BasicCegarLoop was constructing difference of abstraction (123states) and interpolant automaton (currently 22 states, 27 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 49. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1474). Cancelled while BasicCegarLoop was constructing difference of abstraction (123states) and interpolant automaton (currently 22 states, 27 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 49. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1474). Cancelled while BasicCegarLoop was constructing difference of abstraction (123states) and interpolant automaton (currently 22 states, 27 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 49. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1446). Cancelled while BasicCegarLoop was constructing difference of abstraction (123states) and interpolant automaton (currently 22 states, 27 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 49. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1451). Cancelled while BasicCegarLoop was constructing difference of abstraction (123states) and interpolant automaton (currently 22 states, 27 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 49. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1451). Cancelled while BasicCegarLoop was constructing difference of abstraction (123states) and interpolant automaton (currently 22 states, 27 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 49. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1451). Cancelled while BasicCegarLoop was constructing difference of abstraction (123states) and interpolant automaton (currently 22 states, 27 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 49. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1446). Cancelled while BasicCegarLoop was constructing difference of abstraction (123states) and interpolant automaton (currently 22 states, 27 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 49. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1451). Cancelled while BasicCegarLoop was constructing difference of abstraction (123states) and interpolant automaton (currently 22 states, 27 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 49. - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 72 locations, 15 error locations. TIMEOUT Result, 72.0s OverallTime, 16 OverallIterations, 11 TraceHistogramMax, 66.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1052 SDtfs, 945 SDslu, 6448 SDs, 0 SdLazy, 2615 SolverSat, 212 SolverUnsat, 24 SolverUnknown, 0 SolverNotchecked, 10.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 663 GetRequests, 432 SyntacticMatches, 3 SemanticMatches, 227 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1180 ImplicationChecksByTransitivity, 53.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=123occurred in iteration=15, 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, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 15 MinimizatonAttempts, 143 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.9s InterpolantComputationTime, 1129 NumberOfCodeBlocks, 1045 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 1104 ConstructedInterpolants, 9 QuantifiedInterpolants, 319802 SizeOfPredicates, 31 NumberOfNonLiveVariables, 1405 ConjunctsInSsa, 140 ConjunctsInUnsatCore, 25 InterpolantComputations, 8 PerfectInterpolantSequences, 601/1670 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: 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.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-24_12-20-18-907.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.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-24_12-20-18-907.csv Completed graceful shutdown