java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loops/insertion_sort_false-unreach-call_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-06 22:35:57,240 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-06 22:35:57,242 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-06 22:35:57,258 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-06 22:35:57,258 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-06 22:35:57,259 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-06 22:35:57,261 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-06 22:35:57,264 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-06 22:35:57,266 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-06 22:35:57,267 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-06 22:35:57,269 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-06 22:35:57,270 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-06 22:35:57,271 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-06 22:35:57,272 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-06 22:35:57,273 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-06 22:35:57,276 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-06 22:35:57,277 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-06 22:35:57,286 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-06 22:35:57,290 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-06 22:35:57,292 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-06 22:35:57,295 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-06 22:35:57,297 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-06 22:35:57,299 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-06 22:35:57,299 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-06 22:35:57,299 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-06 22:35:57,300 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-06 22:35:57,303 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-06 22:35:57,304 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-06 22:35:57,305 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-06 22:35:57,307 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-06 22:35:57,308 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-06 22:35:57,309 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-06 22:35:57,309 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-06 22:35:57,309 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-06 22:35:57,310 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-06 22:35:57,311 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-06 22:35:57,311 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf [2018-11-06 22:35:57,341 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-06 22:35:57,341 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-06 22:35:57,342 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-06 22:35:57,343 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-06 22:35:57,343 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-06 22:35:57,345 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-06 22:35:57,345 INFO L133 SettingsManager]: * Use SBE=true [2018-11-06 22:35:57,345 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-06 22:35:57,345 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-06 22:35:57,346 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-06 22:35:57,346 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-06 22:35:57,346 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-06 22:35:57,346 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-06 22:35:57,346 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-06 22:35:57,346 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-06 22:35:57,347 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-06 22:35:57,347 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-06 22:35:57,347 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-06 22:35:57,347 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-06 22:35:57,347 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-06 22:35:57,348 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-06 22:35:57,349 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-06 22:35:57,349 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-06 22:35:57,349 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-06 22:35:57,350 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-06 22:35:57,350 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-06 22:35:57,350 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-06 22:35:57,350 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-06 22:35:57,396 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-06 22:35:57,408 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-06 22:35:57,412 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-06 22:35:57,414 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-06 22:35:57,414 INFO L276 PluginConnector]: CDTParser initialized [2018-11-06 22:35:57,415 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/insertion_sort_false-unreach-call_true-termination.i [2018-11-06 22:35:57,475 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ccf4f4df2/38a6af1a47624fabb08294bbf4eb2457/FLAGe8e46e0ac [2018-11-06 22:35:57,901 INFO L298 CDTParser]: Found 1 translation units. [2018-11-06 22:35:57,902 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/insertion_sort_false-unreach-call_true-termination.i [2018-11-06 22:35:57,909 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ccf4f4df2/38a6af1a47624fabb08294bbf4eb2457/FLAGe8e46e0ac [2018-11-06 22:35:57,924 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ccf4f4df2/38a6af1a47624fabb08294bbf4eb2457 [2018-11-06 22:35:57,936 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-06 22:35:57,937 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-06 22:35:57,938 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-06 22:35:57,938 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-06 22:35:57,942 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-06 22:35:57,943 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:35:57" (1/1) ... [2018-11-06 22:35:57,946 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3164a125 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:35:57, skipping insertion in model container [2018-11-06 22:35:57,946 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:35:57" (1/1) ... [2018-11-06 22:35:57,957 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-06 22:35:57,983 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-06 22:35:58,220 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-06 22:35:58,224 INFO L189 MainTranslator]: Completed pre-run [2018-11-06 22:35:58,258 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-06 22:35:58,280 INFO L193 MainTranslator]: Completed translation [2018-11-06 22:35:58,280 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:35:58 WrapperNode [2018-11-06 22:35:58,281 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-06 22:35:58,282 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-06 22:35:58,282 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-06 22:35:58,282 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-06 22:35:58,291 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:35:58" (1/1) ... [2018-11-06 22:35:58,299 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:35:58" (1/1) ... [2018-11-06 22:35:58,323 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-06 22:35:58,323 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-06 22:35:58,324 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-06 22:35:58,324 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-06 22:35:58,334 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:35:58" (1/1) ... [2018-11-06 22:35:58,334 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:35:58" (1/1) ... [2018-11-06 22:35:58,336 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:35:58" (1/1) ... [2018-11-06 22:35:58,337 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:35:58" (1/1) ... [2018-11-06 22:35:58,342 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:35:58" (1/1) ... [2018-11-06 22:35:58,348 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:35:58" (1/1) ... [2018-11-06 22:35:58,349 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:35:58" (1/1) ... [2018-11-06 22:35:58,353 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-06 22:35:58,353 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-06 22:35:58,353 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-06 22:35:58,356 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-06 22:35:58,357 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:35:58" (1/1) ... No working directory specified, using /storage/repos/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-11-06 22:35:58,491 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-06 22:35:58,491 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-06 22:35:58,491 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-06 22:35:58,492 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-06 22:35:58,492 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-06 22:35:58,492 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-06 22:35:58,972 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-06 22:35:58,973 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:35:58 BoogieIcfgContainer [2018-11-06 22:35:58,973 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-06 22:35:58,974 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-06 22:35:58,974 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-06 22:35:58,977 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-06 22:35:58,978 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:35:57" (1/3) ... [2018-11-06 22:35:58,978 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65cf8f34 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:35:58, skipping insertion in model container [2018-11-06 22:35:58,979 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:35:58" (2/3) ... [2018-11-06 22:35:58,979 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65cf8f34 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:35:58, skipping insertion in model container [2018-11-06 22:35:58,979 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:35:58" (3/3) ... [2018-11-06 22:35:58,981 INFO L112 eAbstractionObserver]: Analyzing ICFG insertion_sort_false-unreach-call_true-termination.i [2018-11-06 22:35:58,991 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-06 22:35:59,000 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-06 22:35:59,016 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-06 22:35:59,049 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-06 22:35:59,050 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-06 22:35:59,050 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-06 22:35:59,050 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-06 22:35:59,050 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-06 22:35:59,051 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-06 22:35:59,051 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-06 22:35:59,051 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-06 22:35:59,051 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-06 22:35:59,069 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states. [2018-11-06 22:35:59,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-06 22:35:59,076 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 22:35:59,077 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 22:35:59,079 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 22:35:59,086 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 22:35:59,086 INFO L82 PathProgramCache]: Analyzing trace with hash -204858120, now seen corresponding path program 1 times [2018-11-06 22:35:59,088 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 22:35:59,089 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 22:35:59,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:35:59,143 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 22:35:59,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:35:59,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:35:59,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 22:35:59,228 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 22:35:59,229 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-06 22:35:59,233 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-06 22:35:59,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-06 22:35:59,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-06 22:35:59,248 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 2 states. [2018-11-06 22:35:59,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 22:35:59,266 INFO L93 Difference]: Finished difference Result 72 states and 88 transitions. [2018-11-06 22:35:59,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-06 22:35:59,268 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 13 [2018-11-06 22:35:59,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 22:35:59,278 INFO L225 Difference]: With dead ends: 72 [2018-11-06 22:35:59,279 INFO L226 Difference]: Without dead ends: 32 [2018-11-06 22:35:59,282 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-06 22:35:59,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-11-06 22:35:59,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-11-06 22:35:59,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-06 22:35:59,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2018-11-06 22:35:59,316 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 13 [2018-11-06 22:35:59,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 22:35:59,317 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2018-11-06 22:35:59,317 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-06 22:35:59,317 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2018-11-06 22:35:59,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-06 22:35:59,318 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 22:35:59,318 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 22:35:59,319 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 22:35:59,319 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 22:35:59,319 INFO L82 PathProgramCache]: Analyzing trace with hash -141287409, now seen corresponding path program 1 times [2018-11-06 22:35:59,319 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 22:35:59,320 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 22:35:59,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:35:59,321 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 22:35:59,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:35:59,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:35:59,711 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 22:35:59,711 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 22:35:59,712 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-06 22:35:59,715 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-06 22:35:59,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-06 22:35:59,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-06 22:35:59,717 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand 5 states. [2018-11-06 22:35:59,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 22:35:59,975 INFO L93 Difference]: Finished difference Result 62 states and 70 transitions. [2018-11-06 22:35:59,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-06 22:35:59,976 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-11-06 22:35:59,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 22:35:59,979 INFO L225 Difference]: With dead ends: 62 [2018-11-06 22:35:59,980 INFO L226 Difference]: Without dead ends: 49 [2018-11-06 22:35:59,982 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-11-06 22:35:59,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-11-06 22:35:59,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 34. [2018-11-06 22:35:59,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-06 22:35:59,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2018-11-06 22:35:59,992 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 14 [2018-11-06 22:35:59,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 22:35:59,994 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2018-11-06 22:35:59,995 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-06 22:35:59,995 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2018-11-06 22:35:59,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-06 22:35:59,996 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 22:35:59,997 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 22:35:59,997 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 22:35:59,997 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 22:35:59,998 INFO L82 PathProgramCache]: Analyzing trace with hash -2069400451, now seen corresponding path program 1 times [2018-11-06 22:35:59,998 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 22:35:59,998 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 22:35:59,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:35:59,999 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 22:35:59,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:36:00,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:36:00,286 WARN L179 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 8 DAG size of output: 5 [2018-11-06 22:36:00,305 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 22:36:00,305 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 22:36:00,305 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-06 22:36:00,306 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-06 22:36:00,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-06 22:36:00,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-06 22:36:00,307 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand 5 states. [2018-11-06 22:36:00,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 22:36:00,572 INFO L93 Difference]: Finished difference Result 90 states and 104 transitions. [2018-11-06 22:36:00,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-06 22:36:00,572 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2018-11-06 22:36:00,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 22:36:00,574 INFO L225 Difference]: With dead ends: 90 [2018-11-06 22:36:00,574 INFO L226 Difference]: Without dead ends: 62 [2018-11-06 22:36:00,575 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-11-06 22:36:00,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-11-06 22:36:00,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 39. [2018-11-06 22:36:00,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-06 22:36:00,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2018-11-06 22:36:00,582 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 24 [2018-11-06 22:36:00,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 22:36:00,582 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2018-11-06 22:36:00,583 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-06 22:36:00,583 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2018-11-06 22:36:00,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-06 22:36:00,584 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 22:36:00,584 INFO L375 BasicCegarLoop]: trace histogram [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-11-06 22:36:00,584 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 22:36:00,585 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 22:36:00,585 INFO L82 PathProgramCache]: Analyzing trace with hash -1408382080, now seen corresponding path program 1 times [2018-11-06 22:36:00,585 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 22:36:00,585 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 22:36:00,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:36:00,587 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 22:36:00,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:36:00,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:36:01,117 WARN L179 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 16 [2018-11-06 22:36:01,708 WARN L179 SmtUtils]: Spent 271.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 19 [2018-11-06 22:36:02,082 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 22:36:02,082 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 22:36:02,083 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/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-11-06 22:36:02,103 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 22:36:02,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:36:02,140 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 22:36:02,537 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 28 treesize of output 23 [2018-11-06 22:36:02,546 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:36:02,560 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 23 treesize of output 37 [2018-11-06 22:36:02,561 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-06 22:36:02,585 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-06 22:36:02,610 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-06 22:36:02,610 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:37, output treesize:30 [2018-11-06 22:36:02,765 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 26 treesize of output 18 [2018-11-06 22:36:02,773 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-11-06 22:36:02,774 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-06 22:36:02,781 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-06 22:36:02,783 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-06 22:36:02,783 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2018-11-06 22:36:02,809 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 22:36:02,829 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-06 22:36:02,830 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 23 [2018-11-06 22:36:02,830 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-11-06 22:36:02,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-06 22:36:02,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=401, Unknown=0, NotChecked=0, Total=506 [2018-11-06 22:36:02,832 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand 23 states. [2018-11-06 22:36:04,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 22:36:04,323 INFO L93 Difference]: Finished difference Result 137 states and 155 transitions. [2018-11-06 22:36:04,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-06 22:36:04,325 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 26 [2018-11-06 22:36:04,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 22:36:04,327 INFO L225 Difference]: With dead ends: 137 [2018-11-06 22:36:04,327 INFO L226 Difference]: Without dead ends: 109 [2018-11-06 22:36:04,329 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 16 SyntacticMatches, 4 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 339 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=275, Invalid=985, Unknown=0, NotChecked=0, Total=1260 [2018-11-06 22:36:04,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-11-06 22:36:04,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 62. [2018-11-06 22:36:04,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-11-06 22:36:04,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 70 transitions. [2018-11-06 22:36:04,340 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 70 transitions. Word has length 26 [2018-11-06 22:36:04,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 22:36:04,340 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 70 transitions. [2018-11-06 22:36:04,340 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-11-06 22:36:04,341 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 70 transitions. [2018-11-06 22:36:04,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-06 22:36:04,343 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 22:36:04,343 INFO L375 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] [2018-11-06 22:36:04,343 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 22:36:04,344 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 22:36:04,345 INFO L82 PathProgramCache]: Analyzing trace with hash 1847598224, now seen corresponding path program 1 times [2018-11-06 22:36:04,345 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 22:36:04,345 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 22:36:04,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:36:04,346 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 22:36:04,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:36:04,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:36:04,712 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 22:36:04,712 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 22:36:04,713 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/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-11-06 22:36:04,722 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 22:36:04,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:36:04,747 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 22:36:04,816 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 22:36:04,836 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-06 22:36:04,836 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 9 [2018-11-06 22:36:04,837 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-06 22:36:04,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-06 22:36:04,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-11-06 22:36:04,839 INFO L87 Difference]: Start difference. First operand 62 states and 70 transitions. Second operand 9 states. [2018-11-06 22:36:05,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 22:36:05,072 INFO L93 Difference]: Finished difference Result 104 states and 116 transitions. [2018-11-06 22:36:05,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-06 22:36:05,073 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 34 [2018-11-06 22:36:05,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 22:36:05,074 INFO L225 Difference]: With dead ends: 104 [2018-11-06 22:36:05,074 INFO L226 Difference]: Without dead ends: 83 [2018-11-06 22:36:05,075 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 32 SyntacticMatches, 6 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2018-11-06 22:36:05,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-11-06 22:36:05,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 66. [2018-11-06 22:36:05,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-11-06 22:36:05,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 74 transitions. [2018-11-06 22:36:05,083 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 74 transitions. Word has length 34 [2018-11-06 22:36:05,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 22:36:05,084 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 74 transitions. [2018-11-06 22:36:05,084 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-06 22:36:05,084 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 74 transitions. [2018-11-06 22:36:05,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-06 22:36:05,086 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 22:36:05,086 INFO L375 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] [2018-11-06 22:36:05,086 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 22:36:05,086 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 22:36:05,086 INFO L82 PathProgramCache]: Analyzing trace with hash 22086920, now seen corresponding path program 1 times [2018-11-06 22:36:05,087 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 22:36:05,087 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 22:36:05,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:36:05,088 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 22:36:05,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:36:05,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:36:06,053 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 22:36:06,054 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 22:36:06,054 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/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-11-06 22:36:06,064 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 22:36:06,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:36:06,082 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 22:36:06,298 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 41 treesize of output 34 [2018-11-06 22:36:06,315 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:36:06,321 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 34 treesize of output 50 [2018-11-06 22:36:06,322 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-06 22:36:06,350 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-06 22:36:06,364 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-06 22:36:06,365 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:47, output treesize:40 [2018-11-06 22:36:06,880 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:36:06,881 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 50 treesize of output 52 [2018-11-06 22:36:06,890 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:36:06,891 INFO L682 Elim1Store]: detected equality via solver [2018-11-06 22:36:06,895 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:36:06,898 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 71 [2018-11-06 22:36:06,902 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-06 22:36:06,914 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-06 22:36:06,934 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-06 22:36:06,935 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:64, output treesize:29 [2018-11-06 22:36:07,073 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 39 treesize of output 31 [2018-11-06 22:36:07,106 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:36:07,128 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:36:07,144 INFO L682 Elim1Store]: detected equality via solver [2018-11-06 22:36:07,160 INFO L682 Elim1Store]: detected equality via solver [2018-11-06 22:36:07,181 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:36:07,182 INFO L303 Elim1Store]: Index analysis took 107 ms [2018-11-06 22:36:07,183 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 56 [2018-11-06 22:36:07,185 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-06 22:36:07,263 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-06 22:36:07,270 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-06 22:36:07,270 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:45, output treesize:5 [2018-11-06 22:36:07,295 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 22:36:07,322 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-06 22:36:07,322 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 19] total 33 [2018-11-06 22:36:07,323 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-11-06 22:36:07,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-11-06 22:36:07,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=902, Unknown=0, NotChecked=0, Total=1056 [2018-11-06 22:36:07,324 INFO L87 Difference]: Start difference. First operand 66 states and 74 transitions. Second operand 33 states. [2018-11-06 22:36:08,626 WARN L179 SmtUtils]: Spent 303.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 34 [2018-11-06 22:36:09,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 22:36:09,182 INFO L93 Difference]: Finished difference Result 136 states and 155 transitions. [2018-11-06 22:36:09,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-06 22:36:09,184 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 35 [2018-11-06 22:36:09,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 22:36:09,187 INFO L225 Difference]: With dead ends: 136 [2018-11-06 22:36:09,187 INFO L226 Difference]: Without dead ends: 74 [2018-11-06 22:36:09,189 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 20 SyntacticMatches, 2 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 742 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=348, Invalid=1908, Unknown=0, NotChecked=0, Total=2256 [2018-11-06 22:36:09,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-11-06 22:36:09,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 55. [2018-11-06 22:36:09,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-11-06 22:36:09,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 60 transitions. [2018-11-06 22:36:09,196 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 60 transitions. Word has length 35 [2018-11-06 22:36:09,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 22:36:09,196 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 60 transitions. [2018-11-06 22:36:09,197 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-11-06 22:36:09,197 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 60 transitions. [2018-11-06 22:36:09,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-06 22:36:09,198 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 22:36:09,198 INFO L375 BasicCegarLoop]: trace histogram [3, 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] [2018-11-06 22:36:09,198 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 22:36:09,198 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 22:36:09,198 INFO L82 PathProgramCache]: Analyzing trace with hash 842679982, now seen corresponding path program 1 times [2018-11-06 22:36:09,199 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 22:36:09,199 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 22:36:09,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:36:09,200 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 22:36:09,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:36:09,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:36:09,306 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 22:36:09,306 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 22:36:09,306 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/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-11-06 22:36:09,316 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 22:36:09,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:36:09,331 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 22:36:09,337 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 22:36:09,357 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-06 22:36:09,358 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 8 [2018-11-06 22:36:09,360 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-06 22:36:09,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-06 22:36:09,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-11-06 22:36:09,361 INFO L87 Difference]: Start difference. First operand 55 states and 60 transitions. Second operand 8 states. [2018-11-06 22:36:09,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 22:36:09,632 INFO L93 Difference]: Finished difference Result 111 states and 124 transitions. [2018-11-06 22:36:09,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-06 22:36:09,633 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 36 [2018-11-06 22:36:09,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 22:36:09,634 INFO L225 Difference]: With dead ends: 111 [2018-11-06 22:36:09,634 INFO L226 Difference]: Without dead ends: 83 [2018-11-06 22:36:09,634 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2018-11-06 22:36:09,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-11-06 22:36:09,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 58. [2018-11-06 22:36:09,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-11-06 22:36:09,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 63 transitions. [2018-11-06 22:36:09,642 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 63 transitions. Word has length 36 [2018-11-06 22:36:09,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 22:36:09,643 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 63 transitions. [2018-11-06 22:36:09,643 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-06 22:36:09,643 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 63 transitions. [2018-11-06 22:36:09,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-11-06 22:36:09,644 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 22:36:09,644 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-11-06 22:36:09,644 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 22:36:09,645 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 22:36:09,645 INFO L82 PathProgramCache]: Analyzing trace with hash 1077204337, now seen corresponding path program 2 times [2018-11-06 22:36:09,645 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 22:36:09,645 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 22:36:09,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:36:09,646 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 22:36:09,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:36:09,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:36:10,686 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 22:36:10,687 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 22:36:10,687 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/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-11-06 22:36:10,698 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-06 22:36:10,744 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-06 22:36:10,744 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-06 22:36:10,747 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 22:36:11,111 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 44 treesize of output 35 [2018-11-06 22:36:11,113 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:36:11,117 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 37 [2018-11-06 22:36:11,118 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-06 22:36:11,123 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-06 22:36:11,131 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-06 22:36:11,131 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:50, output treesize:27 [2018-11-06 22:36:11,204 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 27 treesize of output 20 [2018-11-06 22:36:11,211 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:36:11,212 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:36:11,212 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:36:11,216 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 20 treesize of output 43 [2018-11-06 22:36:11,217 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-06 22:36:11,225 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-06 22:36:11,231 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-06 22:36:11,231 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:17 [2018-11-06 22:36:11,455 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 26 treesize of output 18 [2018-11-06 22:36:11,491 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-11-06 22:36:11,492 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-06 22:36:11,517 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-06 22:36:11,523 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-06 22:36:11,523 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2018-11-06 22:36:11,545 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 22:36:11,566 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-06 22:36:11,566 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 18] total 26 [2018-11-06 22:36:11,566 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-11-06 22:36:11,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-11-06 22:36:11,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=529, Unknown=0, NotChecked=0, Total=650 [2018-11-06 22:36:11,567 INFO L87 Difference]: Start difference. First operand 58 states and 63 transitions. Second operand 26 states. [2018-11-06 22:36:13,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 22:36:13,089 INFO L93 Difference]: Finished difference Result 198 states and 221 transitions. [2018-11-06 22:36:13,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-11-06 22:36:13,090 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 38 [2018-11-06 22:36:13,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 22:36:13,092 INFO L225 Difference]: With dead ends: 198 [2018-11-06 22:36:13,092 INFO L226 Difference]: Without dead ends: 167 [2018-11-06 22:36:13,094 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 26 SyntacticMatches, 6 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 578 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=342, Invalid=1550, Unknown=0, NotChecked=0, Total=1892 [2018-11-06 22:36:13,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2018-11-06 22:36:13,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 90. [2018-11-06 22:36:13,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-11-06 22:36:13,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 98 transitions. [2018-11-06 22:36:13,105 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 98 transitions. Word has length 38 [2018-11-06 22:36:13,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 22:36:13,106 INFO L480 AbstractCegarLoop]: Abstraction has 90 states and 98 transitions. [2018-11-06 22:36:13,106 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-11-06 22:36:13,106 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 98 transitions. [2018-11-06 22:36:13,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-11-06 22:36:13,107 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 22:36:13,108 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 22:36:13,108 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 22:36:13,108 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 22:36:13,108 INFO L82 PathProgramCache]: Analyzing trace with hash -409295487, now seen corresponding path program 2 times [2018-11-06 22:36:13,108 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 22:36:13,109 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 22:36:13,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:36:13,109 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-06 22:36:13,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:36:13,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:36:13,645 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 22:36:13,645 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 22:36:13,645 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/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-11-06 22:36:13,653 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-06 22:36:13,685 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-06 22:36:13,685 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-06 22:36:13,688 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 22:36:13,948 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-11-06 22:36:13,951 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:36:13,953 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-11-06 22:36:13,954 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-06 22:36:13,958 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-06 22:36:13,964 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-06 22:36:13,964 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2018-11-06 22:36:14,143 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 26 treesize of output 18 [2018-11-06 22:36:14,146 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-11-06 22:36:14,147 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-06 22:36:14,154 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-06 22:36:14,155 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-06 22:36:14,155 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2018-11-06 22:36:14,180 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 22:36:14,200 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-06 22:36:14,200 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16] total 30 [2018-11-06 22:36:14,201 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-11-06 22:36:14,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-11-06 22:36:14,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=766, Unknown=0, NotChecked=0, Total=870 [2018-11-06 22:36:14,202 INFO L87 Difference]: Start difference. First operand 90 states and 98 transitions. Second operand 30 states. [2018-11-06 22:36:15,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 22:36:15,916 INFO L93 Difference]: Finished difference Result 226 states and 250 transitions. [2018-11-06 22:36:15,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-11-06 22:36:15,917 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 46 [2018-11-06 22:36:15,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 22:36:15,918 INFO L225 Difference]: With dead ends: 226 [2018-11-06 22:36:15,918 INFO L226 Difference]: Without dead ends: 195 [2018-11-06 22:36:15,920 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 34 SyntacticMatches, 7 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 646 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=344, Invalid=2106, Unknown=0, NotChecked=0, Total=2450 [2018-11-06 22:36:15,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2018-11-06 22:36:15,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 122. [2018-11-06 22:36:15,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-11-06 22:36:15,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 134 transitions. [2018-11-06 22:36:15,935 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 134 transitions. Word has length 46 [2018-11-06 22:36:15,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 22:36:15,936 INFO L480 AbstractCegarLoop]: Abstraction has 122 states and 134 transitions. [2018-11-06 22:36:15,936 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-11-06 22:36:15,936 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 134 transitions. [2018-11-06 22:36:15,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-11-06 22:36:15,938 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 22:36:15,938 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 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-11-06 22:36:15,938 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 22:36:15,939 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 22:36:15,939 INFO L82 PathProgramCache]: Analyzing trace with hash -1222141385, now seen corresponding path program 2 times [2018-11-06 22:36:15,939 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 22:36:15,939 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 22:36:15,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:36:15,940 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-06 22:36:15,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:36:15,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:36:16,155 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 12 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 22:36:16,155 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 22:36:16,155 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/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-11-06 22:36:16,165 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-06 22:36:16,197 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-06 22:36:16,197 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-06 22:36:16,199 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 22:36:16,212 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 12 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 22:36:16,242 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-06 22:36:16,242 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 9 [2018-11-06 22:36:16,242 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-06 22:36:16,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-06 22:36:16,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-11-06 22:36:16,243 INFO L87 Difference]: Start difference. First operand 122 states and 134 transitions. Second operand 9 states. [2018-11-06 22:36:16,730 WARN L179 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 9 DAG size of output: 8 [2018-11-06 22:36:16,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 22:36:16,957 INFO L93 Difference]: Finished difference Result 206 states and 229 transitions. [2018-11-06 22:36:16,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-06 22:36:16,959 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 47 [2018-11-06 22:36:16,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 22:36:16,962 INFO L225 Difference]: With dead ends: 206 [2018-11-06 22:36:16,962 INFO L226 Difference]: Without dead ends: 175 [2018-11-06 22:36:16,963 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=109, Invalid=197, Unknown=0, NotChecked=0, Total=306 [2018-11-06 22:36:16,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2018-11-06 22:36:16,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 133. [2018-11-06 22:36:16,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-11-06 22:36:16,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 147 transitions. [2018-11-06 22:36:16,978 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 147 transitions. Word has length 47 [2018-11-06 22:36:16,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 22:36:16,978 INFO L480 AbstractCegarLoop]: Abstraction has 133 states and 147 transitions. [2018-11-06 22:36:16,978 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-06 22:36:16,979 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 147 transitions. [2018-11-06 22:36:16,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-11-06 22:36:16,980 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 22:36:16,981 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 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-11-06 22:36:16,981 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 22:36:16,981 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 22:36:16,981 INFO L82 PathProgramCache]: Analyzing trace with hash -1425669383, now seen corresponding path program 3 times [2018-11-06 22:36:16,981 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 22:36:16,981 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 22:36:16,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:36:16,982 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-06 22:36:16,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:36:16,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:36:17,889 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 22:36:17,889 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 22:36:17,889 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/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-11-06 22:36:17,898 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-06 22:36:17,916 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-06 22:36:17,916 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-06 22:36:17,920 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 22:36:18,016 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 41 treesize of output 34 [2018-11-06 22:36:18,018 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:36:18,020 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 34 treesize of output 50 [2018-11-06 22:36:18,021 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-06 22:36:18,029 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-06 22:36:18,043 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-06 22:36:18,044 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:52, output treesize:45 [2018-11-06 22:36:18,182 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:36:18,183 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 51 treesize of output 53 [2018-11-06 22:36:18,186 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:36:18,188 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:36:18,189 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 58 [2018-11-06 22:36:18,191 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-06 22:36:18,197 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-06 22:36:18,206 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-06 22:36:18,207 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:57, output treesize:29 [2018-11-06 22:36:18,366 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 41 treesize of output 32 [2018-11-06 22:36:18,386 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:36:18,387 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:36:18,388 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:36:18,390 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:36:18,396 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 68 [2018-11-06 22:36:18,397 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-06 22:36:18,408 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-06 22:36:18,415 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-06 22:36:18,415 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:47, output treesize:19 [2018-11-06 22:36:18,477 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 28 treesize of output 20 [2018-11-06 22:36:18,481 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:36:18,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, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-11-06 22:36:18,483 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-06 22:36:18,484 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-06 22:36:18,485 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-06 22:36:18,486 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:5 [2018-11-06 22:36:18,507 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 22:36:18,528 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-06 22:36:18,528 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 22] total 30 [2018-11-06 22:36:18,529 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-11-06 22:36:18,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-11-06 22:36:18,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=732, Unknown=0, NotChecked=0, Total=870 [2018-11-06 22:36:18,530 INFO L87 Difference]: Start difference. First operand 133 states and 147 transitions. Second operand 30 states. [2018-11-06 22:36:20,209 WARN L179 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 20 [2018-11-06 22:36:20,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 22:36:20,740 INFO L93 Difference]: Finished difference Result 288 states and 322 transitions. [2018-11-06 22:36:20,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-11-06 22:36:20,740 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 47 [2018-11-06 22:36:20,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 22:36:20,741 INFO L225 Difference]: With dead ends: 288 [2018-11-06 22:36:20,742 INFO L226 Difference]: Without dead ends: 246 [2018-11-06 22:36:20,743 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 32 SyntacticMatches, 11 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1033 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=444, Invalid=2636, Unknown=0, NotChecked=0, Total=3080 [2018-11-06 22:36:20,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2018-11-06 22:36:20,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 112. [2018-11-06 22:36:20,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-11-06 22:36:20,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 124 transitions. [2018-11-06 22:36:20,755 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 124 transitions. Word has length 47 [2018-11-06 22:36:20,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 22:36:20,755 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 124 transitions. [2018-11-06 22:36:20,756 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-11-06 22:36:20,756 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 124 transitions. [2018-11-06 22:36:20,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-11-06 22:36:20,757 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 22:36:20,758 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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] [2018-11-06 22:36:20,758 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 22:36:20,758 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 22:36:20,758 INFO L82 PathProgramCache]: Analyzing trace with hash 1058761402, now seen corresponding path program 1 times [2018-11-06 22:36:20,758 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 22:36:20,758 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 22:36:20,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:36:20,759 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-06 22:36:20,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:36:20,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:36:21,416 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 22:36:21,416 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 22:36:21,416 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/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-11-06 22:36:21,433 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 22:36:21,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:36:21,464 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 22:36:21,612 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 28 treesize of output 23 [2018-11-06 22:36:21,617 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:36:21,618 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 23 treesize of output 37 [2018-11-06 22:36:21,619 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-06 22:36:21,689 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-06 22:36:21,698 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-06 22:36:21,699 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:31 [2018-11-06 22:36:21,759 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 26 treesize of output 18 [2018-11-06 22:36:21,762 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-11-06 22:36:21,763 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-06 22:36:21,764 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-06 22:36:21,765 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-06 22:36:21,765 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2018-11-06 22:36:21,784 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 22:36:21,804 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-06 22:36:21,805 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 17] total 19 [2018-11-06 22:36:21,805 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-06 22:36:21,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-06 22:36:21,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=277, Unknown=0, NotChecked=0, Total=342 [2018-11-06 22:36:21,806 INFO L87 Difference]: Start difference. First operand 112 states and 124 transitions. Second operand 19 states. [2018-11-06 22:36:23,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 22:36:23,661 INFO L93 Difference]: Finished difference Result 326 states and 361 transitions. [2018-11-06 22:36:23,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-11-06 22:36:23,664 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 49 [2018-11-06 22:36:23,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 22:36:23,666 INFO L225 Difference]: With dead ends: 326 [2018-11-06 22:36:23,666 INFO L226 Difference]: Without dead ends: 282 [2018-11-06 22:36:23,667 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 39 SyntacticMatches, 12 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 787 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=449, Invalid=2521, Unknown=0, NotChecked=0, Total=2970 [2018-11-06 22:36:23,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2018-11-06 22:36:23,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 135. [2018-11-06 22:36:23,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-11-06 22:36:23,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 151 transitions. [2018-11-06 22:36:23,684 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 151 transitions. Word has length 49 [2018-11-06 22:36:23,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 22:36:23,684 INFO L480 AbstractCegarLoop]: Abstraction has 135 states and 151 transitions. [2018-11-06 22:36:23,684 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-06 22:36:23,684 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 151 transitions. [2018-11-06 22:36:23,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-11-06 22:36:23,686 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 22:36:23,686 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 22:36:23,686 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 22:36:23,686 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 22:36:23,686 INFO L82 PathProgramCache]: Analyzing trace with hash 947348881, now seen corresponding path program 3 times [2018-11-06 22:36:23,687 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 22:36:23,687 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 22:36:23,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:36:23,688 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 22:36:23,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:36:23,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:36:24,697 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 8 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 22:36:24,697 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 22:36:24,697 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/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-11-06 22:36:24,722 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-06 22:36:24,743 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-06 22:36:24,743 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-06 22:36:24,747 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 22:36:24,842 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 8 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 22:36:24,872 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-06 22:36:24,872 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 11 [2018-11-06 22:36:24,872 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-06 22:36:24,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-06 22:36:24,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2018-11-06 22:36:24,873 INFO L87 Difference]: Start difference. First operand 135 states and 151 transitions. Second operand 11 states. [2018-11-06 22:36:25,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 22:36:25,229 INFO L93 Difference]: Finished difference Result 226 states and 250 transitions. [2018-11-06 22:36:25,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-06 22:36:25,230 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 54 [2018-11-06 22:36:25,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 22:36:25,231 INFO L225 Difference]: With dead ends: 226 [2018-11-06 22:36:25,231 INFO L226 Difference]: Without dead ends: 197 [2018-11-06 22:36:25,232 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 51 SyntacticMatches, 5 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2018-11-06 22:36:25,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2018-11-06 22:36:25,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 152. [2018-11-06 22:36:25,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-11-06 22:36:25,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 169 transitions. [2018-11-06 22:36:25,247 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 169 transitions. Word has length 54 [2018-11-06 22:36:25,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 22:36:25,248 INFO L480 AbstractCegarLoop]: Abstraction has 152 states and 169 transitions. [2018-11-06 22:36:25,248 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-06 22:36:25,248 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 169 transitions. [2018-11-06 22:36:25,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-11-06 22:36:25,249 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 22:36:25,249 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 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] [2018-11-06 22:36:25,249 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 22:36:25,249 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 22:36:25,250 INFO L82 PathProgramCache]: Analyzing trace with hash -1130372662, now seen corresponding path program 1 times [2018-11-06 22:36:25,250 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 22:36:25,250 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 22:36:25,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:36:25,251 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-06 22:36:25,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:36:25,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:36:26,201 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 22:36:26,201 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 22:36:26,202 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/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-11-06 22:36:26,210 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 22:36:26,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:36:26,230 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 22:36:26,430 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 41 treesize of output 34 [2018-11-06 22:36:26,433 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:36:26,435 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 34 treesize of output 50 [2018-11-06 22:36:26,435 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-06 22:36:26,442 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-06 22:36:26,453 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-06 22:36:26,454 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:47, output treesize:40 [2018-11-06 22:36:26,607 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:36:26,608 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 43 treesize of output 45 [2018-11-06 22:36:26,610 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:36:26,611 INFO L682 Elim1Store]: detected equality via solver [2018-11-06 22:36:26,613 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:36:26,614 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 59 [2018-11-06 22:36:26,616 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-06 22:36:26,623 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-06 22:36:26,633 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-06 22:36:26,633 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:52, output treesize:30 [2018-11-06 22:36:26,922 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 32 treesize of output 24 [2018-11-06 22:36:26,925 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:36:26,926 INFO L682 Elim1Store]: detected equality via solver [2018-11-06 22:36:26,926 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:36:26,927 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 31 [2018-11-06 22:36:26,928 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-06 22:36:26,932 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-06 22:36:26,936 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-06 22:36:26,936 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:5 [2018-11-06 22:36:26,974 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 22:36:26,993 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-06 22:36:26,994 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 21] total 37 [2018-11-06 22:36:26,994 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-11-06 22:36:26,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-11-06 22:36:26,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=1195, Unknown=0, NotChecked=0, Total=1332 [2018-11-06 22:36:26,995 INFO L87 Difference]: Start difference. First operand 152 states and 169 transitions. Second operand 37 states. [2018-11-06 22:36:28,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 22:36:28,453 INFO L93 Difference]: Finished difference Result 210 states and 232 transitions. [2018-11-06 22:36:28,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-11-06 22:36:28,453 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 57 [2018-11-06 22:36:28,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 22:36:28,454 INFO L225 Difference]: With dead ends: 210 [2018-11-06 22:36:28,454 INFO L226 Difference]: Without dead ends: 193 [2018-11-06 22:36:28,456 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 40 SyntacticMatches, 6 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 765 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=318, Invalid=2438, Unknown=0, NotChecked=0, Total=2756 [2018-11-06 22:36:28,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2018-11-06 22:36:28,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 159. [2018-11-06 22:36:28,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2018-11-06 22:36:28,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 177 transitions. [2018-11-06 22:36:28,472 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 177 transitions. Word has length 57 [2018-11-06 22:36:28,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 22:36:28,473 INFO L480 AbstractCegarLoop]: Abstraction has 159 states and 177 transitions. [2018-11-06 22:36:28,473 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-11-06 22:36:28,473 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 177 transitions. [2018-11-06 22:36:28,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-11-06 22:36:28,474 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 22:36:28,474 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 22:36:28,474 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 22:36:28,474 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 22:36:28,475 INFO L82 PathProgramCache]: Analyzing trace with hash 518147314, now seen corresponding path program 4 times [2018-11-06 22:36:28,475 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 22:36:28,475 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 22:36:28,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:36:28,475 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 22:36:28,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:36:28,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:36:29,278 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 22:36:29,279 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 22:36:29,279 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/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-11-06 22:36:29,287 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-06 22:36:29,303 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-06 22:36:29,304 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-06 22:36:29,307 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 22:36:29,378 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 27 treesize of output 22 [2018-11-06 22:36:29,381 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:36:29,382 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 22 treesize of output 35 [2018-11-06 22:36:29,382 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-06 22:36:29,388 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-06 22:36:29,397 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-06 22:36:29,397 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:33, output treesize:26 [2018-11-06 22:36:29,510 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 36 treesize of output 29 [2018-11-06 22:36:29,535 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:36:29,538 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:36:29,541 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:36:29,553 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 29 treesize of output 70 [2018-11-06 22:36:29,553 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-06 22:36:29,564 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-06 22:36:29,572 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-06 22:36:29,572 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:52, output treesize:19 [2018-11-06 22:36:29,666 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 36 treesize of output 28 [2018-11-06 22:36:29,675 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:36:29,676 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:36:29,676 INFO L682 Elim1Store]: detected equality via solver [2018-11-06 22:36:29,679 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 37 [2018-11-06 22:36:29,681 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-06 22:36:29,685 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-06 22:36:29,687 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-06 22:36:29,687 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:36, output treesize:3 [2018-11-06 22:36:29,717 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 22:36:29,737 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-06 22:36:29,737 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18] total 24 [2018-11-06 22:36:29,737 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-06 22:36:29,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-06 22:36:29,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=480, Unknown=0, NotChecked=0, Total=552 [2018-11-06 22:36:29,738 INFO L87 Difference]: Start difference. First operand 159 states and 177 transitions. Second operand 24 states. [2018-11-06 22:36:31,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 22:36:31,349 INFO L93 Difference]: Finished difference Result 249 states and 278 transitions. [2018-11-06 22:36:31,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-11-06 22:36:31,349 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 58 [2018-11-06 22:36:31,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 22:36:31,350 INFO L225 Difference]: With dead ends: 249 [2018-11-06 22:36:31,350 INFO L226 Difference]: Without dead ends: 205 [2018-11-06 22:36:31,351 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 46 SyntacticMatches, 16 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 422 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=219, Invalid=1263, Unknown=0, NotChecked=0, Total=1482 [2018-11-06 22:36:31,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2018-11-06 22:36:31,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 168. [2018-11-06 22:36:31,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2018-11-06 22:36:31,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 186 transitions. [2018-11-06 22:36:31,371 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 186 transitions. Word has length 58 [2018-11-06 22:36:31,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 22:36:31,371 INFO L480 AbstractCegarLoop]: Abstraction has 168 states and 186 transitions. [2018-11-06 22:36:31,371 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-06 22:36:31,372 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 186 transitions. [2018-11-06 22:36:31,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-11-06 22:36:31,372 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 22:36:31,372 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 22:36:31,373 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 22:36:31,373 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 22:36:31,373 INFO L82 PathProgramCache]: Analyzing trace with hash -323333489, now seen corresponding path program 1 times [2018-11-06 22:36:31,373 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 22:36:31,373 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 22:36:31,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:36:31,374 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-06 22:36:31,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:36:31,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:36:32,455 WARN L179 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 18 [2018-11-06 22:36:32,645 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 22:36:32,646 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 22:36:32,646 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/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-11-06 22:36:32,655 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 22:36:32,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:36:32,674 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 22:36:32,790 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 28 treesize of output 23 [2018-11-06 22:36:32,794 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:36:32,796 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 23 treesize of output 37 [2018-11-06 22:36:32,796 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-06 22:36:32,805 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-06 22:36:32,813 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-06 22:36:32,814 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:27 [2018-11-06 22:36:32,843 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 29 treesize of output 22 [2018-11-06 22:36:32,845 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:36:32,846 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:36:32,847 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:36:32,852 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 22 treesize of output 49 [2018-11-06 22:36:32,852 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-06 22:36:32,860 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-06 22:36:32,867 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-06 22:36:32,867 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:19 [2018-11-06 22:36:32,925 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 25 [2018-11-06 22:36:32,928 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:36:32,929 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:36:32,930 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:36:32,935 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 58 [2018-11-06 22:36:32,936 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-06 22:36:32,946 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-06 22:36:32,954 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-06 22:36:32,954 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:19 [2018-11-06 22:36:33,002 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 26 treesize of output 18 [2018-11-06 22:36:33,005 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-11-06 22:36:33,005 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-06 22:36:33,007 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-06 22:36:33,007 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-06 22:36:33,008 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2018-11-06 22:36:33,029 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 6 proven. 51 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-06 22:36:33,048 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-06 22:36:33,049 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20] total 27 [2018-11-06 22:36:33,049 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-11-06 22:36:33,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-11-06 22:36:33,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=580, Unknown=0, NotChecked=0, Total=702 [2018-11-06 22:36:33,050 INFO L87 Difference]: Start difference. First operand 168 states and 186 transitions. Second operand 27 states. [2018-11-06 22:36:34,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 22:36:34,576 INFO L93 Difference]: Finished difference Result 418 states and 468 transitions. [2018-11-06 22:36:34,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-11-06 22:36:34,576 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 58 [2018-11-06 22:36:34,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 22:36:34,578 INFO L225 Difference]: With dead ends: 418 [2018-11-06 22:36:34,578 INFO L226 Difference]: Without dead ends: 374 [2018-11-06 22:36:34,579 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 46 SyntacticMatches, 12 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1002 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=434, Invalid=2536, Unknown=0, NotChecked=0, Total=2970 [2018-11-06 22:36:34,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2018-11-06 22:36:34,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 247. [2018-11-06 22:36:34,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2018-11-06 22:36:34,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 278 transitions. [2018-11-06 22:36:34,604 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 278 transitions. Word has length 58 [2018-11-06 22:36:34,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 22:36:34,605 INFO L480 AbstractCegarLoop]: Abstraction has 247 states and 278 transitions. [2018-11-06 22:36:34,605 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-11-06 22:36:34,605 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 278 transitions. [2018-11-06 22:36:34,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-11-06 22:36:34,606 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 22:36:34,606 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 3, 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] [2018-11-06 22:36:34,606 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 22:36:34,606 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 22:36:34,606 INFO L82 PathProgramCache]: Analyzing trace with hash -2100697330, now seen corresponding path program 4 times [2018-11-06 22:36:34,607 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 22:36:34,607 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 22:36:34,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:36:34,607 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 22:36:34,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:36:34,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:36:34,882 WARN L179 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-11-06 22:36:35,136 WARN L179 SmtUtils]: Spent 181.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-11-06 22:36:35,443 WARN L179 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 13 [2018-11-06 22:36:35,971 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 22:36:35,971 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 22:36:35,971 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/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-11-06 22:36:35,979 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-06 22:36:35,997 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-06 22:36:35,997 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-06 22:36:35,999 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 22:36:36,283 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 41 treesize of output 34 [2018-11-06 22:36:36,285 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:36:36,287 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 34 treesize of output 50 [2018-11-06 22:36:36,287 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-06 22:36:36,295 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-06 22:36:36,305 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-06 22:36:36,306 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:47, output treesize:40 [2018-11-06 22:36:36,465 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:36:36,466 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 50 treesize of output 52 [2018-11-06 22:36:36,470 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:36:36,471 INFO L682 Elim1Store]: detected equality via solver [2018-11-06 22:36:36,474 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:36:36,476 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 71 [2018-11-06 22:36:36,477 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-06 22:36:36,485 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-06 22:36:36,496 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-06 22:36:36,496 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:64, output treesize:29 [2018-11-06 22:36:36,660 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 39 treesize of output 31 [2018-11-06 22:36:36,662 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:36:36,663 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:36:36,664 INFO L682 Elim1Store]: detected equality via solver [2018-11-06 22:36:36,664 INFO L682 Elim1Store]: detected equality via solver [2018-11-06 22:36:36,665 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:36:36,666 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 49 [2018-11-06 22:36:36,667 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-06 22:36:36,673 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-06 22:36:36,680 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-06 22:36:36,680 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:45, output treesize:5 [2018-11-06 22:36:36,703 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 12 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 22:36:36,722 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-06 22:36:36,722 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 21] total 40 [2018-11-06 22:36:36,723 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-11-06 22:36:36,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-11-06 22:36:36,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=1378, Unknown=0, NotChecked=0, Total=1560 [2018-11-06 22:36:36,724 INFO L87 Difference]: Start difference. First operand 247 states and 278 transitions. Second operand 40 states. [2018-11-06 22:36:40,843 WARN L179 SmtUtils]: Spent 162.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2018-11-06 22:36:41,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 22:36:41,463 INFO L93 Difference]: Finished difference Result 487 states and 551 transitions. [2018-11-06 22:36:41,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-11-06 22:36:41,463 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 58 [2018-11-06 22:36:41,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 22:36:41,464 INFO L225 Difference]: With dead ends: 487 [2018-11-06 22:36:41,465 INFO L226 Difference]: Without dead ends: 362 [2018-11-06 22:36:41,468 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2724 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=1183, Invalid=7559, Unknown=0, NotChecked=0, Total=8742 [2018-11-06 22:36:41,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2018-11-06 22:36:41,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 241. [2018-11-06 22:36:41,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2018-11-06 22:36:41,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 266 transitions. [2018-11-06 22:36:41,494 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 266 transitions. Word has length 58 [2018-11-06 22:36:41,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 22:36:41,495 INFO L480 AbstractCegarLoop]: Abstraction has 241 states and 266 transitions. [2018-11-06 22:36:41,495 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-11-06 22:36:41,495 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 266 transitions. [2018-11-06 22:36:41,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-11-06 22:36:41,496 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 22:36:41,496 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 22:36:41,496 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 22:36:41,496 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 22:36:41,496 INFO L82 PathProgramCache]: Analyzing trace with hash 310078891, now seen corresponding path program 2 times [2018-11-06 22:36:41,497 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 22:36:41,497 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 22:36:41,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:36:41,497 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-06 22:36:41,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:36:41,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:36:42,098 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 22:36:42,098 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 22:36:42,098 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-06 22:36:42,115 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-06 22:36:42,134 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-06 22:36:42,135 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-06 22:36:42,136 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 22:36:42,399 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 28 treesize of output 23 [2018-11-06 22:36:42,402 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:36:42,403 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 23 treesize of output 37 [2018-11-06 22:36:42,403 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-06 22:36:42,411 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-06 22:36:42,424 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-06 22:36:42,425 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:44, output treesize:37 [2018-11-06 22:36:42,524 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 25 [2018-11-06 22:36:42,528 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:36:42,529 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:36:42,530 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:36:42,535 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 58 [2018-11-06 22:36:42,535 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-06 22:36:42,543 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-06 22:36:42,553 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-06 22:36:42,553 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:45, output treesize:19 [2018-11-06 22:36:42,619 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 26 treesize of output 18 [2018-11-06 22:36:42,623 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-11-06 22:36:42,624 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-06 22:36:42,629 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-06 22:36:42,630 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-06 22:36:42,630 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2018-11-06 22:36:42,651 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 6 proven. 54 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 22:36:42,671 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-06 22:36:42,672 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 20] total 28 [2018-11-06 22:36:42,672 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-11-06 22:36:42,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-11-06 22:36:42,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=635, Unknown=0, NotChecked=0, Total=756 [2018-11-06 22:36:42,673 INFO L87 Difference]: Start difference. First operand 241 states and 266 transitions. Second operand 28 states. [2018-11-06 22:36:44,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 22:36:44,547 INFO L93 Difference]: Finished difference Result 409 states and 454 transitions. [2018-11-06 22:36:44,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-11-06 22:36:44,547 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 61 [2018-11-06 22:36:44,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 22:36:44,549 INFO L225 Difference]: With dead ends: 409 [2018-11-06 22:36:44,549 INFO L226 Difference]: Without dead ends: 338 [2018-11-06 22:36:44,550 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 48 SyntacticMatches, 10 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 693 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=425, Invalid=2331, Unknown=0, NotChecked=0, Total=2756 [2018-11-06 22:36:44,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2018-11-06 22:36:44,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 262. [2018-11-06 22:36:44,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262 states. [2018-11-06 22:36:44,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 291 transitions. [2018-11-06 22:36:44,579 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 291 transitions. Word has length 61 [2018-11-06 22:36:44,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 22:36:44,580 INFO L480 AbstractCegarLoop]: Abstraction has 262 states and 291 transitions. [2018-11-06 22:36:44,580 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-11-06 22:36:44,580 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 291 transitions. [2018-11-06 22:36:44,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-11-06 22:36:44,581 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 22:36:44,581 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 22:36:44,581 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 22:36:44,581 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 22:36:44,581 INFO L82 PathProgramCache]: Analyzing trace with hash 1331497986, now seen corresponding path program 5 times [2018-11-06 22:36:44,582 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 22:36:44,582 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 22:36:44,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:36:44,582 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-06 22:36:44,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:36:44,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:36:45,075 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 62 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 22:36:45,076 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 22:36:45,076 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-06 22:36:45,085 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-06 22:36:45,122 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-11-06 22:36:45,123 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-06 22:36:45,126 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 22:36:45,212 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-11-06 22:36:45,215 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-11-06 22:36:45,215 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-06 22:36:45,217 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-06 22:36:45,222 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-06 22:36:45,222 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:7 [2018-11-06 22:36:45,367 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-11-06 22:36:45,371 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:36:45,373 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-11-06 22:36:45,373 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-06 22:36:45,382 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-06 22:36:45,388 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-06 22:36:45,388 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2018-11-06 22:36:45,586 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 26 treesize of output 18 [2018-11-06 22:36:45,595 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-11-06 22:36:45,596 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-06 22:36:45,600 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-06 22:36:45,601 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-06 22:36:45,601 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2018-11-06 22:36:45,634 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 62 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 22:36:45,656 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-06 22:36:45,656 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 35 [2018-11-06 22:36:45,656 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-11-06 22:36:45,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-11-06 22:36:45,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=1066, Unknown=0, NotChecked=0, Total=1190 [2018-11-06 22:36:45,657 INFO L87 Difference]: Start difference. First operand 262 states and 291 transitions. Second operand 35 states. [2018-11-06 22:36:47,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 22:36:47,474 INFO L93 Difference]: Finished difference Result 556 states and 618 transitions. [2018-11-06 22:36:47,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-11-06 22:36:47,474 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 66 [2018-11-06 22:36:47,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 22:36:47,476 INFO L225 Difference]: With dead ends: 556 [2018-11-06 22:36:47,476 INFO L226 Difference]: Without dead ends: 485 [2018-11-06 22:36:47,477 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 51 SyntacticMatches, 7 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1016 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=458, Invalid=3324, Unknown=0, NotChecked=0, Total=3782 [2018-11-06 22:36:47,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 485 states. [2018-11-06 22:36:47,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 485 to 329. [2018-11-06 22:36:47,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 329 states. [2018-11-06 22:36:47,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 366 transitions. [2018-11-06 22:36:47,519 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 366 transitions. Word has length 66 [2018-11-06 22:36:47,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 22:36:47,519 INFO L480 AbstractCegarLoop]: Abstraction has 329 states and 366 transitions. [2018-11-06 22:36:47,519 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-11-06 22:36:47,520 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 366 transitions. [2018-11-06 22:36:47,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-11-06 22:36:47,520 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 22:36:47,521 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 22:36:47,521 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 22:36:47,521 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 22:36:47,521 INFO L82 PathProgramCache]: Analyzing trace with hash 156771487, now seen corresponding path program 1 times [2018-11-06 22:36:47,521 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 22:36:47,521 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 22:36:47,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:36:47,522 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-06 22:36:47,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:36:47,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:36:48,451 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 22:36:48,452 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 22:36:48,452 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-06 22:36:48,467 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 22:36:48,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:36:48,501 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 22:36:48,936 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 28 treesize of output 23 [2018-11-06 22:36:48,976 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:36:48,999 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 23 treesize of output 37 [2018-11-06 22:36:49,000 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-06 22:36:49,096 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-06 22:36:49,229 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-06 22:36:49,230 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:37, output treesize:30 [2018-11-06 22:36:50,384 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 32 treesize of output 24 [2018-11-06 22:36:50,387 INFO L682 Elim1Store]: detected equality via solver [2018-11-06 22:36:50,387 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:36:50,405 INFO L682 Elim1Store]: detected equality via solver [2018-11-06 22:36:50,434 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 40 [2018-11-06 22:36:50,435 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-06 22:36:50,440 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-06 22:36:50,446 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-06 22:36:50,446 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:3 [2018-11-06 22:36:50,478 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 6 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 22:36:50,497 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-06 22:36:50,498 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 19] total 33 [2018-11-06 22:36:50,498 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-11-06 22:36:50,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-11-06 22:36:50,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=933, Unknown=0, NotChecked=0, Total=1056 [2018-11-06 22:36:50,499 INFO L87 Difference]: Start difference. First operand 329 states and 366 transitions. Second operand 33 states. [2018-11-06 22:36:53,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 22:36:53,002 INFO L93 Difference]: Finished difference Result 689 states and 764 transitions. [2018-11-06 22:36:53,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-11-06 22:36:53,003 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 66 [2018-11-06 22:36:53,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 22:36:53,006 INFO L225 Difference]: With dead ends: 689 [2018-11-06 22:36:53,006 INFO L226 Difference]: Without dead ends: 597 [2018-11-06 22:36:53,008 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 51 SyntacticMatches, 6 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1462 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=739, Invalid=4663, Unknown=0, NotChecked=0, Total=5402 [2018-11-06 22:36:53,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2018-11-06 22:36:53,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 358. [2018-11-06 22:36:53,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 358 states. [2018-11-06 22:36:53,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 400 transitions. [2018-11-06 22:36:53,056 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 400 transitions. Word has length 66 [2018-11-06 22:36:53,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 22:36:53,056 INFO L480 AbstractCegarLoop]: Abstraction has 358 states and 400 transitions. [2018-11-06 22:36:53,057 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-11-06 22:36:53,057 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 400 transitions. [2018-11-06 22:36:53,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-11-06 22:36:53,057 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 22:36:53,058 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 22:36:53,058 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 22:36:53,058 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 22:36:53,058 INFO L82 PathProgramCache]: Analyzing trace with hash 1049020958, now seen corresponding path program 1 times [2018-11-06 22:36:53,058 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 22:36:53,058 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 22:36:53,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:36:53,059 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 22:36:53,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:36:53,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:36:53,433 WARN L179 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 9 DAG size of output: 7 [2018-11-06 22:36:53,854 WARN L179 SmtUtils]: Spent 340.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 11 [2018-11-06 22:36:55,372 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 22:36:55,372 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 22:36:55,372 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-06 22:36:55,381 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 22:36:55,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:36:55,403 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 22:36:55,540 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2018-11-06 22:36:55,542 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:36:55,544 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 23 treesize of output 37 [2018-11-06 22:36:55,545 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-06 22:36:55,551 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-06 22:36:55,559 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-06 22:36:55,560 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:27 [2018-11-06 22:36:55,644 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 41 treesize of output 32 [2018-11-06 22:36:55,647 INFO L682 Elim1Store]: detected equality via solver [2018-11-06 22:36:55,648 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:36:55,649 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:36:55,650 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:36:55,658 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 74 [2018-11-06 22:36:55,658 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-06 22:36:55,670 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-06 22:36:55,681 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-06 22:36:55,682 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:47, output treesize:42 [2018-11-06 22:36:55,955 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 56 treesize of output 43 [2018-11-06 22:36:55,959 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:36:55,960 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:36:55,961 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:36:55,962 INFO L682 Elim1Store]: detected equality via solver [2018-11-06 22:36:55,963 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:36:55,964 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:36:55,965 INFO L682 Elim1Store]: detected equality via solver [2018-11-06 22:36:55,978 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 101 [2018-11-06 22:36:55,979 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-06 22:36:56,002 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-06 22:36:56,015 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-06 22:36:56,015 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:65, output treesize:47 [2018-11-06 22:36:56,241 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 43 [2018-11-06 22:36:56,244 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:36:56,244 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:36:56,246 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:36:56,247 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:36:56,250 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:36:56,268 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 117 [2018-11-06 22:36:56,269 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-06 22:36:56,324 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-06 22:36:56,358 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-11-06 22:36:56,359 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:66, output treesize:83 [2018-11-06 22:36:56,722 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 26 treesize of output 18 [2018-11-06 22:36:56,724 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-11-06 22:36:56,725 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-06 22:36:56,726 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-06 22:36:56,727 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-06 22:36:56,728 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2018-11-06 22:36:56,797 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 22:36:56,818 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-06 22:36:56,818 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 29] total 46 [2018-11-06 22:36:56,818 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-11-06 22:36:56,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-11-06 22:36:56,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=198, Invalid=1872, Unknown=0, NotChecked=0, Total=2070 [2018-11-06 22:36:56,819 INFO L87 Difference]: Start difference. First operand 358 states and 400 transitions. Second operand 46 states. [2018-11-06 22:36:59,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 22:36:59,058 INFO L93 Difference]: Finished difference Result 442 states and 487 transitions. [2018-11-06 22:36:59,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-11-06 22:36:59,059 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 66 [2018-11-06 22:36:59,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 22:36:59,061 INFO L225 Difference]: With dead ends: 442 [2018-11-06 22:36:59,061 INFO L226 Difference]: Without dead ends: 425 [2018-11-06 22:36:59,063 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 43 SyntacticMatches, 17 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1434 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=424, Invalid=3998, Unknown=0, NotChecked=0, Total=4422 [2018-11-06 22:36:59,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states. [2018-11-06 22:36:59,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 382. [2018-11-06 22:36:59,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2018-11-06 22:36:59,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 425 transitions. [2018-11-06 22:36:59,115 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 425 transitions. Word has length 66 [2018-11-06 22:36:59,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 22:36:59,116 INFO L480 AbstractCegarLoop]: Abstraction has 382 states and 425 transitions. [2018-11-06 22:36:59,116 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-11-06 22:36:59,116 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 425 transitions. [2018-11-06 22:36:59,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-11-06 22:36:59,117 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 22:36:59,117 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 22:36:59,117 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 22:36:59,117 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 22:36:59,118 INFO L82 PathProgramCache]: Analyzing trace with hash -853934375, now seen corresponding path program 1 times [2018-11-06 22:36:59,118 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 22:36:59,118 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 22:36:59,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:36:59,119 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 22:36:59,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:36:59,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:36:59,427 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 42 proven. 4 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-11-06 22:36:59,427 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 22:36:59,427 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-06 22:36:59,445 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 22:36:59,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:36:59,476 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 22:36:59,481 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 42 proven. 4 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-11-06 22:36:59,508 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-06 22:36:59,509 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-11-06 22:36:59,509 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-06 22:36:59,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-06 22:36:59,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-06 22:36:59,510 INFO L87 Difference]: Start difference. First operand 382 states and 425 transitions. Second operand 6 states. [2018-11-06 22:36:59,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 22:36:59,691 INFO L93 Difference]: Finished difference Result 522 states and 578 transitions. [2018-11-06 22:36:59,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-06 22:36:59,693 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 67 [2018-11-06 22:36:59,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 22:36:59,695 INFO L225 Difference]: With dead ends: 522 [2018-11-06 22:36:59,695 INFO L226 Difference]: Without dead ends: 451 [2018-11-06 22:36:59,696 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-11-06 22:36:59,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2018-11-06 22:36:59,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 366. [2018-11-06 22:36:59,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 366 states. [2018-11-06 22:36:59,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 404 transitions. [2018-11-06 22:36:59,733 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 404 transitions. Word has length 67 [2018-11-06 22:36:59,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 22:36:59,734 INFO L480 AbstractCegarLoop]: Abstraction has 366 states and 404 transitions. [2018-11-06 22:36:59,734 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-06 22:36:59,734 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 404 transitions. [2018-11-06 22:36:59,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-11-06 22:36:59,735 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 22:36:59,735 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 22:36:59,735 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 22:36:59,735 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 22:36:59,736 INFO L82 PathProgramCache]: Analyzing trace with hash 1500867607, now seen corresponding path program 2 times [2018-11-06 22:36:59,736 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 22:36:59,736 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 22:36:59,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:36:59,737 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 22:36:59,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:36:59,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:37:00,631 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 22:37:00,631 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 22:37:00,631 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-06 22:37:00,650 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-06 22:37:00,680 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-06 22:37:00,680 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-06 22:37:00,682 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 22:37:00,863 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 41 treesize of output 34 [2018-11-06 22:37:00,866 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:37:00,868 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 34 treesize of output 50 [2018-11-06 22:37:00,869 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-06 22:37:00,876 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-06 22:37:00,888 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-06 22:37:00,889 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:52, output treesize:45 [2018-11-06 22:37:01,080 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:37:01,081 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 51 treesize of output 53 [2018-11-06 22:37:01,085 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:37:01,086 INFO L682 Elim1Store]: detected equality via solver [2018-11-06 22:37:01,088 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:37:01,089 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 71 [2018-11-06 22:37:01,090 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-06 22:37:01,099 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-06 22:37:01,112 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-06 22:37:01,112 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:65, output treesize:32 [2018-11-06 22:37:01,148 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 29 treesize of output 22 [2018-11-06 22:37:01,150 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:37:01,150 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:37:01,151 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:37:01,153 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:37:01,156 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 59 [2018-11-06 22:37:01,156 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-06 22:37:01,174 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-06 22:37:01,181 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-06 22:37:01,181 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:19 [2018-11-06 22:37:01,254 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 27 [2018-11-06 22:37:01,257 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:37:01,258 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:37:01,259 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:37:01,261 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:37:01,264 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 76 [2018-11-06 22:37:01,264 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-06 22:37:01,274 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-06 22:37:01,283 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-06 22:37:01,283 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:40, output treesize:21 [2018-11-06 22:37:01,335 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 28 treesize of output 20 [2018-11-06 22:37:01,336 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:37:01,337 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-11-06 22:37:01,338 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-06 22:37:01,339 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-06 22:37:01,340 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-06 22:37:01,340 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:5 [2018-11-06 22:37:01,385 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 6 proven. 69 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-06 22:37:01,405 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-06 22:37:01,405 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 25] total 35 [2018-11-06 22:37:01,406 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-11-06 22:37:01,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-11-06 22:37:01,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=1015, Unknown=0, NotChecked=0, Total=1190 [2018-11-06 22:37:01,406 INFO L87 Difference]: Start difference. First operand 366 states and 404 transitions. Second operand 35 states. [2018-11-06 22:37:03,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 22:37:03,245 INFO L93 Difference]: Finished difference Result 527 states and 576 transitions. [2018-11-06 22:37:03,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-11-06 22:37:03,245 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 67 [2018-11-06 22:37:03,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 22:37:03,248 INFO L225 Difference]: With dead ends: 527 [2018-11-06 22:37:03,248 INFO L226 Difference]: Without dead ends: 525 [2018-11-06 22:37:03,249 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 48 SyntacticMatches, 14 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1356 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=476, Invalid=3184, Unknown=0, NotChecked=0, Total=3660 [2018-11-06 22:37:03,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 525 states. [2018-11-06 22:37:03,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 525 to 350. [2018-11-06 22:37:03,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 350 states. [2018-11-06 22:37:03,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 386 transitions. [2018-11-06 22:37:03,297 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 386 transitions. Word has length 67 [2018-11-06 22:37:03,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 22:37:03,298 INFO L480 AbstractCegarLoop]: Abstraction has 350 states and 386 transitions. [2018-11-06 22:37:03,298 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-11-06 22:37:03,298 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 386 transitions. [2018-11-06 22:37:03,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-11-06 22:37:03,299 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 22:37:03,299 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 22:37:03,300 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 22:37:03,300 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 22:37:03,300 INFO L82 PathProgramCache]: Analyzing trace with hash -1576587556, now seen corresponding path program 1 times [2018-11-06 22:37:03,300 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 22:37:03,300 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 22:37:03,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:37:03,301 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-06 22:37:03,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:37:03,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:37:03,900 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 22 proven. 41 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-11-06 22:37:03,901 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 22:37:03,901 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-06 22:37:03,926 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 22:37:03,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:37:03,949 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 22:37:04,154 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 21 treesize of output 16 [2018-11-06 22:37:04,173 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:37:04,174 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 16 treesize of output 23 [2018-11-06 22:37:04,175 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-06 22:37:04,180 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-06 22:37:04,188 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-06 22:37:04,188 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:17 [2018-11-06 22:37:04,236 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 26 treesize of output 18 [2018-11-06 22:37:04,240 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-11-06 22:37:04,240 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-06 22:37:04,241 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-06 22:37:04,242 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-06 22:37:04,242 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2018-11-06 22:37:04,260 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 20 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 22:37:04,279 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-06 22:37:04,279 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 19] total 26 [2018-11-06 22:37:04,280 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-11-06 22:37:04,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-11-06 22:37:04,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=528, Unknown=0, NotChecked=0, Total=650 [2018-11-06 22:37:04,280 INFO L87 Difference]: Start difference. First operand 350 states and 386 transitions. Second operand 26 states. [2018-11-06 22:37:06,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 22:37:06,221 INFO L93 Difference]: Finished difference Result 506 states and 546 transitions. [2018-11-06 22:37:06,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-11-06 22:37:06,222 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 69 [2018-11-06 22:37:06,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 22:37:06,223 INFO L225 Difference]: With dead ends: 506 [2018-11-06 22:37:06,224 INFO L226 Difference]: Without dead ends: 504 [2018-11-06 22:37:06,225 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 58 SyntacticMatches, 6 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1590 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1000, Invalid=4256, Unknown=0, NotChecked=0, Total=5256 [2018-11-06 22:37:06,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 504 states. [2018-11-06 22:37:06,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 504 to 350. [2018-11-06 22:37:06,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 350 states. [2018-11-06 22:37:06,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 386 transitions. [2018-11-06 22:37:06,264 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 386 transitions. Word has length 69 [2018-11-06 22:37:06,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 22:37:06,264 INFO L480 AbstractCegarLoop]: Abstraction has 350 states and 386 transitions. [2018-11-06 22:37:06,264 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-11-06 22:37:06,264 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 386 transitions. [2018-11-06 22:37:06,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-11-06 22:37:06,265 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 22:37:06,265 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 22:37:06,265 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 22:37:06,265 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 22:37:06,266 INFO L82 PathProgramCache]: Analyzing trace with hash 1296720827, now seen corresponding path program 2 times [2018-11-06 22:37:06,266 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 22:37:06,266 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 22:37:06,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:37:06,266 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 22:37:06,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:37:06,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:37:06,951 WARN L179 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 9 [2018-11-06 22:37:07,495 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 22:37:07,495 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 22:37:07,496 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-06 22:37:07,504 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-06 22:37:07,528 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-06 22:37:07,528 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-06 22:37:07,530 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 22:37:07,787 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 41 treesize of output 34 [2018-11-06 22:37:07,790 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:37:07,791 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 34 treesize of output 50 [2018-11-06 22:37:07,792 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-06 22:37:07,799 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-06 22:37:07,811 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-06 22:37:07,811 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:52, output treesize:45 [2018-11-06 22:37:08,021 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:37:08,021 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 51 treesize of output 53 [2018-11-06 22:37:08,024 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:37:08,025 INFO L682 Elim1Store]: detected equality via solver [2018-11-06 22:37:08,029 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:37:08,030 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 71 [2018-11-06 22:37:08,031 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-06 22:37:08,038 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-06 22:37:08,050 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-06 22:37:08,051 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:65, output treesize:32 [2018-11-06 22:37:08,181 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 31 treesize of output 24 [2018-11-06 22:37:08,185 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:37:08,186 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:37:08,187 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:37:08,187 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:37:08,190 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 67 [2018-11-06 22:37:08,190 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-06 22:37:08,199 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-06 22:37:08,206 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-06 22:37:08,206 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:21 [2018-11-06 22:37:08,403 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 28 treesize of output 20 [2018-11-06 22:37:08,405 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:37:08,406 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-11-06 22:37:08,406 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-06 22:37:08,407 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-06 22:37:08,408 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-06 22:37:08,408 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:5 [2018-11-06 22:37:08,453 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 22:37:08,472 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-06 22:37:08,472 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 24] total 43 [2018-11-06 22:37:08,473 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-11-06 22:37:08,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-11-06 22:37:08,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=201, Invalid=1605, Unknown=0, NotChecked=0, Total=1806 [2018-11-06 22:37:08,473 INFO L87 Difference]: Start difference. First operand 350 states and 386 transitions. Second operand 43 states. [2018-11-06 22:37:09,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 22:37:09,865 INFO L93 Difference]: Finished difference Result 421 states and 460 transitions. [2018-11-06 22:37:09,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-11-06 22:37:09,866 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 69 [2018-11-06 22:37:09,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 22:37:09,867 INFO L225 Difference]: With dead ends: 421 [2018-11-06 22:37:09,867 INFO L226 Difference]: Without dead ends: 419 [2018-11-06 22:37:09,868 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 49 SyntacticMatches, 9 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1043 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=398, Invalid=3142, Unknown=0, NotChecked=0, Total=3540 [2018-11-06 22:37:09,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2018-11-06 22:37:09,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 343. [2018-11-06 22:37:09,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 343 states. [2018-11-06 22:37:09,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 379 transitions. [2018-11-06 22:37:09,911 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 379 transitions. Word has length 69 [2018-11-06 22:37:09,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 22:37:09,912 INFO L480 AbstractCegarLoop]: Abstraction has 343 states and 379 transitions. [2018-11-06 22:37:09,912 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-11-06 22:37:09,912 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 379 transitions. [2018-11-06 22:37:09,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-11-06 22:37:09,913 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 22:37:09,913 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 22:37:09,913 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 22:37:09,913 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 22:37:09,913 INFO L82 PathProgramCache]: Analyzing trace with hash -251904512, now seen corresponding path program 2 times [2018-11-06 22:37:09,913 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 22:37:09,914 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 22:37:09,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:37:09,914 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-06 22:37:09,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:37:09,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:37:10,378 WARN L179 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 10 [2018-11-06 22:37:11,211 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 104 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 22:37:11,211 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 22:37:11,211 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-06 22:37:11,220 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-06 22:37:11,242 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-06 22:37:11,242 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-06 22:37:11,244 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 22:37:11,379 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 28 treesize of output 23 [2018-11-06 22:37:11,383 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:37:11,385 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 23 treesize of output 37 [2018-11-06 22:37:11,385 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-06 22:37:11,391 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-06 22:37:11,400 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-06 22:37:11,400 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:31 [2018-11-06 22:37:11,430 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 33 treesize of output 26 [2018-11-06 22:37:11,440 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:37:11,441 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:37:11,441 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:37:11,446 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 26 treesize of output 61 [2018-11-06 22:37:11,446 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-06 22:37:11,454 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-06 22:37:11,463 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-06 22:37:11,463 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:26 [2018-11-06 22:37:11,566 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 25 [2018-11-06 22:37:11,569 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:37:11,569 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:37:11,570 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:37:11,575 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 58 [2018-11-06 22:37:11,575 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-06 22:37:11,585 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-06 22:37:11,596 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-06 22:37:11,596 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:48, output treesize:29 [2018-11-06 22:37:11,628 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 25 [2018-11-06 22:37:11,630 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:37:11,631 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:37:11,632 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:37:11,636 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 58 [2018-11-06 22:37:11,637 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-06 22:37:11,645 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-06 22:37:11,658 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-06 22:37:11,659 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:45, output treesize:19 [2018-11-06 22:37:11,816 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 26 treesize of output 18 [2018-11-06 22:37:11,820 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-11-06 22:37:11,821 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-06 22:37:11,825 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-06 22:37:11,828 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-06 22:37:11,828 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2018-11-06 22:37:11,905 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 10 proven. 94 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 22:37:11,924 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-06 22:37:11,924 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 30 [2018-11-06 22:37:11,925 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-11-06 22:37:11,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-11-06 22:37:11,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=728, Unknown=0, NotChecked=0, Total=870 [2018-11-06 22:37:11,925 INFO L87 Difference]: Start difference. First operand 343 states and 379 transitions. Second operand 30 states. [2018-11-06 22:37:14,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 22:37:14,792 INFO L93 Difference]: Finished difference Result 715 states and 785 transitions. [2018-11-06 22:37:14,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-11-06 22:37:14,793 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 70 [2018-11-06 22:37:14,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 22:37:14,795 INFO L225 Difference]: With dead ends: 715 [2018-11-06 22:37:14,795 INFO L226 Difference]: Without dead ends: 660 [2018-11-06 22:37:14,796 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 54 SyntacticMatches, 16 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1688 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=824, Invalid=4146, Unknown=0, NotChecked=0, Total=4970 [2018-11-06 22:37:14,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 660 states. [2018-11-06 22:37:14,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 660 to 412. [2018-11-06 22:37:14,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 412 states. [2018-11-06 22:37:14,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 459 transitions. [2018-11-06 22:37:14,857 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 459 transitions. Word has length 70 [2018-11-06 22:37:14,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 22:37:14,858 INFO L480 AbstractCegarLoop]: Abstraction has 412 states and 459 transitions. [2018-11-06 22:37:14,858 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-11-06 22:37:14,858 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 459 transitions. [2018-11-06 22:37:14,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-11-06 22:37:14,859 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 22:37:14,859 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 22:37:14,859 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 22:37:14,859 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 22:37:14,859 INFO L82 PathProgramCache]: Analyzing trace with hash -78771201, now seen corresponding path program 5 times [2018-11-06 22:37:14,860 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 22:37:14,860 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 22:37:14,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:37:14,860 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-06 22:37:14,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:37:14,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:37:16,328 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 6 proven. 75 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 22:37:16,329 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 22:37:16,329 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-06 22:37:16,344 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-06 22:37:16,374 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2018-11-06 22:37:16,374 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-06 22:37:16,376 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 22:37:16,706 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 41 treesize of output 34 [2018-11-06 22:37:16,709 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:37:16,711 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 34 treesize of output 50 [2018-11-06 22:37:16,711 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-06 22:37:16,720 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-06 22:37:16,735 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-06 22:37:16,735 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:55, output treesize:48 [2018-11-06 22:37:16,985 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:37:16,985 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 52 treesize of output 54 [2018-11-06 22:37:16,992 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:37:16,998 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:37:16,998 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 61 [2018-11-06 22:37:16,999 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-06 22:37:17,012 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-06 22:37:17,028 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-06 22:37:17,029 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:70, output treesize:42 [2018-11-06 22:37:17,151 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 34 treesize of output 27 [2018-11-06 22:37:17,156 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:37:17,159 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:37:17,162 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:37:17,164 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:37:17,167 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 76 [2018-11-06 22:37:17,168 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-06 22:37:17,179 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-06 22:37:17,190 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-06 22:37:17,190 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:49, output treesize:21 [2018-11-06 22:37:17,251 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 28 treesize of output 20 [2018-11-06 22:37:17,253 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:37:17,254 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-11-06 22:37:17,254 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-06 22:37:17,256 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-06 22:37:17,257 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-06 22:37:17,257 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:5 [2018-11-06 22:37:17,291 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 55 proven. 22 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-06 22:37:17,310 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-06 22:37:17,311 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 22] total 40 [2018-11-06 22:37:17,311 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-11-06 22:37:17,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-11-06 22:37:17,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=239, Invalid=1321, Unknown=0, NotChecked=0, Total=1560 [2018-11-06 22:37:17,312 INFO L87 Difference]: Start difference. First operand 412 states and 459 transitions. Second operand 40 states. [2018-11-06 22:37:21,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 22:37:21,206 INFO L93 Difference]: Finished difference Result 663 states and 730 transitions. [2018-11-06 22:37:21,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-11-06 22:37:21,207 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 70 [2018-11-06 22:37:21,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 22:37:21,209 INFO L225 Difference]: With dead ends: 663 [2018-11-06 22:37:21,209 INFO L226 Difference]: Without dead ends: 608 [2018-11-06 22:37:21,210 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 54 SyntacticMatches, 7 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2859 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=1076, Invalid=7666, Unknown=0, NotChecked=0, Total=8742 [2018-11-06 22:37:21,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2018-11-06 22:37:21,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 399. [2018-11-06 22:37:21,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 399 states. [2018-11-06 22:37:21,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 443 transitions. [2018-11-06 22:37:21,262 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 443 transitions. Word has length 70 [2018-11-06 22:37:21,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 22:37:21,263 INFO L480 AbstractCegarLoop]: Abstraction has 399 states and 443 transitions. [2018-11-06 22:37:21,263 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-11-06 22:37:21,263 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 443 transitions. [2018-11-06 22:37:21,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-11-06 22:37:21,264 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 22:37:21,264 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 22:37:21,264 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 22:37:21,264 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 22:37:21,264 INFO L82 PathProgramCache]: Analyzing trace with hash -1192248558, now seen corresponding path program 6 times [2018-11-06 22:37:21,264 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 22:37:21,264 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 22:37:21,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:37:21,265 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-06 22:37:21,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:37:21,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:37:21,861 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 12 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 22:37:21,862 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 22:37:21,862 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-06 22:37:21,871 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-06 22:37:21,903 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2018-11-06 22:37:21,904 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-06 22:37:21,906 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 22:37:22,057 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 12 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 22:37:22,078 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-06 22:37:22,078 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 14 [2018-11-06 22:37:22,078 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-06 22:37:22,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-06 22:37:22,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2018-11-06 22:37:22,078 INFO L87 Difference]: Start difference. First operand 399 states and 443 transitions. Second operand 14 states. [2018-11-06 22:37:22,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 22:37:22,710 INFO L93 Difference]: Finished difference Result 607 states and 667 transitions. [2018-11-06 22:37:22,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-06 22:37:22,711 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 74 [2018-11-06 22:37:22,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 22:37:22,713 INFO L225 Difference]: With dead ends: 607 [2018-11-06 22:37:22,713 INFO L226 Difference]: Without dead ends: 570 [2018-11-06 22:37:22,713 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 70 SyntacticMatches, 5 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=83, Invalid=379, Unknown=0, NotChecked=0, Total=462 [2018-11-06 22:37:22,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2018-11-06 22:37:22,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 426. [2018-11-06 22:37:22,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 426 states. [2018-11-06 22:37:22,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 470 transitions. [2018-11-06 22:37:22,794 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 470 transitions. Word has length 74 [2018-11-06 22:37:22,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 22:37:22,794 INFO L480 AbstractCegarLoop]: Abstraction has 426 states and 470 transitions. [2018-11-06 22:37:22,794 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-06 22:37:22,794 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 470 transitions. [2018-11-06 22:37:22,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-11-06 22:37:22,795 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 22:37:22,795 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 22:37:22,796 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 22:37:22,796 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 22:37:22,796 INFO L82 PathProgramCache]: Analyzing trace with hash -1605704017, now seen corresponding path program 2 times [2018-11-06 22:37:22,796 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 22:37:22,796 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 22:37:22,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:37:22,797 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-06 22:37:22,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:37:22,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:37:23,564 WARN L179 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 14 [2018-11-06 22:37:23,926 WARN L179 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 21 [2018-11-06 22:37:24,323 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 80 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 22:37:24,324 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 22:37:24,324 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-06 22:37:24,332 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-06 22:37:24,357 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-06 22:37:24,357 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-06 22:37:24,359 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 22:37:24,547 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 26 treesize of output 21 [2018-11-06 22:37:24,549 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:37:24,551 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 21 treesize of output 33 [2018-11-06 22:37:24,551 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-06 22:37:24,557 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-06 22:37:24,567 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-06 22:37:24,568 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:35, output treesize:28 [2018-11-06 22:37:24,821 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 30 treesize of output 22 [2018-11-06 22:37:24,824 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:37:24,824 INFO L682 Elim1Store]: detected equality via solver [2018-11-06 22:37:24,828 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 25 [2018-11-06 22:37:24,829 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-06 22:37:24,832 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-06 22:37:24,837 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-06 22:37:24,837 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:36, output treesize:3 [2018-11-06 22:37:24,877 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 6 proven. 74 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 22:37:24,897 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-06 22:37:24,897 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 18] total 32 [2018-11-06 22:37:24,897 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-11-06 22:37:24,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-11-06 22:37:24,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=882, Unknown=0, NotChecked=0, Total=992 [2018-11-06 22:37:24,898 INFO L87 Difference]: Start difference. First operand 426 states and 470 transitions. Second operand 32 states. [2018-11-06 22:37:26,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 22:37:26,432 INFO L93 Difference]: Finished difference Result 574 states and 625 transitions. [2018-11-06 22:37:26,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-11-06 22:37:26,432 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 74 [2018-11-06 22:37:26,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 22:37:26,434 INFO L225 Difference]: With dead ends: 574 [2018-11-06 22:37:26,435 INFO L226 Difference]: Without dead ends: 549 [2018-11-06 22:37:26,435 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 60 SyntacticMatches, 5 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 641 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=335, Invalid=2317, Unknown=0, NotChecked=0, Total=2652 [2018-11-06 22:37:26,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 549 states. [2018-11-06 22:37:26,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 549 to 413. [2018-11-06 22:37:26,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 413 states. [2018-11-06 22:37:26,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 454 transitions. [2018-11-06 22:37:26,497 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 454 transitions. Word has length 74 [2018-11-06 22:37:26,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 22:37:26,497 INFO L480 AbstractCegarLoop]: Abstraction has 413 states and 454 transitions. [2018-11-06 22:37:26,497 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-11-06 22:37:26,498 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 454 transitions. [2018-11-06 22:37:26,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-11-06 22:37:26,498 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 22:37:26,498 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 3, 3, 3, 3, 3, 3, 3, 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] [2018-11-06 22:37:26,499 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 22:37:26,499 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 22:37:26,499 INFO L82 PathProgramCache]: Analyzing trace with hash 863230886, now seen corresponding path program 2 times [2018-11-06 22:37:26,499 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 22:37:26,499 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 22:37:26,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:37:26,500 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-06 22:37:26,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:37:26,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:37:27,187 WARN L179 SmtUtils]: Spent 336.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 10 [2018-11-06 22:37:27,563 WARN L179 SmtUtils]: Spent 291.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 13 [2018-11-06 22:37:29,294 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 22:37:29,294 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 22:37:29,294 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-06 22:37:29,307 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-06 22:37:29,328 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-06 22:37:29,328 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-06 22:37:29,330 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 22:37:29,583 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 41 treesize of output 34 [2018-11-06 22:37:29,587 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:37:29,589 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 34 treesize of output 50 [2018-11-06 22:37:29,589 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-06 22:37:29,596 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-06 22:37:29,608 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-06 22:37:29,608 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:52, output treesize:45 [2018-11-06 22:37:29,831 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:37:29,831 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 51 treesize of output 53 [2018-11-06 22:37:29,834 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:37:29,835 INFO L682 Elim1Store]: detected equality via solver [2018-11-06 22:37:29,839 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:37:29,840 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 71 [2018-11-06 22:37:29,841 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-06 22:37:29,850 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-06 22:37:29,863 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-06 22:37:29,863 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:65, output treesize:32 [2018-11-06 22:37:29,979 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 45 treesize of output 36 [2018-11-06 22:37:29,983 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:37:29,984 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:37:29,985 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:37:29,987 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:37:29,989 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:37:29,990 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 95 [2018-11-06 22:37:29,991 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-06 22:37:30,007 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-06 22:37:30,020 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-06 22:37:30,020 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:54, output treesize:47 [2018-11-06 22:37:30,479 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:37:30,479 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 65 treesize of output 63 [2018-11-06 22:37:30,484 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:37:30,485 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:37:30,486 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:37:30,488 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:37:30,490 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:37:30,490 INFO L682 Elim1Store]: detected equality via solver [2018-11-06 22:37:30,492 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:37:30,493 INFO L682 Elim1Store]: detected equality via solver [2018-11-06 22:37:30,495 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:37:30,501 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:37:30,503 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:37:30,507 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 191 [2018-11-06 22:37:30,509 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-06 22:37:30,564 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-06 22:37:30,581 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-06 22:37:30,581 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:82, output treesize:56 [2018-11-06 22:37:30,897 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 58 treesize of output 47 [2018-11-06 22:37:30,901 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:37:30,902 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:37:30,902 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:37:30,904 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:37:30,906 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:37:30,908 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:37:30,909 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:37:30,927 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 161 [2018-11-06 22:37:30,928 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-06 22:37:30,980 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-06 22:37:31,012 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-11-06 22:37:31,013 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:75, output treesize:89 [2018-11-06 22:37:31,263 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 28 treesize of output 20 [2018-11-06 22:37:31,265 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:37:31,266 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-11-06 22:37:31,266 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-06 22:37:31,267 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-06 22:37:31,268 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-06 22:37:31,269 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:5 [2018-11-06 22:37:31,330 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 22:37:31,350 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-06 22:37:31,350 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 34] total 57 [2018-11-06 22:37:31,350 INFO L459 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-11-06 22:37:31,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-11-06 22:37:31,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=305, Invalid=2887, Unknown=0, NotChecked=0, Total=3192 [2018-11-06 22:37:31,351 INFO L87 Difference]: Start difference. First operand 413 states and 454 transitions. Second operand 57 states. [2018-11-06 22:37:33,377 WARN L179 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 32 [2018-11-06 22:37:35,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 22:37:35,396 INFO L93 Difference]: Finished difference Result 487 states and 532 transitions. [2018-11-06 22:37:35,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-11-06 22:37:35,396 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 75 [2018-11-06 22:37:35,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 22:37:35,399 INFO L225 Difference]: With dead ends: 487 [2018-11-06 22:37:35,399 INFO L226 Difference]: Without dead ends: 470 [2018-11-06 22:37:35,400 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 46 SyntacticMatches, 15 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3053 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=688, Invalid=7502, Unknown=0, NotChecked=0, Total=8190 [2018-11-06 22:37:35,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2018-11-06 22:37:35,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 389. [2018-11-06 22:37:35,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2018-11-06 22:37:35,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 428 transitions. [2018-11-06 22:37:35,472 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 428 transitions. Word has length 75 [2018-11-06 22:37:35,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 22:37:35,472 INFO L480 AbstractCegarLoop]: Abstraction has 389 states and 428 transitions. [2018-11-06 22:37:35,472 INFO L481 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-11-06 22:37:35,473 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 428 transitions. [2018-11-06 22:37:35,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-11-06 22:37:35,473 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 22:37:35,473 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 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] [2018-11-06 22:37:35,474 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 22:37:35,474 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 22:37:35,474 INFO L82 PathProgramCache]: Analyzing trace with hash 446587884, now seen corresponding path program 1 times [2018-11-06 22:37:35,474 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 22:37:35,474 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 22:37:35,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:37:35,475 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-06 22:37:35,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:37:35,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:37:35,745 WARN L179 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 8 DAG size of output: 7 [2018-11-06 22:37:36,105 WARN L179 SmtUtils]: Spent 284.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 10 [2018-11-06 22:37:36,461 WARN L179 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 5 [2018-11-06 22:37:36,737 WARN L179 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 11 [2018-11-06 22:37:37,082 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 15 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 22:37:37,083 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 22:37:37,083 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-06 22:37:37,092 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 22:37:37,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:37:37,118 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 22:37:37,603 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 41 treesize of output 34 [2018-11-06 22:37:37,608 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:37:37,610 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 34 treesize of output 50 [2018-11-06 22:37:37,610 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-06 22:37:37,621 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-06 22:37:37,637 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-06 22:37:37,637 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:50, output treesize:43 [2018-11-06 22:37:37,865 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:37:37,866 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 50 treesize of output 52 [2018-11-06 22:37:37,869 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:37:37,870 INFO L682 Elim1Store]: detected equality via solver [2018-11-06 22:37:37,873 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:37:37,874 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 71 [2018-11-06 22:37:37,875 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-06 22:37:37,883 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-06 22:37:37,897 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-06 22:37:37,897 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:67, output treesize:32 [2018-11-06 22:37:38,154 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 34 treesize of output 26 [2018-11-06 22:37:38,156 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:37:38,157 INFO L682 Elim1Store]: detected equality via solver [2018-11-06 22:37:38,158 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:37:38,158 INFO L682 Elim1Store]: detected equality via solver [2018-11-06 22:37:38,160 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:37:38,161 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 44 [2018-11-06 22:37:38,162 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-06 22:37:38,168 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-06 22:37:38,173 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-06 22:37:38,173 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:40, output treesize:5 [2018-11-06 22:37:38,249 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 13 proven. 79 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 22:37:38,269 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-06 22:37:38,269 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 24] total 44 [2018-11-06 22:37:38,269 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-11-06 22:37:38,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-11-06 22:37:38,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=1699, Unknown=0, NotChecked=0, Total=1892 [2018-11-06 22:37:38,270 INFO L87 Difference]: Start difference. First operand 389 states and 428 transitions. Second operand 44 states. [2018-11-06 22:37:41,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 22:37:41,866 INFO L93 Difference]: Finished difference Result 596 states and 650 transitions. [2018-11-06 22:37:41,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-11-06 22:37:41,866 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 77 [2018-11-06 22:37:41,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 22:37:41,868 INFO L225 Difference]: With dead ends: 596 [2018-11-06 22:37:41,868 INFO L226 Difference]: Without dead ends: 594 [2018-11-06 22:37:41,870 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 78 SyntacticMatches, 6 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4087 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=1186, Invalid=10370, Unknown=0, NotChecked=0, Total=11556 [2018-11-06 22:37:41,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2018-11-06 22:37:41,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 420. [2018-11-06 22:37:41,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 420 states. [2018-11-06 22:37:41,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 464 transitions. [2018-11-06 22:37:41,936 INFO L78 Accepts]: Start accepts. Automaton has 420 states and 464 transitions. Word has length 77 [2018-11-06 22:37:41,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 22:37:41,937 INFO L480 AbstractCegarLoop]: Abstraction has 420 states and 464 transitions. [2018-11-06 22:37:41,937 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-11-06 22:37:41,937 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 464 transitions. [2018-11-06 22:37:41,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-11-06 22:37:41,938 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 22:37:41,938 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 22:37:41,938 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 22:37:41,939 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 22:37:41,939 INFO L82 PathProgramCache]: Analyzing trace with hash 1959760115, now seen corresponding path program 7 times [2018-11-06 22:37:41,939 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 22:37:41,939 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 22:37:41,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:37:41,940 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 22:37:41,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:37:41,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:37:42,793 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 22:37:42,794 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 22:37:42,794 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-06 22:37:42,803 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 22:37:42,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:37:42,829 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 22:37:42,931 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-11-06 22:37:42,933 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-11-06 22:37:42,934 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-06 22:37:42,935 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-06 22:37:42,940 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-06 22:37:42,941 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:7 [2018-11-06 22:37:43,119 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2018-11-06 22:37:43,121 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:37:43,122 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 23 treesize of output 37 [2018-11-06 22:37:43,123 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-06 22:37:43,129 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-06 22:37:43,137 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-06 22:37:43,138 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:27 [2018-11-06 22:37:43,241 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 25 [2018-11-06 22:37:43,250 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:37:43,251 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:37:43,252 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:37:43,255 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 58 [2018-11-06 22:37:43,255 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-06 22:37:43,264 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-06 22:37:43,273 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-06 22:37:43,273 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:19 [2018-11-06 22:37:43,495 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 26 treesize of output 18 [2018-11-06 22:37:43,498 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-11-06 22:37:43,499 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-06 22:37:43,500 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-06 22:37:43,502 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-06 22:37:43,502 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2018-11-06 22:37:43,545 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 22:37:43,566 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-06 22:37:43,566 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 22] total 40 [2018-11-06 22:37:43,566 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-11-06 22:37:43,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-11-06 22:37:43,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=1394, Unknown=0, NotChecked=0, Total=1560 [2018-11-06 22:37:43,567 INFO L87 Difference]: Start difference. First operand 420 states and 464 transitions. Second operand 40 states. [2018-11-06 22:37:45,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 22:37:45,510 INFO L93 Difference]: Finished difference Result 576 states and 630 transitions. [2018-11-06 22:37:45,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-11-06 22:37:45,510 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 78 [2018-11-06 22:37:45,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 22:37:45,512 INFO L225 Difference]: With dead ends: 576 [2018-11-06 22:37:45,512 INFO L226 Difference]: Without dead ends: 574 [2018-11-06 22:37:45,513 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 60 SyntacticMatches, 9 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1330 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=555, Invalid=4137, Unknown=0, NotChecked=0, Total=4692 [2018-11-06 22:37:45,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2018-11-06 22:37:45,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 460. [2018-11-06 22:37:45,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 460 states. [2018-11-06 22:37:45,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 507 transitions. [2018-11-06 22:37:45,597 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 507 transitions. Word has length 78 [2018-11-06 22:37:45,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 22:37:45,597 INFO L480 AbstractCegarLoop]: Abstraction has 460 states and 507 transitions. [2018-11-06 22:37:45,598 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-11-06 22:37:45,598 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 507 transitions. [2018-11-06 22:37:45,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-11-06 22:37:45,599 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 22:37:45,599 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 22:37:45,599 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 22:37:45,599 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 22:37:45,599 INFO L82 PathProgramCache]: Analyzing trace with hash 785033616, now seen corresponding path program 3 times [2018-11-06 22:37:45,599 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 22:37:45,599 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 22:37:45,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:37:45,600 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 22:37:45,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:37:45,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:37:46,385 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 22:37:46,386 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 22:37:46,386 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-06 22:37:46,395 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-06 22:37:46,456 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-11-06 22:37:46,456 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-06 22:37:46,461 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 22:37:46,707 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 28 treesize of output 23 [2018-11-06 22:37:46,711 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:37:46,713 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 23 treesize of output 37 [2018-11-06 22:37:46,713 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-06 22:37:46,720 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-06 22:37:46,729 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-06 22:37:46,730 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:27 [2018-11-06 22:37:46,834 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 25 [2018-11-06 22:37:46,837 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:37:46,839 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:37:46,840 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:37:46,845 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 58 [2018-11-06 22:37:46,845 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-06 22:37:46,857 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-06 22:37:46,867 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-06 22:37:46,867 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:43, output treesize:22 [2018-11-06 22:37:47,132 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 29 treesize of output 22 [2018-11-06 22:37:47,135 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:37:47,136 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:37:47,136 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:37:47,141 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 22 treesize of output 49 [2018-11-06 22:37:47,142 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-06 22:37:47,150 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-06 22:37:47,157 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-06 22:37:47,158 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:19 [2018-11-06 22:37:47,347 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 26 treesize of output 18 [2018-11-06 22:37:47,351 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-11-06 22:37:47,351 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-06 22:37:47,353 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-06 22:37:47,354 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-06 22:37:47,354 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2018-11-06 22:37:47,403 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 22:37:47,425 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-06 22:37:47,425 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 41 [2018-11-06 22:37:47,426 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-11-06 22:37:47,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-11-06 22:37:47,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=1462, Unknown=0, NotChecked=0, Total=1640 [2018-11-06 22:37:47,426 INFO L87 Difference]: Start difference. First operand 460 states and 507 transitions. Second operand 41 states. [2018-11-06 22:37:49,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 22:37:49,652 INFO L93 Difference]: Finished difference Result 793 states and 878 transitions. [2018-11-06 22:37:49,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-11-06 22:37:49,652 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 78 [2018-11-06 22:37:49,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 22:37:49,655 INFO L225 Difference]: With dead ends: 793 [2018-11-06 22:37:49,656 INFO L226 Difference]: Without dead ends: 687 [2018-11-06 22:37:49,656 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 59 SyntacticMatches, 12 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1221 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=461, Invalid=3571, Unknown=0, NotChecked=0, Total=4032 [2018-11-06 22:37:49,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 687 states. [2018-11-06 22:37:49,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 687 to 492. [2018-11-06 22:37:49,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 492 states. [2018-11-06 22:37:49,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 492 states to 492 states and 544 transitions. [2018-11-06 22:37:49,744 INFO L78 Accepts]: Start accepts. Automaton has 492 states and 544 transitions. Word has length 78 [2018-11-06 22:37:49,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 22:37:49,744 INFO L480 AbstractCegarLoop]: Abstraction has 492 states and 544 transitions. [2018-11-06 22:37:49,744 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-11-06 22:37:49,744 INFO L276 IsEmpty]: Start isEmpty. Operand 492 states and 544 transitions. [2018-11-06 22:37:49,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-11-06 22:37:49,745 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 22:37:49,745 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 22:37:49,745 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 22:37:49,746 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 22:37:49,746 INFO L82 PathProgramCache]: Analyzing trace with hash -2135683312, now seen corresponding path program 4 times [2018-11-06 22:37:49,746 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 22:37:49,746 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 22:37:49,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:37:49,747 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-06 22:37:49,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:37:49,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:37:50,395 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 22:37:50,395 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 22:37:50,395 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-06 22:37:50,403 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-06 22:37:50,422 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-06 22:37:50,422 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-06 22:37:50,424 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 22:37:50,626 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 28 treesize of output 23 [2018-11-06 22:37:50,629 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:37:50,631 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 23 treesize of output 37 [2018-11-06 22:37:50,632 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-06 22:37:50,639 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-06 22:37:50,649 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-06 22:37:50,649 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:41, output treesize:34 [2018-11-06 22:37:50,736 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 36 treesize of output 29 [2018-11-06 22:37:50,739 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:37:50,740 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:37:50,742 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:37:50,746 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 29 treesize of output 70 [2018-11-06 22:37:50,747 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-06 22:37:50,756 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-06 22:37:50,763 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-06 22:37:50,763 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:52, output treesize:19 [2018-11-06 22:37:50,933 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 36 treesize of output 28 [2018-11-06 22:37:50,935 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:37:50,936 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:37:50,937 INFO L682 Elim1Store]: detected equality via solver [2018-11-06 22:37:50,940 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 37 [2018-11-06 22:37:50,941 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-06 22:37:50,945 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-06 22:37:50,947 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-06 22:37:50,947 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:36, output treesize:3 [2018-11-06 22:37:50,985 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 6 proven. 104 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 22:37:51,005 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-06 22:37:51,005 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21] total 33 [2018-11-06 22:37:51,005 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-11-06 22:37:51,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-11-06 22:37:51,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=944, Unknown=0, NotChecked=0, Total=1056 [2018-11-06 22:37:51,006 INFO L87 Difference]: Start difference. First operand 492 states and 544 transitions. Second operand 33 states. [2018-11-06 22:37:53,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 22:37:53,158 INFO L93 Difference]: Finished difference Result 873 states and 968 transitions. [2018-11-06 22:37:53,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-11-06 22:37:53,159 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 78 [2018-11-06 22:37:53,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 22:37:53,161 INFO L225 Difference]: With dead ends: 873 [2018-11-06 22:37:53,161 INFO L226 Difference]: Without dead ends: 767 [2018-11-06 22:37:53,162 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 63 SyntacticMatches, 15 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 847 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=396, Invalid=2574, Unknown=0, NotChecked=0, Total=2970 [2018-11-06 22:37:53,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 767 states. [2018-11-06 22:37:53,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 767 to 573. [2018-11-06 22:37:53,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 573 states. [2018-11-06 22:37:53,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 573 states to 573 states and 637 transitions. [2018-11-06 22:37:53,260 INFO L78 Accepts]: Start accepts. Automaton has 573 states and 637 transitions. Word has length 78 [2018-11-06 22:37:53,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 22:37:53,260 INFO L480 AbstractCegarLoop]: Abstraction has 573 states and 637 transitions. [2018-11-06 22:37:53,260 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-11-06 22:37:53,260 INFO L276 IsEmpty]: Start isEmpty. Operand 573 states and 637 transitions. [2018-11-06 22:37:53,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-11-06 22:37:53,261 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 22:37:53,261 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 3, 3, 3, 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] [2018-11-06 22:37:53,261 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 22:37:53,262 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 22:37:53,262 INFO L82 PathProgramCache]: Analyzing trace with hash 655584783, now seen corresponding path program 3 times [2018-11-06 22:37:53,262 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 22:37:53,262 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 22:37:53,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:37:53,262 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-06 22:37:53,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:37:53,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:37:53,557 WARN L179 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-11-06 22:37:55,623 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 22:37:55,623 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 22:37:55,624 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-06 22:37:55,634 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-06 22:37:55,722 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-11-06 22:37:55,722 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-06 22:37:55,725 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 22:37:56,100 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 44 treesize of output 35 [2018-11-06 22:37:56,102 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:37:56,104 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 37 [2018-11-06 22:37:56,104 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-06 22:37:56,107 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-06 22:37:56,114 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-06 22:37:56,115 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:50, output treesize:27 [2018-11-06 22:37:56,240 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 40 [2018-11-06 22:37:56,244 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:37:56,245 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:37:56,247 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:37:56,247 INFO L682 Elim1Store]: detected equality via solver [2018-11-06 22:37:56,248 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:37:56,258 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 110 [2018-11-06 22:37:56,258 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-06 22:37:56,275 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-06 22:37:56,287 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-06 22:37:56,287 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:58, output treesize:50 [2018-11-06 22:37:56,605 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 68 treesize of output 55 [2018-11-06 22:37:56,609 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:37:56,611 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:37:56,612 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:37:56,614 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:37:56,618 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:37:56,619 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:37:56,661 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 55 treesize of output 164 [2018-11-06 22:37:56,663 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 4 xjuncts. [2018-11-06 22:37:56,734 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-06 22:37:56,774 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-06 22:37:56,775 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:83, output treesize:124 [2018-11-06 22:37:57,287 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 57 treesize of output 46 [2018-11-06 22:37:57,290 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:37:57,291 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:37:57,292 INFO L682 Elim1Store]: detected equality via solver [2018-11-06 22:37:57,293 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:37:57,309 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 86 [2018-11-06 22:37:57,310 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-06 22:37:57,321 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-06 22:37:57,337 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-06 22:37:57,337 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:74, output treesize:38 [2018-11-06 22:37:57,499 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 36 treesize of output 29 [2018-11-06 22:37:57,502 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:37:57,503 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:37:57,504 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:37:57,510 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 29 treesize of output 70 [2018-11-06 22:37:57,510 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-06 22:37:57,522 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-06 22:37:57,535 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-06 22:37:57,536 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:48, output treesize:29 [2018-11-06 22:37:57,767 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 26 treesize of output 18 [2018-11-06 22:37:57,773 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-11-06 22:37:57,773 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-06 22:37:57,775 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-06 22:37:57,778 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-06 22:37:57,778 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2018-11-06 22:37:57,886 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 22:37:57,906 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-06 22:37:57,906 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 32] total 56 [2018-11-06 22:37:57,906 INFO L459 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-11-06 22:37:57,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-11-06 22:37:57,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=2755, Unknown=0, NotChecked=0, Total=3080 [2018-11-06 22:37:57,907 INFO L87 Difference]: Start difference. First operand 573 states and 637 transitions. Second operand 56 states. [2018-11-06 22:37:59,707 WARN L179 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 44 [2018-11-06 22:38:01,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 22:38:01,967 INFO L93 Difference]: Finished difference Result 724 states and 796 transitions. [2018-11-06 22:38:01,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-11-06 22:38:01,967 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 78 [2018-11-06 22:38:01,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 22:38:01,971 INFO L225 Difference]: With dead ends: 724 [2018-11-06 22:38:01,971 INFO L226 Difference]: Without dead ends: 707 [2018-11-06 22:38:01,971 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 50 SyntacticMatches, 17 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3270 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=855, Invalid=8075, Unknown=0, NotChecked=0, Total=8930 [2018-11-06 22:38:01,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 707 states. [2018-11-06 22:38:02,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 707 to 621. [2018-11-06 22:38:02,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 621 states. [2018-11-06 22:38:02,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 621 states to 621 states and 689 transitions. [2018-11-06 22:38:02,077 INFO L78 Accepts]: Start accepts. Automaton has 621 states and 689 transitions. Word has length 78 [2018-11-06 22:38:02,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 22:38:02,077 INFO L480 AbstractCegarLoop]: Abstraction has 621 states and 689 transitions. [2018-11-06 22:38:02,077 INFO L481 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-11-06 22:38:02,077 INFO L276 IsEmpty]: Start isEmpty. Operand 621 states and 689 transitions. [2018-11-06 22:38:02,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-11-06 22:38:02,078 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 22:38:02,078 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 22:38:02,078 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 22:38:02,079 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 22:38:02,079 INFO L82 PathProgramCache]: Analyzing trace with hash -1636480120, now seen corresponding path program 3 times [2018-11-06 22:38:02,079 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 22:38:02,079 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 22:38:02,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:38:02,080 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-06 22:38:02,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:38:02,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:38:03,567 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 22:38:03,568 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 22:38:03,568 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-06 22:38:03,576 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-06 22:38:03,612 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-11-06 22:38:03,612 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-06 22:38:03,614 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 22:38:03,719 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 41 treesize of output 34 [2018-11-06 22:38:03,722 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:38:03,724 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 34 treesize of output 50 [2018-11-06 22:38:03,724 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-06 22:38:03,733 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-06 22:38:03,745 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-06 22:38:03,746 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:56, output treesize:49 [2018-11-06 22:38:03,944 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:38:03,945 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 51 treesize of output 53 [2018-11-06 22:38:03,947 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:38:03,947 INFO L682 Elim1Store]: detected equality via solver [2018-11-06 22:38:03,951 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:38:03,952 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 71 [2018-11-06 22:38:03,953 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-06 22:38:03,962 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-06 22:38:03,976 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-06 22:38:03,976 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:69, output treesize:36 [2018-11-06 22:38:04,042 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 36 treesize of output 29 [2018-11-06 22:38:04,048 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:38:04,049 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:38:04,050 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:38:04,052 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:38:04,055 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 84 [2018-11-06 22:38:04,055 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-06 22:38:04,068 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-06 22:38:04,078 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-06 22:38:04,078 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:49, output treesize:28 [2018-11-06 22:38:04,247 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 29 treesize of output 22 [2018-11-06 22:38:04,249 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:38:04,250 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:38:04,251 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:38:04,253 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:38:04,255 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 59 [2018-11-06 22:38:04,256 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-06 22:38:04,266 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-06 22:38:04,273 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-06 22:38:04,273 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:19 [2018-11-06 22:38:04,457 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 34 [2018-11-06 22:38:04,459 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:38:04,463 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:38:04,464 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:38:04,481 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 75 [2018-11-06 22:38:04,482 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-06 22:38:04,499 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-06 22:38:04,505 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-06 22:38:04,506 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:49, output treesize:21 [2018-11-06 22:38:04,567 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 28 treesize of output 20 [2018-11-06 22:38:04,568 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:38:04,569 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-11-06 22:38:04,569 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-06 22:38:04,574 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-06 22:38:04,575 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-06 22:38:04,575 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:5 [2018-11-06 22:38:04,619 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 123 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-06 22:38:04,638 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-06 22:38:04,638 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 29] total 42 [2018-11-06 22:38:04,639 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-11-06 22:38:04,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-11-06 22:38:04,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=204, Invalid=1518, Unknown=0, NotChecked=0, Total=1722 [2018-11-06 22:38:04,639 INFO L87 Difference]: Start difference. First operand 621 states and 689 transitions. Second operand 42 states. [2018-11-06 22:38:08,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 22:38:08,005 INFO L93 Difference]: Finished difference Result 745 states and 823 transitions. [2018-11-06 22:38:08,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-11-06 22:38:08,005 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 79 [2018-11-06 22:38:08,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 22:38:08,008 INFO L225 Difference]: With dead ends: 745 [2018-11-06 22:38:08,008 INFO L226 Difference]: Without dead ends: 743 [2018-11-06 22:38:08,009 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 54 SyntacticMatches, 19 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2095 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=629, Invalid=5223, Unknown=0, NotChecked=0, Total=5852 [2018-11-06 22:38:08,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 743 states. [2018-11-06 22:38:08,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 743 to 641. [2018-11-06 22:38:08,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 641 states. [2018-11-06 22:38:08,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 641 states to 641 states and 712 transitions. [2018-11-06 22:38:08,114 INFO L78 Accepts]: Start accepts. Automaton has 641 states and 712 transitions. Word has length 79 [2018-11-06 22:38:08,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 22:38:08,114 INFO L480 AbstractCegarLoop]: Abstraction has 641 states and 712 transitions. [2018-11-06 22:38:08,114 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-11-06 22:38:08,114 INFO L276 IsEmpty]: Start isEmpty. Operand 641 states and 712 transitions. [2018-11-06 22:38:08,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-11-06 22:38:08,115 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 22:38:08,115 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 22:38:08,115 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 22:38:08,116 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 22:38:08,116 INFO L82 PathProgramCache]: Analyzing trace with hash 1799884493, now seen corresponding path program 2 times [2018-11-06 22:38:08,116 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 22:38:08,116 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 22:38:08,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:38:08,117 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-06 22:38:08,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:38:08,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:38:09,552 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 56 proven. 76 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-06 22:38:09,552 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 22:38:09,552 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-06 22:38:09,560 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-06 22:38:09,588 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-06 22:38:09,588 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-06 22:38:09,590 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 22:38:09,945 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 28 treesize of output 23 [2018-11-06 22:38:09,947 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:38:09,948 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 23 treesize of output 37 [2018-11-06 22:38:09,949 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-06 22:38:09,956 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-06 22:38:09,967 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-06 22:38:09,967 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:42, output treesize:35 [2018-11-06 22:38:10,060 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 25 [2018-11-06 22:38:10,063 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:38:10,064 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:38:10,065 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:38:10,070 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 58 [2018-11-06 22:38:10,070 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-06 22:38:10,079 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-06 22:38:10,088 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-06 22:38:10,088 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:51, output treesize:19 [2018-11-06 22:38:10,148 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 26 treesize of output 18 [2018-11-06 22:38:10,150 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-11-06 22:38:10,151 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-06 22:38:10,151 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-06 22:38:10,152 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-06 22:38:10,152 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2018-11-06 22:38:10,181 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 20 proven. 116 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 22:38:10,201 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-06 22:38:10,201 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 35 [2018-11-06 22:38:10,202 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-11-06 22:38:10,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-11-06 22:38:10,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=206, Invalid=984, Unknown=0, NotChecked=0, Total=1190 [2018-11-06 22:38:10,202 INFO L87 Difference]: Start difference. First operand 641 states and 712 transitions. Second operand 35 states. [2018-11-06 22:38:14,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 22:38:14,304 INFO L93 Difference]: Finished difference Result 944 states and 1040 transitions. [2018-11-06 22:38:14,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-11-06 22:38:14,304 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 81 [2018-11-06 22:38:14,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 22:38:14,307 INFO L225 Difference]: With dead ends: 944 [2018-11-06 22:38:14,307 INFO L226 Difference]: Without dead ends: 838 [2018-11-06 22:38:14,307 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 67 SyntacticMatches, 6 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2498 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=1127, Invalid=6705, Unknown=0, NotChecked=0, Total=7832 [2018-11-06 22:38:14,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 838 states. [2018-11-06 22:38:14,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 838 to 661. [2018-11-06 22:38:14,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 661 states. [2018-11-06 22:38:14,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 661 states to 661 states and 735 transitions. [2018-11-06 22:38:14,416 INFO L78 Accepts]: Start accepts. Automaton has 661 states and 735 transitions. Word has length 81 [2018-11-06 22:38:14,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 22:38:14,416 INFO L480 AbstractCegarLoop]: Abstraction has 661 states and 735 transitions. [2018-11-06 22:38:14,416 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-11-06 22:38:14,416 INFO L276 IsEmpty]: Start isEmpty. Operand 661 states and 735 transitions. [2018-11-06 22:38:14,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-11-06 22:38:14,418 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 22:38:14,418 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 22:38:14,418 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 22:38:14,418 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 22:38:14,418 INFO L82 PathProgramCache]: Analyzing trace with hash -1097563092, now seen corresponding path program 3 times [2018-11-06 22:38:14,418 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 22:38:14,418 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 22:38:14,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:38:14,419 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-06 22:38:14,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:38:14,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:38:15,556 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 22:38:15,556 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 22:38:15,556 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-06 22:38:15,568 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-06 22:38:15,616 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-11-06 22:38:15,616 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-06 22:38:15,619 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 22:38:15,994 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 41 treesize of output 34 [2018-11-06 22:38:15,998 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:38:15,999 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 34 treesize of output 50 [2018-11-06 22:38:15,999 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-06 22:38:16,008 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-06 22:38:16,023 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-06 22:38:16,024 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:55, output treesize:48 [2018-11-06 22:38:16,274 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:38:16,275 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 51 treesize of output 53 [2018-11-06 22:38:16,279 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:38:16,280 INFO L682 Elim1Store]: detected equality via solver [2018-11-06 22:38:16,285 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:38:16,286 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 71 [2018-11-06 22:38:16,287 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-06 22:38:16,295 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-06 22:38:16,308 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-06 22:38:16,308 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:65, output treesize:32 [2018-11-06 22:38:16,751 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 51 treesize of output 42 [2018-11-06 22:38:16,755 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:38:16,756 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:38:16,758 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:38:16,759 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:38:16,762 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:38:16,763 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 122 [2018-11-06 22:38:16,763 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-06 22:38:16,779 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-06 22:38:16,792 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-06 22:38:16,793 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:60, output treesize:53 [2018-11-06 22:38:16,981 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 60 treesize of output 49 [2018-11-06 22:38:16,983 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:38:16,984 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:38:16,986 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:38:16,987 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:38:16,989 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:38:16,990 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:38:16,992 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:38:16,997 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:38:17,001 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 180 [2018-11-06 22:38:17,002 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-06 22:38:17,026 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-06 22:38:17,043 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-06 22:38:17,043 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:72, output treesize:53 [2018-11-06 22:38:17,389 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 53 treesize of output 41 [2018-11-06 22:38:17,394 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:38:17,395 INFO L682 Elim1Store]: detected equality via solver [2018-11-06 22:38:17,396 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:38:17,397 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:38:17,398 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:38:17,399 INFO L682 Elim1Store]: detected equality via solver [2018-11-06 22:38:17,401 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:38:17,404 INFO L700 Elim1Store]: detected not equals via solver [2018-11-06 22:38:17,405 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 83 [2018-11-06 22:38:17,406 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-06 22:38:17,415 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-06 22:38:17,421 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-06 22:38:17,421 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:59, output treesize:5 [2018-11-06 22:38:17,492 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 46 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 22:38:17,511 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-06 22:38:17,512 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 33] total 55 [2018-11-06 22:38:17,512 INFO L459 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-11-06 22:38:17,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-11-06 22:38:17,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=320, Invalid=2650, Unknown=0, NotChecked=0, Total=2970 [2018-11-06 22:38:17,513 INFO L87 Difference]: Start difference. First operand 661 states and 735 transitions. Second operand 55 states. [2018-11-06 22:38:23,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 22:38:23,687 INFO L93 Difference]: Finished difference Result 1191 states and 1319 transitions. [2018-11-06 22:38:23,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2018-11-06 22:38:23,687 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 81 [2018-11-06 22:38:23,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 22:38:23,690 INFO L225 Difference]: With dead ends: 1191 [2018-11-06 22:38:23,691 INFO L226 Difference]: Without dead ends: 1065 [2018-11-06 22:38:23,692 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 52 SyntacticMatches, 10 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5036 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=1467, Invalid=13053, Unknown=0, NotChecked=0, Total=14520 [2018-11-06 22:38:23,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1065 states. [2018-11-06 22:38:23,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1065 to 681. [2018-11-06 22:38:23,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 681 states. [2018-11-06 22:38:23,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 681 states to 681 states and 758 transitions. [2018-11-06 22:38:23,817 INFO L78 Accepts]: Start accepts. Automaton has 681 states and 758 transitions. Word has length 81 [2018-11-06 22:38:23,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 22:38:23,818 INFO L480 AbstractCegarLoop]: Abstraction has 681 states and 758 transitions. [2018-11-06 22:38:23,818 INFO L481 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-11-06 22:38:23,818 INFO L276 IsEmpty]: Start isEmpty. Operand 681 states and 758 transitions. [2018-11-06 22:38:23,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-11-06 22:38:23,819 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 22:38:23,819 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 22:38:23,819 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 22:38:23,819 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 22:38:23,819 INFO L82 PathProgramCache]: Analyzing trace with hash 2071431420, now seen corresponding path program 2 times [2018-11-06 22:38:23,819 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 22:38:23,819 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 22:38:23,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:38:23,820 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-06 22:38:23,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:38:23,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-06 22:38:23,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-06 22:38:23,869 INFO L442 BasicCegarLoop]: Counterexample might be feasible [2018-11-06 22:38:23,921 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 10:38:23 BoogieIcfgContainer [2018-11-06 22:38:23,921 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-06 22:38:23,922 INFO L168 Benchmark]: Toolchain (without parser) took 145985.99 ms. Allocated memory was 1.5 GB in the beginning and 2.6 GB in the end (delta: 1.0 GB). Free memory was 1.4 GB in the beginning and 2.0 GB in the end (delta: -551.4 MB). Peak memory consumption was 485.1 MB. Max. memory is 7.1 GB. [2018-11-06 22:38:23,923 INFO L168 Benchmark]: CDTParser took 0.29 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-06 22:38:23,923 INFO L168 Benchmark]: CACSL2BoogieTranslator took 343.14 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-11-06 22:38:23,923 INFO L168 Benchmark]: Boogie Procedure Inliner took 41.68 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-06 22:38:23,923 INFO L168 Benchmark]: Boogie Preprocessor took 29.57 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-06 22:38:23,924 INFO L168 Benchmark]: RCFGBuilder took 619.87 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 748.2 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -780.4 MB). Peak memory consumption was 15.1 MB. Max. memory is 7.1 GB. [2018-11-06 22:38:23,925 INFO L168 Benchmark]: TraceAbstraction took 144947.28 ms. Allocated memory was 2.3 GB in the beginning and 2.6 GB in the end (delta: 288.4 MB). Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 218.4 MB). Peak memory consumption was 506.8 MB. Max. memory is 7.1 GB. [2018-11-06 22:38:23,927 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.29 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 343.14 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 41.68 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 29.57 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 619.87 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 748.2 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -780.4 MB). Peak memory consumption was 15.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 144947.28 ms. Allocated memory was 2.3 GB in the beginning and 2.6 GB in the end (delta: 288.4 MB). Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 218.4 MB). Peak memory consumption was 506.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L11] unsigned int SIZE=__VERIFIER_nondet_uint(); [L12] int i, j, k, key; [L13] FCALL int v[SIZE]; [L14] j=1 [L14] COND TRUE j=0) && (v[i]>key) [L17] EXPR, FCALL v[i] [L17] (i>=0) && (v[i]>key) [L17] COND FALSE !((i>=0) && (v[i]>key)) [L22] FCALL v[i+1] = key [L14] j++ [L14] COND TRUE j=0) && (v[i]>key) [L17] EXPR, FCALL v[i] [L17] (i>=0) && (v[i]>key) [L17] COND FALSE !((i>=0) && (v[i]>key)) [L22] FCALL v[i+1] = key [L14] j++ [L14] COND TRUE j=0) && (v[i]>key) [L17] EXPR, FCALL v[i] [L17] (i>=0) && (v[i]>key) [L17] COND TRUE (i>=0) && (v[i]>key) [L18] COND FALSE !(i<2) [L20] i = i - 1 [L17] (i>=0) && (v[i]>key) [L17] EXPR, FCALL v[i] [L17] (i>=0) && (v[i]>key) [L17] COND TRUE (i>=0) && (v[i]>key) [L18] COND TRUE i<2 [L19] EXPR, FCALL v[i] [L19] FCALL v[i+1] = v[i] [L20] i = i - 1 [L17] (i>=0) && (v[i]>key) [L17] EXPR, FCALL v[i] [L17] (i>=0) && (v[i]>key) [L17] COND FALSE !((i>=0) && (v[i]>key)) [L22] FCALL v[i+1] = key [L14] j++ [L14] COND FALSE !(j