/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc config/AutomizerReach.xml -s config/svcomp-Reach-64bit-Automizer_Default.epf -i ../sv-benchmarks/c/loops/insertion_sort-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-178dd20 [2021-01-06 16:37:11,639 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-01-06 16:37:11,641 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-01-06 16:37:11,695 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-01-06 16:37:11,696 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-01-06 16:37:11,700 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-01-06 16:37:11,703 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-01-06 16:37:11,708 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-01-06 16:37:11,720 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-01-06 16:37:11,726 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-01-06 16:37:11,730 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-01-06 16:37:11,731 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-01-06 16:37:11,732 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-01-06 16:37:11,735 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-01-06 16:37:11,736 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-01-06 16:37:11,738 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-01-06 16:37:11,739 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-01-06 16:37:11,742 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-01-06 16:37:11,749 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-01-06 16:37:11,756 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-01-06 16:37:11,758 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-01-06 16:37:11,760 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-01-06 16:37:11,761 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-01-06 16:37:11,764 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-01-06 16:37:11,772 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-01-06 16:37:11,772 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-01-06 16:37:11,772 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-01-06 16:37:11,774 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-01-06 16:37:11,775 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-01-06 16:37:11,776 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-01-06 16:37:11,776 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-01-06 16:37:11,777 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-01-06 16:37:11,779 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-01-06 16:37:11,779 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-01-06 16:37:11,780 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-01-06 16:37:11,781 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-01-06 16:37:11,781 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-01-06 16:37:11,788 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-01-06 16:37:11,788 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-01-06 16:37:11,789 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-01-06 16:37:11,790 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-01-06 16:37:11,795 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-01-06 16:37:11,839 INFO L113 SettingsManager]: Loading preferences was successful [2021-01-06 16:37:11,839 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-01-06 16:37:11,843 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-01-06 16:37:11,844 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-01-06 16:37:11,844 INFO L138 SettingsManager]: * Use SBE=true [2021-01-06 16:37:11,844 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-01-06 16:37:11,844 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-01-06 16:37:11,844 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-01-06 16:37:11,845 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-01-06 16:37:11,845 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-01-06 16:37:11,846 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-01-06 16:37:11,846 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-01-06 16:37:11,846 INFO L138 SettingsManager]: * Use constant arrays=true [2021-01-06 16:37:11,847 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-01-06 16:37:11,847 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-01-06 16:37:11,847 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-01-06 16:37:11,847 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-01-06 16:37:11,847 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-06 16:37:11,848 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-01-06 16:37:11,848 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-01-06 16:37:11,848 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-01-06 16:37:11,848 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-01-06 16:37:11,848 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-01-06 16:37:11,849 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-01-06 16:37:11,849 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-01-06 16:37:11,849 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-01-06 16:37:12,277 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-01-06 16:37:12,305 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-01-06 16:37:12,308 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-01-06 16:37:12,309 INFO L271 PluginConnector]: Initializing CDTParser... [2021-01-06 16:37:12,310 INFO L275 PluginConnector]: CDTParser initialized [2021-01-06 16:37:12,311 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loops/insertion_sort-1.c [2021-01-06 16:37:12,395 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/ce56efd9b/530f60368f784f429d63a13ee65b019b/FLAGace234829 [2021-01-06 16:37:12,929 INFO L306 CDTParser]: Found 1 translation units. [2021-01-06 16:37:12,929 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/loops/insertion_sort-1.c [2021-01-06 16:37:12,936 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/ce56efd9b/530f60368f784f429d63a13ee65b019b/FLAGace234829 [2021-01-06 16:37:13,308 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/ce56efd9b/530f60368f784f429d63a13ee65b019b [2021-01-06 16:37:13,311 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-01-06 16:37:13,314 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-01-06 16:37:13,319 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-01-06 16:37:13,319 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-01-06 16:37:13,323 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-01-06 16:37:13,324 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 04:37:13" (1/1) ... [2021-01-06 16:37:13,326 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@706f4739 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 04:37:13, skipping insertion in model container [2021-01-06 16:37:13,326 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 04:37:13" (1/1) ... [2021-01-06 16:37:13,337 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-01-06 16:37:13,356 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-01-06 16:37:13,507 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/loops/insertion_sort-1.c[328,341] left hand side expression in assignment: lhs: VariableLHS[~j~0,] left hand side expression in assignment: lhs: ArrayLHS[VariableLHS[~v~0,],[IdentifierExpression[~j~0,]]] left hand side expression in assignment: lhs: VariableLHS[~j~0,] left hand side expression in assignment: lhs: VariableLHS[~key~0,] left hand side expression in assignment: lhs: VariableLHS[~i~0,] left hand side expression in assignment: lhs: ArrayLHS[VariableLHS[~v~0,],[BinaryExpression[ARITHPLUS,IntegerLiteral[1],IdentifierExpression[~i~0,]]]] left hand side expression in assignment: lhs: VariableLHS[~i~0,] left hand side expression in assignment: lhs: ArrayLHS[VariableLHS[~v~0,],[BinaryExpression[ARITHPLUS,IntegerLiteral[1],IdentifierExpression[~i~0,]]]] left hand side expression in assignment: lhs: VariableLHS[~k~0,] [2021-01-06 16:37:13,537 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 16:37:13,546 INFO L203 MainTranslator]: Completed pre-run [2021-01-06 16:37:13,559 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/loops/insertion_sort-1.c[328,341] left hand side expression in assignment: lhs: VariableLHS[~j~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#v~0,],base],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[~#v~0,],offset],BinaryExpression[ARITHMUL,IntegerLiteral[4],IdentifierExpression[~j~0,]]]]] left hand side expression in assignment: lhs: VariableLHS[~j~0,] left hand side expression in assignment: lhs: VariableLHS[~key~0,] left hand side expression in assignment: lhs: VariableLHS[~i~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#v~0,],base],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[~#v~0,],offset],BinaryExpression[ARITHMUL,IntegerLiteral[4],BinaryExpression[ARITHPLUS,IntegerLiteral[1],IdentifierExpression[~i~0,]]]]]] left hand side expression in assignment: lhs: VariableLHS[~i~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#v~0,],base],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[~#v~0,],offset],BinaryExpression[ARITHMUL,IntegerLiteral[4],BinaryExpression[ARITHPLUS,IntegerLiteral[1],IdentifierExpression[~i~0,]]]]]] left hand side expression in assignment: lhs: VariableLHS[~k~0,] [2021-01-06 16:37:13,570 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 16:37:13,586 INFO L208 MainTranslator]: Completed translation [2021-01-06 16:37:13,587 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 04:37:13 WrapperNode [2021-01-06 16:37:13,587 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-01-06 16:37:13,588 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-01-06 16:37:13,588 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-01-06 16:37:13,588 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-01-06 16:37:13,597 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 04:37:13" (1/1) ... [2021-01-06 16:37:13,618 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 04:37:13" (1/1) ... [2021-01-06 16:37:13,653 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-01-06 16:37:13,656 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-01-06 16:37:13,657 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-01-06 16:37:13,657 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-01-06 16:37:13,667 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 04:37:13" (1/1) ... [2021-01-06 16:37:13,667 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 04:37:13" (1/1) ... [2021-01-06 16:37:13,673 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 04:37:13" (1/1) ... [2021-01-06 16:37:13,673 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 04:37:13" (1/1) ... [2021-01-06 16:37:13,693 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 04:37:13" (1/1) ... [2021-01-06 16:37:13,700 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 04:37:13" (1/1) ... [2021-01-06 16:37:13,708 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 04:37:13" (1/1) ... [2021-01-06 16:37:13,713 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-01-06 16:37:13,717 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-01-06 16:37:13,717 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-01-06 16:37:13,717 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-01-06 16:37:13,718 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 04:37:13" (1/1) ... No working directory specified, using /storage/repos/ultimate-bitabs/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 [2021-01-06 16:37:13,812 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-01-06 16:37:13,812 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-01-06 16:37:13,812 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-01-06 16:37:13,812 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-01-06 16:37:13,813 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-01-06 16:37:13,813 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-01-06 16:37:13,813 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-01-06 16:37:14,080 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-01-06 16:37:14,080 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-01-06 16:37:14,082 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 04:37:14 BoogieIcfgContainer [2021-01-06 16:37:14,082 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-01-06 16:37:14,084 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-01-06 16:37:14,084 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-01-06 16:37:14,087 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-01-06 16:37:14,088 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.01 04:37:13" (1/3) ... [2021-01-06 16:37:14,089 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ff53d3b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 04:37:14, skipping insertion in model container [2021-01-06 16:37:14,089 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 04:37:13" (2/3) ... [2021-01-06 16:37:14,089 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ff53d3b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 04:37:14, skipping insertion in model container [2021-01-06 16:37:14,089 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 04:37:14" (3/3) ... [2021-01-06 16:37:14,091 INFO L111 eAbstractionObserver]: Analyzing ICFG insertion_sort-1.c [2021-01-06 16:37:14,125 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-01-06 16:37:14,133 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2021-01-06 16:37:14,171 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-01-06 16:37:14,200 INFO L377 AbstractCegarLoop]: Interprodecural is true [2021-01-06 16:37:14,200 INFO L378 AbstractCegarLoop]: Hoare is true [2021-01-06 16:37:14,200 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-01-06 16:37:14,200 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-01-06 16:37:14,200 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-01-06 16:37:14,201 INFO L382 AbstractCegarLoop]: Difference is false [2021-01-06 16:37:14,201 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-01-06 16:37:14,201 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-01-06 16:37:14,217 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states. [2021-01-06 16:37:14,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-01-06 16:37:14,223 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 16:37:14,224 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 16:37:14,225 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 16:37:14,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 16:37:14,232 INFO L82 PathProgramCache]: Analyzing trace with hash -2015618667, now seen corresponding path program 1 times [2021-01-06 16:37:14,243 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 16:37:14,243 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136937096] [2021-01-06 16:37:14,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 16:37:14,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:37:14,525 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 16:37:14,526 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136937096] [2021-01-06 16:37:14,527 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 16:37:14,527 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 16:37:14,528 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057453742] [2021-01-06 16:37:14,532 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 16:37:14,533 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 16:37:14,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 16:37:14,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-01-06 16:37:14,549 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 5 states. [2021-01-06 16:37:14,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 16:37:14,625 INFO L93 Difference]: Finished difference Result 54 states and 77 transitions. [2021-01-06 16:37:14,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-06 16:37:14,627 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2021-01-06 16:37:14,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 16:37:14,636 INFO L225 Difference]: With dead ends: 54 [2021-01-06 16:37:14,636 INFO L226 Difference]: Without dead ends: 22 [2021-01-06 16:37:14,639 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-01-06 16:37:14,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2021-01-06 16:37:14,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2021-01-06 16:37:14,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2021-01-06 16:37:14,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 26 transitions. [2021-01-06 16:37:14,675 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 26 transitions. Word has length 9 [2021-01-06 16:37:14,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 16:37:14,675 INFO L481 AbstractCegarLoop]: Abstraction has 21 states and 26 transitions. [2021-01-06 16:37:14,675 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 16:37:14,675 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 26 transitions. [2021-01-06 16:37:14,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-01-06 16:37:14,676 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 16:37:14,676 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 16:37:14,677 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-01-06 16:37:14,677 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 16:37:14,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 16:37:14,678 INFO L82 PathProgramCache]: Analyzing trace with hash 1565476563, now seen corresponding path program 1 times [2021-01-06 16:37:14,678 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 16:37:14,679 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537291258] [2021-01-06 16:37:14,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 16:37:14,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:37:14,884 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 16:37:14,884 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537291258] [2021-01-06 16:37:14,885 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [482941582] [2021-01-06 16:37:14,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/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 [2021-01-06 16:37:14,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:37:14,948 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 8 conjunts are in the unsatisfiable core [2021-01-06 16:37:14,954 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 16:37:15,063 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 16:37:15,064 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 16:37:15,064 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2021-01-06 16:37:15,065 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157133655] [2021-01-06 16:37:15,066 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-01-06 16:37:15,067 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 16:37:15,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-01-06 16:37:15,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-01-06 16:37:15,068 INFO L87 Difference]: Start difference. First operand 21 states and 26 transitions. Second operand 7 states. [2021-01-06 16:37:15,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 16:37:15,159 INFO L93 Difference]: Finished difference Result 51 states and 66 transitions. [2021-01-06 16:37:15,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-06 16:37:15,160 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2021-01-06 16:37:15,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 16:37:15,161 INFO L225 Difference]: With dead ends: 51 [2021-01-06 16:37:15,162 INFO L226 Difference]: Without dead ends: 32 [2021-01-06 16:37:15,163 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 9 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2021-01-06 16:37:15,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2021-01-06 16:37:15,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 24. [2021-01-06 16:37:15,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2021-01-06 16:37:15,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 29 transitions. [2021-01-06 16:37:15,169 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 29 transitions. Word has length 11 [2021-01-06 16:37:15,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 16:37:15,170 INFO L481 AbstractCegarLoop]: Abstraction has 24 states and 29 transitions. [2021-01-06 16:37:15,170 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2021-01-06 16:37:15,170 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 29 transitions. [2021-01-06 16:37:15,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-01-06 16:37:15,171 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 16:37:15,171 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 16:37:15,386 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2021-01-06 16:37:15,387 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 16:37:15,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 16:37:15,388 INFO L82 PathProgramCache]: Analyzing trace with hash -1379565948, now seen corresponding path program 1 times [2021-01-06 16:37:15,388 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 16:37:15,388 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850944931] [2021-01-06 16:37:15,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 16:37:15,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:37:16,082 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 16:37:16,083 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850944931] [2021-01-06 16:37:16,083 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1217002806] [2021-01-06 16:37:16,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/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 [2021-01-06 16:37:16,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:37:16,143 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 22 conjunts are in the unsatisfiable core [2021-01-06 16:37:16,146 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 16:37:16,227 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:37:16,358 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 16:37:16,362 INFO L382 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 28 treesize of output 27 [2021-01-06 16:37:16,364 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 16:37:16,375 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:37:16,385 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-06 16:37:16,386 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:30 [2021-01-06 16:37:16,462 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:37:16,470 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:37:16,475 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:37:16,491 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-01-06 16:37:16,492 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 16:37:16,492 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 18 [2021-01-06 16:37:16,492 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181605244] [2021-01-06 16:37:16,495 INFO L461 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-01-06 16:37:16,495 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 16:37:16,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-01-06 16:37:16,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=239, Unknown=0, NotChecked=0, Total=306 [2021-01-06 16:37:16,499 INFO L87 Difference]: Start difference. First operand 24 states and 29 transitions. Second operand 18 states. [2021-01-06 16:37:17,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 16:37:17,163 INFO L93 Difference]: Finished difference Result 77 states and 100 transitions. [2021-01-06 16:37:17,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-01-06 16:37:17,164 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 19 [2021-01-06 16:37:17,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 16:37:17,165 INFO L225 Difference]: With dead ends: 77 [2021-01-06 16:37:17,165 INFO L226 Difference]: Without dead ends: 62 [2021-01-06 16:37:17,166 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 14 SyntacticMatches, 4 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 278 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=228, Invalid=828, Unknown=0, NotChecked=0, Total=1056 [2021-01-06 16:37:17,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2021-01-06 16:37:17,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 38. [2021-01-06 16:37:17,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2021-01-06 16:37:17,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 47 transitions. [2021-01-06 16:37:17,175 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 47 transitions. Word has length 19 [2021-01-06 16:37:17,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 16:37:17,175 INFO L481 AbstractCegarLoop]: Abstraction has 38 states and 47 transitions. [2021-01-06 16:37:17,175 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2021-01-06 16:37:17,175 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 47 transitions. [2021-01-06 16:37:17,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-01-06 16:37:17,176 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 16:37:17,177 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 16:37:17,389 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 16:37:17,390 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 16:37:17,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 16:37:17,391 INFO L82 PathProgramCache]: Analyzing trace with hash 1125897754, now seen corresponding path program 1 times [2021-01-06 16:37:17,392 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 16:37:17,393 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935019052] [2021-01-06 16:37:17,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 16:37:17,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:37:17,612 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 16:37:17,612 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935019052] [2021-01-06 16:37:17,612 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2135687529] [2021-01-06 16:37:17,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/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 [2021-01-06 16:37:17,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:37:17,668 INFO L263 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 12 conjunts are in the unsatisfiable core [2021-01-06 16:37:17,670 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 16:37:17,803 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-01-06 16:37:17,803 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 16:37:17,803 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 11 [2021-01-06 16:37:17,804 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390641929] [2021-01-06 16:37:17,804 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-01-06 16:37:17,804 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 16:37:17,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-01-06 16:37:17,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2021-01-06 16:37:17,806 INFO L87 Difference]: Start difference. First operand 38 states and 47 transitions. Second operand 11 states. [2021-01-06 16:37:17,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 16:37:17,954 INFO L93 Difference]: Finished difference Result 122 states and 156 transitions. [2021-01-06 16:37:17,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-01-06 16:37:17,954 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 23 [2021-01-06 16:37:17,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 16:37:17,956 INFO L225 Difference]: With dead ends: 122 [2021-01-06 16:37:17,956 INFO L226 Difference]: Without dead ends: 86 [2021-01-06 16:37:17,957 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 19 SyntacticMatches, 5 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2021-01-06 16:37:17,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2021-01-06 16:37:17,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 68. [2021-01-06 16:37:17,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2021-01-06 16:37:17,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 84 transitions. [2021-01-06 16:37:17,968 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 84 transitions. Word has length 23 [2021-01-06 16:37:17,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 16:37:17,968 INFO L481 AbstractCegarLoop]: Abstraction has 68 states and 84 transitions. [2021-01-06 16:37:17,968 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2021-01-06 16:37:17,968 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 84 transitions. [2021-01-06 16:37:17,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-01-06 16:37:17,969 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 16:37:17,970 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 16:37:18,183 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 16:37:18,184 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 16:37:18,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 16:37:18,185 INFO L82 PathProgramCache]: Analyzing trace with hash -210329187, now seen corresponding path program 1 times [2021-01-06 16:37:18,186 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 16:37:18,187 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214511311] [2021-01-06 16:37:18,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 16:37:18,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:37:18,686 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 16:37:18,687 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214511311] [2021-01-06 16:37:18,687 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [933658558] [2021-01-06 16:37:18,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/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 [2021-01-06 16:37:18,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:37:18,736 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 22 conjunts are in the unsatisfiable core [2021-01-06 16:37:18,738 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 16:37:18,833 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:37:18,908 INFO L348 Elim1Store]: treesize reduction 39, result has 22.0 percent of original size [2021-01-06 16:37:18,909 INFO L382 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 36 treesize of output 27 [2021-01-06 16:37:18,911 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 16:37:18,919 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:37:18,920 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 16:37:18,920 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:42, output treesize:38 [2021-01-06 16:37:19,205 INFO L348 Elim1Store]: treesize reduction 17, result has 85.8 percent of original size [2021-01-06 16:37:19,205 INFO L382 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 48 treesize of output 121 [2021-01-06 16:37:19,208 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 16:37:19,209 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:37:19,215 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 16:37:19,251 INFO L625 ElimStorePlain]: treesize reduction 97, result has 27.1 percent of original size [2021-01-06 16:37:19,256 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-01-06 16:37:19,257 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:62, output treesize:33 [2021-01-06 16:37:19,389 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:37:19,392 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:37:19,394 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:37:19,400 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:37:19,403 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-06 16:37:19,435 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-01-06 16:37:19,436 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 16:37:19,436 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14] total 28 [2021-01-06 16:37:19,436 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638028344] [2021-01-06 16:37:19,436 INFO L461 AbstractCegarLoop]: Interpolant automaton has 28 states [2021-01-06 16:37:19,437 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 16:37:19,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2021-01-06 16:37:19,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=655, Unknown=0, NotChecked=0, Total=756 [2021-01-06 16:37:19,438 INFO L87 Difference]: Start difference. First operand 68 states and 84 transitions. Second operand 28 states. [2021-01-06 16:37:21,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 16:37:21,321 INFO L93 Difference]: Finished difference Result 166 states and 206 transitions. [2021-01-06 16:37:21,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2021-01-06 16:37:21,322 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 24 [2021-01-06 16:37:21,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 16:37:21,324 INFO L225 Difference]: With dead ends: 166 [2021-01-06 16:37:21,324 INFO L226 Difference]: Without dead ends: 99 [2021-01-06 16:37:21,327 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 794 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=443, Invalid=2419, Unknown=0, NotChecked=0, Total=2862 [2021-01-06 16:37:21,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2021-01-06 16:37:21,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 54. [2021-01-06 16:37:21,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2021-01-06 16:37:21,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 64 transitions. [2021-01-06 16:37:21,337 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 64 transitions. Word has length 24 [2021-01-06 16:37:21,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 16:37:21,337 INFO L481 AbstractCegarLoop]: Abstraction has 54 states and 64 transitions. [2021-01-06 16:37:21,337 INFO L482 AbstractCegarLoop]: Interpolant automaton has 28 states. [2021-01-06 16:37:21,337 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 64 transitions. [2021-01-06 16:37:21,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-01-06 16:37:21,338 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 16:37:21,338 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 16:37:21,551 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 16:37:21,552 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 16:37:21,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 16:37:21,554 INFO L82 PathProgramCache]: Analyzing trace with hash -1447473291, now seen corresponding path program 2 times [2021-01-06 16:37:21,554 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 16:37:21,555 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485332392] [2021-01-06 16:37:21,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 16:37:21,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:37:21,931 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-01-06 16:37:21,932 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485332392] [2021-01-06 16:37:21,937 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1803421586] [2021-01-06 16:37:21,938 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate-bitabs/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 [2021-01-06 16:37:22,005 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-01-06 16:37:22,006 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-06 16:37:22,007 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 25 conjunts are in the unsatisfiable core [2021-01-06 16:37:22,009 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 16:37:22,072 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:37:22,098 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 16:37:22,099 INFO L382 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 28 treesize of output 27 [2021-01-06 16:37:22,101 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 16:37:22,114 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:37:22,118 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-06 16:37:22,118 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:47, output treesize:40 [2021-01-06 16:37:22,176 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 16:37:22,178 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 16:37:22,179 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 16:37:22,180 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:37:22,181 INFO L382 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 [2021-01-06 16:37:22,182 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 16:37:22,190 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:37:22,195 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 16:37:22,195 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:17 [2021-01-06 16:37:22,225 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:37:22,227 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:37:22,228 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:37:22,247 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-01-06 16:37:22,248 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 16:37:22,248 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 17 [2021-01-06 16:37:22,248 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345139802] [2021-01-06 16:37:22,249 INFO L461 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-01-06 16:37:22,249 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 16:37:22,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-01-06 16:37:22,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=212, Unknown=0, NotChecked=0, Total=272 [2021-01-06 16:37:22,250 INFO L87 Difference]: Start difference. First operand 54 states and 64 transitions. Second operand 17 states. [2021-01-06 16:37:22,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 16:37:22,698 INFO L93 Difference]: Finished difference Result 95 states and 116 transitions. [2021-01-06 16:37:22,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-01-06 16:37:22,698 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 27 [2021-01-06 16:37:22,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 16:37:22,703 INFO L225 Difference]: With dead ends: 95 [2021-01-06 16:37:22,703 INFO L226 Difference]: Without dead ends: 93 [2021-01-06 16:37:22,704 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 20 SyntacticMatches, 7 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 177 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=146, Invalid=504, Unknown=0, NotChecked=0, Total=650 [2021-01-06 16:37:22,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2021-01-06 16:37:22,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 64. [2021-01-06 16:37:22,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2021-01-06 16:37:22,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 78 transitions. [2021-01-06 16:37:22,730 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 78 transitions. Word has length 27 [2021-01-06 16:37:22,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 16:37:22,730 INFO L481 AbstractCegarLoop]: Abstraction has 64 states and 78 transitions. [2021-01-06 16:37:22,730 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2021-01-06 16:37:22,731 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 78 transitions. [2021-01-06 16:37:22,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-01-06 16:37:22,731 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 16:37:22,732 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 16:37:22,948 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2021-01-06 16:37:22,949 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 16:37:22,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 16:37:22,950 INFO L82 PathProgramCache]: Analyzing trace with hash -1913928053, now seen corresponding path program 2 times [2021-01-06 16:37:22,950 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 16:37:22,950 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887983778] [2021-01-06 16:37:22,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 16:37:22,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:37:23,161 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 16:37:23,161 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887983778] [2021-01-06 16:37:23,161 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [493367668] [2021-01-06 16:37:23,162 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate-bitabs/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 [2021-01-06 16:37:23,237 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-01-06 16:37:23,237 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-06 16:37:23,239 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 31 conjunts are in the unsatisfiable core [2021-01-06 16:37:23,243 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 16:37:23,355 INFO L382 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 [2021-01-06 16:37:23,356 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 16:37:23,365 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:37:23,366 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 16:37:23,367 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:7 [2021-01-06 16:37:23,382 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:37:23,405 INFO L348 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2021-01-06 16:37:23,406 INFO L382 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 [2021-01-06 16:37:23,408 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 16:37:23,414 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:37:23,415 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 16:37:23,416 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:23, output treesize:15 [2021-01-06 16:37:23,500 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:37:23,504 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:37:23,506 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:37:23,531 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-01-06 16:37:23,531 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 16:37:23,532 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 15] total 18 [2021-01-06 16:37:23,532 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079081354] [2021-01-06 16:37:23,532 INFO L461 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-01-06 16:37:23,533 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 16:37:23,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-01-06 16:37:23,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2021-01-06 16:37:23,533 INFO L87 Difference]: Start difference. First operand 64 states and 78 transitions. Second operand 18 states. [2021-01-06 16:37:24,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 16:37:24,203 INFO L93 Difference]: Finished difference Result 183 states and 234 transitions. [2021-01-06 16:37:24,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-01-06 16:37:24,204 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 31 [2021-01-06 16:37:24,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 16:37:24,205 INFO L225 Difference]: With dead ends: 183 [2021-01-06 16:37:24,205 INFO L226 Difference]: Without dead ends: 151 [2021-01-06 16:37:24,206 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 24 SyntacticMatches, 5 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 206 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=165, Invalid=827, Unknown=0, NotChecked=0, Total=992 [2021-01-06 16:37:24,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2021-01-06 16:37:24,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 87. [2021-01-06 16:37:24,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2021-01-06 16:37:24,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 110 transitions. [2021-01-06 16:37:24,219 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 110 transitions. Word has length 31 [2021-01-06 16:37:24,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 16:37:24,220 INFO L481 AbstractCegarLoop]: Abstraction has 87 states and 110 transitions. [2021-01-06 16:37:24,220 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2021-01-06 16:37:24,220 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 110 transitions. [2021-01-06 16:37:24,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-01-06 16:37:24,221 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 16:37:24,221 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 16:37:24,435 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 16:37:24,436 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 16:37:24,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 16:37:24,437 INFO L82 PathProgramCache]: Analyzing trace with hash -635707062, now seen corresponding path program 1 times [2021-01-06 16:37:24,437 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 16:37:24,438 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384345863] [2021-01-06 16:37:24,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 16:37:24,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:37:24,809 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 2 proven. 20 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-01-06 16:37:24,809 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384345863] [2021-01-06 16:37:24,812 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [401306717] [2021-01-06 16:37:24,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/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 [2021-01-06 16:37:24,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:37:24,875 INFO L263 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 26 conjunts are in the unsatisfiable core [2021-01-06 16:37:24,877 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 16:37:25,003 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:37:25,042 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 16:37:25,043 INFO L382 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 28 treesize of output 27 [2021-01-06 16:37:25,044 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 16:37:25,054 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:37:25,058 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-06 16:37:25,058 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:35 [2021-01-06 16:37:25,111 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:37:25,114 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:37:25,120 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:37:25,142 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-01-06 16:37:25,143 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 16:37:25,143 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 19 [2021-01-06 16:37:25,143 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809287787] [2021-01-06 16:37:25,144 INFO L461 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-01-06 16:37:25,144 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 16:37:25,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-01-06 16:37:25,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=269, Unknown=0, NotChecked=0, Total=342 [2021-01-06 16:37:25,145 INFO L87 Difference]: Start difference. First operand 87 states and 110 transitions. Second operand 19 states. [2021-01-06 16:37:26,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 16:37:26,959 INFO L93 Difference]: Finished difference Result 235 states and 295 transitions. [2021-01-06 16:37:26,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2021-01-06 16:37:26,960 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 32 [2021-01-06 16:37:26,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 16:37:26,961 INFO L225 Difference]: With dead ends: 235 [2021-01-06 16:37:26,961 INFO L226 Difference]: Without dead ends: 203 [2021-01-06 16:37:26,964 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 24 SyntacticMatches, 5 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1147 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=652, Invalid=3130, Unknown=0, NotChecked=0, Total=3782 [2021-01-06 16:37:26,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2021-01-06 16:37:26,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 95. [2021-01-06 16:37:26,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2021-01-06 16:37:26,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 118 transitions. [2021-01-06 16:37:26,976 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 118 transitions. Word has length 32 [2021-01-06 16:37:26,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 16:37:26,976 INFO L481 AbstractCegarLoop]: Abstraction has 95 states and 118 transitions. [2021-01-06 16:37:26,976 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2021-01-06 16:37:26,976 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 118 transitions. [2021-01-06 16:37:26,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-01-06 16:37:26,978 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 16:37:26,978 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 16:37:27,192 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 16:37:27,193 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 16:37:27,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 16:37:27,194 INFO L82 PathProgramCache]: Analyzing trace with hash 222375954, now seen corresponding path program 2 times [2021-01-06 16:37:27,194 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 16:37:27,195 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529669388] [2021-01-06 16:37:27,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 16:37:27,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:37:27,739 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-01-06 16:37:27,739 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529669388] [2021-01-06 16:37:27,739 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [662689932] [2021-01-06 16:37:27,740 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate-bitabs/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 [2021-01-06 16:37:27,826 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-01-06 16:37:27,826 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-06 16:37:27,827 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 30 conjunts are in the unsatisfiable core [2021-01-06 16:37:27,829 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 16:37:27,902 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:37:27,982 INFO L348 Elim1Store]: treesize reduction 39, result has 22.0 percent of original size [2021-01-06 16:37:27,982 INFO L382 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 36 treesize of output 27 [2021-01-06 16:37:27,983 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 16:37:27,993 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:37:27,994 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 16:37:27,994 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:47, output treesize:43 [2021-01-06 16:37:28,271 INFO L348 Elim1Store]: treesize reduction 17, result has 85.8 percent of original size [2021-01-06 16:37:28,271 INFO L382 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 48 treesize of output 121 [2021-01-06 16:37:28,274 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 16:37:28,275 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:37:28,279 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 16:37:28,320 INFO L625 ElimStorePlain]: treesize reduction 99, result has 28.3 percent of original size [2021-01-06 16:37:28,324 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-01-06 16:37:28,325 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:67, output treesize:36 [2021-01-06 16:37:28,553 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:37:28,553 INFO L382 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 125 [2021-01-06 16:37:28,556 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:37:28,557 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:37:28,559 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 16:37:28,592 INFO L625 ElimStorePlain]: treesize reduction 57, result has 42.4 percent of original size [2021-01-06 16:37:28,595 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-01-06 16:37:28,595 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:46, output treesize:33 [2021-01-06 16:37:28,736 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:37:28,744 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:37:28,746 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:37:28,752 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:37:28,758 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-06 16:37:28,793 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-01-06 16:37:28,793 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 16:37:28,793 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17] total 33 [2021-01-06 16:37:28,794 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178943274] [2021-01-06 16:37:28,794 INFO L461 AbstractCegarLoop]: Interpolant automaton has 33 states [2021-01-06 16:37:28,794 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 16:37:28,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2021-01-06 16:37:28,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=912, Unknown=0, NotChecked=0, Total=1056 [2021-01-06 16:37:28,795 INFO L87 Difference]: Start difference. First operand 95 states and 118 transitions. Second operand 33 states. [2021-01-06 16:37:29,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 16:37:29,995 INFO L93 Difference]: Finished difference Result 124 states and 151 transitions. [2021-01-06 16:37:29,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-01-06 16:37:29,996 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 32 [2021-01-06 16:37:29,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 16:37:29,997 INFO L225 Difference]: With dead ends: 124 [2021-01-06 16:37:29,997 INFO L226 Difference]: Without dead ends: 122 [2021-01-06 16:37:29,999 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 18 SyntacticMatches, 3 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 613 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=262, Invalid=1630, Unknown=0, NotChecked=0, Total=1892 [2021-01-06 16:37:29,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2021-01-06 16:37:30,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 92. [2021-01-06 16:37:30,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2021-01-06 16:37:30,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 114 transitions. [2021-01-06 16:37:30,008 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 114 transitions. Word has length 32 [2021-01-06 16:37:30,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 16:37:30,009 INFO L481 AbstractCegarLoop]: Abstraction has 92 states and 114 transitions. [2021-01-06 16:37:30,009 INFO L482 AbstractCegarLoop]: Interpolant automaton has 33 states. [2021-01-06 16:37:30,009 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 114 transitions. [2021-01-06 16:37:30,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-01-06 16:37:30,010 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 16:37:30,010 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 16:37:30,224 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2021-01-06 16:37:30,225 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 16:37:30,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 16:37:30,226 INFO L82 PathProgramCache]: Analyzing trace with hash -1757363551, now seen corresponding path program 3 times [2021-01-06 16:37:30,226 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 16:37:30,227 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286773829] [2021-01-06 16:37:30,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 16:37:30,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:37:30,522 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 2 proven. 22 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-01-06 16:37:30,522 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286773829] [2021-01-06 16:37:30,523 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [923714576] [2021-01-06 16:37:30,523 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate-bitabs/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 [2021-01-06 16:37:30,681 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-01-06 16:37:30,682 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-06 16:37:30,683 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 14 conjunts are in the unsatisfiable core [2021-01-06 16:37:30,687 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 16:37:30,934 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-01-06 16:37:30,934 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 16:37:30,934 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 14 [2021-01-06 16:37:30,936 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421599638] [2021-01-06 16:37:30,937 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-01-06 16:37:30,937 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 16:37:30,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-01-06 16:37:30,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2021-01-06 16:37:30,938 INFO L87 Difference]: Start difference. First operand 92 states and 114 transitions. Second operand 14 states. [2021-01-06 16:37:31,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 16:37:31,275 INFO L93 Difference]: Finished difference Result 267 states and 336 transitions. [2021-01-06 16:37:31,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-01-06 16:37:31,276 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 35 [2021-01-06 16:37:31,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 16:37:31,278 INFO L225 Difference]: With dead ends: 267 [2021-01-06 16:37:31,278 INFO L226 Difference]: Without dead ends: 205 [2021-01-06 16:37:31,281 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 31 SyntacticMatches, 6 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=67, Invalid=275, Unknown=0, NotChecked=0, Total=342 [2021-01-06 16:37:31,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2021-01-06 16:37:31,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 163. [2021-01-06 16:37:31,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2021-01-06 16:37:31,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 198 transitions. [2021-01-06 16:37:31,302 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 198 transitions. Word has length 35 [2021-01-06 16:37:31,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 16:37:31,302 INFO L481 AbstractCegarLoop]: Abstraction has 163 states and 198 transitions. [2021-01-06 16:37:31,302 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2021-01-06 16:37:31,302 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 198 transitions. [2021-01-06 16:37:31,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-01-06 16:37:31,309 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 16:37:31,309 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 16:37:31,523 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 16:37:31,523 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 16:37:31,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 16:37:31,524 INFO L82 PathProgramCache]: Analyzing trace with hash -1000905248, now seen corresponding path program 1 times [2021-01-06 16:37:31,525 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 16:37:31,525 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40880193] [2021-01-06 16:37:31,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 16:37:31,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:37:31,834 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 16:37:31,838 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40880193] [2021-01-06 16:37:31,838 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [932100910] [2021-01-06 16:37:31,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/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 [2021-01-06 16:37:31,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:37:31,904 INFO L263 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 31 conjunts are in the unsatisfiable core [2021-01-06 16:37:31,919 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 16:37:31,950 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:37:31,978 INFO L348 Elim1Store]: treesize reduction 39, result has 22.0 percent of original size [2021-01-06 16:37:31,979 INFO L382 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 38 treesize of output 29 [2021-01-06 16:37:31,980 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 16:37:31,987 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:37:31,988 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 16:37:31,988 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:43, output treesize:39 [2021-01-06 16:37:32,174 INFO L348 Elim1Store]: treesize reduction 12, result has 87.4 percent of original size [2021-01-06 16:37:32,174 INFO L382 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 43 treesize of output 103 [2021-01-06 16:37:32,176 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 16:37:32,177 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:37:32,179 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 16:37:32,206 INFO L625 ElimStorePlain]: treesize reduction 72, result has 29.4 percent of original size [2021-01-06 16:37:32,208 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-06 16:37:32,208 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:49, output treesize:27 [2021-01-06 16:37:32,306 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:37:32,308 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:37:32,310 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:37:32,342 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-01-06 16:37:32,342 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 16:37:32,343 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 16] total 21 [2021-01-06 16:37:32,343 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174254932] [2021-01-06 16:37:32,343 INFO L461 AbstractCegarLoop]: Interpolant automaton has 21 states [2021-01-06 16:37:32,343 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 16:37:32,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-01-06 16:37:32,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=364, Unknown=0, NotChecked=0, Total=420 [2021-01-06 16:37:32,344 INFO L87 Difference]: Start difference. First operand 163 states and 198 transitions. Second operand 21 states. [2021-01-06 16:37:33,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 16:37:33,096 INFO L93 Difference]: Finished difference Result 193 states and 234 transitions. [2021-01-06 16:37:33,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-01-06 16:37:33,097 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 36 [2021-01-06 16:37:33,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 16:37:33,100 INFO L225 Difference]: With dead ends: 193 [2021-01-06 16:37:33,100 INFO L226 Difference]: Without dead ends: 181 [2021-01-06 16:37:33,101 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 27 SyntacticMatches, 6 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 233 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=150, Invalid=972, Unknown=0, NotChecked=0, Total=1122 [2021-01-06 16:37:33,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2021-01-06 16:37:33,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 165. [2021-01-06 16:37:33,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2021-01-06 16:37:33,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 201 transitions. [2021-01-06 16:37:33,118 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 201 transitions. Word has length 36 [2021-01-06 16:37:33,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 16:37:33,118 INFO L481 AbstractCegarLoop]: Abstraction has 165 states and 201 transitions. [2021-01-06 16:37:33,118 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2021-01-06 16:37:33,118 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 201 transitions. [2021-01-06 16:37:33,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-01-06 16:37:33,120 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 16:37:33,120 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 16:37:33,335 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 16:37:33,336 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 16:37:33,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 16:37:33,337 INFO L82 PathProgramCache]: Analyzing trace with hash -1716712809, now seen corresponding path program 3 times [2021-01-06 16:37:33,337 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 16:37:33,338 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348540254] [2021-01-06 16:37:33,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 16:37:33,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:37:33,891 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 5 proven. 28 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-01-06 16:37:33,891 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348540254] [2021-01-06 16:37:33,891 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1511625037] [2021-01-06 16:37:33,891 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate-bitabs/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 [2021-01-06 16:37:33,999 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2021-01-06 16:37:33,999 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-06 16:37:34,000 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 21 conjunts are in the unsatisfiable core [2021-01-06 16:37:34,002 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 16:37:34,059 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:37:34,127 INFO L348 Elim1Store]: treesize reduction 39, result has 22.0 percent of original size [2021-01-06 16:37:34,128 INFO L382 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 36 treesize of output 27 [2021-01-06 16:37:34,129 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 16:37:34,136 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:37:34,137 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 16:37:34,137 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:39, output treesize:35 [2021-01-06 16:37:34,338 INFO L348 Elim1Store]: treesize reduction 60, result has 16.7 percent of original size [2021-01-06 16:37:34,339 INFO L382 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 2 case distinctions, treesize of input 50 treesize of output 31 [2021-01-06 16:37:34,340 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 16:37:34,348 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:37:34,350 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-06 16:37:34,350 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:58, output treesize:30 [2021-01-06 16:37:34,454 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:37:34,456 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:37:34,457 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:37:34,460 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:37:34,461 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 16:37:34,493 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 18 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-01-06 16:37:34,493 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 16:37:34,494 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 12] total 31 [2021-01-06 16:37:34,494 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121169258] [2021-01-06 16:37:34,494 INFO L461 AbstractCegarLoop]: Interpolant automaton has 31 states [2021-01-06 16:37:34,494 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 16:37:34,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2021-01-06 16:37:34,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=816, Unknown=0, NotChecked=0, Total=930 [2021-01-06 16:37:34,496 INFO L87 Difference]: Start difference. First operand 165 states and 201 transitions. Second operand 31 states. [2021-01-06 16:37:38,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 16:37:38,119 INFO L93 Difference]: Finished difference Result 304 states and 367 transitions. [2021-01-06 16:37:38,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2021-01-06 16:37:38,120 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 37 [2021-01-06 16:37:38,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 16:37:38,122 INFO L225 Difference]: With dead ends: 304 [2021-01-06 16:37:38,122 INFO L226 Difference]: Without dead ends: 213 [2021-01-06 16:37:38,126 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 36 SyntacticMatches, 2 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2510 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=941, Invalid=6891, Unknown=0, NotChecked=0, Total=7832 [2021-01-06 16:37:38,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2021-01-06 16:37:38,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 132. [2021-01-06 16:37:38,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2021-01-06 16:37:38,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 155 transitions. [2021-01-06 16:37:38,140 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 155 transitions. Word has length 37 [2021-01-06 16:37:38,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 16:37:38,140 INFO L481 AbstractCegarLoop]: Abstraction has 132 states and 155 transitions. [2021-01-06 16:37:38,140 INFO L482 AbstractCegarLoop]: Interpolant automaton has 31 states. [2021-01-06 16:37:38,140 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 155 transitions. [2021-01-06 16:37:38,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-01-06 16:37:38,141 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 16:37:38,141 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 16:37:38,356 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2021-01-06 16:37:38,357 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 16:37:38,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 16:37:38,358 INFO L82 PathProgramCache]: Analyzing trace with hash -336019396, now seen corresponding path program 4 times [2021-01-06 16:37:38,358 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 16:37:38,359 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674258478] [2021-01-06 16:37:38,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 16:37:38,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:37:38,967 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 16:37:38,968 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674258478] [2021-01-06 16:37:38,968 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [392499020] [2021-01-06 16:37:38,968 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate-bitabs/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 [2021-01-06 16:37:39,031 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-01-06 16:37:39,031 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-06 16:37:39,033 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 35 conjunts are in the unsatisfiable core [2021-01-06 16:37:39,036 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 16:37:39,063 INFO L382 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 [2021-01-06 16:37:39,064 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 16:37:39,071 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:37:39,076 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 16:37:39,077 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:26, output treesize:10 [2021-01-06 16:37:39,096 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:37:39,123 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 27 [2021-01-06 16:37:39,130 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 16:37:39,133 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 16:37:39,136 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 16:37:39,137 INFO L382 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 20 treesize of output 24 [2021-01-06 16:37:39,138 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-06 16:37:39,144 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:37:39,144 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-06 16:37:39,154 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:37:39,155 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 16:37:39,155 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:40, output treesize:26 [2021-01-06 16:37:39,298 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 35 [2021-01-06 16:37:39,301 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 16:37:39,302 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 16:37:39,303 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 16:37:39,305 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 16:37:39,308 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 16:37:39,309 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 16:37:39,310 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 16:37:39,313 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 36 [2021-01-06 16:37:39,314 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-06 16:37:39,321 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:37:39,322 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-06 16:37:39,335 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:37:39,338 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-06 16:37:39,338 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:55, output treesize:31 [2021-01-06 16:37:39,472 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:37:39,475 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:37:39,476 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:37:39,507 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-01-06 16:37:39,507 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 16:37:39,507 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 16] total 23 [2021-01-06 16:37:39,508 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002121092] [2021-01-06 16:37:39,508 INFO L461 AbstractCegarLoop]: Interpolant automaton has 23 states [2021-01-06 16:37:39,508 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 16:37:39,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-01-06 16:37:39,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=423, Unknown=0, NotChecked=0, Total=506 [2021-01-06 16:37:39,510 INFO L87 Difference]: Start difference. First operand 132 states and 155 transitions. Second operand 23 states. [2021-01-06 16:37:40,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 16:37:40,403 INFO L93 Difference]: Finished difference Result 258 states and 317 transitions. [2021-01-06 16:37:40,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2021-01-06 16:37:40,404 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 39 [2021-01-06 16:37:40,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 16:37:40,406 INFO L225 Difference]: With dead ends: 258 [2021-01-06 16:37:40,406 INFO L226 Difference]: Without dead ends: 222 [2021-01-06 16:37:40,407 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 28 SyntacticMatches, 12 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 400 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=180, Invalid=1010, Unknown=0, NotChecked=0, Total=1190 [2021-01-06 16:37:40,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2021-01-06 16:37:40,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 158. [2021-01-06 16:37:40,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2021-01-06 16:37:40,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 188 transitions. [2021-01-06 16:37:40,426 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 188 transitions. Word has length 39 [2021-01-06 16:37:40,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 16:37:40,426 INFO L481 AbstractCegarLoop]: Abstraction has 158 states and 188 transitions. [2021-01-06 16:37:40,426 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2021-01-06 16:37:40,426 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 188 transitions. [2021-01-06 16:37:40,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-01-06 16:37:40,427 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 16:37:40,427 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 16:37:40,643 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2021-01-06 16:37:40,644 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 16:37:40,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 16:37:40,645 INFO L82 PathProgramCache]: Analyzing trace with hash 1292986487, now seen corresponding path program 1 times [2021-01-06 16:37:40,645 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 16:37:40,645 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728533575] [2021-01-06 16:37:40,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 16:37:40,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:37:41,406 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 16:37:41,406 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728533575] [2021-01-06 16:37:41,407 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2085362653] [2021-01-06 16:37:41,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/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 [2021-01-06 16:37:41,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:37:41,472 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 27 conjunts are in the unsatisfiable core [2021-01-06 16:37:41,474 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 16:37:41,553 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:37:41,591 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 16:37:41,592 INFO L382 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 34 treesize of output 33 [2021-01-06 16:37:41,595 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 16:37:41,613 INFO L625 ElimStorePlain]: treesize reduction 7, result has 83.7 percent of original size [2021-01-06 16:37:41,614 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 16:37:41,614 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:47, output treesize:33 [2021-01-06 16:37:41,710 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 16:37:41,712 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 16:37:41,713 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 16:37:41,715 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:37:41,715 INFO L382 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 [2021-01-06 16:37:41,716 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 16:37:41,724 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:37:41,726 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 16:37:41,727 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:17 [2021-01-06 16:37:41,760 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 16:37:41,762 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 16:37:41,763 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 16:37:41,764 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:37:41,764 INFO L382 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 [2021-01-06 16:37:41,765 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 16:37:41,774 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:37:41,775 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 16:37:41,775 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:17 [2021-01-06 16:37:41,809 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:37:41,811 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:37:41,812 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:37:41,838 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 3 proven. 21 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2021-01-06 16:37:41,838 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 16:37:41,838 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 15] total 26 [2021-01-06 16:37:41,839 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289461238] [2021-01-06 16:37:41,839 INFO L461 AbstractCegarLoop]: Interpolant automaton has 26 states [2021-01-06 16:37:41,839 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 16:37:41,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2021-01-06 16:37:41,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=533, Unknown=0, NotChecked=0, Total=650 [2021-01-06 16:37:41,840 INFO L87 Difference]: Start difference. First operand 158 states and 188 transitions. Second operand 26 states. [2021-01-06 16:37:43,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 16:37:43,295 INFO L93 Difference]: Finished difference Result 285 states and 341 transitions. [2021-01-06 16:37:43,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2021-01-06 16:37:43,295 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 40 [2021-01-06 16:37:43,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 16:37:43,297 INFO L225 Difference]: With dead ends: 285 [2021-01-06 16:37:43,297 INFO L226 Difference]: Without dead ends: 283 [2021-01-06 16:37:43,298 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 32 SyntacticMatches, 9 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 614 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=404, Invalid=1852, Unknown=0, NotChecked=0, Total=2256 [2021-01-06 16:37:43,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2021-01-06 16:37:43,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 161. [2021-01-06 16:37:43,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2021-01-06 16:37:43,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 192 transitions. [2021-01-06 16:37:43,317 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 192 transitions. Word has length 40 [2021-01-06 16:37:43,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 16:37:43,317 INFO L481 AbstractCegarLoop]: Abstraction has 161 states and 192 transitions. [2021-01-06 16:37:43,317 INFO L482 AbstractCegarLoop]: Interpolant automaton has 26 states. [2021-01-06 16:37:43,318 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 192 transitions. [2021-01-06 16:37:43,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-01-06 16:37:43,318 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 16:37:43,318 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 16:37:43,532 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2021-01-06 16:37:43,533 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 16:37:43,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 16:37:43,534 INFO L82 PathProgramCache]: Analyzing trace with hash -1122199553, now seen corresponding path program 2 times [2021-01-06 16:37:43,534 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 16:37:43,534 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577426956] [2021-01-06 16:37:43,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 16:37:43,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:37:44,317 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 2 proven. 44 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 16:37:44,318 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577426956] [2021-01-06 16:37:44,318 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1921264841] [2021-01-06 16:37:44,318 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate-bitabs/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 [2021-01-06 16:37:44,377 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-01-06 16:37:44,377 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-06 16:37:44,378 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 27 conjunts are in the unsatisfiable core [2021-01-06 16:37:44,380 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 16:37:44,576 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:37:44,706 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 16:37:44,707 INFO L382 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 28 treesize of output 27 [2021-01-06 16:37:44,708 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 16:37:44,722 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:37:44,724 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-06 16:37:44,724 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:35 [2021-01-06 16:37:44,883 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 16:37:44,884 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 16:37:44,886 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 16:37:44,887 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:37:44,887 INFO L382 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 [2021-01-06 16:37:44,889 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 16:37:44,898 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:37:44,899 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 16:37:44,899 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:17 [2021-01-06 16:37:44,929 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:37:44,931 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:37:44,932 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:37:44,966 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 3 proven. 27 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-01-06 16:37:44,967 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 16:37:44,967 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 16] total 29 [2021-01-06 16:37:44,967 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753609295] [2021-01-06 16:37:44,967 INFO L461 AbstractCegarLoop]: Interpolant automaton has 29 states [2021-01-06 16:37:44,967 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 16:37:44,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2021-01-06 16:37:44,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=648, Unknown=0, NotChecked=0, Total=812 [2021-01-06 16:37:44,968 INFO L87 Difference]: Start difference. First operand 161 states and 192 transitions. Second operand 29 states. [2021-01-06 16:37:47,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 16:37:47,637 INFO L93 Difference]: Finished difference Result 283 states and 341 transitions. [2021-01-06 16:37:47,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2021-01-06 16:37:47,637 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 40 [2021-01-06 16:37:47,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 16:37:47,639 INFO L225 Difference]: With dead ends: 283 [2021-01-06 16:37:47,639 INFO L226 Difference]: Without dead ends: 248 [2021-01-06 16:37:47,641 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 32 SyntacticMatches, 10 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1150 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=744, Invalid=3162, Unknown=0, NotChecked=0, Total=3906 [2021-01-06 16:37:47,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2021-01-06 16:37:47,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 175. [2021-01-06 16:37:47,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2021-01-06 16:37:47,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 213 transitions. [2021-01-06 16:37:47,663 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 213 transitions. Word has length 40 [2021-01-06 16:37:47,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 16:37:47,664 INFO L481 AbstractCegarLoop]: Abstraction has 175 states and 213 transitions. [2021-01-06 16:37:47,664 INFO L482 AbstractCegarLoop]: Interpolant automaton has 29 states. [2021-01-06 16:37:47,664 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 213 transitions. [2021-01-06 16:37:47,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-01-06 16:37:47,664 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 16:37:47,665 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 16:37:47,877 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 16:37:47,878 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 16:37:47,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 16:37:47,879 INFO L82 PathProgramCache]: Analyzing trace with hash -1167216441, now seen corresponding path program 4 times [2021-01-06 16:37:47,879 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 16:37:47,879 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614135112] [2021-01-06 16:37:47,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 16:37:47,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:37:48,628 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-01-06 16:37:48,629 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614135112] [2021-01-06 16:37:48,629 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1455114254] [2021-01-06 16:37:48,629 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate-bitabs/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 [2021-01-06 16:37:48,695 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-01-06 16:37:48,695 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-06 16:37:48,697 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 35 conjunts are in the unsatisfiable core [2021-01-06 16:37:48,699 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 16:37:48,765 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:37:48,858 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 16:37:48,858 INFO L382 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 36 treesize of output 27 [2021-01-06 16:37:48,860 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 16:37:48,873 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:37:48,874 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 16:37:48,874 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:48, output treesize:45 [2021-01-06 16:37:49,133 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 16:37:49,135 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:37:49,135 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 31 [2021-01-06 16:37:49,137 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 16:37:49,151 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:37:49,153 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-06 16:37:49,153 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:67, output treesize:39 [2021-01-06 16:37:49,247 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 16:37:49,249 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 16:37:49,250 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 16:37:49,251 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:37:49,252 INFO L382 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 34 treesize of output 36 [2021-01-06 16:37:49,253 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 16:37:49,262 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:37:49,266 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 16:37:49,267 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:42, output treesize:27 [2021-01-06 16:37:49,404 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 16:37:49,406 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 16:37:49,407 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 16:37:49,408 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:37:49,408 INFO L382 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 [2021-01-06 16:37:49,410 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 16:37:49,419 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:37:49,421 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 16:37:49,421 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:46, output treesize:19 [2021-01-06 16:37:49,453 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:37:49,454 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:37:49,456 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:37:49,502 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 2 proven. 28 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-01-06 16:37:49,502 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 16:37:49,502 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20] total 32 [2021-01-06 16:37:49,502 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827254663] [2021-01-06 16:37:49,503 INFO L461 AbstractCegarLoop]: Interpolant automaton has 32 states [2021-01-06 16:37:49,503 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 16:37:49,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2021-01-06 16:37:49,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=847, Unknown=0, NotChecked=0, Total=992 [2021-01-06 16:37:49,506 INFO L87 Difference]: Start difference. First operand 175 states and 213 transitions. Second operand 32 states. [2021-01-06 16:37:50,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 16:37:50,784 INFO L93 Difference]: Finished difference Result 300 states and 368 transitions. [2021-01-06 16:37:50,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2021-01-06 16:37:50,785 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 40 [2021-01-06 16:37:50,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 16:37:50,787 INFO L225 Difference]: With dead ends: 300 [2021-01-06 16:37:50,787 INFO L226 Difference]: Without dead ends: 242 [2021-01-06 16:37:50,789 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 25 SyntacticMatches, 7 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 840 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=341, Invalid=2109, Unknown=0, NotChecked=0, Total=2450 [2021-01-06 16:37:50,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2021-01-06 16:37:50,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 183. [2021-01-06 16:37:50,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2021-01-06 16:37:50,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 225 transitions. [2021-01-06 16:37:50,810 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 225 transitions. Word has length 40 [2021-01-06 16:37:50,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 16:37:50,810 INFO L481 AbstractCegarLoop]: Abstraction has 183 states and 225 transitions. [2021-01-06 16:37:50,810 INFO L482 AbstractCegarLoop]: Interpolant automaton has 32 states. [2021-01-06 16:37:50,810 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 225 transitions. [2021-01-06 16:37:50,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-01-06 16:37:50,811 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 16:37:50,811 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 16:37:51,025 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2021-01-06 16:37:51,026 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 16:37:51,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 16:37:51,027 INFO L82 PathProgramCache]: Analyzing trace with hash -1721163603, now seen corresponding path program 1 times [2021-01-06 16:37:51,027 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 16:37:51,027 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057205792] [2021-01-06 16:37:51,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 16:37:51,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:37:52,117 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 4 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 16:37:52,117 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057205792] [2021-01-06 16:37:52,118 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1056282938] [2021-01-06 16:37:52,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/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 [2021-01-06 16:37:52,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:37:52,174 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 41 conjunts are in the unsatisfiable core [2021-01-06 16:37:52,175 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 16:37:52,263 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:37:52,297 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 16:37:52,299 INFO L382 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 34 treesize of output 33 [2021-01-06 16:37:52,300 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 16:37:52,319 INFO L625 ElimStorePlain]: treesize reduction 7, result has 83.7 percent of original size [2021-01-06 16:37:52,320 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 16:37:52,321 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:47, output treesize:33 [2021-01-06 16:37:52,433 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 16:37:52,435 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 16:37:52,436 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 16:37:52,437 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 16:37:52,438 INFO L173 IndexEqualityManager]: detected equality via solver [2021-01-06 16:37:52,440 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:37:52,440 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 38 treesize of output 46 [2021-01-06 16:37:52,442 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 16:37:52,463 INFO L625 ElimStorePlain]: treesize reduction 17, result has 71.2 percent of original size [2021-01-06 16:37:52,464 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 16:37:52,464 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:44, output treesize:42 [2021-01-06 16:37:52,734 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 16:37:52,735 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 16:37:52,736 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 16:37:52,737 INFO L173 IndexEqualityManager]: detected equality via solver [2021-01-06 16:37:52,738 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 16:37:52,739 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 16:37:52,740 INFO L173 IndexEqualityManager]: detected equality via solver [2021-01-06 16:37:52,741 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:37:52,742 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 53 treesize of output 58 [2021-01-06 16:37:52,743 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 16:37:52,771 INFO L625 ElimStorePlain]: treesize reduction 35, result has 52.1 percent of original size [2021-01-06 16:37:52,776 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 16:37:52,777 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:62, output treesize:32 [2021-01-06 16:37:52,980 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 16:37:52,983 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 16:37:52,984 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 16:37:52,985 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 16:37:52,986 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 16:37:53,005 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:37:53,006 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 45 treesize of output 70 [2021-01-06 16:37:53,008 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 16:37:53,043 INFO L625 ElimStorePlain]: treesize reduction 17, result has 76.7 percent of original size [2021-01-06 16:37:53,045 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:37:53,048 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 16:37:53,048 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:51, output treesize:50 [2021-01-06 16:37:53,248 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:37:53,250 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:37:53,251 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:37:53,291 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-01-06 16:37:53,292 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 16:37:53,292 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 23] total 38 [2021-01-06 16:37:53,292 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420639465] [2021-01-06 16:37:53,292 INFO L461 AbstractCegarLoop]: Interpolant automaton has 38 states [2021-01-06 16:37:53,292 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 16:37:53,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2021-01-06 16:37:53,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=203, Invalid=1203, Unknown=0, NotChecked=0, Total=1406 [2021-01-06 16:37:53,293 INFO L87 Difference]: Start difference. First operand 183 states and 225 transitions. Second operand 38 states. [2021-01-06 16:37:58,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 16:37:58,856 INFO L93 Difference]: Finished difference Result 426 states and 526 transitions. [2021-01-06 16:37:58,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2021-01-06 16:37:58,857 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 41 [2021-01-06 16:37:58,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 16:37:58,859 INFO L225 Difference]: With dead ends: 426 [2021-01-06 16:37:58,859 INFO L226 Difference]: Without dead ends: 351 [2021-01-06 16:37:58,863 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 24 SyntacticMatches, 7 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3115 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=1226, Invalid=8280, Unknown=0, NotChecked=0, Total=9506 [2021-01-06 16:37:58,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2021-01-06 16:37:58,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 249. [2021-01-06 16:37:58,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2021-01-06 16:37:58,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 316 transitions. [2021-01-06 16:37:58,889 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 316 transitions. Word has length 41 [2021-01-06 16:37:58,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 16:37:58,889 INFO L481 AbstractCegarLoop]: Abstraction has 249 states and 316 transitions. [2021-01-06 16:37:58,889 INFO L482 AbstractCegarLoop]: Interpolant automaton has 38 states. [2021-01-06 16:37:58,889 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 316 transitions. [2021-01-06 16:37:58,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-01-06 16:37:58,890 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 16:37:58,890 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 16:37:59,102 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2021-01-06 16:37:59,103 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 16:37:59,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 16:37:59,104 INFO L82 PathProgramCache]: Analyzing trace with hash -840467502, now seen corresponding path program 5 times [2021-01-06 16:37:59,104 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 16:37:59,105 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499740129] [2021-01-06 16:37:59,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 16:37:59,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:37:59,649 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-01-06 16:37:59,649 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499740129] [2021-01-06 16:37:59,649 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [340250202] [2021-01-06 16:37:59,649 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate-bitabs/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 [2021-01-06 16:37:59,836 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2021-01-06 16:37:59,836 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-06 16:37:59,838 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 36 conjunts are in the unsatisfiable core [2021-01-06 16:37:59,840 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 16:37:59,886 INFO L382 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 [2021-01-06 16:37:59,890 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 16:37:59,896 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:37:59,897 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 16:37:59,898 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:9 [2021-01-06 16:37:59,920 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:37:59,990 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 29 [2021-01-06 16:37:59,993 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 16:37:59,996 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 16:37:59,998 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 16:37:59,999 INFO L382 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 21 treesize of output 25 [2021-01-06 16:38:00,001 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-06 16:38:00,007 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:38:00,007 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-06 16:38:00,019 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:38:00,021 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-06 16:38:00,021 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:47, output treesize:32 [2021-01-06 16:38:00,165 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:38:00,167 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:38:00,168 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:38:00,170 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:38:00,170 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 16:38:00,200 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-01-06 16:38:00,200 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 16:38:00,200 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 19 [2021-01-06 16:38:00,201 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923982551] [2021-01-06 16:38:00,201 INFO L461 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-01-06 16:38:00,201 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 16:38:00,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-01-06 16:38:00,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=281, Unknown=0, NotChecked=0, Total=342 [2021-01-06 16:38:00,202 INFO L87 Difference]: Start difference. First operand 249 states and 316 transitions. Second operand 19 states. [2021-01-06 16:38:01,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 16:38:01,391 INFO L93 Difference]: Finished difference Result 561 states and 741 transitions. [2021-01-06 16:38:01,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-01-06 16:38:01,392 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 43 [2021-01-06 16:38:01,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 16:38:01,393 INFO L225 Difference]: With dead ends: 561 [2021-01-06 16:38:01,393 INFO L226 Difference]: Without dead ends: 418 [2021-01-06 16:38:01,394 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 33 SyntacticMatches, 11 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 257 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=226, Invalid=964, Unknown=0, NotChecked=0, Total=1190 [2021-01-06 16:38:01,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2021-01-06 16:38:01,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 273. [2021-01-06 16:38:01,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 273 states. [2021-01-06 16:38:01,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 344 transitions. [2021-01-06 16:38:01,428 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 344 transitions. Word has length 43 [2021-01-06 16:38:01,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 16:38:01,428 INFO L481 AbstractCegarLoop]: Abstraction has 273 states and 344 transitions. [2021-01-06 16:38:01,429 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2021-01-06 16:38:01,429 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 344 transitions. [2021-01-06 16:38:01,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-01-06 16:38:01,429 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 16:38:01,430 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 16:38:01,633 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2021-01-06 16:38:01,633 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 16:38:01,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 16:38:01,634 INFO L82 PathProgramCache]: Analyzing trace with hash 632000141, now seen corresponding path program 1 times [2021-01-06 16:38:01,634 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 16:38:01,635 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54566899] [2021-01-06 16:38:01,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 16:38:01,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:38:01,929 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 3 proven. 44 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-01-06 16:38:01,929 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54566899] [2021-01-06 16:38:01,929 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1520017549] [2021-01-06 16:38:01,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/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 [2021-01-06 16:38:01,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:38:01,991 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 34 conjunts are in the unsatisfiable core [2021-01-06 16:38:01,992 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 16:38:02,051 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:38:02,126 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:38:02,145 INFO L348 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2021-01-06 16:38:02,145 INFO L382 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 [2021-01-06 16:38:02,148 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 16:38:02,153 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:38:02,154 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 16:38:02,154 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:23, output treesize:15 [2021-01-06 16:38:02,238 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:38:02,240 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:38:02,241 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:38:02,268 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 3 proven. 29 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-01-06 16:38:02,268 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 16:38:02,268 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 18] total 23 [2021-01-06 16:38:02,269 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561078243] [2021-01-06 16:38:02,270 INFO L461 AbstractCegarLoop]: Interpolant automaton has 23 states [2021-01-06 16:38:02,270 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 16:38:02,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-01-06 16:38:02,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=424, Unknown=0, NotChecked=0, Total=506 [2021-01-06 16:38:02,271 INFO L87 Difference]: Start difference. First operand 273 states and 344 transitions. Second operand 23 states. [2021-01-06 16:38:03,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 16:38:03,683 INFO L93 Difference]: Finished difference Result 577 states and 757 transitions. [2021-01-06 16:38:03,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2021-01-06 16:38:03,684 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 44 [2021-01-06 16:38:03,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 16:38:03,687 INFO L225 Difference]: With dead ends: 577 [2021-01-06 16:38:03,687 INFO L226 Difference]: Without dead ends: 461 [2021-01-06 16:38:03,689 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 38 SyntacticMatches, 4 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 672 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=373, Invalid=2077, Unknown=0, NotChecked=0, Total=2450 [2021-01-06 16:38:03,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461 states. [2021-01-06 16:38:03,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461 to 310. [2021-01-06 16:38:03,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 310 states. [2021-01-06 16:38:03,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 397 transitions. [2021-01-06 16:38:03,731 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 397 transitions. Word has length 44 [2021-01-06 16:38:03,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 16:38:03,731 INFO L481 AbstractCegarLoop]: Abstraction has 310 states and 397 transitions. [2021-01-06 16:38:03,731 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2021-01-06 16:38:03,731 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 397 transitions. [2021-01-06 16:38:03,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-01-06 16:38:03,732 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 16:38:03,732 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 16:38:03,947 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,19 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 16:38:03,948 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 16:38:03,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 16:38:03,949 INFO L82 PathProgramCache]: Analyzing trace with hash 906213909, now seen corresponding path program 2 times [2021-01-06 16:38:03,949 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 16:38:03,949 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547294774] [2021-01-06 16:38:03,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 16:38:03,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:38:04,596 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 2 proven. 45 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-01-06 16:38:04,596 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547294774] [2021-01-06 16:38:04,596 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1493394170] [2021-01-06 16:38:04,596 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate-bitabs/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 [2021-01-06 16:38:04,658 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-01-06 16:38:04,658 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-06 16:38:04,659 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 34 conjunts are in the unsatisfiable core [2021-01-06 16:38:04,660 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 16:38:04,723 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:38:04,837 INFO L348 Elim1Store]: treesize reduction 39, result has 22.0 percent of original size [2021-01-06 16:38:04,837 INFO L382 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 36 treesize of output 27 [2021-01-06 16:38:04,838 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 16:38:04,851 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:38:04,851 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 16:38:04,852 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:47, output treesize:44 [2021-01-06 16:38:05,189 INFO L348 Elim1Store]: treesize reduction 17, result has 85.8 percent of original size [2021-01-06 16:38:05,190 INFO L382 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 48 treesize of output 121 [2021-01-06 16:38:05,192 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 16:38:05,193 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:38:05,196 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 16:38:05,239 INFO L625 ElimStorePlain]: treesize reduction 99, result has 26.1 percent of original size [2021-01-06 16:38:05,240 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 16:38:05,241 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:59, output treesize:27 [2021-01-06 16:38:05,414 INFO L348 Elim1Store]: treesize reduction 12, result has 87.4 percent of original size [2021-01-06 16:38:05,415 INFO L382 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 34 treesize of output 100 [2021-01-06 16:38:05,417 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:38:05,419 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:38:05,421 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 16:38:05,445 INFO L625 ElimStorePlain]: treesize reduction 43, result has 43.4 percent of original size [2021-01-06 16:38:05,446 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 16:38:05,446 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:17 [2021-01-06 16:38:05,597 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:38:05,598 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:38:05,599 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:38:05,649 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-01-06 16:38:05,649 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 16:38:05,649 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 19] total 33 [2021-01-06 16:38:05,649 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365875685] [2021-01-06 16:38:05,650 INFO L461 AbstractCegarLoop]: Interpolant automaton has 33 states [2021-01-06 16:38:05,650 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 16:38:05,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2021-01-06 16:38:05,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=904, Unknown=0, NotChecked=0, Total=1056 [2021-01-06 16:38:05,650 INFO L87 Difference]: Start difference. First operand 310 states and 397 transitions. Second operand 33 states. [2021-01-06 16:38:08,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 16:38:08,262 INFO L93 Difference]: Finished difference Result 452 states and 578 transitions. [2021-01-06 16:38:08,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2021-01-06 16:38:08,263 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 44 [2021-01-06 16:38:08,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 16:38:08,265 INFO L225 Difference]: With dead ends: 452 [2021-01-06 16:38:08,265 INFO L226 Difference]: Without dead ends: 373 [2021-01-06 16:38:08,267 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 31 SyntacticMatches, 5 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1169 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=482, Invalid=3300, Unknown=0, NotChecked=0, Total=3782 [2021-01-06 16:38:08,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2021-01-06 16:38:08,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 320. [2021-01-06 16:38:08,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 320 states. [2021-01-06 16:38:08,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 412 transitions. [2021-01-06 16:38:08,320 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 412 transitions. Word has length 44 [2021-01-06 16:38:08,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 16:38:08,321 INFO L481 AbstractCegarLoop]: Abstraction has 320 states and 412 transitions. [2021-01-06 16:38:08,321 INFO L482 AbstractCegarLoop]: Interpolant automaton has 33 states. [2021-01-06 16:38:08,321 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 412 transitions. [2021-01-06 16:38:08,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-01-06 16:38:08,324 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 16:38:08,324 INFO L422 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 16:38:08,537 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,20 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 16:38:08,537 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 16:38:08,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 16:38:08,538 INFO L82 PathProgramCache]: Analyzing trace with hash 647596744, now seen corresponding path program 1 times [2021-01-06 16:38:08,538 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 16:38:08,538 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430106006] [2021-01-06 16:38:08,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 16:38:08,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:38:08,562 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2021-01-06 16:38:08,562 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430106006] [2021-01-06 16:38:08,563 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 16:38:08,563 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 16:38:08,563 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48286911] [2021-01-06 16:38:08,565 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 16:38:08,565 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 16:38:08,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 16:38:08,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 16:38:08,565 INFO L87 Difference]: Start difference. First operand 320 states and 412 transitions. Second operand 3 states. [2021-01-06 16:38:08,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 16:38:08,609 INFO L93 Difference]: Finished difference Result 382 states and 497 transitions. [2021-01-06 16:38:08,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 16:38:08,610 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2021-01-06 16:38:08,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 16:38:08,612 INFO L225 Difference]: With dead ends: 382 [2021-01-06 16:38:08,612 INFO L226 Difference]: Without dead ends: 303 [2021-01-06 16:38:08,613 INFO L677 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 [2021-01-06 16:38:08,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2021-01-06 16:38:08,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 296. [2021-01-06 16:38:08,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 296 states. [2021-01-06 16:38:08,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 371 transitions. [2021-01-06 16:38:08,663 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 371 transitions. Word has length 45 [2021-01-06 16:38:08,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 16:38:08,664 INFO L481 AbstractCegarLoop]: Abstraction has 296 states and 371 transitions. [2021-01-06 16:38:08,664 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 16:38:08,664 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 371 transitions. [2021-01-06 16:38:08,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-01-06 16:38:08,665 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 16:38:08,665 INFO L422 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 16:38:08,665 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-01-06 16:38:08,665 INFO L429 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 16:38:08,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 16:38:08,665 INFO L82 PathProgramCache]: Analyzing trace with hash 1747430856, now seen corresponding path program 5 times [2021-01-06 16:38:08,666 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 16:38:08,666 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876836362] [2021-01-06 16:38:08,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 16:38:08,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:38:09,452 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 5 proven. 51 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-01-06 16:38:09,452 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876836362] [2021-01-06 16:38:09,452 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [623702681] [2021-01-06 16:38:09,452 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate-bitabs/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 [2021-01-06 16:38:09,619 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2021-01-06 16:38:09,619 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-06 16:38:09,621 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 34 conjunts are in the unsatisfiable core [2021-01-06 16:38:09,622 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 16:38:09,951 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:38:10,088 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 16:38:10,089 INFO L382 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 36 treesize of output 27 [2021-01-06 16:38:10,090 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 16:38:10,106 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:38:10,107 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 16:38:10,107 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:50, output treesize:47 [2021-01-06 16:38:10,253 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 16:38:10,255 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:38:10,255 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 31 [2021-01-06 16:38:10,257 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 16:38:10,269 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:38:10,275 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 16:38:10,275 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:59, output treesize:31 [2021-01-06 16:38:10,448 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 16:38:10,450 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 16:38:10,451 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 16:38:10,453 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:38:10,453 INFO L382 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 [2021-01-06 16:38:10,454 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 16:38:10,465 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:38:10,466 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 16:38:10,467 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:46, output treesize:19 [2021-01-06 16:38:10,503 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:38:10,505 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:38:10,507 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:38:10,550 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 20 proven. 35 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-01-06 16:38:10,550 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 16:38:10,550 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 34 [2021-01-06 16:38:10,550 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605113433] [2021-01-06 16:38:10,551 INFO L461 AbstractCegarLoop]: Interpolant automaton has 34 states [2021-01-06 16:38:10,551 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 16:38:10,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2021-01-06 16:38:10,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=956, Unknown=0, NotChecked=0, Total=1122 [2021-01-06 16:38:10,552 INFO L87 Difference]: Start difference. First operand 296 states and 371 transitions. Second operand 34 states. [2021-01-06 16:38:13,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 16:38:13,666 INFO L93 Difference]: Finished difference Result 656 states and 819 transitions. [2021-01-06 16:38:13,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2021-01-06 16:38:13,667 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 45 [2021-01-06 16:38:13,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 16:38:13,670 INFO L225 Difference]: With dead ends: 656 [2021-01-06 16:38:13,670 INFO L226 Difference]: Without dead ends: 552 [2021-01-06 16:38:13,672 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 30 SyntacticMatches, 4 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1802 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=704, Invalid=4996, Unknown=0, NotChecked=0, Total=5700 [2021-01-06 16:38:13,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2021-01-06 16:38:13,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 369. [2021-01-06 16:38:13,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 369 states. [2021-01-06 16:38:13,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 470 transitions. [2021-01-06 16:38:13,722 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 470 transitions. Word has length 45 [2021-01-06 16:38:13,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 16:38:13,722 INFO L481 AbstractCegarLoop]: Abstraction has 369 states and 470 transitions. [2021-01-06 16:38:13,722 INFO L482 AbstractCegarLoop]: Interpolant automaton has 34 states. [2021-01-06 16:38:13,722 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 470 transitions. [2021-01-06 16:38:13,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-01-06 16:38:13,723 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 16:38:13,723 INFO L422 BasicCegarLoop]: trace histogram [5, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 16:38:13,936 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2021-01-06 16:38:13,937 INFO L429 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 16:38:13,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 16:38:13,938 INFO L82 PathProgramCache]: Analyzing trace with hash -583456118, now seen corresponding path program 2 times [2021-01-06 16:38:13,938 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 16:38:13,938 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436437295] [2021-01-06 16:38:13,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 16:38:13,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:38:15,044 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 52 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 16:38:15,045 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436437295] [2021-01-06 16:38:15,045 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1245047879] [2021-01-06 16:38:15,045 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate-bitabs/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 [2021-01-06 16:38:15,104 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-01-06 16:38:15,104 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-06 16:38:15,105 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 43 conjunts are in the unsatisfiable core [2021-01-06 16:38:15,106 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 16:38:15,217 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:38:15,335 INFO L348 Elim1Store]: treesize reduction 39, result has 22.0 percent of original size [2021-01-06 16:38:15,335 INFO L382 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 36 treesize of output 27 [2021-01-06 16:38:15,337 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 16:38:15,349 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:38:15,350 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 16:38:15,350 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:47, output treesize:44 [2021-01-06 16:38:15,705 INFO L348 Elim1Store]: treesize reduction 17, result has 85.8 percent of original size [2021-01-06 16:38:15,706 INFO L382 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 49 treesize of output 121 [2021-01-06 16:38:15,708 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 16:38:15,708 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:38:15,710 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 16:38:15,762 INFO L625 ElimStorePlain]: treesize reduction 99, result has 28.3 percent of original size [2021-01-06 16:38:15,765 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-01-06 16:38:15,765 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:68, output treesize:36 [2021-01-06 16:38:16,073 INFO L348 Elim1Store]: treesize reduction 72, result has 65.4 percent of original size [2021-01-06 16:38:16,074 INFO L382 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 46 treesize of output 151 [2021-01-06 16:38:16,076 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:38:16,078 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:38:16,078 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:38:16,083 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 16:38:16,138 INFO L625 ElimStorePlain]: treesize reduction 81, result has 40.9 percent of original size [2021-01-06 16:38:16,141 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-01-06 16:38:16,141 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:60, output treesize:56 [2021-01-06 16:38:16,806 WARN L197 SmtUtils]: Spent 295.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 74 [2021-01-06 16:38:16,807 INFO L348 Elim1Store]: treesize reduction 112, result has 71.3 percent of original size [2021-01-06 16:38:16,808 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 15 case distinctions, treesize of input 61 treesize of output 296 [2021-01-06 16:38:16,813 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 1] term [2021-01-06 16:38:16,813 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-01-06 16:38:16,814 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 1] term [2021-01-06 16:38:16,814 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-06 16:38:16,815 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 1] term [2021-01-06 16:38:16,815 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 16:38:16,815 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 1] term [2021-01-06 16:38:16,815 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 16:38:16,816 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2021-01-06 16:38:16,816 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:38:16,822 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 16:38:16,822 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 16:38:16,823 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 16:38:16,823 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:38:16,825 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 16:38:16,826 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:38:16,826 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:38:16,826 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:38:16,827 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2021-01-06 16:38:16,828 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2021-01-06 16:38:16,831 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 16:38:16,832 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 16:38:16,833 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:38:16,836 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:38:16,836 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:38:16,837 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:38:16,837 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:38:16,838 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:38:16,841 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:38:16,842 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 16:38:16,842 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:38:16,843 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:38:16,851 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 16:38:16,851 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 16:38:16,851 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:38:16,852 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 16:38:16,852 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:38:16,853 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2021-01-06 16:38:16,854 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2021-01-06 16:38:16,856 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 16:38:16,856 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 16:38:16,857 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:38:16,859 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 16:38:16,859 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 16:38:16,860 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:38:16,872 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 16:38:17,051 WARN L197 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 30 [2021-01-06 16:38:17,052 INFO L625 ElimStorePlain]: treesize reduction 871, result has 6.0 percent of original size [2021-01-06 16:38:17,054 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-01-06 16:38:17,054 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:78, output treesize:53 [2021-01-06 16:38:17,630 WARN L197 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 71 [2021-01-06 16:38:17,631 INFO L348 Elim1Store]: treesize reduction 17, result has 94.2 percent of original size [2021-01-06 16:38:17,631 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 55 treesize of output 294 [2021-01-06 16:38:17,638 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 1] term [2021-01-06 16:38:17,638 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-01-06 16:38:17,638 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 1] term [2021-01-06 16:38:17,639 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-06 16:38:17,639 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 1] term [2021-01-06 16:38:17,640 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 16:38:17,640 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 1] term [2021-01-06 16:38:17,640 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 16:38:17,641 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2021-01-06 16:38:17,641 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:38:17,643 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 16:38:17,643 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 16:38:17,644 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:38:17,645 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:38:17,645 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:38:17,647 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:38:17,647 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2021-01-06 16:38:17,648 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:38:17,650 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:38:17,651 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-01-06 16:38:17,652 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-06 16:38:17,652 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 16:38:17,653 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 16:38:17,653 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:38:17,658 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2021-01-06 16:38:17,658 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:38:17,659 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:38:17,661 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:38:17,662 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:38:17,663 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:38:17,663 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:38:17,664 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2021-01-06 16:38:17,664 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:38:17,668 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 1] term [2021-01-06 16:38:17,668 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 16:38:17,669 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2021-01-06 16:38:17,669 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:38:17,670 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 16:38:17,671 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:38:17,671 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:38:17,672 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 16:38:17,673 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 16:38:17,674 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:38:17,675 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 16:38:17,676 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 16:38:17,677 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:38:17,679 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 16:38:17,680 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 16:38:17,680 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:38:17,691 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 16:38:18,010 WARN L197 SmtUtils]: Spent 318.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 38 [2021-01-06 16:38:18,011 INFO L625 ElimStorePlain]: treesize reduction 1125, result has 7.9 percent of original size [2021-01-06 16:38:18,014 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:38:18,019 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 16:38:18,026 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 16:38:18,028 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 16:38:18,029 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 16:38:18,030 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-06 16:38:18,033 INFO L547 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-01-06 16:38:18,033 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:72, output treesize:78 [2021-01-06 16:38:18,034 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 16:38:18,035 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 16:38:18,036 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-06 16:38:18,128 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 16:38:18,131 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 16:38:18,132 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-06 16:38:18,252 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 16:38:18,254 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 16:38:18,255 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-06 16:38:18,380 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 16:38:18,382 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 16:38:18,383 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-06 16:38:18,717 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:38:18,719 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:38:18,720 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:38:18,721 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:38:18,721 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 16:38:18,792 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-01-06 16:38:18,792 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 16:38:18,793 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2021-01-06 16:38:18,793 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076744751] [2021-01-06 16:38:18,793 INFO L461 AbstractCegarLoop]: Interpolant automaton has 50 states [2021-01-06 16:38:18,793 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 16:38:18,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2021-01-06 16:38:18,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=205, Invalid=2245, Unknown=0, NotChecked=0, Total=2450 [2021-01-06 16:38:18,794 INFO L87 Difference]: Start difference. First operand 369 states and 470 transitions. Second operand 50 states. [2021-01-06 16:38:22,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 16:38:22,502 INFO L93 Difference]: Finished difference Result 444 states and 554 transitions. [2021-01-06 16:38:22,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2021-01-06 16:38:22,503 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 46 [2021-01-06 16:38:22,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 16:38:22,506 INFO L225 Difference]: With dead ends: 444 [2021-01-06 16:38:22,506 INFO L226 Difference]: Without dead ends: 406 [2021-01-06 16:38:22,507 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 21 SyntacticMatches, 6 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2129 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=528, Invalid=5324, Unknown=0, NotChecked=0, Total=5852 [2021-01-06 16:38:22,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2021-01-06 16:38:22,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 302. [2021-01-06 16:38:22,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 302 states. [2021-01-06 16:38:22,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 396 transitions. [2021-01-06 16:38:22,550 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 396 transitions. Word has length 46 [2021-01-06 16:38:22,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 16:38:22,551 INFO L481 AbstractCegarLoop]: Abstraction has 302 states and 396 transitions. [2021-01-06 16:38:22,551 INFO L482 AbstractCegarLoop]: Interpolant automaton has 50 states. [2021-01-06 16:38:22,551 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 396 transitions. [2021-01-06 16:38:22,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2021-01-06 16:38:22,552 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 16:38:22,552 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 16:38:22,766 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2021-01-06 16:38:22,766 INFO L429 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 16:38:22,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 16:38:22,767 INFO L82 PathProgramCache]: Analyzing trace with hash 1547861096, now seen corresponding path program 6 times [2021-01-06 16:38:22,767 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 16:38:22,767 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833692564] [2021-01-06 16:38:22,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 16:38:22,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:38:23,035 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 3 proven. 31 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-01-06 16:38:23,035 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833692564] [2021-01-06 16:38:23,035 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1656516935] [2021-01-06 16:38:23,035 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate-bitabs/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 [2021-01-06 16:38:23,212 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2021-01-06 16:38:23,213 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-06 16:38:23,214 INFO L263 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 20 conjunts are in the unsatisfiable core [2021-01-06 16:38:23,215 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 16:38:23,525 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 3 proven. 31 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-01-06 16:38:23,525 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 16:38:23,525 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 20 [2021-01-06 16:38:23,525 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598882373] [2021-01-06 16:38:23,526 INFO L461 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-01-06 16:38:23,526 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 16:38:23,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-01-06 16:38:23,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=322, Unknown=0, NotChecked=0, Total=380 [2021-01-06 16:38:23,527 INFO L87 Difference]: Start difference. First operand 302 states and 396 transitions. Second operand 20 states. [2021-01-06 16:38:24,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 16:38:24,196 INFO L93 Difference]: Finished difference Result 828 states and 1079 transitions. [2021-01-06 16:38:24,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-01-06 16:38:24,197 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 47 [2021-01-06 16:38:24,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 16:38:24,200 INFO L225 Difference]: With dead ends: 828 [2021-01-06 16:38:24,200 INFO L226 Difference]: Without dead ends: 620 [2021-01-06 16:38:24,201 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=121, Invalid=635, Unknown=0, NotChecked=0, Total=756 [2021-01-06 16:38:24,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 620 states. [2021-01-06 16:38:24,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 620 to 406. [2021-01-06 16:38:24,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 406 states. [2021-01-06 16:38:24,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 406 states and 512 transitions. [2021-01-06 16:38:24,267 INFO L78 Accepts]: Start accepts. Automaton has 406 states and 512 transitions. Word has length 47 [2021-01-06 16:38:24,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 16:38:24,267 INFO L481 AbstractCegarLoop]: Abstraction has 406 states and 512 transitions. [2021-01-06 16:38:24,267 INFO L482 AbstractCegarLoop]: Interpolant automaton has 20 states. [2021-01-06 16:38:24,267 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 512 transitions. [2021-01-06 16:38:24,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-01-06 16:38:24,268 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 16:38:24,268 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 16:38:24,481 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,23 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 16:38:24,482 INFO L429 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 16:38:24,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 16:38:24,483 INFO L82 PathProgramCache]: Analyzing trace with hash 972601763, now seen corresponding path program 2 times [2021-01-06 16:38:24,483 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 16:38:24,483 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644660464] [2021-01-06 16:38:24,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 16:38:24,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:38:25,062 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 3 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 16:38:25,062 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644660464] [2021-01-06 16:38:25,062 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [496144289] [2021-01-06 16:38:25,062 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate-bitabs/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 [2021-01-06 16:38:25,130 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-01-06 16:38:25,130 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-06 16:38:25,131 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 33 conjunts are in the unsatisfiable core [2021-01-06 16:38:25,132 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 16:38:25,280 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2021-01-06 16:38:25,284 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 16:38:25,287 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 16:38:25,290 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 16:38:25,291 INFO L382 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 16 treesize of output 20 [2021-01-06 16:38:25,293 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-06 16:38:25,299 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:38:25,300 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-06 16:38:25,309 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:38:25,310 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 16:38:25,311 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:17 [2021-01-06 16:38:25,439 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:38:25,441 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:38:25,443 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:38:25,444 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:38:25,445 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 16:38:25,484 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 3 proven. 35 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-01-06 16:38:25,484 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 16:38:25,484 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15] total 21 [2021-01-06 16:38:25,485 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515700681] [2021-01-06 16:38:25,485 INFO L461 AbstractCegarLoop]: Interpolant automaton has 21 states [2021-01-06 16:38:25,485 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 16:38:25,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-01-06 16:38:25,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=348, Unknown=0, NotChecked=0, Total=420 [2021-01-06 16:38:25,486 INFO L87 Difference]: Start difference. First operand 406 states and 512 transitions. Second operand 21 states. [2021-01-06 16:38:26,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 16:38:26,896 INFO L93 Difference]: Finished difference Result 504 states and 639 transitions. [2021-01-06 16:38:26,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2021-01-06 16:38:26,897 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 48 [2021-01-06 16:38:26,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 16:38:26,899 INFO L225 Difference]: With dead ends: 504 [2021-01-06 16:38:26,899 INFO L226 Difference]: Without dead ends: 487 [2021-01-06 16:38:26,900 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 45 SyntacticMatches, 8 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 343 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=289, Invalid=1351, Unknown=0, NotChecked=0, Total=1640 [2021-01-06 16:38:26,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 487 states. [2021-01-06 16:38:26,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 487 to 386. [2021-01-06 16:38:26,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2021-01-06 16:38:26,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 484 transitions. [2021-01-06 16:38:26,957 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 484 transitions. Word has length 48 [2021-01-06 16:38:26,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 16:38:26,958 INFO L481 AbstractCegarLoop]: Abstraction has 386 states and 484 transitions. [2021-01-06 16:38:26,958 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2021-01-06 16:38:26,958 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 484 transitions. [2021-01-06 16:38:26,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2021-01-06 16:38:26,959 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 16:38:26,959 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 16:38:27,173 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2021-01-06 16:38:27,174 INFO L429 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 16:38:27,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 16:38:27,175 INFO L82 PathProgramCache]: Analyzing trace with hash 2023640862, now seen corresponding path program 1 times [2021-01-06 16:38:27,175 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 16:38:27,175 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116535698] [2021-01-06 16:38:27,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 16:38:27,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:38:27,810 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 1 proven. 60 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-01-06 16:38:27,811 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116535698] [2021-01-06 16:38:27,811 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [64525257] [2021-01-06 16:38:27,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 16:38:27,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:38:27,871 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 35 conjunts are in the unsatisfiable core [2021-01-06 16:38:27,873 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 16:38:28,006 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:38:28,118 INFO L348 Elim1Store]: treesize reduction 39, result has 22.0 percent of original size [2021-01-06 16:38:28,119 INFO L382 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 36 treesize of output 27 [2021-01-06 16:38:28,120 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 16:38:28,132 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:38:28,133 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 16:38:28,133 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:42, output treesize:38 [2021-01-06 16:38:28,492 INFO L348 Elim1Store]: treesize reduction 17, result has 85.8 percent of original size [2021-01-06 16:38:28,492 INFO L382 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 48 treesize of output 121 [2021-01-06 16:38:28,494 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 16:38:28,495 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:38:28,497 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 16:38:28,539 INFO L625 ElimStorePlain]: treesize reduction 98, result has 26.3 percent of original size [2021-01-06 16:38:28,542 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-06 16:38:28,542 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:62, output treesize:27 [2021-01-06 16:38:28,691 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:38:28,692 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:38:28,693 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:38:28,743 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-01-06 16:38:28,743 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 16:38:28,743 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 18] total 34 [2021-01-06 16:38:28,743 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908768482] [2021-01-06 16:38:28,744 INFO L461 AbstractCegarLoop]: Interpolant automaton has 34 states [2021-01-06 16:38:28,744 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 16:38:28,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2021-01-06 16:38:28,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=998, Unknown=0, NotChecked=0, Total=1122 [2021-01-06 16:38:28,745 INFO L87 Difference]: Start difference. First operand 386 states and 484 transitions. Second operand 34 states. [2021-01-06 16:38:33,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 16:38:33,624 INFO L93 Difference]: Finished difference Result 647 states and 795 transitions. [2021-01-06 16:38:33,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2021-01-06 16:38:33,625 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 49 [2021-01-06 16:38:33,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 16:38:33,628 INFO L225 Difference]: With dead ends: 647 [2021-01-06 16:38:33,628 INFO L226 Difference]: Without dead ends: 537 [2021-01-06 16:38:33,629 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 37 SyntacticMatches, 6 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4007 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=1150, Invalid=10192, Unknown=0, NotChecked=0, Total=11342 [2021-01-06 16:38:33,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2021-01-06 16:38:33,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 362. [2021-01-06 16:38:33,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 362 states. [2021-01-06 16:38:33,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 438 transitions. [2021-01-06 16:38:33,692 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 438 transitions. Word has length 49 [2021-01-06 16:38:33,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 16:38:33,692 INFO L481 AbstractCegarLoop]: Abstraction has 362 states and 438 transitions. [2021-01-06 16:38:33,692 INFO L482 AbstractCegarLoop]: Interpolant automaton has 34 states. [2021-01-06 16:38:33,692 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 438 transitions. [2021-01-06 16:38:33,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-01-06 16:38:33,693 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 16:38:33,693 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 16:38:33,906 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,25 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 16:38:33,907 INFO L429 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 16:38:33,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 16:38:33,907 INFO L82 PathProgramCache]: Analyzing trace with hash 503230019, now seen corresponding path program 7 times [2021-01-06 16:38:33,908 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 16:38:33,908 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516062616] [2021-01-06 16:38:33,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 16:38:33,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:38:34,524 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-01-06 16:38:34,524 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516062616] [2021-01-06 16:38:34,524 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [537336] [2021-01-06 16:38:34,524 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 16:38:34,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:38:34,599 INFO L263 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 39 conjunts are in the unsatisfiable core [2021-01-06 16:38:34,600 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 16:38:34,679 INFO L382 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 15 treesize of output 11 [2021-01-06 16:38:34,680 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 16:38:34,689 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:38:34,691 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 16:38:34,691 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:10 [2021-01-06 16:38:34,743 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:38:34,849 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 16:38:34,850 INFO L382 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 28 treesize of output 27 [2021-01-06 16:38:34,852 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 16:38:34,863 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:38:34,865 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 16:38:34,865 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:31 [2021-01-06 16:38:35,004 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 16:38:35,006 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 16:38:35,007 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 16:38:35,009 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:38:35,009 INFO L382 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 [2021-01-06 16:38:35,011 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 16:38:35,022 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:38:35,023 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 16:38:35,024 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:44, output treesize:17 [2021-01-06 16:38:35,182 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:38:35,183 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:38:35,184 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:38:35,185 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:38:35,186 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 16:38:35,229 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2021-01-06 16:38:35,229 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 16:38:35,229 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 28 [2021-01-06 16:38:35,229 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780534206] [2021-01-06 16:38:35,229 INFO L461 AbstractCegarLoop]: Interpolant automaton has 28 states [2021-01-06 16:38:35,230 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 16:38:35,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2021-01-06 16:38:35,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=647, Unknown=0, NotChecked=0, Total=756 [2021-01-06 16:38:35,230 INFO L87 Difference]: Start difference. First operand 362 states and 438 transitions. Second operand 28 states. [2021-01-06 16:38:36,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 16:38:36,980 INFO L93 Difference]: Finished difference Result 568 states and 700 transitions. [2021-01-06 16:38:36,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2021-01-06 16:38:36,981 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 51 [2021-01-06 16:38:36,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 16:38:36,983 INFO L225 Difference]: With dead ends: 568 [2021-01-06 16:38:36,983 INFO L226 Difference]: Without dead ends: 471 [2021-01-06 16:38:36,984 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 39 SyntacticMatches, 8 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 479 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=305, Invalid=1675, Unknown=0, NotChecked=0, Total=1980 [2021-01-06 16:38:36,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 471 states. [2021-01-06 16:38:37,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 471 to 413. [2021-01-06 16:38:37,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 413 states. [2021-01-06 16:38:37,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 498 transitions. [2021-01-06 16:38:37,058 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 498 transitions. Word has length 51 [2021-01-06 16:38:37,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 16:38:37,059 INFO L481 AbstractCegarLoop]: Abstraction has 413 states and 498 transitions. [2021-01-06 16:38:37,059 INFO L482 AbstractCegarLoop]: Interpolant automaton has 28 states. [2021-01-06 16:38:37,059 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 498 transitions. [2021-01-06 16:38:37,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-01-06 16:38:37,060 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 16:38:37,060 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 16:38:37,275 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2021-01-06 16:38:37,276 INFO L429 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 16:38:37,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 16:38:37,277 INFO L82 PathProgramCache]: Analyzing trace with hash -663049668, now seen corresponding path program 3 times [2021-01-06 16:38:37,277 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 16:38:37,277 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546103987] [2021-01-06 16:38:37,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 16:38:37,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:38:37,979 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 0 proven. 75 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-01-06 16:38:37,980 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546103987] [2021-01-06 16:38:37,980 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [584873228] [2021-01-06 16:38:37,980 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 16:38:38,283 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2021-01-06 16:38:38,283 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-06 16:38:38,285 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 49 conjunts are in the unsatisfiable core [2021-01-06 16:38:38,286 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 16:38:38,459 INFO L382 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 15 treesize of output 11 [2021-01-06 16:38:38,460 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 16:38:38,467 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:38:38,468 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 16:38:38,468 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:7 [2021-01-06 16:38:38,560 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:38:38,690 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 16:38:38,691 INFO L382 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 28 treesize of output 27 [2021-01-06 16:38:38,693 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 16:38:38,704 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:38:38,705 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 16:38:38,705 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:34, output treesize:27 [2021-01-06 16:38:38,893 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 16:38:38,894 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 16:38:38,896 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 16:38:38,898 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:38:38,898 INFO L382 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 37 treesize of output 39 [2021-01-06 16:38:38,899 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 16:38:38,910 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:38:38,911 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 16:38:38,912 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:43, output treesize:28 [2021-01-06 16:38:39,112 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 16:38:39,113 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 16:38:39,115 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 16:38:39,117 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:38:39,117 INFO L382 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 29 treesize of output 31 [2021-01-06 16:38:39,120 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 16:38:39,127 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:38:39,129 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 16:38:39,129 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:19 [2021-01-06 16:38:39,411 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:38:39,412 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:38:39,413 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:38:39,477 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 0 proven. 63 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-01-06 16:38:39,477 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 16:38:39,477 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 40 [2021-01-06 16:38:39,477 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593371880] [2021-01-06 16:38:39,478 INFO L461 AbstractCegarLoop]: Interpolant automaton has 40 states [2021-01-06 16:38:39,478 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 16:38:39,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2021-01-06 16:38:39,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=1389, Unknown=0, NotChecked=0, Total=1560 [2021-01-06 16:38:39,479 INFO L87 Difference]: Start difference. First operand 413 states and 498 transitions. Second operand 40 states. [2021-01-06 16:38:41,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 16:38:41,660 INFO L93 Difference]: Finished difference Result 656 states and 802 transitions. [2021-01-06 16:38:41,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2021-01-06 16:38:41,662 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 52 [2021-01-06 16:38:41,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 16:38:41,665 INFO L225 Difference]: With dead ends: 656 [2021-01-06 16:38:41,665 INFO L226 Difference]: Without dead ends: 578 [2021-01-06 16:38:41,665 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 37 SyntacticMatches, 3 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1002 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=387, Invalid=3153, Unknown=0, NotChecked=0, Total=3540 [2021-01-06 16:38:41,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2021-01-06 16:38:41,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 439. [2021-01-06 16:38:41,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 439 states. [2021-01-06 16:38:41,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 439 states and 533 transitions. [2021-01-06 16:38:41,746 INFO L78 Accepts]: Start accepts. Automaton has 439 states and 533 transitions. Word has length 52 [2021-01-06 16:38:41,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 16:38:41,746 INFO L481 AbstractCegarLoop]: Abstraction has 439 states and 533 transitions. [2021-01-06 16:38:41,746 INFO L482 AbstractCegarLoop]: Interpolant automaton has 40 states. [2021-01-06 16:38:41,746 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 533 transitions. [2021-01-06 16:38:41,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-01-06 16:38:41,747 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 16:38:41,747 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 16:38:41,952 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2021-01-06 16:38:41,953 INFO L429 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 16:38:41,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 16:38:41,954 INFO L82 PathProgramCache]: Analyzing trace with hash -169981182, now seen corresponding path program 4 times [2021-01-06 16:38:41,954 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 16:38:41,954 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706456091] [2021-01-06 16:38:41,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 16:38:41,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:38:42,373 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 3 proven. 72 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-01-06 16:38:42,374 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706456091] [2021-01-06 16:38:42,374 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1283117144] [2021-01-06 16:38:42,374 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 16:38:42,465 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-01-06 16:38:42,465 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-06 16:38:42,467 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 31 conjunts are in the unsatisfiable core [2021-01-06 16:38:42,469 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 16:38:42,593 INFO L382 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 [2021-01-06 16:38:42,594 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 16:38:42,603 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:38:42,605 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 16:38:42,605 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:23, output treesize:7 [2021-01-06 16:38:42,737 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:38:42,861 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 16:38:42,862 INFO L382 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 [2021-01-06 16:38:42,864 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 16:38:42,876 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:38:42,878 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 16:38:42,878 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:35, output treesize:28 [2021-01-06 16:38:43,043 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 16:38:43,044 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 16:38:43,046 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 16:38:43,048 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:38:43,048 INFO L382 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 [2021-01-06 16:38:43,050 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 16:38:43,060 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:38:43,062 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 16:38:43,062 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:38, output treesize:19 [2021-01-06 16:38:43,228 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:38:43,234 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:38:43,236 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:38:43,280 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2021-01-06 16:38:43,280 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 16:38:43,280 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 17] total 34 [2021-01-06 16:38:43,281 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002350990] [2021-01-06 16:38:43,281 INFO L461 AbstractCegarLoop]: Interpolant automaton has 34 states [2021-01-06 16:38:43,281 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 16:38:43,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2021-01-06 16:38:43,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=975, Unknown=0, NotChecked=0, Total=1122 [2021-01-06 16:38:43,282 INFO L87 Difference]: Start difference. First operand 439 states and 533 transitions. Second operand 34 states. [2021-01-06 16:38:45,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 16:38:45,482 INFO L93 Difference]: Finished difference Result 663 states and 814 transitions. [2021-01-06 16:38:45,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2021-01-06 16:38:45,483 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 52 [2021-01-06 16:38:45,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 16:38:45,485 INFO L225 Difference]: With dead ends: 663 [2021-01-06 16:38:45,485 INFO L226 Difference]: Without dead ends: 661 [2021-01-06 16:38:45,486 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1010 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=499, Invalid=3161, Unknown=0, NotChecked=0, Total=3660 [2021-01-06 16:38:45,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 661 states. [2021-01-06 16:38:45,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 661 to 511. [2021-01-06 16:38:45,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 511 states. [2021-01-06 16:38:45,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 511 states to 511 states and 631 transitions. [2021-01-06 16:38:45,559 INFO L78 Accepts]: Start accepts. Automaton has 511 states and 631 transitions. Word has length 52 [2021-01-06 16:38:45,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 16:38:45,559 INFO L481 AbstractCegarLoop]: Abstraction has 511 states and 631 transitions. [2021-01-06 16:38:45,559 INFO L482 AbstractCegarLoop]: Interpolant automaton has 34 states. [2021-01-06 16:38:45,560 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states and 631 transitions. [2021-01-06 16:38:45,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2021-01-06 16:38:45,561 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 16:38:45,561 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 16:38:45,773 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2021-01-06 16:38:45,774 INFO L429 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 16:38:45,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 16:38:45,776 INFO L82 PathProgramCache]: Analyzing trace with hash 1569114548, now seen corresponding path program 2 times [2021-01-06 16:38:45,776 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 16:38:45,777 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976467506] [2021-01-06 16:38:45,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 16:38:45,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-01-06 16:38:45,828 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-01-06 16:38:45,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-01-06 16:38:45,871 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-01-06 16:38:45,904 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-01-06 16:38:45,905 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2021-01-06 16:38:45,906 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-01-06 16:38:45,997 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.01 04:38:45 BoogieIcfgContainer [2021-01-06 16:38:45,997 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-01-06 16:38:45,998 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-01-06 16:38:45,998 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-01-06 16:38:45,998 INFO L275 PluginConnector]: Witness Printer initialized [2021-01-06 16:38:45,999 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 04:37:14" (3/4) ... [2021-01-06 16:38:46,001 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-01-06 16:38:46,089 INFO L141 WitnessManager]: Wrote witness to /storage/repos/svcomp/c/loops/insertion_sort-1.c-witness.graphml [2021-01-06 16:38:46,089 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-01-06 16:38:46,090 INFO L168 Benchmark]: Toolchain (without parser) took 92776.22 ms. Allocated memory was 151.0 MB in the beginning and 327.2 MB in the end (delta: 176.2 MB). Free memory was 126.0 MB in the beginning and 237.1 MB in the end (delta: -111.1 MB). Peak memory consumption was 66.3 MB. Max. memory is 8.0 GB. [2021-01-06 16:38:46,090 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 151.0 MB. Free memory is still 122.6 MB. There was no memory consumed. Max. memory is 8.0 GB. [2021-01-06 16:38:46,091 INFO L168 Benchmark]: CACSL2BoogieTranslator took 268.40 ms. Allocated memory is still 151.0 MB. Free memory was 125.8 MB in the beginning and 115.5 MB in the end (delta: 10.3 MB). Peak memory consumption was 10.5 MB. Max. memory is 8.0 GB. [2021-01-06 16:38:46,092 INFO L168 Benchmark]: Boogie Procedure Inliner took 67.06 ms. Allocated memory is still 151.0 MB. Free memory was 115.5 MB in the beginning and 113.9 MB in the end (delta: 1.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2021-01-06 16:38:46,092 INFO L168 Benchmark]: Boogie Preprocessor took 56.33 ms. Allocated memory is still 151.0 MB. Free memory was 113.9 MB in the beginning and 112.6 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. [2021-01-06 16:38:46,092 INFO L168 Benchmark]: RCFGBuilder took 365.60 ms. Allocated memory is still 151.0 MB. Free memory was 112.6 MB in the beginning and 97.1 MB in the end (delta: 15.5 MB). Peak memory consumption was 15.7 MB. Max. memory is 8.0 GB. [2021-01-06 16:38:46,093 INFO L168 Benchmark]: TraceAbstraction took 91912.87 ms. Allocated memory was 151.0 MB in the beginning and 327.2 MB in the end (delta: 176.2 MB). Free memory was 96.7 MB in the beginning and 241.3 MB in the end (delta: -144.6 MB). Peak memory consumption was 32.7 MB. Max. memory is 8.0 GB. [2021-01-06 16:38:46,093 INFO L168 Benchmark]: Witness Printer took 91.33 ms. Allocated memory is still 327.2 MB. Free memory was 241.3 MB in the beginning and 237.1 MB in the end (delta: 4.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 8.0 GB. [2021-01-06 16:38:46,097 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 151.0 MB. Free memory is still 122.6 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 268.40 ms. Allocated memory is still 151.0 MB. Free memory was 125.8 MB in the beginning and 115.5 MB in the end (delta: 10.3 MB). Peak memory consumption was 10.5 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 67.06 ms. Allocated memory is still 151.0 MB. Free memory was 115.5 MB in the beginning and 113.9 MB in the end (delta: 1.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 56.33 ms. Allocated memory is still 151.0 MB. Free memory was 113.9 MB in the beginning and 112.6 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. * RCFGBuilder took 365.60 ms. Allocated memory is still 151.0 MB. Free memory was 112.6 MB in the beginning and 97.1 MB in the end (delta: 15.5 MB). Peak memory consumption was 15.7 MB. Max. memory is 8.0 GB. * TraceAbstraction took 91912.87 ms. Allocated memory was 151.0 MB in the beginning and 327.2 MB in the end (delta: 176.2 MB). Free memory was 96.7 MB in the beginning and 241.3 MB in the end (delta: -144.6 MB). Peak memory consumption was 32.7 MB. Max. memory is 8.0 GB. * Witness Printer took 91.33 ms. Allocated memory is still 327.2 MB. Free memory was 241.3 MB in the beginning and 237.1 MB in the end (delta: 4.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 7]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L14] unsigned int SIZE=__VERIFIER_nondet_uint(); [L15] int i, j, k, key; [L16] int v[SIZE]; [L17] j=0 [L17] COND TRUE j=0) && (v[i]>key) [L22] EXPR v[i] [L22] (i>=0) && (v[i]>key) [L22] COND FALSE !((i>=0) && (v[i]>key)) [L27] v[i+1] = key [L19] j++ [L19] COND TRUE j=0) && (v[i]>key) [L22] EXPR v[i] [L22] (i>=0) && (v[i]>key) [L22] COND FALSE !((i>=0) && (v[i]>key)) [L27] v[i+1] = key [L19] j++ [L19] COND TRUE j=0) && (v[i]>key) [L22] EXPR v[i] [L22] (i>=0) && (v[i]>key) [L22] COND TRUE (i>=0) && (v[i]>key) [L23] COND FALSE !(i<2) [L25] i = i - 1 [L22] (i>=0) && (v[i]>key) [L22] EXPR v[i] [L22] (i>=0) && (v[i]>key) [L22] COND TRUE (i>=0) && (v[i]>key) [L23] COND TRUE i<2 [L24] EXPR v[i] [L24] v[i+1] = v[i] [L25] i = i - 1 [L22] (i>=0) && (v[i]>key) [L22] EXPR v[i] [L22] (i>=0) && (v[i]>key) [L22] COND FALSE !((i>=0) && (v[i]>key)) [L27] v[i+1] = key [L19] j++ [L19] COND FALSE !(j