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_1_false-valid-memtrack.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-c17473d-m [2018-02-04 13:49:51,447 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-04 13:49:51,449 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-04 13:49:51,461 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-04 13:49:51,461 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-04 13:49:51,462 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-04 13:49:51,462 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-04 13:49:51,464 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-04 13:49:51,466 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-04 13:49:51,466 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-04 13:49:51,467 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-04 13:49:51,467 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-04 13:49:51,468 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-04 13:49:51,469 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-04 13:49:51,470 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-04 13:49:51,472 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-04 13:49:51,473 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-04 13:49:51,475 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-04 13:49:51,476 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-04 13:49:51,477 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-04 13:49:51,479 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-04 13:49:51,479 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-04 13:49:51,479 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-04 13:49:51,480 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-04 13:49:51,481 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-04 13:49:51,482 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-04 13:49:51,482 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-04 13:49:51,482 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-04 13:49:51,482 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-04 13:49:51,483 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-04 13:49:51,483 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-04 13:49:51,483 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:49:51,492 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-04 13:49:51,492 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-04 13:49:51,493 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-04 13:49:51,493 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-04 13:49:51,493 INFO L133 SettingsManager]: * Use SBE=true [2018-02-04 13:49:51,493 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-04 13:49:51,493 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-04 13:49:51,493 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-04 13:49:51,493 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-04 13:49:51,493 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-04 13:49:51,493 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-04 13:49:51,494 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-04 13:49:51,494 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-04 13:49:51,494 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-04 13:49:51,494 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-04 13:49:51,494 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-04 13:49:51,494 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-04 13:49:51,494 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-04 13:49:51,494 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-04 13:49:51,494 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 13:49:51,494 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-04 13:49:51,495 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-04 13:49:51,495 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-04 13:49:51,495 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-02-04 13:49:51,521 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-04 13:49:51,529 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-04 13:49:51,531 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-04 13:49:51,532 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-04 13:49:51,533 INFO L276 PluginConnector]: CDTParser initialized [2018-02-04 13:49:51,533 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test17_1_false-valid-memtrack.i [2018-02-04 13:49:51,676 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-04 13:49:51,677 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-04 13:49:51,677 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-04 13:49:51,677 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-04 13:49:51,681 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-04 13:49:51,682 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 01:49:51" (1/1) ... [2018-02-04 13:49:51,684 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@286f8729 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:49:51, skipping insertion in model container [2018-02-04 13:49:51,684 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 01:49:51" (1/1) ... [2018-02-04 13:49:51,694 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 13:49:51,728 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 13:49:51,825 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 13:49:51,839 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 13:49:51,845 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:49:51 WrapperNode [2018-02-04 13:49:51,845 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-04 13:49:51,846 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-04 13:49:51,846 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-04 13:49:51,846 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-04 13:49:51,856 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:49:51" (1/1) ... [2018-02-04 13:49:51,856 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:49:51" (1/1) ... [2018-02-04 13:49:51,863 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:49:51" (1/1) ... [2018-02-04 13:49:51,863 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:49:51" (1/1) ... [2018-02-04 13:49:51,867 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:49:51" (1/1) ... [2018-02-04 13:49:51,870 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:49:51" (1/1) ... [2018-02-04 13:49:51,871 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:49:51" (1/1) ... [2018-02-04 13:49:51,873 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-04 13:49:51,873 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-04 13:49:51,874 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-04 13:49:51,874 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-04 13:49:51,875 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:49:51" (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:49:51,916 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-04 13:49:51,916 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-04 13:49:51,916 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-02-04 13:49:51,916 INFO L136 BoogieDeclarations]: Found implementation of procedure alloc_17 [2018-02-04 13:49:51,916 INFO L136 BoogieDeclarations]: Found implementation of procedure free_17 [2018-02-04 13:49:51,916 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-02-04 13:49:51,916 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-04 13:49:51,917 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-04 13:49:51,917 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-04 13:49:51,917 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-04 13:49:51,917 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-04 13:49:51,917 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-04 13:49:51,917 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-04 13:49:51,917 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-04 13:49:51,917 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-04 13:49:51,917 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-02-04 13:49:51,917 INFO L128 BoogieDeclarations]: Found specification of procedure alloc_17 [2018-02-04 13:49:51,917 INFO L128 BoogieDeclarations]: Found specification of procedure free_17 [2018-02-04 13:49:51,917 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-02-04 13:49:51,917 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-04 13:49:51,918 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-04 13:49:51,918 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-04 13:49:52,129 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-04 13:49:52,129 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 01:49:52 BoogieIcfgContainer [2018-02-04 13:49:52,129 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-04 13:49:52,130 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-04 13:49:52,130 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-04 13:49:52,132 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-04 13:49:52,132 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 01:49:51" (1/3) ... [2018-02-04 13:49:52,132 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c765b65 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 01:49:52, skipping insertion in model container [2018-02-04 13:49:52,132 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:49:51" (2/3) ... [2018-02-04 13:49:52,133 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c765b65 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 01:49:52, skipping insertion in model container [2018-02-04 13:49:52,133 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 01:49:52" (3/3) ... [2018-02-04 13:49:52,134 INFO L107 eAbstractionObserver]: Analyzing ICFG memleaks_test17_1_false-valid-memtrack.i [2018-02-04 13:49:52,139 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-04 13:49:52,145 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 15 error locations. [2018-02-04 13:49:52,176 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-04 13:49:52,176 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-04 13:49:52,176 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-04 13:49:52,176 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-04 13:49:52,176 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-04 13:49:52,176 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-04 13:49:52,176 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-04 13:49:52,176 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-04 13:49:52,177 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-04 13:49:52,184 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states. [2018-02-04 13:49:52,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-04 13:49:52,190 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:49:52,191 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:49:52,191 INFO L371 AbstractCegarLoop]: === Iteration 1 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-02-04 13:49:52,194 INFO L82 PathProgramCache]: Analyzing trace with hash 76531201, now seen corresponding path program 1 times [2018-02-04 13:49:52,195 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:49:52,195 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:49:52,229 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:49:52,229 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:49:52,229 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:49:52,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:49:52,264 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:49:52,329 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:49:52,331 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 13:49:52,331 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 13:49:52,332 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 13:49:52,392 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 13:49:52,392 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 13:49:52,393 INFO L87 Difference]: Start difference. First operand 73 states. Second operand 3 states. [2018-02-04 13:49:52,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:49:52,538 INFO L93 Difference]: Finished difference Result 121 states and 141 transitions. [2018-02-04 13:49:52,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 13:49:52,540 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-02-04 13:49:52,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:49:52,551 INFO L225 Difference]: With dead ends: 121 [2018-02-04 13:49:52,552 INFO L226 Difference]: Without dead ends: 115 [2018-02-04 13:49:52,554 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:49:52,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-02-04 13:49:52,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 99. [2018-02-04 13:49:52,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-02-04 13:49:52,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 121 transitions. [2018-02-04 13:49:52,599 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 121 transitions. Word has length 17 [2018-02-04 13:49:52,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:49:52,599 INFO L432 AbstractCegarLoop]: Abstraction has 99 states and 121 transitions. [2018-02-04 13:49:52,599 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 13:49:52,599 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 121 transitions. [2018-02-04 13:49:52,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-04 13:49:52,601 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:49:52,601 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:49:52,601 INFO L371 AbstractCegarLoop]: === Iteration 2 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-02-04 13:49:52,601 INFO L82 PathProgramCache]: Analyzing trace with hash 76544328, now seen corresponding path program 1 times [2018-02-04 13:49:52,601 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:49:52,602 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:49:52,603 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:49:52,603 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:49:52,603 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:49:52,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:49:52,616 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:49:52,666 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:49:52,666 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 13:49:52,666 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 13:49:52,667 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 13:49:52,668 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 13:49:52,668 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 13:49:52,668 INFO L87 Difference]: Start difference. First operand 99 states and 121 transitions. Second operand 5 states. [2018-02-04 13:49:52,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:49:52,687 INFO L93 Difference]: Finished difference Result 94 states and 109 transitions. [2018-02-04 13:49:52,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 13:49:52,688 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-02-04 13:49:52,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:49:52,689 INFO L225 Difference]: With dead ends: 94 [2018-02-04 13:49:52,689 INFO L226 Difference]: Without dead ends: 92 [2018-02-04 13:49:52,690 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:49:52,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-02-04 13:49:52,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 72. [2018-02-04 13:49:52,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-02-04 13:49:52,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 79 transitions. [2018-02-04 13:49:52,696 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 79 transitions. Word has length 17 [2018-02-04 13:49:52,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:49:52,697 INFO L432 AbstractCegarLoop]: Abstraction has 72 states and 79 transitions. [2018-02-04 13:49:52,697 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 13:49:52,697 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 79 transitions. [2018-02-04 13:49:52,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-04 13:49:52,698 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:49:52,698 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:49:52,698 INFO L371 AbstractCegarLoop]: === Iteration 3 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-02-04 13:49:52,698 INFO L82 PathProgramCache]: Analyzing trace with hash 1178904547, now seen corresponding path program 1 times [2018-02-04 13:49:52,698 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:49:52,698 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:49:52,699 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:49:52,700 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:49:52,700 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:49:52,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:49:52,717 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:49:52,751 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:49:52,751 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 13:49:52,752 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 13:49:52,752 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 13:49:52,752 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 13:49:52,752 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 13:49:52,752 INFO L87 Difference]: Start difference. First operand 72 states and 79 transitions. Second operand 6 states. [2018-02-04 13:49:52,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:49:52,773 INFO L93 Difference]: Finished difference Result 72 states and 78 transitions. [2018-02-04 13:49:52,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 13:49:52,773 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-02-04 13:49:52,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:49:52,773 INFO L225 Difference]: With dead ends: 72 [2018-02-04 13:49:52,774 INFO L226 Difference]: Without dead ends: 72 [2018-02-04 13:49:52,774 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:49:52,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-02-04 13:49:52,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2018-02-04 13:49:52,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-02-04 13:49:52,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 78 transitions. [2018-02-04 13:49:52,778 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 78 transitions. Word has length 19 [2018-02-04 13:49:52,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:49:52,779 INFO L432 AbstractCegarLoop]: Abstraction has 72 states and 78 transitions. [2018-02-04 13:49:52,779 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 13:49:52,779 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 78 transitions. [2018-02-04 13:49:52,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-04 13:49:52,779 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:49:52,780 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:49:52,780 INFO L371 AbstractCegarLoop]: === Iteration 4 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-02-04 13:49:52,780 INFO L82 PathProgramCache]: Analyzing trace with hash 1178917674, now seen corresponding path program 1 times [2018-02-04 13:49:52,780 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:49:52,780 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:49:52,782 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:49:52,782 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:49:52,782 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:49:52,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:49:52,793 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:49:52,828 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:49:52,828 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 13:49:52,828 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 13:49:52,829 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 13:49:52,829 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 13:49:52,829 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 13:49:52,829 INFO L87 Difference]: Start difference. First operand 72 states and 78 transitions. Second operand 6 states. [2018-02-04 13:49:52,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:49:52,908 INFO L93 Difference]: Finished difference Result 71 states and 77 transitions. [2018-02-04 13:49:52,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 13:49:52,909 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-02-04 13:49:52,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:49:52,910 INFO L225 Difference]: With dead ends: 71 [2018-02-04 13:49:52,910 INFO L226 Difference]: Without dead ends: 71 [2018-02-04 13:49:52,910 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:49:52,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-02-04 13:49:52,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2018-02-04 13:49:52,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-02-04 13:49:52,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 77 transitions. [2018-02-04 13:49:52,915 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 77 transitions. Word has length 19 [2018-02-04 13:49:52,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:49:52,915 INFO L432 AbstractCegarLoop]: Abstraction has 71 states and 77 transitions. [2018-02-04 13:49:52,915 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 13:49:52,915 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 77 transitions. [2018-02-04 13:49:52,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-04 13:49:52,916 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:49:52,916 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:49:52,916 INFO L371 AbstractCegarLoop]: === Iteration 5 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-02-04 13:49:52,916 INFO L82 PathProgramCache]: Analyzing trace with hash 1178917675, now seen corresponding path program 1 times [2018-02-04 13:49:52,916 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:49:52,916 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:49:52,918 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:49:52,918 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:49:52,918 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:49:52,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:49:52,934 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:49:53,102 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:49:53,102 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 13:49:53,102 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-04 13:49:53,102 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 13:49:53,103 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 13:49:53,103 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-02-04 13:49:53,103 INFO L87 Difference]: Start difference. First operand 71 states and 77 transitions. Second operand 9 states. [2018-02-04 13:49:53,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:49:53,287 INFO L93 Difference]: Finished difference Result 75 states and 81 transitions. [2018-02-04 13:49:53,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 13:49:53,291 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 19 [2018-02-04 13:49:53,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:49:53,292 INFO L225 Difference]: With dead ends: 75 [2018-02-04 13:49:53,292 INFO L226 Difference]: Without dead ends: 75 [2018-02-04 13:49:53,293 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:49:53,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-02-04 13:49:53,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 74. [2018-02-04 13:49:53,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-02-04 13:49:53,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 80 transitions. [2018-02-04 13:49:53,297 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 80 transitions. Word has length 19 [2018-02-04 13:49:53,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:49:53,297 INFO L432 AbstractCegarLoop]: Abstraction has 74 states and 80 transitions. [2018-02-04 13:49:53,297 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 13:49:53,297 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 80 transitions. [2018-02-04 13:49:53,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-04 13:49:53,298 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:49:53,298 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:49:53,298 INFO L371 AbstractCegarLoop]: === Iteration 6 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-02-04 13:49:53,298 INFO L82 PathProgramCache]: Analyzing trace with hash -1797942142, now seen corresponding path program 1 times [2018-02-04 13:49:53,299 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:49:53,299 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:49:53,300 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:49:53,300 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:49:53,300 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:49:53,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:49:53,312 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:49:53,493 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:49:53,493 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 13:49:53,493 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:49:53,502 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:49:53,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:49:53,528 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 13:49:53,584 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:49:53,586 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 13:49:53,602 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:49:53,602 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:49:53,618 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 13:49:53,618 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:36 [2018-02-04 13:49:53,848 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:49:53,865 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 13:49:53,865 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 17 [2018-02-04 13:49:53,866 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-04 13:49:53,866 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-04 13:49:53,866 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2018-02-04 13:49:53,866 INFO L87 Difference]: Start difference. First operand 74 states and 80 transitions. Second operand 18 states. [2018-02-04 13:49:54,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:49:54,113 INFO L93 Difference]: Finished difference Result 79 states and 85 transitions. [2018-02-04 13:49:54,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 13:49:54,114 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 23 [2018-02-04 13:49:54,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:49:54,114 INFO L225 Difference]: With dead ends: 79 [2018-02-04 13:49:54,115 INFO L226 Difference]: Without dead ends: 79 [2018-02-04 13:49:54,115 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 14 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=91, Invalid=461, Unknown=0, NotChecked=0, Total=552 [2018-02-04 13:49:54,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-02-04 13:49:54,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 78. [2018-02-04 13:49:54,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-02-04 13:49:54,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 84 transitions. [2018-02-04 13:49:54,119 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 84 transitions. Word has length 23 [2018-02-04 13:49:54,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:49:54,119 INFO L432 AbstractCegarLoop]: Abstraction has 78 states and 84 transitions. [2018-02-04 13:49:54,120 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-04 13:49:54,120 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 84 transitions. [2018-02-04 13:49:54,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-02-04 13:49:54,120 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:49:54,120 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:49:54,120 INFO L371 AbstractCegarLoop]: === Iteration 7 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-02-04 13:49:54,121 INFO L82 PathProgramCache]: Analyzing trace with hash 1328269913, now seen corresponding path program 2 times [2018-02-04 13:49:54,121 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:49:54,121 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:49:54,122 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:49:54,122 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:49:54,122 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:49:54,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:49:54,134 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:49:54,337 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 13:49:54,337 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 13:49:54,337 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:49:54,344 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 13:49:54,361 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 13:49:54,361 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 13:49:54,363 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 13:49:54,383 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:49:54,383 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 13:49:54,394 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:49:54,394 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:49:54,407 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 13:49:54,407 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:36 [2018-02-04 13:49:54,531 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 13:49:54,548 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 13:49:54,548 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 21 [2018-02-04 13:49:54,549 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-04 13:49:54,549 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-04 13:49:54,549 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=404, Unknown=0, NotChecked=0, Total=462 [2018-02-04 13:49:54,549 INFO L87 Difference]: Start difference. First operand 78 states and 84 transitions. Second operand 22 states. [2018-02-04 13:49:54,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:49:54,945 INFO L93 Difference]: Finished difference Result 84 states and 90 transitions. [2018-02-04 13:49:54,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-04 13:49:54,946 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 27 [2018-02-04 13:49:54,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:49:54,947 INFO L225 Difference]: With dead ends: 84 [2018-02-04 13:49:54,947 INFO L226 Difference]: Without dead ends: 84 [2018-02-04 13:49:54,948 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=152, Invalid=778, Unknown=0, NotChecked=0, Total=930 [2018-02-04 13:49:54,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-02-04 13:49:54,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2018-02-04 13:49:54,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-02-04 13:49:54,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 90 transitions. [2018-02-04 13:49:54,951 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 90 transitions. Word has length 27 [2018-02-04 13:49:54,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:49:54,952 INFO L432 AbstractCegarLoop]: Abstraction has 84 states and 90 transitions. [2018-02-04 13:49:54,952 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-04 13:49:54,952 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 90 transitions. [2018-02-04 13:49:54,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-02-04 13:49:54,953 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:49:54,953 INFO L351 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 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:49:54,953 INFO L371 AbstractCegarLoop]: === Iteration 8 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-02-04 13:49:54,954 INFO L82 PathProgramCache]: Analyzing trace with hash -1407021697, now seen corresponding path program 1 times [2018-02-04 13:49:54,954 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:49:54,954 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:49:54,955 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:49:54,955 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 13:49:54,955 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:49:54,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:49:54,968 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:49:55,013 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2018-02-04 13:49:55,013 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 13:49:55,013 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 13:49:55,013 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 13:49:55,014 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 13:49:55,014 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 13:49:55,014 INFO L87 Difference]: Start difference. First operand 84 states and 90 transitions. Second operand 5 states. [2018-02-04 13:49:55,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:49:55,022 INFO L93 Difference]: Finished difference Result 88 states and 94 transitions. [2018-02-04 13:49:55,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 13:49:55,023 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 46 [2018-02-04 13:49:55,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:49:55,023 INFO L225 Difference]: With dead ends: 88 [2018-02-04 13:49:55,023 INFO L226 Difference]: Without dead ends: 88 [2018-02-04 13:49:55,023 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:49:55,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-02-04 13:49:55,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 86. [2018-02-04 13:49:55,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-02-04 13:49:55,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 92 transitions. [2018-02-04 13:49:55,027 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 92 transitions. Word has length 46 [2018-02-04 13:49:55,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:49:55,028 INFO L432 AbstractCegarLoop]: Abstraction has 86 states and 92 transitions. [2018-02-04 13:49:55,028 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 13:49:55,028 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 92 transitions. [2018-02-04 13:49:55,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-02-04 13:49:55,029 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:49:55,029 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, 1, 1, 1, 1, 1] [2018-02-04 13:49:55,029 INFO L371 AbstractCegarLoop]: === Iteration 9 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-02-04 13:49:55,029 INFO L82 PathProgramCache]: Analyzing trace with hash 1586719882, now seen corresponding path program 1 times [2018-02-04 13:49:55,030 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:49:55,030 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:49:55,030 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:49:55,031 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:49:55,031 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:49:55,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:49:55,040 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:49:55,073 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-02-04 13:49:55,073 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 13:49:55,074 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 13:49:55,074 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 13:49:55,074 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 13:49:55,074 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 13:49:55,074 INFO L87 Difference]: Start difference. First operand 86 states and 92 transitions. Second operand 6 states. [2018-02-04 13:49:55,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:49:55,193 INFO L93 Difference]: Finished difference Result 128 states and 141 transitions. [2018-02-04 13:49:55,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 13:49:55,194 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 47 [2018-02-04 13:49:55,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:49:55,195 INFO L225 Difference]: With dead ends: 128 [2018-02-04 13:49:55,195 INFO L226 Difference]: Without dead ends: 128 [2018-02-04 13:49:55,195 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-02-04 13:49:55,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-02-04 13:49:55,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 110. [2018-02-04 13:49:55,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-02-04 13:49:55,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 124 transitions. [2018-02-04 13:49:55,201 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 124 transitions. Word has length 47 [2018-02-04 13:49:55,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:49:55,201 INFO L432 AbstractCegarLoop]: Abstraction has 110 states and 124 transitions. [2018-02-04 13:49:55,201 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 13:49:55,201 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 124 transitions. [2018-02-04 13:49:55,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-02-04 13:49:55,202 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:49:55,203 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, 1, 1, 1, 1, 1] [2018-02-04 13:49:55,203 INFO L371 AbstractCegarLoop]: === Iteration 10 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-02-04 13:49:55,203 INFO L82 PathProgramCache]: Analyzing trace with hash 1586719883, now seen corresponding path program 1 times [2018-02-04 13:49:55,203 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:49:55,203 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:49:55,204 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:49:55,204 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:49:55,204 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:49:55,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:49:55,215 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:49:55,269 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:49:55,269 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 13:49:55,269 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:49:55,275 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:49:55,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:49:55,295 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 13:49:55,352 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:49:55,385 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 13:49:55,385 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2018-02-04 13:49:55,385 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-04 13:49:55,385 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-04 13:49:55,386 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2018-02-04 13:49:55,386 INFO L87 Difference]: Start difference. First operand 110 states and 124 transitions. Second operand 13 states. [2018-02-04 13:49:55,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:49:55,419 INFO L93 Difference]: Finished difference Result 116 states and 130 transitions. [2018-02-04 13:49:55,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 13:49:55,419 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 47 [2018-02-04 13:49:55,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:49:55,420 INFO L225 Difference]: With dead ends: 116 [2018-02-04 13:49:55,420 INFO L226 Difference]: Without dead ends: 116 [2018-02-04 13:49:55,420 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2018-02-04 13:49:55,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-02-04 13:49:55,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 114. [2018-02-04 13:49:55,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-02-04 13:49:55,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 128 transitions. [2018-02-04 13:49:55,423 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 128 transitions. Word has length 47 [2018-02-04 13:49:55,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:49:55,423 INFO L432 AbstractCegarLoop]: Abstraction has 114 states and 128 transitions. [2018-02-04 13:49:55,424 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-04 13:49:55,424 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 128 transitions. [2018-02-04 13:49:55,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-02-04 13:49:55,424 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:49:55,424 INFO L351 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 1, 1, 1, 1, 1, 1, 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:49:55,424 INFO L371 AbstractCegarLoop]: === Iteration 11 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-02-04 13:49:55,424 INFO L82 PathProgramCache]: Analyzing trace with hash -76853918, now seen corresponding path program 2 times [2018-02-04 13:49:55,425 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:49:55,425 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:49:55,425 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:49:55,425 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:49:55,425 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:49:55,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:49:55,433 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:49:55,480 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 13:49:55,481 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 13:49:55,481 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:49:55,486 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 13:49:55,501 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-02-04 13:49:55,501 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 13:49:55,503 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 13:49:55,525 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2018-02-04 13:49:55,544 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-02-04 13:49:55,545 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 11 [2018-02-04 13:49:55,545 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 13:49:55,545 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 13:49:55,545 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2018-02-04 13:49:55,546 INFO L87 Difference]: Start difference. First operand 114 states and 128 transitions. Second operand 11 states. [2018-02-04 13:49:55,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:49:55,663 INFO L93 Difference]: Finished difference Result 145 states and 160 transitions. [2018-02-04 13:49:55,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-04 13:49:55,663 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 51 [2018-02-04 13:49:55,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:49:55,664 INFO L225 Difference]: With dead ends: 145 [2018-02-04 13:49:55,664 INFO L226 Difference]: Without dead ends: 142 [2018-02-04 13:49:55,665 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=84, Invalid=188, Unknown=0, NotChecked=0, Total=272 [2018-02-04 13:49:55,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2018-02-04 13:49:55,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 117. [2018-02-04 13:49:55,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-02-04 13:49:55,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 130 transitions. [2018-02-04 13:49:55,669 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 130 transitions. Word has length 51 [2018-02-04 13:49:55,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:49:55,669 INFO L432 AbstractCegarLoop]: Abstraction has 117 states and 130 transitions. [2018-02-04 13:49:55,669 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 13:49:55,669 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 130 transitions. [2018-02-04 13:49:55,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-02-04 13:49:55,671 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:49:55,671 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:49:55,671 INFO L371 AbstractCegarLoop]: === Iteration 12 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-02-04 13:49:55,671 INFO L82 PathProgramCache]: Analyzing trace with hash 245448947, now seen corresponding path program 1 times [2018-02-04 13:49:55,671 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:49:55,671 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:49:55,672 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:49:55,672 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 13:49:55,672 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:49:55,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:49:55,684 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:49:55,753 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:49:55,754 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 13:49:55,754 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:49:55,764 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:49:55,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:49:55,792 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 13:49:55,864 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:49:55,895 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 13:49:55,896 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2018-02-04 13:49:55,896 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-04 13:49:55,896 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-04 13:49:55,896 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=157, Unknown=0, NotChecked=0, Total=272 [2018-02-04 13:49:55,896 INFO L87 Difference]: Start difference. First operand 117 states and 130 transitions. Second operand 17 states. [2018-02-04 13:49:55,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:49:55,952 INFO L93 Difference]: Finished difference Result 123 states and 136 transitions. [2018-02-04 13:49:55,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 13:49:55,954 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 56 [2018-02-04 13:49:55,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:49:55,955 INFO L225 Difference]: With dead ends: 123 [2018-02-04 13:49:55,955 INFO L226 Difference]: Without dead ends: 123 [2018-02-04 13:49:55,955 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:49:55,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-02-04 13:49:55,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 121. [2018-02-04 13:49:55,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-02-04 13:49:55,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 134 transitions. [2018-02-04 13:49:55,959 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 134 transitions. Word has length 56 [2018-02-04 13:49:55,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:49:55,959 INFO L432 AbstractCegarLoop]: Abstraction has 121 states and 134 transitions. [2018-02-04 13:49:55,959 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-04 13:49:55,959 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 134 transitions. [2018-02-04 13:49:55,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-02-04 13:49:55,960 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:49:55,960 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:49:55,961 INFO L371 AbstractCegarLoop]: === Iteration 13 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-02-04 13:49:55,961 INFO L82 PathProgramCache]: Analyzing trace with hash 1616077308, now seen corresponding path program 2 times [2018-02-04 13:49:55,961 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:49:55,961 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:49:55,962 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:49:55,962 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:49:55,962 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:49:55,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:49:55,973 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:49:56,042 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:49:56,042 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 13:49:56,043 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:49:56,050 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 13:49:56,077 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 13:49:56,077 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 13:49:56,080 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 13:49:56,153 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 6 proven. 98 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 13:49:56,185 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 13:49:56,185 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2018-02-04 13:49:56,185 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-04 13:49:56,185 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-04 13:49:56,186 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=199, Unknown=0, NotChecked=0, Total=342 [2018-02-04 13:49:56,186 INFO L87 Difference]: Start difference. First operand 121 states and 134 transitions. Second operand 19 states. [2018-02-04 13:49:56,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:49:56,276 INFO L93 Difference]: Finished difference Result 127 states and 140 transitions. [2018-02-04 13:49:56,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-04 13:49:56,279 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 60 [2018-02-04 13:49:56,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:49:56,280 INFO L225 Difference]: With dead ends: 127 [2018-02-04 13:49:56,280 INFO L226 Difference]: Without dead ends: 127 [2018-02-04 13:49:56,280 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=143, Invalid=199, Unknown=0, NotChecked=0, Total=342 [2018-02-04 13:49:56,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-02-04 13:49:56,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 125. [2018-02-04 13:49:56,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-02-04 13:49:56,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 138 transitions. [2018-02-04 13:49:56,284 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 138 transitions. Word has length 60 [2018-02-04 13:49:56,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:49:56,284 INFO L432 AbstractCegarLoop]: Abstraction has 125 states and 138 transitions. [2018-02-04 13:49:56,284 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-04 13:49:56,284 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 138 transitions. [2018-02-04 13:49:56,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-02-04 13:49:56,285 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:49:56,286 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:49:56,286 INFO L371 AbstractCegarLoop]: === Iteration 14 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-02-04 13:49:56,286 INFO L82 PathProgramCache]: Analyzing trace with hash 1519113861, now seen corresponding path program 3 times [2018-02-04 13:49:56,286 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:49:56,286 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:49:56,287 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:49:56,287 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 13:49:56,287 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:49:56,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:49:56,298 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:49:56,388 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:49:56,388 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 13:49:56,389 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:49:56,402 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 13:49:56,418 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-02-04 13:49:56,418 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 13:49:56,420 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 13:49:56,440 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:49:56,440 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 13:49:56,455 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:49:56,455 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:49:56,457 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:49:56,457 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 13:49:56,471 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:49:56,472 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 13:49:56,483 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 13:49:56,483 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:50, output treesize:46 [2018-02-04 13:49:56,619 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:49:56,619 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:49:56,622 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 35 treesize of output 29 [2018-02-04 13:49:56,622 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 13:49:56,639 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:49:56,640 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:49:56,640 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 37 treesize of output 31 [2018-02-04 13:49:56,641 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:49:56,655 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:49:56,655 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 31 treesize of output 40 [2018-02-04 13:49:56,656 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 13:49:56,671 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 29 treesize of output 28 [2018-02-04 13:49:56,672 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 13:49:56,685 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:49:56,685 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:73, output treesize:55 [2018-02-04 13:49:56,744 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2018-02-04 13:49:56,767 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 13:49:56,768 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 23 [2018-02-04 13:49:56,768 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-04 13:49:56,768 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-04 13:49:56,768 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=424, Unknown=1, NotChecked=0, Total=506 [2018-02-04 13:49:56,768 INFO L87 Difference]: Start difference. First operand 125 states and 138 transitions. Second operand 23 states. [2018-02-04 13:50:19,703 WARN L143 SmtUtils]: Spent 15007ms on a formula simplification that was a NOOP. DAG size: 52 [2018-02-04 13:50:40,396 WARN L146 SmtUtils]: Spent 20638ms on a formula simplification. DAG size of input: 56 DAG size of output 56 [2018-02-04 13:50:40,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:50:40,686 INFO L93 Difference]: Finished difference Result 200 states and 219 transitions. [2018-02-04 13:50:40,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-04 13:50:40,686 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 64 [2018-02-04 13:50:40,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:50:40,687 INFO L225 Difference]: With dead ends: 200 [2018-02-04 13:50:40,687 INFO L226 Difference]: Without dead ends: 200 [2018-02-04 13:50:40,687 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 317 ImplicationChecksByTransitivity, 36.7s TimeCoverageRelationStatistics Valid=294, Invalid=1509, Unknown=3, NotChecked=0, Total=1806 [2018-02-04 13:50:40,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2018-02-04 13:50:40,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 144. [2018-02-04 13:50:40,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-02-04 13:50:40,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 169 transitions. [2018-02-04 13:50:40,692 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 169 transitions. Word has length 64 [2018-02-04 13:50:40,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:50:40,692 INFO L432 AbstractCegarLoop]: Abstraction has 144 states and 169 transitions. [2018-02-04 13:50:40,692 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-04 13:50:40,692 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 169 transitions. [2018-02-04 13:50:40,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-02-04 13:50:40,693 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:50:40,693 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:50:40,693 INFO L371 AbstractCegarLoop]: === Iteration 15 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-02-04 13:50:40,693 INFO L82 PathProgramCache]: Analyzing trace with hash -487268723, now seen corresponding path program 1 times [2018-02-04 13:50:40,694 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:50:40,694 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:50:40,695 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:50:40,695 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 13:50:40,695 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:50:40,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:50:40,706 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:50:40,787 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:50:40,787 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 13:50:40,788 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:50:40,794 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:50:40,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:50:40,816 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 13:50:40,916 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:50:40,933 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 13:50:40,933 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 23 [2018-02-04 13:50:40,933 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-04 13:50:40,933 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-04 13:50:40,933 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=208, Invalid=298, Unknown=0, NotChecked=0, Total=506 [2018-02-04 13:50:40,934 INFO L87 Difference]: Start difference. First operand 144 states and 169 transitions. Second operand 23 states. [2018-02-04 13:50:40,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:50:40,990 INFO L93 Difference]: Finished difference Result 150 states and 175 transitions. [2018-02-04 13:50:40,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-04 13:50:40,990 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 68 [2018-02-04 13:50:40,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:50:40,991 INFO L225 Difference]: With dead ends: 150 [2018-02-04 13:50:40,991 INFO L226 Difference]: Without dead ends: 150 [2018-02-04 13:50:40,992 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:50:40,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-02-04 13:50:40,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 148. [2018-02-04 13:50:40,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2018-02-04 13:50:40,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 173 transitions. [2018-02-04 13:50:40,996 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 173 transitions. Word has length 68 [2018-02-04 13:50:40,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:50:40,996 INFO L432 AbstractCegarLoop]: Abstraction has 148 states and 173 transitions. [2018-02-04 13:50:40,996 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-04 13:50:40,996 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 173 transitions. [2018-02-04 13:50:40,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-02-04 13:50:40,997 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:50:40,997 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:50:40,997 INFO L371 AbstractCegarLoop]: === Iteration 16 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-02-04 13:50:40,997 INFO L82 PathProgramCache]: Analyzing trace with hash -2145863146, now seen corresponding path program 2 times [2018-02-04 13:50:40,997 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:50:40,997 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:50:40,998 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:50:40,998 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:50:40,998 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:50:41,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:50:41,012 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:50:41,122 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2018-02-04 13:50:41,122 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 13:50:41,122 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:50:41,130 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 13:50:41,157 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 13:50:41,157 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 13:50:41,159 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 13:50:41,161 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:50:41,161 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 13:50:41,162 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:50:41,163 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-04 13:50:41,182 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:50:41,183 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:50:41,183 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 17 treesize of output 21 [2018-02-04 13:50:41,183 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 13:50:41,186 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:50:41,186 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:15 [2018-02-04 13:50:41,202 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2018-02-04 13:50:41,218 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 13:50:41,219 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 12 [2018-02-04 13:50:41,219 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-04 13:50:41,219 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-04 13:50:41,219 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2018-02-04 13:50:41,219 INFO L87 Difference]: Start difference. First operand 148 states and 173 transitions. Second operand 13 states. [2018-02-04 13:50:41,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:50:41,504 INFO L93 Difference]: Finished difference Result 193 states and 223 transitions. [2018-02-04 13:50:41,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-04 13:50:41,504 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 72 [2018-02-04 13:50:41,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:50:41,505 INFO L225 Difference]: With dead ends: 193 [2018-02-04 13:50:41,505 INFO L226 Difference]: Without dead ends: 193 [2018-02-04 13:50:41,506 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 70 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=343, Unknown=0, NotChecked=0, Total=420 [2018-02-04 13:50:41,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2018-02-04 13:50:41,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 134. [2018-02-04 13:50:41,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-02-04 13:50:41,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 148 transitions. [2018-02-04 13:50:41,509 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 148 transitions. Word has length 72 [2018-02-04 13:50:41,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:50:41,510 INFO L432 AbstractCegarLoop]: Abstraction has 134 states and 148 transitions. [2018-02-04 13:50:41,510 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-04 13:50:41,510 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 148 transitions. [2018-02-04 13:50:41,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-02-04 13:50:41,510 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:50:41,511 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:50:41,511 INFO L371 AbstractCegarLoop]: === Iteration 17 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-02-04 13:50:41,511 INFO L82 PathProgramCache]: Analyzing trace with hash 1300106032, now seen corresponding path program 1 times [2018-02-04 13:50:41,511 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:50:41,511 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:50:41,512 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:50:41,512 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 13:50:41,512 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:50:41,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:50:41,523 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:50:41,548 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:50:41,548 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 13:50:41,548 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 13:50:41,548 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 13:50:41,548 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 13:50:41,549 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 13:50:41,549 INFO L87 Difference]: Start difference. First operand 134 states and 148 transitions. Second operand 4 states. [2018-02-04 13:50:41,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:50:41,571 INFO L93 Difference]: Finished difference Result 143 states and 156 transitions. [2018-02-04 13:50:41,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 13:50:41,572 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 73 [2018-02-04 13:50:41,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:50:41,573 INFO L225 Difference]: With dead ends: 143 [2018-02-04 13:50:41,573 INFO L226 Difference]: Without dead ends: 143 [2018-02-04 13:50:41,573 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:50:41,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-02-04 13:50:41,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 137. [2018-02-04 13:50:41,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-02-04 13:50:41,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 150 transitions. [2018-02-04 13:50:41,576 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 150 transitions. Word has length 73 [2018-02-04 13:50:41,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:50:41,576 INFO L432 AbstractCegarLoop]: Abstraction has 137 states and 150 transitions. [2018-02-04 13:50:41,576 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 13:50:41,577 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 150 transitions. [2018-02-04 13:50:41,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-02-04 13:50:41,577 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:50:41,577 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:50:41,577 INFO L371 AbstractCegarLoop]: === Iteration 18 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-02-04 13:50:41,578 INFO L82 PathProgramCache]: Analyzing trace with hash -1928926345, now seen corresponding path program 1 times [2018-02-04 13:50:41,578 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:50:41,578 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:50:41,579 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:50:41,579 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:50:41,579 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:50:41,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:50:41,590 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:50:41,758 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:50:41,759 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 13:50:41,759 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:50:41,764 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:50:41,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:50:41,788 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 13:50:41,791 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:50:41,792 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 13:50:41,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 14 treesize of output 13 [2018-02-04 13:50:41,803 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:50:41,810 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:50:41,810 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:30 [2018-02-04 13:50:49,106 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:50:49,122 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 13:50:49,122 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 20] total 30 [2018-02-04 13:50:49,123 INFO L409 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-02-04 13:50:49,123 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-02-04 13:50:49,123 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=815, Unknown=3, NotChecked=0, Total=930 [2018-02-04 13:50:49,123 INFO L87 Difference]: Start difference. First operand 137 states and 150 transitions. Second operand 31 states. [2018-02-04 13:51:20,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:51:20,603 INFO L93 Difference]: Finished difference Result 157 states and 169 transitions. [2018-02-04 13:51:20,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-02-04 13:51:20,603 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 81 [2018-02-04 13:51:20,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:51:20,604 INFO L225 Difference]: With dead ends: 157 [2018-02-04 13:51:20,604 INFO L226 Difference]: Without dead ends: 157 [2018-02-04 13:51:20,604 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 66 SyntacticMatches, 1 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 567 ImplicationChecksByTransitivity, 8.4s TimeCoverageRelationStatistics Valid=544, Invalid=2993, Unknown=3, NotChecked=0, Total=3540 [2018-02-04 13:51:20,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2018-02-04 13:51:20,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 139. [2018-02-04 13:51:20,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-02-04 13:51:20,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 154 transitions. [2018-02-04 13:51:20,607 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 154 transitions. Word has length 81 [2018-02-04 13:51:20,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:51:20,607 INFO L432 AbstractCegarLoop]: Abstraction has 139 states and 154 transitions. [2018-02-04 13:51:20,607 INFO L433 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-02-04 13:51:20,607 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 154 transitions. [2018-02-04 13:51:20,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-02-04 13:51:20,608 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:51:20,608 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:51:20,608 INFO L371 AbstractCegarLoop]: === Iteration 19 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-02-04 13:51:20,609 INFO L82 PathProgramCache]: Analyzing trace with hash 332825470, now seen corresponding path program 1 times [2018-02-04 13:51:20,609 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:51:20,609 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:51:20,609 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:51:20,610 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:51:20,610 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:51:20,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:51:20,636 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:51:21,431 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:51:21,431 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 13:51:21,431 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:51:21,439 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:51:21,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:51:21,461 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 13:51:21,498 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:51:21,499 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:51:21,500 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:51:21,501 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:51:21,504 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:51:21,504 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:18 [2018-02-04 13:51:21,540 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:51:21,542 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:51:21,542 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:51:21,542 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:51:21,545 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:51:21,633 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:51:21,633 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:25 [2018-02-04 13:51:21,678 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:51:21,680 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:51:21,680 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:51:21,681 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:51:21,681 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:51:21,682 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:51:21,686 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:51:21,691 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:51:21,691 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:38, output treesize:34 [2018-02-04 13:51:21,753 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:51:21,755 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:51:21,756 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:51:21,756 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:51:21,757 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:51:21,757 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:51:21,758 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:51:21,758 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:51:21,759 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:51:21,767 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:51:21,774 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:51:21,774 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:54, output treesize:50 [2018-02-04 13:51:21,860 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:51:21,862 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:51:21,863 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:51:21,864 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:51:21,865 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:51:21,865 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:51:21,866 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:51:21,867 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:51:21,868 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:51:21,868 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:51:21,869 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:51:21,871 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:51:21,872 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:51:21,895 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:51:21,905 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:51:21,905 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:70, output treesize:66 [2018-02-04 13:51:22,005 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:51:22,007 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:51:22,008 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:51:22,009 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:51:22,010 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:51:22,010 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:51:22,011 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:51:22,011 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:51:22,012 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:51:22,013 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:51:22,013 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:51:22,014 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:51:22,014 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:51:22,015 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:51:22,016 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:51:22,016 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:51:22,017 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:51:22,017 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:51:22,039 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:51:22,051 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:51:22,051 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:86, output treesize:82 [2018-02-04 13:51:22,165 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:51:22,168 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:51:22,169 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:51:22,169 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:51:22,170 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:51:22,171 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:51:22,172 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:51:22,172 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:51:22,173 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:51:22,174 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:51:22,175 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:51:22,175 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:51:22,176 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:51:22,177 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:51:22,177 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:51:22,178 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:51:22,179 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:51:22,180 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:51:22,181 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:51:22,181 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:51:22,182 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:51:22,183 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:51:22,184 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:51:22,184 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:51:22,216 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:51:22,231 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:51:22,231 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:102, output treesize:98 [2018-02-04 13:51:22,454 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:51:22,457 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:51:22,458 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:51:22,458 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:51:22,459 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:51:22,460 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:51:22,461 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:51:22,462 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:51:22,463 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:51:22,463 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:51:22,464 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:51:22,465 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:51:22,466 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:51:22,467 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:51:22,467 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:51:22,468 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:51:22,469 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:51:22,470 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:51:22,470 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:51:22,471 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:51:22,472 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:51:22,473 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:51:22,474 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:51:22,474 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:51:22,475 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:51:22,476 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:51:22,477 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:51:22,478 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:51:22,479 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:51:22,479 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:51:22,480 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:51:22,556 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:51:22,585 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:51:22,585 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:118, output treesize:114 [2018-02-04 13:51:23,775 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:51:23,781 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:51:23,782 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:51:23,784 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:51:23,785 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:51:23,787 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:51:23,788 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:51:23,789 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:51:23,791 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:51:23,792 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:51:23,795 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:51:23,816 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:51:23,817 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:51:23,828 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:51:23,830 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:51:23,831 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:51:23,833 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:51:23,834 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:51:23,835 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:51:23,836 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:51:23,838 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:51:23,839 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:51:23,840 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:51:23,841 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:51:23,842 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:51:23,843 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:51:23,844 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:51:23,845 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:51:23,845 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:51:23,846 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:51:23,847 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:51:23,848 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:51:23,849 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:51:23,850 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:51:23,851 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:51:23,852 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:51:23,853 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:51:23,854 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:51:23,855 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:51:23,932 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:51:23,957 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:51:23,957 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:134, output treesize:130 [2018-02-04 13:51:35,639 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:51:35,643 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:51:35,643 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:51:35,644 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:51:35,645 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:51:35,646 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:51:35,647 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:51:35,647 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:51:35,648 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:51:35,649 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:51:35,650 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:51:35,651 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:51:35,652 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:51:35,653 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:51:35,654 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:51:35,655 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:51:35,656 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:51:35,657 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:51:35,657 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:51:35,658 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:51:35,659 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:51:35,660 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:51:35,661 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:51:35,662 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:51:35,662 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:51:35,663 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:51:35,664 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:51:35,665 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:51:35,666 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:51:35,667 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:51:35,667 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:51:35,668 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:51:35,669 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:51:35,670 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:51:35,671 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:51:35,672 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:51:35,672 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:51:35,673 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:51:35,674 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:51:35,675 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:51:35,676 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:51:35,677 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:51:35,678 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:51:35,683 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:51:35,684 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:51:35,685 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:51:35,686 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:51:35,686 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:51:35,762 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:51:35,785 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:51:35,785 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:150, output treesize:146 [2018-02-04 13:52:06,851 WARN L143 SmtUtils]: Spent 2027ms on a formula simplification that was a NOOP. DAG size: 72 [2018-02-04 13:52:08,948 WARN L143 SmtUtils]: Spent 2022ms on a formula simplification that was a NOOP. DAG size: 72 [2018-02-04 13:52:11,087 WARN L143 SmtUtils]: Spent 2083ms on a formula simplification that was a NOOP. DAG size: 65 [2018-02-04 13:52:11,093 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:52:11,096 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:52:11,097 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:52:11,097 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:52:11,098 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:52:11,098 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:52:11,099 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:52:11,099 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:52:11,100 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:52:11,100 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:52:11,101 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:52:11,101 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:52:11,102 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:52:11,103 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:52:11,103 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:52:11,104 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:52:11,105 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:52:11,105 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:52:11,106 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:52:11,107 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:52:11,107 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:52:11,108 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:52:11,109 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:52:11,109 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:52:11,110 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:52:11,110 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:52:11,111 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:52:11,111 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:52:11,112 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:52:11,112 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:52:11,113 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:52:11,113 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:52:11,114 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:52:11,114 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:52:11,115 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:52:11,115 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:52:11,116 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:52:11,116 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:52:11,117 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:52:11,117 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:52:11,118 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:52:11,118 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:52:11,119 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:52:11,119 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:52:11,120 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:52:11,121 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:52:11,121 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:52:11,175 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:52:11,183 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:52:11,183 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 10 variables, input treesize:132, output treesize:3 [2018-02-04 13:52:11,232 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:52:11,249 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 13:52:11,249 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 29] total 47 [2018-02-04 13:52:11,250 INFO L409 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-02-04 13:52:11,250 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-02-04 13:52:11,251 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=385, Invalid=1853, Unknown=18, NotChecked=0, Total=2256 [2018-02-04 13:52:11,251 INFO L87 Difference]: Start difference. First operand 139 states and 154 transitions. Second operand 48 states. Received shutdown request... [2018-02-04 13:53:32,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-02-04 13:53:32,666 WARN L491 AbstractCegarLoop]: Verification canceled [2018-02-04 13:53:32,669 WARN L185 ceAbstractionStarter]: Timeout [2018-02-04 13:53:32,669 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.02 01:53:32 BoogieIcfgContainer [2018-02-04 13:53:32,669 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-04 13:53:32,669 INFO L168 Benchmark]: Toolchain (without parser) took 220993.36 ms. Allocated memory was 408.4 MB in the beginning and 706.7 MB in the end (delta: 298.3 MB). Free memory was 365.2 MB in the beginning and 654.0 MB in the end (delta: -288.8 MB). Peak memory consumption was 9.6 MB. Max. memory is 5.3 GB. [2018-02-04 13:53:32,670 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 408.4 MB. Free memory is still 371.9 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 13:53:32,670 INFO L168 Benchmark]: CACSL2BoogieTranslator took 168.57 ms. Allocated memory is still 408.4 MB. Free memory was 365.2 MB in the beginning and 352.0 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:53:32,671 INFO L168 Benchmark]: Boogie Preprocessor took 27.14 ms. Allocated memory is still 408.4 MB. Free memory was 352.0 MB in the beginning and 350.7 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-02-04 13:53:32,671 INFO L168 Benchmark]: RCFGBuilder took 255.84 ms. Allocated memory is still 408.4 MB. Free memory was 350.7 MB in the beginning and 327.2 MB in the end (delta: 23.5 MB). Peak memory consumption was 23.5 MB. Max. memory is 5.3 GB. [2018-02-04 13:53:32,671 INFO L168 Benchmark]: TraceAbstraction took 220539.40 ms. Allocated memory was 408.4 MB in the beginning and 706.7 MB in the end (delta: 298.3 MB). Free memory was 325.8 MB in the beginning and 654.0 MB in the end (delta: -328.1 MB). There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 13:53:32,672 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.10 ms. Allocated memory is still 408.4 MB. Free memory is still 371.9 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 168.57 ms. Allocated memory is still 408.4 MB. Free memory was 365.2 MB in the beginning and 352.0 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 27.14 ms. Allocated memory is still 408.4 MB. Free memory was 352.0 MB in the beginning and 350.7 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 255.84 ms. Allocated memory is still 408.4 MB. Free memory was 350.7 MB in the beginning and 327.2 MB in the end (delta: 23.5 MB). Peak memory consumption was 23.5 MB. Max. memory is 5.3 GB. * TraceAbstraction took 220539.40 ms. Allocated memory was 408.4 MB in the beginning and 706.7 MB in the end (delta: 298.3 MB). Free memory was 325.8 MB in the beginning and 654.0 MB in the end (delta: -328.1 MB). There was no memory consumed. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1451). Cancelled while BasicCegarLoop was constructing difference of abstraction (139states) and interpolant automaton (currently 28 states, 48 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 73 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1452). Cancelled while BasicCegarLoop was constructing difference of abstraction (139states) and interpolant automaton (currently 28 states, 48 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 73 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 (139states) and interpolant automaton (currently 28 states, 48 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 73 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 (139states) and interpolant automaton (currently 28 states, 48 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 73 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 (139states) and interpolant automaton (currently 28 states, 48 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 73 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1452). Cancelled while BasicCegarLoop was constructing difference of abstraction (139states) and interpolant automaton (currently 28 states, 48 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 73 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 (139states) and interpolant automaton (currently 28 states, 48 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 73 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1451). Cancelled while BasicCegarLoop was constructing difference of abstraction (139states) and interpolant automaton (currently 28 states, 48 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 73 known predicates. - TimeoutResultAtElement [Line: 1477]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 1477). Cancelled while BasicCegarLoop was constructing difference of abstraction (139states) and interpolant automaton (currently 28 states, 48 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 73 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1460). Cancelled while BasicCegarLoop was constructing difference of abstraction (139states) and interpolant automaton (currently 28 states, 48 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 73 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 (139states) and interpolant automaton (currently 28 states, 48 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 73 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1460). Cancelled while BasicCegarLoop was constructing difference of abstraction (139states) and interpolant automaton (currently 28 states, 48 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 73 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 (139states) and interpolant automaton (currently 28 states, 48 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 73 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 (139states) and interpolant automaton (currently 28 states, 48 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 73 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 (139states) and interpolant automaton (currently 28 states, 48 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 73 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 73 locations, 15 error locations. TIMEOUT Result, 220.4s OverallTime, 19 OverallIterations, 11 TraceHistogramMax, 158.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1255 SDtfs, 1155 SDslu, 7730 SDs, 0 SdLazy, 4429 SolverSat, 308 SolverUnsat, 61 SolverUnknown, 0 SolverNotchecked, 75.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 929 GetRequests, 553 SyntacticMatches, 16 SemanticMatches, 359 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2955 ImplicationChecksByTransitivity, 136.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=148occurred in iteration=15, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 18 MinimizatonAttempts, 230 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 60.5s InterpolantComputationTime, 1519 NumberOfCodeBlocks, 1467 NumberOfCodeBlocksAsserted, 34 NumberOfCheckSat, 1489 ConstructedInterpolants, 112 QuantifiedInterpolants, 988271 SizeOfPredicates, 46 NumberOfNonLiveVariables, 1987 ConjunctsInSsa, 244 ConjunctsInUnsatCore, 30 InterpolantComputations, 9 PerfectInterpolantSequences, 1468/2658 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_1_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-04_13-53-32-678.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test17_1_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-04_13-53-32-678.csv Completed graceful shutdown