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_test4_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-24 12:31:44,051 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-24 12:31:44,052 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-24 12:31:44,068 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-24 12:31:44,068 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-24 12:31:44,069 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-24 12:31:44,070 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-24 12:31:44,072 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-24 12:31:44,074 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-24 12:31:44,075 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-24 12:31:44,076 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-24 12:31:44,076 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-24 12:31:44,077 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-24 12:31:44,079 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-24 12:31:44,079 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-24 12:31:44,082 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-24 12:31:44,084 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-24 12:31:44,086 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-24 12:31:44,088 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-24 12:31:44,089 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-24 12:31:44,091 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-24 12:31:44,092 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-24 12:31:44,092 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-24 12:31:44,093 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-24 12:31:44,094 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-24 12:31:44,095 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-24 12:31:44,095 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-24 12:31:44,096 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-24 12:31:44,096 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-24 12:31:44,097 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-24 12:31:44,097 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-24 12:31:44,098 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:31:44,106 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-24 12:31:44,106 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-24 12:31:44,107 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-24 12:31:44,107 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-24 12:31:44,107 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-24 12:31:44,107 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-24 12:31:44,108 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-24 12:31:44,108 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-24 12:31:44,108 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-24 12:31:44,108 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-24 12:31:44,108 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-24 12:31:44,109 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-24 12:31:44,109 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-24 12:31:44,109 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-24 12:31:44,109 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-24 12:31:44,109 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-24 12:31:44,109 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-24 12:31:44,109 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-24 12:31:44,110 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-24 12:31:44,110 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-24 12:31:44,110 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-24 12:31:44,110 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-24 12:31:44,110 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-24 12:31:44,110 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 12:31:44,111 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-24 12:31:44,111 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-24 12:31:44,111 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-24 12:31:44,111 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-24 12:31:44,111 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-24 12:31:44,111 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-24 12:31:44,112 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-24 12:31:44,112 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-24 12:31:44,112 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-24 12:31:44,112 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-24 12:31:44,146 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-24 12:31:44,156 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-24 12:31:44,160 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-24 12:31:44,161 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-24 12:31:44,161 INFO L276 PluginConnector]: CDTParser initialized [2018-01-24 12:31:44,162 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test4_true-valid-memsafety_true-termination.i [2018-01-24 12:31:44,344 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-24 12:31:44,349 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-24 12:31:44,349 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-24 12:31:44,349 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-24 12:31:44,355 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-24 12:31:44,355 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 12:31:44" (1/1) ... [2018-01-24 12:31:44,360 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c336041 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:31:44, skipping insertion in model container [2018-01-24 12:31:44,361 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 12:31:44" (1/1) ... [2018-01-24 12:31:44,375 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 12:31:44,422 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 12:31:44,533 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 12:31:44,545 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 12:31:44,551 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:31:44 WrapperNode [2018-01-24 12:31:44,551 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-24 12:31:44,552 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-24 12:31:44,552 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-24 12:31:44,552 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-24 12:31:44,564 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:31:44" (1/1) ... [2018-01-24 12:31:44,564 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:31:44" (1/1) ... [2018-01-24 12:31:44,574 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:31:44" (1/1) ... [2018-01-24 12:31:44,574 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:31:44" (1/1) ... [2018-01-24 12:31:44,578 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:31:44" (1/1) ... [2018-01-24 12:31:44,580 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:31:44" (1/1) ... [2018-01-24 12:31:44,581 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:31:44" (1/1) ... [2018-01-24 12:31:44,583 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-24 12:31:44,584 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-24 12:31:44,584 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-24 12:31:44,584 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-24 12:31:44,585 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:31:44" (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:31:44,665 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-24 12:31:44,666 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-24 12:31:44,666 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-01-24 12:31:44,666 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-01-24 12:31:44,666 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-24 12:31:44,666 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-24 12:31:44,666 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-24 12:31:44,666 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-24 12:31:44,667 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-24 12:31:44,667 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-24 12:31:44,667 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-24 12:31:44,667 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-01-24 12:31:44,667 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-01-24 12:31:44,667 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-24 12:31:44,667 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-24 12:31:44,668 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-24 12:31:44,806 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-24 12:31:44,807 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 12:31:44 BoogieIcfgContainer [2018-01-24 12:31:44,807 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-24 12:31:44,808 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-24 12:31:44,808 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-24 12:31:44,811 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-24 12:31:44,811 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.01 12:31:44" (1/3) ... [2018-01-24 12:31:44,812 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7aef74cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 12:31:44, skipping insertion in model container [2018-01-24 12:31:44,813 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:31:44" (2/3) ... [2018-01-24 12:31:44,813 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7aef74cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 12:31:44, skipping insertion in model container [2018-01-24 12:31:44,813 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 12:31:44" (3/3) ... [2018-01-24 12:31:44,815 INFO L105 eAbstractionObserver]: Analyzing ICFG memleaks_test4_true-valid-memsafety_true-termination.i [2018-01-24 12:31:44,824 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-24 12:31:44,832 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2018-01-24 12:31:44,879 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-24 12:31:44,880 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-24 12:31:44,880 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-24 12:31:44,880 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-24 12:31:44,880 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-24 12:31:44,880 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-24 12:31:44,880 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-24 12:31:44,880 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-24 12:31:44,881 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-24 12:31:44,896 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states. [2018-01-24 12:31:44,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-01-24 12:31:44,901 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:31:44,902 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:31:44,902 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-24 12:31:44,906 INFO L82 PathProgramCache]: Analyzing trace with hash -1042309263, now seen corresponding path program 1 times [2018-01-24 12:31:44,907 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:31:44,908 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:31:44,961 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:31:44,961 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:31:44,961 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:31:45,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:31:45,009 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:31:45,089 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:31:45,091 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:31:45,091 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-24 12:31:45,093 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-24 12:31:45,105 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-24 12:31:45,105 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 12:31:45,108 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 3 states. [2018-01-24 12:31:45,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:31:45,273 INFO L93 Difference]: Finished difference Result 43 states and 49 transitions. [2018-01-24 12:31:45,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-24 12:31:45,274 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-01-24 12:31:45,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:31:45,282 INFO L225 Difference]: With dead ends: 43 [2018-01-24 12:31:45,283 INFO L226 Difference]: Without dead ends: 36 [2018-01-24 12:31:45,285 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:31:45,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-01-24 12:31:45,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 31. [2018-01-24 12:31:45,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-01-24 12:31:45,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2018-01-24 12:31:45,317 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 16 [2018-01-24 12:31:45,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:31:45,317 INFO L432 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2018-01-24 12:31:45,317 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-24 12:31:45,317 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2018-01-24 12:31:45,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-01-24 12:31:45,319 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:31:45,319 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:31:45,319 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-24 12:31:45,319 INFO L82 PathProgramCache]: Analyzing trace with hash -96589069, now seen corresponding path program 1 times [2018-01-24 12:31:45,320 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:31:45,320 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:31:45,321 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:31:45,321 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:31:45,321 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:31:45,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:31:45,342 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:31:45,419 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:31:45,420 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:31:45,423 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-24 12:31:45,425 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 12:31:45,425 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 12:31:45,426 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 12:31:45,426 INFO L87 Difference]: Start difference. First operand 31 states and 34 transitions. Second operand 6 states. [2018-01-24 12:31:45,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:31:45,501 INFO L93 Difference]: Finished difference Result 44 states and 49 transitions. [2018-01-24 12:31:45,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 12:31:45,502 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2018-01-24 12:31:45,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:31:45,503 INFO L225 Difference]: With dead ends: 44 [2018-01-24 12:31:45,504 INFO L226 Difference]: Without dead ends: 40 [2018-01-24 12:31:45,505 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:31:45,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-01-24 12:31:45,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 27. [2018-01-24 12:31:45,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-01-24 12:31:45,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2018-01-24 12:31:45,512 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 18 [2018-01-24 12:31:45,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:31:45,512 INFO L432 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2018-01-24 12:31:45,512 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 12:31:45,512 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2018-01-24 12:31:45,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-24 12:31:45,513 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:31:45,514 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:31:45,514 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-24 12:31:45,514 INFO L82 PathProgramCache]: Analyzing trace with hash 220833638, now seen corresponding path program 1 times [2018-01-24 12:31:45,514 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:31:45,514 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:31:45,516 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:31:45,516 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:31:45,516 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:31:45,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:31:45,532 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:31:45,575 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-24 12:31:45,575 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:31:45,575 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 12:31:45,576 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 12:31:45,576 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 12:31:45,576 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 12:31:45,576 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand 5 states. [2018-01-24 12:31:45,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:31:45,589 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2018-01-24 12:31:45,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 12:31:45,589 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-01-24 12:31:45,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:31:45,590 INFO L225 Difference]: With dead ends: 33 [2018-01-24 12:31:45,591 INFO L226 Difference]: Without dead ends: 32 [2018-01-24 12:31:45,591 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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:31:45,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-01-24 12:31:45,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2018-01-24 12:31:45,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-01-24 12:31:45,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2018-01-24 12:31:45,597 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 20 [2018-01-24 12:31:45,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:31:45,597 INFO L432 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2018-01-24 12:31:45,597 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 12:31:45,598 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2018-01-24 12:31:45,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-24 12:31:45,599 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:31:45,599 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:31:45,599 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-24 12:31:45,599 INFO L82 PathProgramCache]: Analyzing trace with hash 220833639, now seen corresponding path program 1 times [2018-01-24 12:31:45,599 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:31:45,600 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:31:45,601 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:31:45,601 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:31:45,601 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:31:45,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:31:45,616 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:31:45,655 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-24 12:31:45,655 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:31:45,656 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 12:31:45,656 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 12:31:45,656 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 12:31:45,656 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 12:31:45,656 INFO L87 Difference]: Start difference. First operand 31 states and 34 transitions. Second operand 5 states. [2018-01-24 12:31:45,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:31:45,682 INFO L93 Difference]: Finished difference Result 37 states and 39 transitions. [2018-01-24 12:31:45,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 12:31:45,682 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-01-24 12:31:45,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:31:45,683 INFO L225 Difference]: With dead ends: 37 [2018-01-24 12:31:45,684 INFO L226 Difference]: Without dead ends: 36 [2018-01-24 12:31:45,684 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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:31:45,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-01-24 12:31:45,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 31. [2018-01-24 12:31:45,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-01-24 12:31:45,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 33 transitions. [2018-01-24 12:31:45,690 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 33 transitions. Word has length 20 [2018-01-24 12:31:45,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:31:45,691 INFO L432 AbstractCegarLoop]: Abstraction has 31 states and 33 transitions. [2018-01-24 12:31:45,691 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 12:31:45,691 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2018-01-24 12:31:45,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-01-24 12:31:45,692 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:31:45,692 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:31:45,693 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-24 12:31:45,693 INFO L82 PathProgramCache]: Analyzing trace with hash -1744091818, now seen corresponding path program 1 times [2018-01-24 12:31:45,693 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:31:45,693 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:31:45,695 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:31:45,695 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:31:45,695 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:31:45,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:31:45,709 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:31:45,783 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-24 12:31:45,784 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:31:45,784 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:31:45,797 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:31:45,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:31:45,830 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:31:45,877 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-24 12:31:45,911 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 12:31:45,911 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 8 [2018-01-24 12:31:45,911 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-24 12:31:45,912 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-24 12:31:45,912 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-01-24 12:31:45,912 INFO L87 Difference]: Start difference. First operand 31 states and 33 transitions. Second operand 8 states. [2018-01-24 12:31:45,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:31:45,932 INFO L93 Difference]: Finished difference Result 55 states and 57 transitions. [2018-01-24 12:31:45,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 12:31:45,933 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 21 [2018-01-24 12:31:45,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:31:45,933 INFO L225 Difference]: With dead ends: 55 [2018-01-24 12:31:45,934 INFO L226 Difference]: Without dead ends: 31 [2018-01-24 12:31:45,934 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-01-24 12:31:45,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-01-24 12:31:45,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-01-24 12:31:45,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-01-24 12:31:45,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2018-01-24 12:31:45,940 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 21 [2018-01-24 12:31:45,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:31:45,940 INFO L432 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2018-01-24 12:31:45,940 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-24 12:31:45,940 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2018-01-24 12:31:45,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-24 12:31:45,941 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:31:45,941 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:31:45,941 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-24 12:31:45,941 INFO L82 PathProgramCache]: Analyzing trace with hash -102655212, now seen corresponding path program 1 times [2018-01-24 12:31:45,941 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:31:45,942 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:31:45,943 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:31:45,943 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:31:45,943 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:31:45,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:31:45,959 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:31:46,024 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-24 12:31:46,024 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:31:46,024 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:31:46,030 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:31:46,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:31:46,072 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:31:46,082 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-24 12:31:46,103 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 12:31:46,103 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-01-24 12:31:46,103 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 12:31:46,103 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 12:31:46,104 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 12:31:46,104 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. Second operand 6 states. [2018-01-24 12:31:46,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:31:46,130 INFO L93 Difference]: Finished difference Result 31 states and 32 transitions. [2018-01-24 12:31:46,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-24 12:31:46,130 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2018-01-24 12:31:46,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:31:46,131 INFO L225 Difference]: With dead ends: 31 [2018-01-24 12:31:46,131 INFO L226 Difference]: Without dead ends: 30 [2018-01-24 12:31:46,132 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 21 SyntacticMatches, 3 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:31:46,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-01-24 12:31:46,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-01-24 12:31:46,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-01-24 12:31:46,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2018-01-24 12:31:46,135 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 23 [2018-01-24 12:31:46,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:31:46,136 INFO L432 AbstractCegarLoop]: Abstraction has 30 states and 31 transitions. [2018-01-24 12:31:46,136 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 12:31:46,136 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2018-01-24 12:31:46,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-24 12:31:46,136 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:31:46,137 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:31:46,137 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-24 12:31:46,137 INFO L82 PathProgramCache]: Analyzing trace with hash -102655211, now seen corresponding path program 1 times [2018-01-24 12:31:46,137 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:31:46,137 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:31:46,138 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:31:46,138 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:31:46,138 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:31:46,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:31:46,152 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:31:46,281 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:31:46,282 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:31:46,282 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:31:46,291 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:31:46,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:31:46,321 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:31:46,353 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:31:46,355 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:31:46,368 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:31:46,369 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-24 12:31:46,408 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:31:46,441 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 12:31:46,441 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-01-24 12:31:46,442 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-24 12:31:46,442 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-24 12:31:46,442 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-01-24 12:31:46,443 INFO L87 Difference]: Start difference. First operand 30 states and 31 transitions. Second operand 10 states. [2018-01-24 12:31:46,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:31:46,603 INFO L93 Difference]: Finished difference Result 32 states and 33 transitions. [2018-01-24 12:31:46,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-24 12:31:46,603 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 23 [2018-01-24 12:31:46,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:31:46,604 INFO L225 Difference]: With dead ends: 32 [2018-01-24 12:31:46,605 INFO L226 Difference]: Without dead ends: 31 [2018-01-24 12:31:46,605 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 22 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2018-01-24 12:31:46,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-01-24 12:31:46,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-01-24 12:31:46,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-01-24 12:31:46,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2018-01-24 12:31:46,612 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 23 [2018-01-24 12:31:46,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:31:46,612 INFO L432 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2018-01-24 12:31:46,612 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-24 12:31:46,613 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2018-01-24 12:31:46,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-24 12:31:46,614 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:31:46,614 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:31:46,614 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-24 12:31:46,614 INFO L82 PathProgramCache]: Analyzing trace with hash -1670341786, now seen corresponding path program 1 times [2018-01-24 12:31:46,614 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:31:46,614 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:31:46,616 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:31:46,616 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:31:46,616 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:31:46,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:31:46,645 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:31:46,694 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-24 12:31:46,694 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:31:46,694 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 12:31:46,695 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 12:31:46,695 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 12:31:46,695 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 12:31:46,695 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. Second operand 6 states. [2018-01-24 12:31:46,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:31:46,725 INFO L93 Difference]: Finished difference Result 31 states and 32 transitions. [2018-01-24 12:31:46,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-24 12:31:46,725 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2018-01-24 12:31:46,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:31:46,726 INFO L225 Difference]: With dead ends: 31 [2018-01-24 12:31:46,727 INFO L226 Difference]: Without dead ends: 30 [2018-01-24 12:31:46,727 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:31:46,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-01-24 12:31:46,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-01-24 12:31:46,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-01-24 12:31:46,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2018-01-24 12:31:46,732 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 24 [2018-01-24 12:31:46,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:31:46,732 INFO L432 AbstractCegarLoop]: Abstraction has 30 states and 31 transitions. [2018-01-24 12:31:46,732 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 12:31:46,732 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2018-01-24 12:31:46,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-24 12:31:46,733 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:31:46,733 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:31:46,734 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-24 12:31:46,734 INFO L82 PathProgramCache]: Analyzing trace with hash -1670341785, now seen corresponding path program 1 times [2018-01-24 12:31:46,734 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:31:46,734 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:31:46,735 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:31:46,736 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:31:46,736 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:31:46,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:31:46,747 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:31:46,801 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-24 12:31:46,802 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:31:46,802 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 12:31:46,802 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 12:31:46,802 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 12:31:46,803 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 12:31:46,803 INFO L87 Difference]: Start difference. First operand 30 states and 31 transitions. Second operand 6 states. [2018-01-24 12:31:46,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:31:46,862 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2018-01-24 12:31:46,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 12:31:46,863 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2018-01-24 12:31:46,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:31:46,864 INFO L225 Difference]: With dead ends: 30 [2018-01-24 12:31:46,864 INFO L226 Difference]: Without dead ends: 29 [2018-01-24 12:31:46,864 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:31:46,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-01-24 12:31:46,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-01-24 12:31:46,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-01-24 12:31:46,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2018-01-24 12:31:46,867 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 24 [2018-01-24 12:31:46,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:31:46,867 INFO L432 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2018-01-24 12:31:46,867 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 12:31:46,867 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2018-01-24 12:31:46,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-24 12:31:46,868 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:31:46,868 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:31:46,868 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-24 12:31:46,868 INFO L82 PathProgramCache]: Analyzing trace with hash -240987817, now seen corresponding path program 1 times [2018-01-24 12:31:46,868 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:31:46,868 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:31:46,869 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:31:46,869 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:31:46,869 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:31:46,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:31:46,887 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:31:47,174 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:31:47,175 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:31:47,175 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:31:47,186 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:31:47,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:31:47,212 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:31:47,224 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:31:47,224 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:31:47,234 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:31:47,234 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-24 12:31:47,300 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:31:47,300 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:31:47,303 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-01-24 12:31:47,304 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:31:47,310 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:31:47,310 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:19 [2018-01-24 12:31:47,376 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:31:47,377 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 15 [2018-01-24 12:31:47,377 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:31:47,382 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:31:47,382 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:15 [2018-01-24 12:31:47,407 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:31:47,428 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-24 12:31:47,428 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [10] total 15 [2018-01-24 12:31:47,428 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-01-24 12:31:47,428 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-01-24 12:31:47,429 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2018-01-24 12:31:47,429 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand 16 states. [2018-01-24 12:31:47,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:31:47,638 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2018-01-24 12:31:47,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-24 12:31:47,638 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 25 [2018-01-24 12:31:47,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:31:47,639 INFO L225 Difference]: With dead ends: 29 [2018-01-24 12:31:47,639 INFO L226 Difference]: Without dead ends: 28 [2018-01-24 12:31:47,640 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 19 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=53, Invalid=253, Unknown=0, NotChecked=0, Total=306 [2018-01-24 12:31:47,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-01-24 12:31:47,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 25. [2018-01-24 12:31:47,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-01-24 12:31:47,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2018-01-24 12:31:47,644 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 25 [2018-01-24 12:31:47,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:31:47,645 INFO L432 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2018-01-24 12:31:47,645 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-01-24 12:31:47,645 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2018-01-24 12:31:47,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-24 12:31:47,646 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:31:47,646 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, 1, 1, 1] [2018-01-24 12:31:47,646 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-24 12:31:47,646 INFO L82 PathProgramCache]: Analyzing trace with hash -184703786, now seen corresponding path program 1 times [2018-01-24 12:31:47,646 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:31:47,646 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:31:47,647 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:31:47,648 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:31:47,648 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:31:47,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:31:47,659 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:31:47,888 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-24 12:31:47,888 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:31:47,888 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:31:47,901 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:31:47,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:31:47,923 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:31:48,312 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-24 12:31:48,334 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 12:31:48,334 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11] total 17 [2018-01-24 12:31:48,334 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-01-24 12:31:48,334 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-01-24 12:31:48,335 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=251, Unknown=13, NotChecked=0, Total=306 [2018-01-24 12:31:48,335 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand 18 states. [2018-01-24 12:31:48,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:31:48,650 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2018-01-24 12:31:48,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-24 12:31:48,650 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 26 [2018-01-24 12:31:48,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:31:48,651 INFO L225 Difference]: With dead ends: 32 [2018-01-24 12:31:48,651 INFO L226 Difference]: Without dead ends: 23 [2018-01-24 12:31:48,651 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 22 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=84, Invalid=503, Unknown=13, NotChecked=0, Total=600 [2018-01-24 12:31:48,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-01-24 12:31:48,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-01-24 12:31:48,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-01-24 12:31:48,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2018-01-24 12:31:48,654 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 26 [2018-01-24 12:31:48,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:31:48,655 INFO L432 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2018-01-24 12:31:48,655 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-01-24 12:31:48,655 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2018-01-24 12:31:48,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-24 12:31:48,655 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:31:48,655 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:31:48,656 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-24 12:31:48,656 INFO L82 PathProgramCache]: Analyzing trace with hash 1917235028, now seen corresponding path program 1 times [2018-01-24 12:31:48,656 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:31:48,656 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:31:48,657 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:31:48,657 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:31:48,657 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:31:48,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:31:48,671 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:31:49,086 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-01-24 12:31:49,087 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:31:49,087 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-24 12:31:49,087 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-24 12:31:49,087 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-24 12:31:49,087 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-01-24 12:31:49,088 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 10 states. [2018-01-24 12:31:49,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:31:49,242 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2018-01-24 12:31:49,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-24 12:31:49,242 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 28 [2018-01-24 12:31:49,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:31:49,242 INFO L225 Difference]: With dead ends: 23 [2018-01-24 12:31:49,243 INFO L226 Difference]: Without dead ends: 0 [2018-01-24 12:31:49,243 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 6 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2018-01-24 12:31:49,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-24 12:31:49,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-24 12:31:49,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-24 12:31:49,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-24 12:31:49,243 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 28 [2018-01-24 12:31:49,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:31:49,244 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-24 12:31:49,244 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-24 12:31:49,244 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-24 12:31:49,244 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-24 12:31:49,248 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-01-24 12:31:49,281 INFO L397 ceAbstractionStarter]: At program point ldv_mallocENTRY(lines 1072 1078) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-24 12:31:49,282 INFO L401 ceAbstractionStarter]: For program point L1073(lines 1073 1077) no Hoare annotation was computed. [2018-01-24 12:31:49,282 INFO L401 ceAbstractionStarter]: For program point L1074'(line 1074) no Hoare annotation was computed. [2018-01-24 12:31:49,282 INFO L401 ceAbstractionStarter]: For program point ldv_mallocEXIT(lines 1072 1078) no Hoare annotation was computed. [2018-01-24 12:31:49,282 INFO L401 ceAbstractionStarter]: For program point ldv_mallocFINAL(lines 1072 1078) no Hoare annotation was computed. [2018-01-24 12:31:49,282 INFO L401 ceAbstractionStarter]: For program point L1074(line 1074) no Hoare annotation was computed. [2018-01-24 12:31:49,282 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(lines 1 1444) no Hoare annotation was computed. [2018-01-24 12:31:49,282 INFO L397 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(lines 1 1444) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-24 12:31:49,282 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(lines 1 1444) no Hoare annotation was computed. [2018-01-24 12:31:49,282 INFO L404 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(lines 1 1444) the Hoare annotation is: true [2018-01-24 12:31:49,282 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 1444) no Hoare annotation was computed. [2018-01-24 12:31:49,282 INFO L404 ceAbstractionStarter]: At program point L1(lines 1 1444) the Hoare annotation is: true [2018-01-24 12:31:49,282 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 1444) no Hoare annotation was computed. [2018-01-24 12:31:49,283 INFO L397 ceAbstractionStarter]: At program point mainENTRY(lines 1442 1444) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-24 12:31:49,283 INFO L401 ceAbstractionStarter]: For program point mainFINAL(lines 1442 1444) no Hoare annotation was computed. [2018-01-24 12:31:49,283 INFO L401 ceAbstractionStarter]: For program point mainEXIT(lines 1442 1444) no Hoare annotation was computed. [2018-01-24 12:31:49,283 INFO L401 ceAbstractionStarter]: For program point mainErr0EnsuresViolation(lines 1442 1444) no Hoare annotation was computed. [2018-01-24 12:31:49,283 INFO L401 ceAbstractionStarter]: For program point entry_pointErr1RequiresViolation(lines 1 1444) no Hoare annotation was computed. [2018-01-24 12:31:49,283 INFO L401 ceAbstractionStarter]: For program point entry_pointErr2RequiresViolation(lines 1 1444) no Hoare annotation was computed. [2018-01-24 12:31:49,283 INFO L401 ceAbstractionStarter]: For program point entry_pointEXIT(lines 1433 1440) no Hoare annotation was computed. [2018-01-24 12:31:49,283 INFO L401 ceAbstractionStarter]: For program point L1435'(lines 1435 1439) no Hoare annotation was computed. [2018-01-24 12:31:49,283 INFO L401 ceAbstractionStarter]: For program point L1436'(line 1436) no Hoare annotation was computed. [2018-01-24 12:31:49,283 INFO L401 ceAbstractionStarter]: For program point L1437'(line 1437) no Hoare annotation was computed. [2018-01-24 12:31:49,283 INFO L397 ceAbstractionStarter]: At program point entry_pointENTRY(lines 1433 1440) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-24 12:31:49,283 INFO L397 ceAbstractionStarter]: At program point L1436(line 1436) the Hoare annotation is: (and (not (= 0 entry_point_~p~7.base)) (= (store |old(#valid)| entry_point_~p~7.base 1) |#valid|) (= 0 (select |old(#valid)| entry_point_~p~7.base)) (= entry_point_~p~7.offset 0)) [2018-01-24 12:31:49,284 INFO L401 ceAbstractionStarter]: For program point entry_pointErr0RequiresViolation(lines 1 1444) no Hoare annotation was computed. [2018-01-24 12:31:49,284 INFO L401 ceAbstractionStarter]: For program point entry_pointErr3RequiresViolation(lines 1 1444) no Hoare annotation was computed. [2018-01-24 12:31:49,284 INFO L401 ceAbstractionStarter]: For program point L1437(line 1437) no Hoare annotation was computed. [2018-01-24 12:31:49,284 INFO L401 ceAbstractionStarter]: For program point L1434(line 1434) no Hoare annotation was computed. [2018-01-24 12:31:49,284 INFO L401 ceAbstractionStarter]: For program point L1435(lines 1435 1439) no Hoare annotation was computed. [2018-01-24 12:31:49,287 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.01 12:31:49 BoogieIcfgContainer [2018-01-24 12:31:49,287 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-24 12:31:49,288 INFO L168 Benchmark]: Toolchain (without parser) took 4943.64 ms. Allocated memory was 305.1 MB in the beginning and 523.2 MB in the end (delta: 218.1 MB). Free memory was 264.2 MB in the beginning and 467.0 MB in the end (delta: -202.8 MB). Peak memory consumption was 15.3 MB. Max. memory is 5.3 GB. [2018-01-24 12:31:49,290 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 305.1 MB. Free memory is still 271.2 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-24 12:31:49,290 INFO L168 Benchmark]: CACSL2BoogieTranslator took 202.25 ms. Allocated memory is still 305.1 MB. Free memory was 264.2 MB in the beginning and 252.0 MB in the end (delta: 12.2 MB). Peak memory consumption was 12.2 MB. Max. memory is 5.3 GB. [2018-01-24 12:31:49,290 INFO L168 Benchmark]: Boogie Preprocessor took 31.40 ms. Allocated memory is still 305.1 MB. Free memory was 252.0 MB in the beginning and 250.0 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:31:49,291 INFO L168 Benchmark]: RCFGBuilder took 223.75 ms. Allocated memory is still 305.1 MB. Free memory was 250.0 MB in the beginning and 236.5 MB in the end (delta: 13.6 MB). Peak memory consumption was 13.6 MB. Max. memory is 5.3 GB. [2018-01-24 12:31:49,291 INFO L168 Benchmark]: TraceAbstraction took 4478.69 ms. Allocated memory was 305.1 MB in the beginning and 523.2 MB in the end (delta: 218.1 MB). Free memory was 236.5 MB in the beginning and 467.0 MB in the end (delta: -230.5 MB). There was no memory consumed. Max. memory is 5.3 GB. [2018-01-24 12:31:49,293 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.14 ms. Allocated memory is still 305.1 MB. Free memory is still 271.2 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 202.25 ms. Allocated memory is still 305.1 MB. Free memory was 264.2 MB in the beginning and 252.0 MB in the end (delta: 12.2 MB). Peak memory consumption was 12.2 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 31.40 ms. Allocated memory is still 305.1 MB. Free memory was 252.0 MB in the beginning and 250.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 223.75 ms. Allocated memory is still 305.1 MB. Free memory was 250.0 MB in the beginning and 236.5 MB in the end (delta: 13.6 MB). Peak memory consumption was 13.6 MB. Max. memory is 5.3 GB. * TraceAbstraction took 4478.69 ms. Allocated memory was 305.1 MB in the beginning and 523.2 MB in the end (delta: 218.1 MB). Free memory was 236.5 MB in the beginning and 467.0 MB in the end (delta: -230.5 MB). There was no memory consumed. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1442]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 1]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 1]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 1]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 1]: free always succeeds For all program executions holds that free always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 5 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 30 locations, 5 error locations. SAFE Result, 4.4s OverallTime, 12 OverallIterations, 2 TraceHistogramMax, 1.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 277 SDtfs, 71 SDslu, 863 SDs, 0 SdLazy, 709 SolverSat, 41 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 224 GetRequests, 120 SyntacticMatches, 12 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 1.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=31occurred in iteration=1, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 12 MinimizatonAttempts, 27 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 9 PreInvPairs, 10 NumberOfFragments, 33 HoareAnnotationTreeSize, 9 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 18 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 386 NumberOfCodeBlocks, 386 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 369 ConstructedInterpolants, 4 QuantifiedInterpolants, 40589 SizeOfPredicates, 10 NumberOfNonLiveVariables, 474 ConjunctsInSsa, 82 ConjunctsInUnsatCore, 17 InterpolantComputations, 8 PerfectInterpolantSequences, 51/70 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test4_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-24_12-31-49-302.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test4_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-24_12-31-49-302.csv Received shutdown request...