/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/array-tiling/pr3.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-23 20:48:06,745 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-23 20:48:06,747 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-23 20:48:06,759 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-23 20:48:06,759 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-23 20:48:06,760 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-23 20:48:06,762 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-23 20:48:06,764 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-23 20:48:06,765 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-23 20:48:06,766 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-23 20:48:06,767 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-23 20:48:06,769 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-23 20:48:06,769 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-23 20:48:06,770 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-23 20:48:06,771 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-23 20:48:06,774 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-23 20:48:06,777 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-23 20:48:06,779 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-23 20:48:06,783 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-23 20:48:06,787 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-23 20:48:06,792 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-23 20:48:06,794 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-23 20:48:06,796 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-23 20:48:06,797 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-23 20:48:06,801 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-23 20:48:06,803 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-23 20:48:06,803 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-23 20:48:06,804 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-23 20:48:06,805 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-23 20:48:06,805 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-23 20:48:06,809 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-23 20:48:06,810 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-23 20:48:06,810 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-23 20:48:06,813 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-23 20:48:06,814 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-23 20:48:06,814 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-23 20:48:06,818 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-23 20:48:06,818 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-23 20:48:06,818 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-23 20:48:06,819 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-23 20:48:06,820 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-23 20:48:06,821 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-23 20:48:06,845 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-23 20:48:06,845 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-23 20:48:06,846 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-23 20:48:06,847 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-23 20:48:06,847 INFO L138 SettingsManager]: * Use SBE=true [2019-11-23 20:48:06,847 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-23 20:48:06,847 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-23 20:48:06,848 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-23 20:48:06,848 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-23 20:48:06,848 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-23 20:48:06,849 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-23 20:48:06,849 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-23 20:48:06,850 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-23 20:48:06,850 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-23 20:48:06,850 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-23 20:48:06,850 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-23 20:48:06,851 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-23 20:48:06,851 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-23 20:48:06,851 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-23 20:48:06,851 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-23 20:48:06,852 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-23 20:48:06,852 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-23 20:48:06,852 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-23 20:48:06,852 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-23 20:48:06,853 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-23 20:48:06,853 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-23 20:48:06,853 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-23 20:48:06,853 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-23 20:48:06,853 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-23 20:48:06,854 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-23 20:48:07,155 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-23 20:48:07,174 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-23 20:48:07,177 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-23 20:48:07,178 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-23 20:48:07,179 INFO L275 PluginConnector]: CDTParser initialized [2019-11-23 20:48:07,180 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-tiling/pr3.c [2019-11-23 20:48:07,252 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/30e9babee/79cac6812bd44dc8a9b006bc66955852/FLAG12015d580 [2019-11-23 20:48:07,704 INFO L306 CDTParser]: Found 1 translation units. [2019-11-23 20:48:07,704 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-tiling/pr3.c [2019-11-23 20:48:07,711 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/30e9babee/79cac6812bd44dc8a9b006bc66955852/FLAG12015d580 [2019-11-23 20:48:08,071 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/30e9babee/79cac6812bd44dc8a9b006bc66955852 [2019-11-23 20:48:08,079 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-23 20:48:08,080 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-23 20:48:08,081 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-23 20:48:08,082 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-23 20:48:08,086 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-23 20:48:08,087 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 08:48:08" (1/1) ... [2019-11-23 20:48:08,091 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@39236083 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:48:08, skipping insertion in model container [2019-11-23 20:48:08,091 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 08:48:08" (1/1) ... [2019-11-23 20:48:08,100 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-23 20:48:08,120 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-23 20:48:08,297 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 20:48:08,301 INFO L203 MainTranslator]: Completed pre-run [2019-11-23 20:48:08,328 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 20:48:08,349 INFO L208 MainTranslator]: Completed translation [2019-11-23 20:48:08,349 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:48:08 WrapperNode [2019-11-23 20:48:08,350 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-23 20:48:08,350 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-23 20:48:08,351 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-23 20:48:08,351 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-23 20:48:08,358 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:48:08" (1/1) ... [2019-11-23 20:48:08,456 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:48:08" (1/1) ... [2019-11-23 20:48:08,489 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-23 20:48:08,490 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-23 20:48:08,490 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-23 20:48:08,490 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-23 20:48:08,497 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:48:08" (1/1) ... [2019-11-23 20:48:08,497 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:48:08" (1/1) ... [2019-11-23 20:48:08,499 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:48:08" (1/1) ... [2019-11-23 20:48:08,500 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:48:08" (1/1) ... [2019-11-23 20:48:08,505 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:48:08" (1/1) ... [2019-11-23 20:48:08,511 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:48:08" (1/1) ... [2019-11-23 20:48:08,512 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:48:08" (1/1) ... [2019-11-23 20:48:08,514 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-23 20:48:08,515 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-23 20:48:08,515 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-23 20:48:08,515 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-23 20:48:08,516 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:48:08" (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-11-23 20:48:08,581 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-23 20:48:08,581 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-23 20:48:08,582 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-23 20:48:08,582 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-23 20:48:08,582 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-23 20:48:08,583 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-23 20:48:08,888 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-23 20:48:08,888 INFO L284 CfgBuilder]: Removed 8 assume(true) statements. [2019-11-23 20:48:08,890 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 08:48:08 BoogieIcfgContainer [2019-11-23 20:48:08,890 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-23 20:48:08,891 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-23 20:48:08,891 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-23 20:48:08,894 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-23 20:48:08,895 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 08:48:08" (1/3) ... [2019-11-23 20:48:08,895 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71bb72e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 08:48:08, skipping insertion in model container [2019-11-23 20:48:08,896 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:48:08" (2/3) ... [2019-11-23 20:48:08,896 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71bb72e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 08:48:08, skipping insertion in model container [2019-11-23 20:48:08,896 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 08:48:08" (3/3) ... [2019-11-23 20:48:08,898 INFO L109 eAbstractionObserver]: Analyzing ICFG pr3.c [2019-11-23 20:48:08,908 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-23 20:48:08,919 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-23 20:48:08,932 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-23 20:48:08,955 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-23 20:48:08,955 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-23 20:48:08,955 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-23 20:48:08,955 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-23 20:48:08,956 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-23 20:48:08,956 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-23 20:48:08,956 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-23 20:48:08,956 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-23 20:48:08,968 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states. [2019-11-23 20:48:08,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-23 20:48:08,974 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:48:08,975 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:48:08,975 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:48:08,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:48:08,980 INFO L82 PathProgramCache]: Analyzing trace with hash 2072761718, now seen corresponding path program 1 times [2019-11-23 20:48:08,986 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:48:08,987 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214525986] [2019-11-23 20:48:08,987 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:48:09,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:48:09,163 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:48:09,163 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214525986] [2019-11-23 20:48:09,164 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:48:09,164 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 20:48:09,165 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727557111] [2019-11-23 20:48:09,171 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 20:48:09,172 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:48:09,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 20:48:09,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-23 20:48:09,186 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 4 states. [2019-11-23 20:48:09,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:48:09,259 INFO L93 Difference]: Finished difference Result 49 states and 65 transitions. [2019-11-23 20:48:09,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-23 20:48:09,261 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-11-23 20:48:09,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:48:09,273 INFO L225 Difference]: With dead ends: 49 [2019-11-23 20:48:09,273 INFO L226 Difference]: Without dead ends: 25 [2019-11-23 20:48:09,277 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-23 20:48:09,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-11-23 20:48:09,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 20. [2019-11-23 20:48:09,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-11-23 20:48:09,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 25 transitions. [2019-11-23 20:48:09,316 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 25 transitions. Word has length 11 [2019-11-23 20:48:09,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:48:09,317 INFO L462 AbstractCegarLoop]: Abstraction has 20 states and 25 transitions. [2019-11-23 20:48:09,317 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 20:48:09,317 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 25 transitions. [2019-11-23 20:48:09,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-23 20:48:09,318 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:48:09,319 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:48:09,319 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:48:09,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:48:09,320 INFO L82 PathProgramCache]: Analyzing trace with hash 2072821300, now seen corresponding path program 1 times [2019-11-23 20:48:09,320 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:48:09,320 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960260859] [2019-11-23 20:48:09,321 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:48:09,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:48:09,520 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:48:09,521 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960260859] [2019-11-23 20:48:09,522 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:48:09,523 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 20:48:09,523 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351468750] [2019-11-23 20:48:09,525 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 20:48:09,525 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:48:09,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 20:48:09,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 20:48:09,526 INFO L87 Difference]: Start difference. First operand 20 states and 25 transitions. Second operand 4 states. [2019-11-23 20:48:09,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:48:09,590 INFO L93 Difference]: Finished difference Result 36 states and 46 transitions. [2019-11-23 20:48:09,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 20:48:09,591 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-11-23 20:48:09,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:48:09,591 INFO L225 Difference]: With dead ends: 36 [2019-11-23 20:48:09,592 INFO L226 Difference]: Without dead ends: 25 [2019-11-23 20:48:09,593 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 20:48:09,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-11-23 20:48:09,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 21. [2019-11-23 20:48:09,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-11-23 20:48:09,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 26 transitions. [2019-11-23 20:48:09,598 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 26 transitions. Word has length 11 [2019-11-23 20:48:09,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:48:09,598 INFO L462 AbstractCegarLoop]: Abstraction has 21 states and 26 transitions. [2019-11-23 20:48:09,599 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 20:48:09,599 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 26 transitions. [2019-11-23 20:48:09,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-23 20:48:09,599 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:48:09,600 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:48:09,600 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:48:09,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:48:09,600 INFO L82 PathProgramCache]: Analyzing trace with hash -78171480, now seen corresponding path program 1 times [2019-11-23 20:48:09,601 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:48:09,601 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787705165] [2019-11-23 20:48:09,601 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:48:09,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:48:10,037 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:48:10,037 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787705165] [2019-11-23 20:48:10,040 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2133663516] [2019-11-23 20:48:10,040 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:48:10,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:48:10,098 INFO L255 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 13 conjunts are in the unsatisfiable core [2019-11-23 20:48:10,106 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:48:10,205 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 16 treesize of output 12 [2019-11-23 20:48:10,207 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:48:10,220 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:48:10,221 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:48:10,222 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2019-11-23 20:48:10,257 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:48:10,259 INFO L377 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 29 treesize of output 28 [2019-11-23 20:48:10,260 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:48:10,273 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:48:10,274 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:48:10,275 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:35, output treesize:19 [2019-11-23 20:48:10,286 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:48:10,289 INFO L377 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 21 treesize of output 20 [2019-11-23 20:48:10,290 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:48:10,301 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:48:10,302 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:48:10,302 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:11 [2019-11-23 20:48:10,349 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:48:10,371 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:48:10,372 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:48:10,372 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 15 [2019-11-23 20:48:10,372 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162634163] [2019-11-23 20:48:10,374 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-23 20:48:10,374 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:48:10,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-23 20:48:10,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2019-11-23 20:48:10,375 INFO L87 Difference]: Start difference. First operand 21 states and 26 transitions. Second operand 15 states. [2019-11-23 20:48:10,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:48:10,966 INFO L93 Difference]: Finished difference Result 105 states and 128 transitions. [2019-11-23 20:48:10,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-11-23 20:48:10,966 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 16 [2019-11-23 20:48:10,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:48:10,971 INFO L225 Difference]: With dead ends: 105 [2019-11-23 20:48:10,971 INFO L226 Difference]: Without dead ends: 95 [2019-11-23 20:48:10,973 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=218, Invalid=652, Unknown=0, NotChecked=0, Total=870 [2019-11-23 20:48:10,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-11-23 20:48:10,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 29. [2019-11-23 20:48:10,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-11-23 20:48:10,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 38 transitions. [2019-11-23 20:48:10,984 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 38 transitions. Word has length 16 [2019-11-23 20:48:10,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:48:10,986 INFO L462 AbstractCegarLoop]: Abstraction has 29 states and 38 transitions. [2019-11-23 20:48:10,986 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-23 20:48:10,986 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 38 transitions. [2019-11-23 20:48:10,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-23 20:48:10,987 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:48:10,987 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:48:11,189 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:48:11,192 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:48:11,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:48:11,193 INFO L82 PathProgramCache]: Analyzing trace with hash 622893098, now seen corresponding path program 1 times [2019-11-23 20:48:11,193 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:48:11,194 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197923109] [2019-11-23 20:48:11,194 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:48:11,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:48:11,284 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:48:11,284 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197923109] [2019-11-23 20:48:11,285 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:48:11,285 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 20:48:11,285 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304463396] [2019-11-23 20:48:11,286 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 20:48:11,286 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:48:11,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 20:48:11,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-23 20:48:11,287 INFO L87 Difference]: Start difference. First operand 29 states and 38 transitions. Second operand 4 states. [2019-11-23 20:48:11,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:48:11,342 INFO L93 Difference]: Finished difference Result 55 states and 70 transitions. [2019-11-23 20:48:11,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 20:48:11,343 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-11-23 20:48:11,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:48:11,344 INFO L225 Difference]: With dead ends: 55 [2019-11-23 20:48:11,344 INFO L226 Difference]: Without dead ends: 39 [2019-11-23 20:48:11,357 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-23 20:48:11,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-11-23 20:48:11,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 29. [2019-11-23 20:48:11,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-11-23 20:48:11,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 37 transitions. [2019-11-23 20:48:11,369 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 37 transitions. Word has length 16 [2019-11-23 20:48:11,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:48:11,369 INFO L462 AbstractCegarLoop]: Abstraction has 29 states and 37 transitions. [2019-11-23 20:48:11,370 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 20:48:11,372 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 37 transitions. [2019-11-23 20:48:11,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-23 20:48:11,372 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:48:11,374 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:48:11,375 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:48:11,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:48:11,375 INFO L82 PathProgramCache]: Analyzing trace with hash 229866088, now seen corresponding path program 1 times [2019-11-23 20:48:11,375 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:48:11,376 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799754072] [2019-11-23 20:48:11,376 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:48:11,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:48:11,427 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:48:11,428 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799754072] [2019-11-23 20:48:11,428 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:48:11,428 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 20:48:11,428 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577184599] [2019-11-23 20:48:11,429 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 20:48:11,429 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:48:11,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 20:48:11,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-23 20:48:11,430 INFO L87 Difference]: Start difference. First operand 29 states and 37 transitions. Second operand 4 states. [2019-11-23 20:48:11,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:48:11,475 INFO L93 Difference]: Finished difference Result 55 states and 68 transitions. [2019-11-23 20:48:11,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 20:48:11,476 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-11-23 20:48:11,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:48:11,477 INFO L225 Difference]: With dead ends: 55 [2019-11-23 20:48:11,477 INFO L226 Difference]: Without dead ends: 39 [2019-11-23 20:48:11,478 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-23 20:48:11,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-11-23 20:48:11,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 29. [2019-11-23 20:48:11,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-11-23 20:48:11,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 36 transitions. [2019-11-23 20:48:11,483 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 36 transitions. Word has length 16 [2019-11-23 20:48:11,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:48:11,484 INFO L462 AbstractCegarLoop]: Abstraction has 29 states and 36 transitions. [2019-11-23 20:48:11,484 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 20:48:11,484 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 36 transitions. [2019-11-23 20:48:11,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-23 20:48:11,485 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:48:11,485 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:48:11,485 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:48:11,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:48:11,485 INFO L82 PathProgramCache]: Analyzing trace with hash 909924458, now seen corresponding path program 1 times [2019-11-23 20:48:11,485 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:48:11,486 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724945731] [2019-11-23 20:48:11,486 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:48:11,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:48:11,676 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:48:11,677 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724945731] [2019-11-23 20:48:11,677 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1239484237] [2019-11-23 20:48:11,677 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:48:11,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:48:11,716 INFO L255 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 21 conjunts are in the unsatisfiable core [2019-11-23 20:48:11,718 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:48:11,730 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 16 treesize of output 12 [2019-11-23 20:48:11,730 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:48:11,743 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:48:11,743 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:48:11,744 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2019-11-23 20:48:11,761 INFO L377 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 37 treesize of output 32 [2019-11-23 20:48:11,770 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:48:11,783 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:48:11,787 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:48:11,789 INFO L377 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 28 [2019-11-23 20:48:11,789 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 20:48:11,794 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:48:11,795 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:48:11,803 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:48:11,803 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:48:11,803 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:43, output treesize:31 [2019-11-23 20:48:11,829 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:48:11,830 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:48:11,831 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:48:11,832 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:48:11,833 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2019-11-23 20:48:11,834 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:48:11,841 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:48:11,842 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:48:11,842 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:29 [2019-11-23 20:48:11,889 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:48:11,901 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:48:11,901 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:48:11,901 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 13 [2019-11-23 20:48:11,902 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278083687] [2019-11-23 20:48:11,902 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-23 20:48:11,902 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:48:11,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-23 20:48:11,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2019-11-23 20:48:11,903 INFO L87 Difference]: Start difference. First operand 29 states and 36 transitions. Second operand 13 states. [2019-11-23 20:48:12,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:48:12,395 INFO L93 Difference]: Finished difference Result 86 states and 105 transitions. [2019-11-23 20:48:12,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-11-23 20:48:12,396 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 16 [2019-11-23 20:48:12,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:48:12,397 INFO L225 Difference]: With dead ends: 86 [2019-11-23 20:48:12,397 INFO L226 Difference]: Without dead ends: 84 [2019-11-23 20:48:12,398 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 12 SyntacticMatches, 3 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=204, Invalid=552, Unknown=0, NotChecked=0, Total=756 [2019-11-23 20:48:12,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-11-23 20:48:12,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 44. [2019-11-23 20:48:12,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-11-23 20:48:12,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 56 transitions. [2019-11-23 20:48:12,405 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 56 transitions. Word has length 16 [2019-11-23 20:48:12,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:48:12,406 INFO L462 AbstractCegarLoop]: Abstraction has 44 states and 56 transitions. [2019-11-23 20:48:12,406 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-23 20:48:12,406 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 56 transitions. [2019-11-23 20:48:12,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-23 20:48:12,407 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:48:12,407 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:48:12,610 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:48:12,615 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:48:12,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:48:12,615 INFO L82 PathProgramCache]: Analyzing trace with hash -1127445386, now seen corresponding path program 1 times [2019-11-23 20:48:12,615 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:48:12,616 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079656376] [2019-11-23 20:48:12,616 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:48:12,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:48:12,655 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:48:12,655 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079656376] [2019-11-23 20:48:12,656 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:48:12,656 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 20:48:12,656 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875412709] [2019-11-23 20:48:12,657 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 20:48:12,657 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:48:12,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 20:48:12,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 20:48:12,658 INFO L87 Difference]: Start difference. First operand 44 states and 56 transitions. Second operand 3 states. [2019-11-23 20:48:12,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:48:12,685 INFO L93 Difference]: Finished difference Result 70 states and 86 transitions. [2019-11-23 20:48:12,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 20:48:12,685 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-11-23 20:48:12,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:48:12,686 INFO L225 Difference]: With dead ends: 70 [2019-11-23 20:48:12,686 INFO L226 Difference]: Without dead ends: 54 [2019-11-23 20:48:12,687 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 20:48:12,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-11-23 20:48:12,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 44. [2019-11-23 20:48:12,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-11-23 20:48:12,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 54 transitions. [2019-11-23 20:48:12,693 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 54 transitions. Word has length 21 [2019-11-23 20:48:12,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:48:12,693 INFO L462 AbstractCegarLoop]: Abstraction has 44 states and 54 transitions. [2019-11-23 20:48:12,693 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 20:48:12,693 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 54 transitions. [2019-11-23 20:48:12,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-23 20:48:12,694 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:48:12,694 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:48:12,694 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:48:12,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:48:12,695 INFO L82 PathProgramCache]: Analyzing trace with hash -845591950, now seen corresponding path program 1 times [2019-11-23 20:48:12,695 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:48:12,695 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400187317] [2019-11-23 20:48:12,695 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:48:12,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:48:12,731 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:48:12,731 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400187317] [2019-11-23 20:48:12,731 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:48:12,731 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 20:48:12,732 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087178012] [2019-11-23 20:48:12,732 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 20:48:12,732 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:48:12,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 20:48:12,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 20:48:12,733 INFO L87 Difference]: Start difference. First operand 44 states and 54 transitions. Second operand 3 states. [2019-11-23 20:48:12,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:48:12,768 INFO L93 Difference]: Finished difference Result 64 states and 76 transitions. [2019-11-23 20:48:12,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 20:48:12,769 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-11-23 20:48:12,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:48:12,770 INFO L225 Difference]: With dead ends: 64 [2019-11-23 20:48:12,770 INFO L226 Difference]: Without dead ends: 48 [2019-11-23 20:48:12,770 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 20:48:12,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-11-23 20:48:12,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 38. [2019-11-23 20:48:12,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-11-23 20:48:12,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 46 transitions. [2019-11-23 20:48:12,778 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 46 transitions. Word has length 21 [2019-11-23 20:48:12,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:48:12,778 INFO L462 AbstractCegarLoop]: Abstraction has 38 states and 46 transitions. [2019-11-23 20:48:12,778 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 20:48:12,779 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 46 transitions. [2019-11-23 20:48:12,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-23 20:48:12,784 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:48:12,784 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:48:12,784 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:48:12,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:48:12,785 INFO L82 PathProgramCache]: Analyzing trace with hash 719858331, now seen corresponding path program 1 times [2019-11-23 20:48:12,785 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:48:12,785 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178238263] [2019-11-23 20:48:12,785 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:48:12,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:48:12,935 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:48:12,936 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178238263] [2019-11-23 20:48:12,936 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1197661182] [2019-11-23 20:48:12,936 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:48:12,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:48:12,969 INFO L255 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-23 20:48:12,971 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:48:13,014 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 16 treesize of output 12 [2019-11-23 20:48:13,015 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:48:13,024 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:48:13,024 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:48:13,025 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2019-11-23 20:48:13,047 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:48:13,048 INFO L377 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 23 treesize of output 22 [2019-11-23 20:48:13,049 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:48:13,055 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:48:13,056 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:48:13,056 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2019-11-23 20:48:13,109 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:48:13,112 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:48:13,113 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:48:13,113 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 15 [2019-11-23 20:48:13,113 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034276491] [2019-11-23 20:48:13,114 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-23 20:48:13,114 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:48:13,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-23 20:48:13,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2019-11-23 20:48:13,115 INFO L87 Difference]: Start difference. First operand 38 states and 46 transitions. Second operand 15 states. [2019-11-23 20:48:13,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:48:13,817 INFO L93 Difference]: Finished difference Result 119 states and 140 transitions. [2019-11-23 20:48:13,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-11-23 20:48:13,817 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 22 [2019-11-23 20:48:13,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:48:13,818 INFO L225 Difference]: With dead ends: 119 [2019-11-23 20:48:13,818 INFO L226 Difference]: Without dead ends: 109 [2019-11-23 20:48:13,819 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 159 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=236, Invalid=756, Unknown=0, NotChecked=0, Total=992 [2019-11-23 20:48:13,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-11-23 20:48:13,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 50. [2019-11-23 20:48:13,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-11-23 20:48:13,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 61 transitions. [2019-11-23 20:48:13,826 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 61 transitions. Word has length 22 [2019-11-23 20:48:13,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:48:13,827 INFO L462 AbstractCegarLoop]: Abstraction has 50 states and 61 transitions. [2019-11-23 20:48:13,827 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-23 20:48:13,827 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 61 transitions. [2019-11-23 20:48:13,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-23 20:48:13,828 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:48:13,828 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:48:14,038 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:48:14,039 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:48:14,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:48:14,039 INFO L82 PathProgramCache]: Analyzing trace with hash -301210023, now seen corresponding path program 1 times [2019-11-23 20:48:14,040 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:48:14,040 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726344502] [2019-11-23 20:48:14,040 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:48:14,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:48:14,090 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-23 20:48:14,091 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726344502] [2019-11-23 20:48:14,091 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:48:14,091 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 20:48:14,091 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903676283] [2019-11-23 20:48:14,092 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 20:48:14,092 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:48:14,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 20:48:14,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-23 20:48:14,092 INFO L87 Difference]: Start difference. First operand 50 states and 61 transitions. Second operand 4 states. [2019-11-23 20:48:14,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:48:14,130 INFO L93 Difference]: Finished difference Result 81 states and 97 transitions. [2019-11-23 20:48:14,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 20:48:14,130 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2019-11-23 20:48:14,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:48:14,131 INFO L225 Difference]: With dead ends: 81 [2019-11-23 20:48:14,131 INFO L226 Difference]: Without dead ends: 63 [2019-11-23 20:48:14,132 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-23 20:48:14,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-11-23 20:48:14,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 50. [2019-11-23 20:48:14,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-11-23 20:48:14,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 60 transitions. [2019-11-23 20:48:14,139 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 60 transitions. Word has length 22 [2019-11-23 20:48:14,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:48:14,139 INFO L462 AbstractCegarLoop]: Abstraction has 50 states and 60 transitions. [2019-11-23 20:48:14,139 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 20:48:14,140 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 60 transitions. [2019-11-23 20:48:14,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-23 20:48:14,140 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:48:14,140 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:48:14,141 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:48:14,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:48:14,141 INFO L82 PathProgramCache]: Analyzing trace with hash -1581073701, now seen corresponding path program 1 times [2019-11-23 20:48:14,141 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:48:14,141 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96954227] [2019-11-23 20:48:14,142 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:48:14,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:48:14,256 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:48:14,256 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [96954227] [2019-11-23 20:48:14,256 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [590331675] [2019-11-23 20:48:14,257 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:48:14,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:48:14,287 INFO L255 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 22 conjunts are in the unsatisfiable core [2019-11-23 20:48:14,288 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:48:14,375 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 16 treesize of output 12 [2019-11-23 20:48:14,375 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:48:14,380 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:48:14,380 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:48:14,380 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2019-11-23 20:48:14,405 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:48:14,405 INFO L377 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 23 treesize of output 22 [2019-11-23 20:48:14,406 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:48:14,412 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:48:14,412 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:48:14,413 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2019-11-23 20:48:14,476 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:48:14,491 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:48:14,491 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:48:14,492 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 16 [2019-11-23 20:48:14,492 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064266324] [2019-11-23 20:48:14,492 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-23 20:48:14,493 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:48:14,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-23 20:48:14,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=184, Unknown=0, NotChecked=0, Total=240 [2019-11-23 20:48:14,493 INFO L87 Difference]: Start difference. First operand 50 states and 60 transitions. Second operand 16 states. [2019-11-23 20:48:15,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:48:15,175 INFO L93 Difference]: Finished difference Result 132 states and 156 transitions. [2019-11-23 20:48:15,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-11-23 20:48:15,175 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 22 [2019-11-23 20:48:15,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:48:15,177 INFO L225 Difference]: With dead ends: 132 [2019-11-23 20:48:15,177 INFO L226 Difference]: Without dead ends: 130 [2019-11-23 20:48:15,178 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 316 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=310, Invalid=950, Unknown=0, NotChecked=0, Total=1260 [2019-11-23 20:48:15,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2019-11-23 20:48:15,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 65. [2019-11-23 20:48:15,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-11-23 20:48:15,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 79 transitions. [2019-11-23 20:48:15,186 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 79 transitions. Word has length 22 [2019-11-23 20:48:15,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:48:15,186 INFO L462 AbstractCegarLoop]: Abstraction has 65 states and 79 transitions. [2019-11-23 20:48:15,187 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-23 20:48:15,187 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 79 transitions. [2019-11-23 20:48:15,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-23 20:48:15,188 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:48:15,188 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:48:15,399 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:48:15,400 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:48:15,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:48:15,400 INFO L82 PathProgramCache]: Analyzing trace with hash 992392679, now seen corresponding path program 1 times [2019-11-23 20:48:15,400 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:48:15,401 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233730146] [2019-11-23 20:48:15,401 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:48:15,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:48:15,429 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-23 20:48:15,429 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233730146] [2019-11-23 20:48:15,429 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:48:15,430 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 20:48:15,430 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954964635] [2019-11-23 20:48:15,430 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 20:48:15,430 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:48:15,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 20:48:15,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 20:48:15,431 INFO L87 Difference]: Start difference. First operand 65 states and 79 transitions. Second operand 3 states. [2019-11-23 20:48:15,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:48:15,455 INFO L93 Difference]: Finished difference Result 93 states and 111 transitions. [2019-11-23 20:48:15,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 20:48:15,455 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-11-23 20:48:15,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:48:15,456 INFO L225 Difference]: With dead ends: 93 [2019-11-23 20:48:15,456 INFO L226 Difference]: Without dead ends: 75 [2019-11-23 20:48:15,456 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 20:48:15,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-11-23 20:48:15,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 65. [2019-11-23 20:48:15,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-11-23 20:48:15,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 77 transitions. [2019-11-23 20:48:15,463 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 77 transitions. Word has length 27 [2019-11-23 20:48:15,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:48:15,463 INFO L462 AbstractCegarLoop]: Abstraction has 65 states and 77 transitions. [2019-11-23 20:48:15,463 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 20:48:15,463 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 77 transitions. [2019-11-23 20:48:15,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-23 20:48:15,464 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:48:15,464 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:48:15,465 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:48:15,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:48:15,465 INFO L82 PathProgramCache]: Analyzing trace with hash 1618514409, now seen corresponding path program 1 times [2019-11-23 20:48:15,465 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:48:15,465 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719080743] [2019-11-23 20:48:15,465 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:48:15,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:48:15,498 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-23 20:48:15,498 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719080743] [2019-11-23 20:48:15,499 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:48:15,499 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 20:48:15,499 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377166732] [2019-11-23 20:48:15,499 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 20:48:15,499 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:48:15,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 20:48:15,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 20:48:15,500 INFO L87 Difference]: Start difference. First operand 65 states and 77 transitions. Second operand 3 states. [2019-11-23 20:48:15,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:48:15,520 INFO L93 Difference]: Finished difference Result 88 states and 102 transitions. [2019-11-23 20:48:15,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 20:48:15,521 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-11-23 20:48:15,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:48:15,521 INFO L225 Difference]: With dead ends: 88 [2019-11-23 20:48:15,522 INFO L226 Difference]: Without dead ends: 70 [2019-11-23 20:48:15,522 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 20:48:15,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-11-23 20:48:15,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 59. [2019-11-23 20:48:15,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-11-23 20:48:15,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 69 transitions. [2019-11-23 20:48:15,528 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 69 transitions. Word has length 27 [2019-11-23 20:48:15,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:48:15,529 INFO L462 AbstractCegarLoop]: Abstraction has 59 states and 69 transitions. [2019-11-23 20:48:15,529 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 20:48:15,529 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 69 transitions. [2019-11-23 20:48:15,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-23 20:48:15,530 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:48:15,530 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:48:15,530 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:48:15,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:48:15,530 INFO L82 PathProgramCache]: Analyzing trace with hash -936501170, now seen corresponding path program 2 times [2019-11-23 20:48:15,531 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:48:15,531 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724215770] [2019-11-23 20:48:15,531 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:48:15,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:48:15,681 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:48:15,681 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724215770] [2019-11-23 20:48:15,682 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [160980254] [2019-11-23 20:48:15,682 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:48:15,722 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-23 20:48:15,722 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 20:48:15,723 INFO L255 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 15 conjunts are in the unsatisfiable core [2019-11-23 20:48:15,725 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:48:15,755 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 13 treesize of output 9 [2019-11-23 20:48:15,756 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:48:15,761 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:48:15,762 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:48:15,762 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:13 [2019-11-23 20:48:15,834 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:48:15,838 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:48:15,839 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:48:15,839 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 16 [2019-11-23 20:48:15,839 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759417535] [2019-11-23 20:48:15,839 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-23 20:48:15,840 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:48:15,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-23 20:48:15,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2019-11-23 20:48:15,840 INFO L87 Difference]: Start difference. First operand 59 states and 69 transitions. Second operand 16 states. [2019-11-23 20:48:16,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:48:16,396 INFO L93 Difference]: Finished difference Result 141 states and 161 transitions. [2019-11-23 20:48:16,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-23 20:48:16,397 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 28 [2019-11-23 20:48:16,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:48:16,398 INFO L225 Difference]: With dead ends: 141 [2019-11-23 20:48:16,398 INFO L226 Difference]: Without dead ends: 117 [2019-11-23 20:48:16,399 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=156, Invalid=546, Unknown=0, NotChecked=0, Total=702 [2019-11-23 20:48:16,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2019-11-23 20:48:16,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 72. [2019-11-23 20:48:16,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-11-23 20:48:16,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 84 transitions. [2019-11-23 20:48:16,407 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 84 transitions. Word has length 28 [2019-11-23 20:48:16,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:48:16,407 INFO L462 AbstractCegarLoop]: Abstraction has 72 states and 84 transitions. [2019-11-23 20:48:16,407 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-23 20:48:16,407 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 84 transitions. [2019-11-23 20:48:16,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-23 20:48:16,408 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:48:16,408 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:48:16,623 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:48:16,624 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:48:16,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:48:16,625 INFO L82 PathProgramCache]: Analyzing trace with hash -513799344, now seen corresponding path program 1 times [2019-11-23 20:48:16,625 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:48:16,626 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581176009] [2019-11-23 20:48:16,626 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:48:16,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:48:16,715 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:48:16,716 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1581176009] [2019-11-23 20:48:16,716 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1301508390] [2019-11-23 20:48:16,716 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:48:16,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:48:16,770 INFO L255 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 23 conjunts are in the unsatisfiable core [2019-11-23 20:48:16,772 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:48:16,800 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 13 treesize of output 9 [2019-11-23 20:48:16,801 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:48:16,805 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:48:16,805 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:48:16,805 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2019-11-23 20:48:16,871 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:48:16,886 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:48:16,886 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:48:16,886 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2019-11-23 20:48:16,886 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915019997] [2019-11-23 20:48:16,887 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-11-23 20:48:16,887 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:48:16,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-11-23 20:48:16,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2019-11-23 20:48:16,887 INFO L87 Difference]: Start difference. First operand 72 states and 84 transitions. Second operand 17 states. [2019-11-23 20:48:17,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:48:17,659 INFO L93 Difference]: Finished difference Result 171 states and 196 transitions. [2019-11-23 20:48:17,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-11-23 20:48:17,660 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 28 [2019-11-23 20:48:17,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:48:17,661 INFO L225 Difference]: With dead ends: 171 [2019-11-23 20:48:17,661 INFO L226 Difference]: Without dead ends: 169 [2019-11-23 20:48:17,662 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 456 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=358, Invalid=1364, Unknown=0, NotChecked=0, Total=1722 [2019-11-23 20:48:17,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2019-11-23 20:48:17,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 91. [2019-11-23 20:48:17,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-11-23 20:48:17,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 107 transitions. [2019-11-23 20:48:17,675 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 107 transitions. Word has length 28 [2019-11-23 20:48:17,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:48:17,675 INFO L462 AbstractCegarLoop]: Abstraction has 91 states and 107 transitions. [2019-11-23 20:48:17,675 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-11-23 20:48:17,675 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 107 transitions. [2019-11-23 20:48:17,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-23 20:48:17,676 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:48:17,676 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:48:17,879 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:48:17,880 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:48:17,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:48:17,880 INFO L82 PathProgramCache]: Analyzing trace with hash -245120063, now seen corresponding path program 3 times [2019-11-23 20:48:17,880 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:48:17,880 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693278174] [2019-11-23 20:48:17,880 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:48:17,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:48:18,205 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 17 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:48:18,205 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693278174] [2019-11-23 20:48:18,205 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1427255277] [2019-11-23 20:48:18,205 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:48:18,251 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-11-23 20:48:18,251 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 20:48:18,252 INFO L255 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-23 20:48:18,254 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:48:18,311 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:48:18,312 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 20:48:18,314 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 20:48:18,456 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 30 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:48:18,457 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:48:18,457 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2019-11-23 20:48:18,457 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111588591] [2019-11-23 20:48:18,457 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-11-23 20:48:18,457 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:48:18,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-11-23 20:48:18,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2019-11-23 20:48:18,458 INFO L87 Difference]: Start difference. First operand 91 states and 107 transitions. Second operand 17 states. [2019-11-23 20:48:18,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:48:18,722 INFO L93 Difference]: Finished difference Result 170 states and 193 transitions. [2019-11-23 20:48:18,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-23 20:48:18,722 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 34 [2019-11-23 20:48:18,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:48:18,723 INFO L225 Difference]: With dead ends: 170 [2019-11-23 20:48:18,723 INFO L226 Difference]: Without dead ends: 113 [2019-11-23 20:48:18,724 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=110, Invalid=310, Unknown=0, NotChecked=0, Total=420 [2019-11-23 20:48:18,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-11-23 20:48:18,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 100. [2019-11-23 20:48:18,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-11-23 20:48:18,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 115 transitions. [2019-11-23 20:48:18,731 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 115 transitions. Word has length 34 [2019-11-23 20:48:18,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:48:18,732 INFO L462 AbstractCegarLoop]: Abstraction has 100 states and 115 transitions. [2019-11-23 20:48:18,732 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-11-23 20:48:18,732 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 115 transitions. [2019-11-23 20:48:18,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-11-23 20:48:18,733 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:48:18,733 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:48:18,933 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:48:18,934 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:48:18,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:48:18,934 INFO L82 PathProgramCache]: Analyzing trace with hash 809179216, now seen corresponding path program 1 times [2019-11-23 20:48:18,935 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:48:18,935 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961583188] [2019-11-23 20:48:18,935 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:48:18,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:48:18,965 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-11-23 20:48:18,965 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961583188] [2019-11-23 20:48:18,966 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:48:18,966 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 20:48:18,966 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68425532] [2019-11-23 20:48:18,966 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 20:48:18,966 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:48:18,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 20:48:18,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 20:48:18,967 INFO L87 Difference]: Start difference. First operand 100 states and 115 transitions. Second operand 3 states. [2019-11-23 20:48:18,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:48:18,991 INFO L93 Difference]: Finished difference Result 148 states and 168 transitions. [2019-11-23 20:48:18,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 20:48:18,993 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 38 [2019-11-23 20:48:18,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:48:18,994 INFO L225 Difference]: With dead ends: 148 [2019-11-23 20:48:18,994 INFO L226 Difference]: Without dead ends: 104 [2019-11-23 20:48:18,996 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 20:48:18,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-11-23 20:48:19,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 91. [2019-11-23 20:48:19,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-11-23 20:48:19,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 102 transitions. [2019-11-23 20:48:19,003 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 102 transitions. Word has length 38 [2019-11-23 20:48:19,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:48:19,004 INFO L462 AbstractCegarLoop]: Abstraction has 91 states and 102 transitions. [2019-11-23 20:48:19,004 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 20:48:19,004 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 102 transitions. [2019-11-23 20:48:19,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-23 20:48:19,005 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:48:19,005 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:48:19,006 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:48:19,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:48:19,006 INFO L82 PathProgramCache]: Analyzing trace with hash 868977869, now seen corresponding path program 4 times [2019-11-23 20:48:19,006 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:48:19,006 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639096048] [2019-11-23 20:48:19,007 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:48:19,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:48:19,233 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 6 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:48:19,233 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639096048] [2019-11-23 20:48:19,233 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2036907202] [2019-11-23 20:48:19,234 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:48:19,292 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-23 20:48:19,292 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 20:48:19,294 INFO L255 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 21 conjunts are in the unsatisfiable core [2019-11-23 20:48:19,296 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:48:19,399 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 16 treesize of output 12 [2019-11-23 20:48:19,399 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:48:19,415 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:48:19,415 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:48:19,416 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2019-11-23 20:48:19,448 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:48:19,449 INFO L377 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 29 treesize of output 28 [2019-11-23 20:48:19,449 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:48:19,457 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:48:19,457 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:48:19,457 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:35, output treesize:19 [2019-11-23 20:48:19,464 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:48:19,466 INFO L377 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 23 treesize of output 22 [2019-11-23 20:48:19,466 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:48:19,472 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:48:19,472 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:48:19,473 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2019-11-23 20:48:19,606 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:48:19,616 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 6 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:48:19,617 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:48:19,617 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 23 [2019-11-23 20:48:19,617 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335574568] [2019-11-23 20:48:19,618 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-11-23 20:48:19,618 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:48:19,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-11-23 20:48:19,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=442, Unknown=0, NotChecked=0, Total=506 [2019-11-23 20:48:19,619 INFO L87 Difference]: Start difference. First operand 91 states and 102 transitions. Second operand 23 states. [2019-11-23 20:48:21,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:48:21,131 INFO L93 Difference]: Finished difference Result 217 states and 239 transitions. [2019-11-23 20:48:21,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-11-23 20:48:21,140 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 39 [2019-11-23 20:48:21,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:48:21,141 INFO L225 Difference]: With dead ends: 217 [2019-11-23 20:48:21,141 INFO L226 Difference]: Without dead ends: 207 [2019-11-23 20:48:21,142 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 30 SyntacticMatches, 2 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 512 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=397, Invalid=2255, Unknown=0, NotChecked=0, Total=2652 [2019-11-23 20:48:21,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2019-11-23 20:48:21,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 109. [2019-11-23 20:48:21,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-11-23 20:48:21,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 122 transitions. [2019-11-23 20:48:21,151 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 122 transitions. Word has length 39 [2019-11-23 20:48:21,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:48:21,152 INFO L462 AbstractCegarLoop]: Abstraction has 109 states and 122 transitions. [2019-11-23 20:48:21,152 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-11-23 20:48:21,152 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 122 transitions. [2019-11-23 20:48:21,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-23 20:48:21,152 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:48:21,153 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:48:21,356 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:48:21,357 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:48:21,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:48:21,357 INFO L82 PathProgramCache]: Analyzing trace with hash 1627325965, now seen corresponding path program 1 times [2019-11-23 20:48:21,357 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:48:21,357 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790954401] [2019-11-23 20:48:21,357 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:48:21,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:48:21,493 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:48:21,493 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [790954401] [2019-11-23 20:48:21,493 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [845710648] [2019-11-23 20:48:21,493 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:48:21,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:48:21,531 INFO L255 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 29 conjunts are in the unsatisfiable core [2019-11-23 20:48:21,533 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:48:21,582 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 16 treesize of output 12 [2019-11-23 20:48:21,582 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:48:21,588 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:48:21,588 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:48:21,588 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2019-11-23 20:48:21,611 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:48:21,612 INFO L377 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 29 treesize of output 28 [2019-11-23 20:48:21,612 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:48:21,619 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:48:21,620 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:48:21,620 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:35, output treesize:31 [2019-11-23 20:48:21,647 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:48:21,649 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:48:21,652 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:48:21,652 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:48:21,653 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 34 [2019-11-23 20:48:21,653 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:48:21,658 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:48:21,659 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:48:21,659 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:35, output treesize:31 [2019-11-23 20:48:21,817 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:48:21,839 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:48:21,839 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:48:21,839 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14] total 23 [2019-11-23 20:48:21,839 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796469502] [2019-11-23 20:48:21,840 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-11-23 20:48:21,840 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:48:21,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-11-23 20:48:21,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=412, Unknown=0, NotChecked=0, Total=506 [2019-11-23 20:48:21,840 INFO L87 Difference]: Start difference. First operand 109 states and 122 transitions. Second operand 23 states. [2019-11-23 20:48:23,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:48:23,395 INFO L93 Difference]: Finished difference Result 236 states and 265 transitions. [2019-11-23 20:48:23,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-11-23 20:48:23,401 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 39 [2019-11-23 20:48:23,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:48:23,402 INFO L225 Difference]: With dead ends: 236 [2019-11-23 20:48:23,402 INFO L226 Difference]: Without dead ends: 234 [2019-11-23 20:48:23,404 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 29 SyntacticMatches, 2 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1160 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=655, Invalid=3251, Unknown=0, NotChecked=0, Total=3906 [2019-11-23 20:48:23,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2019-11-23 20:48:23,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 127. [2019-11-23 20:48:23,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2019-11-23 20:48:23,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 143 transitions. [2019-11-23 20:48:23,416 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 143 transitions. Word has length 39 [2019-11-23 20:48:23,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:48:23,416 INFO L462 AbstractCegarLoop]: Abstraction has 127 states and 143 transitions. [2019-11-23 20:48:23,416 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-11-23 20:48:23,416 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 143 transitions. [2019-11-23 20:48:23,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-23 20:48:23,417 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:48:23,417 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:48:23,620 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:48:23,620 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:48:23,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:48:23,621 INFO L82 PathProgramCache]: Analyzing trace with hash -763915008, now seen corresponding path program 5 times [2019-11-23 20:48:23,621 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:48:23,621 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526556576] [2019-11-23 20:48:23,621 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:48:23,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:48:23,820 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 8 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:48:23,820 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526556576] [2019-11-23 20:48:23,821 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [382178678] [2019-11-23 20:48:23,821 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:48:23,862 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2019-11-23 20:48:23,862 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 20:48:23,863 INFO L255 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 27 conjunts are in the unsatisfiable core [2019-11-23 20:48:23,866 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:48:23,924 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 16 treesize of output 12 [2019-11-23 20:48:23,924 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:48:23,935 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:48:23,935 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:48:23,936 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2019-11-23 20:48:23,969 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:48:23,970 INFO L377 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 29 treesize of output 28 [2019-11-23 20:48:23,970 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:48:23,979 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:48:23,979 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:48:23,979 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:35, output treesize:31 [2019-11-23 20:48:24,061 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:48:24,063 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:48:24,065 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:48:24,067 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:48:24,067 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 37 [2019-11-23 20:48:24,068 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:48:24,077 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:48:24,077 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:48:24,077 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:41, output treesize:25 [2019-11-23 20:48:24,085 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:48:24,086 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:48:24,087 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:48:24,088 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:48:24,088 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 34 [2019-11-23 20:48:24,089 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:48:24,096 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:48:24,096 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:48:24,097 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:38, output treesize:34 [2019-11-23 20:48:24,137 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:48:24,138 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:48:24,139 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:48:24,140 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:48:24,141 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:48:24,142 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:48:24,142 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:48:24,143 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 40 [2019-11-23 20:48:24,143 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:48:24,148 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:48:24,148 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:48:24,149 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:38, output treesize:34 [2019-11-23 20:48:24,244 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:48:24,496 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:48:24,509 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 8 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:48:24,509 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:48:24,509 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 17] total 29 [2019-11-23 20:48:24,509 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869513648] [2019-11-23 20:48:24,510 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-11-23 20:48:24,510 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:48:24,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-11-23 20:48:24,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=721, Unknown=0, NotChecked=0, Total=812 [2019-11-23 20:48:24,511 INFO L87 Difference]: Start difference. First operand 127 states and 143 transitions. Second operand 29 states. [2019-11-23 20:48:26,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:48:26,226 INFO L93 Difference]: Finished difference Result 222 states and 244 transitions. [2019-11-23 20:48:26,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-11-23 20:48:26,227 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 45 [2019-11-23 20:48:26,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:48:26,228 INFO L225 Difference]: With dead ends: 222 [2019-11-23 20:48:26,229 INFO L226 Difference]: Without dead ends: 212 [2019-11-23 20:48:26,230 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 398 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=323, Invalid=2029, Unknown=0, NotChecked=0, Total=2352 [2019-11-23 20:48:26,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2019-11-23 20:48:26,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 149. [2019-11-23 20:48:26,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2019-11-23 20:48:26,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 168 transitions. [2019-11-23 20:48:26,242 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 168 transitions. Word has length 45 [2019-11-23 20:48:26,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:48:26,242 INFO L462 AbstractCegarLoop]: Abstraction has 149 states and 168 transitions. [2019-11-23 20:48:26,242 INFO L463 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-11-23 20:48:26,242 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 168 transitions. [2019-11-23 20:48:26,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-23 20:48:26,243 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:48:26,243 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:48:26,446 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:48:26,447 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:48:26,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:48:26,447 INFO L82 PathProgramCache]: Analyzing trace with hash -1865660864, now seen corresponding path program 2 times [2019-11-23 20:48:26,448 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:48:26,448 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412409920] [2019-11-23 20:48:26,448 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:48:26,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:48:26,620 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 8 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:48:26,620 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412409920] [2019-11-23 20:48:26,621 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [749315355] [2019-11-23 20:48:26,621 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:48:26,679 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-23 20:48:26,679 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 20:48:26,680 INFO L255 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 22 conjunts are in the unsatisfiable core [2019-11-23 20:48:26,683 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:48:26,811 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 16 treesize of output 12 [2019-11-23 20:48:26,811 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:48:26,824 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:48:26,825 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:48:26,825 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2019-11-23 20:48:26,866 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:48:26,867 INFO L377 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 23 treesize of output 22 [2019-11-23 20:48:26,867 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:48:26,876 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:48:26,877 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:48:26,877 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2019-11-23 20:48:27,137 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:48:27,155 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 8 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:48:27,155 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:48:27,156 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 24 [2019-11-23 20:48:27,156 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493592977] [2019-11-23 20:48:27,156 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-11-23 20:48:27,156 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:48:27,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-11-23 20:48:27,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=465, Unknown=0, NotChecked=0, Total=552 [2019-11-23 20:48:27,157 INFO L87 Difference]: Start difference. First operand 149 states and 168 transitions. Second operand 24 states. [2019-11-23 20:48:28,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:48:28,788 INFO L93 Difference]: Finished difference Result 320 states and 349 transitions. [2019-11-23 20:48:28,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-11-23 20:48:28,788 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 45 [2019-11-23 20:48:28,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:48:28,791 INFO L225 Difference]: With dead ends: 320 [2019-11-23 20:48:28,791 INFO L226 Difference]: Without dead ends: 310 [2019-11-23 20:48:28,793 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1215 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=567, Invalid=3465, Unknown=0, NotChecked=0, Total=4032 [2019-11-23 20:48:28,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2019-11-23 20:48:28,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 139. [2019-11-23 20:48:28,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2019-11-23 20:48:28,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 156 transitions. [2019-11-23 20:48:28,806 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 156 transitions. Word has length 45 [2019-11-23 20:48:28,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:48:28,806 INFO L462 AbstractCegarLoop]: Abstraction has 139 states and 156 transitions. [2019-11-23 20:48:28,806 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-11-23 20:48:28,807 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 156 transitions. [2019-11-23 20:48:28,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-23 20:48:28,807 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:48:28,807 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:48:29,010 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:48:29,011 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:48:29,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:48:29,011 INFO L82 PathProgramCache]: Analyzing trace with hash -1660044032, now seen corresponding path program 2 times [2019-11-23 20:48:29,012 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:48:29,012 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117824822] [2019-11-23 20:48:29,012 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:48:29,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:48:29,142 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 59 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:48:29,143 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117824822] [2019-11-23 20:48:29,143 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1845986501] [2019-11-23 20:48:29,143 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:48:29,191 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-23 20:48:29,191 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 20:48:29,192 INFO L255 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 30 conjunts are in the unsatisfiable core [2019-11-23 20:48:29,194 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:48:29,242 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 16 treesize of output 12 [2019-11-23 20:48:29,242 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:48:29,247 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:48:29,247 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:48:29,247 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2019-11-23 20:48:29,271 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:48:29,272 INFO L377 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 23 treesize of output 22 [2019-11-23 20:48:29,273 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:48:29,280 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:48:29,280 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:48:29,280 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2019-11-23 20:48:29,428 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:48:29,452 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 59 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:48:29,452 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:48:29,452 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 24 [2019-11-23 20:48:29,452 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378630264] [2019-11-23 20:48:29,453 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-11-23 20:48:29,453 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:48:29,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-11-23 20:48:29,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=461, Unknown=0, NotChecked=0, Total=552 [2019-11-23 20:48:29,453 INFO L87 Difference]: Start difference. First operand 139 states and 156 transitions. Second operand 24 states. [2019-11-23 20:48:31,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:48:31,973 INFO L93 Difference]: Finished difference Result 351 states and 394 transitions. [2019-11-23 20:48:31,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-11-23 20:48:31,975 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 45 [2019-11-23 20:48:31,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:48:31,977 INFO L225 Difference]: With dead ends: 351 [2019-11-23 20:48:31,978 INFO L226 Difference]: Without dead ends: 349 [2019-11-23 20:48:31,980 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2705 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1119, Invalid=6891, Unknown=0, NotChecked=0, Total=8010 [2019-11-23 20:48:31,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2019-11-23 20:48:31,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 145. [2019-11-23 20:48:31,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2019-11-23 20:48:31,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 162 transitions. [2019-11-23 20:48:31,992 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 162 transitions. Word has length 45 [2019-11-23 20:48:31,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:48:31,992 INFO L462 AbstractCegarLoop]: Abstraction has 145 states and 162 transitions. [2019-11-23 20:48:31,993 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-11-23 20:48:31,993 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 162 transitions. [2019-11-23 20:48:31,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-23 20:48:31,993 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:48:31,993 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:48:32,195 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:48:32,196 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:48:32,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:48:32,197 INFO L82 PathProgramCache]: Analyzing trace with hash 2077977331, now seen corresponding path program 6 times [2019-11-23 20:48:32,197 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:48:32,197 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994989412] [2019-11-23 20:48:32,198 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:48:32,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:48:32,405 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 10 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:48:32,405 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994989412] [2019-11-23 20:48:32,406 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1656692579] [2019-11-23 20:48:32,406 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:48:32,455 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2019-11-23 20:48:32,455 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 20:48:32,456 INFO L255 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 21 conjunts are in the unsatisfiable core [2019-11-23 20:48:32,458 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:48:32,487 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 13 treesize of output 9 [2019-11-23 20:48:32,488 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:48:32,493 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:48:32,493 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:48:32,494 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:9 [2019-11-23 20:48:32,638 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:48:32,647 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 10 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:48:32,647 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:48:32,647 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12] total 24 [2019-11-23 20:48:32,648 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213179423] [2019-11-23 20:48:32,649 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-11-23 20:48:32,650 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:48:32,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-11-23 20:48:32,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=483, Unknown=0, NotChecked=0, Total=552 [2019-11-23 20:48:32,650 INFO L87 Difference]: Start difference. First operand 145 states and 162 transitions. Second operand 24 states. [2019-11-23 20:48:33,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:48:33,898 INFO L93 Difference]: Finished difference Result 249 states and 272 transitions. [2019-11-23 20:48:33,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-11-23 20:48:33,900 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 51 [2019-11-23 20:48:33,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:48:33,902 INFO L225 Difference]: With dead ends: 249 [2019-11-23 20:48:33,902 INFO L226 Difference]: Without dead ends: 239 [2019-11-23 20:48:33,903 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 356 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=254, Invalid=1552, Unknown=0, NotChecked=0, Total=1806 [2019-11-23 20:48:33,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2019-11-23 20:48:33,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 151. [2019-11-23 20:48:33,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2019-11-23 20:48:33,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 168 transitions. [2019-11-23 20:48:33,916 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 168 transitions. Word has length 51 [2019-11-23 20:48:33,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:48:33,916 INFO L462 AbstractCegarLoop]: Abstraction has 151 states and 168 transitions. [2019-11-23 20:48:33,917 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-11-23 20:48:33,917 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 168 transitions. [2019-11-23 20:48:33,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-23 20:48:33,917 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:48:33,917 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:48:34,117 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:48:34,118 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:48:34,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:48:34,118 INFO L82 PathProgramCache]: Analyzing trace with hash -1816777677, now seen corresponding path program 3 times [2019-11-23 20:48:34,119 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:48:34,119 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074144479] [2019-11-23 20:48:34,119 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:48:34,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:48:34,251 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 46 proven. 17 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-11-23 20:48:34,251 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074144479] [2019-11-23 20:48:34,251 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2062647895] [2019-11-23 20:48:34,251 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:48:34,315 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-11-23 20:48:34,315 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 20:48:34,317 INFO L255 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 28 conjunts are in the unsatisfiable core [2019-11-23 20:48:34,318 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:48:34,349 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 13 treesize of output 9 [2019-11-23 20:48:34,349 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:48:34,350 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:48:34,350 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:48:34,351 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-11-23 20:48:34,467 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:48:34,503 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:48:34,503 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:48:34,503 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 23 [2019-11-23 20:48:34,503 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324029880] [2019-11-23 20:48:34,504 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-11-23 20:48:34,504 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:48:34,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-11-23 20:48:34,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=443, Unknown=0, NotChecked=0, Total=506 [2019-11-23 20:48:34,504 INFO L87 Difference]: Start difference. First operand 151 states and 168 transitions. Second operand 23 states. [2019-11-23 20:48:37,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:48:37,019 INFO L93 Difference]: Finished difference Result 380 states and 424 transitions. [2019-11-23 20:48:37,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-11-23 20:48:37,019 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 51 [2019-11-23 20:48:37,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:48:37,021 INFO L225 Difference]: With dead ends: 380 [2019-11-23 20:48:37,021 INFO L226 Difference]: Without dead ends: 334 [2019-11-23 20:48:37,025 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1089 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=680, Invalid=3610, Unknown=0, NotChecked=0, Total=4290 [2019-11-23 20:48:37,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2019-11-23 20:48:37,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 163. [2019-11-23 20:48:37,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-11-23 20:48:37,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 176 transitions. [2019-11-23 20:48:37,052 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 176 transitions. Word has length 51 [2019-11-23 20:48:37,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:48:37,052 INFO L462 AbstractCegarLoop]: Abstraction has 163 states and 176 transitions. [2019-11-23 20:48:37,053 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-11-23 20:48:37,053 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 176 transitions. [2019-11-23 20:48:37,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-11-23 20:48:37,053 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:48:37,053 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:48:37,261 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:48:37,262 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:48:37,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:48:37,262 INFO L82 PathProgramCache]: Analyzing trace with hash 349552294, now seen corresponding path program 7 times [2019-11-23 20:48:37,262 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:48:37,263 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328625791] [2019-11-23 20:48:37,263 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:48:37,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:48:37,730 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 83 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:48:37,730 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328625791] [2019-11-23 20:48:37,730 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [522507938] [2019-11-23 20:48:37,731 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:48:37,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:48:37,771 INFO L255 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 15 conjunts are in the unsatisfiable core [2019-11-23 20:48:37,772 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:48:37,830 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:48:37,831 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 20:48:37,832 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 20:48:38,082 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 114 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:48:38,082 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:48:38,082 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 25 [2019-11-23 20:48:38,082 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132215232] [2019-11-23 20:48:38,083 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-11-23 20:48:38,083 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:48:38,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-11-23 20:48:38,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=456, Unknown=0, NotChecked=0, Total=600 [2019-11-23 20:48:38,083 INFO L87 Difference]: Start difference. First operand 163 states and 176 transitions. Second operand 25 states. [2019-11-23 20:48:38,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:48:38,491 INFO L93 Difference]: Finished difference Result 328 states and 351 transitions. [2019-11-23 20:48:38,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-23 20:48:38,492 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 57 [2019-11-23 20:48:38,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:48:38,493 INFO L225 Difference]: With dead ends: 328 [2019-11-23 20:48:38,493 INFO L226 Difference]: Without dead ends: 199 [2019-11-23 20:48:38,494 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 205 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=222, Invalid=708, Unknown=0, NotChecked=0, Total=930 [2019-11-23 20:48:38,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2019-11-23 20:48:38,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 183. [2019-11-23 20:48:38,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2019-11-23 20:48:38,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 196 transitions. [2019-11-23 20:48:38,507 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 196 transitions. Word has length 57 [2019-11-23 20:48:38,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:48:38,508 INFO L462 AbstractCegarLoop]: Abstraction has 183 states and 196 transitions. [2019-11-23 20:48:38,508 INFO L463 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-11-23 20:48:38,508 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 196 transitions. [2019-11-23 20:48:38,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-11-23 20:48:38,508 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:48:38,508 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:48:38,709 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:48:38,709 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:48:38,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:48:38,710 INFO L82 PathProgramCache]: Analyzing trace with hash 399411226, now seen corresponding path program 8 times [2019-11-23 20:48:38,710 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:48:38,710 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695979824] [2019-11-23 20:48:38,711 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:48:38,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:48:38,991 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 12 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:48:38,992 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695979824] [2019-11-23 20:48:38,992 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [211938249] [2019-11-23 20:48:38,992 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:48:39,035 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-23 20:48:39,035 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 20:48:39,036 INFO L255 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 31 conjunts are in the unsatisfiable core [2019-11-23 20:48:39,037 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:48:39,157 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 16 treesize of output 12 [2019-11-23 20:48:39,158 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:48:39,170 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:48:39,171 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:48:39,171 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:25 [2019-11-23 20:48:39,204 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:48:39,205 INFO L377 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 29 treesize of output 28 [2019-11-23 20:48:39,205 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:48:39,217 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:48:39,218 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:48:39,218 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:41, output treesize:25 [2019-11-23 20:48:39,222 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:48:39,225 INFO L377 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 23 treesize of output 22 [2019-11-23 20:48:39,226 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:48:39,236 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:48:39,237 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:48:39,237 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:31 [2019-11-23 20:48:39,518 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:48:39,541 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 12 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:48:39,541 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:48:39,542 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17] total 32 [2019-11-23 20:48:39,542 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285177183] [2019-11-23 20:48:39,542 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-11-23 20:48:39,542 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:48:39,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-11-23 20:48:39,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=893, Unknown=0, NotChecked=0, Total=992 [2019-11-23 20:48:39,543 INFO L87 Difference]: Start difference. First operand 183 states and 196 transitions. Second operand 32 states. [2019-11-23 20:48:41,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:48:41,939 INFO L93 Difference]: Finished difference Result 258 states and 278 transitions. [2019-11-23 20:48:41,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-11-23 20:48:41,939 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 62 [2019-11-23 20:48:41,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:48:41,941 INFO L225 Difference]: With dead ends: 258 [2019-11-23 20:48:41,941 INFO L226 Difference]: Without dead ends: 248 [2019-11-23 20:48:41,943 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 766 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=444, Invalid=3216, Unknown=0, NotChecked=0, Total=3660 [2019-11-23 20:48:41,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2019-11-23 20:48:41,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 189. [2019-11-23 20:48:41,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2019-11-23 20:48:41,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 202 transitions. [2019-11-23 20:48:41,963 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 202 transitions. Word has length 62 [2019-11-23 20:48:41,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:48:41,964 INFO L462 AbstractCegarLoop]: Abstraction has 189 states and 202 transitions. [2019-11-23 20:48:41,964 INFO L463 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-11-23 20:48:41,964 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 202 transitions. [2019-11-23 20:48:41,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-11-23 20:48:41,965 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:48:41,965 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:48:42,174 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:48:42,174 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:48:42,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:48:42,175 INFO L82 PathProgramCache]: Analyzing trace with hash 1296102616, now seen corresponding path program 4 times [2019-11-23 20:48:42,175 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:48:42,176 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206479954] [2019-11-23 20:48:42,176 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:48:42,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:48:42,419 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 12 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:48:42,419 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206479954] [2019-11-23 20:48:42,419 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1315153555] [2019-11-23 20:48:42,419 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:48:42,464 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-23 20:48:42,464 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 20:48:42,465 INFO L255 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 31 conjunts are in the unsatisfiable core [2019-11-23 20:48:42,466 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:48:42,575 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 16 treesize of output 12 [2019-11-23 20:48:42,575 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:48:42,585 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:48:42,586 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:48:42,586 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:29, output treesize:22 [2019-11-23 20:48:42,616 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:48:42,617 INFO L377 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 29 treesize of output 28 [2019-11-23 20:48:42,618 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:48:42,630 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:48:42,631 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:48:42,631 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:41, output treesize:43 [2019-11-23 20:48:42,668 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:48:42,669 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:48:42,670 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:48:42,671 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:48:42,671 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 37 [2019-11-23 20:48:42,672 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:48:42,681 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:48:42,682 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:48:42,682 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:44, output treesize:40 [2019-11-23 20:48:42,994 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:48:43,015 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 12 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:48:43,015 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:48:43,016 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 31 [2019-11-23 20:48:43,016 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69683942] [2019-11-23 20:48:43,016 INFO L442 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-11-23 20:48:43,016 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:48:43,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-11-23 20:48:43,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=832, Unknown=0, NotChecked=0, Total=930 [2019-11-23 20:48:43,017 INFO L87 Difference]: Start difference. First operand 189 states and 202 transitions. Second operand 31 states. [2019-11-23 20:48:46,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:48:46,323 INFO L93 Difference]: Finished difference Result 339 states and 361 transitions. [2019-11-23 20:48:46,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-11-23 20:48:46,324 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 62 [2019-11-23 20:48:46,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:48:46,325 INFO L225 Difference]: With dead ends: 339 [2019-11-23 20:48:46,325 INFO L226 Difference]: Without dead ends: 329 [2019-11-23 20:48:46,326 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 49 SyntacticMatches, 2 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1448 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=609, Invalid=4941, Unknown=0, NotChecked=0, Total=5550 [2019-11-23 20:48:46,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2019-11-23 20:48:46,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 195. [2019-11-23 20:48:46,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2019-11-23 20:48:46,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 208 transitions. [2019-11-23 20:48:46,343 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 208 transitions. Word has length 62 [2019-11-23 20:48:46,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:48:46,343 INFO L462 AbstractCegarLoop]: Abstraction has 195 states and 208 transitions. [2019-11-23 20:48:46,343 INFO L463 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-11-23 20:48:46,343 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 208 transitions. [2019-11-23 20:48:46,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-11-23 20:48:46,344 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:48:46,344 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:48:46,547 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:48:46,547 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:48:46,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:48:46,548 INFO L82 PathProgramCache]: Analyzing trace with hash 1236463958, now seen corresponding path program 3 times [2019-11-23 20:48:46,548 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:48:46,548 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863964038] [2019-11-23 20:48:46,548 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:48:46,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:48:46,737 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 42 proven. 20 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2019-11-23 20:48:46,738 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863964038] [2019-11-23 20:48:46,738 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [274504347] [2019-11-23 20:48:46,738 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:48:46,830 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2019-11-23 20:48:46,830 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 20:48:46,831 INFO L255 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 25 conjunts are in the unsatisfiable core [2019-11-23 20:48:46,833 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:48:46,846 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 16 treesize of output 12 [2019-11-23 20:48:46,846 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:48:46,852 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:48:46,852 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:48:46,853 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2019-11-23 20:48:46,882 INFO L343 Elim1Store]: treesize reduction 42, result has 22.2 percent of original size [2019-11-23 20:48:46,882 INFO L377 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 1 case distinctions, treesize of input 29 treesize of output 28 [2019-11-23 20:48:46,883 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:48:46,891 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:48:46,891 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:48:46,891 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:35, output treesize:31 [2019-11-23 20:48:46,956 INFO L343 Elim1Store]: treesize reduction 76, result has 20.0 percent of original size [2019-11-23 20:48:46,956 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 37 [2019-11-23 20:48:46,957 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:48:46,967 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:48:46,967 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:48:46,967 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:41, output treesize:25 [2019-11-23 20:48:47,006 INFO L343 Elim1Store]: treesize reduction 44, result has 53.7 percent of original size [2019-11-23 20:48:47,007 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 69 [2019-11-23 20:48:47,008 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:48:47,034 INFO L567 ElimStorePlain]: treesize reduction 32, result has 53.6 percent of original size [2019-11-23 20:48:47,034 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:48:47,034 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:41, output treesize:37 [2019-11-23 20:48:47,117 INFO L343 Elim1Store]: treesize reduction 115, result has 35.4 percent of original size [2019-11-23 20:48:47,117 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 47 treesize of output 84 [2019-11-23 20:48:47,118 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:48:47,151 INFO L567 ElimStorePlain]: treesize reduction 32, result has 60.5 percent of original size [2019-11-23 20:48:47,152 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-23 20:48:47,152 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:53, output treesize:49 [2019-11-23 20:48:49,604 WARN L192 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 32 [2019-11-23 20:48:49,993 WARN L192 SmtUtils]: Spent 354.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2019-11-23 20:48:50,230 WARN L192 SmtUtils]: Spent 190.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2019-11-23 20:48:52,019 WARN L192 SmtUtils]: Spent 1.75 s on a formula simplification that was a NOOP. DAG size: 35 [2019-11-23 20:48:52,290 WARN L192 SmtUtils]: Spent 235.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2019-11-23 20:48:53,621 WARN L192 SmtUtils]: Spent 1.29 s on a formula simplification that was a NOOP. DAG size: 34 [2019-11-23 20:48:53,622 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:48:53,665 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 60 proven. 62 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-11-23 20:48:53,665 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:48:53,665 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 16] total 23 [2019-11-23 20:48:53,666 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529077236] [2019-11-23 20:48:53,666 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-11-23 20:48:53,666 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:48:53,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-11-23 20:48:53,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=436, Unknown=0, NotChecked=0, Total=506 [2019-11-23 20:48:53,666 INFO L87 Difference]: Start difference. First operand 195 states and 208 transitions. Second operand 23 states. [2019-11-23 20:49:02,557 WARN L192 SmtUtils]: Spent 3.15 s on a formula simplification. DAG size of input: 43 DAG size of output: 41 [2019-11-23 20:49:07,488 WARN L192 SmtUtils]: Spent 2.89 s on a formula simplification. DAG size of input: 43 DAG size of output: 41 [2019-11-23 20:49:09,571 WARN L192 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 39 [2019-11-23 20:49:11,744 WARN L192 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 43 [2019-11-23 20:49:12,817 WARN L192 SmtUtils]: Spent 1.04 s on a formula simplification that was a NOOP. DAG size: 45 [2019-11-23 20:49:15,840 WARN L192 SmtUtils]: Spent 2.96 s on a formula simplification. DAG size of input: 52 DAG size of output: 43 [2019-11-23 20:49:18,256 WARN L192 SmtUtils]: Spent 2.36 s on a formula simplification. DAG size of input: 47 DAG size of output: 44 [2019-11-23 20:49:19,051 WARN L192 SmtUtils]: Spent 729.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 44 [2019-11-23 20:49:21,658 WARN L192 SmtUtils]: Spent 2.57 s on a formula simplification. DAG size of input: 49 DAG size of output: 46 [2019-11-23 20:49:24,846 WARN L192 SmtUtils]: Spent 3.13 s on a formula simplification. DAG size of input: 47 DAG size of output: 45 [2019-11-23 20:49:28,810 WARN L192 SmtUtils]: Spent 3.94 s on a formula simplification. DAG size of input: 49 DAG size of output: 47 [2019-11-23 20:49:28,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:49:28,828 INFO L93 Difference]: Finished difference Result 261 states and 278 transitions. [2019-11-23 20:49:28,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-11-23 20:49:28,829 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 62 [2019-11-23 20:49:28,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:49:28,830 INFO L225 Difference]: With dead ends: 261 [2019-11-23 20:49:28,830 INFO L226 Difference]: Without dead ends: 215 [2019-11-23 20:49:28,831 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 52 SyntacticMatches, 5 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 307 ImplicationChecksByTransitivity, 37.8s TimeCoverageRelationStatistics Valid=266, Invalid=1292, Unknown=2, NotChecked=0, Total=1560 [2019-11-23 20:49:28,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2019-11-23 20:49:28,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 195. [2019-11-23 20:49:28,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2019-11-23 20:49:28,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 205 transitions. [2019-11-23 20:49:28,852 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 205 transitions. Word has length 62 [2019-11-23 20:49:28,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:49:28,852 INFO L462 AbstractCegarLoop]: Abstraction has 195 states and 205 transitions. [2019-11-23 20:49:28,852 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-11-23 20:49:28,852 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 205 transitions. [2019-11-23 20:49:28,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-11-23 20:49:28,853 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:49:28,853 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 5, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:49:29,057 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:49:29,057 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:49:29,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:49:29,057 INFO L82 PathProgramCache]: Analyzing trace with hash -2028587694, now seen corresponding path program 4 times [2019-11-23 20:49:29,057 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:49:29,057 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853506624] [2019-11-23 20:49:29,058 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:49:29,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:49:29,279 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 12 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:49:29,280 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853506624] [2019-11-23 20:49:29,280 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1263462754] [2019-11-23 20:49:29,280 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:49:29,329 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-23 20:49:29,329 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 20:49:29,331 INFO L255 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 29 conjunts are in the unsatisfiable core [2019-11-23 20:49:29,332 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:49:29,459 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 16 treesize of output 12 [2019-11-23 20:49:29,459 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:49:29,468 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:49:29,469 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:49:29,469 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2019-11-23 20:49:29,499 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:49:29,500 INFO L377 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 29 treesize of output 28 [2019-11-23 20:49:29,500 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:49:29,508 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:49:29,509 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:49:29,509 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:35, output treesize:31 [2019-11-23 20:49:29,549 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:49:29,550 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:49:29,550 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:49:29,551 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:49:29,551 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 34 [2019-11-23 20:49:29,552 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:49:29,561 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:49:29,561 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:49:29,561 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:35, output treesize:31 [2019-11-23 20:49:29,856 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:49:29,880 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 12 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:49:29,881 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:49:29,881 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 18] total 31 [2019-11-23 20:49:29,881 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496129696] [2019-11-23 20:49:29,881 INFO L442 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-11-23 20:49:29,881 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:49:29,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-11-23 20:49:29,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=813, Unknown=0, NotChecked=0, Total=930 [2019-11-23 20:49:29,882 INFO L87 Difference]: Start difference. First operand 195 states and 205 transitions. Second operand 31 states. [2019-11-23 20:49:32,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:49:32,581 INFO L93 Difference]: Finished difference Result 340 states and 365 transitions. [2019-11-23 20:49:32,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-11-23 20:49:32,581 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 62 [2019-11-23 20:49:32,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:49:32,582 INFO L225 Difference]: With dead ends: 340 [2019-11-23 20:49:32,582 INFO L226 Difference]: Without dead ends: 330 [2019-11-23 20:49:32,584 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 48 SyntacticMatches, 2 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2058 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=723, Invalid=5757, Unknown=0, NotChecked=0, Total=6480 [2019-11-23 20:49:32,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2019-11-23 20:49:32,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 201. [2019-11-23 20:49:32,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2019-11-23 20:49:32,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 211 transitions. [2019-11-23 20:49:32,606 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 211 transitions. Word has length 62 [2019-11-23 20:49:32,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:49:32,607 INFO L462 AbstractCegarLoop]: Abstraction has 201 states and 211 transitions. [2019-11-23 20:49:32,607 INFO L463 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-11-23 20:49:32,607 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 211 transitions. [2019-11-23 20:49:32,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-11-23 20:49:32,608 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:49:32,608 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 5, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:49:32,811 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:49:32,812 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:49:32,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:49:32,813 INFO L82 PathProgramCache]: Analyzing trace with hash 417581204, now seen corresponding path program 2 times [2019-11-23 20:49:32,813 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:49:32,814 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939779675] [2019-11-23 20:49:32,814 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:49:32,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:49:33,098 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 13 proven. 17 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2019-11-23 20:49:33,098 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939779675] [2019-11-23 20:49:33,098 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [365618324] [2019-11-23 20:49:33,098 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:49:33,147 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-23 20:49:33,147 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 20:49:33,148 INFO L255 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 39 conjunts are in the unsatisfiable core [2019-11-23 20:49:33,149 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:49:33,204 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 16 treesize of output 12 [2019-11-23 20:49:33,205 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:49:33,211 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:49:33,211 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:49:33,212 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2019-11-23 20:49:33,235 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:49:33,235 INFO L377 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 29 treesize of output 28 [2019-11-23 20:49:33,236 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:49:33,253 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:49:33,253 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:49:33,253 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:35, output treesize:31 [2019-11-23 20:49:33,285 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:49:33,286 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:49:33,287 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:49:33,288 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:49:33,288 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 34 [2019-11-23 20:49:33,289 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:49:33,296 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:49:33,296 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:49:33,296 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:35, output treesize:31 [2019-11-23 20:49:33,523 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:49:33,573 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:49:33,573 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:49:33,573 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 18] total 26 [2019-11-23 20:49:33,573 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509289400] [2019-11-23 20:49:33,574 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-11-23 20:49:33,574 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:49:33,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-11-23 20:49:33,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=555, Unknown=0, NotChecked=0, Total=650 [2019-11-23 20:49:33,574 INFO L87 Difference]: Start difference. First operand 201 states and 211 transitions. Second operand 26 states. [2019-11-23 20:49:35,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:49:35,964 INFO L93 Difference]: Finished difference Result 329 states and 349 transitions. [2019-11-23 20:49:35,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-11-23 20:49:35,964 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 62 [2019-11-23 20:49:35,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:49:35,966 INFO L225 Difference]: With dead ends: 329 [2019-11-23 20:49:35,966 INFO L226 Difference]: Without dead ends: 289 [2019-11-23 20:49:35,967 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 47 SyntacticMatches, 9 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 842 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=501, Invalid=2921, Unknown=0, NotChecked=0, Total=3422 [2019-11-23 20:49:35,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2019-11-23 20:49:35,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 207. [2019-11-23 20:49:35,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2019-11-23 20:49:35,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 217 transitions. [2019-11-23 20:49:35,989 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 217 transitions. Word has length 62 [2019-11-23 20:49:35,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:49:35,989 INFO L462 AbstractCegarLoop]: Abstraction has 207 states and 217 transitions. [2019-11-23 20:49:35,989 INFO L463 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-11-23 20:49:35,989 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 217 transitions. [2019-11-23 20:49:35,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-11-23 20:49:35,990 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:49:35,990 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:49:36,193 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:49:36,193 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:49:36,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:49:36,194 INFO L82 PathProgramCache]: Analyzing trace with hash -766369139, now seen corresponding path program 9 times [2019-11-23 20:49:36,194 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:49:36,194 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080050902] [2019-11-23 20:49:36,195 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:49:36,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:49:36,470 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 14 proven. 158 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:49:36,471 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080050902] [2019-11-23 20:49:36,471 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1481531555] [2019-11-23 20:49:36,471 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:49:36,559 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2019-11-23 20:49:36,559 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 20:49:36,560 INFO L255 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 32 conjunts are in the unsatisfiable core [2019-11-23 20:49:36,561 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:49:36,651 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 16 treesize of output 12 [2019-11-23 20:49:36,651 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:49:36,660 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:49:36,660 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:49:36,661 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2019-11-23 20:49:36,700 INFO L343 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-11-23 20:49:36,701 INFO L377 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 1 case distinctions, treesize of input 23 treesize of output 22 [2019-11-23 20:49:36,702 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:49:36,714 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:49:36,715 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:49:36,715 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:29, output treesize:28 [2019-11-23 20:49:37,051 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:49:37,124 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 14 proven. 158 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:49:37,124 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:49:37,124 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 17] total 34 [2019-11-23 20:49:37,125 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947072866] [2019-11-23 20:49:37,125 INFO L442 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-11-23 20:49:37,125 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:49:37,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-11-23 20:49:37,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=1017, Unknown=0, NotChecked=0, Total=1122 [2019-11-23 20:49:37,126 INFO L87 Difference]: Start difference. First operand 207 states and 217 transitions. Second operand 34 states. [2019-11-23 20:49:40,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:49:40,297 INFO L93 Difference]: Finished difference Result 332 states and 351 transitions. [2019-11-23 20:49:40,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-11-23 20:49:40,298 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 68 [2019-11-23 20:49:40,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:49:40,300 INFO L225 Difference]: With dead ends: 332 [2019-11-23 20:49:40,300 INFO L226 Difference]: Without dead ends: 322 [2019-11-23 20:49:40,301 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1418 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=638, Invalid=5214, Unknown=0, NotChecked=0, Total=5852 [2019-11-23 20:49:40,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2019-11-23 20:49:40,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 213. [2019-11-23 20:49:40,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2019-11-23 20:49:40,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 223 transitions. [2019-11-23 20:49:40,318 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 223 transitions. Word has length 68 [2019-11-23 20:49:40,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:49:40,318 INFO L462 AbstractCegarLoop]: Abstraction has 213 states and 223 transitions. [2019-11-23 20:49:40,318 INFO L463 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-11-23 20:49:40,318 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 223 transitions. [2019-11-23 20:49:40,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-11-23 20:49:40,319 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:49:40,319 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 5, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:49:40,522 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:49:40,522 INFO L410 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:49:40,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:49:40,523 INFO L82 PathProgramCache]: Analyzing trace with hash 237209803, now seen corresponding path program 5 times [2019-11-23 20:49:40,523 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:49:40,523 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452461001] [2019-11-23 20:49:40,523 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:49:40,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:49:40,781 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 14 proven. 158 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:49:40,782 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452461001] [2019-11-23 20:49:40,782 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1300485969] [2019-11-23 20:49:40,782 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:49:40,920 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2019-11-23 20:49:40,920 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 20:49:40,922 INFO L255 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 30 conjunts are in the unsatisfiable core [2019-11-23 20:49:40,924 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:49:41,048 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 16 treesize of output 12 [2019-11-23 20:49:41,049 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:49:41,058 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:49:41,058 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:49:41,058 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2019-11-23 20:49:41,093 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:49:41,093 INFO L377 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 23 treesize of output 22 [2019-11-23 20:49:41,094 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:49:41,100 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:49:41,100 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:49:41,100 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2019-11-23 20:49:41,419 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:49:41,437 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 14 proven. 158 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:49:41,437 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:49:41,437 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 18] total 32 [2019-11-23 20:49:41,437 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398131914] [2019-11-23 20:49:41,437 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-11-23 20:49:41,438 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:49:41,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-11-23 20:49:41,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=875, Unknown=0, NotChecked=0, Total=992 [2019-11-23 20:49:41,438 INFO L87 Difference]: Start difference. First operand 213 states and 223 transitions. Second operand 32 states. [2019-11-23 20:49:44,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:49:44,836 INFO L93 Difference]: Finished difference Result 428 states and 453 transitions. [2019-11-23 20:49:44,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2019-11-23 20:49:44,837 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 68 [2019-11-23 20:49:44,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:49:44,839 INFO L225 Difference]: With dead ends: 428 [2019-11-23 20:49:44,840 INFO L226 Difference]: Without dead ends: 418 [2019-11-23 20:49:44,841 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3864 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=1131, Invalid=10211, Unknown=0, NotChecked=0, Total=11342 [2019-11-23 20:49:44,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2019-11-23 20:49:44,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 219. [2019-11-23 20:49:44,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2019-11-23 20:49:44,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 229 transitions. [2019-11-23 20:49:44,862 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 229 transitions. Word has length 68 [2019-11-23 20:49:44,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:49:44,863 INFO L462 AbstractCegarLoop]: Abstraction has 219 states and 229 transitions. [2019-11-23 20:49:44,863 INFO L463 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-11-23 20:49:44,863 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 229 transitions. [2019-11-23 20:49:44,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-11-23 20:49:44,863 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:49:44,864 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 5, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:49:45,067 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:49:45,068 INFO L410 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:49:45,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:49:45,068 INFO L82 PathProgramCache]: Analyzing trace with hash -1732180539, now seen corresponding path program 5 times [2019-11-23 20:49:45,068 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:49:45,068 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101869165] [2019-11-23 20:49:45,069 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:49:45,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:49:45,313 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 0 proven. 172 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:49:45,314 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101869165] [2019-11-23 20:49:45,314 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1267584902] [2019-11-23 20:49:45,314 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:49:45,425 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2019-11-23 20:49:45,425 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 20:49:45,427 INFO L255 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 39 conjunts are in the unsatisfiable core [2019-11-23 20:49:45,428 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:49:45,516 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 16 treesize of output 12 [2019-11-23 20:49:45,516 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:49:45,522 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:49:45,522 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:49:45,522 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2019-11-23 20:49:45,552 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:49:45,553 INFO L377 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 23 treesize of output 22 [2019-11-23 20:49:45,553 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:49:45,558 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:49:45,558 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:49:45,559 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2019-11-23 20:49:45,847 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:49:45,883 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 0 proven. 172 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:49:45,884 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:49:45,884 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 18] total 32 [2019-11-23 20:49:45,884 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294118552] [2019-11-23 20:49:45,884 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-11-23 20:49:45,884 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:49:45,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-11-23 20:49:45,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=866, Unknown=0, NotChecked=0, Total=992 [2019-11-23 20:49:45,885 INFO L87 Difference]: Start difference. First operand 219 states and 229 transitions. Second operand 32 states.