./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/loops/insertion_sort_false-unreach-call_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/loops/insertion_sort_false-unreach-call_true-termination.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9722a10940ebd7a5d75170225a40cd37454d0528 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-14 16:59:21,926 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 16:59:21,928 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 16:59:21,940 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 16:59:21,940 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 16:59:21,941 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 16:59:21,943 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 16:59:21,944 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 16:59:21,946 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 16:59:21,947 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 16:59:21,948 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 16:59:21,948 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 16:59:21,949 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 16:59:21,950 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 16:59:21,951 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 16:59:21,952 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 16:59:21,953 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 16:59:21,955 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 16:59:21,957 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 16:59:21,959 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 16:59:21,960 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 16:59:21,961 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 16:59:21,963 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 16:59:21,964 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 16:59:21,964 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 16:59:21,965 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 16:59:21,966 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 16:59:21,967 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 16:59:21,967 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 16:59:21,968 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 16:59:21,969 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 16:59:21,969 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 16:59:21,970 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 16:59:21,970 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 16:59:21,971 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 16:59:21,972 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 16:59:21,972 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-14 16:59:21,987 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 16:59:21,987 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 16:59:21,988 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 16:59:21,988 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 16:59:21,988 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 16:59:21,989 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 16:59:21,989 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-14 16:59:21,989 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 16:59:21,989 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-14 16:59:21,989 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 16:59:21,990 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-14 16:59:21,990 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-14 16:59:21,990 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-14 16:59:21,990 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-14 16:59:21,990 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 16:59:21,990 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-14 16:59:21,991 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 16:59:21,991 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 16:59:21,991 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-14 16:59:21,991 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-14 16:59:21,991 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-14 16:59:21,992 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 16:59:21,992 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-14 16:59:21,992 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-14 16:59:21,992 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 16:59:21,992 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-14 16:59:21,992 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-14 16:59:21,993 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 9722a10940ebd7a5d75170225a40cd37454d0528 [2019-01-14 16:59:22,039 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 16:59:22,053 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 16:59:22,057 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 16:59:22,059 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 16:59:22,059 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 16:59:22,060 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/loops/insertion_sort_false-unreach-call_true-termination.i [2019-01-14 16:59:22,119 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0ba324b50/ba2a9cb6531b487787874e0db5c4a2d3/FLAG0f6be3e3c [2019-01-14 16:59:22,610 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 16:59:22,611 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/loops/insertion_sort_false-unreach-call_true-termination.i [2019-01-14 16:59:22,617 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0ba324b50/ba2a9cb6531b487787874e0db5c4a2d3/FLAG0f6be3e3c [2019-01-14 16:59:22,948 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0ba324b50/ba2a9cb6531b487787874e0db5c4a2d3 [2019-01-14 16:59:22,955 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 16:59:22,956 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 16:59:22,958 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 16:59:22,958 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 16:59:22,962 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 16:59:22,963 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 04:59:22" (1/1) ... [2019-01-14 16:59:22,966 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@37fb7911 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:59:22, skipping insertion in model container [2019-01-14 16:59:22,966 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 04:59:22" (1/1) ... [2019-01-14 16:59:22,974 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 16:59:22,994 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 16:59:23,246 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 16:59:23,251 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 16:59:23,290 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 16:59:23,325 INFO L195 MainTranslator]: Completed translation [2019-01-14 16:59:23,326 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:59:23 WrapperNode [2019-01-14 16:59:23,326 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 16:59:23,327 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 16:59:23,327 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 16:59:23,327 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 16:59:23,338 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:59:23" (1/1) ... [2019-01-14 16:59:23,353 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:59:23" (1/1) ... [2019-01-14 16:59:23,383 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 16:59:23,383 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 16:59:23,384 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 16:59:23,384 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 16:59:23,392 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:59:23" (1/1) ... [2019-01-14 16:59:23,392 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:59:23" (1/1) ... [2019-01-14 16:59:23,394 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:59:23" (1/1) ... [2019-01-14 16:59:23,394 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:59:23" (1/1) ... [2019-01-14 16:59:23,401 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:59:23" (1/1) ... [2019-01-14 16:59:23,464 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:59:23" (1/1) ... [2019-01-14 16:59:23,469 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:59:23" (1/1) ... [2019-01-14 16:59:23,477 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 16:59:23,478 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 16:59:23,478 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 16:59:23,478 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 16:59:23,479 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:59:23" (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 [2019-01-14 16:59:23,537 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-14 16:59:23,538 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 16:59:23,538 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 16:59:23,538 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-14 16:59:23,538 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-14 16:59:23,538 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-14 16:59:23,953 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 16:59:23,954 INFO L286 CfgBuilder]: Removed 9 assue(true) statements. [2019-01-14 16:59:23,955 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 04:59:23 BoogieIcfgContainer [2019-01-14 16:59:23,955 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 16:59:23,956 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-14 16:59:23,956 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-14 16:59:23,959 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-14 16:59:23,960 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.01 04:59:22" (1/3) ... [2019-01-14 16:59:23,961 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@394049e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.01 04:59:23, skipping insertion in model container [2019-01-14 16:59:23,961 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:59:23" (2/3) ... [2019-01-14 16:59:23,961 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@394049e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.01 04:59:23, skipping insertion in model container [2019-01-14 16:59:23,961 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 04:59:23" (3/3) ... [2019-01-14 16:59:23,963 INFO L112 eAbstractionObserver]: Analyzing ICFG insertion_sort_false-unreach-call_true-termination.i [2019-01-14 16:59:23,973 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-14 16:59:23,982 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-14 16:59:24,000 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-14 16:59:24,032 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 16:59:24,033 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-14 16:59:24,033 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-14 16:59:24,033 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-14 16:59:24,034 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 16:59:24,034 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 16:59:24,034 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-14 16:59:24,034 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 16:59:24,034 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-14 16:59:24,051 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states. [2019-01-14 16:59:24,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-14 16:59:24,058 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 16:59:24,059 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-14 16:59:24,061 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 16:59:24,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 16:59:24,067 INFO L82 PathProgramCache]: Analyzing trace with hash 1808788559, now seen corresponding path program 1 times [2019-01-14 16:59:24,069 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 16:59:24,070 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 16:59:24,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 16:59:24,124 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 16:59:24,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 16:59:24,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 16:59:24,432 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 16:59:24,436 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 16:59:24,436 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-14 16:59:24,440 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-14 16:59:24,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 16:59:24,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-14 16:59:24,454 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 5 states. [2019-01-14 16:59:24,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 16:59:24,722 INFO L93 Difference]: Finished difference Result 54 states and 77 transitions. [2019-01-14 16:59:24,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-14 16:59:24,724 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 7 [2019-01-14 16:59:24,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 16:59:24,734 INFO L225 Difference]: With dead ends: 54 [2019-01-14 16:59:24,734 INFO L226 Difference]: Without dead ends: 25 [2019-01-14 16:59:24,738 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-01-14 16:59:24,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-01-14 16:59:24,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 18. [2019-01-14 16:59:24,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-01-14 16:59:24,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2019-01-14 16:59:24,772 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 7 [2019-01-14 16:59:24,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 16:59:24,772 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2019-01-14 16:59:24,772 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-14 16:59:24,772 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2019-01-14 16:59:24,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-01-14 16:59:24,773 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 16:59:24,773 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 16:59:24,773 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 16:59:24,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 16:59:24,774 INFO L82 PathProgramCache]: Analyzing trace with hash 616714882, now seen corresponding path program 1 times [2019-01-14 16:59:24,774 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 16:59:24,774 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 16:59:24,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 16:59:24,775 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 16:59:24,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 16:59:24,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 16:59:25,241 WARN L181 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 16 [2019-01-14 16:59:25,522 WARN L181 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 20 [2019-01-14 16:59:26,077 WARN L181 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 14 [2019-01-14 16:59:26,172 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 16:59:26,172 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 16:59:26,172 INFO L223 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 [2019-01-14 16:59:26,185 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 16:59:26,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 16:59:26,215 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 16:59:26,500 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2019-01-14 16:59:26,514 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 16:59:26,517 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-14 16:59:26,519 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 16:59:26,528 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 16:59:26,547 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. [2019-01-14 16:59:26,547 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:37, output treesize:30 [2019-01-14 16:59:26,614 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 16:59:26,635 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 16:59:26,635 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 16 [2019-01-14 16:59:26,636 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-01-14 16:59:26,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-01-14 16:59:26,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2019-01-14 16:59:26,637 INFO L87 Difference]: Start difference. First operand 18 states and 22 transitions. Second operand 16 states. [2019-01-14 16:59:27,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 16:59:27,645 INFO L93 Difference]: Finished difference Result 71 states and 89 transitions. [2019-01-14 16:59:27,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-01-14 16:59:27,653 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 13 [2019-01-14 16:59:27,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 16:59:27,655 INFO L225 Difference]: With dead ends: 71 [2019-01-14 16:59:27,655 INFO L226 Difference]: Without dead ends: 56 [2019-01-14 16:59:27,656 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 6 SyntacticMatches, 3 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=132, Invalid=420, Unknown=0, NotChecked=0, Total=552 [2019-01-14 16:59:27,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-01-14 16:59:27,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 30. [2019-01-14 16:59:27,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-01-14 16:59:27,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 38 transitions. [2019-01-14 16:59:27,665 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 38 transitions. Word has length 13 [2019-01-14 16:59:27,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 16:59:27,666 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 38 transitions. [2019-01-14 16:59:27,666 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-01-14 16:59:27,666 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 38 transitions. [2019-01-14 16:59:27,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-01-14 16:59:27,667 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 16:59:27,667 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 16:59:27,667 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 16:59:27,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 16:59:27,668 INFO L82 PathProgramCache]: Analyzing trace with hash 1296773252, now seen corresponding path program 1 times [2019-01-14 16:59:27,668 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 16:59:27,668 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 16:59:27,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 16:59:27,669 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 16:59:27,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 16:59:27,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 16:59:27,734 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 16:59:27,735 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 16:59:27,735 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-14 16:59:27,735 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-14 16:59:27,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 16:59:27,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-14 16:59:27,737 INFO L87 Difference]: Start difference. First operand 30 states and 38 transitions. Second operand 5 states. [2019-01-14 16:59:27,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 16:59:27,842 INFO L93 Difference]: Finished difference Result 83 states and 106 transitions. [2019-01-14 16:59:27,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-14 16:59:27,843 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-01-14 16:59:27,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 16:59:27,846 INFO L225 Difference]: With dead ends: 83 [2019-01-14 16:59:27,846 INFO L226 Difference]: Without dead ends: 56 [2019-01-14 16:59:27,847 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-01-14 16:59:27,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-01-14 16:59:27,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 34. [2019-01-14 16:59:27,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-01-14 16:59:27,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 42 transitions. [2019-01-14 16:59:27,856 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 42 transitions. Word has length 13 [2019-01-14 16:59:27,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 16:59:27,857 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 42 transitions. [2019-01-14 16:59:27,857 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-14 16:59:27,857 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 42 transitions. [2019-01-14 16:59:27,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-01-14 16:59:27,858 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 16:59:27,858 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 16:59:27,858 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 16:59:27,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 16:59:27,859 INFO L82 PathProgramCache]: Analyzing trace with hash -2022971496, now seen corresponding path program 1 times [2019-01-14 16:59:27,859 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 16:59:27,859 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 16:59:27,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 16:59:27,860 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 16:59:27,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 16:59:27,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 16:59:28,178 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 16:59:28,179 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 16:59:28,179 INFO L223 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 [2019-01-14 16:59:28,199 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 16:59:28,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 16:59:28,220 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 16:59:28,309 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 16:59:28,331 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 16:59:28,332 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2019-01-14 16:59:28,332 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-14 16:59:28,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-14 16:59:28,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-01-14 16:59:28,333 INFO L87 Difference]: Start difference. First operand 34 states and 42 transitions. Second operand 9 states. [2019-01-14 16:59:28,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 16:59:28,676 INFO L93 Difference]: Finished difference Result 60 states and 72 transitions. [2019-01-14 16:59:28,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-14 16:59:28,677 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 17 [2019-01-14 16:59:28,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 16:59:28,678 INFO L225 Difference]: With dead ends: 60 [2019-01-14 16:59:28,679 INFO L226 Difference]: Without dead ends: 48 [2019-01-14 16:59:28,679 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 14 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2019-01-14 16:59:28,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-01-14 16:59:28,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 37. [2019-01-14 16:59:28,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-01-14 16:59:28,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 45 transitions. [2019-01-14 16:59:28,686 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 45 transitions. Word has length 17 [2019-01-14 16:59:28,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 16:59:28,686 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 45 transitions. [2019-01-14 16:59:28,686 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-14 16:59:28,687 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 45 transitions. [2019-01-14 16:59:28,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-01-14 16:59:28,687 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 16:59:28,688 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 16:59:28,688 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 16:59:28,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 16:59:28,688 INFO L82 PathProgramCache]: Analyzing trace with hash 958971857, now seen corresponding path program 1 times [2019-01-14 16:59:28,688 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 16:59:28,688 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 16:59:28,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 16:59:28,689 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 16:59:28,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 16:59:28,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 16:59:29,410 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 16:59:29,411 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 16:59:29,411 INFO L223 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 [2019-01-14 16:59:29,420 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 16:59:29,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 16:59:29,437 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 16:59:29,678 INFO L478 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 38 treesize of output 31 [2019-01-14 16:59:29,682 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 16:59:29,684 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 47 [2019-01-14 16:59:29,684 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 16:59:29,693 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 16:59:29,703 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 16:59:29,703 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:44, output treesize:40 [2019-01-14 16:59:30,129 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 16:59:30,130 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 52 [2019-01-14 16:59:30,163 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 16:59:30,168 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 16:59:30,170 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 58 [2019-01-14 16:59:30,171 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 16:59:30,181 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 16:59:30,196 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. [2019-01-14 16:59:30,196 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:64, output treesize:29 [2019-01-14 16:59:30,307 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 16:59:30,327 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 16:59:30,327 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 25 [2019-01-14 16:59:30,327 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-01-14 16:59:30,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-01-14 16:59:30,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=503, Unknown=0, NotChecked=0, Total=600 [2019-01-14 16:59:30,328 INFO L87 Difference]: Start difference. First operand 37 states and 45 transitions. Second operand 25 states. [2019-01-14 16:59:31,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 16:59:31,304 INFO L93 Difference]: Finished difference Result 77 states and 96 transitions. [2019-01-14 16:59:31,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-01-14 16:59:31,306 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 18 [2019-01-14 16:59:31,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 16:59:31,307 INFO L225 Difference]: With dead ends: 77 [2019-01-14 16:59:31,307 INFO L226 Difference]: Without dead ends: 42 [2019-01-14 16:59:31,308 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 332 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=175, Invalid=881, Unknown=0, NotChecked=0, Total=1056 [2019-01-14 16:59:31,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-01-14 16:59:31,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 31. [2019-01-14 16:59:31,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-01-14 16:59:31,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 36 transitions. [2019-01-14 16:59:31,314 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 36 transitions. Word has length 18 [2019-01-14 16:59:31,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 16:59:31,315 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 36 transitions. [2019-01-14 16:59:31,315 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-01-14 16:59:31,315 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2019-01-14 16:59:31,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-01-14 16:59:31,316 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 16:59:31,316 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 16:59:31,316 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 16:59:31,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 16:59:31,316 INFO L82 PathProgramCache]: Analyzing trace with hash 632161909, now seen corresponding path program 2 times [2019-01-14 16:59:31,317 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 16:59:31,317 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 16:59:31,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 16:59:31,318 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 16:59:31,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 16:59:31,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 16:59:31,604 WARN L181 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 24 [2019-01-14 16:59:32,176 WARN L181 SmtUtils]: Spent 270.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 23 [2019-01-14 16:59:32,457 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 16:59:32,458 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 16:59:32,458 INFO L223 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 [2019-01-14 16:59:32,472 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-14 16:59:32,489 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-14 16:59:32,489 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 16:59:32,495 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 16:59:32,814 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2019-01-14 16:59:32,844 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 16:59:32,871 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-14 16:59:32,872 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 16:59:32,950 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 16:59:32,965 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. [2019-01-14 16:59:32,966 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:44, output treesize:37 [2019-01-14 16:59:33,029 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 25 [2019-01-14 16:59:33,033 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 16:59:33,035 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 16:59:33,036 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 16:59:33,044 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 58 [2019-01-14 16:59:33,044 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 16:59:33,055 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 16:59:33,068 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. [2019-01-14 16:59:33,068 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:41, output treesize:25 [2019-01-14 16:59:33,165 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 16:59:33,184 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 16:59:33,184 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 18 [2019-01-14 16:59:33,185 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-01-14 16:59:33,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-01-14 16:59:33,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=244, Unknown=0, NotChecked=0, Total=306 [2019-01-14 16:59:33,186 INFO L87 Difference]: Start difference. First operand 31 states and 36 transitions. Second operand 18 states. [2019-01-14 16:59:34,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 16:59:34,123 INFO L93 Difference]: Finished difference Result 111 states and 137 transitions. [2019-01-14 16:59:34,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-01-14 16:59:34,124 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 19 [2019-01-14 16:59:34,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 16:59:34,125 INFO L225 Difference]: With dead ends: 111 [2019-01-14 16:59:34,126 INFO L226 Difference]: Without dead ends: 94 [2019-01-14 16:59:34,126 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 10 SyntacticMatches, 6 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 242 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=143, Invalid=613, Unknown=0, NotChecked=0, Total=756 [2019-01-14 16:59:34,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-01-14 16:59:34,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 50. [2019-01-14 16:59:34,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-01-14 16:59:34,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 59 transitions. [2019-01-14 16:59:34,144 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 59 transitions. Word has length 19 [2019-01-14 16:59:34,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 16:59:34,144 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 59 transitions. [2019-01-14 16:59:34,144 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-01-14 16:59:34,144 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 59 transitions. [2019-01-14 16:59:34,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-01-14 16:59:34,147 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 16:59:34,147 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 16:59:34,148 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 16:59:34,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 16:59:34,149 INFO L82 PathProgramCache]: Analyzing trace with hash 44460555, now seen corresponding path program 2 times [2019-01-14 16:59:34,149 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 16:59:34,150 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 16:59:34,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 16:59:34,151 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 16:59:34,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 16:59:34,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 16:59:34,587 WARN L181 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 15 [2019-01-14 16:59:34,831 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 16:59:34,832 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 16:59:34,832 INFO L223 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 [2019-01-14 16:59:34,852 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-14 16:59:34,891 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-14 16:59:34,891 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 16:59:34,895 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 16:59:35,193 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2019-01-14 16:59:35,196 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 16:59:35,198 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2019-01-14 16:59:35,199 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 16:59:35,208 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 16:59:35,215 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 16:59:35,216 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2019-01-14 16:59:35,346 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 16:59:35,365 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 16:59:35,366 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 24 [2019-01-14 16:59:35,366 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-01-14 16:59:35,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-01-14 16:59:35,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=477, Unknown=0, NotChecked=0, Total=552 [2019-01-14 16:59:35,367 INFO L87 Difference]: Start difference. First operand 50 states and 59 transitions. Second operand 24 states. [2019-01-14 16:59:36,065 WARN L181 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2019-01-14 16:59:36,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 16:59:36,314 INFO L93 Difference]: Finished difference Result 118 states and 144 transitions. [2019-01-14 16:59:36,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-01-14 16:59:36,315 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 23 [2019-01-14 16:59:36,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 16:59:36,317 INFO L225 Difference]: With dead ends: 118 [2019-01-14 16:59:36,317 INFO L226 Difference]: Without dead ends: 101 [2019-01-14 16:59:36,319 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 14 SyntacticMatches, 2 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 368 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=226, Invalid=1180, Unknown=0, NotChecked=0, Total=1406 [2019-01-14 16:59:36,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-01-14 16:59:36,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 64. [2019-01-14 16:59:36,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-01-14 16:59:36,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 76 transitions. [2019-01-14 16:59:36,331 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 76 transitions. Word has length 23 [2019-01-14 16:59:36,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 16:59:36,331 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 76 transitions. [2019-01-14 16:59:36,332 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-01-14 16:59:36,332 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 76 transitions. [2019-01-14 16:59:36,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-01-14 16:59:36,334 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 16:59:36,335 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 16:59:36,335 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 16:59:36,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 16:59:36,336 INFO L82 PathProgramCache]: Analyzing trace with hash -55202372, now seen corresponding path program 1 times [2019-01-14 16:59:36,336 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 16:59:36,336 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 16:59:36,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 16:59:36,337 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 16:59:36,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 16:59:36,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 16:59:36,719 WARN L181 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 17 [2019-01-14 16:59:37,299 WARN L181 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 19 [2019-01-14 16:59:37,429 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 16:59:37,429 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 16:59:37,429 INFO L223 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 [2019-01-14 16:59:37,440 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 16:59:37,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 16:59:37,457 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 16:59:37,556 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2019-01-14 16:59:37,757 WARN L181 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 16 [2019-01-14 16:59:37,761 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 16:59:37,763 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2019-01-14 16:59:37,763 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 16:59:37,769 WARN L307 Elim1Store]: Array PQE input equivalent to false [2019-01-14 16:59:37,769 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-14 16:59:37,775 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 16:59:37,781 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 16:59:37,782 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:29, output treesize:17 [2019-01-14 16:59:37,812 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 16:59:37,832 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 16:59:37,832 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12] total 18 [2019-01-14 16:59:37,833 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-01-14 16:59:37,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-01-14 16:59:37,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=235, Unknown=0, NotChecked=0, Total=306 [2019-01-14 16:59:37,834 INFO L87 Difference]: Start difference. First operand 64 states and 76 transitions. Second operand 18 states. [2019-01-14 16:59:39,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 16:59:39,949 INFO L93 Difference]: Finished difference Result 229 states and 285 transitions. [2019-01-14 16:59:39,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-01-14 16:59:39,950 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 24 [2019-01-14 16:59:39,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 16:59:39,951 INFO L225 Difference]: With dead ends: 229 [2019-01-14 16:59:39,951 INFO L226 Difference]: Without dead ends: 212 [2019-01-14 16:59:39,953 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 16 SyntacticMatches, 10 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1074 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=630, Invalid=2676, Unknown=0, NotChecked=0, Total=3306 [2019-01-14 16:59:39,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2019-01-14 16:59:39,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 101. [2019-01-14 16:59:39,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-01-14 16:59:39,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 127 transitions. [2019-01-14 16:59:39,980 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 127 transitions. Word has length 24 [2019-01-14 16:59:39,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 16:59:39,980 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 127 transitions. [2019-01-14 16:59:39,980 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-01-14 16:59:39,980 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 127 transitions. [2019-01-14 16:59:39,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-01-14 16:59:39,984 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 16:59:39,984 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 16:59:39,984 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 16:59:39,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 16:59:39,984 INFO L82 PathProgramCache]: Analyzing trace with hash 624855998, now seen corresponding path program 2 times [2019-01-14 16:59:39,985 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 16:59:39,985 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 16:59:39,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 16:59:39,986 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 16:59:39,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 16:59:39,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 16:59:40,141 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 16:59:40,142 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 16:59:40,142 INFO L223 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 [2019-01-14 16:59:40,152 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-14 16:59:40,165 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-14 16:59:40,165 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 16:59:40,168 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 16:59:40,171 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 16:59:40,190 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 16:59:40,190 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-01-14 16:59:40,191 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-14 16:59:40,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-14 16:59:40,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-01-14 16:59:40,191 INFO L87 Difference]: Start difference. First operand 101 states and 127 transitions. Second operand 7 states. [2019-01-14 16:59:40,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 16:59:40,347 INFO L93 Difference]: Finished difference Result 201 states and 253 transitions. [2019-01-14 16:59:40,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-14 16:59:40,349 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2019-01-14 16:59:40,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 16:59:40,350 INFO L225 Difference]: With dead ends: 201 [2019-01-14 16:59:40,350 INFO L226 Difference]: Without dead ends: 140 [2019-01-14 16:59:40,351 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2019-01-14 16:59:40,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2019-01-14 16:59:40,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 105. [2019-01-14 16:59:40,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-01-14 16:59:40,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 130 transitions. [2019-01-14 16:59:40,391 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 130 transitions. Word has length 24 [2019-01-14 16:59:40,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 16:59:40,392 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 130 transitions. [2019-01-14 16:59:40,392 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-14 16:59:40,392 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 130 transitions. [2019-01-14 16:59:40,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-01-14 16:59:40,397 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 16:59:40,397 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 16:59:40,397 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 16:59:40,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 16:59:40,399 INFO L82 PathProgramCache]: Analyzing trace with hash 802880644, now seen corresponding path program 3 times [2019-01-14 16:59:40,400 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 16:59:40,400 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 16:59:40,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 16:59:40,403 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 16:59:40,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 16:59:40,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 16:59:41,174 WARN L181 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 22 [2019-01-14 16:59:41,524 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 16:59:41,524 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 16:59:41,525 INFO L223 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 [2019-01-14 16:59:41,547 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-14 16:59:41,568 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-01-14 16:59:41,568 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 16:59:41,571 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 16:59:41,608 INFO L478 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 38 treesize of output 31 [2019-01-14 16:59:41,614 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 16:59:41,615 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 16:59:41,615 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 58 [2019-01-14 16:59:41,616 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 16:59:41,630 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 16:59:41,639 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 16:59:41,640 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:57, output treesize:53 [2019-01-14 16:59:42,042 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 16:59:42,043 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 53 [2019-01-14 16:59:42,048 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 16:59:42,048 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 16:59:42,050 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 59 [2019-01-14 16:59:42,050 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 16:59:42,072 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 16:59:42,086 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 16:59:42,087 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:69, output treesize:36 [2019-01-14 16:59:42,250 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 27 [2019-01-14 16:59:42,253 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 16:59:42,254 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 16:59:42,255 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 16:59:42,257 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 16:59:42,261 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 76 [2019-01-14 16:59:42,262 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 16:59:42,278 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 16:59:42,294 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. [2019-01-14 16:59:42,294 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:55, output treesize:36 [2019-01-14 16:59:42,338 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 16:59:42,357 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 16:59:42,357 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 17] total 22 [2019-01-14 16:59:42,358 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-01-14 16:59:42,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-01-14 16:59:42,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=385, Unknown=0, NotChecked=0, Total=462 [2019-01-14 16:59:42,358 INFO L87 Difference]: Start difference. First operand 105 states and 130 transitions. Second operand 22 states. [2019-01-14 16:59:43,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 16:59:43,489 INFO L93 Difference]: Finished difference Result 155 states and 187 transitions. [2019-01-14 16:59:43,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-01-14 16:59:43,490 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 24 [2019-01-14 16:59:43,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 16:59:43,491 INFO L225 Difference]: With dead ends: 155 [2019-01-14 16:59:43,491 INFO L226 Difference]: Without dead ends: 153 [2019-01-14 16:59:43,492 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 11 SyntacticMatches, 9 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 417 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=198, Invalid=1062, Unknown=0, NotChecked=0, Total=1260 [2019-01-14 16:59:43,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2019-01-14 16:59:43,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 108. [2019-01-14 16:59:43,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-01-14 16:59:43,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 134 transitions. [2019-01-14 16:59:43,512 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 134 transitions. Word has length 24 [2019-01-14 16:59:43,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 16:59:43,512 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 134 transitions. [2019-01-14 16:59:43,513 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-01-14 16:59:43,513 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 134 transitions. [2019-01-14 16:59:43,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-01-14 16:59:43,516 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 16:59:43,516 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2019-01-14 16:59:43,516 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 16:59:43,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 16:59:43,517 INFO L82 PathProgramCache]: Analyzing trace with hash 519508641, now seen corresponding path program 3 times [2019-01-14 16:59:43,518 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 16:59:43,518 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 16:59:43,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 16:59:43,520 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 16:59:43,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 16:59:43,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 16:59:43,934 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 16:59:43,934 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 16:59:43,934 INFO L223 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 [2019-01-14 16:59:43,944 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-14 16:59:43,965 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-14 16:59:43,966 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 16:59:43,967 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 16:59:44,132 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 16:59:44,152 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 16:59:44,152 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 12 [2019-01-14 16:59:44,152 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-14 16:59:44,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-14 16:59:44,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2019-01-14 16:59:44,153 INFO L87 Difference]: Start difference. First operand 108 states and 134 transitions. Second operand 12 states. [2019-01-14 16:59:44,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 16:59:44,382 INFO L93 Difference]: Finished difference Result 189 states and 230 transitions. [2019-01-14 16:59:44,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-14 16:59:44,382 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 27 [2019-01-14 16:59:44,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 16:59:44,384 INFO L225 Difference]: With dead ends: 189 [2019-01-14 16:59:44,384 INFO L226 Difference]: Without dead ends: 173 [2019-01-14 16:59:44,384 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 23 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2019-01-14 16:59:44,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2019-01-14 16:59:44,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 129. [2019-01-14 16:59:44,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-01-14 16:59:44,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 157 transitions. [2019-01-14 16:59:44,406 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 157 transitions. Word has length 27 [2019-01-14 16:59:44,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 16:59:44,406 INFO L480 AbstractCegarLoop]: Abstraction has 129 states and 157 transitions. [2019-01-14 16:59:44,406 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-14 16:59:44,406 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 157 transitions. [2019-01-14 16:59:44,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-01-14 16:59:44,408 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 16:59:44,408 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 16:59:44,409 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 16:59:44,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 16:59:44,409 INFO L82 PathProgramCache]: Analyzing trace with hash 862655954, now seen corresponding path program 1 times [2019-01-14 16:59:44,409 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 16:59:44,409 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 16:59:44,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 16:59:44,410 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 16:59:44,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 16:59:44,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 16:59:45,107 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 16:59:45,107 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 16:59:45,107 INFO L223 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 [2019-01-14 16:59:45,117 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 16:59:45,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 16:59:45,137 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 16:59:45,251 INFO L478 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 38 treesize of output 31 [2019-01-14 16:59:45,257 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 16:59:45,258 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 47 [2019-01-14 16:59:45,259 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 16:59:45,268 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 16:59:45,278 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 16:59:45,279 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:44, output treesize:40 [2019-01-14 16:59:45,408 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 16:59:45,410 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 45 [2019-01-14 16:59:45,413 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 16:59:45,414 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 16:59:45,416 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 49 [2019-01-14 16:59:45,417 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 16:59:45,425 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 16:59:45,469 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. [2019-01-14 16:59:45,470 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:52, output treesize:30 [2019-01-14 16:59:45,701 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 16:59:45,720 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 16:59:45,721 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16] total 31 [2019-01-14 16:59:45,721 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-01-14 16:59:45,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-01-14 16:59:45,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=830, Unknown=0, NotChecked=0, Total=930 [2019-01-14 16:59:45,722 INFO L87 Difference]: Start difference. First operand 129 states and 157 transitions. Second operand 31 states. [2019-01-14 16:59:46,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 16:59:46,868 INFO L93 Difference]: Finished difference Result 146 states and 177 transitions. [2019-01-14 16:59:46,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-01-14 16:59:46,869 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 28 [2019-01-14 16:59:46,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 16:59:46,870 INFO L225 Difference]: With dead ends: 146 [2019-01-14 16:59:46,870 INFO L226 Difference]: Without dead ends: 137 [2019-01-14 16:59:46,871 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 515 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=220, Invalid=1586, Unknown=0, NotChecked=0, Total=1806 [2019-01-14 16:59:46,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2019-01-14 16:59:46,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 126. [2019-01-14 16:59:46,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2019-01-14 16:59:46,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 153 transitions. [2019-01-14 16:59:46,892 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 153 transitions. Word has length 28 [2019-01-14 16:59:46,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 16:59:46,893 INFO L480 AbstractCegarLoop]: Abstraction has 126 states and 153 transitions. [2019-01-14 16:59:46,893 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-01-14 16:59:46,893 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 153 transitions. [2019-01-14 16:59:46,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-01-14 16:59:46,894 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 16:59:46,894 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 16:59:46,894 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 16:59:46,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 16:59:46,895 INFO L82 PathProgramCache]: Analyzing trace with hash 1474562622, now seen corresponding path program 4 times [2019-01-14 16:59:46,896 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 16:59:46,896 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 16:59:46,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 16:59:46,898 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 16:59:46,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 16:59:46,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 16:59:47,368 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 16:59:47,368 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 16:59:47,369 INFO L223 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 [2019-01-14 16:59:47,378 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-14 16:59:47,399 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-14 16:59:47,399 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 16:59:47,402 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 16:59:47,450 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2019-01-14 16:59:47,453 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2019-01-14 16:59:47,453 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 16:59:47,457 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 16:59:47,467 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 16:59:47,467 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:7 [2019-01-14 16:59:48,007 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2019-01-14 16:59:48,012 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 16:59:48,014 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-14 16:59:48,014 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 16:59:48,020 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 16:59:48,030 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 16:59:48,030 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:27 [2019-01-14 16:59:48,127 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 25 [2019-01-14 16:59:48,131 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 16:59:48,133 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 16:59:48,135 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 16:59:48,140 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 58 [2019-01-14 16:59:48,141 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 16:59:48,151 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 16:59:48,160 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 16:59:48,160 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:19 [2019-01-14 16:59:48,308 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 16:59:48,328 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 16:59:48,328 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16] total 29 [2019-01-14 16:59:48,329 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-01-14 16:59:48,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-01-14 16:59:48,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=708, Unknown=0, NotChecked=0, Total=812 [2019-01-14 16:59:48,330 INFO L87 Difference]: Start difference. First operand 126 states and 153 transitions. Second operand 29 states. [2019-01-14 16:59:49,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 16:59:49,831 INFO L93 Difference]: Finished difference Result 259 states and 317 transitions. [2019-01-14 16:59:49,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-01-14 16:59:49,832 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 29 [2019-01-14 16:59:49,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 16:59:49,833 INFO L225 Difference]: With dead ends: 259 [2019-01-14 16:59:49,834 INFO L226 Difference]: Without dead ends: 194 [2019-01-14 16:59:49,835 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 689 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=350, Invalid=2100, Unknown=0, NotChecked=0, Total=2450 [2019-01-14 16:59:49,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2019-01-14 16:59:49,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 144. [2019-01-14 16:59:49,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2019-01-14 16:59:49,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 175 transitions. [2019-01-14 16:59:49,856 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 175 transitions. Word has length 29 [2019-01-14 16:59:49,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 16:59:49,857 INFO L480 AbstractCegarLoop]: Abstraction has 144 states and 175 transitions. [2019-01-14 16:59:49,857 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-01-14 16:59:49,857 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 175 transitions. [2019-01-14 16:59:49,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-01-14 16:59:49,858 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 16:59:49,860 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 16:59:49,860 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 16:59:49,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 16:59:49,861 INFO L82 PathProgramCache]: Analyzing trace with hash 219109591, now seen corresponding path program 4 times [2019-01-14 16:59:49,861 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 16:59:49,861 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 16:59:49,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 16:59:49,863 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 16:59:49,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 16:59:49,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 16:59:50,280 WARN L181 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 9 DAG size of output: 7 [2019-01-14 16:59:50,852 WARN L181 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 15 [2019-01-14 16:59:51,022 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 10 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 16:59:51,023 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 16:59:51,023 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 16:59:51,033 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-14 16:59:51,049 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-14 16:59:51,049 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 16:59:51,052 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 16:59:51,200 INFO L478 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 38 treesize of output 31 [2019-01-14 16:59:51,207 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 16:59:51,208 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 47 [2019-01-14 16:59:51,208 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 16:59:51,222 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 16:59:51,231 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 16:59:51,231 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:37 [2019-01-14 16:59:51,480 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 16:59:51,481 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 52 [2019-01-14 16:59:51,486 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 16:59:51,486 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 16:59:51,487 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 58 [2019-01-14 16:59:51,488 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 16:59:51,527 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 16:59:51,543 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. [2019-01-14 16:59:51,544 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:61, output treesize:29 [2019-01-14 16:59:51,613 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 17 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-01-14 16:59:51,633 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 16:59:51,633 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 24 [2019-01-14 16:59:51,633 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-01-14 16:59:51,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-01-14 16:59:51,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=468, Unknown=0, NotChecked=0, Total=552 [2019-01-14 16:59:51,634 INFO L87 Difference]: Start difference. First operand 144 states and 175 transitions. Second operand 24 states. [2019-01-14 16:59:51,991 WARN L181 SmtUtils]: Spent 289.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 18 [2019-01-14 16:59:55,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 16:59:55,144 INFO L93 Difference]: Finished difference Result 215 states and 262 transitions. [2019-01-14 16:59:55,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-01-14 16:59:55,146 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 29 [2019-01-14 16:59:55,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 16:59:55,147 INFO L225 Difference]: With dead ends: 215 [2019-01-14 16:59:55,148 INFO L226 Difference]: Without dead ends: 150 [2019-01-14 16:59:55,150 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 719 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=416, Invalid=2235, Unknown=1, NotChecked=0, Total=2652 [2019-01-14 16:59:55,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2019-01-14 16:59:55,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 116. [2019-01-14 16:59:55,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2019-01-14 16:59:55,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 136 transitions. [2019-01-14 16:59:55,172 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 136 transitions. Word has length 29 [2019-01-14 16:59:55,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 16:59:55,172 INFO L480 AbstractCegarLoop]: Abstraction has 116 states and 136 transitions. [2019-01-14 16:59:55,172 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-01-14 16:59:55,173 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 136 transitions. [2019-01-14 16:59:55,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-01-14 16:59:55,173 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 16:59:55,173 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 16:59:55,173 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 16:59:55,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 16:59:55,174 INFO L82 PathProgramCache]: Analyzing trace with hash 1586454183, now seen corresponding path program 1 times [2019-01-14 16:59:55,174 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 16:59:55,174 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 16:59:55,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 16:59:55,175 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 16:59:55,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 16:59:55,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 16:59:55,799 WARN L181 SmtUtils]: Spent 382.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 13 [2019-01-14 16:59:56,381 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 16:59:56,381 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 16:59:56,381 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 16:59:56,392 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 16:59:56,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 16:59:56,415 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 16:59:56,641 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 35 [2019-01-14 16:59:56,644 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 16:59:56,647 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 37 [2019-01-14 16:59:56,648 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 16:59:56,654 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 16:59:56,663 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 16:59:56,664 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:53, output treesize:30 [2019-01-14 16:59:56,738 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 25 [2019-01-14 16:59:56,757 WARN L307 Elim1Store]: Array PQE input equivalent to false [2019-01-14 16:59:56,757 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 16:59:56,759 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 16:59:56,761 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 16:59:56,763 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 16:59:56,774 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 43 [2019-01-14 16:59:56,775 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-14 16:59:56,796 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 16:59:56,803 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 16:59:56,804 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:35, output treesize:17 [2019-01-14 16:59:56,874 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 25 [2019-01-14 16:59:56,880 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 16:59:56,882 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 16:59:56,884 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 16:59:56,889 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 58 [2019-01-14 16:59:56,890 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 16:59:56,900 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 16:59:56,910 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 16:59:56,910 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:19 [2019-01-14 16:59:56,944 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 25 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-14 16:59:56,962 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 16:59:56,962 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 21 [2019-01-14 16:59:56,963 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-01-14 16:59:56,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-01-14 16:59:56,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=339, Unknown=0, NotChecked=0, Total=420 [2019-01-14 16:59:56,963 INFO L87 Difference]: Start difference. First operand 116 states and 136 transitions. Second operand 21 states. [2019-01-14 16:59:57,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 16:59:57,779 INFO L93 Difference]: Finished difference Result 238 states and 282 transitions. [2019-01-14 16:59:57,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-01-14 16:59:57,780 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 30 [2019-01-14 16:59:57,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 16:59:57,781 INFO L225 Difference]: With dead ends: 238 [2019-01-14 16:59:57,781 INFO L226 Difference]: Without dead ends: 201 [2019-01-14 16:59:57,782 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 16 SyntacticMatches, 12 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 369 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=174, Invalid=882, Unknown=0, NotChecked=0, Total=1056 [2019-01-14 16:59:57,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2019-01-14 16:59:57,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 138. [2019-01-14 16:59:57,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2019-01-14 16:59:57,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 165 transitions. [2019-01-14 16:59:57,807 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 165 transitions. Word has length 30 [2019-01-14 16:59:57,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 16:59:57,807 INFO L480 AbstractCegarLoop]: Abstraction has 138 states and 165 transitions. [2019-01-14 16:59:57,807 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-01-14 16:59:57,807 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 165 transitions. [2019-01-14 16:59:57,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-01-14 16:59:57,808 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 16:59:57,808 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 16:59:57,808 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 16:59:57,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 16:59:57,809 INFO L82 PathProgramCache]: Analyzing trace with hash -828731857, now seen corresponding path program 2 times [2019-01-14 16:59:57,809 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 16:59:57,809 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 16:59:57,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 16:59:57,810 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 16:59:57,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 16:59:57,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 16:59:58,378 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 16:59:58,379 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 16:59:58,379 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 16:59:58,388 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-14 16:59:58,405 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-14 16:59:58,405 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 16:59:58,407 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 16:59:58,596 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2019-01-14 16:59:58,603 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 16:59:58,605 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-14 16:59:58,605 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 16:59:58,614 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 16:59:58,630 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. [2019-01-14 16:59:58,630 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:42, output treesize:35 [2019-01-14 16:59:58,712 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 25 [2019-01-14 16:59:58,719 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 16:59:58,720 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 16:59:58,722 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 16:59:58,728 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 58 [2019-01-14 16:59:58,729 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 16:59:58,738 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 16:59:58,749 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 16:59:58,749 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:45, output treesize:19 [2019-01-14 16:59:58,790 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 16:59:58,809 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 16:59:58,809 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 23 [2019-01-14 16:59:58,809 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-01-14 16:59:58,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-01-14 16:59:58,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=405, Unknown=0, NotChecked=0, Total=506 [2019-01-14 16:59:58,810 INFO L87 Difference]: Start difference. First operand 138 states and 165 transitions. Second operand 23 states. [2019-01-14 17:00:00,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 17:00:00,117 INFO L93 Difference]: Finished difference Result 239 states and 283 transitions. [2019-01-14 17:00:00,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-01-14 17:00:00,118 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 30 [2019-01-14 17:00:00,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 17:00:00,119 INFO L225 Difference]: With dead ends: 239 [2019-01-14 17:00:00,119 INFO L226 Difference]: Without dead ends: 202 [2019-01-14 17:00:00,121 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 19 SyntacticMatches, 4 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 541 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=389, Invalid=1591, Unknown=0, NotChecked=0, Total=1980 [2019-01-14 17:00:00,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2019-01-14 17:00:00,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 150. [2019-01-14 17:00:00,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2019-01-14 17:00:00,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 181 transitions. [2019-01-14 17:00:00,149 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 181 transitions. Word has length 30 [2019-01-14 17:00:00,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 17:00:00,149 INFO L480 AbstractCegarLoop]: Abstraction has 150 states and 181 transitions. [2019-01-14 17:00:00,149 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-01-14 17:00:00,149 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 181 transitions. [2019-01-14 17:00:00,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-01-14 17:00:00,150 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 17:00:00,150 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 17:00:00,150 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 17:00:00,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 17:00:00,150 INFO L82 PathProgramCache]: Analyzing trace with hash -1196943461, now seen corresponding path program 3 times [2019-01-14 17:00:00,151 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 17:00:00,151 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 17:00:00,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 17:00:00,151 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 17:00:00,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 17:00:00,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 17:00:01,160 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 8 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 17:00:01,160 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 17:00:01,161 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 17:00:01,170 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-14 17:00:01,200 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-01-14 17:00:01,200 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 17:00:01,204 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 17:00:01,326 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2019-01-14 17:00:01,335 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 17:00:01,337 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-14 17:00:01,338 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 17:00:01,352 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 17:00:01,364 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 17:00:01,364 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:30 [2019-01-14 17:00:01,470 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 25 [2019-01-14 17:00:01,478 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 17:00:01,480 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 17:00:01,482 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 17:00:01,488 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 58 [2019-01-14 17:00:01,489 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 17:00:01,503 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 17:00:01,517 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 17:00:01,517 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:50, output treesize:29 [2019-01-14 17:00:01,644 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 24 [2019-01-14 17:00:01,647 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 17:00:01,649 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 17:00:01,651 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 17:00:01,659 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 55 [2019-01-14 17:00:01,659 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 17:00:01,673 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 17:00:01,688 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 17:00:01,688 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:44, output treesize:29 [2019-01-14 17:00:01,759 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 25 [2019-01-14 17:00:01,769 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 17:00:01,770 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 17:00:01,772 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 17:00:01,779 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 58 [2019-01-14 17:00:01,779 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 17:00:01,789 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 17:00:01,800 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 17:00:01,801 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:45, output treesize:19 [2019-01-14 17:00:01,832 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 8 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 17:00:01,851 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 17:00:01,851 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 18] total 25 [2019-01-14 17:00:01,852 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-01-14 17:00:01,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-01-14 17:00:01,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=492, Unknown=0, NotChecked=0, Total=600 [2019-01-14 17:00:01,852 INFO L87 Difference]: Start difference. First operand 150 states and 181 transitions. Second operand 25 states. [2019-01-14 17:00:02,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 17:00:02,943 INFO L93 Difference]: Finished difference Result 287 states and 348 transitions. [2019-01-14 17:00:02,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-01-14 17:00:02,944 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 31 [2019-01-14 17:00:02,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 17:00:02,946 INFO L225 Difference]: With dead ends: 287 [2019-01-14 17:00:02,946 INFO L226 Difference]: Without dead ends: 238 [2019-01-14 17:00:02,947 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 19 SyntacticMatches, 7 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 486 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=297, Invalid=1185, Unknown=0, NotChecked=0, Total=1482 [2019-01-14 17:00:02,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2019-01-14 17:00:02,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 168. [2019-01-14 17:00:02,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-01-14 17:00:02,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 204 transitions. [2019-01-14 17:00:02,975 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 204 transitions. Word has length 31 [2019-01-14 17:00:02,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 17:00:02,975 INFO L480 AbstractCegarLoop]: Abstraction has 168 states and 204 transitions. [2019-01-14 17:00:02,976 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-01-14 17:00:02,976 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 204 transitions. [2019-01-14 17:00:02,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-01-14 17:00:02,976 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 17:00:02,976 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2019-01-14 17:00:02,977 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 17:00:02,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 17:00:02,980 INFO L82 PathProgramCache]: Analyzing trace with hash 1597202772, now seen corresponding path program 5 times [2019-01-14 17:00:02,980 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 17:00:02,981 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 17:00:02,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 17:00:02,981 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 17:00:02,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 17:00:02,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 17:00:03,421 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 17:00:03,422 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 17:00:03,422 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 17:00:03,433 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-01-14 17:00:03,465 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2019-01-14 17:00:03,465 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 17:00:03,467 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 17:00:03,670 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2019-01-14 17:00:03,674 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2019-01-14 17:00:03,674 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 17:00:03,679 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 17:00:03,686 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 17:00:03,687 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:10 [2019-01-14 17:00:03,811 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2019-01-14 17:00:03,815 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 17:00:03,818 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-14 17:00:03,819 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 17:00:03,827 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 17:00:03,837 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. [2019-01-14 17:00:03,838 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:37, output treesize:30 [2019-01-14 17:00:04,248 WARN L181 SmtUtils]: Spent 192.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2019-01-14 17:00:04,700 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 17:00:04,719 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 17:00:04,719 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 18] total 32 [2019-01-14 17:00:04,719 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-01-14 17:00:04,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-01-14 17:00:04,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=894, Unknown=0, NotChecked=0, Total=992 [2019-01-14 17:00:04,720 INFO L87 Difference]: Start difference. First operand 168 states and 204 transitions. Second operand 32 states. [2019-01-14 17:00:06,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 17:00:06,041 INFO L93 Difference]: Finished difference Result 343 states and 415 transitions. [2019-01-14 17:00:06,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-01-14 17:00:06,042 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 33 [2019-01-14 17:00:06,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 17:00:06,044 INFO L225 Difference]: With dead ends: 343 [2019-01-14 17:00:06,045 INFO L226 Difference]: Without dead ends: 294 [2019-01-14 17:00:06,046 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 18 SyntacticMatches, 2 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 607 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=276, Invalid=2076, Unknown=0, NotChecked=0, Total=2352 [2019-01-14 17:00:06,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2019-01-14 17:00:06,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 201. [2019-01-14 17:00:06,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2019-01-14 17:00:06,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 245 transitions. [2019-01-14 17:00:06,091 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 245 transitions. Word has length 33 [2019-01-14 17:00:06,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 17:00:06,091 INFO L480 AbstractCegarLoop]: Abstraction has 201 states and 245 transitions. [2019-01-14 17:00:06,091 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-01-14 17:00:06,091 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 245 transitions. [2019-01-14 17:00:06,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-01-14 17:00:06,092 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 17:00:06,092 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 17:00:06,092 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 17:00:06,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 17:00:06,093 INFO L82 PathProgramCache]: Analyzing trace with hash -629949587, now seen corresponding path program 1 times [2019-01-14 17:00:06,093 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 17:00:06,093 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 17:00:06,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 17:00:06,093 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 17:00:06,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 17:00:06,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 17:00:06,612 WARN L181 SmtUtils]: Spent 285.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 16 [2019-01-14 17:00:07,890 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 17:00:07,891 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 17:00:07,892 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 17:00:07,901 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 17:00:07,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 17:00:07,923 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 17:00:08,015 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2019-01-14 17:00:08,018 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 17:00:08,021 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-14 17:00:08,021 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 17:00:08,026 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 17:00:08,037 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 17:00:08,037 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:34 [2019-01-14 17:00:08,093 INFO L478 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 40 treesize of output 31 [2019-01-14 17:00:08,096 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 17:00:08,097 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 17:00:08,098 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 17:00:08,099 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 17:00:08,104 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 77 [2019-01-14 17:00:08,104 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 17:00:08,115 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 17:00:08,126 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 17:00:08,126 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:49, output treesize:45 [2019-01-14 17:00:08,359 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 47 [2019-01-14 17:00:08,366 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 17:00:08,367 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 17:00:08,369 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 17:00:08,370 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 17:00:08,372 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 17:00:08,373 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 17:00:08,373 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 17:00:08,382 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 117 [2019-01-14 17:00:08,383 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 17:00:08,398 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 17:00:08,417 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-14 17:00:08,418 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:80, output treesize:54 [2019-01-14 17:00:08,631 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 45 [2019-01-14 17:00:08,634 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 17:00:08,636 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 17:00:08,637 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 17:00:08,638 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 17:00:08,640 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 17:00:08,659 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 45 treesize of output 125 [2019-01-14 17:00:08,661 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-01-14 17:00:08,706 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-14 17:00:08,774 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-01-14 17:00:08,774 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:73, output treesize:85 [2019-01-14 17:00:08,940 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 17:00:08,958 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 17:00:08,959 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 22] total 36 [2019-01-14 17:00:08,959 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-01-14 17:00:08,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-01-14 17:00:08,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=1140, Unknown=0, NotChecked=0, Total=1260 [2019-01-14 17:00:08,960 INFO L87 Difference]: Start difference. First operand 201 states and 245 transitions. Second operand 36 states. [2019-01-14 17:00:09,991 WARN L181 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 35 [2019-01-14 17:00:11,293 WARN L181 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 37 [2019-01-14 17:00:12,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 17:00:12,191 INFO L93 Difference]: Finished difference Result 241 states and 289 transitions. [2019-01-14 17:00:12,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-01-14 17:00:12,193 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 33 [2019-01-14 17:00:12,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 17:00:12,195 INFO L225 Difference]: With dead ends: 241 [2019-01-14 17:00:12,196 INFO L226 Difference]: Without dead ends: 232 [2019-01-14 17:00:12,197 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 16 SyntacticMatches, 7 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1065 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=437, Invalid=3469, Unknown=0, NotChecked=0, Total=3906 [2019-01-14 17:00:12,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2019-01-14 17:00:12,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 214. [2019-01-14 17:00:12,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2019-01-14 17:00:12,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 259 transitions. [2019-01-14 17:00:12,245 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 259 transitions. Word has length 33 [2019-01-14 17:00:12,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 17:00:12,245 INFO L480 AbstractCegarLoop]: Abstraction has 214 states and 259 transitions. [2019-01-14 17:00:12,245 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-01-14 17:00:12,245 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 259 transitions. [2019-01-14 17:00:12,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-01-14 17:00:12,246 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 17:00:12,246 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 17:00:12,246 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 17:00:12,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 17:00:12,247 INFO L82 PathProgramCache]: Analyzing trace with hash -1109632707, now seen corresponding path program 1 times [2019-01-14 17:00:12,247 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 17:00:12,247 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 17:00:12,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 17:00:12,248 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 17:00:12,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 17:00:12,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 17:00:13,245 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 17:00:13,245 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 17:00:13,245 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 17:00:13,261 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 17:00:13,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 17:00:13,282 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 17:00:13,526 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2019-01-14 17:00:13,529 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 17:00:13,530 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-14 17:00:13,531 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 17:00:13,536 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 17:00:13,547 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. [2019-01-14 17:00:13,547 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:37, output treesize:30 [2019-01-14 17:00:13,726 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 3 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 17:00:13,744 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 17:00:13,745 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 16] total 28 [2019-01-14 17:00:13,745 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-01-14 17:00:13,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-01-14 17:00:13,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=663, Unknown=0, NotChecked=0, Total=756 [2019-01-14 17:00:13,746 INFO L87 Difference]: Start difference. First operand 214 states and 259 transitions. Second operand 28 states. [2019-01-14 17:00:15,121 WARN L181 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 13 [2019-01-14 17:00:16,228 WARN L181 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2019-01-14 17:00:16,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 17:00:16,778 INFO L93 Difference]: Finished difference Result 422 states and 506 transitions. [2019-01-14 17:00:16,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-01-14 17:00:16,779 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 34 [2019-01-14 17:00:16,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 17:00:16,781 INFO L225 Difference]: With dead ends: 422 [2019-01-14 17:00:16,781 INFO L226 Difference]: Without dead ends: 373 [2019-01-14 17:00:16,783 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 20 SyntacticMatches, 2 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1110 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=543, Invalid=3489, Unknown=0, NotChecked=0, Total=4032 [2019-01-14 17:00:16,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2019-01-14 17:00:16,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 234. [2019-01-14 17:00:16,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2019-01-14 17:00:16,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 284 transitions. [2019-01-14 17:00:16,850 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 284 transitions. Word has length 34 [2019-01-14 17:00:16,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 17:00:16,851 INFO L480 AbstractCegarLoop]: Abstraction has 234 states and 284 transitions. [2019-01-14 17:00:16,851 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-01-14 17:00:16,851 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 284 transitions. [2019-01-14 17:00:16,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-01-14 17:00:16,855 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 17:00:16,855 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 17:00:16,855 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 17:00:16,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 17:00:16,855 INFO L82 PathProgramCache]: Analyzing trace with hash -835418939, now seen corresponding path program 2 times [2019-01-14 17:00:16,855 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 17:00:16,856 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 17:00:16,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 17:00:16,856 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 17:00:16,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 17:00:16,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 17:00:17,937 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 17:00:17,938 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 17:00:17,938 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 17:00:17,950 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-14 17:00:17,968 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-14 17:00:17,969 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 17:00:17,971 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 17:00:18,159 INFO L478 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 38 treesize of output 31 [2019-01-14 17:00:18,163 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 17:00:18,164 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 47 [2019-01-14 17:00:18,164 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 17:00:18,172 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 17:00:18,184 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 17:00:18,185 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:49, output treesize:45 [2019-01-14 17:00:18,372 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 17:00:18,373 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 53 [2019-01-14 17:00:18,377 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 17:00:18,378 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 17:00:18,379 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 59 [2019-01-14 17:00:18,380 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 17:00:18,387 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 17:00:18,399 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 17:00:18,400 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:65, output treesize:32 [2019-01-14 17:00:18,515 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 24 [2019-01-14 17:00:18,518 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 17:00:18,519 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 17:00:18,520 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 17:00:18,521 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 17:00:18,524 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 67 [2019-01-14 17:00:18,525 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 17:00:18,535 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 17:00:18,543 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 17:00:18,543 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:21 [2019-01-14 17:00:18,711 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 17:00:18,732 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 17:00:18,733 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 36 [2019-01-14 17:00:18,733 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-01-14 17:00:18,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-01-14 17:00:18,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=1107, Unknown=0, NotChecked=0, Total=1260 [2019-01-14 17:00:18,734 INFO L87 Difference]: Start difference. First operand 234 states and 284 transitions. Second operand 36 states. [2019-01-14 17:00:19,824 WARN L181 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2019-01-14 17:00:20,137 WARN L181 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2019-01-14 17:00:20,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 17:00:20,175 INFO L93 Difference]: Finished difference Result 265 states and 318 transitions. [2019-01-14 17:00:20,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-01-14 17:00:20,177 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 34 [2019-01-14 17:00:20,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 17:00:20,180 INFO L225 Difference]: With dead ends: 265 [2019-01-14 17:00:20,180 INFO L226 Difference]: Without dead ends: 263 [2019-01-14 17:00:20,182 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 656 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=278, Invalid=1978, Unknown=0, NotChecked=0, Total=2256 [2019-01-14 17:00:20,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2019-01-14 17:00:20,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 231. [2019-01-14 17:00:20,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2019-01-14 17:00:20,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 281 transitions. [2019-01-14 17:00:20,249 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 281 transitions. Word has length 34 [2019-01-14 17:00:20,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 17:00:20,250 INFO L480 AbstractCegarLoop]: Abstraction has 231 states and 281 transitions. [2019-01-14 17:00:20,252 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-01-14 17:00:20,252 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 281 transitions. [2019-01-14 17:00:20,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-01-14 17:00:20,253 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 17:00:20,253 INFO L402 BasicCegarLoop]: trace histogram [5, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 17:00:20,253 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 17:00:20,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 17:00:20,254 INFO L82 PathProgramCache]: Analyzing trace with hash -703579894, now seen corresponding path program 5 times [2019-01-14 17:00:20,254 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 17:00:20,254 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 17:00:20,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 17:00:20,255 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 17:00:20,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 17:00:20,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 17:00:20,662 WARN L181 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 7 [2019-01-14 17:00:20,858 WARN L181 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 12 [2019-01-14 17:00:21,442 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 8 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 17:00:21,442 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 17:00:21,442 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 17:00:21,454 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-01-14 17:00:21,487 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2019-01-14 17:00:21,487 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 17:00:21,490 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 17:00:21,613 INFO L478 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 38 treesize of output 31 [2019-01-14 17:00:21,616 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 17:00:21,617 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 17:00:21,618 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 58 [2019-01-14 17:00:21,618 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 17:00:21,625 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 17:00:21,636 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 17:00:21,636 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:51, output treesize:47 [2019-01-14 17:00:21,711 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 17:00:21,711 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 54 [2019-01-14 17:00:21,715 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 17:00:21,716 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 48 [2019-01-14 17:00:21,717 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 17:00:21,724 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 17:00:21,735 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. [2019-01-14 17:00:21,735 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:66, output treesize:38 [2019-01-14 17:00:21,797 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 27 [2019-01-14 17:00:21,803 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 17:00:21,806 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 17:00:21,809 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 17:00:21,812 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 17:00:21,818 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 76 [2019-01-14 17:00:21,819 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 17:00:21,837 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 17:00:21,850 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 17:00:21,851 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:49, output treesize:21 [2019-01-14 17:00:21,918 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 29 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-14 17:00:21,938 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 17:00:21,938 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 25 [2019-01-14 17:00:21,938 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-01-14 17:00:21,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-01-14 17:00:21,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=465, Unknown=0, NotChecked=0, Total=600 [2019-01-14 17:00:21,939 INFO L87 Difference]: Start difference. First operand 231 states and 281 transitions. Second operand 25 states. [2019-01-14 17:00:23,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 17:00:23,445 INFO L93 Difference]: Finished difference Result 379 states and 455 transitions. [2019-01-14 17:00:23,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-01-14 17:00:23,447 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 35 [2019-01-14 17:00:23,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 17:00:23,448 INFO L225 Difference]: With dead ends: 379 [2019-01-14 17:00:23,449 INFO L226 Difference]: Without dead ends: 330 [2019-01-14 17:00:23,450 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 23 SyntacticMatches, 7 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 670 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=493, Invalid=1763, Unknown=0, NotChecked=0, Total=2256 [2019-01-14 17:00:23,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2019-01-14 17:00:23,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 232. [2019-01-14 17:00:23,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2019-01-14 17:00:23,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 281 transitions. [2019-01-14 17:00:23,513 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 281 transitions. Word has length 35 [2019-01-14 17:00:23,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 17:00:23,513 INFO L480 AbstractCegarLoop]: Abstraction has 232 states and 281 transitions. [2019-01-14 17:00:23,513 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-01-14 17:00:23,513 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 281 transitions. [2019-01-14 17:00:23,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-01-14 17:00:23,519 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 17:00:23,519 INFO L402 BasicCegarLoop]: trace histogram [5, 4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 17:00:23,519 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 17:00:23,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 17:00:23,519 INFO L82 PathProgramCache]: Analyzing trace with hash -1456121544, now seen corresponding path program 1 times [2019-01-14 17:00:23,519 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 17:00:23,519 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 17:00:23,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 17:00:23,525 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 17:00:23,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 17:00:23,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 17:00:24,035 WARN L181 SmtUtils]: Spent 284.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 13 [2019-01-14 17:00:24,629 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 1 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 17:00:24,629 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 17:00:24,629 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 17:00:24,640 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 17:00:24,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 17:00:24,662 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 17:00:24,847 INFO L478 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 38 treesize of output 31 [2019-01-14 17:00:24,873 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 17:00:24,895 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 17:00:24,897 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 58 [2019-01-14 17:00:24,898 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 17:00:24,905 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 17:00:24,917 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 17:00:24,918 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:57, output treesize:53 [2019-01-14 17:00:25,075 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 17:00:25,077 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 53 [2019-01-14 17:00:25,081 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 17:00:25,082 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 17:00:25,084 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 59 [2019-01-14 17:00:25,085 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 17:00:25,094 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 17:00:25,108 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 17:00:25,109 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:69, output treesize:36 [2019-01-14 17:00:25,189 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 27 [2019-01-14 17:00:25,203 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 17:00:25,205 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 17:00:25,206 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 17:00:25,209 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 17:00:25,213 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 76 [2019-01-14 17:00:25,214 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 17:00:25,226 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 17:00:25,238 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. [2019-01-14 17:00:25,239 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:52, output treesize:36 [2019-01-14 17:00:25,305 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 27 [2019-01-14 17:00:25,309 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 17:00:25,310 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 17:00:25,312 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 17:00:25,315 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 17:00:25,319 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 76 [2019-01-14 17:00:25,321 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 17:00:25,334 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 17:00:25,344 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 17:00:25,345 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:49, output treesize:21 [2019-01-14 17:00:25,382 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 3 proven. 39 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-14 17:00:25,402 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 17:00:25,402 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 19] total 28 [2019-01-14 17:00:25,403 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-01-14 17:00:25,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-01-14 17:00:25,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=647, Unknown=0, NotChecked=0, Total=756 [2019-01-14 17:00:25,404 INFO L87 Difference]: Start difference. First operand 232 states and 281 transitions. Second operand 28 states. [2019-01-14 17:00:26,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 17:00:26,867 INFO L93 Difference]: Finished difference Result 354 states and 426 transitions. [2019-01-14 17:00:26,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-01-14 17:00:26,869 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 35 [2019-01-14 17:00:26,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 17:00:26,870 INFO L225 Difference]: With dead ends: 354 [2019-01-14 17:00:26,871 INFO L226 Difference]: Without dead ends: 304 [2019-01-14 17:00:26,873 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 19 SyntacticMatches, 10 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 638 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=293, Invalid=1687, Unknown=0, NotChecked=0, Total=1980 [2019-01-14 17:00:26,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2019-01-14 17:00:26,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 222. [2019-01-14 17:00:26,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2019-01-14 17:00:26,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 269 transitions. [2019-01-14 17:00:26,920 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 269 transitions. Word has length 35 [2019-01-14 17:00:26,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 17:00:26,920 INFO L480 AbstractCegarLoop]: Abstraction has 222 states and 269 transitions. [2019-01-14 17:00:26,920 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-01-14 17:00:26,920 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 269 transitions. [2019-01-14 17:00:26,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-01-14 17:00:26,921 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 17:00:26,921 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1] [2019-01-14 17:00:26,922 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 17:00:26,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 17:00:26,922 INFO L82 PathProgramCache]: Analyzing trace with hash -231391894, now seen corresponding path program 6 times [2019-01-14 17:00:26,922 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 17:00:26,922 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 17:00:26,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 17:00:26,923 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 17:00:26,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 17:00:26,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 17:00:27,219 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 3 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 17:00:27,219 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 17:00:27,219 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 17:00:27,229 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-01-14 17:00:27,255 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2019-01-14 17:00:27,256 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 17:00:27,258 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 17:00:27,373 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 3 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 17:00:27,392 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 17:00:27,392 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 15 [2019-01-14 17:00:27,392 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-01-14 17:00:27,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-01-14 17:00:27,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2019-01-14 17:00:27,393 INFO L87 Difference]: Start difference. First operand 222 states and 269 transitions. Second operand 15 states. [2019-01-14 17:00:27,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 17:00:27,749 INFO L93 Difference]: Finished difference Result 340 states and 404 transitions. [2019-01-14 17:00:27,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-01-14 17:00:27,751 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 37 [2019-01-14 17:00:27,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 17:00:27,752 INFO L225 Difference]: With dead ends: 340 [2019-01-14 17:00:27,752 INFO L226 Difference]: Without dead ends: 320 [2019-01-14 17:00:27,753 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 32 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=96, Invalid=410, Unknown=0, NotChecked=0, Total=506 [2019-01-14 17:00:27,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2019-01-14 17:00:27,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 238. [2019-01-14 17:00:27,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238 states. [2019-01-14 17:00:27,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 286 transitions. [2019-01-14 17:00:27,818 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 286 transitions. Word has length 37 [2019-01-14 17:00:27,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 17:00:27,818 INFO L480 AbstractCegarLoop]: Abstraction has 238 states and 286 transitions. [2019-01-14 17:00:27,818 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-01-14 17:00:27,818 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 286 transitions. [2019-01-14 17:00:27,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-01-14 17:00:27,819 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 17:00:27,819 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 17:00:27,820 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 17:00:27,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 17:00:27,820 INFO L82 PathProgramCache]: Analyzing trace with hash 1650333907, now seen corresponding path program 2 times [2019-01-14 17:00:27,820 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 17:00:27,820 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 17:00:27,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 17:00:27,821 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 17:00:27,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 17:00:27,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 17:00:28,543 WARN L181 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 21 [2019-01-14 17:00:28,893 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 17:00:28,893 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 17:00:28,894 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 17:00:28,906 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-14 17:00:28,927 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-14 17:00:28,928 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 17:00:28,930 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 17:00:29,036 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2019-01-14 17:00:29,039 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 17:00:29,041 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 33 [2019-01-14 17:00:29,041 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 17:00:29,048 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 17:00:29,059 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. [2019-01-14 17:00:29,059 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:35, output treesize:28 [2019-01-14 17:00:29,270 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 3 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 17:00:29,290 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 17:00:29,290 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2019-01-14 17:00:29,290 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-01-14 17:00:29,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-01-14 17:00:29,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=573, Unknown=0, NotChecked=0, Total=650 [2019-01-14 17:00:29,291 INFO L87 Difference]: Start difference. First operand 238 states and 286 transitions. Second operand 26 states. [2019-01-14 17:00:30,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 17:00:30,397 INFO L93 Difference]: Finished difference Result 291 states and 342 transitions. [2019-01-14 17:00:30,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-01-14 17:00:30,398 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 38 [2019-01-14 17:00:30,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 17:00:30,399 INFO L225 Difference]: With dead ends: 291 [2019-01-14 17:00:30,400 INFO L226 Difference]: Without dead ends: 278 [2019-01-14 17:00:30,401 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 417 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=228, Invalid=1494, Unknown=0, NotChecked=0, Total=1722 [2019-01-14 17:00:30,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2019-01-14 17:00:30,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 230. [2019-01-14 17:00:30,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2019-01-14 17:00:30,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 276 transitions. [2019-01-14 17:00:30,444 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 276 transitions. Word has length 38 [2019-01-14 17:00:30,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 17:00:30,445 INFO L480 AbstractCegarLoop]: Abstraction has 230 states and 276 transitions. [2019-01-14 17:00:30,445 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-01-14 17:00:30,445 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 276 transitions. [2019-01-14 17:00:30,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-01-14 17:00:30,446 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 17:00:30,446 INFO L402 BasicCegarLoop]: trace histogram [5, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 17:00:30,446 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 17:00:30,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 17:00:30,446 INFO L82 PathProgramCache]: Analyzing trace with hash -1013617860, now seen corresponding path program 2 times [2019-01-14 17:00:30,446 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 17:00:30,446 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 17:00:30,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 17:00:30,447 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 17:00:30,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 17:00:30,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 17:00:32,263 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 1 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 17:00:32,263 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 17:00:32,263 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 17:00:32,288 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-14 17:00:32,308 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-14 17:00:32,308 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 17:00:32,311 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 17:00:32,436 INFO L478 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 38 treesize of output 31 [2019-01-14 17:00:32,439 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 17:00:32,441 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 17:00:32,441 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 58 [2019-01-14 17:00:32,442 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 17:00:32,450 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 17:00:32,462 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 17:00:32,463 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:56, output treesize:52 [2019-01-14 17:00:32,630 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 17:00:32,631 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 53 [2019-01-14 17:00:32,637 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 17:00:32,638 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 46 [2019-01-14 17:00:32,639 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 17:00:32,645 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 17:00:32,657 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 17:00:32,657 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:60, output treesize:32 [2019-01-14 17:00:32,720 INFO L478 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 42 treesize of output 33 [2019-01-14 17:00:32,724 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 17:00:32,725 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 17:00:32,726 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 17:00:32,727 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 17:00:32,728 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 17:00:32,729 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 95 [2019-01-14 17:00:32,729 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 17:00:32,741 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 17:00:32,752 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 17:00:32,753 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:51, output treesize:47 [2019-01-14 17:00:32,984 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 17:00:32,985 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 66 [2019-01-14 17:00:32,995 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 17:00:32,996 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 17:00:32,997 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 17:00:32,998 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 17:00:32,999 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 17:00:33,000 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 17:00:33,001 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 17:00:33,002 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 17:00:33,003 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 145 [2019-01-14 17:00:33,004 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 17:00:33,021 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 17:00:33,037 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-14 17:00:33,038 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:82, output treesize:56 [2019-01-14 17:00:33,336 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 47 [2019-01-14 17:00:33,340 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 17:00:33,341 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 17:00:33,343 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 17:00:33,345 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 17:00:33,347 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 17:00:33,348 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 17:00:33,365 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 140 [2019-01-14 17:00:33,367 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-01-14 17:00:33,420 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-14 17:00:33,453 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-01-14 17:00:33,453 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:75, output treesize:89 [2019-01-14 17:00:33,727 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 2 proven. 41 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 17:00:33,746 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 17:00:33,746 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 25] total 42 [2019-01-14 17:00:33,747 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-01-14 17:00:33,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-01-14 17:00:33,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=196, Invalid=1526, Unknown=0, NotChecked=0, Total=1722 [2019-01-14 17:00:33,748 INFO L87 Difference]: Start difference. First operand 230 states and 276 transitions. Second operand 42 states. [2019-01-14 17:00:36,064 WARN L181 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 48 [2019-01-14 17:00:36,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 17:00:36,679 INFO L93 Difference]: Finished difference Result 255 states and 302 transitions. [2019-01-14 17:00:36,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-01-14 17:00:36,680 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 38 [2019-01-14 17:00:36,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 17:00:36,682 INFO L225 Difference]: With dead ends: 255 [2019-01-14 17:00:36,683 INFO L226 Difference]: Without dead ends: 246 [2019-01-14 17:00:36,684 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 18 SyntacticMatches, 8 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1318 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=449, Invalid=3333, Unknown=0, NotChecked=0, Total=3782 [2019-01-14 17:00:36,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2019-01-14 17:00:36,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 217. [2019-01-14 17:00:36,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2019-01-14 17:00:36,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 261 transitions. [2019-01-14 17:00:36,742 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 261 transitions. Word has length 38 [2019-01-14 17:00:36,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 17:00:36,742 INFO L480 AbstractCegarLoop]: Abstraction has 217 states and 261 transitions. [2019-01-14 17:00:36,742 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-01-14 17:00:36,742 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 261 transitions. [2019-01-14 17:00:36,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-01-14 17:00:36,743 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 17:00:36,743 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2019-01-14 17:00:36,743 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 17:00:36,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 17:00:36,744 INFO L82 PathProgramCache]: Analyzing trace with hash -1518821945, now seen corresponding path program 7 times [2019-01-14 17:00:36,750 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 17:00:36,750 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 17:00:36,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 17:00:36,753 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 17:00:36,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 17:00:36,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 17:00:37,426 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 17:00:37,426 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 17:00:37,426 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 17:00:37,437 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 17:00:37,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 17:00:37,462 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 17:00:37,575 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2019-01-14 17:00:37,578 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2019-01-14 17:00:37,578 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 17:00:37,582 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 17:00:37,589 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 17:00:37,589 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:7 [2019-01-14 17:00:37,883 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2019-01-14 17:00:37,886 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 17:00:37,888 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-14 17:00:37,888 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 17:00:37,897 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 17:00:37,907 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 17:00:37,907 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:27 [2019-01-14 17:00:37,999 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 25 [2019-01-14 17:00:38,004 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 17:00:38,005 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 17:00:38,007 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 17:00:38,013 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 58 [2019-01-14 17:00:38,014 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 17:00:38,026 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 17:00:38,036 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 17:00:38,037 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:19 [2019-01-14 17:00:38,257 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 17:00:38,276 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 17:00:38,276 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 34 [2019-01-14 17:00:38,277 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-01-14 17:00:38,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-01-14 17:00:38,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=995, Unknown=0, NotChecked=0, Total=1122 [2019-01-14 17:00:38,280 INFO L87 Difference]: Start difference. First operand 217 states and 261 transitions. Second operand 34 states. [2019-01-14 17:00:39,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 17:00:39,275 INFO L93 Difference]: Finished difference Result 291 states and 344 transitions. [2019-01-14 17:00:39,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-01-14 17:00:39,277 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 39 [2019-01-14 17:00:39,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 17:00:39,279 INFO L225 Difference]: With dead ends: 291 [2019-01-14 17:00:39,279 INFO L226 Difference]: Without dead ends: 289 [2019-01-14 17:00:39,281 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 24 SyntacticMatches, 2 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 728 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=377, Invalid=2275, Unknown=0, NotChecked=0, Total=2652 [2019-01-14 17:00:39,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2019-01-14 17:00:39,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 237. [2019-01-14 17:00:39,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2019-01-14 17:00:39,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 284 transitions. [2019-01-14 17:00:39,345 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 284 transitions. Word has length 39 [2019-01-14 17:00:39,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 17:00:39,346 INFO L480 AbstractCegarLoop]: Abstraction has 237 states and 284 transitions. [2019-01-14 17:00:39,346 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-01-14 17:00:39,346 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 284 transitions. [2019-01-14 17:00:39,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-01-14 17:00:39,347 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 17:00:39,347 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 17:00:39,347 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 17:00:39,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 17:00:39,347 INFO L82 PathProgramCache]: Analyzing trace with hash 1558500832, now seen corresponding path program 1 times [2019-01-14 17:00:39,347 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 17:00:39,348 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 17:00:39,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 17:00:39,348 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 17:00:39,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 17:00:39,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 17:00:39,740 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 17:00:39,740 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 17:00:39,740 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 17:00:39,751 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 17:00:39,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 17:00:39,774 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 17:00:39,982 INFO L478 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 38 treesize of output 31 [2019-01-14 17:00:39,986 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 17:00:39,987 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 47 [2019-01-14 17:00:39,987 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 17:00:39,993 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 17:00:40,006 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 17:00:40,006 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:47, output treesize:43 [2019-01-14 17:00:40,212 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 17:00:40,213 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 52 [2019-01-14 17:00:40,217 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 17:00:40,218 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 17:00:40,219 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 58 [2019-01-14 17:00:40,220 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 17:00:40,230 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 17:00:40,246 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. [2019-01-14 17:00:40,246 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:67, output treesize:32 [2019-01-14 17:00:40,453 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 7 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 17:00:40,472 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 17:00:40,472 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 19] total 33 [2019-01-14 17:00:40,473 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-01-14 17:00:40,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-01-14 17:00:40,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=941, Unknown=0, NotChecked=0, Total=1056 [2019-01-14 17:00:40,474 INFO L87 Difference]: Start difference. First operand 237 states and 284 transitions. Second operand 33 states. [2019-01-14 17:00:42,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 17:00:42,716 INFO L93 Difference]: Finished difference Result 368 states and 437 transitions. [2019-01-14 17:00:42,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-01-14 17:00:42,717 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 39 [2019-01-14 17:00:42,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 17:00:42,719 INFO L225 Difference]: With dead ends: 368 [2019-01-14 17:00:42,719 INFO L226 Difference]: Without dead ends: 303 [2019-01-14 17:00:42,720 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1203 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=471, Invalid=3819, Unknown=0, NotChecked=0, Total=4290 [2019-01-14 17:00:42,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2019-01-14 17:00:42,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 241. [2019-01-14 17:00:42,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2019-01-14 17:00:42,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 287 transitions. [2019-01-14 17:00:42,813 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 287 transitions. Word has length 39 [2019-01-14 17:00:42,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 17:00:42,814 INFO L480 AbstractCegarLoop]: Abstraction has 241 states and 287 transitions. [2019-01-14 17:00:42,814 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-01-14 17:00:42,814 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 287 transitions. [2019-01-14 17:00:42,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-01-14 17:00:42,815 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 17:00:42,815 INFO L402 BasicCegarLoop]: trace histogram [5, 4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 17:00:42,815 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 17:00:42,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 17:00:42,815 INFO L82 PathProgramCache]: Analyzing trace with hash 2060667424, now seen corresponding path program 3 times [2019-01-14 17:00:42,815 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 17:00:42,815 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 17:00:42,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 17:00:42,816 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 17:00:42,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 17:00:42,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 17:00:44,284 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 4 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 17:00:44,285 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 17:00:44,285 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 17:00:44,296 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-14 17:00:44,331 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-01-14 17:00:44,331 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 17:00:44,334 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 17:00:44,395 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2019-01-14 17:00:44,399 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 17:00:44,401 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-14 17:00:44,402 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 17:00:44,407 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 17:00:44,421 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. [2019-01-14 17:00:44,421 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:46, output treesize:39 [2019-01-14 17:00:44,477 INFO L478 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 42 treesize of output 33 [2019-01-14 17:00:44,480 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 17:00:44,481 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 17:00:44,482 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 17:00:44,483 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 17:00:44,490 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 81 [2019-01-14 17:00:44,490 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 17:00:44,499 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 17:00:44,509 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 17:00:44,509 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:51, output treesize:46 [2019-01-14 17:00:44,638 INFO L478 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 61 treesize of output 48 [2019-01-14 17:00:44,645 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 17:00:44,646 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 17:00:44,649 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 17:00:44,651 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 17:00:44,653 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 17:00:44,688 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 7 case distinctions, treesize of input 48 treesize of output 120 [2019-01-14 17:00:44,689 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-01-14 17:00:44,733 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-14 17:00:44,763 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-01-14 17:00:44,763 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:73, output treesize:131 [2019-01-14 17:00:45,171 INFO L478 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 53 treesize of output 42 [2019-01-14 17:00:45,175 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 17:00:45,177 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 17:00:45,178 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 17:00:45,180 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 17:00:45,181 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 17:00:45,189 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 93 [2019-01-14 17:00:45,190 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 17:00:45,202 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 17:00:45,212 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 17:00:45,212 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:62, output treesize:30 [2019-01-14 17:00:45,297 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 29 [2019-01-14 17:00:45,300 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 17:00:45,303 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 17:00:45,304 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 17:00:45,308 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 70 [2019-01-14 17:00:45,309 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 17:00:45,317 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 17:00:45,325 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 17:00:45,326 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:55, output treesize:23 [2019-01-14 17:00:45,426 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 17:00:45,445 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 17:00:45,445 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 36 [2019-01-14 17:00:45,445 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-01-14 17:00:45,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-01-14 17:00:45,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=1111, Unknown=0, NotChecked=0, Total=1260 [2019-01-14 17:00:45,446 INFO L87 Difference]: Start difference. First operand 241 states and 287 transitions. Second operand 36 states. [2019-01-14 17:00:47,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 17:00:47,813 INFO L93 Difference]: Finished difference Result 312 states and 366 transitions. [2019-01-14 17:00:47,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-01-14 17:00:47,815 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 39 [2019-01-14 17:00:47,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 17:00:47,817 INFO L225 Difference]: With dead ends: 312 [2019-01-14 17:00:47,817 INFO L226 Difference]: Without dead ends: 303 [2019-01-14 17:00:47,818 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 21 SyntacticMatches, 8 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1051 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=408, Invalid=2898, Unknown=0, NotChecked=0, Total=3306 [2019-01-14 17:00:47,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2019-01-14 17:00:47,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 251. [2019-01-14 17:00:47,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251 states. [2019-01-14 17:00:47,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 298 transitions. [2019-01-14 17:00:47,884 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 298 transitions. Word has length 39 [2019-01-14 17:00:47,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 17:00:47,884 INFO L480 AbstractCegarLoop]: Abstraction has 251 states and 298 transitions. [2019-01-14 17:00:47,884 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-01-14 17:00:47,885 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 298 transitions. [2019-01-14 17:00:47,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-01-14 17:00:47,885 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 17:00:47,886 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 17:00:47,886 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 17:00:47,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 17:00:47,886 INFO L82 PathProgramCache]: Analyzing trace with hash 1077848874, now seen corresponding path program 3 times [2019-01-14 17:00:47,886 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 17:00:47,886 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 17:00:47,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 17:00:47,887 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 17:00:47,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 17:00:47,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 17:00:48,341 WARN L181 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 11 [2019-01-14 17:00:48,897 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 17:00:48,897 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 17:00:48,898 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 17:00:48,909 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-14 17:00:48,948 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-01-14 17:00:48,948 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 17:00:48,951 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 17:00:49,117 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2019-01-14 17:00:49,119 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 17:00:49,121 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-14 17:00:49,122 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 17:00:49,128 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 17:00:49,136 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 17:00:49,136 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:27 [2019-01-14 17:00:49,240 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 25 [2019-01-14 17:00:49,242 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 17:00:49,244 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 17:00:49,245 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 17:00:49,248 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 58 [2019-01-14 17:00:49,249 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 17:00:49,259 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 17:00:49,270 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 17:00:49,271 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:43, output treesize:22 [2019-01-14 17:00:49,382 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 22 [2019-01-14 17:00:49,385 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 17:00:49,386 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 17:00:49,387 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 17:00:49,391 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 49 [2019-01-14 17:00:49,391 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 17:00:49,399 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 17:00:49,405 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 17:00:49,405 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:19 [2019-01-14 17:00:49,563 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 17:00:49,582 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 17:00:49,582 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 18] total 36 [2019-01-14 17:00:49,582 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-01-14 17:00:49,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-01-14 17:00:49,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=1118, Unknown=0, NotChecked=0, Total=1260 [2019-01-14 17:00:49,583 INFO L87 Difference]: Start difference. First operand 251 states and 298 transitions. Second operand 36 states. [2019-01-14 17:00:51,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 17:00:51,906 INFO L93 Difference]: Finished difference Result 504 states and 603 transitions. [2019-01-14 17:00:51,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-01-14 17:00:51,908 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 40 [2019-01-14 17:00:51,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 17:00:51,911 INFO L225 Difference]: With dead ends: 504 [2019-01-14 17:00:51,911 INFO L226 Difference]: Without dead ends: 454 [2019-01-14 17:00:51,912 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 24 SyntacticMatches, 3 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1842 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=723, Invalid=4827, Unknown=0, NotChecked=0, Total=5550 [2019-01-14 17:00:51,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states. [2019-01-14 17:00:51,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 314. [2019-01-14 17:00:51,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 314 states. [2019-01-14 17:00:51,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 376 transitions. [2019-01-14 17:00:51,994 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 376 transitions. Word has length 40 [2019-01-14 17:00:51,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 17:00:51,994 INFO L480 AbstractCegarLoop]: Abstraction has 314 states and 376 transitions. [2019-01-14 17:00:51,994 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-01-14 17:00:51,994 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 376 transitions. [2019-01-14 17:00:51,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-01-14 17:00:51,995 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 17:00:51,995 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 17:00:51,996 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 17:00:51,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 17:00:51,996 INFO L82 PathProgramCache]: Analyzing trace with hash 1570917360, now seen corresponding path program 4 times [2019-01-14 17:00:51,996 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 17:00:51,996 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 17:00:51,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 17:00:51,997 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 17:00:51,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 17:00:52,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 17:00:52,437 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 17:00:52,437 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 17:00:52,437 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 17:00:52,450 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-14 17:00:52,473 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-14 17:00:52,473 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 17:00:52,475 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 17:00:52,862 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2019-01-14 17:00:52,865 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 17:00:52,867 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-14 17:00:52,868 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 17:00:52,878 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 17:00:52,890 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. [2019-01-14 17:00:52,890 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:42, output treesize:35 [2019-01-14 17:00:53,028 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 27 [2019-01-14 17:00:53,030 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 17:00:53,032 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 17:00:53,033 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 17:00:53,037 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 64 [2019-01-14 17:00:53,038 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 17:00:53,046 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 17:00:53,058 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. [2019-01-14 17:00:53,058 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:43, output treesize:30 [2019-01-14 17:00:53,263 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 3 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 17:00:53,282 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 17:00:53,282 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 18] total 33 [2019-01-14 17:00:53,283 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-01-14 17:00:53,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-01-14 17:00:53,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=931, Unknown=0, NotChecked=0, Total=1056 [2019-01-14 17:00:53,283 INFO L87 Difference]: Start difference. First operand 314 states and 376 transitions. Second operand 33 states. [2019-01-14 17:00:56,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 17:00:56,536 INFO L93 Difference]: Finished difference Result 568 states and 686 transitions. [2019-01-14 17:00:56,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-01-14 17:00:56,538 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 40 [2019-01-14 17:00:56,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 17:00:56,540 INFO L225 Difference]: With dead ends: 568 [2019-01-14 17:00:56,540 INFO L226 Difference]: Without dead ends: 506 [2019-01-14 17:00:56,542 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1552 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=729, Invalid=4673, Unknown=0, NotChecked=0, Total=5402 [2019-01-14 17:00:56,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 506 states. [2019-01-14 17:00:56,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 506 to 372. [2019-01-14 17:00:56,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 372 states. [2019-01-14 17:00:56,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 450 transitions. [2019-01-14 17:00:56,674 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 450 transitions. Word has length 40 [2019-01-14 17:00:56,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 17:00:56,675 INFO L480 AbstractCegarLoop]: Abstraction has 372 states and 450 transitions. [2019-01-14 17:00:56,675 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-01-14 17:00:56,675 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 450 transitions. [2019-01-14 17:00:56,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-01-14 17:00:56,676 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 17:00:56,676 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 17:00:56,676 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 17:00:56,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 17:00:56,677 INFO L82 PathProgramCache]: Analyzing trace with hash -1841450632, now seen corresponding path program 3 times [2019-01-14 17:00:56,677 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 17:00:56,677 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 17:00:56,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 17:00:56,678 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 17:00:56,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 17:00:56,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 17:00:57,961 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 17:00:57,961 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 17:00:57,961 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 17:00:57,973 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-14 17:00:58,018 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-01-14 17:00:58,018 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 17:00:58,021 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 17:00:58,232 INFO L478 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 38 treesize of output 31 [2019-01-14 17:00:58,236 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 17:00:58,237 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 47 [2019-01-14 17:00:58,237 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 17:00:58,243 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 17:00:58,255 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 17:00:58,256 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:49, output treesize:45 [2019-01-14 17:00:58,480 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 17:00:58,481 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 53 [2019-01-14 17:00:58,484 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 17:00:58,485 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 17:00:58,486 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 59 [2019-01-14 17:00:58,487 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 17:00:58,494 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 17:00:58,506 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 17:00:58,507 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:65, output treesize:32 [2019-01-14 17:00:58,624 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 27 [2019-01-14 17:00:58,627 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 17:00:58,628 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 17:00:58,630 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 17:00:58,631 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 17:00:58,633 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 76 [2019-01-14 17:00:58,633 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 17:00:58,645 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 17:00:58,653 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 17:00:58,654 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:45, output treesize:24 [2019-01-14 17:00:58,723 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 27 [2019-01-14 17:00:58,725 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 17:00:58,726 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 17:00:58,727 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 17:00:58,729 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 17:00:58,731 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 76 [2019-01-14 17:00:58,731 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 17:00:58,742 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 17:00:58,752 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 17:00:58,752 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:40, output treesize:21 [2019-01-14 17:00:58,941 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 1 proven. 53 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 17:00:58,960 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 17:00:58,960 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21] total 41 [2019-01-14 17:00:58,961 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-01-14 17:00:58,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-01-14 17:00:58,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=1459, Unknown=0, NotChecked=0, Total=1640 [2019-01-14 17:00:58,961 INFO L87 Difference]: Start difference. First operand 372 states and 450 transitions. Second operand 41 states. [2019-01-14 17:01:00,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 17:01:00,641 INFO L93 Difference]: Finished difference Result 457 states and 547 transitions. [2019-01-14 17:01:00,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-01-14 17:01:00,643 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 40 [2019-01-14 17:01:00,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 17:01:00,645 INFO L225 Difference]: With dead ends: 457 [2019-01-14 17:01:00,645 INFO L226 Difference]: Without dead ends: 455 [2019-01-14 17:01:00,646 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1286 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=510, Invalid=3650, Unknown=0, NotChecked=0, Total=4160 [2019-01-14 17:01:00,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455 states. [2019-01-14 17:01:00,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455 to 372. [2019-01-14 17:01:00,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 372 states. [2019-01-14 17:01:00,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 450 transitions. [2019-01-14 17:01:00,739 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 450 transitions. Word has length 40 [2019-01-14 17:01:00,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 17:01:00,740 INFO L480 AbstractCegarLoop]: Abstraction has 372 states and 450 transitions. [2019-01-14 17:01:00,740 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-01-14 17:01:00,740 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 450 transitions. [2019-01-14 17:01:00,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-01-14 17:01:00,741 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 17:01:00,741 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1] [2019-01-14 17:01:00,741 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 17:01:00,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 17:01:00,742 INFO L82 PathProgramCache]: Analyzing trace with hash -506394531, now seen corresponding path program 8 times [2019-01-14 17:01:00,742 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 17:01:00,742 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 17:01:00,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 17:01:00,743 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 17:01:00,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 17:01:00,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 17:01:01,207 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 17:01:01,208 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 17:01:01,208 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 17:01:01,219 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-14 17:01:01,245 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-14 17:01:01,246 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 17:01:01,248 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 17:01:01,357 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2019-01-14 17:01:01,360 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2019-01-14 17:01:01,361 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 17:01:01,364 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 17:01:01,371 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 17:01:01,371 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:7 [2019-01-14 17:01:01,484 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2019-01-14 17:01:01,492 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 17:01:01,494 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2019-01-14 17:01:01,494 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 17:01:01,499 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 17:01:01,506 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 17:01:01,506 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2019-01-14 17:01:01,731 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 17:01:01,750 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 17:01:01,750 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17] total 33 [2019-01-14 17:01:01,750 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-01-14 17:01:01,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-01-14 17:01:01,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=954, Unknown=0, NotChecked=0, Total=1056 [2019-01-14 17:01:01,751 INFO L87 Difference]: Start difference. First operand 372 states and 450 transitions. Second operand 33 states. [2019-01-14 17:01:03,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 17:01:03,336 INFO L93 Difference]: Finished difference Result 576 states and 688 transitions. [2019-01-14 17:01:03,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-01-14 17:01:03,337 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 43 [2019-01-14 17:01:03,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 17:01:03,340 INFO L225 Difference]: With dead ends: 576 [2019-01-14 17:01:03,340 INFO L226 Difference]: Without dead ends: 574 [2019-01-14 17:01:03,340 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 29 SyntacticMatches, 2 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 660 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=315, Invalid=2337, Unknown=0, NotChecked=0, Total=2652 [2019-01-14 17:01:03,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2019-01-14 17:01:03,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 429. [2019-01-14 17:01:03,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 429 states. [2019-01-14 17:01:03,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 520 transitions. [2019-01-14 17:01:03,471 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 520 transitions. Word has length 43 [2019-01-14 17:01:03,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 17:01:03,471 INFO L480 AbstractCegarLoop]: Abstraction has 429 states and 520 transitions. [2019-01-14 17:01:03,471 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-01-14 17:01:03,472 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 520 transitions. [2019-01-14 17:01:03,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-01-14 17:01:03,473 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 17:01:03,473 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 17:01:03,473 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 17:01:03,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 17:01:03,473 INFO L82 PathProgramCache]: Analyzing trace with hash 432114678, now seen corresponding path program 2 times [2019-01-14 17:01:03,473 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 17:01:03,474 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 17:01:03,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 17:01:03,474 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 17:01:03,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 17:01:03,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 17:01:03,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 17:01:03,550 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-01-14 17:01:03,620 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.01 05:01:03 BoogieIcfgContainer [2019-01-14 17:01:03,624 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-14 17:01:03,625 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 17:01:03,625 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 17:01:03,625 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 17:01:03,626 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 04:59:23" (3/4) ... [2019-01-14 17:01:03,634 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2019-01-14 17:01:03,720 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-14 17:01:03,720 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 17:01:03,722 INFO L168 Benchmark]: Toolchain (without parser) took 100765.65 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 374.9 MB). Free memory was 944.6 MB in the beginning and 1.1 GB in the end (delta: -175.8 MB). Peak memory consumption was 199.1 MB. Max. memory is 11.5 GB. [2019-01-14 17:01:03,724 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 17:01:03,724 INFO L168 Benchmark]: CACSL2BoogieTranslator took 368.99 ms. Allocated memory is still 1.0 GB. Free memory was 944.6 MB in the beginning and 933.9 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-01-14 17:01:03,724 INFO L168 Benchmark]: Boogie Procedure Inliner took 56.01 ms. Allocated memory is still 1.0 GB. Free memory is still 933.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 17:01:03,725 INFO L168 Benchmark]: Boogie Preprocessor took 93.72 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 118.0 MB). Free memory was 933.9 MB in the beginning and 1.1 GB in the end (delta: -179.1 MB). Peak memory consumption was 18.9 MB. Max. memory is 11.5 GB. [2019-01-14 17:01:03,725 INFO L168 Benchmark]: RCFGBuilder took 477.83 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 24.8 MB). Peak memory consumption was 24.8 MB. Max. memory is 11.5 GB. [2019-01-14 17:01:03,725 INFO L168 Benchmark]: TraceAbstraction took 99667.82 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 256.9 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -32.1 MB). Peak memory consumption was 224.8 MB. Max. memory is 11.5 GB. [2019-01-14 17:01:03,726 INFO L168 Benchmark]: Witness Printer took 95.41 ms. Allocated memory is still 1.4 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 17:01:03,735 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 368.99 ms. Allocated memory is still 1.0 GB. Free memory was 944.6 MB in the beginning and 933.9 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 56.01 ms. Allocated memory is still 1.0 GB. Free memory is still 933.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 93.72 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 118.0 MB). Free memory was 933.9 MB in the beginning and 1.1 GB in the end (delta: -179.1 MB). Peak memory consumption was 18.9 MB. Max. memory is 11.5 GB. * RCFGBuilder took 477.83 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 24.8 MB). Peak memory consumption was 24.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 99667.82 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 256.9 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -32.1 MB). Peak memory consumption was 224.8 MB. Max. memory is 11.5 GB. * Witness Printer took 95.41 ms. Allocated memory is still 1.4 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L11] unsigned int SIZE=__VERIFIER_nondet_uint(); [L12] int i, j, k, key; [L13] int v[SIZE]; [L14] j=1 [L14] COND TRUE j=0) && (v[i]>key) [L17] EXPR v[i] [L17] (i>=0) && (v[i]>key) [L17] COND FALSE !((i>=0) && (v[i]>key)) [L22] v[i+1] = key [L14] j++ [L14] COND TRUE j=0) && (v[i]>key) [L17] EXPR v[i] [L17] (i>=0) && (v[i]>key) [L17] COND FALSE !((i>=0) && (v[i]>key)) [L22] v[i+1] = key [L14] j++ [L14] COND TRUE j=0) && (v[i]>key) [L17] EXPR v[i] [L17] (i>=0) && (v[i]>key) [L17] COND TRUE (i>=0) && (v[i]>key) [L18] COND FALSE !(i<2) [L20] i = i - 1 [L17] (i>=0) && (v[i]>key) [L17] EXPR v[i] [L17] (i>=0) && (v[i]>key) [L17] COND TRUE (i>=0) && (v[i]>key) [L18] COND TRUE i<2 [L19] EXPR v[i] [L19] v[i+1] = v[i] [L20] i = i - 1 [L17] (i>=0) && (v[i]>key) [L17] EXPR v[i] [L17] (i>=0) && (v[i]>key) [L17] COND FALSE !((i>=0) && (v[i]>key)) [L22] v[i+1] = key [L14] j++ [L14] COND FALSE !(j