/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/array-patterns/array18_pattern.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-178dd20 [2021-01-06 10:54:09,165 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-01-06 10:54:09,168 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-01-06 10:54:09,202 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-01-06 10:54:09,203 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-01-06 10:54:09,205 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-01-06 10:54:09,206 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-01-06 10:54:09,209 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-01-06 10:54:09,211 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-01-06 10:54:09,212 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-01-06 10:54:09,214 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-01-06 10:54:09,215 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-01-06 10:54:09,216 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-01-06 10:54:09,217 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-01-06 10:54:09,218 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-01-06 10:54:09,220 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-01-06 10:54:09,221 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-01-06 10:54:09,222 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-01-06 10:54:09,225 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-01-06 10:54:09,227 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-01-06 10:54:09,229 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-01-06 10:54:09,231 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-01-06 10:54:09,232 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-01-06 10:54:09,233 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-01-06 10:54:09,236 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-01-06 10:54:09,237 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-01-06 10:54:09,237 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-01-06 10:54:09,239 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-01-06 10:54:09,239 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-01-06 10:54:09,241 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-01-06 10:54:09,241 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-01-06 10:54:09,242 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-01-06 10:54:09,243 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-01-06 10:54:09,244 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-01-06 10:54:09,245 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-01-06 10:54:09,246 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-01-06 10:54:09,247 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-01-06 10:54:09,247 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-01-06 10:54:09,247 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-01-06 10:54:09,273 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-01-06 10:54:09,274 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-01-06 10:54:09,278 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 10:54:09,332 INFO L113 SettingsManager]: Loading preferences was successful [2021-01-06 10:54:09,332 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-01-06 10:54:09,334 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-01-06 10:54:09,334 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-01-06 10:54:09,334 INFO L138 SettingsManager]: * Use SBE=true [2021-01-06 10:54:09,335 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-01-06 10:54:09,337 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-01-06 10:54:09,337 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-01-06 10:54:09,337 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-01-06 10:54:09,338 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-01-06 10:54:09,339 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-01-06 10:54:09,339 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-01-06 10:54:09,339 INFO L138 SettingsManager]: * Use constant arrays=true [2021-01-06 10:54:09,339 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-01-06 10:54:09,340 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-01-06 10:54:09,340 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-01-06 10:54:09,340 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-01-06 10:54:09,340 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-06 10:54:09,340 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-01-06 10:54:09,341 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-01-06 10:54:09,341 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-01-06 10:54:09,341 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-01-06 10:54:09,341 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-01-06 10:54:09,341 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-01-06 10:54:09,341 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-01-06 10:54:09,342 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 10:54:09,712 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-01-06 10:54:09,751 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-01-06 10:54:09,754 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-01-06 10:54:09,755 INFO L271 PluginConnector]: Initializing CDTParser... [2021-01-06 10:54:09,756 INFO L275 PluginConnector]: CDTParser initialized [2021-01-06 10:54:09,757 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-patterns/array18_pattern.c [2021-01-06 10:54:09,843 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/e15755dc0/dd3d3ae05dae4fec8f8e800903f3aa66/FLAG088c626a3 [2021-01-06 10:54:10,359 INFO L306 CDTParser]: Found 1 translation units. [2021-01-06 10:54:10,360 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/array-patterns/array18_pattern.c [2021-01-06 10:54:10,368 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/e15755dc0/dd3d3ae05dae4fec8f8e800903f3aa66/FLAG088c626a3 [2021-01-06 10:54:10,721 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/e15755dc0/dd3d3ae05dae4fec8f8e800903f3aa66 [2021-01-06 10:54:10,724 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-01-06 10:54:10,727 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-01-06 10:54:10,728 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-01-06 10:54:10,728 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-01-06 10:54:10,732 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-01-06 10:54:10,733 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 10:54:10" (1/1) ... [2021-01-06 10:54:10,735 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@40d0e1b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 10:54:10, skipping insertion in model container [2021-01-06 10:54:10,735 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 10:54:10" (1/1) ... [2021-01-06 10:54:10,743 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-01-06 10:54:10,760 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-01-06 10:54:10,915 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/array-patterns/array18_pattern.c[1444,1457] left hand side expression in assignment: lhs: VariableLHS[~ARR_SIZE~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~row~0,] left hand side expression in assignment: lhs: VariableLHS[~column~0,] left hand side expression in assignment: lhs: ArrayLHS[ArrayLHS[VariableLHS[~array~0,],[IdentifierExpression[~row~0,]]],[IdentifierExpression[~column~0,]]] left hand side expression in assignment: lhs: VariableLHS[~index1~0,] left hand side expression in assignment: lhs: VariableLHS[~index2~0,] left hand side expression in assignment: lhs: ArrayLHS[ArrayLHS[VariableLHS[~array~0,],[IdentifierExpression[~index1~0,]]],[IdentifierExpression[~index2~0,]]] left hand side expression in assignment: lhs: ArrayLHS[ArrayLHS[VariableLHS[~array~0,],[BinaryExpression[ARITHMINUS,BinaryExpression[ARITHMINUS,IdentifierExpression[~ARR_SIZE~0,GLOBAL],IntegerLiteral[1]],IdentifierExpression[~index1~0,]]]],[IdentifierExpression[~index2~0,]]] left hand side expression in assignment: lhs: VariableLHS[~temp~0,] left hand side expression in assignment: lhs: VariableLHS[~row~0,] left hand side expression in assignment: lhs: VariableLHS[~column~0,] left hand side expression in assignment: lhs: VariableLHS[~sum~0,] [2021-01-06 10:54:10,944 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 10:54:10,954 INFO L203 MainTranslator]: Completed pre-run [2021-01-06 10:54:10,969 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/array-patterns/array18_pattern.c[1444,1457] left hand side expression in assignment: lhs: VariableLHS[~ARR_SIZE~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~row~0,] left hand side expression in assignment: lhs: VariableLHS[~column~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#array~0,],base],BinaryExpression[ARITHPLUS,BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[~#array~0,],offset],BinaryExpression[ARITHMUL,IdentifierExpression[~row~0,],BinaryExpression[ARITHMUL,IntegerLiteral[4],IdentifierExpression[~ARR_SIZE~0,GLOBAL]]]],BinaryExpression[ARITHMUL,IntegerLiteral[4],IdentifierExpression[~column~0,]]]]] left hand side expression in assignment: lhs: VariableLHS[~index1~0,] left hand side expression in assignment: lhs: VariableLHS[~index2~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#array~0,],base],BinaryExpression[ARITHPLUS,BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[~#array~0,],offset],BinaryExpression[ARITHMUL,IdentifierExpression[~index1~0,],BinaryExpression[ARITHMUL,IntegerLiteral[4],IdentifierExpression[~ARR_SIZE~0,GLOBAL]]]],BinaryExpression[ARITHMUL,IntegerLiteral[4],IdentifierExpression[~index2~0,]]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#array~0,],base],BinaryExpression[ARITHPLUS,BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[~#array~0,],offset],BinaryExpression[ARITHMUL,BinaryExpression[ARITHMINUS,BinaryExpression[ARITHMINUS,IdentifierExpression[~ARR_SIZE~0,GLOBAL],IntegerLiteral[1]],IdentifierExpression[~index1~0,]],BinaryExpression[ARITHMUL,IntegerLiteral[4],IdentifierExpression[~ARR_SIZE~0,GLOBAL]]]],BinaryExpression[ARITHMUL,IntegerLiteral[4],IdentifierExpression[~index2~0,]]]]] left hand side expression in assignment: lhs: VariableLHS[~temp~0,] left hand side expression in assignment: lhs: VariableLHS[~row~0,] left hand side expression in assignment: lhs: VariableLHS[~column~0,] left hand side expression in assignment: lhs: VariableLHS[~sum~0,] [2021-01-06 10:54:10,983 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 10:54:11,000 INFO L208 MainTranslator]: Completed translation [2021-01-06 10:54:11,001 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 10:54:11 WrapperNode [2021-01-06 10:54:11,001 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-01-06 10:54:11,002 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-01-06 10:54:11,003 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-01-06 10:54:11,003 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-01-06 10:54:11,012 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 10:54:11" (1/1) ... [2021-01-06 10:54:11,021 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 10:54:11" (1/1) ... [2021-01-06 10:54:11,076 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-01-06 10:54:11,080 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-01-06 10:54:11,080 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-01-06 10:54:11,081 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-01-06 10:54:11,090 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 10:54:11" (1/1) ... [2021-01-06 10:54:11,090 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 10:54:11" (1/1) ... [2021-01-06 10:54:11,105 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 10:54:11" (1/1) ... [2021-01-06 10:54:11,107 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 10:54:11" (1/1) ... [2021-01-06 10:54:11,120 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 10:54:11" (1/1) ... [2021-01-06 10:54:11,133 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 10:54:11" (1/1) ... [2021-01-06 10:54:11,136 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 10:54:11" (1/1) ... [2021-01-06 10:54:11,144 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-01-06 10:54:11,147 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-01-06 10:54:11,147 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-01-06 10:54:11,148 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-01-06 10:54:11,149 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 10:54:11" (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 10:54:11,339 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-01-06 10:54:11,339 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-01-06 10:54:11,339 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-01-06 10:54:11,339 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-01-06 10:54:11,339 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-01-06 10:54:11,340 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-01-06 10:54:11,340 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-01-06 10:54:11,921 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-01-06 10:54:11,921 INFO L299 CfgBuilder]: Removed 17 assume(true) statements. [2021-01-06 10:54:11,923 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 10:54:11 BoogieIcfgContainer [2021-01-06 10:54:11,923 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-01-06 10:54:11,924 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-01-06 10:54:11,924 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-01-06 10:54:11,928 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-01-06 10:54:11,928 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.01 10:54:10" (1/3) ... [2021-01-06 10:54:11,928 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46fe77a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 10:54:11, skipping insertion in model container [2021-01-06 10:54:11,929 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 10:54:11" (2/3) ... [2021-01-06 10:54:11,929 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46fe77a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 10:54:11, skipping insertion in model container [2021-01-06 10:54:11,929 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 10:54:11" (3/3) ... [2021-01-06 10:54:11,931 INFO L111 eAbstractionObserver]: Analyzing ICFG array18_pattern.c [2021-01-06 10:54:11,943 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-01-06 10:54:11,956 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2021-01-06 10:54:11,980 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-01-06 10:54:12,008 INFO L377 AbstractCegarLoop]: Interprodecural is true [2021-01-06 10:54:12,008 INFO L378 AbstractCegarLoop]: Hoare is true [2021-01-06 10:54:12,008 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-01-06 10:54:12,009 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-01-06 10:54:12,009 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-01-06 10:54:12,009 INFO L382 AbstractCegarLoop]: Difference is false [2021-01-06 10:54:12,009 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-01-06 10:54:12,009 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-01-06 10:54:12,024 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states. [2021-01-06 10:54:12,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-01-06 10:54:12,030 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 10:54:12,031 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 10:54:12,032 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 10:54:12,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 10:54:12,038 INFO L82 PathProgramCache]: Analyzing trace with hash -1763201290, now seen corresponding path program 1 times [2021-01-06 10:54:12,048 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 10:54:12,048 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909840837] [2021-01-06 10:54:12,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 10:54:12,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 10:54:12,208 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 10:54:12,209 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909840837] [2021-01-06 10:54:12,210 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 10:54:12,210 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-06 10:54:12,211 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735603918] [2021-01-06 10:54:12,215 INFO L461 AbstractCegarLoop]: Interpolant automaton has 2 states [2021-01-06 10:54:12,215 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 10:54:12,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-01-06 10:54:12,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-01-06 10:54:12,233 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 2 states. [2021-01-06 10:54:12,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 10:54:12,252 INFO L93 Difference]: Finished difference Result 57 states and 88 transitions. [2021-01-06 10:54:12,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-01-06 10:54:12,254 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 11 [2021-01-06 10:54:12,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 10:54:12,263 INFO L225 Difference]: With dead ends: 57 [2021-01-06 10:54:12,263 INFO L226 Difference]: Without dead ends: 26 [2021-01-06 10:54:12,267 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-01-06 10:54:12,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2021-01-06 10:54:12,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2021-01-06 10:54:12,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2021-01-06 10:54:12,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 32 transitions. [2021-01-06 10:54:12,303 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 32 transitions. Word has length 11 [2021-01-06 10:54:12,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 10:54:12,303 INFO L481 AbstractCegarLoop]: Abstraction has 26 states and 32 transitions. [2021-01-06 10:54:12,303 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2021-01-06 10:54:12,303 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 32 transitions. [2021-01-06 10:54:12,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-01-06 10:54:12,304 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 10:54:12,305 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 10:54:12,305 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-01-06 10:54:12,305 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 10:54:12,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 10:54:12,306 INFO L82 PathProgramCache]: Analyzing trace with hash -204009896, now seen corresponding path program 1 times [2021-01-06 10:54:12,307 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 10:54:12,307 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945348002] [2021-01-06 10:54:12,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 10:54:12,326 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-01-06 10:54:12,327 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2016561585] [2021-01-06 10:54:12,327 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 10:54:12,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 10:54:12,429 INFO L263 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 7 conjunts are in the unsatisfiable core [2021-01-06 10:54:12,435 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 10:54:12,568 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 10:54:12,569 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945348002] [2021-01-06 10:54:12,569 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-01-06 10:54:12,569 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2016561585] [2021-01-06 10:54:12,570 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 10:54:12,570 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 10:54:12,570 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726330542] [2021-01-06 10:54:12,572 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 10:54:12,572 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 10:54:12,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 10:54:12,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-01-06 10:54:12,578 INFO L87 Difference]: Start difference. First operand 26 states and 32 transitions. Second operand 5 states. [2021-01-06 10:54:12,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 10:54:12,735 INFO L93 Difference]: Finished difference Result 53 states and 67 transitions. [2021-01-06 10:54:12,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-01-06 10:54:12,736 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2021-01-06 10:54:12,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 10:54:12,737 INFO L225 Difference]: With dead ends: 53 [2021-01-06 10:54:12,738 INFO L226 Difference]: Without dead ends: 35 [2021-01-06 10:54:12,739 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-01-06 10:54:12,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2021-01-06 10:54:12,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 28. [2021-01-06 10:54:12,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2021-01-06 10:54:12,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 34 transitions. [2021-01-06 10:54:12,746 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 34 transitions. Word has length 19 [2021-01-06 10:54:12,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 10:54:12,747 INFO L481 AbstractCegarLoop]: Abstraction has 28 states and 34 transitions. [2021-01-06 10:54:12,747 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 10:54:12,747 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2021-01-06 10:54:12,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-01-06 10:54:12,748 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 10:54:12,748 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 10:54:12,961 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2021-01-06 10:54:12,962 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 10:54:12,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 10:54:12,964 INFO L82 PathProgramCache]: Analyzing trace with hash -1717183807, now seen corresponding path program 1 times [2021-01-06 10:54:12,965 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 10:54:12,965 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152282910] [2021-01-06 10:54:12,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 10:54:12,985 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-01-06 10:54:12,987 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2034655614] [2021-01-06 10:54:12,988 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 10:54:13,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 10:54:13,062 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 4 conjunts are in the unsatisfiable core [2021-01-06 10:54:13,064 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 10:54:13,114 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-01-06 10:54:13,115 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152282910] [2021-01-06 10:54:13,115 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-01-06 10:54:13,115 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2034655614] [2021-01-06 10:54:13,116 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 10:54:13,116 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 10:54:13,116 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474581326] [2021-01-06 10:54:13,117 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 10:54:13,117 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 10:54:13,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 10:54:13,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 10:54:13,118 INFO L87 Difference]: Start difference. First operand 28 states and 34 transitions. Second operand 4 states. [2021-01-06 10:54:13,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 10:54:13,187 INFO L93 Difference]: Finished difference Result 55 states and 69 transitions. [2021-01-06 10:54:13,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 10:54:13,188 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2021-01-06 10:54:13,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 10:54:13,189 INFO L225 Difference]: With dead ends: 55 [2021-01-06 10:54:13,189 INFO L226 Difference]: Without dead ends: 32 [2021-01-06 10:54:13,190 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 10:54:13,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2021-01-06 10:54:13,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2021-01-06 10:54:13,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2021-01-06 10:54:13,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 36 transitions. [2021-01-06 10:54:13,196 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 36 transitions. Word has length 25 [2021-01-06 10:54:13,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 10:54:13,197 INFO L481 AbstractCegarLoop]: Abstraction has 30 states and 36 transitions. [2021-01-06 10:54:13,197 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 10:54:13,197 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2021-01-06 10:54:13,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-01-06 10:54:13,198 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 10:54:13,198 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 10:54:13,407 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 10:54:13,407 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 10:54:13,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 10:54:13,409 INFO L82 PathProgramCache]: Analyzing trace with hash 817488613, now seen corresponding path program 1 times [2021-01-06 10:54:13,411 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 10:54:13,411 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795842162] [2021-01-06 10:54:13,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 10:54:13,438 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-01-06 10:54:13,441 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1507477692] [2021-01-06 10:54:13,441 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 10:54:13,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 10:54:13,521 INFO L263 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 45 conjunts are in the unsatisfiable core [2021-01-06 10:54:13,525 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 10:54:13,646 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 20 treesize of output 16 [2021-01-06 10:54:13,648 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 10:54:13,668 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 10:54:13,669 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 10:54:13,670 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:38, output treesize:34 [2021-01-06 10:54:14,107 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 10:54:14,107 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 28 treesize of output 61 [2021-01-06 10:54:14,115 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 10:54:14,167 INFO L625 ElimStorePlain]: treesize reduction 48, result has 39.2 percent of original size [2021-01-06 10:54:14,172 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 10:54:14,172 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:51, output treesize:24 [2021-01-06 10:54:14,273 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 25 treesize of output 21 [2021-01-06 10:54:14,274 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 10:54:14,290 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 10:54:14,298 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 10:54:14,299 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:44, output treesize:40 [2021-01-06 10:54:14,549 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 10:54:14,550 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 29 [2021-01-06 10:54:14,553 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2021-01-06 10:54:14,582 INFO L625 ElimStorePlain]: treesize reduction 21, result has 47.5 percent of original size [2021-01-06 10:54:14,586 INFO L547 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 10:54:14,586 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:44, output treesize:3 [2021-01-06 10:54:14,645 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 10:54:14,645 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795842162] [2021-01-06 10:54:14,646 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-01-06 10:54:14,646 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1507477692] [2021-01-06 10:54:14,646 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2021-01-06 10:54:14,646 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2021-01-06 10:54:14,647 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611783833] [2021-01-06 10:54:14,648 INFO L461 AbstractCegarLoop]: Interpolant automaton has 22 states [2021-01-06 10:54:14,650 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 10:54:14,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2021-01-06 10:54:14,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=386, Unknown=0, NotChecked=0, Total=462 [2021-01-06 10:54:14,654 INFO L87 Difference]: Start difference. First operand 30 states and 36 transitions. Second operand 22 states. [2021-01-06 10:54:16,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 10:54:16,336 INFO L93 Difference]: Finished difference Result 105 states and 128 transitions. [2021-01-06 10:54:16,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2021-01-06 10:54:16,343 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 29 [2021-01-06 10:54:16,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 10:54:16,346 INFO L225 Difference]: With dead ends: 105 [2021-01-06 10:54:16,347 INFO L226 Difference]: Without dead ends: 83 [2021-01-06 10:54:16,348 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 467 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=275, Invalid=1531, Unknown=0, NotChecked=0, Total=1806 [2021-01-06 10:54:16,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2021-01-06 10:54:16,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 53. [2021-01-06 10:54:16,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2021-01-06 10:54:16,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 64 transitions. [2021-01-06 10:54:16,360 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 64 transitions. Word has length 29 [2021-01-06 10:54:16,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 10:54:16,360 INFO L481 AbstractCegarLoop]: Abstraction has 53 states and 64 transitions. [2021-01-06 10:54:16,360 INFO L482 AbstractCegarLoop]: Interpolant automaton has 22 states. [2021-01-06 10:54:16,360 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 64 transitions. [2021-01-06 10:54:16,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-01-06 10:54:16,361 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 10:54:16,362 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 10:54:16,575 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 10:54:16,576 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 10:54:16,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 10:54:16,577 INFO L82 PathProgramCache]: Analyzing trace with hash -212199577, now seen corresponding path program 2 times [2021-01-06 10:54:16,578 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 10:54:16,578 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143221146] [2021-01-06 10:54:16,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 10:54:16,591 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-01-06 10:54:16,593 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1778927502] [2021-01-06 10:54:16,593 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 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 10:54:16,676 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-01-06 10:54:16,676 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-06 10:54:16,682 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 6 conjunts are in the unsatisfiable core [2021-01-06 10:54:16,686 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 10:54:16,841 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 10:54:16,844 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143221146] [2021-01-06 10:54:16,845 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-01-06 10:54:16,845 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1778927502] [2021-01-06 10:54:16,845 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2021-01-06 10:54:16,845 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2021-01-06 10:54:16,846 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778458955] [2021-01-06 10:54:16,846 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-01-06 10:54:16,847 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 10:54:16,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-01-06 10:54:16,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-01-06 10:54:16,851 INFO L87 Difference]: Start difference. First operand 53 states and 64 transitions. Second operand 7 states. [2021-01-06 10:54:17,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 10:54:17,052 INFO L93 Difference]: Finished difference Result 161 states and 196 transitions. [2021-01-06 10:54:17,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-01-06 10:54:17,053 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 31 [2021-01-06 10:54:17,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 10:54:17,060 INFO L225 Difference]: With dead ends: 161 [2021-01-06 10:54:17,060 INFO L226 Difference]: Without dead ends: 116 [2021-01-06 10:54:17,062 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-01-06 10:54:17,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2021-01-06 10:54:17,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 78. [2021-01-06 10:54:17,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2021-01-06 10:54:17,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 94 transitions. [2021-01-06 10:54:17,097 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 94 transitions. Word has length 31 [2021-01-06 10:54:17,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 10:54:17,097 INFO L481 AbstractCegarLoop]: Abstraction has 78 states and 94 transitions. [2021-01-06 10:54:17,098 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2021-01-06 10:54:17,098 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 94 transitions. [2021-01-06 10:54:17,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-01-06 10:54:17,103 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 10:54:17,104 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 10:54:17,304 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 10:54:17,305 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 10:54:17,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 10:54:17,306 INFO L82 PathProgramCache]: Analyzing trace with hash -182444793, now seen corresponding path program 3 times [2021-01-06 10:54:17,306 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 10:54:17,307 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584285958] [2021-01-06 10:54:17,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 10:54:17,324 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-01-06 10:54:17,325 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [169511822] [2021-01-06 10:54:17,325 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 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 10:54:17,398 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-01-06 10:54:17,398 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-06 10:54:17,400 INFO L263 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 40 conjunts are in the unsatisfiable core [2021-01-06 10:54:17,403 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 10:54:17,671 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 25 treesize of output 21 [2021-01-06 10:54:17,672 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 10:54:17,685 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 10:54:17,688 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-06 10:54:17,688 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:41, output treesize:37 [2021-01-06 10:54:17,851 INFO L173 IndexEqualityManager]: detected equality via solver [2021-01-06 10:54:17,853 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 10:54:17,853 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 10 [2021-01-06 10:54:17,854 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 10:54:17,864 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 10:54:17,865 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 10:54:17,866 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:44, output treesize:13 [2021-01-06 10:54:17,961 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-01-06 10:54:17,961 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584285958] [2021-01-06 10:54:17,961 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-01-06 10:54:17,962 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [169511822] [2021-01-06 10:54:17,962 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2021-01-06 10:54:17,962 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2021-01-06 10:54:17,962 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533206825] [2021-01-06 10:54:17,963 INFO L461 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-01-06 10:54:17,963 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 10:54:17,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-01-06 10:54:17,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=250, Unknown=0, NotChecked=0, Total=306 [2021-01-06 10:54:17,964 INFO L87 Difference]: Start difference. First operand 78 states and 94 transitions. Second operand 18 states. [2021-01-06 10:54:19,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 10:54:19,303 INFO L93 Difference]: Finished difference Result 213 states and 258 transitions. [2021-01-06 10:54:19,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-01-06 10:54:19,303 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 31 [2021-01-06 10:54:19,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 10:54:19,305 INFO L225 Difference]: With dead ends: 213 [2021-01-06 10:54:19,305 INFO L226 Difference]: Without dead ends: 173 [2021-01-06 10:54:19,306 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 211 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=215, Invalid=975, Unknown=0, NotChecked=0, Total=1190 [2021-01-06 10:54:19,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2021-01-06 10:54:19,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 120. [2021-01-06 10:54:19,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2021-01-06 10:54:19,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 148 transitions. [2021-01-06 10:54:19,322 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 148 transitions. Word has length 31 [2021-01-06 10:54:19,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 10:54:19,323 INFO L481 AbstractCegarLoop]: Abstraction has 120 states and 148 transitions. [2021-01-06 10:54:19,323 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2021-01-06 10:54:19,323 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 148 transitions. [2021-01-06 10:54:19,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-01-06 10:54:19,324 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 10:54:19,325 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 10:54:19,539 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2021-01-06 10:54:19,540 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 10:54:19,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 10:54:19,541 INFO L82 PathProgramCache]: Analyzing trace with hash -2049114485, now seen corresponding path program 1 times [2021-01-06 10:54:19,541 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 10:54:19,542 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825738195] [2021-01-06 10:54:19,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 10:54:19,554 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-01-06 10:54:19,554 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [398519462] [2021-01-06 10:54:19,554 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 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 10:54:19,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 10:54:19,618 INFO L263 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 6 conjunts are in the unsatisfiable core [2021-01-06 10:54:19,620 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 10:54:19,680 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-01-06 10:54:19,680 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825738195] [2021-01-06 10:54:19,680 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-01-06 10:54:19,681 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [398519462] [2021-01-06 10:54:19,681 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2021-01-06 10:54:19,681 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2021-01-06 10:54:19,681 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122756958] [2021-01-06 10:54:19,682 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-01-06 10:54:19,682 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 10:54:19,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-01-06 10:54:19,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2021-01-06 10:54:19,683 INFO L87 Difference]: Start difference. First operand 120 states and 148 transitions. Second operand 7 states. [2021-01-06 10:54:19,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 10:54:19,818 INFO L93 Difference]: Finished difference Result 166 states and 204 transitions. [2021-01-06 10:54:19,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-01-06 10:54:19,819 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 31 [2021-01-06 10:54:19,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 10:54:19,820 INFO L225 Difference]: With dead ends: 166 [2021-01-06 10:54:19,820 INFO L226 Difference]: Without dead ends: 128 [2021-01-06 10:54:19,821 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2021-01-06 10:54:19,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2021-01-06 10:54:19,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 109. [2021-01-06 10:54:19,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2021-01-06 10:54:19,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 133 transitions. [2021-01-06 10:54:19,833 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 133 transitions. Word has length 31 [2021-01-06 10:54:19,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 10:54:19,834 INFO L481 AbstractCegarLoop]: Abstraction has 109 states and 133 transitions. [2021-01-06 10:54:19,834 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2021-01-06 10:54:19,834 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 133 transitions. [2021-01-06 10:54:19,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-01-06 10:54:19,835 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 10:54:19,836 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 10:54:20,048 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 10:54:20,049 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 10:54:20,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 10:54:20,050 INFO L82 PathProgramCache]: Analyzing trace with hash 1164461191, now seen corresponding path program 4 times [2021-01-06 10:54:20,050 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 10:54:20,051 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770890870] [2021-01-06 10:54:20,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 10:54:20,062 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-01-06 10:54:20,063 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1591371782] [2021-01-06 10:54:20,063 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 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 10:54:20,110 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-01-06 10:54:20,111 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-06 10:54:20,112 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 6 conjunts are in the unsatisfiable core [2021-01-06 10:54:20,113 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 10:54:20,183 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-01-06 10:54:20,183 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770890870] [2021-01-06 10:54:20,184 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-01-06 10:54:20,186 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1591371782] [2021-01-06 10:54:20,186 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2021-01-06 10:54:20,186 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2021-01-06 10:54:20,186 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142405056] [2021-01-06 10:54:20,187 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-01-06 10:54:20,188 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 10:54:20,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-01-06 10:54:20,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-01-06 10:54:20,189 INFO L87 Difference]: Start difference. First operand 109 states and 133 transitions. Second operand 7 states. [2021-01-06 10:54:20,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 10:54:20,355 INFO L93 Difference]: Finished difference Result 136 states and 159 transitions. [2021-01-06 10:54:20,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-01-06 10:54:20,357 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 34 [2021-01-06 10:54:20,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 10:54:20,358 INFO L225 Difference]: With dead ends: 136 [2021-01-06 10:54:20,359 INFO L226 Difference]: Without dead ends: 120 [2021-01-06 10:54:20,359 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2021-01-06 10:54:20,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2021-01-06 10:54:20,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 108. [2021-01-06 10:54:20,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2021-01-06 10:54:20,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 130 transitions. [2021-01-06 10:54:20,405 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 130 transitions. Word has length 34 [2021-01-06 10:54:20,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 10:54:20,406 INFO L481 AbstractCegarLoop]: Abstraction has 108 states and 130 transitions. [2021-01-06 10:54:20,406 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2021-01-06 10:54:20,406 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 130 transitions. [2021-01-06 10:54:20,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-01-06 10:54:20,413 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 10:54:20,413 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 10:54:20,626 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 10:54:20,627 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 10:54:20,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 10:54:20,633 INFO L82 PathProgramCache]: Analyzing trace with hash -1661623630, now seen corresponding path program 5 times [2021-01-06 10:54:20,633 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 10:54:20,633 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468188778] [2021-01-06 10:54:20,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 10:54:20,643 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-01-06 10:54:20,643 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [286854008] [2021-01-06 10:54:20,643 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 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 10:54:20,694 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2021-01-06 10:54:20,695 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-06 10:54:20,695 INFO L263 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 6 conjunts are in the unsatisfiable core [2021-01-06 10:54:20,705 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 10:54:20,765 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 8 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-01-06 10:54:20,765 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468188778] [2021-01-06 10:54:20,766 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-01-06 10:54:20,766 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [286854008] [2021-01-06 10:54:20,766 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2021-01-06 10:54:20,766 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2021-01-06 10:54:20,766 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631514228] [2021-01-06 10:54:20,767 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-01-06 10:54:20,767 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 10:54:20,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-01-06 10:54:20,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-01-06 10:54:20,768 INFO L87 Difference]: Start difference. First operand 108 states and 130 transitions. Second operand 7 states. [2021-01-06 10:54:20,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 10:54:20,895 INFO L93 Difference]: Finished difference Result 135 states and 158 transitions. [2021-01-06 10:54:20,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-01-06 10:54:20,896 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 36 [2021-01-06 10:54:20,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 10:54:20,897 INFO L225 Difference]: With dead ends: 135 [2021-01-06 10:54:20,897 INFO L226 Difference]: Without dead ends: 105 [2021-01-06 10:54:20,897 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-01-06 10:54:20,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2021-01-06 10:54:20,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 98. [2021-01-06 10:54:20,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2021-01-06 10:54:20,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 115 transitions. [2021-01-06 10:54:20,906 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 115 transitions. Word has length 36 [2021-01-06 10:54:20,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 10:54:20,906 INFO L481 AbstractCegarLoop]: Abstraction has 98 states and 115 transitions. [2021-01-06 10:54:20,906 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2021-01-06 10:54:20,906 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 115 transitions. [2021-01-06 10:54:20,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-01-06 10:54:20,907 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 10:54:20,907 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 10:54:21,120 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2021-01-06 10:54:21,121 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 10:54:21,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 10:54:21,122 INFO L82 PathProgramCache]: Analyzing trace with hash -2106982269, now seen corresponding path program 1 times [2021-01-06 10:54:21,122 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 10:54:21,123 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891324332] [2021-01-06 10:54:21,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 10:54:21,151 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-01-06 10:54:21,152 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [221480203] [2021-01-06 10:54:21,152 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 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 10:54:21,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 10:54:21,231 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 14 conjunts are in the unsatisfiable core [2021-01-06 10:54:21,245 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 10:54:21,317 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 10:54:21,319 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 10:54:21,388 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-01-06 10:54:21,389 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891324332] [2021-01-06 10:54:21,389 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-01-06 10:54:21,389 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [221480203] [2021-01-06 10:54:21,389 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2021-01-06 10:54:21,389 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2021-01-06 10:54:21,390 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622661301] [2021-01-06 10:54:21,390 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-01-06 10:54:21,390 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 10:54:21,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-01-06 10:54:21,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2021-01-06 10:54:21,391 INFO L87 Difference]: Start difference. First operand 98 states and 115 transitions. Second operand 9 states. [2021-01-06 10:54:21,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 10:54:21,834 INFO L93 Difference]: Finished difference Result 135 states and 154 transitions. [2021-01-06 10:54:21,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-01-06 10:54:21,835 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 38 [2021-01-06 10:54:21,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 10:54:21,836 INFO L225 Difference]: With dead ends: 135 [2021-01-06 10:54:21,836 INFO L226 Difference]: Without dead ends: 88 [2021-01-06 10:54:21,838 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=76, Invalid=164, Unknown=0, NotChecked=0, Total=240 [2021-01-06 10:54:21,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2021-01-06 10:54:21,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 80. [2021-01-06 10:54:21,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2021-01-06 10:54:21,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 91 transitions. [2021-01-06 10:54:21,850 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 91 transitions. Word has length 38 [2021-01-06 10:54:21,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 10:54:21,850 INFO L481 AbstractCegarLoop]: Abstraction has 80 states and 91 transitions. [2021-01-06 10:54:21,850 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2021-01-06 10:54:21,850 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 91 transitions. [2021-01-06 10:54:21,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-01-06 10:54:21,851 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 10:54:21,851 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 10:54:22,066 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 10:54:22,067 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 10:54:22,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 10:54:22,068 INFO L82 PathProgramCache]: Analyzing trace with hash -1024786640, now seen corresponding path program 1 times [2021-01-06 10:54:22,068 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 10:54:22,069 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469473434] [2021-01-06 10:54:22,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 10:54:22,081 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-01-06 10:54:22,081 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1407131820] [2021-01-06 10:54:22,081 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 10:54:22,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 10:54:22,151 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 6 conjunts are in the unsatisfiable core [2021-01-06 10:54:22,155 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 10:54:22,227 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-01-06 10:54:22,228 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469473434] [2021-01-06 10:54:22,228 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-01-06 10:54:22,228 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1407131820] [2021-01-06 10:54:22,228 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2021-01-06 10:54:22,228 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2021-01-06 10:54:22,229 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673864600] [2021-01-06 10:54:22,229 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-01-06 10:54:22,229 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 10:54:22,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-01-06 10:54:22,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-01-06 10:54:22,230 INFO L87 Difference]: Start difference. First operand 80 states and 91 transitions. Second operand 7 states. [2021-01-06 10:54:22,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 10:54:22,331 INFO L93 Difference]: Finished difference Result 88 states and 98 transitions. [2021-01-06 10:54:22,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-01-06 10:54:22,332 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 43 [2021-01-06 10:54:22,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 10:54:22,333 INFO L225 Difference]: With dead ends: 88 [2021-01-06 10:54:22,333 INFO L226 Difference]: Without dead ends: 52 [2021-01-06 10:54:22,333 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2021-01-06 10:54:22,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2021-01-06 10:54:22,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 48. [2021-01-06 10:54:22,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2021-01-06 10:54:22,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 56 transitions. [2021-01-06 10:54:22,338 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 56 transitions. Word has length 43 [2021-01-06 10:54:22,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 10:54:22,338 INFO L481 AbstractCegarLoop]: Abstraction has 48 states and 56 transitions. [2021-01-06 10:54:22,339 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2021-01-06 10:54:22,339 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 56 transitions. [2021-01-06 10:54:22,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2021-01-06 10:54:22,339 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 10:54:22,339 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 10:54:22,552 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 10:54:22,553 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 10:54:22,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 10:54:22,554 INFO L82 PathProgramCache]: Analyzing trace with hash -451868680, now seen corresponding path program 6 times [2021-01-06 10:54:22,554 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 10:54:22,555 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142185361] [2021-01-06 10:54:22,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 10:54:22,565 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-01-06 10:54:22,565 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1073810414] [2021-01-06 10:54:22,566 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 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 10:54:22,763 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2021-01-06 10:54:22,763 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-06 10:54:22,766 WARN L261 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 84 conjunts are in the unsatisfiable core [2021-01-06 10:54:22,770 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 10:54:22,811 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2021-01-06 10:54:22,813 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 10:54:22,824 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 10:54:22,827 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-06 10:54:22,828 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:15 [2021-01-06 10:54:22,874 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 17 treesize of output 13 [2021-01-06 10:54:22,875 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 10:54:22,889 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 10:54:22,890 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 10:54:22,891 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:32, output treesize:28 [2021-01-06 10:54:22,932 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 10:54:22,933 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 34 treesize of output 85 [2021-01-06 10:54:22,936 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 10:54:22,974 INFO L625 ElimStorePlain]: treesize reduction 26, result has 64.4 percent of original size [2021-01-06 10:54:22,975 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 10:54:22,975 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:51, output treesize:47 [2021-01-06 10:54:23,234 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 10:54:23,235 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 39 treesize of output 133 [2021-01-06 10:54:23,240 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 10:54:23,303 INFO L625 ElimStorePlain]: treesize reduction 72, result has 45.5 percent of original size [2021-01-06 10:54:23,305 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-06 10:54:23,305 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:64, output treesize:60 [2021-01-06 10:54:23,486 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 10:54:23,487 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 52 treesize of output 233 [2021-01-06 10:54:23,516 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 10:54:23,610 INFO L625 ElimStorePlain]: treesize reduction 98, result has 42.7 percent of original size [2021-01-06 10:54:23,613 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-06 10:54:23,614 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:77, output treesize:73 [2021-01-06 10:54:24,237 WARN L197 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 47 [2021-01-06 10:54:24,681 WARN L197 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 71 [2021-01-06 10:54:24,682 INFO L348 Elim1Store]: treesize reduction 17, result has 94.4 percent of original size [2021-01-06 10:54:24,682 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 62 treesize of output 315 [2021-01-06 10:54:24,692 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 10:54:24,870 WARN L197 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 55 [2021-01-06 10:54:24,871 INFO L625 ElimStorePlain]: treesize reduction 82, result has 66.3 percent of original size [2021-01-06 10:54:24,878 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 10:54:24,881 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-06 10:54:24,882 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:90, output treesize:161 [2021-01-06 10:54:24,889 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 10:54:25,070 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 10:54:25,498 WARN L197 SmtUtils]: Spent 311.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 57 [2021-01-06 10:54:25,514 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 3, 10, 1] term [2021-01-06 10:54:25,515 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2021-01-06 10:54:25,549 INFO L443 ElimStorePlain]: Different costs {12=[|v_#memory_int_20|], 20=[v_prenex_1, v_prenex_3]} [2021-01-06 10:54:25,562 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 10:54:25,564 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 10:54:25,567 INFO L173 IndexEqualityManager]: detected equality via solver [2021-01-06 10:54:25,572 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 10:54:25,595 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 0 case distinctions, treesize of input 58 treesize of output 56 [2021-01-06 10:54:25,597 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 10:54:29,132 WARN L197 SmtUtils]: Spent 3.53 s on a formula simplification that was a NOOP. DAG size: 103 [2021-01-06 10:54:29,132 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 10:54:29,151 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 10:54:29,165 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 10:54:29,166 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 10:54:29,172 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 10:54:29,182 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 10:54:45,643 WARN L197 SmtUtils]: Spent 16.45 s on a formula simplification that was a NOOP. DAG size: 54 [2021-01-06 10:54:45,644 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 10:54:45,644 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 69 treesize of output 258 [2021-01-06 10:54:45,652 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-06 10:54:49,246 WARN L197 SmtUtils]: Spent 3.59 s on a formula simplification. DAG size of input: 123 DAG size of output: 91 [2021-01-06 10:54:49,247 INFO L625 ElimStorePlain]: treesize reduction 193, result has 56.2 percent of original size [2021-01-06 10:54:49,264 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 10:54:49,266 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 10:54:49,276 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 10:54:49,278 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 10:54:49,279 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 10:54:49,286 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 10:54:49,287 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 10:54:49,296 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 10:54:49,342 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 10:54:49,343 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 69 treesize of output 146 [2021-01-06 10:54:49,354 INFO L547 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-01-06 10:54:52,746 WARN L197 SmtUtils]: Spent 3.39 s on a formula simplification. DAG size of input: 99 DAG size of output: 80 [2021-01-06 10:54:52,747 INFO L625 ElimStorePlain]: treesize reduction 94, result has 71.3 percent of original size [2021-01-06 10:54:52,753 INFO L547 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 3 dim-2 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2021-01-06 10:54:52,754 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 8 variables, input treesize:286, output treesize:225 [2021-01-06 10:54:53,471 WARN L197 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2021-01-06 10:54:53,733 WARN L197 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2021-01-06 10:54:56,137 WARN L197 SmtUtils]: Spent 2.16 s on a formula simplification that was a NOOP. DAG size: 98 [2021-01-06 10:54:56,154 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2021-01-06 10:54:56,577 WARN L197 SmtUtils]: Spent 163.00 ms on a formula simplification that was a NOOP. DAG size: 103 [2021-01-06 10:54:56,590 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2021-01-06 10:54:58,996 WARN L197 SmtUtils]: Spent 2.15 s on a formula simplification that was a NOOP. DAG size: 124 [2021-01-06 10:54:59,489 WARN L197 SmtUtils]: Spent 173.00 ms on a formula simplification that was a NOOP. DAG size: 125 [2021-01-06 10:55:00,085 WARN L197 SmtUtils]: Spent 279.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 88 [2021-01-06 10:55:00,479 WARN L197 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2021-01-06 10:55:00,934 WARN L197 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2021-01-06 10:55:38,572 WARN L197 SmtUtils]: Spent 37.59 s on a formula simplification. DAG size of input: 113 DAG size of output: 105 [2021-01-06 10:55:38,574 INFO L348 Elim1Store]: treesize reduction 40, result has 90.5 percent of original size [2021-01-06 10:55:38,574 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 96 treesize of output 402 [2021-01-06 10:55:38,586 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2021-01-06 10:55:38,587 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2021-01-06 10:55:38,589 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2021-01-06 10:55:38,589 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2021-01-06 10:55:38,590 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-01-06 10:55:38,591 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-06 10:55:38,592 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 10:55:38,593 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 1] term [2021-01-06 10:55:38,593 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 10:55:38,593 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2021-01-06 10:55:38,594 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 10:55:38,597 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 10:55:38,598 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 10:55:38,598 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 10:55:38,602 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2021-01-06 10:55:38,603 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 1] term [2021-01-06 10:55:38,604 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2021-01-06 10:55:38,605 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 1] term [2021-01-06 10:55:38,605 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2021-01-06 10:55:38,606 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 1] term [2021-01-06 10:55:38,607 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2021-01-06 10:55:38,608 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 1] term [2021-01-06 10:55:38,608 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-01-06 10:55:38,609 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 1] term [2021-01-06 10:55:38,609 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-06 10:55:38,610 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 1] term [2021-01-06 10:55:38,610 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 10:55:38,611 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 1] term [2021-01-06 10:55:38,612 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 10:55:38,612 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2021-01-06 10:55:38,613 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 10:55:38,615 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2021-01-06 10:55:38,616 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2021-01-06 10:55:38,617 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2021-01-06 10:55:38,618 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2021-01-06 10:55:38,619 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-01-06 10:55:38,621 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-06 10:55:38,621 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 10:55:38,622 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 10:55:38,623 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 10:55:38,627 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2021-01-06 10:55:38,629 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2021-01-06 10:55:38,630 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2021-01-06 10:55:38,631 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2021-01-06 10:55:38,632 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2021-01-06 10:55:38,633 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 1] term [2021-01-06 10:55:38,633 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-01-06 10:55:38,634 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 1] term [2021-01-06 10:55:38,634 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-06 10:55:38,635 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 1] term [2021-01-06 10:55:38,635 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 10:55:38,636 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 1] term [2021-01-06 10:55:38,637 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 10:55:38,637 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2021-01-06 10:55:38,638 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 10:55:38,645 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2021-01-06 10:55:38,646 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2021-01-06 10:55:38,647 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2021-01-06 10:55:38,648 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-01-06 10:55:38,648 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-06 10:55:38,649 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 10:55:38,650 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 1] term [2021-01-06 10:55:38,650 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 10:55:38,651 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2021-01-06 10:55:38,651 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 10:55:38,653 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 10:55:38,654 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 10:55:38,655 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 10:55:38,659 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2021-01-06 10:55:38,660 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 1] term [2021-01-06 10:55:38,660 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2021-01-06 10:55:38,661 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 1] term [2021-01-06 10:55:38,661 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2021-01-06 10:55:38,663 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 1] term [2021-01-06 10:55:38,664 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2021-01-06 10:55:38,664 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 1] term [2021-01-06 10:55:38,664 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-01-06 10:55:38,665 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 1] term [2021-01-06 10:55:38,665 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-06 10:55:38,666 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 1] term [2021-01-06 10:55:38,666 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 10:55:38,667 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 1] term [2021-01-06 10:55:38,667 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 10:55:38,668 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2021-01-06 10:55:38,668 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 10:55:38,670 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2021-01-06 10:55:38,671 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2021-01-06 10:55:38,672 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2021-01-06 10:55:38,673 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2021-01-06 10:55:38,674 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-01-06 10:55:38,676 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-06 10:55:38,677 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 10:55:38,678 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 10:55:38,679 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 10:55:38,683 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2021-01-06 10:55:38,685 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2021-01-06 10:55:38,686 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2021-01-06 10:55:38,687 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-01-06 10:55:38,688 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-06 10:55:38,689 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 10:55:38,690 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 1] term [2021-01-06 10:55:38,690 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 10:55:38,691 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2021-01-06 10:55:38,691 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 10:55:38,693 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 10:55:38,694 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 10:55:38,695 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 10:55:38,699 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2021-01-06 10:55:38,700 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 1] term [2021-01-06 10:55:38,700 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2021-01-06 10:55:38,701 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 1] term [2021-01-06 10:55:38,702 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2021-01-06 10:55:38,703 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 1] term [2021-01-06 10:55:38,703 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2021-01-06 10:55:38,704 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 1] term [2021-01-06 10:55:38,705 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-01-06 10:55:38,706 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 1] term [2021-01-06 10:55:38,706 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-06 10:55:38,707 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 1] term [2021-01-06 10:55:38,707 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 10:55:38,708 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 1] term [2021-01-06 10:55:38,708 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 10:55:38,709 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2021-01-06 10:55:38,710 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 10:55:38,712 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2021-01-06 10:55:38,713 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2021-01-06 10:55:38,714 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2021-01-06 10:55:38,715 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2021-01-06 10:55:38,716 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-01-06 10:55:38,718 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-06 10:55:38,719 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 10:55:38,720 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 10:55:38,721 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 10:55:38,724 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2021-01-06 10:55:38,726 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 1] term [2021-01-06 10:55:38,726 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2021-01-06 10:55:38,727 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 1] term [2021-01-06 10:55:38,728 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2021-01-06 10:55:38,729 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 1] term [2021-01-06 10:55:38,729 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2021-01-06 10:55:38,730 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 1] term [2021-01-06 10:55:38,731 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-01-06 10:55:38,732 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 1] term [2021-01-06 10:55:38,732 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-06 10:55:38,733 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 1] term [2021-01-06 10:55:38,733 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 10:55:38,734 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 1] term [2021-01-06 10:55:38,734 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 10:55:38,735 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2021-01-06 10:55:38,735 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 10:55:38,738 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 10:55:38,740 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 10:55:38,741 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-01-06 10:55:38,741 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-06 10:55:38,742 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 10:55:38,743 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 10:55:38,744 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 10:55:38,746 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 10:55:38,747 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 10:55:38,748 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 1] term [2021-01-06 10:55:38,749 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 10:55:38,749 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 1] term [2021-01-06 10:55:38,750 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 10:55:38,750 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2021-01-06 10:55:38,751 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 10:55:38,753 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 10:55:38,754 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 10:55:38,755 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 3, 1] term [2021-01-06 10:55:38,755 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 10:55:38,756 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 3, 1] term [2021-01-06 10:55:38,756 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 10:55:38,759 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 1] term [2021-01-06 10:55:38,759 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 10:55:38,760 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2021-01-06 10:55:38,761 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 10:55:38,762 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-06 10:55:38,763 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 10:55:38,764 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 10:55:38,766 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2021-01-06 10:55:38,766 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 10:55:38,769 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 1] term [2021-01-06 10:55:38,769 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 10:55:38,770 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 1] term [2021-01-06 10:55:38,770 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 10:55:38,771 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2021-01-06 10:55:38,772 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 10:55:38,774 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-01-06 10:55:38,775 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-06 10:55:38,776 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 10:55:38,777 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 1] term [2021-01-06 10:55:38,777 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 10:55:38,778 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2021-01-06 10:55:38,778 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 10:55:38,783 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2021-01-06 10:55:38,784 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2021-01-06 10:55:38,785 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2021-01-06 10:55:38,786 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2021-01-06 10:55:38,787 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2021-01-06 10:55:38,788 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-01-06 10:55:38,789 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-06 10:55:38,790 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 10:55:38,791 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 10:55:38,792 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2021-01-06 10:55:38,792 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 10:55:38,799 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2021-01-06 10:55:38,799 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2021-01-06 10:55:38,800 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2021-01-06 10:55:38,801 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2021-01-06 10:55:38,802 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 1] term [2021-01-06 10:55:38,802 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-01-06 10:55:38,803 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 1] term [2021-01-06 10:55:38,803 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-06 10:55:38,804 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 1] term [2021-01-06 10:55:38,805 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 10:55:38,806 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 1] term [2021-01-06 10:55:38,806 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 10:55:38,807 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2021-01-06 10:55:38,808 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 10:55:38,984 WARN L197 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 353 DAG size of output: 338 [2021-01-06 10:55:38,998 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 10:55:39,655 WARN L197 SmtUtils]: Spent 655.00 ms on a formula simplification. DAG size of input: 381 DAG size of output: 65 [2021-01-06 10:55:39,656 INFO L625 ElimStorePlain]: treesize reduction 4587, result has 3.3 percent of original size [2021-01-06 10:55:40,075 WARN L197 SmtUtils]: Spent 404.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 101 [2021-01-06 10:55:40,075 INFO L348 Elim1Store]: treesize reduction 40, result has 88.9 percent of original size [2021-01-06 10:55:40,076 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 86 treesize of output 342 [2021-01-06 10:55:40,083 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 1] term [2021-01-06 10:55:40,083 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2021-01-06 10:55:40,084 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 1] term [2021-01-06 10:55:40,085 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2021-01-06 10:55:40,085 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 1] term [2021-01-06 10:55:40,085 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2021-01-06 10:55:40,086 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 1] term [2021-01-06 10:55:40,086 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2021-01-06 10:55:40,087 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 1] term [2021-01-06 10:55:40,087 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-01-06 10:55:40,088 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 1] term [2021-01-06 10:55:40,088 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-06 10:55:40,089 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 1] term [2021-01-06 10:55:40,089 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 10:55:40,089 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 1] term [2021-01-06 10:55:40,090 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 10:55:40,090 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2021-01-06 10:55:40,090 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 10:55:40,094 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-06 10:55:40,095 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 10:55:40,097 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 10:55:40,098 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 10:55:40,099 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2021-01-06 10:55:40,100 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-01-06 10:55:40,100 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 1] term [2021-01-06 10:55:40,101 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-06 10:55:40,101 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 1] term [2021-01-06 10:55:40,102 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 10:55:40,102 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 1] term [2021-01-06 10:55:40,103 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 10:55:40,104 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2021-01-06 10:55:40,104 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 10:55:40,107 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 10:55:40,109 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-01-06 10:55:40,110 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-06 10:55:40,110 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 10:55:40,111 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 10:55:40,111 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2021-01-06 10:55:40,112 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 10:55:40,115 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 10:55:40,116 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 10:55:40,117 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-06 10:55:40,118 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 10:55:40,119 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 10:55:40,119 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 10:55:40,122 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 10:55:40,124 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 10:55:40,126 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 10:55:40,127 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-01-06 10:55:40,128 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-06 10:55:40,128 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 10:55:40,129 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 10:55:40,129 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 10:55:40,195 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-06 10:55:40,657 WARN L197 SmtUtils]: Spent 460.00 ms on a formula simplification. DAG size of input: 297 DAG size of output: 37 [2021-01-06 10:55:40,658 INFO L625 ElimStorePlain]: treesize reduction 3692, result has 2.0 percent of original size [2021-01-06 10:55:40,664 INFO L547 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2021-01-06 10:55:40,665 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 10 variables, input treesize:240, output treesize:50 [2021-01-06 10:55:41,209 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 2 proven. 48 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 10:55:41,210 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142185361] [2021-01-06 10:55:41,210 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-01-06 10:55:41,210 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1073810414] [2021-01-06 10:55:41,210 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2021-01-06 10:55:41,210 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2021-01-06 10:55:41,211 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175801065] [2021-01-06 10:55:41,211 INFO L461 AbstractCegarLoop]: Interpolant automaton has 39 states [2021-01-06 10:55:41,211 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 10:55:41,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2021-01-06 10:55:41,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=1318, Unknown=0, NotChecked=0, Total=1482 [2021-01-06 10:55:41,213 INFO L87 Difference]: Start difference. First operand 48 states and 56 transitions. Second operand 39 states. [2021-01-06 10:55:44,611 WARN L197 SmtUtils]: Spent 289.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 50 [2021-01-06 10:55:44,977 WARN L197 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 43 [2021-01-06 10:55:46,256 WARN L197 SmtUtils]: Spent 345.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 61 [2021-01-06 10:55:46,768 WARN L197 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 41 [2021-01-06 10:55:48,329 WARN L197 SmtUtils]: Spent 653.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 107 [2021-01-06 10:55:49,108 WARN L197 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 62 [2021-01-06 10:55:49,425 WARN L197 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 62 [2021-01-06 10:55:49,938 WARN L197 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 64 [2021-01-06 10:55:49,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 10:55:49,946 INFO L93 Difference]: Finished difference Result 138 states and 164 transitions. [2021-01-06 10:55:49,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2021-01-06 10:55:49,947 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 47 [2021-01-06 10:55:49,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 10:55:49,949 INFO L225 Difference]: With dead ends: 138 [2021-01-06 10:55:49,949 INFO L226 Difference]: Without dead ends: 107 [2021-01-06 10:55:49,951 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1244 ImplicationChecksByTransitivity, 15.1s TimeCoverageRelationStatistics Valid=466, Invalid=3824, Unknown=0, NotChecked=0, Total=4290 [2021-01-06 10:55:49,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2021-01-06 10:55:49,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 83. [2021-01-06 10:55:49,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2021-01-06 10:55:49,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 98 transitions. [2021-01-06 10:55:49,964 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 98 transitions. Word has length 47 [2021-01-06 10:55:49,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 10:55:49,964 INFO L481 AbstractCegarLoop]: Abstraction has 83 states and 98 transitions. [2021-01-06 10:55:49,964 INFO L482 AbstractCegarLoop]: Interpolant automaton has 39 states. [2021-01-06 10:55:49,964 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 98 transitions. [2021-01-06 10:55:49,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2021-01-06 10:55:49,965 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 10:55:49,965 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 10:55:50,180 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2021-01-06 10:55:50,181 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 10:55:50,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 10:55:50,182 INFO L82 PathProgramCache]: Analyzing trace with hash -585882186, now seen corresponding path program 1 times [2021-01-06 10:55:50,182 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 10:55:50,182 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368985371] [2021-01-06 10:55:50,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 10:55:50,196 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-01-06 10:55:50,196 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1224227411] [2021-01-06 10:55:50,196 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 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 10:55:50,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 10:55:50,265 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 3 conjunts are in the unsatisfiable core [2021-01-06 10:55:50,266 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 10:55:50,314 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2021-01-06 10:55:50,314 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368985371] [2021-01-06 10:55:50,314 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-01-06 10:55:50,314 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1224227411] [2021-01-06 10:55:50,314 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 10:55:50,314 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 10:55:50,315 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721296141] [2021-01-06 10:55:50,315 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 10:55:50,315 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 10:55:50,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 10:55:50,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 10:55:50,316 INFO L87 Difference]: Start difference. First operand 83 states and 98 transitions. Second operand 3 states. [2021-01-06 10:55:50,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 10:55:50,358 INFO L93 Difference]: Finished difference Result 137 states and 161 transitions. [2021-01-06 10:55:50,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 10:55:50,359 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 47 [2021-01-06 10:55:50,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 10:55:50,360 INFO L225 Difference]: With dead ends: 137 [2021-01-06 10:55:50,361 INFO L226 Difference]: Without dead ends: 108 [2021-01-06 10:55:50,361 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 45 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 10:55:50,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2021-01-06 10:55:50,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 85. [2021-01-06 10:55:50,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2021-01-06 10:55:50,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 100 transitions. [2021-01-06 10:55:50,374 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 100 transitions. Word has length 47 [2021-01-06 10:55:50,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 10:55:50,374 INFO L481 AbstractCegarLoop]: Abstraction has 85 states and 100 transitions. [2021-01-06 10:55:50,374 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 10:55:50,375 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 100 transitions. [2021-01-06 10:55:50,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2021-01-06 10:55:50,375 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 10:55:50,375 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 10:55:50,588 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2021-01-06 10:55:50,589 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 10:55:50,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 10:55:50,590 INFO L82 PathProgramCache]: Analyzing trace with hash -367027468, now seen corresponding path program 2 times [2021-01-06 10:55:50,590 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 10:55:50,590 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569046604] [2021-01-06 10:55:50,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 10:55:50,599 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-01-06 10:55:50,600 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [267105926] [2021-01-06 10:55:50,600 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 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 10:55:50,768 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-01-06 10:55:50,768 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-06 10:55:50,770 INFO L263 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 59 conjunts are in the unsatisfiable core [2021-01-06 10:55:50,772 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 10:55:50,836 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 20 treesize of output 16 [2021-01-06 10:55:50,837 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 10:55:50,853 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 10:55:50,854 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 10:55:50,854 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:29 [2021-01-06 10:55:50,936 INFO L348 Elim1Store]: treesize reduction 49, result has 21.0 percent of original size [2021-01-06 10:55:50,936 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 32 treesize of output 31 [2021-01-06 10:55:50,938 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 10:55:50,954 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 10:55:50,955 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 10:55:50,955 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:41, output treesize:37 [2021-01-06 10:55:51,158 INFO L348 Elim1Store]: treesize reduction 25, result has 85.8 percent of original size [2021-01-06 10:55:51,159 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 52 treesize of output 173 [2021-01-06 10:55:51,162 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 10:55:51,234 INFO L625 ElimStorePlain]: treesize reduction 73, result has 45.1 percent of original size [2021-01-06 10:55:51,235 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 10:55:51,236 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:64, output treesize:60 [2021-01-06 10:55:51,449 INFO L348 Elim1Store]: treesize reduction 74, result has 53.8 percent of original size [2021-01-06 10:55:51,449 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 44 treesize of output 107 [2021-01-06 10:55:51,452 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 10:55:51,513 INFO L625 ElimStorePlain]: treesize reduction 46, result has 50.0 percent of original size [2021-01-06 10:55:51,514 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 10:55:51,514 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:50, output treesize:46 [2021-01-06 10:55:51,886 WARN L197 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 45 [2021-01-06 10:55:51,887 INFO L348 Elim1Store]: treesize reduction 250, result has 32.2 percent of original size [2021-01-06 10:55:51,888 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 14 case distinctions, treesize of input 73 treesize of output 147 [2021-01-06 10:55:51,895 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 10:55:51,953 INFO L625 ElimStorePlain]: treesize reduction 149, result has 23.6 percent of original size [2021-01-06 10:55:51,954 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 10:55:51,955 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:79, output treesize:46 [2021-01-06 10:55:52,318 WARN L197 SmtUtils]: Spent 266.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 48 [2021-01-06 10:55:52,319 INFO L348 Elim1Store]: treesize reduction 275, result has 35.9 percent of original size [2021-01-06 10:55:52,319 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 14 case distinctions, treesize of input 83 treesize of output 187 [2021-01-06 10:55:52,323 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 10:55:52,386 INFO L625 ElimStorePlain]: treesize reduction 185, result has 19.9 percent of original size [2021-01-06 10:55:52,387 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 10:55:52,387 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:89, output treesize:46 [2021-01-06 10:55:53,089 INFO L348 Elim1Store]: treesize reduction 27, result has 67.1 percent of original size [2021-01-06 10:55:53,090 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 52 treesize of output 70 [2021-01-06 10:55:53,093 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 10:55:53,098 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 10:55:53,100 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 10:55:53,100 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:55, output treesize:3 [2021-01-06 10:55:53,168 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 10:55:53,168 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569046604] [2021-01-06 10:55:53,168 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-01-06 10:55:53,168 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [267105926] [2021-01-06 10:55:53,168 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2021-01-06 10:55:53,168 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2021-01-06 10:55:53,169 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082802129] [2021-01-06 10:55:53,169 INFO L461 AbstractCegarLoop]: Interpolant automaton has 24 states [2021-01-06 10:55:53,169 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 10:55:53,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-01-06 10:55:53,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=435, Unknown=0, NotChecked=0, Total=552 [2021-01-06 10:55:53,170 INFO L87 Difference]: Start difference. First operand 85 states and 100 transitions. Second operand 24 states. [2021-01-06 10:55:54,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 10:55:54,966 INFO L93 Difference]: Finished difference Result 122 states and 142 transitions. [2021-01-06 10:55:54,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2021-01-06 10:55:54,967 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 47 [2021-01-06 10:55:54,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 10:55:54,968 INFO L225 Difference]: With dead ends: 122 [2021-01-06 10:55:54,968 INFO L226 Difference]: Without dead ends: 118 [2021-01-06 10:55:54,969 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 21 SyntacticMatches, 3 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 439 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=276, Invalid=1206, Unknown=0, NotChecked=0, Total=1482 [2021-01-06 10:55:54,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2021-01-06 10:55:54,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 94. [2021-01-06 10:55:54,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2021-01-06 10:55:54,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 111 transitions. [2021-01-06 10:55:54,983 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 111 transitions. Word has length 47 [2021-01-06 10:55:54,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 10:55:54,983 INFO L481 AbstractCegarLoop]: Abstraction has 94 states and 111 transitions. [2021-01-06 10:55:54,983 INFO L482 AbstractCegarLoop]: Interpolant automaton has 24 states. [2021-01-06 10:55:54,984 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 111 transitions. [2021-01-06 10:55:54,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2021-01-06 10:55:54,984 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 10:55:54,984 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 10:55:55,197 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2021-01-06 10:55:55,198 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 10:55:55,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 10:55:55,199 INFO L82 PathProgramCache]: Analyzing trace with hash -293846086, now seen corresponding path program 7 times [2021-01-06 10:55:55,199 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 10:55:55,200 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760139194] [2021-01-06 10:55:55,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 10:55:55,220 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-01-06 10:55:55,223 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1335512462] [2021-01-06 10:55:55,223 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 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 10:55:55,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 10:55:55,322 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 8 conjunts are in the unsatisfiable core [2021-01-06 10:55:55,323 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 10:55:55,431 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 32 proven. 17 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-01-06 10:55:55,431 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760139194] [2021-01-06 10:55:55,431 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-01-06 10:55:55,432 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1335512462] [2021-01-06 10:55:55,432 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2021-01-06 10:55:55,432 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2021-01-06 10:55:55,432 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416688086] [2021-01-06 10:55:55,432 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-01-06 10:55:55,432 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 10:55:55,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-01-06 10:55:55,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2021-01-06 10:55:55,433 INFO L87 Difference]: Start difference. First operand 94 states and 111 transitions. Second operand 9 states. [2021-01-06 10:55:55,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 10:55:55,700 INFO L93 Difference]: Finished difference Result 291 states and 347 transitions. [2021-01-06 10:55:55,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-01-06 10:55:55,701 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 49 [2021-01-06 10:55:55,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 10:55:55,702 INFO L225 Difference]: With dead ends: 291 [2021-01-06 10:55:55,702 INFO L226 Difference]: Without dead ends: 214 [2021-01-06 10:55:55,705 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2021-01-06 10:55:55,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2021-01-06 10:55:55,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 148. [2021-01-06 10:55:55,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2021-01-06 10:55:55,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 174 transitions. [2021-01-06 10:55:55,728 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 174 transitions. Word has length 49 [2021-01-06 10:55:55,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 10:55:55,728 INFO L481 AbstractCegarLoop]: Abstraction has 148 states and 174 transitions. [2021-01-06 10:55:55,729 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2021-01-06 10:55:55,729 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 174 transitions. [2021-01-06 10:55:55,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-01-06 10:55:55,729 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 10:55:55,729 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 10:55:55,942 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 10:55:55,942 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 10:55:55,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 10:55:55,943 INFO L82 PathProgramCache]: Analyzing trace with hash -1300946696, now seen corresponding path program 8 times [2021-01-06 10:55:55,943 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 10:55:55,943 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832347628] [2021-01-06 10:55:55,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 10:55:55,953 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-01-06 10:55:55,954 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [174918045] [2021-01-06 10:55:55,954 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 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 10:55:56,020 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-01-06 10:55:56,020 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-06 10:55:56,021 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 8 conjunts are in the unsatisfiable core [2021-01-06 10:55:56,023 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 10:55:56,152 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 4 proven. 34 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2021-01-06 10:55:56,153 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832347628] [2021-01-06 10:55:56,153 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-01-06 10:55:56,153 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [174918045] [2021-01-06 10:55:56,153 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2021-01-06 10:55:56,153 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2021-01-06 10:55:56,154 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579904610] [2021-01-06 10:55:56,154 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-01-06 10:55:56,154 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 10:55:56,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-01-06 10:55:56,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2021-01-06 10:55:56,155 INFO L87 Difference]: Start difference. First operand 148 states and 174 transitions. Second operand 9 states. [2021-01-06 10:55:56,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 10:55:56,417 INFO L93 Difference]: Finished difference Result 305 states and 360 transitions. [2021-01-06 10:55:56,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-01-06 10:55:56,418 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 51 [2021-01-06 10:55:56,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 10:55:56,420 INFO L225 Difference]: With dead ends: 305 [2021-01-06 10:55:56,420 INFO L226 Difference]: Without dead ends: 201 [2021-01-06 10:55:56,420 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2021-01-06 10:55:56,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2021-01-06 10:55:56,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 161. [2021-01-06 10:55:56,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2021-01-06 10:55:56,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 190 transitions. [2021-01-06 10:55:56,443 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 190 transitions. Word has length 51 [2021-01-06 10:55:56,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 10:55:56,443 INFO L481 AbstractCegarLoop]: Abstraction has 161 states and 190 transitions. [2021-01-06 10:55:56,443 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2021-01-06 10:55:56,443 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 190 transitions. [2021-01-06 10:55:56,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-01-06 10:55:56,444 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 10:55:56,444 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 4, 4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 10:55:56,662 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2021-01-06 10:55:56,663 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 10:55:56,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 10:55:56,664 INFO L82 PathProgramCache]: Analyzing trace with hash -487446506, now seen corresponding path program 9 times [2021-01-06 10:55:56,664 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 10:55:56,664 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493493554] [2021-01-06 10:55:56,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 10:55:56,672 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-01-06 10:55:56,672 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1937577959] [2021-01-06 10:55:56,672 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 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