java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test17_2_false-valid-free.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-ccafca9-m [2018-02-04 00:27:43,628 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-04 00:27:43,629 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-04 00:27:43,640 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-04 00:27:43,640 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-04 00:27:43,640 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-04 00:27:43,641 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-04 00:27:43,642 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-04 00:27:43,644 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-04 00:27:43,644 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-04 00:27:43,645 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-04 00:27:43,645 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-04 00:27:43,646 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-04 00:27:43,647 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-04 00:27:43,648 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-04 00:27:43,649 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-04 00:27:43,651 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-04 00:27:43,652 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-04 00:27:43,653 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-04 00:27:43,654 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-04 00:27:43,656 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-04 00:27:43,656 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-04 00:27:43,656 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-04 00:27:43,657 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-04 00:27:43,657 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-04 00:27:43,658 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-04 00:27:43,658 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-04 00:27:43,659 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-04 00:27:43,659 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-04 00:27:43,659 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-04 00:27:43,660 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-04 00:27:43,660 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf [2018-02-04 00:27:43,670 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-04 00:27:43,670 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-04 00:27:43,671 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-04 00:27:43,671 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-04 00:27:43,671 INFO L133 SettingsManager]: * Use SBE=true [2018-02-04 00:27:43,672 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-04 00:27:43,672 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-04 00:27:43,672 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-04 00:27:43,672 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-04 00:27:43,672 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-04 00:27:43,672 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-04 00:27:43,673 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-04 00:27:43,673 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-04 00:27:43,673 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-04 00:27:43,673 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-04 00:27:43,673 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-04 00:27:43,673 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-04 00:27:43,673 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-04 00:27:43,674 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-04 00:27:43,674 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-04 00:27:43,674 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 00:27:43,674 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-04 00:27:43,674 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-04 00:27:43,674 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-04 00:27:43,675 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-02-04 00:27:43,700 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-04 00:27:43,707 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-04 00:27:43,709 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-04 00:27:43,710 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-04 00:27:43,710 INFO L276 PluginConnector]: CDTParser initialized [2018-02-04 00:27:43,710 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test17_2_false-valid-free.i [2018-02-04 00:27:43,870 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-04 00:27:43,872 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-04 00:27:43,873 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-04 00:27:43,873 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-04 00:27:43,878 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-04 00:27:43,879 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 12:27:43" (1/1) ... [2018-02-04 00:27:43,881 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ab8a954 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:27:43, skipping insertion in model container [2018-02-04 00:27:43,882 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 12:27:43" (1/1) ... [2018-02-04 00:27:43,893 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 00:27:43,926 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 00:27:44,007 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 00:27:44,020 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 00:27:44,025 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:27:44 WrapperNode [2018-02-04 00:27:44,025 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-04 00:27:44,026 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-04 00:27:44,026 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-04 00:27:44,026 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-04 00:27:44,038 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:27:44" (1/1) ... [2018-02-04 00:27:44,039 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:27:44" (1/1) ... [2018-02-04 00:27:44,046 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:27:44" (1/1) ... [2018-02-04 00:27:44,046 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:27:44" (1/1) ... [2018-02-04 00:27:44,049 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:27:44" (1/1) ... [2018-02-04 00:27:44,051 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:27:44" (1/1) ... [2018-02-04 00:27:44,052 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:27:44" (1/1) ... [2018-02-04 00:27:44,053 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-04 00:27:44,053 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-04 00:27:44,053 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-04 00:27:44,053 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-04 00:27:44,054 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:27:44" (1/1) ... No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 00:27:44,085 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-04 00:27:44,086 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-04 00:27:44,086 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-02-04 00:27:44,086 INFO L136 BoogieDeclarations]: Found implementation of procedure alloc_unsafe_17 [2018-02-04 00:27:44,086 INFO L136 BoogieDeclarations]: Found implementation of procedure free_17 [2018-02-04 00:27:44,086 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-02-04 00:27:44,086 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-04 00:27:44,086 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-04 00:27:44,087 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-04 00:27:44,087 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-04 00:27:44,087 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-04 00:27:44,087 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-04 00:27:44,087 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-04 00:27:44,087 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-04 00:27:44,087 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-04 00:27:44,087 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-02-04 00:27:44,088 INFO L128 BoogieDeclarations]: Found specification of procedure alloc_unsafe_17 [2018-02-04 00:27:44,088 INFO L128 BoogieDeclarations]: Found specification of procedure free_17 [2018-02-04 00:27:44,088 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-02-04 00:27:44,088 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-04 00:27:44,088 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-04 00:27:44,088 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-04 00:27:44,261 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-04 00:27:44,262 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 12:27:44 BoogieIcfgContainer [2018-02-04 00:27:44,262 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-04 00:27:44,263 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-04 00:27:44,263 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-04 00:27:44,265 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-04 00:27:44,265 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 12:27:43" (1/3) ... [2018-02-04 00:27:44,266 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a201ce7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 12:27:44, skipping insertion in model container [2018-02-04 00:27:44,266 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:27:44" (2/3) ... [2018-02-04 00:27:44,267 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a201ce7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 12:27:44, skipping insertion in model container [2018-02-04 00:27:44,267 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 12:27:44" (3/3) ... [2018-02-04 00:27:44,268 INFO L107 eAbstractionObserver]: Analyzing ICFG memleaks_test17_2_false-valid-free.i [2018-02-04 00:27:44,273 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-04 00:27:44,278 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 15 error locations. [2018-02-04 00:27:44,301 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-04 00:27:44,301 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-04 00:27:44,301 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-04 00:27:44,301 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-04 00:27:44,301 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-04 00:27:44,302 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-04 00:27:44,302 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-04 00:27:44,302 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-04 00:27:44,303 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-04 00:27:44,313 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states. [2018-02-04 00:27:44,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-04 00:27:44,321 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:27:44,321 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:27:44,322 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-02-04 00:27:44,324 INFO L82 PathProgramCache]: Analyzing trace with hash 1429677520, now seen corresponding path program 1 times [2018-02-04 00:27:44,325 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:27:44,326 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:27:44,359 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:27:44,359 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:27:44,360 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:27:44,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:27:44,399 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:27:44,462 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 00:27:44,465 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 00:27:44,465 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 00:27:44,466 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 00:27:44,536 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 00:27:44,537 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 00:27:44,539 INFO L87 Difference]: Start difference. First operand 72 states. Second operand 3 states. [2018-02-04 00:27:44,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:27:44,681 INFO L93 Difference]: Finished difference Result 122 states and 142 transitions. [2018-02-04 00:27:44,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 00:27:44,683 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-02-04 00:27:44,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:27:44,690 INFO L225 Difference]: With dead ends: 122 [2018-02-04 00:27:44,691 INFO L226 Difference]: Without dead ends: 116 [2018-02-04 00:27:44,692 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 00:27:44,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-02-04 00:27:44,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 73. [2018-02-04 00:27:44,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-02-04 00:27:44,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 81 transitions. [2018-02-04 00:27:44,733 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 81 transitions. Word has length 17 [2018-02-04 00:27:44,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:27:44,733 INFO L432 AbstractCegarLoop]: Abstraction has 73 states and 81 transitions. [2018-02-04 00:27:44,733 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 00:27:44,734 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 81 transitions. [2018-02-04 00:27:44,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-04 00:27:44,735 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:27:44,735 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:27:44,735 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-02-04 00:27:44,735 INFO L82 PathProgramCache]: Analyzing trace with hash 1429687667, now seen corresponding path program 1 times [2018-02-04 00:27:44,735 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:27:44,736 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:27:44,737 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:27:44,737 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:27:44,737 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:27:44,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:27:44,752 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:27:44,808 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 00:27:44,809 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 00:27:44,809 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 00:27:44,810 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 00:27:44,811 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 00:27:44,811 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 00:27:44,811 INFO L87 Difference]: Start difference. First operand 73 states and 81 transitions. Second operand 5 states. [2018-02-04 00:27:44,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:27:44,836 INFO L93 Difference]: Finished difference Result 75 states and 82 transitions. [2018-02-04 00:27:44,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 00:27:44,836 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-02-04 00:27:44,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:27:44,837 INFO L225 Difference]: With dead ends: 75 [2018-02-04 00:27:44,837 INFO L226 Difference]: Without dead ends: 73 [2018-02-04 00:27:44,838 INFO L554 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-02-04 00:27:44,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-02-04 00:27:44,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 71. [2018-02-04 00:27:44,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-02-04 00:27:44,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 78 transitions. [2018-02-04 00:27:44,844 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 78 transitions. Word has length 17 [2018-02-04 00:27:44,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:27:44,844 INFO L432 AbstractCegarLoop]: Abstraction has 71 states and 78 transitions. [2018-02-04 00:27:44,844 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 00:27:44,844 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 78 transitions. [2018-02-04 00:27:44,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-04 00:27:44,845 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:27:44,845 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:27:44,845 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-02-04 00:27:44,845 INFO L82 PathProgramCache]: Analyzing trace with hash 1294678610, now seen corresponding path program 1 times [2018-02-04 00:27:44,846 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:27:44,846 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:27:44,847 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:27:44,847 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:27:44,847 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:27:44,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:27:44,860 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:27:44,897 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 00:27:44,897 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 00:27:44,898 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 00:27:44,898 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 00:27:44,898 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 00:27:44,898 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 00:27:44,898 INFO L87 Difference]: Start difference. First operand 71 states and 78 transitions. Second operand 6 states. [2018-02-04 00:27:44,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:27:44,949 INFO L93 Difference]: Finished difference Result 71 states and 77 transitions. [2018-02-04 00:27:44,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 00:27:44,950 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-02-04 00:27:44,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:27:44,950 INFO L225 Difference]: With dead ends: 71 [2018-02-04 00:27:44,951 INFO L226 Difference]: Without dead ends: 71 [2018-02-04 00:27:44,951 INFO L554 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-02-04 00:27:44,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-02-04 00:27:44,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2018-02-04 00:27:44,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-02-04 00:27:44,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 77 transitions. [2018-02-04 00:27:44,956 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 77 transitions. Word has length 19 [2018-02-04 00:27:44,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:27:44,956 INFO L432 AbstractCegarLoop]: Abstraction has 71 states and 77 transitions. [2018-02-04 00:27:44,957 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 00:27:44,957 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 77 transitions. [2018-02-04 00:27:44,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-04 00:27:44,957 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:27:44,957 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:27:44,957 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-02-04 00:27:44,957 INFO L82 PathProgramCache]: Analyzing trace with hash 1294688757, now seen corresponding path program 1 times [2018-02-04 00:27:44,958 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:27:44,958 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:27:44,959 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:27:44,959 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:27:44,959 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:27:44,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:27:44,970 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:27:45,006 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 00:27:45,006 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 00:27:45,006 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 00:27:45,006 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 00:27:45,007 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 00:27:45,007 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 00:27:45,007 INFO L87 Difference]: Start difference. First operand 71 states and 77 transitions. Second operand 6 states. [2018-02-04 00:27:45,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:27:45,073 INFO L93 Difference]: Finished difference Result 70 states and 76 transitions. [2018-02-04 00:27:45,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 00:27:45,074 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-02-04 00:27:45,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:27:45,074 INFO L225 Difference]: With dead ends: 70 [2018-02-04 00:27:45,075 INFO L226 Difference]: Without dead ends: 70 [2018-02-04 00:27:45,075 INFO L554 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-02-04 00:27:45,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-02-04 00:27:45,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2018-02-04 00:27:45,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-02-04 00:27:45,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 76 transitions. [2018-02-04 00:27:45,079 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 76 transitions. Word has length 19 [2018-02-04 00:27:45,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:27:45,079 INFO L432 AbstractCegarLoop]: Abstraction has 70 states and 76 transitions. [2018-02-04 00:27:45,079 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 00:27:45,079 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 76 transitions. [2018-02-04 00:27:45,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-04 00:27:45,080 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:27:45,080 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:27:45,080 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-02-04 00:27:45,080 INFO L82 PathProgramCache]: Analyzing trace with hash 1294688758, now seen corresponding path program 1 times [2018-02-04 00:27:45,080 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:27:45,080 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:27:45,081 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:27:45,081 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:27:45,081 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:27:45,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:27:45,096 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:27:45,280 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 00:27:45,280 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 00:27:45,281 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-04 00:27:45,281 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 00:27:45,281 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 00:27:45,281 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-02-04 00:27:45,281 INFO L87 Difference]: Start difference. First operand 70 states and 76 transitions. Second operand 9 states. [2018-02-04 00:27:45,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:27:45,449 INFO L93 Difference]: Finished difference Result 74 states and 80 transitions. [2018-02-04 00:27:45,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 00:27:45,451 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 19 [2018-02-04 00:27:45,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:27:45,451 INFO L225 Difference]: With dead ends: 74 [2018-02-04 00:27:45,451 INFO L226 Difference]: Without dead ends: 74 [2018-02-04 00:27:45,452 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2018-02-04 00:27:45,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-02-04 00:27:45,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 73. [2018-02-04 00:27:45,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-02-04 00:27:45,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 79 transitions. [2018-02-04 00:27:45,454 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 79 transitions. Word has length 19 [2018-02-04 00:27:45,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:27:45,454 INFO L432 AbstractCegarLoop]: Abstraction has 73 states and 79 transitions. [2018-02-04 00:27:45,455 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 00:27:45,455 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 79 transitions. [2018-02-04 00:27:45,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-04 00:27:45,455 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:27:45,455 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:27:45,455 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-02-04 00:27:45,455 INFO L82 PathProgramCache]: Analyzing trace with hash 607378637, now seen corresponding path program 1 times [2018-02-04 00:27:45,455 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:27:45,455 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:27:45,456 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:27:45,456 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:27:45,456 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:27:45,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:27:45,468 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:27:45,626 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 00:27:45,626 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 00:27:45,626 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-04 00:27:45,635 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:27:45,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:27:45,672 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:27:45,737 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-02-04 00:27:45,741 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 00:27:45,756 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-02-04 00:27:45,756 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:27:45,769 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 00:27:45,769 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:36 [2018-02-04 00:27:45,903 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 00:27:45,920 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 00:27:45,920 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 18 [2018-02-04 00:27:45,921 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-04 00:27:45,921 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-04 00:27:45,921 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=297, Unknown=0, NotChecked=0, Total=342 [2018-02-04 00:27:45,922 INFO L87 Difference]: Start difference. First operand 73 states and 79 transitions. Second operand 19 states. [2018-02-04 00:27:46,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:27:46,216 INFO L93 Difference]: Finished difference Result 79 states and 85 transitions. [2018-02-04 00:27:46,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-04 00:27:46,217 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 23 [2018-02-04 00:27:46,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:27:46,217 INFO L225 Difference]: With dead ends: 79 [2018-02-04 00:27:46,217 INFO L226 Difference]: Without dead ends: 79 [2018-02-04 00:27:46,217 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=114, Invalid=588, Unknown=0, NotChecked=0, Total=702 [2018-02-04 00:27:46,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-02-04 00:27:46,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2018-02-04 00:27:46,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-02-04 00:27:46,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 85 transitions. [2018-02-04 00:27:46,221 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 85 transitions. Word has length 23 [2018-02-04 00:27:46,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:27:46,221 INFO L432 AbstractCegarLoop]: Abstraction has 79 states and 85 transitions. [2018-02-04 00:27:46,222 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-04 00:27:46,222 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 85 transitions. [2018-02-04 00:27:46,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-02-04 00:27:46,222 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:27:46,222 INFO L351 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-02-04 00:27:46,222 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-02-04 00:27:46,223 INFO L82 PathProgramCache]: Analyzing trace with hash 376259064, now seen corresponding path program 1 times [2018-02-04 00:27:46,223 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:27:46,223 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:27:46,224 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:27:46,224 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:27:46,224 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:27:46,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:27:46,237 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:27:46,280 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-02-04 00:27:46,280 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 00:27:46,280 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-04 00:27:46,280 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 00:27:46,280 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 00:27:46,281 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-02-04 00:27:46,281 INFO L87 Difference]: Start difference. First operand 79 states and 85 transitions. Second operand 8 states. [2018-02-04 00:27:46,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:27:46,366 INFO L93 Difference]: Finished difference Result 103 states and 115 transitions. [2018-02-04 00:27:46,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 00:27:46,366 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 38 [2018-02-04 00:27:46,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:27:46,367 INFO L225 Difference]: With dead ends: 103 [2018-02-04 00:27:46,367 INFO L226 Difference]: Without dead ends: 103 [2018-02-04 00:27:46,368 INFO L554 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-02-04 00:27:46,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-02-04 00:27:46,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 83. [2018-02-04 00:27:46,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-02-04 00:27:46,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 91 transitions. [2018-02-04 00:27:46,373 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 91 transitions. Word has length 38 [2018-02-04 00:27:46,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:27:46,373 INFO L432 AbstractCegarLoop]: Abstraction has 83 states and 91 transitions. [2018-02-04 00:27:46,373 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 00:27:46,373 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 91 transitions. [2018-02-04 00:27:46,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-02-04 00:27:46,374 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:27:46,374 INFO L351 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-02-04 00:27:46,374 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-02-04 00:27:46,374 INFO L82 PathProgramCache]: Analyzing trace with hash 376259065, now seen corresponding path program 1 times [2018-02-04 00:27:46,375 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:27:46,375 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:27:46,376 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:27:46,376 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:27:46,376 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:27:46,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:27:46,386 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:27:46,437 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 00:27:46,437 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 00:27:46,437 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-04 00:27:46,446 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:27:46,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:27:46,471 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:27:46,513 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 00:27:46,539 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 00:27:46,539 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2018-02-04 00:27:46,539 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 00:27:46,540 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 00:27:46,540 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=61, Unknown=0, NotChecked=0, Total=110 [2018-02-04 00:27:46,540 INFO L87 Difference]: Start difference. First operand 83 states and 91 transitions. Second operand 11 states. [2018-02-04 00:27:46,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:27:46,586 INFO L93 Difference]: Finished difference Result 89 states and 97 transitions. [2018-02-04 00:27:46,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 00:27:46,586 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 38 [2018-02-04 00:27:46,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:27:46,587 INFO L225 Difference]: With dead ends: 89 [2018-02-04 00:27:46,587 INFO L226 Difference]: Without dead ends: 89 [2018-02-04 00:27:46,588 INFO L554 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-02-04 00:27:46,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-02-04 00:27:46,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 87. [2018-02-04 00:27:46,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-02-04 00:27:46,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 95 transitions. [2018-02-04 00:27:46,592 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 95 transitions. Word has length 38 [2018-02-04 00:27:46,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:27:46,592 INFO L432 AbstractCegarLoop]: Abstraction has 87 states and 95 transitions. [2018-02-04 00:27:46,592 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 00:27:46,592 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 95 transitions. [2018-02-04 00:27:46,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-02-04 00:27:46,593 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:27:46,593 INFO L351 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-02-04 00:27:46,595 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-02-04 00:27:46,595 INFO L82 PathProgramCache]: Analyzing trace with hash 997822914, now seen corresponding path program 2 times [2018-02-04 00:27:46,595 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:27:46,595 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:27:46,596 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:27:46,596 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:27:46,596 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:27:46,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:27:46,606 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:27:46,660 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 00:27:46,660 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 00:27:46,660 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-04 00:27:46,666 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 00:27:46,679 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-02-04 00:27:46,679 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 00:27:46,680 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:27:46,705 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-02-04 00:27:46,722 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-02-04 00:27:46,722 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 10 [2018-02-04 00:27:46,722 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-04 00:27:46,723 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-04 00:27:46,723 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2018-02-04 00:27:46,723 INFO L87 Difference]: Start difference. First operand 87 states and 95 transitions. Second operand 10 states. [2018-02-04 00:27:46,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:27:46,824 INFO L93 Difference]: Finished difference Result 116 states and 128 transitions. [2018-02-04 00:27:46,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 00:27:46,824 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 42 [2018-02-04 00:27:46,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:27:46,825 INFO L225 Difference]: With dead ends: 116 [2018-02-04 00:27:46,826 INFO L226 Difference]: Without dead ends: 116 [2018-02-04 00:27:46,826 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=64, Invalid=146, Unknown=0, NotChecked=0, Total=210 [2018-02-04 00:27:46,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-02-04 00:27:46,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 93. [2018-02-04 00:27:46,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-02-04 00:27:46,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 101 transitions. [2018-02-04 00:27:46,830 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 101 transitions. Word has length 42 [2018-02-04 00:27:46,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:27:46,830 INFO L432 AbstractCegarLoop]: Abstraction has 93 states and 101 transitions. [2018-02-04 00:27:46,830 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-04 00:27:46,830 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 101 transitions. [2018-02-04 00:27:46,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-02-04 00:27:46,831 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:27:46,831 INFO L351 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-02-04 00:27:46,832 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-02-04 00:27:46,832 INFO L82 PathProgramCache]: Analyzing trace with hash -362065032, now seen corresponding path program 1 times [2018-02-04 00:27:46,832 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:27:46,832 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:27:46,833 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:27:46,833 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 00:27:46,833 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:27:46,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:27:46,843 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:27:46,877 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2018-02-04 00:27:46,877 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 00:27:46,877 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 00:27:46,878 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 00:27:46,878 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 00:27:46,878 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 00:27:46,878 INFO L87 Difference]: Start difference. First operand 93 states and 101 transitions. Second operand 5 states. [2018-02-04 00:27:46,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:27:46,890 INFO L93 Difference]: Finished difference Result 108 states and 117 transitions. [2018-02-04 00:27:46,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 00:27:46,890 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 50 [2018-02-04 00:27:46,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:27:46,891 INFO L225 Difference]: With dead ends: 108 [2018-02-04 00:27:46,891 INFO L226 Difference]: Without dead ends: 108 [2018-02-04 00:27:46,892 INFO L554 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-02-04 00:27:46,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-02-04 00:27:46,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 95. [2018-02-04 00:27:46,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-02-04 00:27:46,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 103 transitions. [2018-02-04 00:27:46,895 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 103 transitions. Word has length 50 [2018-02-04 00:27:46,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:27:46,896 INFO L432 AbstractCegarLoop]: Abstraction has 95 states and 103 transitions. [2018-02-04 00:27:46,896 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 00:27:46,896 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 103 transitions. [2018-02-04 00:27:46,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-02-04 00:27:46,897 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:27:46,897 INFO L351 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-02-04 00:27:46,897 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-02-04 00:27:46,897 INFO L82 PathProgramCache]: Analyzing trace with hash -1169426246, now seen corresponding path program 1 times [2018-02-04 00:27:46,897 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:27:46,897 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:27:46,898 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:27:46,898 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:27:46,898 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:27:46,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:27:46,909 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:27:46,970 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-04 00:27:46,970 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 00:27:46,970 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-04 00:27:46,978 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:27:47,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:27:47,004 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:27:47,066 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 6 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 00:27:47,098 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 00:27:47,098 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2018-02-04 00:27:47,098 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-04 00:27:47,099 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-04 00:27:47,099 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=120, Unknown=0, NotChecked=0, Total=210 [2018-02-04 00:27:47,099 INFO L87 Difference]: Start difference. First operand 95 states and 103 transitions. Second operand 15 states. [2018-02-04 00:27:47,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:27:47,143 INFO L93 Difference]: Finished difference Result 101 states and 109 transitions. [2018-02-04 00:27:47,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 00:27:47,147 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 52 [2018-02-04 00:27:47,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:27:47,148 INFO L225 Difference]: With dead ends: 101 [2018-02-04 00:27:47,148 INFO L226 Difference]: Without dead ends: 101 [2018-02-04 00:27:47,148 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=90, Invalid=120, Unknown=0, NotChecked=0, Total=210 [2018-02-04 00:27:47,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-02-04 00:27:47,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 99. [2018-02-04 00:27:47,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-02-04 00:27:47,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 107 transitions. [2018-02-04 00:27:47,151 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 107 transitions. Word has length 52 [2018-02-04 00:27:47,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:27:47,152 INFO L432 AbstractCegarLoop]: Abstraction has 99 states and 107 transitions. [2018-02-04 00:27:47,152 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-04 00:27:47,152 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 107 transitions. [2018-02-04 00:27:47,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-02-04 00:27:47,153 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:27:47,153 INFO L351 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-02-04 00:27:47,153 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-02-04 00:27:47,153 INFO L82 PathProgramCache]: Analyzing trace with hash 1567126723, now seen corresponding path program 2 times [2018-02-04 00:27:47,153 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:27:47,153 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:27:47,154 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:27:47,154 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:27:47,154 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:27:47,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:27:47,165 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:27:47,233 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-04 00:27:47,234 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 00:27:47,234 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-04 00:27:47,244 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 00:27:47,271 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 00:27:47,271 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 00:27:47,274 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:27:47,351 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 6 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 00:27:47,384 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 00:27:47,384 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2018-02-04 00:27:47,384 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-04 00:27:47,385 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-04 00:27:47,385 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=157, Unknown=0, NotChecked=0, Total=272 [2018-02-04 00:27:47,385 INFO L87 Difference]: Start difference. First operand 99 states and 107 transitions. Second operand 17 states. [2018-02-04 00:27:47,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:27:47,455 INFO L93 Difference]: Finished difference Result 105 states and 113 transitions. [2018-02-04 00:27:47,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 00:27:47,456 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 56 [2018-02-04 00:27:47,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:27:47,457 INFO L225 Difference]: With dead ends: 105 [2018-02-04 00:27:47,457 INFO L226 Difference]: Without dead ends: 105 [2018-02-04 00:27:47,457 INFO L554 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-02-04 00:27:47,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-02-04 00:27:47,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 103. [2018-02-04 00:27:47,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-02-04 00:27:47,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 111 transitions. [2018-02-04 00:27:47,460 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 111 transitions. Word has length 56 [2018-02-04 00:27:47,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:27:47,460 INFO L432 AbstractCegarLoop]: Abstraction has 103 states and 111 transitions. [2018-02-04 00:27:47,460 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-04 00:27:47,460 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 111 transitions. [2018-02-04 00:27:47,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-02-04 00:27:47,461 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:27:47,461 INFO L351 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-02-04 00:27:47,461 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-02-04 00:27:47,461 INFO L82 PathProgramCache]: Analyzing trace with hash -429538228, now seen corresponding path program 3 times [2018-02-04 00:27:47,462 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:27:47,462 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:27:47,463 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:27:47,463 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 00:27:47,463 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:27:47,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:27:47,474 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:27:47,543 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-04 00:27:47,543 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 00:27:47,544 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-04 00:27:47,548 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 00:27:47,568 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-02-04 00:27:47,568 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 00:27:47,570 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:27:47,579 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-02-04 00:27:47,579 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 00:27:47,580 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:27:47,580 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-04 00:27:47,624 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#t~malloc1.base| Int)) (= |c_#valid| (store |c_old(#valid)| |ldv_malloc_#t~malloc1.base| 1))) is different from true [2018-02-04 00:27:47,629 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-02-04 00:27:47,630 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 00:27:47,633 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-02-04 00:27:47,633 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:11 [2018-02-04 00:27:47,647 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 98 trivial. 3 not checked. [2018-02-04 00:27:47,671 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 00:27:47,671 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 19 [2018-02-04 00:27:47,671 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-04 00:27:47,671 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-04 00:27:47,671 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=245, Unknown=1, NotChecked=32, Total=342 [2018-02-04 00:27:47,671 INFO L87 Difference]: Start difference. First operand 103 states and 111 transitions. Second operand 19 states. [2018-02-04 00:27:48,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:27:48,007 INFO L93 Difference]: Finished difference Result 146 states and 161 transitions. [2018-02-04 00:27:48,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-04 00:27:48,007 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 60 [2018-02-04 00:27:48,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:27:48,008 INFO L225 Difference]: With dead ends: 146 [2018-02-04 00:27:48,008 INFO L226 Difference]: Without dead ends: 146 [2018-02-04 00:27:48,009 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=203, Invalid=921, Unknown=2, NotChecked=64, Total=1190 [2018-02-04 00:27:48,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-02-04 00:27:48,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 115. [2018-02-04 00:27:48,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-02-04 00:27:48,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 127 transitions. [2018-02-04 00:27:48,014 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 127 transitions. Word has length 60 [2018-02-04 00:27:48,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:27:48,014 INFO L432 AbstractCegarLoop]: Abstraction has 115 states and 127 transitions. [2018-02-04 00:27:48,014 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-04 00:27:48,014 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 127 transitions. [2018-02-04 00:27:48,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-02-04 00:27:48,015 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:27:48,015 INFO L351 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-02-04 00:27:48,015 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-02-04 00:27:48,016 INFO L82 PathProgramCache]: Analyzing trace with hash 162408278, now seen corresponding path program 1 times [2018-02-04 00:27:48,016 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:27:48,016 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:27:48,017 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:27:48,017 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 00:27:48,017 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:27:48,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:27:48,028 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:27:48,108 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 0 proven. 128 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-04 00:27:48,108 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 00:27:48,109 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-04 00:27:48,114 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:27:48,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:27:48,135 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:27:48,196 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 6 proven. 128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 00:27:48,214 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 00:27:48,214 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 21 [2018-02-04 00:27:48,214 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-04 00:27:48,215 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-04 00:27:48,215 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=246, Unknown=0, NotChecked=0, Total=420 [2018-02-04 00:27:48,215 INFO L87 Difference]: Start difference. First operand 115 states and 127 transitions. Second operand 21 states. [2018-02-04 00:27:48,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:27:48,248 INFO L93 Difference]: Finished difference Result 121 states and 133 transitions. [2018-02-04 00:27:48,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-04 00:27:48,248 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 64 [2018-02-04 00:27:48,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:27:48,249 INFO L225 Difference]: With dead ends: 121 [2018-02-04 00:27:48,249 INFO L226 Difference]: Without dead ends: 121 [2018-02-04 00:27:48,249 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=174, Invalid=246, Unknown=0, NotChecked=0, Total=420 [2018-02-04 00:27:48,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-02-04 00:27:48,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 119. [2018-02-04 00:27:48,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-02-04 00:27:48,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 131 transitions. [2018-02-04 00:27:48,252 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 131 transitions. Word has length 64 [2018-02-04 00:27:48,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:27:48,252 INFO L432 AbstractCegarLoop]: Abstraction has 119 states and 131 transitions. [2018-02-04 00:27:48,252 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-04 00:27:48,253 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 131 transitions. [2018-02-04 00:27:48,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-02-04 00:27:48,253 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:27:48,253 INFO L351 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-02-04 00:27:48,253 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-02-04 00:27:48,253 INFO L82 PathProgramCache]: Analyzing trace with hash -1131684385, now seen corresponding path program 2 times [2018-02-04 00:27:48,253 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:27:48,253 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:27:48,254 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:27:48,254 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:27:48,254 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:27:48,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:27:48,264 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:27:48,376 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 0 proven. 162 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-04 00:27:48,376 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 00:27:48,376 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-04 00:27:48,385 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 00:27:48,415 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 00:27:48,415 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 00:27:48,418 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:27:48,537 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 6 proven. 162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 00:27:48,566 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 00:27:48,566 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 23 [2018-02-04 00:27:48,566 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-04 00:27:48,567 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-04 00:27:48,567 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=208, Invalid=298, Unknown=0, NotChecked=0, Total=506 [2018-02-04 00:27:48,567 INFO L87 Difference]: Start difference. First operand 119 states and 131 transitions. Second operand 23 states. [2018-02-04 00:27:48,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:27:48,641 INFO L93 Difference]: Finished difference Result 125 states and 137 transitions. [2018-02-04 00:27:48,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-04 00:27:48,641 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 68 [2018-02-04 00:27:48,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:27:48,642 INFO L225 Difference]: With dead ends: 125 [2018-02-04 00:27:48,642 INFO L226 Difference]: Without dead ends: 125 [2018-02-04 00:27:48,642 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=223, Invalid=329, Unknown=0, NotChecked=0, Total=552 [2018-02-04 00:27:48,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-02-04 00:27:48,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 123. [2018-02-04 00:27:48,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-02-04 00:27:48,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 135 transitions. [2018-02-04 00:27:48,646 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 135 transitions. Word has length 68 [2018-02-04 00:27:48,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:27:48,646 INFO L432 AbstractCegarLoop]: Abstraction has 123 states and 135 transitions. [2018-02-04 00:27:48,646 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-04 00:27:48,646 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 135 transitions. [2018-02-04 00:27:48,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-02-04 00:27:48,647 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:27:48,647 INFO L351 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-02-04 00:27:48,647 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-02-04 00:27:48,647 INFO L82 PathProgramCache]: Analyzing trace with hash -987158552, now seen corresponding path program 3 times [2018-02-04 00:27:48,647 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:27:48,647 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:27:48,648 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:27:48,648 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 00:27:48,648 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:27:48,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:27:48,661 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:27:48,865 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 3 proven. 67 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2018-02-04 00:27:48,866 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 00:27:48,866 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-04 00:27:48,871 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 00:27:48,883 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-02-04 00:27:48,883 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 00:27:48,885 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:27:48,904 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-02-04 00:27:48,904 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 00:27:48,914 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-02-04 00:27:48,915 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:27:48,925 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-02-04 00:27:48,925 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 00:27:48,926 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-02-04 00:27:48,927 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 00:27:48,951 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 00:27:48,951 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:50, output treesize:46 [2018-02-04 00:27:49,133 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:27:49,137 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-02-04 00:27:49,138 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 00:27:49,167 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:27:49,168 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:27:49,169 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-02-04 00:27:49,170 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:27:49,191 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:27:49,191 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:27:49,192 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-02-04 00:27:49,193 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 00:27:49,213 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:27:49,214 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:27:49,215 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-02-04 00:27:49,215 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 00:27:49,231 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-02-04 00:27:49,231 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:73, output treesize:55 [2018-02-04 00:27:49,301 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2018-02-04 00:27:49,318 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 00:27:49,319 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 12] total 26 [2018-02-04 00:27:49,319 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-02-04 00:27:49,319 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-02-04 00:27:49,319 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=633, Unknown=1, NotChecked=0, Total=702 [2018-02-04 00:27:49,320 INFO L87 Difference]: Start difference. First operand 123 states and 135 transitions. Second operand 27 states. [2018-02-04 00:28:12,171 WARN L143 SmtUtils]: Spent 14228ms on a formula simplification that was a NOOP. DAG size: 52 [2018-02-04 00:28:38,759 WARN L146 SmtUtils]: Spent 26535ms on a formula simplification. DAG size of input: 56 DAG size of output 56 [2018-02-04 00:28:38,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:28:38,997 INFO L93 Difference]: Finished difference Result 215 states and 242 transitions. [2018-02-04 00:28:38,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-04 00:28:38,997 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 72 [2018-02-04 00:28:38,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:28:38,998 INFO L225 Difference]: With dead ends: 215 [2018-02-04 00:28:38,998 INFO L226 Difference]: Without dead ends: 215 [2018-02-04 00:28:38,999 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 63 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 325 ImplicationChecksByTransitivity, 41.8s TimeCoverageRelationStatistics Valid=197, Invalid=1521, Unknown=4, NotChecked=0, Total=1722 [2018-02-04 00:28:38,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2018-02-04 00:28:39,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 138. [2018-02-04 00:28:39,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-02-04 00:28:39,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 156 transitions. [2018-02-04 00:28:39,003 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 156 transitions. Word has length 72 [2018-02-04 00:28:39,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:28:39,003 INFO L432 AbstractCegarLoop]: Abstraction has 138 states and 156 transitions. [2018-02-04 00:28:39,003 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-02-04 00:28:39,003 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 156 transitions. [2018-02-04 00:28:39,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-02-04 00:28:39,004 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:28:39,004 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:28:39,004 INFO L371 AbstractCegarLoop]: === Iteration 17 === [mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation, alloc_unsafe_17Err1RequiresViolation, alloc_unsafe_17Err3RequiresViolation, alloc_unsafe_17Err2RequiresViolation, alloc_unsafe_17Err4RequiresViolation, alloc_unsafe_17Err0RequiresViolation, alloc_unsafe_17Err5RequiresViolation]=== [2018-02-04 00:28:39,004 INFO L82 PathProgramCache]: Analyzing trace with hash -262763435, now seen corresponding path program 1 times [2018-02-04 00:28:39,004 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:28:39,004 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:28:39,005 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:28:39,005 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 00:28:39,005 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:28:39,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:28:39,016 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:28:39,043 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2018-02-04 00:28:39,043 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 00:28:39,043 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 00:28:39,044 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 00:28:39,044 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 00:28:39,044 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 00:28:39,044 INFO L87 Difference]: Start difference. First operand 138 states and 156 transitions. Second operand 4 states. [2018-02-04 00:28:39,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:28:39,067 INFO L93 Difference]: Finished difference Result 145 states and 162 transitions. [2018-02-04 00:28:39,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 00:28:39,067 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 73 [2018-02-04 00:28:39,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:28:39,068 INFO L225 Difference]: With dead ends: 145 [2018-02-04 00:28:39,068 INFO L226 Difference]: Without dead ends: 145 [2018-02-04 00:28:39,069 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-04 00:28:39,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-02-04 00:28:39,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 141. [2018-02-04 00:28:39,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-02-04 00:28:39,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 158 transitions. [2018-02-04 00:28:39,072 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 158 transitions. Word has length 73 [2018-02-04 00:28:39,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:28:39,073 INFO L432 AbstractCegarLoop]: Abstraction has 141 states and 158 transitions. [2018-02-04 00:28:39,073 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 00:28:39,073 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 158 transitions. [2018-02-04 00:28:39,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-02-04 00:28:39,074 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:28:39,074 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:28:39,074 INFO L371 AbstractCegarLoop]: === Iteration 18 === [mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation, alloc_unsafe_17Err1RequiresViolation, alloc_unsafe_17Err3RequiresViolation, alloc_unsafe_17Err2RequiresViolation, alloc_unsafe_17Err4RequiresViolation, alloc_unsafe_17Err0RequiresViolation, alloc_unsafe_17Err5RequiresViolation]=== [2018-02-04 00:28:39,074 INFO L82 PathProgramCache]: Analyzing trace with hash 1862067708, now seen corresponding path program 1 times [2018-02-04 00:28:39,074 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:28:39,074 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:28:39,076 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:28:39,077 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:28:39,077 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:28:39,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:28:39,088 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:28:39,219 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 203 trivial. 0 not checked. [2018-02-04 00:28:39,220 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 00:28:39,220 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 00:28:39,225 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:28:39,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:28:39,247 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:28:39,286 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2018-02-04 00:28:39,304 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 00:28:39,304 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 6] total 16 [2018-02-04 00:28:39,304 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-04 00:28:39,305 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-04 00:28:39,305 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2018-02-04 00:28:39,305 INFO L87 Difference]: Start difference. First operand 141 states and 158 transitions. Second operand 16 states. [2018-02-04 00:28:39,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:28:39,582 INFO L93 Difference]: Finished difference Result 193 states and 215 transitions. [2018-02-04 00:28:39,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-04 00:28:39,583 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 79 [2018-02-04 00:28:39,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:28:39,584 INFO L225 Difference]: With dead ends: 193 [2018-02-04 00:28:39,584 INFO L226 Difference]: Without dead ends: 193 [2018-02-04 00:28:39,584 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=213, Invalid=909, Unknown=0, NotChecked=0, Total=1122 [2018-02-04 00:28:39,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2018-02-04 00:28:39,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 138. [2018-02-04 00:28:39,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-02-04 00:28:39,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 152 transitions. [2018-02-04 00:28:39,588 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 152 transitions. Word has length 79 [2018-02-04 00:28:39,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:28:39,589 INFO L432 AbstractCegarLoop]: Abstraction has 138 states and 152 transitions. [2018-02-04 00:28:39,589 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-04 00:28:39,589 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 152 transitions. [2018-02-04 00:28:39,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-02-04 00:28:39,590 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:28:39,590 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:28:39,590 INFO L371 AbstractCegarLoop]: === Iteration 19 === [mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation, alloc_unsafe_17Err1RequiresViolation, alloc_unsafe_17Err3RequiresViolation, alloc_unsafe_17Err2RequiresViolation, alloc_unsafe_17Err4RequiresViolation, alloc_unsafe_17Err0RequiresViolation, alloc_unsafe_17Err5RequiresViolation]=== [2018-02-04 00:28:39,590 INFO L82 PathProgramCache]: Analyzing trace with hash 449519656, now seen corresponding path program 1 times [2018-02-04 00:28:39,590 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:28:39,590 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:28:39,591 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:28:39,591 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:28:39,591 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:28:39,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:28:39,601 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:28:39,672 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2018-02-04 00:28:39,672 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 00:28:39,673 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 00:28:39,679 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:28:39,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:28:39,703 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:28:39,705 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-02-04 00:28:39,705 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 00:28:39,706 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:28:39,706 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-04 00:28:39,734 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2018-02-04 00:28:39,751 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 00:28:39,751 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-02-04 00:28:39,751 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 00:28:39,752 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 00:28:39,752 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-02-04 00:28:39,752 INFO L87 Difference]: Start difference. First operand 138 states and 152 transitions. Second operand 9 states. [2018-02-04 00:28:39,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:28:39,879 INFO L93 Difference]: Finished difference Result 163 states and 179 transitions. [2018-02-04 00:28:39,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-04 00:28:39,879 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 81 [2018-02-04 00:28:39,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:28:39,880 INFO L225 Difference]: With dead ends: 163 [2018-02-04 00:28:39,880 INFO L226 Difference]: Without dead ends: 163 [2018-02-04 00:28:39,880 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 81 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2018-02-04 00:28:39,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2018-02-04 00:28:39,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 152. [2018-02-04 00:28:39,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-02-04 00:28:39,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 169 transitions. [2018-02-04 00:28:39,883 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 169 transitions. Word has length 81 [2018-02-04 00:28:39,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:28:39,883 INFO L432 AbstractCegarLoop]: Abstraction has 152 states and 169 transitions. [2018-02-04 00:28:39,883 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 00:28:39,884 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 169 transitions. [2018-02-04 00:28:39,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-02-04 00:28:39,884 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:28:39,884 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:28:39,884 INFO L371 AbstractCegarLoop]: === Iteration 20 === [mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation, alloc_unsafe_17Err1RequiresViolation, alloc_unsafe_17Err3RequiresViolation, alloc_unsafe_17Err2RequiresViolation, alloc_unsafe_17Err4RequiresViolation, alloc_unsafe_17Err0RequiresViolation, alloc_unsafe_17Err5RequiresViolation]=== [2018-02-04 00:28:39,885 INFO L82 PathProgramCache]: Analyzing trace with hash 449519657, now seen corresponding path program 1 times [2018-02-04 00:28:39,885 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:28:39,885 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:28:39,886 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:28:39,886 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:28:39,886 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:28:39,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:28:39,897 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:28:40,057 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 31 proven. 2 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2018-02-04 00:28:40,058 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 00:28:40,058 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 00:28:40,063 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:28:40,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:28:40,088 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:28:40,115 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-02-04 00:28:40,115 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 00:28:40,131 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-02-04 00:28:40,131 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:28:40,141 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-02-04 00:28:40,142 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:30 [2018-02-04 00:28:42,848 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 138 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 00:28:42,865 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 00:28:42,865 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 20] total 30 [2018-02-04 00:28:42,866 INFO L409 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-02-04 00:28:42,866 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-02-04 00:28:42,866 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=817, Unknown=1, NotChecked=0, Total=930 [2018-02-04 00:28:42,866 INFO L87 Difference]: Start difference. First operand 152 states and 169 transitions. Second operand 31 states. [2018-02-04 00:28:44,757 WARN L143 SmtUtils]: Spent 1764ms on a formula simplification that was a NOOP. DAG size: 35 [2018-02-04 00:29:25,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:29:25,087 INFO L93 Difference]: Finished difference Result 175 states and 191 transitions. [2018-02-04 00:29:25,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-02-04 00:29:25,088 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 81 [2018-02-04 00:29:25,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:29:25,088 INFO L225 Difference]: With dead ends: 175 [2018-02-04 00:29:25,088 INFO L226 Difference]: Without dead ends: 175 [2018-02-04 00:29:25,089 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 66 SyntacticMatches, 1 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 567 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=544, Invalid=2994, Unknown=2, NotChecked=0, Total=3540 [2018-02-04 00:29:25,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2018-02-04 00:29:25,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 160. [2018-02-04 00:29:25,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2018-02-04 00:29:25,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 180 transitions. [2018-02-04 00:29:25,093 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 180 transitions. Word has length 81 [2018-02-04 00:29:25,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:29:25,093 INFO L432 AbstractCegarLoop]: Abstraction has 160 states and 180 transitions. [2018-02-04 00:29:25,093 INFO L433 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-02-04 00:29:25,093 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 180 transitions. [2018-02-04 00:29:25,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-02-04 00:29:25,094 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:29:25,094 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:29:25,094 INFO L371 AbstractCegarLoop]: === Iteration 21 === [mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation, alloc_unsafe_17Err1RequiresViolation, alloc_unsafe_17Err3RequiresViolation, alloc_unsafe_17Err2RequiresViolation, alloc_unsafe_17Err4RequiresViolation, alloc_unsafe_17Err0RequiresViolation, alloc_unsafe_17Err5RequiresViolation]=== [2018-02-04 00:29:25,095 INFO L82 PathProgramCache]: Analyzing trace with hash 1050207497, now seen corresponding path program 1 times [2018-02-04 00:29:25,095 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:29:25,095 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:29:25,096 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:29:25,096 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:29:25,096 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:29:25,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:29:25,118 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:29:25,994 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 114 proven. 88 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 00:29:25,994 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 00:29:25,994 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 00:29:25,999 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:29:26,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:29:26,020 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:29:26,075 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-02-04 00:29:26,076 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-02-04 00:29:26,076 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:29:26,077 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:29:26,080 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:29:26,080 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:18 [2018-02-04 00:29:26,114 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-02-04 00:29:26,115 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:29:26,116 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-02-04 00:29:26,116 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:29:26,118 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:29:26,121 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:29:26,122 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:25 [2018-02-04 00:29:26,162 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 25 [2018-02-04 00:29:26,164 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:29:26,165 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:29:26,166 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:29:26,167 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 52 [2018-02-04 00:29:26,167 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:29:26,177 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:29:26,181 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:29:26,182 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:38, output treesize:34 [2018-02-04 00:29:26,241 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 34 [2018-02-04 00:29:26,243 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:29:26,244 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:29:26,244 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:29:26,245 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:29:26,246 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:29:26,247 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:29:26,247 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 93 [2018-02-04 00:29:26,248 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:29:26,258 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:29:26,264 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 00:29:26,264 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:54, output treesize:50 [2018-02-04 00:29:26,333 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 43 [2018-02-04 00:29:26,335 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:29:26,336 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:29:26,336 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:29:26,337 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:29:26,338 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:29:26,338 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:29:26,339 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:29:26,339 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:29:26,340 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:29:26,341 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:29:26,343 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 146 [2018-02-04 00:29:26,344 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:29:26,358 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:29:26,366 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 00:29:26,366 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:70, output treesize:66 [2018-02-04 00:29:26,457 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 52 [2018-02-04 00:29:26,460 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:29:26,461 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:29:26,461 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:29:26,462 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:29:26,463 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:29:26,463 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:29:26,464 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:29:26,464 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:29:26,465 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:29:26,465 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:29:26,466 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:29:26,467 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:29:26,467 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:29:26,468 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:29:26,468 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:29:26,469 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 211 [2018-02-04 00:29:26,470 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:29:26,489 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:29:26,499 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-02-04 00:29:26,499 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:86, output treesize:82 [2018-02-04 00:29:26,606 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 61 [2018-02-04 00:29:26,608 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:29:26,609 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:29:26,610 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:29:26,610 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:29:26,621 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:29:26,622 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:29:26,622 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:29:26,623 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:29:26,623 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:29:26,624 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:29:26,624 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:29:26,625 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:29:26,625 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:29:26,626 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:29:26,626 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:29:26,627 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:29:26,627 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:29:26,628 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:29:26,628 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:29:26,629 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:29:26,629 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:29:26,630 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 288 [2018-02-04 00:29:26,630 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:29:26,657 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:29:26,670 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-02-04 00:29:26,670 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:102, output treesize:98 [2018-02-04 00:29:26,847 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 70 [2018-02-04 00:29:26,872 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:29:26,873 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:29:26,874 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:29:26,875 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:29:26,876 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:29:26,876 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:29:26,877 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:29:26,878 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:29:26,879 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:29:26,880 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:29:26,881 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:29:26,881 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:29:26,882 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:29:26,883 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:29:26,884 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:29:26,885 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:29:26,886 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:29:26,887 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:29:26,887 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:29:26,888 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:29:26,889 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:29:26,890 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:29:26,890 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:29:26,892 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:29:26,893 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:29:26,893 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:29:26,894 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:29:26,895 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:29:26,897 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 377 [2018-02-04 00:29:26,897 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:29:26,964 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:29:26,992 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2018-02-04 00:29:26,993 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:118, output treesize:114 [2018-02-04 00:29:28,119 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 79 [2018-02-04 00:29:28,124 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:29:28,125 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:29:28,126 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:29:28,127 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:29:28,128 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:29:28,129 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:29:28,130 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:29:28,131 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:29:28,132 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:29:28,135 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:29:28,136 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:29:28,137 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:29:28,138 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:29:28,139 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:29:28,140 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:29:28,141 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:29:28,142 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:29:28,143 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:29:28,144 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:29:28,145 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:29:28,146 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:29:28,163 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:29:28,164 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:29:28,164 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:29:28,165 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:29:28,166 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:29:28,167 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:29:28,167 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:29:28,168 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:29:28,170 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:29:28,171 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:29:28,172 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:29:28,173 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:29:28,173 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:29:28,174 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:29:28,175 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:29:28,176 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 36 disjoint index pairs (out of 28 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 478 [2018-02-04 00:29:28,177 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:29:28,268 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:29:28,302 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2018-02-04 00:29:28,302 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:134, output treesize:130 [2018-02-04 00:29:38,829 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 88 [2018-02-04 00:29:38,832 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:29:38,833 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:29:38,834 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:29:38,835 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:29:38,835 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:29:38,836 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:29:38,839 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:29:38,840 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:29:38,841 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:29:38,842 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:29:38,847 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:29:38,848 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:29:38,849 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:29:38,849 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:29:38,850 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:29:38,851 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:29:38,852 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:29:38,853 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:29:38,853 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:29:38,854 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:29:38,855 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:29:38,855 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:29:38,856 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:29:38,857 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:29:38,857 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:29:38,858 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:29:38,858 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:29:38,859 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:29:38,859 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:29:38,860 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:29:38,861 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:29:38,861 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:29:38,862 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:29:38,862 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:29:38,863 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:29:38,864 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:29:38,864 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:29:38,865 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:29:38,866 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:29:38,866 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:29:38,867 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:29:38,867 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:29:38,868 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:29:38,869 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:29:38,869 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:29:38,870 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 9 select indices, 9 select index equivalence classes, 45 disjoint index pairs (out of 36 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 591 [2018-02-04 00:29:38,871 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:29:38,949 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:29:38,974 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 1 dim-2 vars, End of recursive call: 8 dim-0 vars, and 1 xjuncts. [2018-02-04 00:29:38,974 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:150, output treesize:146 [2018-02-04 00:30:09,430 WARN L143 SmtUtils]: Spent 2028ms on a formula simplification that was a NOOP. DAG size: 72 [2018-02-04 00:30:11,555 WARN L143 SmtUtils]: Spent 2029ms on a formula simplification that was a NOOP. DAG size: 72 [2018-02-04 00:30:13,692 WARN L143 SmtUtils]: Spent 2084ms on a formula simplification that was a NOOP. DAG size: 65 [2018-02-04 00:30:13,699 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 94 treesize of output 72 [2018-02-04 00:30:13,703 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:30:13,704 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:30:13,705 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:30:13,705 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:30:13,706 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:30:13,707 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:30:13,707 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:30:13,708 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:30:13,709 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:30:13,709 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:30:13,710 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:30:13,711 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:30:13,711 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:30:13,712 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:30:13,712 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:30:13,713 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:30:13,714 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:30:13,714 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:30:13,715 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:30:13,715 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:30:13,716 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:30:13,716 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:30:13,717 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:30:13,717 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:30:13,718 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:30:13,718 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:30:13,719 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:30:13,719 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:30:13,720 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:30:13,720 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:30:13,721 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:30:13,721 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:30:13,722 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:30:13,722 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:30:13,723 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:30:13,723 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:30:13,724 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:30:13,724 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:30:13,725 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:30:13,725 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:30:13,726 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:30:13,726 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:30:13,727 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:30:13,727 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:30:13,728 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 10 select indices, 10 select index equivalence classes, 45 disjoint index pairs (out of 45 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 324 [2018-02-04 00:30:13,729 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:30:13,773 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:30:13,781 INFO L267 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:30:13,781 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 10 variables, input treesize:132, output treesize:3 [2018-02-04 00:30:13,823 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 105 proven. 97 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 00:30:13,840 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 00:30:13,841 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 29] total 47 [2018-02-04 00:30:13,841 INFO L409 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-02-04 00:30:13,841 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-02-04 00:30:13,841 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=385, Invalid=1852, Unknown=19, NotChecked=0, Total=2256 [2018-02-04 00:30:13,842 INFO L87 Difference]: Start difference. First operand 160 states and 180 transitions. Second operand 48 states. Received shutdown request... [2018-02-04 00:31:22,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-02-04 00:31:22,571 WARN L491 AbstractCegarLoop]: Verification canceled [2018-02-04 00:31:22,574 WARN L185 ceAbstractionStarter]: Timeout [2018-02-04 00:31:22,574 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.02 12:31:22 BoogieIcfgContainer [2018-02-04 00:31:22,574 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-04 00:31:22,574 INFO L168 Benchmark]: Toolchain (without parser) took 218703.58 ms. Allocated memory was 403.2 MB in the beginning and 727.2 MB in the end (delta: 324.0 MB). Free memory was 360.0 MB in the beginning and 630.5 MB in the end (delta: -270.5 MB). Peak memory consumption was 53.5 MB. Max. memory is 5.3 GB. [2018-02-04 00:31:22,575 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 403.2 MB. Free memory is still 366.7 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 00:31:22,575 INFO L168 Benchmark]: CACSL2BoogieTranslator took 152.78 ms. Allocated memory is still 403.2 MB. Free memory was 360.0 MB in the beginning and 346.8 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 5.3 GB. [2018-02-04 00:31:22,575 INFO L168 Benchmark]: Boogie Preprocessor took 27.02 ms. Allocated memory is still 403.2 MB. Free memory was 346.8 MB in the beginning and 345.4 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-02-04 00:31:22,576 INFO L168 Benchmark]: RCFGBuilder took 209.30 ms. Allocated memory is still 403.2 MB. Free memory was 345.4 MB in the beginning and 322.0 MB in the end (delta: 23.5 MB). Peak memory consumption was 23.5 MB. Max. memory is 5.3 GB. [2018-02-04 00:31:22,576 INFO L168 Benchmark]: TraceAbstraction took 218311.29 ms. Allocated memory was 403.2 MB in the beginning and 727.2 MB in the end (delta: 324.0 MB). Free memory was 322.0 MB in the beginning and 630.5 MB in the end (delta: -308.5 MB). Peak memory consumption was 15.5 MB. Max. memory is 5.3 GB. [2018-02-04 00:31:22,577 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 403.2 MB. Free memory is still 366.7 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 152.78 ms. Allocated memory is still 403.2 MB. Free memory was 360.0 MB in the beginning and 346.8 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 27.02 ms. Allocated memory is still 403.2 MB. Free memory was 346.8 MB in the beginning and 345.4 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 209.30 ms. Allocated memory is still 403.2 MB. Free memory was 345.4 MB in the beginning and 322.0 MB in the end (delta: 23.5 MB). Peak memory consumption was 23.5 MB. Max. memory is 5.3 GB. * TraceAbstraction took 218311.29 ms. Allocated memory was 403.2 MB in the beginning and 727.2 MB in the end (delta: 324.0 MB). Free memory was 322.0 MB in the beginning and 630.5 MB in the end (delta: -308.5 MB). Peak memory consumption was 15.5 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 (160states) and interpolant automaton (currently 26 states, 48 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 71 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1460). Cancelled while BasicCegarLoop was constructing difference of abstraction (160states) and interpolant automaton (currently 26 states, 48 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 71 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1460). Cancelled while BasicCegarLoop was constructing difference of abstraction (160states) and interpolant automaton (currently 26 states, 48 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 71 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1460). Cancelled while BasicCegarLoop was constructing difference of abstraction (160states) and interpolant automaton (currently 26 states, 48 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 71 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1460). Cancelled while BasicCegarLoop was constructing difference of abstraction (160states) and interpolant automaton (currently 26 states, 48 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 71 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1470). Cancelled while BasicCegarLoop was constructing difference of abstraction (160states) and interpolant automaton (currently 26 states, 48 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 71 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1470). Cancelled while BasicCegarLoop was constructing difference of abstraction (160states) and interpolant automaton (currently 26 states, 48 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 71 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1474). Cancelled while BasicCegarLoop was constructing difference of abstraction (160states) and interpolant automaton (currently 26 states, 48 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 71 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1474). Cancelled while BasicCegarLoop was constructing difference of abstraction (160states) and interpolant automaton (currently 26 states, 48 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 71 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1446). Cancelled while BasicCegarLoop was constructing difference of abstraction (160states) and interpolant automaton (currently 26 states, 48 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 71 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1451). Cancelled while BasicCegarLoop was constructing difference of abstraction (160states) and interpolant automaton (currently 26 states, 48 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 71 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1451). Cancelled while BasicCegarLoop was constructing difference of abstraction (160states) and interpolant automaton (currently 26 states, 48 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 71 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1451). Cancelled while BasicCegarLoop was constructing difference of abstraction (160states) and interpolant automaton (currently 26 states, 48 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 71 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1446). Cancelled while BasicCegarLoop was constructing difference of abstraction (160states) and interpolant automaton (currently 26 states, 48 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 71 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1451). Cancelled while BasicCegarLoop was constructing difference of abstraction (160states) and interpolant automaton (currently 26 states, 48 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 71 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 72 locations, 15 error locations. TIMEOUT Result, 218.2s OverallTime, 21 OverallIterations, 11 TraceHistogramMax, 162.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1336 SDtfs, 1494 SDslu, 8177 SDs, 0 SdLazy, 5018 SolverSat, 353 SolverUnsat, 55 SolverUnknown, 0 SolverNotchecked, 83.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1132 GetRequests, 714 SyntacticMatches, 18 SemanticMatches, 399 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 3190 ImplicationChecksByTransitivity, 123.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=160occurred in iteration=20, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 20 MinimizatonAttempts, 305 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 54.3s InterpolantComputationTime, 1848 NumberOfCodeBlocks, 1764 NumberOfCodeBlocksAsserted, 38 NumberOfCheckSat, 1814 ConstructedInterpolants, 100 QuantifiedInterpolants, 1110056 SizeOfPredicates, 50 NumberOfNonLiveVariables, 2438 ConjunctsInSsa, 245 ConjunctsInUnsatCore, 34 InterpolantComputations, 9 PerfectInterpolantSequences, 2183/3514 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test17_2_false-valid-free.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-04_00-31-22-583.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test17_2_false-valid-free.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-04_00-31-22-583.csv Completed graceful shutdown