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-c17473d-m [2018-02-04 13:43:17,144 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-04 13:43:17,145 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-04 13:43:17,158 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-04 13:43:17,158 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-04 13:43:17,159 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-04 13:43:17,160 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-04 13:43:17,162 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-04 13:43:17,164 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-04 13:43:17,165 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-04 13:43:17,165 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-04 13:43:17,166 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-04 13:43:17,166 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-04 13:43:17,168 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-04 13:43:17,168 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-04 13:43:17,170 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-04 13:43:17,172 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-04 13:43:17,173 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-04 13:43:17,174 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-04 13:43:17,175 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-04 13:43:17,177 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-04 13:43:17,177 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-04 13:43:17,178 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-04 13:43:17,179 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-04 13:43:17,179 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-04 13:43:17,180 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-04 13:43:17,180 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-04 13:43:17,181 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-04 13:43:17,181 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-04 13:43:17,181 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-04 13:43:17,182 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-04 13:43:17,182 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 13:43:17,193 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-04 13:43:17,193 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-04 13:43:17,195 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-04 13:43:17,195 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-04 13:43:17,195 INFO L133 SettingsManager]: * Use SBE=true [2018-02-04 13:43:17,195 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-04 13:43:17,195 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-04 13:43:17,196 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-04 13:43:17,196 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-04 13:43:17,196 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-04 13:43:17,196 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-04 13:43:17,196 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-04 13:43:17,196 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-04 13:43:17,197 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-04 13:43:17,197 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-04 13:43:17,197 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-04 13:43:17,197 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-04 13:43:17,197 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-04 13:43:17,197 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-04 13:43:17,197 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 13:43:17,198 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-04 13:43:17,198 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-04 13:43:17,198 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-04 13:43:17,198 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-02-04 13:43:17,227 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-04 13:43:17,239 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-04 13:43:17,245 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-04 13:43:17,247 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-04 13:43:17,247 INFO L276 PluginConnector]: CDTParser initialized [2018-02-04 13:43:17,248 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 13:43:17,425 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-04 13:43:17,426 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-04 13:43:17,426 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-04 13:43:17,427 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-04 13:43:17,431 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-04 13:43:17,432 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 01:43:17" (1/1) ... [2018-02-04 13:43:17,434 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@79d89a9b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:43:17, skipping insertion in model container [2018-02-04 13:43:17,434 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 01:43:17" (1/1) ... [2018-02-04 13:43:17,444 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 13:43:17,479 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 13:43:17,566 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 13:43:17,580 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 13:43:17,584 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:43:17 WrapperNode [2018-02-04 13:43:17,584 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-04 13:43:17,584 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-04 13:43:17,585 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-04 13:43:17,585 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-04 13:43:17,594 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:43:17" (1/1) ... [2018-02-04 13:43:17,594 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:43:17" (1/1) ... [2018-02-04 13:43:17,607 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:43:17" (1/1) ... [2018-02-04 13:43:17,607 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:43:17" (1/1) ... [2018-02-04 13:43:17,611 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:43:17" (1/1) ... [2018-02-04 13:43:17,613 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:43:17" (1/1) ... [2018-02-04 13:43:17,614 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:43:17" (1/1) ... [2018-02-04 13:43:17,615 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-04 13:43:17,615 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-04 13:43:17,615 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-04 13:43:17,616 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-04 13:43:17,616 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:43:17" (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 13:43:17,651 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-04 13:43:17,651 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-04 13:43:17,651 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-02-04 13:43:17,651 INFO L136 BoogieDeclarations]: Found implementation of procedure alloc_unsafe_17 [2018-02-04 13:43:17,651 INFO L136 BoogieDeclarations]: Found implementation of procedure free_17 [2018-02-04 13:43:17,651 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-02-04 13:43:17,651 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-04 13:43:17,651 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-04 13:43:17,652 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-04 13:43:17,652 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-04 13:43:17,652 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-04 13:43:17,652 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-04 13:43:17,652 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-04 13:43:17,652 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-04 13:43:17,652 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-04 13:43:17,652 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-02-04 13:43:17,652 INFO L128 BoogieDeclarations]: Found specification of procedure alloc_unsafe_17 [2018-02-04 13:43:17,652 INFO L128 BoogieDeclarations]: Found specification of procedure free_17 [2018-02-04 13:43:17,652 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-02-04 13:43:17,652 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-04 13:43:17,652 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-04 13:43:17,652 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-04 13:43:17,864 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-04 13:43:17,865 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 01:43:17 BoogieIcfgContainer [2018-02-04 13:43:17,865 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-04 13:43:17,866 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-04 13:43:17,866 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-04 13:43:17,868 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-04 13:43:17,868 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 01:43:17" (1/3) ... [2018-02-04 13:43:17,869 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@471b7fc4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 01:43:17, skipping insertion in model container [2018-02-04 13:43:17,869 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:43:17" (2/3) ... [2018-02-04 13:43:17,869 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@471b7fc4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 01:43:17, skipping insertion in model container [2018-02-04 13:43:17,869 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 01:43:17" (3/3) ... [2018-02-04 13:43:17,871 INFO L107 eAbstractionObserver]: Analyzing ICFG memleaks_test17_2_false-valid-free.i [2018-02-04 13:43:17,878 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-04 13:43:17,885 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 15 error locations. [2018-02-04 13:43:17,908 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-04 13:43:17,908 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-04 13:43:17,908 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-04 13:43:17,908 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-04 13:43:17,908 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-04 13:43:17,908 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-04 13:43:17,908 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-04 13:43:17,909 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-04 13:43:17,909 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-04 13:43:17,919 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states. [2018-02-04 13:43:17,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-04 13:43:17,928 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:43:17,928 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 13:43:17,929 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 13:43:17,933 INFO L82 PathProgramCache]: Analyzing trace with hash 1429677520, now seen corresponding path program 1 times [2018-02-04 13:43:17,934 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:43:17,934 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:43:17,969 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:43:17,969 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:43:17,969 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:43:18,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:43:18,008 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:43:18,074 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 13:43:18,075 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 13:43:18,076 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 13:43:18,077 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 13:43:18,085 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 13:43:18,086 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 13:43:18,087 INFO L87 Difference]: Start difference. First operand 72 states. Second operand 3 states. [2018-02-04 13:43:18,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:43:18,285 INFO L93 Difference]: Finished difference Result 122 states and 142 transitions. [2018-02-04 13:43:18,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 13:43:18,287 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-02-04 13:43:18,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:43:18,297 INFO L225 Difference]: With dead ends: 122 [2018-02-04 13:43:18,297 INFO L226 Difference]: Without dead ends: 116 [2018-02-04 13:43:18,299 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 13:43:18,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-02-04 13:43:18,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 73. [2018-02-04 13:43:18,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-02-04 13:43:18,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 81 transitions. [2018-02-04 13:43:18,333 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 81 transitions. Word has length 17 [2018-02-04 13:43:18,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:43:18,333 INFO L432 AbstractCegarLoop]: Abstraction has 73 states and 81 transitions. [2018-02-04 13:43:18,334 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 13:43:18,334 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 81 transitions. [2018-02-04 13:43:18,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-04 13:43:18,335 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:43:18,335 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 13:43:18,335 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 13:43:18,336 INFO L82 PathProgramCache]: Analyzing trace with hash 1429687667, now seen corresponding path program 1 times [2018-02-04 13:43:18,336 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:43:18,336 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:43:18,337 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:43:18,337 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:43:18,338 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:43:18,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:43:18,350 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:43:18,396 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 13:43:18,396 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 13:43:18,396 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 13:43:18,398 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 13:43:18,398 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 13:43:18,398 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 13:43:18,398 INFO L87 Difference]: Start difference. First operand 73 states and 81 transitions. Second operand 5 states. [2018-02-04 13:43:18,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:43:18,413 INFO L93 Difference]: Finished difference Result 75 states and 82 transitions. [2018-02-04 13:43:18,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 13:43:18,414 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-02-04 13:43:18,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:43:18,414 INFO L225 Difference]: With dead ends: 75 [2018-02-04 13:43:18,414 INFO L226 Difference]: Without dead ends: 73 [2018-02-04 13:43:18,415 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 13:43:18,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-02-04 13:43:18,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 71. [2018-02-04 13:43:18,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-02-04 13:43:18,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 78 transitions. [2018-02-04 13:43:18,419 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 78 transitions. Word has length 17 [2018-02-04 13:43:18,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:43:18,419 INFO L432 AbstractCegarLoop]: Abstraction has 71 states and 78 transitions. [2018-02-04 13:43:18,419 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 13:43:18,419 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 78 transitions. [2018-02-04 13:43:18,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-04 13:43:18,420 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:43:18,420 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 13:43:18,420 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 13:43:18,420 INFO L82 PathProgramCache]: Analyzing trace with hash 1294678610, now seen corresponding path program 1 times [2018-02-04 13:43:18,420 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:43:18,420 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:43:18,421 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:43:18,421 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:43:18,421 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:43:18,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:43:18,431 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:43:18,475 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 13:43:18,475 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 13:43:18,476 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 13:43:18,476 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 13:43:18,476 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 13:43:18,476 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 13:43:18,476 INFO L87 Difference]: Start difference. First operand 71 states and 78 transitions. Second operand 6 states. [2018-02-04 13:43:18,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:43:18,535 INFO L93 Difference]: Finished difference Result 71 states and 77 transitions. [2018-02-04 13:43:18,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 13:43:18,535 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-02-04 13:43:18,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:43:18,536 INFO L225 Difference]: With dead ends: 71 [2018-02-04 13:43:18,536 INFO L226 Difference]: Without dead ends: 71 [2018-02-04 13:43:18,536 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 13:43:18,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-02-04 13:43:18,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2018-02-04 13:43:18,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-02-04 13:43:18,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 77 transitions. [2018-02-04 13:43:18,542 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 77 transitions. Word has length 19 [2018-02-04 13:43:18,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:43:18,542 INFO L432 AbstractCegarLoop]: Abstraction has 71 states and 77 transitions. [2018-02-04 13:43:18,542 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 13:43:18,542 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 77 transitions. [2018-02-04 13:43:18,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-04 13:43:18,543 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:43:18,543 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 13:43:18,543 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 13:43:18,543 INFO L82 PathProgramCache]: Analyzing trace with hash 1294688757, now seen corresponding path program 1 times [2018-02-04 13:43:18,543 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:43:18,543 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:43:18,544 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:43:18,545 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:43:18,545 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:43:18,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:43:18,556 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:43:18,590 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 13:43:18,591 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 13:43:18,591 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 13:43:18,591 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 13:43:18,591 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 13:43:18,591 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 13:43:18,592 INFO L87 Difference]: Start difference. First operand 71 states and 77 transitions. Second operand 6 states. [2018-02-04 13:43:18,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:43:18,656 INFO L93 Difference]: Finished difference Result 70 states and 76 transitions. [2018-02-04 13:43:18,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 13:43:18,656 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-02-04 13:43:18,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:43:18,657 INFO L225 Difference]: With dead ends: 70 [2018-02-04 13:43:18,657 INFO L226 Difference]: Without dead ends: 70 [2018-02-04 13:43:18,657 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 13:43:18,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-02-04 13:43:18,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2018-02-04 13:43:18,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-02-04 13:43:18,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 76 transitions. [2018-02-04 13:43:18,660 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 76 transitions. Word has length 19 [2018-02-04 13:43:18,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:43:18,660 INFO L432 AbstractCegarLoop]: Abstraction has 70 states and 76 transitions. [2018-02-04 13:43:18,660 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 13:43:18,660 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 76 transitions. [2018-02-04 13:43:18,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-04 13:43:18,661 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:43:18,661 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 13:43:18,661 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 13:43:18,661 INFO L82 PathProgramCache]: Analyzing trace with hash 1294688758, now seen corresponding path program 1 times [2018-02-04 13:43:18,661 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:43:18,661 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:43:18,662 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:43:18,662 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:43:18,662 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:43:18,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:43:18,671 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:43:18,864 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 13:43:18,864 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 13:43:18,864 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-04 13:43:18,864 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 13:43:18,865 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 13:43:18,865 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-02-04 13:43:18,865 INFO L87 Difference]: Start difference. First operand 70 states and 76 transitions. Second operand 9 states. [2018-02-04 13:43:19,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:43:19,034 INFO L93 Difference]: Finished difference Result 74 states and 80 transitions. [2018-02-04 13:43:19,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 13:43:19,035 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 19 [2018-02-04 13:43:19,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:43:19,035 INFO L225 Difference]: With dead ends: 74 [2018-02-04 13:43:19,036 INFO L226 Difference]: Without dead ends: 74 [2018-02-04 13:43:19,036 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 13:43:19,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-02-04 13:43:19,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 73. [2018-02-04 13:43:19,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-02-04 13:43:19,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 79 transitions. [2018-02-04 13:43:19,040 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 79 transitions. Word has length 19 [2018-02-04 13:43:19,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:43:19,040 INFO L432 AbstractCegarLoop]: Abstraction has 73 states and 79 transitions. [2018-02-04 13:43:19,040 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 13:43:19,040 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 79 transitions. [2018-02-04 13:43:19,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-04 13:43:19,041 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:43:19,041 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 13:43:19,041 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 13:43:19,041 INFO L82 PathProgramCache]: Analyzing trace with hash 607378637, now seen corresponding path program 1 times [2018-02-04 13:43:19,041 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:43:19,041 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:43:19,042 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:43:19,042 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:43:19,042 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:43:19,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:43:19,055 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:43:19,224 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 13:43:19,225 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 13:43:19,225 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 13:43:19,232 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:43:19,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:43:19,259 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 13:43:19,301 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 13:43:19,303 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 13:43:19,312 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 13:43:19,313 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:43:19,321 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 13:43:19,321 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:36 [2018-02-04 13:43:19,441 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 13:43:19,458 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 13:43:19,458 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 18 [2018-02-04 13:43:19,459 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-04 13:43:19,459 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-04 13:43:19,459 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=297, Unknown=0, NotChecked=0, Total=342 [2018-02-04 13:43:19,459 INFO L87 Difference]: Start difference. First operand 73 states and 79 transitions. Second operand 19 states. [2018-02-04 13:43:19,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:43:19,792 INFO L93 Difference]: Finished difference Result 79 states and 85 transitions. [2018-02-04 13:43:19,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-04 13:43:19,792 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 23 [2018-02-04 13:43:19,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:43:19,793 INFO L225 Difference]: With dead ends: 79 [2018-02-04 13:43:19,793 INFO L226 Difference]: Without dead ends: 79 [2018-02-04 13:43:19,793 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=114, Invalid=588, Unknown=0, NotChecked=0, Total=702 [2018-02-04 13:43:19,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-02-04 13:43:19,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2018-02-04 13:43:19,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-02-04 13:43:19,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 85 transitions. [2018-02-04 13:43:19,796 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 85 transitions. Word has length 23 [2018-02-04 13:43:19,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:43:19,797 INFO L432 AbstractCegarLoop]: Abstraction has 79 states and 85 transitions. [2018-02-04 13:43:19,797 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-04 13:43:19,797 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 85 transitions. [2018-02-04 13:43:19,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-02-04 13:43:19,797 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:43:19,797 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 13:43:19,797 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 13:43:19,798 INFO L82 PathProgramCache]: Analyzing trace with hash 376259064, now seen corresponding path program 1 times [2018-02-04 13:43:19,798 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:43:19,798 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:43:19,799 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:43:19,799 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:43:19,799 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:43:19,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:43:19,809 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:43:19,885 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 13:43:19,886 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 13:43:19,886 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-04 13:43:19,886 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 13:43:19,886 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 13:43:19,886 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-02-04 13:43:19,886 INFO L87 Difference]: Start difference. First operand 79 states and 85 transitions. Second operand 8 states. [2018-02-04 13:43:20,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:43:20,023 INFO L93 Difference]: Finished difference Result 103 states and 115 transitions. [2018-02-04 13:43:20,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 13:43:20,024 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 38 [2018-02-04 13:43:20,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:43:20,025 INFO L225 Difference]: With dead ends: 103 [2018-02-04 13:43:20,025 INFO L226 Difference]: Without dead ends: 103 [2018-02-04 13:43:20,025 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 13:43:20,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-02-04 13:43:20,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 83. [2018-02-04 13:43:20,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-02-04 13:43:20,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 91 transitions. [2018-02-04 13:43:20,031 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 91 transitions. Word has length 38 [2018-02-04 13:43:20,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:43:20,031 INFO L432 AbstractCegarLoop]: Abstraction has 83 states and 91 transitions. [2018-02-04 13:43:20,031 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 13:43:20,031 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 91 transitions. [2018-02-04 13:43:20,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-02-04 13:43:20,032 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:43:20,032 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 13:43:20,032 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 13:43:20,032 INFO L82 PathProgramCache]: Analyzing trace with hash 376259065, now seen corresponding path program 1 times [2018-02-04 13:43:20,033 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:43:20,033 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:43:20,034 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:43:20,034 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:43:20,034 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:43:20,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:43:20,046 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:43:20,096 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 13:43:20,097 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 13:43:20,097 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 13:43:20,112 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:43:20,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:43:20,129 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 13:43:20,160 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 13:43:20,178 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 13:43:20,178 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2018-02-04 13:43:20,178 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 13:43:20,179 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 13:43:20,179 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=61, Unknown=0, NotChecked=0, Total=110 [2018-02-04 13:43:20,179 INFO L87 Difference]: Start difference. First operand 83 states and 91 transitions. Second operand 11 states. [2018-02-04 13:43:20,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:43:20,211 INFO L93 Difference]: Finished difference Result 89 states and 97 transitions. [2018-02-04 13:43:20,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 13:43:20,212 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 38 [2018-02-04 13:43:20,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:43:20,212 INFO L225 Difference]: With dead ends: 89 [2018-02-04 13:43:20,213 INFO L226 Difference]: Without dead ends: 89 [2018-02-04 13:43:20,213 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 13:43:20,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-02-04 13:43:20,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 87. [2018-02-04 13:43:20,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-02-04 13:43:20,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 95 transitions. [2018-02-04 13:43:20,217 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 95 transitions. Word has length 38 [2018-02-04 13:43:20,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:43:20,218 INFO L432 AbstractCegarLoop]: Abstraction has 87 states and 95 transitions. [2018-02-04 13:43:20,218 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 13:43:20,218 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 95 transitions. [2018-02-04 13:43:20,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-02-04 13:43:20,219 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:43:20,219 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 13:43:20,219 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 13:43:20,219 INFO L82 PathProgramCache]: Analyzing trace with hash 997822914, now seen corresponding path program 2 times [2018-02-04 13:43:20,219 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:43:20,219 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:43:20,220 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:43:20,221 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:43:20,221 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:43:20,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:43:20,234 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:43:20,278 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 13:43:20,279 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 13:43:20,279 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 13:43:20,284 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 13:43:20,298 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-02-04 13:43:20,298 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 13:43:20,300 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 13:43:20,314 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 13:43:20,331 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-02-04 13:43:20,331 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 10 [2018-02-04 13:43:20,332 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-04 13:43:20,332 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-04 13:43:20,332 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2018-02-04 13:43:20,332 INFO L87 Difference]: Start difference. First operand 87 states and 95 transitions. Second operand 10 states. [2018-02-04 13:43:20,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:43:20,408 INFO L93 Difference]: Finished difference Result 116 states and 128 transitions. [2018-02-04 13:43:20,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 13:43:20,408 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 42 [2018-02-04 13:43:20,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:43:20,409 INFO L225 Difference]: With dead ends: 116 [2018-02-04 13:43:20,409 INFO L226 Difference]: Without dead ends: 116 [2018-02-04 13:43:20,409 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 13:43:20,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-02-04 13:43:20,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 93. [2018-02-04 13:43:20,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-02-04 13:43:20,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 101 transitions. [2018-02-04 13:43:20,413 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 101 transitions. Word has length 42 [2018-02-04 13:43:20,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:43:20,413 INFO L432 AbstractCegarLoop]: Abstraction has 93 states and 101 transitions. [2018-02-04 13:43:20,413 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-04 13:43:20,413 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 101 transitions. [2018-02-04 13:43:20,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-02-04 13:43:20,414 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:43:20,414 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 13:43:20,414 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 13:43:20,415 INFO L82 PathProgramCache]: Analyzing trace with hash -362065032, now seen corresponding path program 1 times [2018-02-04 13:43:20,415 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:43:20,415 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:43:20,416 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:43:20,416 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 13:43:20,416 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:43:20,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:43:20,427 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:43:20,459 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 13:43:20,460 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 13:43:20,460 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 13:43:20,460 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 13:43:20,460 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 13:43:20,460 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 13:43:20,460 INFO L87 Difference]: Start difference. First operand 93 states and 101 transitions. Second operand 5 states. [2018-02-04 13:43:20,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:43:20,468 INFO L93 Difference]: Finished difference Result 108 states and 117 transitions. [2018-02-04 13:43:20,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 13:43:20,469 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 50 [2018-02-04 13:43:20,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:43:20,469 INFO L225 Difference]: With dead ends: 108 [2018-02-04 13:43:20,469 INFO L226 Difference]: Without dead ends: 108 [2018-02-04 13:43:20,470 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 13:43:20,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-02-04 13:43:20,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 95. [2018-02-04 13:43:20,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-02-04 13:43:20,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 103 transitions. [2018-02-04 13:43:20,474 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 103 transitions. Word has length 50 [2018-02-04 13:43:20,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:43:20,474 INFO L432 AbstractCegarLoop]: Abstraction has 95 states and 103 transitions. [2018-02-04 13:43:20,475 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 13:43:20,475 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 103 transitions. [2018-02-04 13:43:20,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-02-04 13:43:20,476 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:43:20,476 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 13:43:20,476 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 13:43:20,476 INFO L82 PathProgramCache]: Analyzing trace with hash -1169426246, now seen corresponding path program 1 times [2018-02-04 13:43:20,476 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:43:20,476 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:43:20,477 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:43:20,478 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:43:20,478 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:43:20,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:43:20,488 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:43:20,533 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 13:43:20,534 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 13:43:20,534 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 13:43:20,539 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:43:20,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:43:20,568 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 13:43:20,648 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 13:43:20,681 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 13:43:20,681 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2018-02-04 13:43:20,681 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-04 13:43:20,681 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-04 13:43:20,681 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=120, Unknown=0, NotChecked=0, Total=210 [2018-02-04 13:43:20,682 INFO L87 Difference]: Start difference. First operand 95 states and 103 transitions. Second operand 15 states. [2018-02-04 13:43:20,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:43:20,744 INFO L93 Difference]: Finished difference Result 101 states and 109 transitions. [2018-02-04 13:43:20,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 13:43:20,744 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 52 [2018-02-04 13:43:20,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:43:20,744 INFO L225 Difference]: With dead ends: 101 [2018-02-04 13:43:20,744 INFO L226 Difference]: Without dead ends: 101 [2018-02-04 13:43:20,745 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 13:43:20,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-02-04 13:43:20,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 99. [2018-02-04 13:43:20,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-02-04 13:43:20,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 107 transitions. [2018-02-04 13:43:20,747 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 107 transitions. Word has length 52 [2018-02-04 13:43:20,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:43:20,747 INFO L432 AbstractCegarLoop]: Abstraction has 99 states and 107 transitions. [2018-02-04 13:43:20,747 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-04 13:43:20,747 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 107 transitions. [2018-02-04 13:43:20,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-02-04 13:43:20,748 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:43:20,748 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 13:43:20,748 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 13:43:20,748 INFO L82 PathProgramCache]: Analyzing trace with hash 1567126723, now seen corresponding path program 2 times [2018-02-04 13:43:20,748 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:43:20,748 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:43:20,749 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:43:20,749 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:43:20,749 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:43:20,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:43:20,761 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:43:20,842 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 13:43:20,843 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 13:43:20,843 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 13:43:20,851 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 13:43:20,883 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 13:43:20,883 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 13:43:20,886 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 13:43:20,967 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 13:43:20,994 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 13:43:20,994 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2018-02-04 13:43:20,994 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-04 13:43:20,995 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-04 13:43:20,995 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=157, Unknown=0, NotChecked=0, Total=272 [2018-02-04 13:43:20,995 INFO L87 Difference]: Start difference. First operand 99 states and 107 transitions. Second operand 17 states. [2018-02-04 13:43:21,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:43:21,062 INFO L93 Difference]: Finished difference Result 105 states and 113 transitions. [2018-02-04 13:43:21,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 13:43:21,062 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 56 [2018-02-04 13:43:21,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:43:21,063 INFO L225 Difference]: With dead ends: 105 [2018-02-04 13:43:21,063 INFO L226 Difference]: Without dead ends: 105 [2018-02-04 13:43:21,063 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 13:43:21,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-02-04 13:43:21,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 103. [2018-02-04 13:43:21,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-02-04 13:43:21,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 111 transitions. [2018-02-04 13:43:21,067 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 111 transitions. Word has length 56 [2018-02-04 13:43:21,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:43:21,067 INFO L432 AbstractCegarLoop]: Abstraction has 103 states and 111 transitions. [2018-02-04 13:43:21,067 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-04 13:43:21,067 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 111 transitions. [2018-02-04 13:43:21,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-02-04 13:43:21,068 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:43:21,068 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 13:43:21,068 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 13:43:21,068 INFO L82 PathProgramCache]: Analyzing trace with hash -429538228, now seen corresponding path program 3 times [2018-02-04 13:43:21,069 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:43:21,069 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:43:21,069 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:43:21,070 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 13:43:21,070 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:43:21,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:43:21,081 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:43:21,148 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 13:43:21,148 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 13:43:21,148 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 13:43:21,155 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 13:43:21,171 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-02-04 13:43:21,172 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 13:43:21,174 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 13:43:21,192 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 13:43:21,192 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 13:43:21,194 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:43:21,194 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-04 13:43:21,245 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 13:43:21,256 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 13:43:21,256 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 13:43:21,260 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 13:43:21,260 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:11 [2018-02-04 13:43:21,274 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 13:43:21,297 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 13:43:21,297 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 19 [2018-02-04 13:43:21,298 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-04 13:43:21,298 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-04 13:43:21,298 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=245, Unknown=1, NotChecked=32, Total=342 [2018-02-04 13:43:21,298 INFO L87 Difference]: Start difference. First operand 103 states and 111 transitions. Second operand 19 states. [2018-02-04 13:43:21,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:43:21,680 INFO L93 Difference]: Finished difference Result 146 states and 161 transitions. [2018-02-04 13:43:21,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-04 13:43:21,680 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 60 [2018-02-04 13:43:21,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:43:21,681 INFO L225 Difference]: With dead ends: 146 [2018-02-04 13:43:21,681 INFO L226 Difference]: Without dead ends: 146 [2018-02-04 13:43:21,682 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 13:43:21,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-02-04 13:43:21,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 115. [2018-02-04 13:43:21,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-02-04 13:43:21,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 127 transitions. [2018-02-04 13:43:21,686 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 127 transitions. Word has length 60 [2018-02-04 13:43:21,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:43:21,686 INFO L432 AbstractCegarLoop]: Abstraction has 115 states and 127 transitions. [2018-02-04 13:43:21,686 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-04 13:43:21,686 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 127 transitions. [2018-02-04 13:43:21,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-02-04 13:43:21,687 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:43:21,687 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 13:43:21,688 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 13:43:21,688 INFO L82 PathProgramCache]: Analyzing trace with hash 162408278, now seen corresponding path program 1 times [2018-02-04 13:43:21,688 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:43:21,688 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:43:21,689 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:43:21,689 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 13:43:21,689 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:43:21,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:43:21,698 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:43:21,777 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 13:43:21,777 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 13:43:21,777 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 13:43:21,782 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:43:21,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:43:21,803 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 13:43:21,885 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 13:43:21,902 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 13:43:21,903 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 21 [2018-02-04 13:43:21,903 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-04 13:43:21,903 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-04 13:43:21,903 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=246, Unknown=0, NotChecked=0, Total=420 [2018-02-04 13:43:21,904 INFO L87 Difference]: Start difference. First operand 115 states and 127 transitions. Second operand 21 states. [2018-02-04 13:43:21,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:43:21,949 INFO L93 Difference]: Finished difference Result 121 states and 133 transitions. [2018-02-04 13:43:21,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-04 13:43:21,952 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 64 [2018-02-04 13:43:21,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:43:21,953 INFO L225 Difference]: With dead ends: 121 [2018-02-04 13:43:21,953 INFO L226 Difference]: Without dead ends: 121 [2018-02-04 13:43:21,953 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=174, Invalid=246, Unknown=0, NotChecked=0, Total=420 [2018-02-04 13:43:21,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-02-04 13:43:21,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 119. [2018-02-04 13:43:21,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-02-04 13:43:21,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 131 transitions. [2018-02-04 13:43:21,955 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 131 transitions. Word has length 64 [2018-02-04 13:43:21,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:43:21,955 INFO L432 AbstractCegarLoop]: Abstraction has 119 states and 131 transitions. [2018-02-04 13:43:21,955 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-04 13:43:21,955 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 131 transitions. [2018-02-04 13:43:21,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-02-04 13:43:21,956 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:43:21,956 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 13:43:21,956 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 13:43:21,956 INFO L82 PathProgramCache]: Analyzing trace with hash -1131684385, now seen corresponding path program 2 times [2018-02-04 13:43:21,956 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:43:21,956 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:43:21,957 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:43:21,957 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:43:21,957 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:43:21,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:43:21,965 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:43:22,081 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 13:43:22,081 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 13:43:22,082 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 13:43:22,091 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 13:43:22,115 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 13:43:22,115 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 13:43:22,118 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 13:43:22,216 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 13:43:22,246 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 13:43:22,246 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 23 [2018-02-04 13:43:22,246 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-04 13:43:22,247 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-04 13:43:22,247 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=208, Invalid=298, Unknown=0, NotChecked=0, Total=506 [2018-02-04 13:43:22,247 INFO L87 Difference]: Start difference. First operand 119 states and 131 transitions. Second operand 23 states. [2018-02-04 13:43:22,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:43:22,320 INFO L93 Difference]: Finished difference Result 125 states and 137 transitions. [2018-02-04 13:43:22,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-04 13:43:22,320 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 68 [2018-02-04 13:43:22,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:43:22,321 INFO L225 Difference]: With dead ends: 125 [2018-02-04 13:43:22,321 INFO L226 Difference]: Without dead ends: 125 [2018-02-04 13:43:22,321 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 13:43:22,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-02-04 13:43:22,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 123. [2018-02-04 13:43:22,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-02-04 13:43:22,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 135 transitions. [2018-02-04 13:43:22,323 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 135 transitions. Word has length 68 [2018-02-04 13:43:22,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:43:22,323 INFO L432 AbstractCegarLoop]: Abstraction has 123 states and 135 transitions. [2018-02-04 13:43:22,323 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-04 13:43:22,323 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 135 transitions. [2018-02-04 13:43:22,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-02-04 13:43:22,324 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:43:22,324 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 13:43:22,324 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 13:43:22,324 INFO L82 PathProgramCache]: Analyzing trace with hash -987158552, now seen corresponding path program 3 times [2018-02-04 13:43:22,324 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:43:22,324 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:43:22,325 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:43:22,325 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 13:43:22,325 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:43:22,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:43:22,338 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:43:22,728 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 13:43:22,728 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 13:43:22,728 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 13:43:22,733 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 13:43:22,762 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-02-04 13:43:22,763 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 13:43:22,765 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 13:43:22,789 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 13:43:22,789 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 13:43:22,802 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 13:43:22,802 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:43:22,815 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 13:43:22,815 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 13:43:22,816 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 13:43:22,817 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 13:43:22,828 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 13:43:22,828 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:50, output treesize:46 [2018-02-04 13:43:23,103 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:43:23,106 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 13:43:23,107 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 13:43:23,128 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:43:23,128 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:43:23,129 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 13:43:23,129 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:43:23,148 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:43:23,149 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:43:23,150 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 13:43:23,150 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 13:43:23,171 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:43:23,171 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:43:23,172 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 13:43:23,172 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 13:43:23,189 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 13:43:23,189 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:73, output treesize:55 [2018-02-04 13:43:23,250 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 13:43:23,268 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 13:43:23,268 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 12] total 26 [2018-02-04 13:43:23,268 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-02-04 13:43:23,268 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-02-04 13:43:23,268 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=633, Unknown=1, NotChecked=0, Total=702 [2018-02-04 13:43:23,269 INFO L87 Difference]: Start difference. First operand 123 states and 135 transitions. Second operand 27 states. [2018-02-04 13:43:46,127 WARN L143 SmtUtils]: Spent 14134ms on a formula simplification that was a NOOP. DAG size: 52 [2018-02-04 13:44:12,526 WARN L146 SmtUtils]: Spent 26342ms on a formula simplification. DAG size of input: 56 DAG size of output 56 [2018-02-04 13:44:12,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:44:12,736 INFO L93 Difference]: Finished difference Result 215 states and 242 transitions. [2018-02-04 13:44:12,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-04 13:44:12,737 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 72 [2018-02-04 13:44:12,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:44:12,737 INFO L225 Difference]: With dead ends: 215 [2018-02-04 13:44:12,737 INFO L226 Difference]: Without dead ends: 215 [2018-02-04 13:44:12,738 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 63 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 325 ImplicationChecksByTransitivity, 41.7s TimeCoverageRelationStatistics Valid=197, Invalid=1521, Unknown=4, NotChecked=0, Total=1722 [2018-02-04 13:44:12,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2018-02-04 13:44:12,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 138. [2018-02-04 13:44:12,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-02-04 13:44:12,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 156 transitions. [2018-02-04 13:44:12,743 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 156 transitions. Word has length 72 [2018-02-04 13:44:12,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:44:12,743 INFO L432 AbstractCegarLoop]: Abstraction has 138 states and 156 transitions. [2018-02-04 13:44:12,743 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-02-04 13:44:12,743 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 156 transitions. [2018-02-04 13:44:12,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-02-04 13:44:12,744 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:44:12,744 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 13:44:12,744 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 13:44:12,745 INFO L82 PathProgramCache]: Analyzing trace with hash -262763435, now seen corresponding path program 1 times [2018-02-04 13:44:12,745 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:44:12,745 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:44:12,746 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:44:12,746 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 13:44:12,746 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:44:12,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:44:12,758 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:44:12,789 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 13:44:12,789 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 13:44:12,789 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 13:44:12,790 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 13:44:12,790 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 13:44:12,790 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 13:44:12,790 INFO L87 Difference]: Start difference. First operand 138 states and 156 transitions. Second operand 4 states. [2018-02-04 13:44:12,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:44:12,814 INFO L93 Difference]: Finished difference Result 145 states and 162 transitions. [2018-02-04 13:44:12,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 13:44:12,814 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 73 [2018-02-04 13:44:12,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:44:12,815 INFO L225 Difference]: With dead ends: 145 [2018-02-04 13:44:12,815 INFO L226 Difference]: Without dead ends: 145 [2018-02-04 13:44:12,816 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 13:44:12,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-02-04 13:44:12,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 141. [2018-02-04 13:44:12,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-02-04 13:44:12,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 158 transitions. [2018-02-04 13:44:12,820 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 158 transitions. Word has length 73 [2018-02-04 13:44:12,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:44:12,821 INFO L432 AbstractCegarLoop]: Abstraction has 141 states and 158 transitions. [2018-02-04 13:44:12,821 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 13:44:12,821 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 158 transitions. [2018-02-04 13:44:12,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-02-04 13:44:12,822 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:44:12,822 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 13:44:12,822 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 13:44:12,822 INFO L82 PathProgramCache]: Analyzing trace with hash 1862067708, now seen corresponding path program 1 times [2018-02-04 13:44:12,822 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:44:12,822 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:44:12,823 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:44:12,823 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:44:12,824 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:44:12,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:44:12,836 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:44:12,956 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 13:44:12,956 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 13:44:12,956 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 13:44:12,962 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:44:12,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:44:12,989 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 13:44:13,090 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 13:44:13,118 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 13:44:13,118 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 6] total 16 [2018-02-04 13:44:13,118 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-04 13:44:13,118 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-04 13:44:13,118 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2018-02-04 13:44:13,118 INFO L87 Difference]: Start difference. First operand 141 states and 158 transitions. Second operand 16 states. [2018-02-04 13:44:13,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:44:13,463 INFO L93 Difference]: Finished difference Result 193 states and 215 transitions. [2018-02-04 13:44:13,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-04 13:44:13,464 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 79 [2018-02-04 13:44:13,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:44:13,464 INFO L225 Difference]: With dead ends: 193 [2018-02-04 13:44:13,465 INFO L226 Difference]: Without dead ends: 193 [2018-02-04 13:44:13,465 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=213, Invalid=909, Unknown=0, NotChecked=0, Total=1122 [2018-02-04 13:44:13,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2018-02-04 13:44:13,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 138. [2018-02-04 13:44:13,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-02-04 13:44:13,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 152 transitions. [2018-02-04 13:44:13,468 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 152 transitions. Word has length 79 [2018-02-04 13:44:13,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:44:13,489 INFO L432 AbstractCegarLoop]: Abstraction has 138 states and 152 transitions. [2018-02-04 13:44:13,489 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-04 13:44:13,490 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 152 transitions. [2018-02-04 13:44:13,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-02-04 13:44:13,490 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:44:13,490 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 13:44:13,490 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 13:44:13,490 INFO L82 PathProgramCache]: Analyzing trace with hash 449519656, now seen corresponding path program 1 times [2018-02-04 13:44:13,490 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:44:13,490 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:44:13,491 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:44:13,491 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:44:13,491 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:44:13,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:44:13,498 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:44:13,546 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 13:44:13,546 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 13:44:13,546 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 13:44:13,553 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:44:13,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:44:13,575 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 13:44:13,577 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 13:44:13,577 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 13:44:13,578 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:44:13,578 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-04 13:44:13,595 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 13:44:13,612 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 13:44:13,612 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-02-04 13:44:13,613 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 13:44:13,613 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 13:44:13,613 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-02-04 13:44:13,613 INFO L87 Difference]: Start difference. First operand 138 states and 152 transitions. Second operand 9 states. [2018-02-04 13:44:13,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:44:13,724 INFO L93 Difference]: Finished difference Result 163 states and 179 transitions. [2018-02-04 13:44:13,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-04 13:44:13,724 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 81 [2018-02-04 13:44:13,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:44:13,725 INFO L225 Difference]: With dead ends: 163 [2018-02-04 13:44:13,725 INFO L226 Difference]: Without dead ends: 163 [2018-02-04 13:44:13,725 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 13:44:13,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2018-02-04 13:44:13,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 152. [2018-02-04 13:44:13,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-02-04 13:44:13,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 169 transitions. [2018-02-04 13:44:13,728 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 169 transitions. Word has length 81 [2018-02-04 13:44:13,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:44:13,728 INFO L432 AbstractCegarLoop]: Abstraction has 152 states and 169 transitions. [2018-02-04 13:44:13,728 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 13:44:13,728 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 169 transitions. [2018-02-04 13:44:13,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-02-04 13:44:13,728 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:44:13,728 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 13:44:13,728 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 13:44:13,729 INFO L82 PathProgramCache]: Analyzing trace with hash 449519657, now seen corresponding path program 1 times [2018-02-04 13:44:13,729 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:44:13,729 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:44:13,729 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:44:13,729 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:44:13,729 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:44:13,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:44:13,740 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:44:13,885 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 13:44:13,886 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 13:44:13,886 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 13:44:13,891 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:44:13,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:44:13,917 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 13:44:13,933 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 13:44:13,934 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 13:44:13,950 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 13:44:13,950 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:44:13,961 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 13:44:13,961 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:30 [2018-02-04 13:44:19,335 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 13:44:19,353 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 13:44:19,353 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 20] total 30 [2018-02-04 13:44:19,354 INFO L409 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-02-04 13:44:19,354 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-02-04 13:44:19,354 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=816, Unknown=2, NotChecked=0, Total=930 [2018-02-04 13:44:19,354 INFO L87 Difference]: Start difference. First operand 152 states and 169 transitions. Second operand 31 states. [2018-02-04 13:44:59,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:44:59,087 INFO L93 Difference]: Finished difference Result 175 states and 191 transitions. [2018-02-04 13:44:59,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-02-04 13:44:59,091 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 81 [2018-02-04 13:44:59,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:44:59,092 INFO L225 Difference]: With dead ends: 175 [2018-02-04 13:44:59,092 INFO L226 Difference]: Without dead ends: 175 [2018-02-04 13:44:59,093 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 66 SyntacticMatches, 1 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 567 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=544, Invalid=2994, Unknown=2, NotChecked=0, Total=3540 [2018-02-04 13:44:59,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2018-02-04 13:44:59,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 160. [2018-02-04 13:44:59,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2018-02-04 13:44:59,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 180 transitions. [2018-02-04 13:44:59,097 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 180 transitions. Word has length 81 [2018-02-04 13:44:59,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:44:59,098 INFO L432 AbstractCegarLoop]: Abstraction has 160 states and 180 transitions. [2018-02-04 13:44:59,098 INFO L433 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-02-04 13:44:59,098 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 180 transitions. [2018-02-04 13:44:59,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-02-04 13:44:59,098 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:44:59,098 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 13:44:59,099 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 13:44:59,099 INFO L82 PathProgramCache]: Analyzing trace with hash 1050207497, now seen corresponding path program 1 times [2018-02-04 13:44:59,099 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:44:59,099 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:44:59,100 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:44:59,100 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:44:59,100 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:44:59,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:44:59,121 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:44:59,999 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 13:45:00,000 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 13:45:00,000 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 13:45:00,005 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:45:00,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:45:00,025 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 13:45:00,070 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 13:45:00,071 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 13:45:00,071 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:45:00,072 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:45:00,075 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:45:00,076 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:18 [2018-02-04 13:45:00,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 23 treesize of output 18 [2018-02-04 13:45:00,121 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:45:00,121 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 13:45:00,121 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:45:00,124 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:45:00,127 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:45:00,128 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:25 [2018-02-04 13:45:00,170 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 13:45:00,176 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:45:00,177 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:45:00,177 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:45:00,178 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 13:45:00,178 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:45:00,187 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:45:00,192 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:45:00,192 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:38, output treesize:34 [2018-02-04 13:45:00,254 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 13:45:00,256 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:45:00,256 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:45:00,257 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:45:00,257 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:45:00,258 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:45:00,259 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:45:00,259 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 13:45:00,260 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:45:00,269 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:45:00,275 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 13:45:00,275 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:54, output treesize:50 [2018-02-04 13:45:00,357 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 13:45:00,359 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:45:00,359 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:45:00,360 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:45:00,361 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:45:00,361 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:45:00,362 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:45:00,362 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:45:00,363 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:45:00,363 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:45:00,364 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:45:00,364 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 13:45:00,365 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:45:00,378 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:45:00,387 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 13:45:00,387 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:70, output treesize:66 [2018-02-04 13:45:00,489 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 13:45:00,491 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:45:00,492 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:45:00,493 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:45:00,494 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:45:00,494 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:45:00,495 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:45:00,496 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:45:00,496 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:45:00,497 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:45:00,498 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:45:00,498 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:45:00,499 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:45:00,500 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:45:00,501 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:45:00,501 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:45:00,502 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 13:45:00,503 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:45:00,527 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:45:00,539 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 13:45:00,539 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:86, output treesize:82 [2018-02-04 13:45:00,655 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 13:45:00,658 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:45:00,658 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:45:00,659 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:45:00,660 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:45:00,660 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:45:00,661 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:45:00,662 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:45:00,662 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:45:00,663 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:45:00,664 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:45:00,664 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:45:00,665 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:45:00,666 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:45:00,666 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:45:00,667 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:45:00,667 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:45:00,668 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:45:00,668 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:45:00,669 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:45:00,670 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:45:00,670 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:45:00,671 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 13:45:00,672 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:45:00,701 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:45:00,715 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 13:45:00,716 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:102, output treesize:98 [2018-02-04 13:45:00,942 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 13:45:00,960 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:45:00,961 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:45:00,962 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:45:00,963 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:45:00,963 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:45:00,964 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:45:00,965 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:45:00,966 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:45:00,967 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:45:00,968 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:45:00,969 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:45:00,970 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:45:00,971 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:45:00,972 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:45:00,973 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:45:00,973 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:45:00,974 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:45:00,975 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:45:00,976 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:45:00,977 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:45:00,978 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:45:00,979 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:45:00,980 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:45:00,981 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:45:00,982 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:45:00,983 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:45:00,984 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:45:00,985 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:45:00,986 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 13:45:00,987 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:45:01,055 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:45:01,084 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 13:45:01,084 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:118, output treesize:114 [2018-02-04 13:45:02,412 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 13:45:02,452 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:45:02,453 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:45:02,454 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:45:02,454 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:45:02,455 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:45:02,456 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:45:02,457 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:45:02,458 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:45:02,458 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:45:02,463 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:45:02,464 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:45:02,465 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:45:02,465 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:45:02,466 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:45:02,467 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:45:02,468 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:45:02,468 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:45:02,469 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:45:02,470 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:45:02,471 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:45:02,471 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:45:02,472 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:45:02,473 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:45:02,474 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:45:02,474 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:45:02,475 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:45:02,476 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:45:02,476 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:45:02,477 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:45:02,478 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:45:02,479 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:45:02,479 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:45:02,480 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:45:02,481 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:45:02,481 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:45:02,482 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:45:02,483 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 13:45:02,484 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:45:02,563 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:45:02,621 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 13:45:02,622 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:134, output treesize:130 [2018-02-04 13:45:13,555 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 13:45:13,559 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:45:13,559 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:45:13,560 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:45:13,561 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:45:13,561 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:45:13,562 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:45:13,563 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:45:13,563 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:45:13,564 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:45:13,564 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:45:13,565 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:45:13,566 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:45:13,566 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:45:13,567 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:45:13,567 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:45:13,568 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:45:13,568 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:45:13,569 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:45:13,569 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:45:13,578 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:45:13,579 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:45:13,580 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:45:13,580 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:45:13,581 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:45:13,581 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:45:13,582 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:45:13,583 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:45:13,583 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:45:13,584 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:45:13,584 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:45:13,585 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:45:13,586 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:45:13,586 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:45:13,587 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:45:13,587 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:45:13,588 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:45:13,589 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:45:13,589 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:45:13,590 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:45:13,591 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:45:13,591 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:45:13,592 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:45:13,592 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:45:13,593 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:45:13,593 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:45:13,595 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 13:45:13,596 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:45:13,674 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:45:13,699 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 13:45:13,699 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:150, output treesize:146 [2018-02-04 13:45:43,489 WARN L143 SmtUtils]: Spent 2023ms on a formula simplification that was a NOOP. DAG size: 72 [2018-02-04 13:45:45,680 WARN L143 SmtUtils]: Spent 2096ms on a formula simplification that was a NOOP. DAG size: 72 [2018-02-04 13:45:47,766 WARN L143 SmtUtils]: Spent 2028ms on a formula simplification that was a NOOP. DAG size: 65 [2018-02-04 13:45:47,773 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 13:45:47,775 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:45:47,776 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:45:47,777 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:45:47,777 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:45:47,778 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:45:47,779 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:45:47,779 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:45:47,780 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:45:47,780 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:45:47,781 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:45:47,781 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:45:47,782 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:45:47,782 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:45:47,783 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:45:47,783 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:45:47,784 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:45:47,784 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:45:47,785 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:45:47,785 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:45:47,786 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:45:47,786 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:45:47,787 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:45:47,787 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:45:47,788 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:45:47,788 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:45:47,789 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:45:47,789 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:45:47,790 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:45:47,790 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:45:47,791 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:45:47,791 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:45:47,792 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:45:47,792 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:45:47,793 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:45:47,793 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:45:47,794 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:45:47,794 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:45:47,795 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:45:47,795 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:45:47,796 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:45:47,796 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:45:47,797 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:45:47,797 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:45:47,798 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:45:47,799 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 13:45:47,799 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:45:47,846 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:45:47,854 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 13:45:47,854 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 10 variables, input treesize:132, output treesize:3 [2018-02-04 13:45:47,898 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 13:45:47,915 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 13:45:47,915 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 29] total 47 [2018-02-04 13:45:47,916 INFO L409 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-02-04 13:45:47,916 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-02-04 13:45:47,916 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=385, Invalid=1853, Unknown=18, NotChecked=0, Total=2256 [2018-02-04 13:45:47,916 INFO L87 Difference]: Start difference. First operand 160 states and 180 transitions. Second operand 48 states. Received shutdown request... [2018-02-04 13:46:58,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-02-04 13:46:58,347 WARN L491 AbstractCegarLoop]: Verification canceled [2018-02-04 13:46:58,350 WARN L185 ceAbstractionStarter]: Timeout [2018-02-04 13:46:58,350 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.02 01:46:58 BoogieIcfgContainer [2018-02-04 13:46:58,350 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-04 13:46:58,351 INFO L168 Benchmark]: Toolchain (without parser) took 220925.63 ms. Allocated memory was 403.7 MB in the beginning and 727.7 MB in the end (delta: 324.0 MB). Free memory was 360.6 MB in the beginning and 492.2 MB in the end (delta: -131.7 MB). Peak memory consumption was 192.4 MB. Max. memory is 5.3 GB. [2018-02-04 13:46:58,351 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 403.7 MB. Free memory is still 365.9 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 13:46:58,352 INFO L168 Benchmark]: CACSL2BoogieTranslator took 157.88 ms. Allocated memory is still 403.7 MB. Free memory was 360.6 MB in the beginning and 347.4 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 5.3 GB. [2018-02-04 13:46:58,352 INFO L168 Benchmark]: Boogie Preprocessor took 30.55 ms. Allocated memory is still 403.7 MB. Free memory was 347.4 MB in the beginning and 344.7 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. [2018-02-04 13:46:58,352 INFO L168 Benchmark]: RCFGBuilder took 249.69 ms. Allocated memory is still 403.7 MB. Free memory was 344.7 MB in the beginning and 322.5 MB in the end (delta: 22.2 MB). Peak memory consumption was 22.2 MB. Max. memory is 5.3 GB. [2018-02-04 13:46:58,352 INFO L168 Benchmark]: TraceAbstraction took 220484.84 ms. Allocated memory was 403.7 MB in the beginning and 727.7 MB in the end (delta: 324.0 MB). Free memory was 322.5 MB in the beginning and 492.2 MB in the end (delta: -169.7 MB). Peak memory consumption was 154.3 MB. Max. memory is 5.3 GB. [2018-02-04 13:46:58,353 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.20 ms. Allocated memory is still 403.7 MB. Free memory is still 365.9 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 157.88 ms. Allocated memory is still 403.7 MB. Free memory was 360.6 MB in the beginning and 347.4 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 30.55 ms. Allocated memory is still 403.7 MB. Free memory was 347.4 MB in the beginning and 344.7 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 249.69 ms. Allocated memory is still 403.7 MB. Free memory was 344.7 MB in the beginning and 322.5 MB in the end (delta: 22.2 MB). Peak memory consumption was 22.2 MB. Max. memory is 5.3 GB. * TraceAbstraction took 220484.84 ms. Allocated memory was 403.7 MB in the beginning and 727.7 MB in the end (delta: 324.0 MB). Free memory was 322.5 MB in the beginning and 492.2 MB in the end (delta: -169.7 MB). Peak memory consumption was 154.3 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 27 states, 48 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 72 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 27 states, 48 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 72 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 27 states, 48 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 72 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 27 states, 48 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 72 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 27 states, 48 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 72 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 27 states, 48 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 72 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 27 states, 48 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 72 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 27 states, 48 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 72 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 27 states, 48 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 72 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 27 states, 48 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 72 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 27 states, 48 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 72 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 27 states, 48 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 72 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 27 states, 48 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 72 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 27 states, 48 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 72 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 27 states, 48 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 72 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 72 locations, 15 error locations. TIMEOUT Result, 220.4s OverallTime, 21 OverallIterations, 11 TraceHistogramMax, 161.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1336 SDtfs, 1494 SDslu, 8178 SDs, 0 SdLazy, 5026 SolverSat, 353 SolverUnsat, 55 SolverUnknown, 0 SolverNotchecked, 85.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1133 GetRequests, 714 SyntacticMatches, 18 SemanticMatches, 400 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 3217 ImplicationChecksByTransitivity, 126.4s 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.0s AutomataMinimizationTime, 20 MinimizatonAttempts, 305 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 57.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_13-46-58-359.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_13-46-58-359.csv Completed graceful shutdown