java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test18_2_false-valid-memtrack_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1cceb4a [2018-01-30 00:05:10,143 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-30 00:05:10,145 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-30 00:05:10,156 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-30 00:05:10,157 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-30 00:05:10,157 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-30 00:05:10,158 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-30 00:05:10,159 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-30 00:05:10,162 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-30 00:05:10,162 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-30 00:05:10,163 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-30 00:05:10,163 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-30 00:05:10,164 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-30 00:05:10,165 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-30 00:05:10,166 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-30 00:05:10,169 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-30 00:05:10,171 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-30 00:05:10,172 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-30 00:05:10,174 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-30 00:05:10,175 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-30 00:05:10,177 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-30 00:05:10,177 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-30 00:05:10,178 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-30 00:05:10,179 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-30 00:05:10,179 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-30 00:05:10,181 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-30 00:05:10,181 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-30 00:05:10,181 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-30 00:05:10,182 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-30 00:05:10,182 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-30 00:05:10,182 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-30 00:05:10,183 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf [2018-01-30 00:05:10,192 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-30 00:05:10,192 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-30 00:05:10,193 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-30 00:05:10,193 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-30 00:05:10,193 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-30 00:05:10,193 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-30 00:05:10,194 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-30 00:05:10,194 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-30 00:05:10,194 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-30 00:05:10,195 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-30 00:05:10,195 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-30 00:05:10,195 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-30 00:05:10,195 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-30 00:05:10,195 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-30 00:05:10,196 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-30 00:05:10,196 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-30 00:05:10,196 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-30 00:05:10,196 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-30 00:05:10,196 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-30 00:05:10,197 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-01-30 00:05:10,197 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-30 00:05:10,197 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-30 00:05:10,197 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-30 00:05:10,197 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-30 00:05:10,198 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-30 00:05:10,198 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-30 00:05:10,198 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-30 00:05:10,198 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-30 00:05:10,198 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-30 00:05:10,199 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-30 00:05:10,199 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-30 00:05:10,199 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-30 00:05:10,200 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-30 00:05:10,200 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-30 00:05:10,234 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-30 00:05:10,246 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-30 00:05:10,250 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-30 00:05:10,252 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-30 00:05:10,252 INFO L276 PluginConnector]: CDTParser initialized [2018-01-30 00:05:10,253 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test18_2_false-valid-memtrack_true-termination.i [2018-01-30 00:05:10,427 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-30 00:05:10,433 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-30 00:05:10,434 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-30 00:05:10,434 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-30 00:05:10,439 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-30 00:05:10,440 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.01 12:05:10" (1/1) ... [2018-01-30 00:05:10,443 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3fec4a2b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:05:10, skipping insertion in model container [2018-01-30 00:05:10,444 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.01 12:05:10" (1/1) ... [2018-01-30 00:05:10,462 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-30 00:05:10,514 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-30 00:05:10,618 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-30 00:05:10,635 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-30 00:05:10,641 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:05:10 WrapperNode [2018-01-30 00:05:10,641 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-30 00:05:10,642 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-30 00:05:10,642 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-30 00:05:10,642 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-30 00:05:10,657 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:05:10" (1/1) ... [2018-01-30 00:05:10,657 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:05:10" (1/1) ... [2018-01-30 00:05:10,668 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:05:10" (1/1) ... [2018-01-30 00:05:10,669 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:05:10" (1/1) ... [2018-01-30 00:05:10,672 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:05:10" (1/1) ... [2018-01-30 00:05:10,674 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:05:10" (1/1) ... [2018-01-30 00:05:10,675 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:05:10" (1/1) ... [2018-01-30 00:05:10,676 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-30 00:05:10,677 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-30 00:05:10,677 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-30 00:05:10,677 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-30 00:05:10,678 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:05:10" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-30 00:05:10,737 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-30 00:05:10,737 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-30 00:05:10,738 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-01-30 00:05:10,738 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-01-30 00:05:10,738 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-30 00:05:10,738 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-30 00:05:10,738 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-30 00:05:10,738 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-30 00:05:10,738 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-30 00:05:10,739 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-30 00:05:10,739 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-30 00:05:10,739 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-30 00:05:10,739 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-30 00:05:10,739 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-01-30 00:05:10,739 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-01-30 00:05:10,740 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-30 00:05:10,740 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-30 00:05:10,740 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-30 00:05:10,941 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-30 00:05:10,941 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.01 12:05:10 BoogieIcfgContainer [2018-01-30 00:05:10,941 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-30 00:05:10,942 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-30 00:05:10,942 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-30 00:05:10,945 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-30 00:05:10,945 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.01 12:05:10" (1/3) ... [2018-01-30 00:05:10,946 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@465dd7c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.01 12:05:10, skipping insertion in model container [2018-01-30 00:05:10,946 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:05:10" (2/3) ... [2018-01-30 00:05:10,946 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@465dd7c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.01 12:05:10, skipping insertion in model container [2018-01-30 00:05:10,947 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.01 12:05:10" (3/3) ... [2018-01-30 00:05:10,948 INFO L107 eAbstractionObserver]: Analyzing ICFG memleaks_test18_2_false-valid-memtrack_true-termination.i [2018-01-30 00:05:10,956 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-30 00:05:10,961 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 9 error locations. [2018-01-30 00:05:11,007 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-30 00:05:11,008 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-30 00:05:11,008 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-30 00:05:11,008 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-30 00:05:11,008 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-30 00:05:11,008 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-30 00:05:11,009 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-30 00:05:11,009 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-30 00:05:11,010 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-30 00:05:11,030 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states. [2018-01-30 00:05:11,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-30 00:05:11,037 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:05:11,038 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:05:11,038 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-30 00:05:11,044 INFO L82 PathProgramCache]: Analyzing trace with hash -175263290, now seen corresponding path program 1 times [2018-01-30 00:05:11,046 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:05:11,047 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:05:11,114 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:05:11,114 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:05:11,115 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:05:11,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:05:11,180 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:05:11,281 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:05:11,284 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:05:11,285 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-30 00:05:11,286 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 00:05:11,297 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 00:05:11,298 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 00:05:11,300 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 3 states. [2018-01-30 00:05:11,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:05:11,550 INFO L93 Difference]: Finished difference Result 105 states and 121 transitions. [2018-01-30 00:05:11,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 00:05:11,551 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-01-30 00:05:11,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:05:11,562 INFO L225 Difference]: With dead ends: 105 [2018-01-30 00:05:11,562 INFO L226 Difference]: Without dead ends: 89 [2018-01-30 00:05:11,565 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 00:05:11,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-01-30 00:05:11,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 75. [2018-01-30 00:05:11,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-01-30 00:05:11,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 86 transitions. [2018-01-30 00:05:11,608 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 86 transitions. Word has length 25 [2018-01-30 00:05:11,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:05:11,608 INFO L432 AbstractCegarLoop]: Abstraction has 75 states and 86 transitions. [2018-01-30 00:05:11,608 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 00:05:11,608 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 86 transitions. [2018-01-30 00:05:11,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-30 00:05:11,610 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:05:11,610 INFO L350 BasicCegarLoop]: trace histogram [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-01-30 00:05:11,610 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-30 00:05:11,610 INFO L82 PathProgramCache]: Analyzing trace with hash -95214814, now seen corresponding path program 1 times [2018-01-30 00:05:11,611 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:05:11,611 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:05:11,612 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:05:11,612 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:05:11,612 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:05:11,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:05:11,636 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:05:11,704 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:05:11,705 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:05:11,705 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-30 00:05:11,706 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-30 00:05:11,707 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-30 00:05:11,707 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-30 00:05:11,707 INFO L87 Difference]: Start difference. First operand 75 states and 86 transitions. Second operand 6 states. [2018-01-30 00:05:11,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:05:11,808 INFO L93 Difference]: Finished difference Result 108 states and 124 transitions. [2018-01-30 00:05:11,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-30 00:05:11,809 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2018-01-30 00:05:11,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:05:11,811 INFO L225 Difference]: With dead ends: 108 [2018-01-30 00:05:11,811 INFO L226 Difference]: Without dead ends: 104 [2018-01-30 00:05:11,812 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-01-30 00:05:11,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-01-30 00:05:11,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 75. [2018-01-30 00:05:11,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-01-30 00:05:11,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 85 transitions. [2018-01-30 00:05:11,825 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 85 transitions. Word has length 26 [2018-01-30 00:05:11,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:05:11,825 INFO L432 AbstractCegarLoop]: Abstraction has 75 states and 85 transitions. [2018-01-30 00:05:11,825 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-30 00:05:11,825 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 85 transitions. [2018-01-30 00:05:11,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-30 00:05:11,827 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:05:11,827 INFO L350 BasicCegarLoop]: trace histogram [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-01-30 00:05:11,827 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-30 00:05:11,827 INFO L82 PathProgramCache]: Analyzing trace with hash -1326999554, now seen corresponding path program 1 times [2018-01-30 00:05:11,827 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:05:11,828 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:05:11,829 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:05:11,829 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:05:11,830 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:05:11,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:05:11,848 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:05:11,899 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:05:11,900 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:05:11,900 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 00:05:11,900 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 00:05:11,900 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 00:05:11,900 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-01-30 00:05:11,901 INFO L87 Difference]: Start difference. First operand 75 states and 85 transitions. Second operand 4 states. [2018-01-30 00:05:11,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:05:11,968 INFO L93 Difference]: Finished difference Result 117 states and 136 transitions. [2018-01-30 00:05:11,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-30 00:05:11,968 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2018-01-30 00:05:11,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:05:11,970 INFO L225 Difference]: With dead ends: 117 [2018-01-30 00:05:11,970 INFO L226 Difference]: Without dead ends: 113 [2018-01-30 00:05:11,970 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-01-30 00:05:11,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-01-30 00:05:11,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 77. [2018-01-30 00:05:11,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-01-30 00:05:11,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 87 transitions. [2018-01-30 00:05:11,980 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 87 transitions. Word has length 28 [2018-01-30 00:05:11,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:05:11,980 INFO L432 AbstractCegarLoop]: Abstraction has 77 states and 87 transitions. [2018-01-30 00:05:11,980 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 00:05:11,980 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 87 transitions. [2018-01-30 00:05:11,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-01-30 00:05:11,981 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:05:11,981 INFO L350 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:05:11,982 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-30 00:05:11,982 INFO L82 PathProgramCache]: Analyzing trace with hash -822618111, now seen corresponding path program 1 times [2018-01-30 00:05:11,982 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:05:11,982 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:05:11,983 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:05:11,983 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:05:11,984 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:05:11,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:05:11,995 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:05:12,059 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-01-30 00:05:12,059 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:05:12,060 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 00:05:12,075 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:05:12,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:05:12,111 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:05:12,143 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:05:12,172 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-30 00:05:12,172 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 5 [2018-01-30 00:05:12,172 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-30 00:05:12,172 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-30 00:05:12,173 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-30 00:05:12,173 INFO L87 Difference]: Start difference. First operand 77 states and 87 transitions. Second operand 5 states. [2018-01-30 00:05:12,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:05:12,209 INFO L93 Difference]: Finished difference Result 121 states and 134 transitions. [2018-01-30 00:05:12,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-30 00:05:12,210 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 36 [2018-01-30 00:05:12,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:05:12,211 INFO L225 Difference]: With dead ends: 121 [2018-01-30 00:05:12,211 INFO L226 Difference]: Without dead ends: 61 [2018-01-30 00:05:12,212 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-30 00:05:12,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-01-30 00:05:12,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2018-01-30 00:05:12,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-01-30 00:05:12,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 65 transitions. [2018-01-30 00:05:12,217 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 65 transitions. Word has length 36 [2018-01-30 00:05:12,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:05:12,218 INFO L432 AbstractCegarLoop]: Abstraction has 61 states and 65 transitions. [2018-01-30 00:05:12,218 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-30 00:05:12,218 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 65 transitions. [2018-01-30 00:05:12,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-01-30 00:05:12,219 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:05:12,220 INFO L350 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:05:12,220 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-30 00:05:12,220 INFO L82 PathProgramCache]: Analyzing trace with hash -1159121627, now seen corresponding path program 1 times [2018-01-30 00:05:12,220 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:05:12,220 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:05:12,221 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:05:12,221 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:05:12,221 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:05:12,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:05:12,238 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:05:12,297 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-30 00:05:12,298 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:05:12,298 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-30 00:05:12,298 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-30 00:05:12,299 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-30 00:05:12,299 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-30 00:05:12,299 INFO L87 Difference]: Start difference. First operand 61 states and 65 transitions. Second operand 5 states. [2018-01-30 00:05:12,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:05:12,336 INFO L93 Difference]: Finished difference Result 110 states and 118 transitions. [2018-01-30 00:05:12,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-30 00:05:12,337 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2018-01-30 00:05:12,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:05:12,338 INFO L225 Difference]: With dead ends: 110 [2018-01-30 00:05:12,339 INFO L226 Difference]: Without dead ends: 66 [2018-01-30 00:05:12,339 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-30 00:05:12,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-01-30 00:05:12,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 64. [2018-01-30 00:05:12,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-01-30 00:05:12,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 68 transitions. [2018-01-30 00:05:12,348 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 68 transitions. Word has length 37 [2018-01-30 00:05:12,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:05:12,349 INFO L432 AbstractCegarLoop]: Abstraction has 64 states and 68 transitions. [2018-01-30 00:05:12,349 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-30 00:05:12,349 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 68 transitions. [2018-01-30 00:05:12,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-01-30 00:05:12,351 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:05:12,351 INFO L350 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:05:12,351 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-30 00:05:12,351 INFO L82 PathProgramCache]: Analyzing trace with hash -2081203821, now seen corresponding path program 1 times [2018-01-30 00:05:12,351 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:05:12,352 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:05:12,353 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:05:12,354 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:05:12,354 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:05:12,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:05:12,375 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:05:12,532 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:05:12,532 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:05:12,532 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 00:05:12,544 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:05:12,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:05:12,579 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:05:12,621 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-30 00:05:12,623 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 00:05:12,637 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:05:12,638 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-30 00:05:12,702 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:05:12,703 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:05:12,705 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-01-30 00:05:12,706 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 00:05:12,712 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-30 00:05:12,712 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:15 [2018-01-30 00:05:12,745 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:05:12,778 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 00:05:12,779 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2018-01-30 00:05:12,779 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-30 00:05:12,779 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-30 00:05:12,780 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2018-01-30 00:05:12,780 INFO L87 Difference]: Start difference. First operand 64 states and 68 transitions. Second operand 11 states. [2018-01-30 00:05:13,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:05:13,165 INFO L93 Difference]: Finished difference Result 91 states and 101 transitions. [2018-01-30 00:05:13,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-30 00:05:13,199 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 38 [2018-01-30 00:05:13,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:05:13,200 INFO L225 Difference]: With dead ends: 91 [2018-01-30 00:05:13,200 INFO L226 Difference]: Without dead ends: 88 [2018-01-30 00:05:13,201 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=184, Unknown=0, NotChecked=0, Total=240 [2018-01-30 00:05:13,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-01-30 00:05:13,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 67. [2018-01-30 00:05:13,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-01-30 00:05:13,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 74 transitions. [2018-01-30 00:05:13,208 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 74 transitions. Word has length 38 [2018-01-30 00:05:13,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:05:13,208 INFO L432 AbstractCegarLoop]: Abstraction has 67 states and 74 transitions. [2018-01-30 00:05:13,209 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-30 00:05:13,209 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 74 transitions. [2018-01-30 00:05:13,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-01-30 00:05:13,210 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:05:13,210 INFO L350 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:05:13,210 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-30 00:05:13,210 INFO L82 PathProgramCache]: Analyzing trace with hash -2081203820, now seen corresponding path program 1 times [2018-01-30 00:05:13,210 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:05:13,211 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:05:13,212 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:05:13,212 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:05:13,212 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:05:13,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:05:13,230 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:05:13,626 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:05:13,626 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:05:13,626 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 00:05:13,632 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:05:13,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:05:13,655 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:05:13,675 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2018-01-30 00:05:13,676 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 00:05:13,696 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2018-01-30 00:05:13,696 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:05:13,698 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2018-01-30 00:05:13,698 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-30 00:05:13,714 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2018-01-30 00:05:13,715 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-30 00:05:13,728 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-30 00:05:13,729 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:50, output treesize:46 [2018-01-30 00:05:13,997 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:05:13,998 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:05:13,999 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 54 treesize of output 48 [2018-01-30 00:05:14,000 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 00:05:14,040 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:05:14,041 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 45 treesize of output 48 [2018-01-30 00:05:14,042 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:05:14,086 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:05:14,086 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:05:14,087 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 44 treesize of output 38 [2018-01-30 00:05:14,087 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-30 00:05:14,131 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:05:14,132 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 41 treesize of output 50 [2018-01-30 00:05:14,132 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-30 00:05:14,167 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 4 dim-1 vars, End of recursive call: 6 dim-0 vars, and 2 xjuncts. [2018-01-30 00:05:14,167 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 10 variables, input treesize:107, output treesize:75 [2018-01-30 00:05:14,263 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:05:14,282 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 00:05:14,282 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 20 [2018-01-30 00:05:14,283 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-01-30 00:05:14,283 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-01-30 00:05:14,283 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=365, Unknown=1, NotChecked=0, Total=420 [2018-01-30 00:05:14,283 INFO L87 Difference]: Start difference. First operand 67 states and 74 transitions. Second operand 21 states. [2018-01-30 00:05:14,763 WARN L146 SmtUtils]: Spent 122ms on a formula simplification. DAG size of input: 67 DAG size of output 64 [2018-01-30 00:06:00,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:06:00,552 INFO L93 Difference]: Finished difference Result 145 states and 167 transitions. [2018-01-30 00:06:00,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-01-30 00:06:00,553 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 38 [2018-01-30 00:06:00,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:06:00,554 INFO L225 Difference]: With dead ends: 145 [2018-01-30 00:06:00,554 INFO L226 Difference]: Without dead ends: 143 [2018-01-30 00:06:00,555 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 29 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 209 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=163, Invalid=955, Unknown=4, NotChecked=0, Total=1122 [2018-01-30 00:06:00,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-01-30 00:06:00,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 101. [2018-01-30 00:06:00,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-01-30 00:06:00,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 123 transitions. [2018-01-30 00:06:00,577 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 123 transitions. Word has length 38 [2018-01-30 00:06:00,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:06:00,577 INFO L432 AbstractCegarLoop]: Abstraction has 101 states and 123 transitions. [2018-01-30 00:06:00,577 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-01-30 00:06:00,577 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 123 transitions. [2018-01-30 00:06:00,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-01-30 00:06:00,579 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:06:00,579 INFO L350 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:06:00,579 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-30 00:06:00,579 INFO L82 PathProgramCache]: Analyzing trace with hash 143153682, now seen corresponding path program 1 times [2018-01-30 00:06:00,580 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:06:00,580 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:06:00,581 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:06:00,581 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:06:00,581 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:06:00,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:06:00,593 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:06:00,639 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-01-30 00:06:00,640 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:06:00,640 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 00:06:00,640 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 00:06:00,641 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 00:06:00,641 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 00:06:00,641 INFO L87 Difference]: Start difference. First operand 101 states and 123 transitions. Second operand 4 states. [2018-01-30 00:06:00,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:06:00,691 INFO L93 Difference]: Finished difference Result 115 states and 131 transitions. [2018-01-30 00:06:00,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-30 00:06:00,692 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 40 [2018-01-30 00:06:00,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:06:00,693 INFO L225 Difference]: With dead ends: 115 [2018-01-30 00:06:00,693 INFO L226 Difference]: Without dead ends: 96 [2018-01-30 00:06:00,694 INFO L553 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-01-30 00:06:00,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-01-30 00:06:00,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 91. [2018-01-30 00:06:00,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-01-30 00:06:00,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 105 transitions. [2018-01-30 00:06:00,707 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 105 transitions. Word has length 40 [2018-01-30 00:06:00,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:06:00,708 INFO L432 AbstractCegarLoop]: Abstraction has 91 states and 105 transitions. [2018-01-30 00:06:00,708 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 00:06:00,708 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 105 transitions. [2018-01-30 00:06:00,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-01-30 00:06:00,709 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:06:00,710 INFO L350 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:06:00,710 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-30 00:06:00,710 INFO L82 PathProgramCache]: Analyzing trace with hash -212588640, now seen corresponding path program 1 times [2018-01-30 00:06:00,710 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:06:00,710 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:06:00,711 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:06:00,712 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:06:00,712 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:06:00,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:06:00,723 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:06:00,858 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-30 00:06:00,858 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:06:00,858 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 00:06:00,868 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:06:00,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:06:00,892 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:06:00,982 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-30 00:06:01,003 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 00:06:01,003 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8] total 12 [2018-01-30 00:06:01,004 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-01-30 00:06:01,004 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-01-30 00:06:01,004 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=122, Unknown=9, NotChecked=0, Total=156 [2018-01-30 00:06:01,004 INFO L87 Difference]: Start difference. First operand 91 states and 105 transitions. Second operand 13 states. [2018-01-30 00:06:01,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:06:01,405 INFO L93 Difference]: Finished difference Result 99 states and 112 transitions. [2018-01-30 00:06:01,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-30 00:06:01,416 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 43 [2018-01-30 00:06:01,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:06:01,417 INFO L225 Difference]: With dead ends: 99 [2018-01-30 00:06:01,417 INFO L226 Difference]: Without dead ends: 88 [2018-01-30 00:06:01,417 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 41 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=274, Unknown=9, NotChecked=0, Total=342 [2018-01-30 00:06:01,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-01-30 00:06:01,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2018-01-30 00:06:01,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-01-30 00:06:01,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 101 transitions. [2018-01-30 00:06:01,433 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 101 transitions. Word has length 43 [2018-01-30 00:06:01,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:06:01,434 INFO L432 AbstractCegarLoop]: Abstraction has 88 states and 101 transitions. [2018-01-30 00:06:01,434 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-01-30 00:06:01,434 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 101 transitions. [2018-01-30 00:06:01,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-01-30 00:06:01,435 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:06:01,436 INFO L350 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:06:01,436 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-30 00:06:01,436 INFO L82 PathProgramCache]: Analyzing trace with hash 1746977166, now seen corresponding path program 1 times [2018-01-30 00:06:01,436 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:06:01,436 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:06:01,438 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:06:01,438 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:06:01,438 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:06:01,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:06:01,449 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:06:01,491 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-01-30 00:06:01,491 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:06:01,491 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-30 00:06:01,492 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-30 00:06:01,492 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-30 00:06:01,492 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-30 00:06:01,492 INFO L87 Difference]: Start difference. First operand 88 states and 101 transitions. Second operand 6 states. [2018-01-30 00:06:01,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:06:01,545 INFO L93 Difference]: Finished difference Result 115 states and 131 transitions. [2018-01-30 00:06:01,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-30 00:06:01,546 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 44 [2018-01-30 00:06:01,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:06:01,547 INFO L225 Difference]: With dead ends: 115 [2018-01-30 00:06:01,547 INFO L226 Difference]: Without dead ends: 87 [2018-01-30 00:06:01,548 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-01-30 00:06:01,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-01-30 00:06:01,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 85. [2018-01-30 00:06:01,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-01-30 00:06:01,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 96 transitions. [2018-01-30 00:06:01,562 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 96 transitions. Word has length 44 [2018-01-30 00:06:01,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:06:01,562 INFO L432 AbstractCegarLoop]: Abstraction has 85 states and 96 transitions. [2018-01-30 00:06:01,562 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-30 00:06:01,562 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 96 transitions. [2018-01-30 00:06:01,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-01-30 00:06:01,563 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:06:01,564 INFO L350 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:06:01,564 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-30 00:06:01,564 INFO L82 PathProgramCache]: Analyzing trace with hash 1150993881, now seen corresponding path program 1 times [2018-01-30 00:06:01,564 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:06:01,564 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:06:01,565 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:06:01,566 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:06:01,566 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:06:01,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:06:01,578 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:06:01,639 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-01-30 00:06:01,639 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:06:01,640 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 00:06:01,653 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:06:01,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:06:01,682 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:06:01,746 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-01-30 00:06:01,780 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 00:06:01,781 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2018-01-30 00:06:01,781 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-30 00:06:01,781 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-30 00:06:01,782 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-01-30 00:06:01,782 INFO L87 Difference]: Start difference. First operand 85 states and 96 transitions. Second operand 9 states. [2018-01-30 00:06:01,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:06:01,925 INFO L93 Difference]: Finished difference Result 114 states and 126 transitions. [2018-01-30 00:06:01,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-30 00:06:01,925 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 46 [2018-01-30 00:06:01,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:06:01,926 INFO L225 Difference]: With dead ends: 114 [2018-01-30 00:06:01,927 INFO L226 Difference]: Without dead ends: 110 [2018-01-30 00:06:01,927 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2018-01-30 00:06:01,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-01-30 00:06:01,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 85. [2018-01-30 00:06:01,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-01-30 00:06:01,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 95 transitions. [2018-01-30 00:06:01,940 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 95 transitions. Word has length 46 [2018-01-30 00:06:01,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:06:01,940 INFO L432 AbstractCegarLoop]: Abstraction has 85 states and 95 transitions. [2018-01-30 00:06:01,941 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-30 00:06:01,941 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 95 transitions. [2018-01-30 00:06:01,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-01-30 00:06:01,942 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:06:01,942 INFO L350 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:06:01,942 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-30 00:06:01,942 INFO L82 PathProgramCache]: Analyzing trace with hash -420007505, now seen corresponding path program 1 times [2018-01-30 00:06:01,942 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:06:01,943 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:06:01,943 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:06:01,944 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:06:01,944 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:06:01,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:06:01,966 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:06:02,589 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 2 proven. 21 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-01-30 00:06:02,590 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:06:02,590 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 00:06:02,598 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:06:02,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:06:02,636 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:06:02,668 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2018-01-30 00:06:02,669 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 00:06:02,694 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2018-01-30 00:06:02,694 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:06:02,711 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2018-01-30 00:06:02,712 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-30 00:06:02,713 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2018-01-30 00:06:02,714 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-30 00:06:02,727 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-30 00:06:02,727 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:50, output treesize:46 [2018-01-30 00:06:03,023 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:06:03,025 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:06:03,026 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 16 treesize of output 25 [2018-01-30 00:06:03,026 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 00:06:03,055 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:06:03,055 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:06:03,056 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 11 treesize of output 4 [2018-01-30 00:06:03,056 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:06:03,068 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 1 xjuncts. [2018-01-30 00:06:03,068 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:45, output treesize:27 [2018-01-30 00:06:03,345 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:06:03,346 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:06:03,351 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:06:03,351 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 21 treesize of output 34 [2018-01-30 00:06:03,352 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 00:06:03,381 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:06:03,382 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:06:03,383 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 11 treesize of output 4 [2018-01-30 00:06:03,383 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:06:03,407 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-01-30 00:06:03,408 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:43, output treesize:32 [2018-01-30 00:06:03,502 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 10 proven. 13 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-01-30 00:06:03,532 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 00:06:03,532 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16] total 28 [2018-01-30 00:06:03,532 INFO L409 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-01-30 00:06:03,533 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-01-30 00:06:03,533 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=719, Unknown=1, NotChecked=0, Total=812 [2018-01-30 00:06:03,533 INFO L87 Difference]: Start difference. First operand 85 states and 95 transitions. Second operand 29 states. [2018-01-30 00:06:03,854 WARN L146 SmtUtils]: Spent 109ms on a formula simplification. DAG size of input: 52 DAG size of output 47 [2018-01-30 00:06:04,013 WARN L146 SmtUtils]: Spent 130ms on a formula simplification. DAG size of input: 64 DAG size of output 59 [2018-01-30 00:06:05,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:06:05,037 INFO L93 Difference]: Finished difference Result 129 states and 145 transitions. [2018-01-30 00:06:05,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-01-30 00:06:05,037 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 56 [2018-01-30 00:06:05,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:06:05,038 INFO L225 Difference]: With dead ends: 129 [2018-01-30 00:06:05,038 INFO L226 Difference]: Without dead ends: 127 [2018-01-30 00:06:05,039 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 44 SyntacticMatches, 4 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 442 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=232, Invalid=1655, Unknown=5, NotChecked=0, Total=1892 [2018-01-30 00:06:05,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-01-30 00:06:05,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 111. [2018-01-30 00:06:05,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-01-30 00:06:05,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 132 transitions. [2018-01-30 00:06:05,052 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 132 transitions. Word has length 56 [2018-01-30 00:06:05,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:06:05,089 INFO L432 AbstractCegarLoop]: Abstraction has 111 states and 132 transitions. [2018-01-30 00:06:05,089 INFO L433 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-01-30 00:06:05,089 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 132 transitions. [2018-01-30 00:06:05,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-01-30 00:06:05,090 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:06:05,090 INFO L350 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:06:05,090 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-30 00:06:05,090 INFO L82 PathProgramCache]: Analyzing trace with hash -1175021715, now seen corresponding path program 1 times [2018-01-30 00:06:05,090 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:06:05,090 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:06:05,091 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:06:05,091 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:06:05,091 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:06:05,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:06:05,102 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:06:05,298 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 8 proven. 11 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-01-30 00:06:05,298 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:06:05,298 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 00:06:05,308 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:06:05,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:06:05,330 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:06:05,485 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-01-30 00:06:05,513 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 00:06:05,513 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 18 [2018-01-30 00:06:05,514 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-01-30 00:06:05,514 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-01-30 00:06:05,514 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=290, Unknown=0, NotChecked=0, Total=342 [2018-01-30 00:06:05,514 INFO L87 Difference]: Start difference. First operand 111 states and 132 transitions. Second operand 19 states. [2018-01-30 00:06:05,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:06:05,864 INFO L93 Difference]: Finished difference Result 126 states and 141 transitions. [2018-01-30 00:06:05,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-01-30 00:06:05,865 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 58 [2018-01-30 00:06:05,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:06:05,866 INFO L225 Difference]: With dead ends: 126 [2018-01-30 00:06:05,866 INFO L226 Difference]: Without dead ends: 124 [2018-01-30 00:06:05,866 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=119, Invalid=637, Unknown=0, NotChecked=0, Total=756 [2018-01-30 00:06:05,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-01-30 00:06:05,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 88. [2018-01-30 00:06:05,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-01-30 00:06:05,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 97 transitions. [2018-01-30 00:06:05,876 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 97 transitions. Word has length 58 [2018-01-30 00:06:05,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:06:05,877 INFO L432 AbstractCegarLoop]: Abstraction has 88 states and 97 transitions. [2018-01-30 00:06:05,877 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-01-30 00:06:05,877 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 97 transitions. [2018-01-30 00:06:05,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-01-30 00:06:05,877 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:06:05,877 INFO L350 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:06:05,878 INFO L371 AbstractCegarLoop]: === Iteration 14 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-30 00:06:05,878 INFO L82 PathProgramCache]: Analyzing trace with hash -2065934786, now seen corresponding path program 1 times [2018-01-30 00:06:05,878 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:06:05,878 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:06:05,879 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:06:05,879 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:06:05,879 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:06:05,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:06:05,894 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:06:06,203 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-01-30 00:06:06,204 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:06:06,204 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 00:06:06,210 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:06:06,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:06:06,230 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:06:06,260 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-01-30 00:06:06,262 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-01-30 00:06:06,262 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:06:06,263 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:06:06,266 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:06:06,267 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:19, output treesize:15 [2018-01-30 00:06:06,480 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 23 treesize of output 19 [2018-01-30 00:06:06,482 INFO L682 Elim1Store]: detected equality via solver [2018-01-30 00:06:06,482 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-01-30 00:06:06,482 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:06:06,484 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:06:06,488 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:06:06,488 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:32, output treesize:3 [2018-01-30 00:06:06,493 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 11 proven. 8 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-01-30 00:06:06,512 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 00:06:06,512 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 23 [2018-01-30 00:06:06,512 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-01-30 00:06:06,513 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-01-30 00:06:06,513 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=468, Unknown=0, NotChecked=0, Total=552 [2018-01-30 00:06:06,513 INFO L87 Difference]: Start difference. First operand 88 states and 97 transitions. Second operand 24 states. [2018-01-30 00:06:06,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:06:06,888 INFO L93 Difference]: Finished difference Result 127 states and 135 transitions. [2018-01-30 00:06:06,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-01-30 00:06:06,888 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 59 [2018-01-30 00:06:06,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:06:06,889 INFO L225 Difference]: With dead ends: 127 [2018-01-30 00:06:06,889 INFO L226 Difference]: Without dead ends: 126 [2018-01-30 00:06:06,890 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 49 SyntacticMatches, 4 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 358 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=199, Invalid=1207, Unknown=0, NotChecked=0, Total=1406 [2018-01-30 00:06:06,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-01-30 00:06:06,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 101. [2018-01-30 00:06:06,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-01-30 00:06:06,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 110 transitions. [2018-01-30 00:06:06,902 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 110 transitions. Word has length 59 [2018-01-30 00:06:06,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:06:06,902 INFO L432 AbstractCegarLoop]: Abstraction has 101 states and 110 transitions. [2018-01-30 00:06:06,903 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-01-30 00:06:06,903 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 110 transitions. [2018-01-30 00:06:06,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-01-30 00:06:06,904 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:06:06,904 INFO L350 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:06:06,904 INFO L371 AbstractCegarLoop]: === Iteration 15 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-30 00:06:06,904 INFO L82 PathProgramCache]: Analyzing trace with hash -2065934785, now seen corresponding path program 1 times [2018-01-30 00:06:06,904 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:06:06,904 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:06:06,905 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:06:06,905 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:06:06,906 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:06:06,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:06:06,921 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:06:07,300 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 13 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-01-30 00:06:07,300 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:06:07,300 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 00:06:07,305 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:06:07,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:06:07,324 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:06:07,343 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-30 00:06:07,343 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 00:06:07,344 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:06:07,344 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-30 00:06:07,383 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-01-30 00:06:07,385 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-01-30 00:06:07,385 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:06:07,387 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:06:07,390 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:06:07,390 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:17 [2018-01-30 00:06:07,442 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2018-01-30 00:06:07,443 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 00:06:07,445 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:06:07,445 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:20, output treesize:3 [2018-01-30 00:06:07,550 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 25 treesize of output 21 [2018-01-30 00:06:07,552 INFO L682 Elim1Store]: detected equality via solver [2018-01-30 00:06:07,552 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2018-01-30 00:06:07,552 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:06:07,555 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:06:07,560 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:06:07,560 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:34, output treesize:5 [2018-01-30 00:06:07,564 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 11 proven. 8 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-01-30 00:06:07,584 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 00:06:07,584 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 13] total 25 [2018-01-30 00:06:07,585 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-01-30 00:06:07,585 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-01-30 00:06:07,585 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=571, Unknown=0, NotChecked=0, Total=650 [2018-01-30 00:06:07,585 INFO L87 Difference]: Start difference. First operand 101 states and 110 transitions. Second operand 26 states. [2018-01-30 00:06:08,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:06:08,072 INFO L93 Difference]: Finished difference Result 103 states and 111 transitions. [2018-01-30 00:06:08,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-01-30 00:06:08,072 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 59 [2018-01-30 00:06:08,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:06:08,073 INFO L225 Difference]: With dead ends: 103 [2018-01-30 00:06:08,073 INFO L226 Difference]: Without dead ends: 102 [2018-01-30 00:06:08,073 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 52 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 283 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=169, Invalid=1163, Unknown=0, NotChecked=0, Total=1332 [2018-01-30 00:06:08,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-01-30 00:06:08,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 101. [2018-01-30 00:06:08,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-01-30 00:06:08,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 109 transitions. [2018-01-30 00:06:08,082 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 109 transitions. Word has length 59 [2018-01-30 00:06:08,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:06:08,082 INFO L432 AbstractCegarLoop]: Abstraction has 101 states and 109 transitions. [2018-01-30 00:06:08,082 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-01-30 00:06:08,082 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 109 transitions. [2018-01-30 00:06:08,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-01-30 00:06:08,083 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:06:08,083 INFO L350 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:06:08,084 INFO L371 AbstractCegarLoop]: === Iteration 16 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-30 00:06:08,084 INFO L82 PathProgramCache]: Analyzing trace with hash -1089853339, now seen corresponding path program 1 times [2018-01-30 00:06:08,084 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:06:08,084 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:06:08,085 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:06:08,085 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:06:08,085 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:06:08,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:06:08,095 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:06:08,140 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-01-30 00:06:08,140 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:06:08,140 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/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-01-30 00:06:08,151 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:06:08,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:06:08,175 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:06:08,200 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-01-30 00:06:08,234 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-30 00:06:08,234 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 8 [2018-01-30 00:06:08,235 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-30 00:06:08,235 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-30 00:06:08,235 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-01-30 00:06:08,235 INFO L87 Difference]: Start difference. First operand 101 states and 109 transitions. Second operand 8 states. [2018-01-30 00:06:08,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:06:08,308 INFO L93 Difference]: Finished difference Result 105 states and 112 transitions. [2018-01-30 00:06:08,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-30 00:06:08,308 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 61 [2018-01-30 00:06:08,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:06:08,309 INFO L225 Difference]: With dead ends: 105 [2018-01-30 00:06:08,310 INFO L226 Difference]: Without dead ends: 100 [2018-01-30 00:06:08,310 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2018-01-30 00:06:08,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-01-30 00:06:08,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2018-01-30 00:06:08,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-01-30 00:06:08,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 106 transitions. [2018-01-30 00:06:08,322 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 106 transitions. Word has length 61 [2018-01-30 00:06:08,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:06:08,323 INFO L432 AbstractCegarLoop]: Abstraction has 100 states and 106 transitions. [2018-01-30 00:06:08,323 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-30 00:06:08,323 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 106 transitions. [2018-01-30 00:06:08,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-01-30 00:06:08,324 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:06:08,324 INFO L350 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:06:08,324 INFO L371 AbstractCegarLoop]: === Iteration 17 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-30 00:06:08,324 INFO L82 PathProgramCache]: Analyzing trace with hash 1434342132, now seen corresponding path program 2 times [2018-01-30 00:06:08,324 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:06:08,324 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:06:08,325 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:06:08,325 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:06:08,326 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:06:08,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:06:08,336 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:06:08,430 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-01-30 00:06:08,430 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:06:08,431 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/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-01-30 00:06:08,441 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-30 00:06:08,454 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:06:08,461 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:06:08,462 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 00:06:08,464 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:06:08,502 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-01-30 00:06:08,521 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 00:06:08,522 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2018-01-30 00:06:08,522 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-01-30 00:06:08,522 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-01-30 00:06:08,522 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2018-01-30 00:06:08,522 INFO L87 Difference]: Start difference. First operand 100 states and 106 transitions. Second operand 13 states. [2018-01-30 00:06:08,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:06:08,607 INFO L93 Difference]: Finished difference Result 156 states and 167 transitions. [2018-01-30 00:06:08,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-30 00:06:08,608 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 64 [2018-01-30 00:06:08,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:06:08,609 INFO L225 Difference]: With dead ends: 156 [2018-01-30 00:06:08,609 INFO L226 Difference]: Without dead ends: 152 [2018-01-30 00:06:08,610 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=96, Invalid=176, Unknown=0, NotChecked=0, Total=272 [2018-01-30 00:06:08,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2018-01-30 00:06:08,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 105. [2018-01-30 00:06:08,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-01-30 00:06:08,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 111 transitions. [2018-01-30 00:06:08,624 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 111 transitions. Word has length 64 [2018-01-30 00:06:08,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:06:08,624 INFO L432 AbstractCegarLoop]: Abstraction has 105 states and 111 transitions. [2018-01-30 00:06:08,625 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-01-30 00:06:08,625 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 111 transitions. [2018-01-30 00:06:08,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-01-30 00:06:08,626 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:06:08,626 INFO L350 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:06:08,626 INFO L371 AbstractCegarLoop]: === Iteration 18 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-30 00:06:08,626 INFO L82 PathProgramCache]: Analyzing trace with hash -123263374, now seen corresponding path program 1 times [2018-01-30 00:06:08,626 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:06:08,626 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:06:08,627 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:06:08,627 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 00:06:08,627 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:06:08,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:06:08,644 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:06:09,127 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 8 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-30 00:06:09,127 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:06:09,127 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 00:06:09,132 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:06:09,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:06:09,151 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:06:09,156 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-30 00:06:09,157 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 00:06:09,158 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:06:09,159 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-30 00:06:09,214 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:06:09,215 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:06:09,216 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 11 treesize of output 4 [2018-01-30 00:06:09,216 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 00:06:09,218 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:06:09,218 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-01-30 00:06:09,248 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 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-01-30 00:06:09,250 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 12 treesize of output 11 [2018-01-30 00:06:09,251 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:06:09,253 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:06:09,259 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:06:09,259 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:21 [2018-01-30 00:06:09,346 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-01-30 00:06:09,346 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 00:06:09,350 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-01-30 00:06:09,351 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:24, output treesize:19 [2018-01-30 00:06:13,373 WARN L143 SmtUtils]: Spent 2003ms on a formula simplification that was a NOOP. DAG size: 19 [2018-01-30 00:06:14,106 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 24 treesize of output 20 [2018-01-30 00:06:14,108 INFO L682 Elim1Store]: detected equality via solver [2018-01-30 00:06:14,108 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-01-30 00:06:14,108 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:06:14,111 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:06:14,116 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:06:14,116 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:38, output treesize:10 [2018-01-30 00:06:14,131 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:06:14,132 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 25 [2018-01-30 00:06:14,132 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 00:06:14,140 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 2 xjuncts. [2018-01-30 00:06:14,141 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:46, output treesize:22 [2018-01-30 00:06:14,175 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 11 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:06:14,196 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 00:06:14,196 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 19] total 31 [2018-01-30 00:06:14,196 INFO L409 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-01-30 00:06:14,197 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-01-30 00:06:14,197 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=889, Unknown=1, NotChecked=0, Total=992 [2018-01-30 00:06:14,197 INFO L87 Difference]: Start difference. First operand 105 states and 111 transitions. Second operand 32 states. [2018-01-30 00:06:46,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:06:46,965 INFO L93 Difference]: Finished difference Result 122 states and 128 transitions. [2018-01-30 00:06:46,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-01-30 00:06:46,965 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 66 [2018-01-30 00:06:46,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:06:46,966 INFO L225 Difference]: With dead ends: 122 [2018-01-30 00:06:46,966 INFO L226 Difference]: Without dead ends: 120 [2018-01-30 00:06:46,967 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 52 SyntacticMatches, 4 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 469 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=264, Invalid=1991, Unknown=1, NotChecked=0, Total=2256 [2018-01-30 00:06:46,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-01-30 00:06:46,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 112. [2018-01-30 00:06:46,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-01-30 00:06:46,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 119 transitions. [2018-01-30 00:06:46,978 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 119 transitions. Word has length 66 [2018-01-30 00:06:46,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:06:46,978 INFO L432 AbstractCegarLoop]: Abstraction has 112 states and 119 transitions. [2018-01-30 00:06:46,978 INFO L433 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-01-30 00:06:46,978 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 119 transitions. [2018-01-30 00:06:46,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-01-30 00:06:46,979 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:06:46,979 INFO L350 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:06:46,979 INFO L371 AbstractCegarLoop]: === Iteration 19 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-30 00:06:46,979 INFO L82 PathProgramCache]: Analyzing trace with hash -123263326, now seen corresponding path program 1 times [2018-01-30 00:06:46,979 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:06:46,979 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:06:46,980 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:06:46,980 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:06:46,980 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:06:46,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:06:46,990 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:06:47,044 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-01-30 00:06:47,044 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:06:47,045 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 00:06:47,055 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:06:47,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:06:47,085 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:06:47,113 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-01-30 00:06:47,146 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 00:06:47,146 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2018-01-30 00:06:47,146 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-30 00:06:47,147 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-30 00:06:47,147 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2018-01-30 00:06:47,147 INFO L87 Difference]: Start difference. First operand 112 states and 119 transitions. Second operand 10 states. [2018-01-30 00:06:47,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:06:47,262 INFO L93 Difference]: Finished difference Result 135 states and 143 transitions. [2018-01-30 00:06:47,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-30 00:06:47,263 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 66 [2018-01-30 00:06:47,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:06:47,263 INFO L225 Difference]: With dead ends: 135 [2018-01-30 00:06:47,264 INFO L226 Difference]: Without dead ends: 116 [2018-01-30 00:06:47,264 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2018-01-30 00:06:47,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-01-30 00:06:47,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 112. [2018-01-30 00:06:47,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-01-30 00:06:47,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 118 transitions. [2018-01-30 00:06:47,273 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 118 transitions. Word has length 66 [2018-01-30 00:06:47,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:06:47,273 INFO L432 AbstractCegarLoop]: Abstraction has 112 states and 118 transitions. [2018-01-30 00:06:47,273 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-30 00:06:47,273 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 118 transitions. [2018-01-30 00:06:47,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-01-30 00:06:47,274 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:06:47,274 INFO L350 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:06:47,274 INFO L371 AbstractCegarLoop]: === Iteration 20 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-30 00:06:47,274 INFO L82 PathProgramCache]: Analyzing trace with hash 57889040, now seen corresponding path program 1 times [2018-01-30 00:06:47,274 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:06:47,275 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:06:47,275 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:06:47,275 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:06:47,275 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:06:47,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:06:47,288 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:06:47,713 WARN L146 SmtUtils]: Spent 110ms on a formula simplification. DAG size of input: 20 DAG size of output 18 [2018-01-30 00:06:48,468 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-01-30 00:06:48,469 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:06:48,469 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 00:06:48,474 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:06:48,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:06:48,494 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:06:48,784 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 49 treesize of output 46 [2018-01-30 00:06:48,786 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 12 treesize of output 11 [2018-01-30 00:06:48,786 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:06:48,797 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:06:48,801 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 46 [2018-01-30 00:06:48,804 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 12 treesize of output 11 [2018-01-30 00:06:48,804 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-30 00:06:48,818 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:06:48,849 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-30 00:06:48,849 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:99, output treesize:117 [2018-01-30 00:06:49,176 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 53 treesize of output 35 [2018-01-30 00:06:49,177 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 00:06:49,205 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 53 treesize of output 35 [2018-01-30 00:06:49,206 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:06:49,226 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-1 vars, End of recursive call: 6 dim-0 vars, and 2 xjuncts. [2018-01-30 00:06:49,226 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:89, output treesize:71 [2018-01-30 00:06:55,543 WARN L143 SmtUtils]: Spent 4026ms on a formula simplification that was a NOOP. DAG size: 68 [2018-01-30 00:07:07,925 WARN L143 SmtUtils]: Spent 4029ms on a formula simplification that was a NOOP. DAG size: 84 [2018-01-30 00:07:12,126 WARN L143 SmtUtils]: Spent 4045ms on a formula simplification that was a NOOP. DAG size: 82 [2018-01-30 00:07:12,824 WARN L146 SmtUtils]: Spent 303ms on a formula simplification. DAG size of input: 83 DAG size of output 51 [2018-01-30 00:07:12,829 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 75 treesize of output 67 [2018-01-30 00:07:12,832 INFO L682 Elim1Store]: detected equality via solver [2018-01-30 00:07:12,832 INFO L682 Elim1Store]: detected equality via solver [2018-01-30 00:07:12,833 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 55 [2018-01-30 00:07:12,833 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:07:12,847 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:07:12,882 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 67 [2018-01-30 00:07:12,885 INFO L682 Elim1Store]: detected equality via solver [2018-01-30 00:07:12,885 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 33 [2018-01-30 00:07:12,885 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-30 00:07:12,897 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:07:12,924 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-30 00:07:12,924 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:151, output treesize:63 [2018-01-30 00:07:15,347 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 9 proven. 12 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-01-30 00:07:15,367 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 00:07:15,367 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 23] total 40 [2018-01-30 00:07:15,367 INFO L409 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-01-30 00:07:15,368 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-01-30 00:07:15,368 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=1503, Unknown=36, NotChecked=0, Total=1640 [2018-01-30 00:07:15,368 INFO L87 Difference]: Start difference. First operand 112 states and 118 transitions. Second operand 41 states. [2018-01-30 00:07:30,328 WARN L146 SmtUtils]: Spent 4105ms on a formula simplification. DAG size of input: 103 DAG size of output 38 [2018-01-30 00:07:40,458 WARN L146 SmtUtils]: Spent 6062ms on a formula simplification. DAG size of input: 82 DAG size of output 56 Received shutdown request... [2018-01-30 00:07:43,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-01-30 00:07:43,669 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-30 00:07:43,673 WARN L185 ceAbstractionStarter]: Timeout [2018-01-30 00:07:43,673 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.01 12:07:43 BoogieIcfgContainer [2018-01-30 00:07:43,673 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-30 00:07:43,674 INFO L168 Benchmark]: Toolchain (without parser) took 153246.23 ms. Allocated memory was 305.1 MB in the beginning and 563.6 MB in the end (delta: 258.5 MB). Free memory was 264.2 MB in the beginning and 304.6 MB in the end (delta: -40.5 MB). Peak memory consumption was 218.0 MB. Max. memory is 5.3 GB. [2018-01-30 00:07:43,675 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 305.1 MB. Free memory is still 271.1 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-30 00:07:43,675 INFO L168 Benchmark]: CACSL2BoogieTranslator took 207.64 ms. Allocated memory is still 305.1 MB. Free memory was 264.2 MB in the beginning and 251.1 MB in the end (delta: 13.0 MB). Peak memory consumption was 13.0 MB. Max. memory is 5.3 GB. [2018-01-30 00:07:43,675 INFO L168 Benchmark]: Boogie Preprocessor took 34.67 ms. Allocated memory is still 305.1 MB. Free memory was 251.1 MB in the beginning and 249.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-30 00:07:43,675 INFO L168 Benchmark]: RCFGBuilder took 264.55 ms. Allocated memory is still 305.1 MB. Free memory was 249.1 MB in the beginning and 230.4 MB in the end (delta: 18.8 MB). Peak memory consumption was 18.8 MB. Max. memory is 5.3 GB. [2018-01-30 00:07:43,676 INFO L168 Benchmark]: TraceAbstraction took 152731.34 ms. Allocated memory was 305.1 MB in the beginning and 563.6 MB in the end (delta: 258.5 MB). Free memory was 230.4 MB in the beginning and 304.6 MB in the end (delta: -74.3 MB). Peak memory consumption was 184.2 MB. Max. memory is 5.3 GB. [2018-01-30 00:07:43,677 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.22 ms. Allocated memory is still 305.1 MB. Free memory is still 271.1 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 207.64 ms. Allocated memory is still 305.1 MB. Free memory was 264.2 MB in the beginning and 251.1 MB in the end (delta: 13.0 MB). Peak memory consumption was 13.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 34.67 ms. Allocated memory is still 305.1 MB. Free memory was 251.1 MB in the beginning and 249.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 264.55 ms. Allocated memory is still 305.1 MB. Free memory was 249.1 MB in the beginning and 230.4 MB in the end (delta: 18.8 MB). Peak memory consumption was 18.8 MB. Max. memory is 5.3 GB. * TraceAbstraction took 152731.34 ms. Allocated memory was 305.1 MB in the beginning and 563.6 MB in the end (delta: 258.5 MB). Free memory was 230.4 MB in the beginning and 304.6 MB in the end (delta: -74.3 MB). Peak memory consumption was 184.2 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1460]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 1460). Cancelled while BasicCegarLoop was constructing difference of abstraction (112states) and interpolant automaton (currently 17 states, 41 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 129. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1456). Cancelled while BasicCegarLoop was constructing difference of abstraction (112states) and interpolant automaton (currently 17 states, 41 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 129. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1454). Cancelled while BasicCegarLoop was constructing difference of abstraction (112states) and interpolant automaton (currently 17 states, 41 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 129. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1448). Cancelled while BasicCegarLoop was constructing difference of abstraction (112states) and interpolant automaton (currently 17 states, 41 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 129. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1448). Cancelled while BasicCegarLoop was constructing difference of abstraction (112states) and interpolant automaton (currently 17 states, 41 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 129. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1456). Cancelled while BasicCegarLoop was constructing difference of abstraction (112states) and interpolant automaton (currently 17 states, 41 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 129. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1454). Cancelled while BasicCegarLoop was constructing difference of abstraction (112states) and interpolant automaton (currently 17 states, 41 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 129. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1454). Cancelled while BasicCegarLoop was constructing difference of abstraction (112states) and interpolant automaton (currently 17 states, 41 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 129. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1454). Cancelled while BasicCegarLoop was constructing difference of abstraction (112states) and interpolant automaton (currently 17 states, 41 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 129. - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 60 locations, 9 error locations. TIMEOUT Result, 152.6s OverallTime, 20 OverallIterations, 3 TraceHistogramMax, 111.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1091 SDtfs, 1757 SDslu, 7058 SDs, 0 SdLazy, 4720 SolverSat, 258 SolverUnsat, 76 SolverUnknown, 0 SolverNotchecked, 78.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1093 GetRequests, 690 SyntacticMatches, 28 SemanticMatches, 374 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2515 ImplicationChecksByTransitivity, 66.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=112occurred in iteration=18, 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.2s AutomataMinimizationTime, 19 MinimizatonAttempts, 313 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 38.9s InterpolantComputationTime, 1718 NumberOfCodeBlocks, 1718 NumberOfCodeBlocksAsserted, 35 NumberOfCheckSat, 1684 ConstructedInterpolants, 153 QuantifiedInterpolants, 895370 SizeOfPredicates, 98 NumberOfNonLiveVariables, 2161 ConjunctsInSsa, 277 ConjunctsInUnsatCore, 34 InterpolantComputations, 8 PerfectInterpolantSequences, 360/582 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test18_2_false-valid-memtrack_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-30_00-07-43-683.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test18_2_false-valid-memtrack_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-30_00-07-43-683.csv Completed graceful shutdown