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/loop-crafted/simple_array_index_value_true-unreach-call2_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-06 22:47:40,270 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-06 22:47:40,273 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-06 22:47:40,285 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-06 22:47:40,286 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-06 22:47:40,287 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-06 22:47:40,288 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-06 22:47:40,290 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-06 22:47:40,291 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-06 22:47:40,292 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-06 22:47:40,293 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-06 22:47:40,293 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-06 22:47:40,294 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-06 22:47:40,295 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-06 22:47:40,296 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-06 22:47:40,297 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-06 22:47:40,298 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-06 22:47:40,300 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-06 22:47:40,302 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-06 22:47:40,303 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-06 22:47:40,305 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-06 22:47:40,306 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-06 22:47:40,308 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-06 22:47:40,309 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-06 22:47:40,309 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-06 22:47:40,310 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-06 22:47:40,311 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-06 22:47:40,312 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-06 22:47:40,313 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-06 22:47:40,314 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-06 22:47:40,314 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-06 22:47:40,315 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-06 22:47:40,315 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-06 22:47:40,315 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-06 22:47:40,316 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-06 22:47:40,317 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-06 22:47:40,318 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:47:40,335 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-06 22:47:40,335 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-06 22:47:40,336 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-06 22:47:40,336 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-06 22:47:40,338 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-06 22:47:40,339 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-06 22:47:40,339 INFO L133 SettingsManager]: * Use SBE=true [2018-11-06 22:47:40,339 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-06 22:47:40,339 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-06 22:47:40,339 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-06 22:47:40,340 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-06 22:47:40,340 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-06 22:47:40,340 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-06 22:47:40,341 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-06 22:47:40,341 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-06 22:47:40,341 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-06 22:47:40,341 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-06 22:47:40,341 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-06 22:47:40,343 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-06 22:47:40,343 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-06 22:47:40,343 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-06 22:47:40,343 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-06 22:47:40,343 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-06 22:47:40,344 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-06 22:47:40,344 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-06 22:47:40,344 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-06 22:47:40,345 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-06 22:47:40,345 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-06 22:47:40,388 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-06 22:47:40,401 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-06 22:47:40,405 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-06 22:47:40,407 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-06 22:47:40,407 INFO L276 PluginConnector]: CDTParser initialized [2018-11-06 22:47:40,408 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-crafted/simple_array_index_value_true-unreach-call2_true-termination.i [2018-11-06 22:47:40,468 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d224e63de/35a0a8089aa8440aaf77aa47b7adcfe4/FLAG9b74245ce [2018-11-06 22:47:40,964 INFO L298 CDTParser]: Found 1 translation units. [2018-11-06 22:47:40,964 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-crafted/simple_array_index_value_true-unreach-call2_true-termination.i [2018-11-06 22:47:40,971 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d224e63de/35a0a8089aa8440aaf77aa47b7adcfe4/FLAG9b74245ce [2018-11-06 22:47:40,989 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d224e63de/35a0a8089aa8440aaf77aa47b7adcfe4 [2018-11-06 22:47:40,999 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-06 22:47:41,001 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-06 22:47:41,002 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-06 22:47:41,002 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-06 22:47:41,006 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-06 22:47:41,007 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:47:40" (1/1) ... [2018-11-06 22:47:41,010 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@41600c68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:47:41, skipping insertion in model container [2018-11-06 22:47:41,010 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:47:40" (1/1) ... [2018-11-06 22:47:41,020 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-06 22:47:41,039 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-06 22:47:41,273 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-06 22:47:41,277 INFO L189 MainTranslator]: Completed pre-run [2018-11-06 22:47:41,300 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-06 22:47:41,323 INFO L193 MainTranslator]: Completed translation [2018-11-06 22:47:41,324 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:47:41 WrapperNode [2018-11-06 22:47:41,324 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-06 22:47:41,325 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-06 22:47:41,325 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-06 22:47:41,325 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-06 22:47:41,335 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:47:41" (1/1) ... [2018-11-06 22:47:41,345 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:47:41" (1/1) ... [2018-11-06 22:47:41,366 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-06 22:47:41,366 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-06 22:47:41,367 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-06 22:47:41,367 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-06 22:47:41,378 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:47:41" (1/1) ... [2018-11-06 22:47:41,378 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:47:41" (1/1) ... [2018-11-06 22:47:41,379 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:47:41" (1/1) ... [2018-11-06 22:47:41,380 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:47:41" (1/1) ... [2018-11-06 22:47:41,384 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:47:41" (1/1) ... [2018-11-06 22:47:41,395 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:47:41" (1/1) ... [2018-11-06 22:47:41,397 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:47:41" (1/1) ... [2018-11-06 22:47:41,401 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-06 22:47:41,405 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-06 22:47:41,405 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-06 22:47:41,405 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-06 22:47:41,406 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:47:41" (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:47:41,544 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-06 22:47:41,544 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-06 22:47:41,544 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-06 22:47:41,545 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-06 22:47:41,545 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-06 22:47:41,545 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-06 22:47:41,919 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-06 22:47:41,920 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:47:41 BoogieIcfgContainer [2018-11-06 22:47:41,920 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-06 22:47:41,921 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-06 22:47:41,921 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-06 22:47:41,924 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-06 22:47:41,924 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:47:40" (1/3) ... [2018-11-06 22:47:41,925 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ea8f3cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:47:41, skipping insertion in model container [2018-11-06 22:47:41,925 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:47:41" (2/3) ... [2018-11-06 22:47:41,926 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ea8f3cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:47:41, skipping insertion in model container [2018-11-06 22:47:41,926 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:47:41" (3/3) ... [2018-11-06 22:47:41,928 INFO L112 eAbstractionObserver]: Analyzing ICFG simple_array_index_value_true-unreach-call2_true-termination.i [2018-11-06 22:47:41,937 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-06 22:47:41,945 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-06 22:47:41,963 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-06 22:47:41,996 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-06 22:47:41,997 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-06 22:47:41,997 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-06 22:47:41,998 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-06 22:47:41,998 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-06 22:47:41,998 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-06 22:47:41,998 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-06 22:47:41,998 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-06 22:47:41,998 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-06 22:47:42,015 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states. [2018-11-06 22:47:42,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-06 22:47:42,022 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 22:47:42,024 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 22:47:42,026 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 22:47:42,032 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 22:47:42,033 INFO L82 PathProgramCache]: Analyzing trace with hash -525903762, now seen corresponding path program 1 times [2018-11-06 22:47:42,035 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 22:47:42,035 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 22:47:42,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:47:42,080 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 22:47:42,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:47:42,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:47:42,145 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:47:42,148 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 22:47:42,148 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-06 22:47:42,151 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-06 22:47:42,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-06 22:47:42,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-06 22:47:42,168 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 2 states. [2018-11-06 22:47:42,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 22:47:42,184 INFO L93 Difference]: Finished difference Result 38 states and 44 transitions. [2018-11-06 22:47:42,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-06 22:47:42,185 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 12 [2018-11-06 22:47:42,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 22:47:42,196 INFO L225 Difference]: With dead ends: 38 [2018-11-06 22:47:42,197 INFO L226 Difference]: Without dead ends: 18 [2018-11-06 22:47:42,200 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:47:42,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-11-06 22:47:42,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-11-06 22:47:42,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-06 22:47:42,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2018-11-06 22:47:42,233 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 12 [2018-11-06 22:47:42,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 22:47:42,234 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2018-11-06 22:47:42,234 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-06 22:47:42,234 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2018-11-06 22:47:42,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-06 22:47:42,235 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 22:47:42,235 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 22:47:42,235 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 22:47:42,236 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 22:47:42,236 INFO L82 PathProgramCache]: Analyzing trace with hash -428012523, now seen corresponding path program 1 times [2018-11-06 22:47:42,236 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 22:47:42,236 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 22:47:42,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:47:42,238 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 22:47:42,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:47:42,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:47:42,313 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:47:42,315 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 22:47:42,315 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 22:47:42,316 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 22:47:42,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 22:47:42,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 22:47:42,318 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand 3 states. [2018-11-06 22:47:42,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 22:47:42,434 INFO L93 Difference]: Finished difference Result 41 states and 43 transitions. [2018-11-06 22:47:42,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 22:47:42,436 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-11-06 22:47:42,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 22:47:42,437 INFO L225 Difference]: With dead ends: 41 [2018-11-06 22:47:42,438 INFO L226 Difference]: Without dead ends: 31 [2018-11-06 22:47:42,439 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 22:47:42,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-11-06 22:47:42,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 20. [2018-11-06 22:47:42,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-06 22:47:42,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2018-11-06 22:47:42,448 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 13 [2018-11-06 22:47:42,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 22:47:42,449 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2018-11-06 22:47:42,449 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 22:47:42,449 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2018-11-06 22:47:42,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-06 22:47:42,450 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 22:47:42,451 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 22:47:42,452 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 22:47:42,452 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 22:47:42,453 INFO L82 PathProgramCache]: Analyzing trace with hash -1017278354, now seen corresponding path program 1 times [2018-11-06 22:47:42,453 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 22:47:42,453 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 22:47:42,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:47:42,454 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 22:47:42,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:47:42,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:47:42,581 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:47:42,581 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 22:47:42,581 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:47:42,600 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 22:47:42,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:47:42,637 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 22:47:42,739 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 11 treesize of output 8 [2018-11-06 22:47:42,753 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 8 treesize of output 7 [2018-11-06 22:47:42,753 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-06 22:47:42,766 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-06 22:47:42,825 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:47:42,825 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:9 [2018-11-06 22:47:43,046 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2018-11-06 22:47:43,073 INFO L682 Elim1Store]: detected equality via solver [2018-11-06 22:47:43,075 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-11-06 22:47:43,076 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-06 22:47:43,139 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-06 22:47:43,149 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:47:43,150 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:26, output treesize:9 [2018-11-06 22:47:43,253 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:47:43,277 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-06 22:47:43,277 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 8] total 9 [2018-11-06 22:47:43,277 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-06 22:47:43,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-06 22:47:43,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-11-06 22:47:43,278 INFO L87 Difference]: Start difference. First operand 20 states and 21 transitions. Second operand 9 states. [2018-11-06 22:47:43,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 22:47:43,821 INFO L93 Difference]: Finished difference Result 83 states and 87 transitions. [2018-11-06 22:47:43,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-06 22:47:43,821 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 17 [2018-11-06 22:47:43,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 22:47:43,824 INFO L225 Difference]: With dead ends: 83 [2018-11-06 22:47:43,824 INFO L226 Difference]: Without dead ends: 73 [2018-11-06 22:47:43,825 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210 [2018-11-06 22:47:43,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-11-06 22:47:43,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 34. [2018-11-06 22:47:43,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-06 22:47:43,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 36 transitions. [2018-11-06 22:47:43,833 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 36 transitions. Word has length 17 [2018-11-06 22:47:43,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 22:47:43,834 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 36 transitions. [2018-11-06 22:47:43,834 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-06 22:47:43,834 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 36 transitions. [2018-11-06 22:47:43,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-06 22:47:43,835 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 22:47:43,835 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 22:47:43,835 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 22:47:43,835 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 22:47:43,836 INFO L82 PathProgramCache]: Analyzing trace with hash 1261001632, now seen corresponding path program 2 times [2018-11-06 22:47:43,836 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 22:47:43,836 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 22:47:43,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:47:43,837 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 22:47:43,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:47:43,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:47:44,266 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 22:47:44,267 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 22:47:44,267 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:47:44,283 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-06 22:47:44,322 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-06 22:47:44,322 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-06 22:47:44,326 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 22:47:44,473 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 11 treesize of output 8 [2018-11-06 22:47:44,477 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 8 treesize of output 7 [2018-11-06 22:47:44,477 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-06 22:47:44,482 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-06 22:47:44,497 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:47:44,499 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:9 [2018-11-06 22:47:44,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 27 treesize of output 22 [2018-11-06 22:47:44,614 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 36 [2018-11-06 22:47:44,624 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-06 22:47:44,642 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-06 22:47:44,680 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:47:44,681 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:27 [2018-11-06 22:47:44,731 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:47:44,802 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 36 [2018-11-06 22:47:44,805 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-06 22:47:44,829 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-06 22:47:44,841 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:47:44,842 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:27 [2018-11-06 22:47:44,915 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2018-11-06 22:47:44,922 INFO L682 Elim1Store]: detected equality via solver [2018-11-06 22:47:44,923 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-11-06 22:47:44,924 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-06 22:47:44,928 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-06 22:47:44,935 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:47:44,936 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:26, output treesize:9 [2018-11-06 22:47:44,985 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-06 22:47:45,013 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-06 22:47:45,013 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9] total 12 [2018-11-06 22:47:45,013 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-06 22:47:45,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-06 22:47:45,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2018-11-06 22:47:45,014 INFO L87 Difference]: Start difference. First operand 34 states and 36 transitions. Second operand 12 states. [2018-11-06 22:47:46,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 22:47:46,253 INFO L93 Difference]: Finished difference Result 84 states and 88 transitions. [2018-11-06 22:47:46,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-06 22:47:46,257 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 25 [2018-11-06 22:47:46,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 22:47:46,259 INFO L225 Difference]: With dead ends: 84 [2018-11-06 22:47:46,259 INFO L226 Difference]: Without dead ends: 68 [2018-11-06 22:47:46,260 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 17 SyntacticMatches, 5 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=90, Invalid=416, Unknown=0, NotChecked=0, Total=506 [2018-11-06 22:47:46,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-11-06 22:47:46,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 37. [2018-11-06 22:47:46,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-06 22:47:46,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2018-11-06 22:47:46,270 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 38 transitions. Word has length 25 [2018-11-06 22:47:46,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 22:47:46,271 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 38 transitions. [2018-11-06 22:47:46,271 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-06 22:47:46,271 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2018-11-06 22:47:46,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-06 22:47:46,272 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 22:47:46,272 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 22:47:46,273 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 22:47:46,273 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 22:47:46,273 INFO L82 PathProgramCache]: Analyzing trace with hash 1142771482, now seen corresponding path program 1 times [2018-11-06 22:47:46,273 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 22:47:46,273 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 22:47:46,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:47:46,274 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-06 22:47:46,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:47:46,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:47:46,657 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-06 22:47:46,657 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 22:47:46,657 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:47:46,668 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 22:47:46,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:47:46,696 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 22:47:46,763 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 17 treesize of output 14 [2018-11-06 22:47:46,777 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-11-06 22:47:46,778 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-06 22:47:46,804 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-06 22:47:46,901 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:47:46,902 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:47, output treesize:40 [2018-11-06 22:47:47,014 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 35 treesize of output 30 [2018-11-06 22:47:47,042 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 50 [2018-11-06 22:47:47,045 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-06 22:47:47,134 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-06 22:47:47,157 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:47:47,157 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:64, output treesize:57 [2018-11-06 22:47:47,248 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 30 [2018-11-06 22:47:47,267 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 50 [2018-11-06 22:47:47,270 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-06 22:47:47,291 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-06 22:47:47,318 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:47:47,318 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:64, output treesize:57 [2018-11-06 22:47:47,465 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 31 treesize of output 27 [2018-11-06 22:47:47,482 INFO L682 Elim1Store]: detected equality via solver [2018-11-06 22:47:47,483 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 23 [2018-11-06 22:47:47,484 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-06 22:47:47,492 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-06 22:47:47,537 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:47:47,538 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:56, output treesize:33 [2018-11-06 22:47:47,671 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-06 22:47:47,691 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-06 22:47:47,691 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 11] total 14 [2018-11-06 22:47:47,692 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-06 22:47:47,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-06 22:47:47,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2018-11-06 22:47:47,694 INFO L87 Difference]: Start difference. First operand 37 states and 38 transitions. Second operand 14 states. [2018-11-06 22:47:49,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 22:47:49,438 INFO L93 Difference]: Finished difference Result 94 states and 97 transitions. [2018-11-06 22:47:49,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-06 22:47:49,438 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 36 [2018-11-06 22:47:49,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 22:47:49,439 INFO L225 Difference]: With dead ends: 94 [2018-11-06 22:47:49,440 INFO L226 Difference]: Without dead ends: 79 [2018-11-06 22:47:49,440 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 24 SyntacticMatches, 8 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=96, Invalid=504, Unknown=0, NotChecked=0, Total=600 [2018-11-06 22:47:49,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-11-06 22:47:49,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 48. [2018-11-06 22:47:49,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-06 22:47:49,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 49 transitions. [2018-11-06 22:47:49,451 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 49 transitions. Word has length 36 [2018-11-06 22:47:49,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 22:47:49,451 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 49 transitions. [2018-11-06 22:47:49,451 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-06 22:47:49,451 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 49 transitions. [2018-11-06 22:47:49,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-11-06 22:47:49,453 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 22:47:49,453 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 22:47:49,453 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 22:47:49,454 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 22:47:49,454 INFO L82 PathProgramCache]: Analyzing trace with hash 1389624818, now seen corresponding path program 2 times [2018-11-06 22:47:49,454 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 22:47:49,454 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 22:47:49,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:47:49,455 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 22:47:49,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:47:49,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:47:49,697 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-11-06 22:47:49,698 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 22:47:49,698 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:47:49,717 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-06 22:47:49,758 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-06 22:47:49,758 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-06 22:47:49,762 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 22:47:49,883 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 17 treesize of output 14 [2018-11-06 22:47:49,886 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-11-06 22:47:49,886 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-06 22:47:49,890 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-06 22:47:49,906 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:47:49,906 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:46, output treesize:39 [2018-11-06 22:47:50,003 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 35 treesize of output 30 [2018-11-06 22:47:50,032 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 50 [2018-11-06 22:47:50,037 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-06 22:47:50,176 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-06 22:47:50,272 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:47:50,273 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:63, output treesize:56 [2018-11-06 22:47:50,377 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 35 treesize of output 30 [2018-11-06 22:47:50,394 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 50 [2018-11-06 22:47:50,396 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-06 22:47:50,415 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-06 22:47:50,442 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:47:50,443 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:63, output treesize:56 [2018-11-06 22:47:50,799 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 31 treesize of output 27 [2018-11-06 22:47:50,804 INFO L682 Elim1Store]: detected equality via solver [2018-11-06 22:47:50,805 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 23 [2018-11-06 22:47:50,806 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-06 22:47:50,815 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-06 22:47:50,830 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:47:50,830 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:55, output treesize:32 [2018-11-06 22:47:51,002 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-06 22:47:51,022 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-06 22:47:51,023 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 13] total 17 [2018-11-06 22:47:51,023 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-06 22:47:51,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-06 22:47:51,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2018-11-06 22:47:51,024 INFO L87 Difference]: Start difference. First operand 48 states and 49 transitions. Second operand 17 states. [2018-11-06 22:47:54,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 22:47:54,372 INFO L93 Difference]: Finished difference Result 112 states and 115 transitions. [2018-11-06 22:47:54,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-06 22:47:54,373 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 47 [2018-11-06 22:47:54,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 22:47:54,374 INFO L225 Difference]: With dead ends: 112 [2018-11-06 22:47:54,374 INFO L226 Difference]: Without dead ends: 90 [2018-11-06 22:47:54,375 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 33 SyntacticMatches, 8 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=112, Invalid=644, Unknown=0, NotChecked=0, Total=756 [2018-11-06 22:47:54,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-11-06 22:47:54,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 59. [2018-11-06 22:47:54,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-11-06 22:47:54,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 60 transitions. [2018-11-06 22:47:54,388 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 60 transitions. Word has length 47 [2018-11-06 22:47:54,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 22:47:54,388 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 60 transitions. [2018-11-06 22:47:54,389 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-06 22:47:54,389 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 60 transitions. [2018-11-06 22:47:54,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-11-06 22:47:54,390 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 22:47:54,390 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 22:47:54,391 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 22:47:54,391 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 22:47:54,391 INFO L82 PathProgramCache]: Analyzing trace with hash -1652572856, now seen corresponding path program 3 times [2018-11-06 22:47:54,391 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 22:47:54,392 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 22:47:54,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:47:54,393 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-06 22:47:54,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:47:54,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:47:54,693 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-11-06 22:47:54,694 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 22:47:54,694 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:47:54,721 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-06 22:48:35,858 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-11-06 22:48:35,859 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-06 22:48:35,879 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 22:48:36,045 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 17 treesize of output 14 [2018-11-06 22:48:36,047 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-11-06 22:48:36,048 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-06 22:48:36,051 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-06 22:48:36,066 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:48:36,066 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:46, output treesize:39 [2018-11-06 22:48:36,147 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 35 treesize of output 30 [2018-11-06 22:48:36,164 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 50 [2018-11-06 22:48:36,166 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-06 22:48:36,182 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-06 22:48:36,201 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:48:36,202 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:63, output treesize:56 [2018-11-06 22:48:36,578 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 35 treesize of output 30 [2018-11-06 22:48:36,743 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 50 [2018-11-06 22:48:36,744 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-06 22:48:36,870 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-06 22:48:37,107 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:48:37,108 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:63, output treesize:56 [2018-11-06 22:48:37,451 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 31 treesize of output 27 [2018-11-06 22:48:37,455 INFO L682 Elim1Store]: detected equality via solver [2018-11-06 22:48:37,456 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 23 [2018-11-06 22:48:37,457 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-06 22:48:37,463 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-06 22:48:37,474 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:48:37,474 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:55, output treesize:32 [2018-11-06 22:48:37,593 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-06 22:48:37,598 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-06 22:48:37,598 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 15] total 20 [2018-11-06 22:48:37,599 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-06 22:48:37,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-06 22:48:37,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2018-11-06 22:48:37,599 INFO L87 Difference]: Start difference. First operand 59 states and 60 transitions. Second operand 20 states. [2018-11-06 22:48:41,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 22:48:41,084 INFO L93 Difference]: Finished difference Result 130 states and 133 transitions. [2018-11-06 22:48:41,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-06 22:48:41,085 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 58 [2018-11-06 22:48:41,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 22:48:41,086 INFO L225 Difference]: With dead ends: 130 [2018-11-06 22:48:41,086 INFO L226 Difference]: Without dead ends: 101 [2018-11-06 22:48:41,087 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 43 SyntacticMatches, 7 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=122, Invalid=808, Unknown=0, NotChecked=0, Total=930 [2018-11-06 22:48:41,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-11-06 22:48:41,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 70. [2018-11-06 22:48:41,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-11-06 22:48:41,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 71 transitions. [2018-11-06 22:48:41,114 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 71 transitions. Word has length 58 [2018-11-06 22:48:41,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 22:48:41,114 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 71 transitions. [2018-11-06 22:48:41,114 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-06 22:48:41,114 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 71 transitions. [2018-11-06 22:48:41,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-11-06 22:48:41,116 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 22:48:41,117 INFO L375 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 5, 5, 5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 22:48:41,117 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 22:48:41,117 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 22:48:41,117 INFO L82 PathProgramCache]: Analyzing trace with hash -1683032252, now seen corresponding path program 4 times [2018-11-06 22:48:41,117 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 22:48:41,117 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 22:48:41,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:48:41,118 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-06 22:48:41,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:48:41,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:48:41,857 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2018-11-06 22:48:41,858 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 22:48:41,858 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:48:41,866 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-06 22:48:41,916 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-06 22:48:41,916 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-06 22:48:41,920 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 22:48:42,185 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 17 treesize of output 14 [2018-11-06 22:48:42,188 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-11-06 22:48:42,188 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-06 22:48:42,191 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-06 22:48:42,203 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:48:42,203 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:46, output treesize:39 [2018-11-06 22:48:42,293 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 35 treesize of output 30 [2018-11-06 22:48:42,313 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 50 [2018-11-06 22:48:42,314 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-06 22:48:42,328 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-06 22:48:42,349 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:48:42,349 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:63, output treesize:56 [2018-11-06 22:48:42,443 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 35 treesize of output 30 [2018-11-06 22:48:42,466 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 50 [2018-11-06 22:48:42,467 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-06 22:48:42,483 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-06 22:48:42,509 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:48:42,509 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:63, output treesize:56 [2018-11-06 22:48:42,950 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 31 treesize of output 27 [2018-11-06 22:48:42,961 INFO L682 Elim1Store]: detected equality via solver [2018-11-06 22:48:42,962 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 23 [2018-11-06 22:48:42,962 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-06 22:48:42,972 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-06 22:48:42,987 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:48:42,987 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:55, output treesize:32 [2018-11-06 22:48:43,183 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 0 proven. 150 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-06 22:48:43,204 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-06 22:48:43,204 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 17] total 23 [2018-11-06 22:48:43,204 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-11-06 22:48:43,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-06 22:48:43,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=442, Unknown=0, NotChecked=0, Total=506 [2018-11-06 22:48:43,205 INFO L87 Difference]: Start difference. First operand 70 states and 71 transitions. Second operand 23 states. [2018-11-06 22:48:48,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 22:48:48,185 INFO L93 Difference]: Finished difference Result 148 states and 151 transitions. [2018-11-06 22:48:48,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-11-06 22:48:48,186 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 69 [2018-11-06 22:48:48,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 22:48:48,187 INFO L225 Difference]: With dead ends: 148 [2018-11-06 22:48:48,187 INFO L226 Difference]: Without dead ends: 112 [2018-11-06 22:48:48,188 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 51 SyntacticMatches, 8 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=132, Invalid=990, Unknown=0, NotChecked=0, Total=1122 [2018-11-06 22:48:48,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-11-06 22:48:48,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 81. [2018-11-06 22:48:48,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-11-06 22:48:48,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 82 transitions. [2018-11-06 22:48:48,205 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 82 transitions. Word has length 69 [2018-11-06 22:48:48,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 22:48:48,206 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 82 transitions. [2018-11-06 22:48:48,206 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-11-06 22:48:48,206 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 82 transitions. [2018-11-06 22:48:48,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-11-06 22:48:48,209 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 22:48:48,209 INFO L375 BasicCegarLoop]: trace histogram [9, 8, 8, 8, 6, 6, 6, 6, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 22:48:48,210 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 22:48:48,210 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 22:48:48,210 INFO L82 PathProgramCache]: Analyzing trace with hash -229579658, now seen corresponding path program 5 times [2018-11-06 22:48:48,210 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 22:48:48,210 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 22:48:48,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:48:48,211 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-06 22:48:48,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:48:48,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:48:48,756 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 0 proven. 128 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2018-11-06 22:48:48,756 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 22:48:48,756 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:48:48,764 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-06 22:49:25,465 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2018-11-06 22:49:25,466 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-06 22:49:25,525 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 22:49:25,767 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 17 treesize of output 14 [2018-11-06 22:49:25,771 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-11-06 22:49:25,771 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-06 22:49:25,773 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-06 22:49:25,790 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:49:25,790 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:46, output treesize:39 [2018-11-06 22:49:25,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 30 [2018-11-06 22:49:25,897 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 50 [2018-11-06 22:49:25,899 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-06 22:49:25,913 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-06 22:49:27,224 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:49:27,225 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:63, output treesize:56 [2018-11-06 22:49:27,481 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 35 treesize of output 30 [2018-11-06 22:49:27,507 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 50 [2018-11-06 22:49:27,509 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-06 22:49:27,524 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-06 22:49:27,601 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:49:27,601 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:63, output treesize:56 [2018-11-06 22:49:29,469 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 31 treesize of output 27 [2018-11-06 22:49:29,473 INFO L682 Elim1Store]: detected equality via solver [2018-11-06 22:49:29,474 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 23 [2018-11-06 22:49:29,474 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-06 22:49:29,483 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-06 22:49:29,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:49:29,496 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:55, output treesize:32 [2018-11-06 22:49:29,670 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 0 proven. 213 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-06 22:49:29,675 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-06 22:49:29,675 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 19] total 26 [2018-11-06 22:49:29,675 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-11-06 22:49:29,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-11-06 22:49:29,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=576, Unknown=0, NotChecked=0, Total=650 [2018-11-06 22:49:29,676 INFO L87 Difference]: Start difference. First operand 81 states and 82 transitions. Second operand 26 states. [2018-11-06 22:49:37,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 22:49:37,132 INFO L93 Difference]: Finished difference Result 166 states and 169 transitions. [2018-11-06 22:49:37,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-11-06 22:49:37,133 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 80 [2018-11-06 22:49:37,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 22:49:37,134 INFO L225 Difference]: With dead ends: 166 [2018-11-06 22:49:37,134 INFO L226 Difference]: Without dead ends: 123 [2018-11-06 22:49:37,135 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 60 SyntacticMatches, 8 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 265 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=142, Invalid=1189, Unknown=1, NotChecked=0, Total=1332 [2018-11-06 22:49:37,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-11-06 22:49:37,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 92. [2018-11-06 22:49:37,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-11-06 22:49:37,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 93 transitions. [2018-11-06 22:49:37,154 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 93 transitions. Word has length 80 [2018-11-06 22:49:37,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 22:49:37,155 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 93 transitions. [2018-11-06 22:49:37,155 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-11-06 22:49:37,155 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 93 transitions. [2018-11-06 22:49:37,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-11-06 22:49:37,156 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 22:49:37,157 INFO L375 BasicCegarLoop]: trace histogram [10, 9, 9, 9, 7, 7, 7, 7, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 22:49:37,157 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 22:49:37,157 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 22:49:37,157 INFO L82 PathProgramCache]: Analyzing trace with hash -491509866, now seen corresponding path program 6 times [2018-11-06 22:49:37,157 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 22:49:37,157 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 22:49:37,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:49:37,158 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-06 22:49:37,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:49:37,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:49:38,015 INFO L134 CoverageAnalysis]: Checked inductivity of 297 backedges. 0 proven. 162 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2018-11-06 22:49:38,016 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 22:49:38,016 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:49:38,027 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-06 22:50:24,318 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2018-11-06 22:50:24,319 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-06 22:50:24,344 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 22:50:24,752 INFO L134 CoverageAnalysis]: Checked inductivity of 297 backedges. 0 proven. 162 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2018-11-06 22:50:24,781 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-06 22:50:24,782 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 20 [2018-11-06 22:50:24,782 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-06 22:50:24,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-06 22:50:24,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=335, Unknown=0, NotChecked=0, Total=380 [2018-11-06 22:50:24,783 INFO L87 Difference]: Start difference. First operand 92 states and 93 transitions. Second operand 20 states. [2018-11-06 22:50:26,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 22:50:26,061 INFO L93 Difference]: Finished difference Result 186 states and 188 transitions. [2018-11-06 22:50:26,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-06 22:50:26,062 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 91 [2018-11-06 22:50:26,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 22:50:26,063 INFO L225 Difference]: With dead ends: 186 [2018-11-06 22:50:26,063 INFO L226 Difference]: Without dead ends: 136 [2018-11-06 22:50:26,064 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 82 SyntacticMatches, 4 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=45, Invalid=335, Unknown=0, NotChecked=0, Total=380 [2018-11-06 22:50:26,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2018-11-06 22:50:26,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 96. [2018-11-06 22:50:26,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-11-06 22:50:26,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 97 transitions. [2018-11-06 22:50:26,086 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 97 transitions. Word has length 91 [2018-11-06 22:50:26,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 22:50:26,086 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 97 transitions. [2018-11-06 22:50:26,086 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-06 22:50:26,086 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 97 transitions. [2018-11-06 22:50:26,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-11-06 22:50:26,087 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 22:50:26,088 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 7, 7, 7, 7, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 22:50:26,088 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 22:50:26,088 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 22:50:26,088 INFO L82 PathProgramCache]: Analyzing trace with hash 1232360495, now seen corresponding path program 7 times [2018-11-06 22:50:26,088 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 22:50:26,088 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 22:50:26,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:50:26,089 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-06 22:50:26,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:50:26,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:50:27,010 INFO L134 CoverageAnalysis]: Checked inductivity of 335 backedges. 0 proven. 200 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2018-11-06 22:50:27,011 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 22:50:27,011 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:50:27,019 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 22:50:27,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:50:27,069 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 22:50:27,579 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 17 treesize of output 14 [2018-11-06 22:50:27,582 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-11-06 22:50:27,582 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-06 22:50:27,585 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-06 22:50:27,598 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:50:27,598 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:48, output treesize:41 [2018-11-06 22:50:27,711 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 35 treesize of output 30 [2018-11-06 22:50:27,727 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 50 [2018-11-06 22:50:27,728 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-06 22:50:27,741 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-06 22:50:27,765 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:50:27,765 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:65, output treesize:58 [2018-11-06 22:50:27,909 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 35 treesize of output 30 [2018-11-06 22:50:27,932 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 50 [2018-11-06 22:50:27,933 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-06 22:50:27,949 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-06 22:50:27,969 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:50:27,969 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:65, output treesize:58 [2018-11-06 22:50:28,083 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 35 treesize of output 30 [2018-11-06 22:50:28,102 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 50 [2018-11-06 22:50:28,103 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-06 22:50:28,118 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-06 22:50:28,142 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:50:28,142 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:65, output treesize:58 [2018-11-06 22:50:28,707 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 31 treesize of output 27 [2018-11-06 22:50:28,710 INFO L682 Elim1Store]: detected equality via solver [2018-11-06 22:50:28,710 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 23 [2018-11-06 22:50:28,711 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-06 22:50:28,725 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-06 22:50:28,742 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:50:28,742 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:57, output treesize:34 [2018-11-06 22:50:34,919 INFO L134 CoverageAnalysis]: Checked inductivity of 335 backedges. 0 proven. 314 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-11-06 22:50:34,939 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-06 22:50:34,940 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 21] total 30 [2018-11-06 22:50:34,940 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-11-06 22:50:34,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-11-06 22:50:34,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=781, Unknown=3, NotChecked=0, Total=870 [2018-11-06 22:50:34,941 INFO L87 Difference]: Start difference. First operand 96 states and 97 transitions. Second operand 30 states. [2018-11-06 22:51:00,671 WARN L179 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 37 [2018-11-06 22:51:02,749 WARN L179 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 40 [2018-11-06 22:51:11,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 22:51:11,850 INFO L93 Difference]: Finished difference Result 197 states and 200 transitions. [2018-11-06 22:51:11,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-11-06 22:51:11,850 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 95 [2018-11-06 22:51:11,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 22:51:11,852 INFO L225 Difference]: With dead ends: 197 [2018-11-06 22:51:11,852 INFO L226 Difference]: Without dead ends: 147 [2018-11-06 22:51:11,853 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 71 SyntacticMatches, 10 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 379 ImplicationChecksByTransitivity, 22.9s TimeCoverageRelationStatistics Valid=164, Invalid=1634, Unknown=8, NotChecked=0, Total=1806 [2018-11-06 22:51:11,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-11-06 22:51:11,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 107. [2018-11-06 22:51:11,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-11-06 22:51:11,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 108 transitions. [2018-11-06 22:51:11,884 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 108 transitions. Word has length 95 [2018-11-06 22:51:11,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 22:51:11,884 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 108 transitions. [2018-11-06 22:51:11,884 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-11-06 22:51:11,884 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 108 transitions. [2018-11-06 22:51:11,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-11-06 22:51:11,886 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 22:51:11,886 INFO L375 BasicCegarLoop]: trace histogram [12, 11, 11, 11, 8, 8, 8, 8, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 22:51:11,886 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 22:51:11,887 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 22:51:11,887 INFO L82 PathProgramCache]: Analyzing trace with hash 2059341419, now seen corresponding path program 8 times [2018-11-06 22:51:11,887 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 22:51:11,887 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 22:51:11,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:51:11,888 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 22:51:11,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:51:11,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:51:12,661 INFO L134 CoverageAnalysis]: Checked inductivity of 424 backedges. 0 proven. 242 refuted. 0 times theorem prover too weak. 182 trivial. 0 not checked. [2018-11-06 22:51:12,661 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 22:51:12,661 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:51:12,676 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-06 22:51:12,714 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-06 22:51:12,715 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-06 22:51:12,723 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 22:51:13,762 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 17 treesize of output 14 [2018-11-06 22:51:13,765 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-11-06 22:51:13,766 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-06 22:51:13,774 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-06 22:51:13,792 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:51:13,792 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:48, output treesize:41 [2018-11-06 22:51:13,914 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 35 treesize of output 30 [2018-11-06 22:51:13,931 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 50 [2018-11-06 22:51:13,933 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-06 22:51:13,949 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-06 22:51:13,971 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:51:13,971 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:65, output treesize:58 [2018-11-06 22:51:14,104 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 35 treesize of output 30 [2018-11-06 22:51:16,199 WARN L669 Elim1Store]: solver failed to check if following equality is implied: (= ULTIMATE.start_main_~tmp~0 (select v_arrayElimCell_50 (+ (* 4 (mod v_prenex_20 4294967296)) |ULTIMATE.start_main_~#array~0.offset|))) [2018-11-06 22:51:16,201 INFO L303 Elim1Store]: Index analysis took 2095 ms [2018-11-06 22:51:16,211 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 50 [2018-11-06 22:51:16,212 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-06 22:51:16,232 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-06 22:51:16,256 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:51:16,256 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:65, output treesize:58 [2018-11-06 22:51:16,497 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 35 treesize of output 30 [2018-11-06 22:51:16,518 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 50 [2018-11-06 22:51:16,519 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-06 22:51:16,539 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-06 22:51:16,571 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:51:16,572 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:65, output treesize:58 [2018-11-06 22:51:17,271 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 31 treesize of output 27 [2018-11-06 22:51:17,274 INFO L682 Elim1Store]: detected equality via solver [2018-11-06 22:51:17,275 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 23 [2018-11-06 22:51:17,275 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-06 22:51:17,283 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-06 22:51:17,297 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:51:17,298 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:57, output treesize:34 [2018-11-06 22:51:23,538 INFO L134 CoverageAnalysis]: Checked inductivity of 424 backedges. 0 proven. 403 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-11-06 22:51:23,558 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-06 22:51:23,558 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 23] total 33 [2018-11-06 22:51:23,558 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-11-06 22:51:23,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-11-06 22:51:23,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=957, Unknown=3, NotChecked=0, Total=1056 [2018-11-06 22:51:23,559 INFO L87 Difference]: Start difference. First operand 107 states and 108 transitions. Second operand 33 states. [2018-11-06 22:51:46,855 WARN L179 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 37 [2018-11-06 22:51:48,923 WARN L179 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 40 [2018-11-06 22:52:01,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 22:52:01,192 INFO L93 Difference]: Finished difference Result 215 states and 218 transitions. [2018-11-06 22:52:01,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-11-06 22:52:01,193 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 106 [2018-11-06 22:52:01,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 22:52:01,193 INFO L225 Difference]: With dead ends: 215 [2018-11-06 22:52:01,194 INFO L226 Difference]: Without dead ends: 158 [2018-11-06 22:52:01,195 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 80 SyntacticMatches, 10 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 442 ImplicationChecksByTransitivity, 23.6s TimeCoverageRelationStatistics Valid=174, Invalid=1888, Unknown=8, NotChecked=0, Total=2070 [2018-11-06 22:52:01,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-11-06 22:52:01,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 118. [2018-11-06 22:52:01,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-11-06 22:52:01,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 119 transitions. [2018-11-06 22:52:01,223 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 119 transitions. Word has length 106 [2018-11-06 22:52:01,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 22:52:01,224 INFO L480 AbstractCegarLoop]: Abstraction has 118 states and 119 transitions. [2018-11-06 22:52:01,224 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-11-06 22:52:01,224 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 119 transitions. [2018-11-06 22:52:01,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-11-06 22:52:01,225 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 22:52:01,225 INFO L375 BasicCegarLoop]: trace histogram [13, 12, 12, 12, 9, 9, 9, 9, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 22:52:01,225 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 22:52:01,226 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 22:52:01,226 INFO L82 PathProgramCache]: Analyzing trace with hash -948358463, now seen corresponding path program 9 times [2018-11-06 22:52:01,226 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 22:52:01,226 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 22:52:01,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:52:01,227 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-06 22:52:01,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:52:01,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:52:01,999 INFO L134 CoverageAnalysis]: Checked inductivity of 524 backedges. 0 proven. 288 refuted. 0 times theorem prover too weak. 236 trivial. 0 not checked. [2018-11-06 22:52:02,000 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 22:52:02,000 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:52:02,009 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Received shutdown request... Cannot interrupt operation gracefully because timeout expired. Forcing shutdown