/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc config/AutomizerReach.xml -s config/svcomp-Reach-64bit-Automizer_Default.epf -i ../sv-benchmarks/c/loops/eureka_05.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-dcfa08f [2020-12-23 06:42:33,041 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-23 06:42:33,045 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-23 06:42:33,083 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-23 06:42:33,084 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-23 06:42:33,086 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-23 06:42:33,088 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-23 06:42:33,091 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-23 06:42:33,094 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-23 06:42:33,095 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-23 06:42:33,097 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-23 06:42:33,099 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-23 06:42:33,099 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-23 06:42:33,101 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-23 06:42:33,103 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-23 06:42:33,105 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-23 06:42:33,106 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-23 06:42:33,108 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-23 06:42:33,111 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-23 06:42:33,114 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-23 06:42:33,116 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-23 06:42:33,119 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-23 06:42:33,121 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-23 06:42:33,122 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-23 06:42:33,142 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-23 06:42:33,142 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-23 06:42:33,143 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-23 06:42:33,146 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-23 06:42:33,147 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-23 06:42:33,149 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-23 06:42:33,153 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-23 06:42:33,155 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-23 06:42:33,157 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-23 06:42:33,159 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-23 06:42:33,161 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-23 06:42:33,162 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-23 06:42:33,163 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-23 06:42:33,163 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-23 06:42:33,164 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-23 06:42:33,165 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-23 06:42:33,174 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-23 06:42:33,176 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2020-12-23 06:42:33,238 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-23 06:42:33,239 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-23 06:42:33,244 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-12-23 06:42:33,244 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-12-23 06:42:33,245 INFO L138 SettingsManager]: * Use SBE=true [2020-12-23 06:42:33,245 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-23 06:42:33,245 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-23 06:42:33,245 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-23 06:42:33,246 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-23 06:42:33,246 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-23 06:42:33,247 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-23 06:42:33,247 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-23 06:42:33,248 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-23 06:42:33,248 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-23 06:42:33,248 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-23 06:42:33,249 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-12-23 06:42:33,249 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-23 06:42:33,249 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-23 06:42:33,249 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-23 06:42:33,250 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-23 06:42:33,250 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-23 06:42:33,250 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-12-23 06:42:33,250 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-23 06:42:33,251 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-23 06:42:33,251 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-23 06:42:33,251 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 [2020-12-23 06:42:33,731 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-23 06:42:33,762 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-23 06:42:33,766 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-23 06:42:33,767 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-23 06:42:33,768 INFO L275 PluginConnector]: CDTParser initialized [2020-12-23 06:42:33,769 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loops/eureka_05.i [2020-12-23 06:42:33,863 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/7be33b957/088e3d5a92394edca1d25db0e09d5a3a/FLAG7255600df [2020-12-23 06:42:34,450 INFO L306 CDTParser]: Found 1 translation units. [2020-12-23 06:42:34,451 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/loops/eureka_05.i [2020-12-23 06:42:34,460 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/7be33b957/088e3d5a92394edca1d25db0e09d5a3a/FLAG7255600df [2020-12-23 06:42:34,824 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/7be33b957/088e3d5a92394edca1d25db0e09d5a3a [2020-12-23 06:42:34,830 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-23 06:42:34,834 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-23 06:42:34,838 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-23 06:42:34,838 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-23 06:42:34,843 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-23 06:42:34,844 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.12 06:42:34" (1/1) ... [2020-12-23 06:42:34,847 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@67002f03 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 06:42:34, skipping insertion in model container [2020-12-23 06:42:34,847 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.12 06:42:34" (1/1) ... [2020-12-23 06:42:34,863 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-23 06:42:34,890 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-12-23 06:42:35,145 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/loops/eureka_05.i[810,823] left hand side expression in assignment: lhs: VariableLHS[~lh~0,] left hand side expression in assignment: lhs: VariableLHS[~rh~0,] left hand side expression in assignment: lhs: VariableLHS[~i~0,] left hand side expression in assignment: lhs: VariableLHS[~rh~0,] left hand side expression in assignment: lhs: VariableLHS[~temp~0,] left hand side expression in assignment: lhs: ArrayLHS[VariableLHS[~array~0,GLOBAL],[IdentifierExpression[~lh~0,]]] left hand side expression in assignment: lhs: ArrayLHS[VariableLHS[~array~0,GLOBAL],[IdentifierExpression[~rh~0,]]] left hand side expression in assignment: lhs: VariableLHS[~i~1,] left hand side expression in assignment: lhs: ArrayLHS[VariableLHS[~array~1,],[IdentifierExpression[~i~1,]]] left hand side expression in assignment: lhs: VariableLHS[~i~1,] [2020-12-23 06:42:35,181 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-23 06:42:35,196 INFO L203 MainTranslator]: Completed pre-run [2020-12-23 06:42:35,212 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/loops/eureka_05.i[810,823] left hand side expression in assignment: lhs: VariableLHS[~lh~0,] left hand side expression in assignment: lhs: VariableLHS[~rh~0,] left hand side expression in assignment: lhs: VariableLHS[~i~0,] left hand side expression in assignment: lhs: VariableLHS[~rh~0,] left hand side expression in assignment: lhs: VariableLHS[~temp~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#array~0,GLOBAL],base],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[~#array~0,GLOBAL],offset],BinaryExpression[ARITHMUL,IntegerLiteral[4],IdentifierExpression[~lh~0,]]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#array~0,GLOBAL],base],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[~#array~0,GLOBAL],offset],BinaryExpression[ARITHMUL,IntegerLiteral[4],IdentifierExpression[~rh~0,]]]]] left hand side expression in assignment: lhs: VariableLHS[~i~1,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#array~1,],base],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[~#array~1,],offset],BinaryExpression[ARITHMUL,IntegerLiteral[4],IdentifierExpression[~i~1,]]]]] left hand side expression in assignment: lhs: VariableLHS[~i~1,] [2020-12-23 06:42:35,223 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-23 06:42:35,241 INFO L208 MainTranslator]: Completed translation [2020-12-23 06:42:35,242 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 06:42:35 WrapperNode [2020-12-23 06:42:35,242 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-23 06:42:35,243 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-23 06:42:35,244 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-23 06:42:35,244 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-23 06:42:35,253 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 06:42:35" (1/1) ... [2020-12-23 06:42:35,262 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 06:42:35" (1/1) ... [2020-12-23 06:42:35,291 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-23 06:42:35,292 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-23 06:42:35,292 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-23 06:42:35,292 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-23 06:42:35,302 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 06:42:35" (1/1) ... [2020-12-23 06:42:35,302 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 06:42:35" (1/1) ... [2020-12-23 06:42:35,305 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 06:42:35" (1/1) ... [2020-12-23 06:42:35,306 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 06:42:35" (1/1) ... [2020-12-23 06:42:35,314 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 06:42:35" (1/1) ... [2020-12-23 06:42:35,320 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 06:42:35" (1/1) ... [2020-12-23 06:42:35,321 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 06:42:35" (1/1) ... [2020-12-23 06:42:35,324 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-23 06:42:35,325 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-23 06:42:35,326 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-23 06:42:35,326 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-23 06:42:35,327 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 06:42:35" (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 [2020-12-23 06:42:35,426 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-12-23 06:42:35,426 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-23 06:42:35,427 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-12-23 06:42:35,427 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-23 06:42:35,427 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-23 06:42:35,427 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-12-23 06:42:35,427 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-12-23 06:42:35,811 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-23 06:42:35,812 INFO L299 CfgBuilder]: Removed 12 assume(true) statements. [2020-12-23 06:42:35,817 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 06:42:35 BoogieIcfgContainer [2020-12-23 06:42:35,818 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-23 06:42:35,822 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-23 06:42:35,822 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-23 06:42:35,829 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-23 06:42:35,831 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.12 06:42:34" (1/3) ... [2020-12-23 06:42:35,832 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f881858 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.12 06:42:35, skipping insertion in model container [2020-12-23 06:42:35,836 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 06:42:35" (2/3) ... [2020-12-23 06:42:35,837 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f881858 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.12 06:42:35, skipping insertion in model container [2020-12-23 06:42:35,837 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 06:42:35" (3/3) ... [2020-12-23 06:42:35,841 INFO L111 eAbstractionObserver]: Analyzing ICFG eureka_05.i [2020-12-23 06:42:35,858 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-23 06:42:35,874 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-12-23 06:42:35,925 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-12-23 06:42:35,975 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-23 06:42:35,977 INFO L378 AbstractCegarLoop]: Hoare is true [2020-12-23 06:42:35,978 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-23 06:42:35,978 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-23 06:42:35,978 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-23 06:42:35,978 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-23 06:42:35,979 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-23 06:42:35,979 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-23 06:42:35,998 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states. [2020-12-23 06:42:36,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-12-23 06:42:36,004 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 06:42:36,005 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 06:42:36,005 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 06:42:36,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 06:42:36,013 INFO L82 PathProgramCache]: Analyzing trace with hash -2015864939, now seen corresponding path program 1 times [2020-12-23 06:42:36,027 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 06:42:36,029 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365150645] [2020-12-23 06:42:36,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 06:42:36,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 06:42:36,316 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 06:42:36,318 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365150645] [2020-12-23 06:42:36,320 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 06:42:36,320 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 06:42:36,321 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404893979] [2020-12-23 06:42:36,327 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 06:42:36,328 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 06:42:36,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 06:42:36,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 06:42:36,356 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 3 states. [2020-12-23 06:42:36,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 06:42:36,422 INFO L93 Difference]: Finished difference Result 42 states and 60 transitions. [2020-12-23 06:42:36,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 06:42:36,425 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2020-12-23 06:42:36,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 06:42:36,435 INFO L225 Difference]: With dead ends: 42 [2020-12-23 06:42:36,435 INFO L226 Difference]: Without dead ends: 20 [2020-12-23 06:42:36,439 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 06:42:36,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2020-12-23 06:42:36,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2020-12-23 06:42:36,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2020-12-23 06:42:36,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions. [2020-12-23 06:42:36,479 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 23 transitions. Word has length 9 [2020-12-23 06:42:36,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 06:42:36,480 INFO L481 AbstractCegarLoop]: Abstraction has 19 states and 23 transitions. [2020-12-23 06:42:36,480 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 06:42:36,480 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 23 transitions. [2020-12-23 06:42:36,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-12-23 06:42:36,481 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 06:42:36,481 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 06:42:36,482 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-12-23 06:42:36,482 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 06:42:36,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 06:42:36,483 INFO L82 PathProgramCache]: Analyzing trace with hash 1565230291, now seen corresponding path program 1 times [2020-12-23 06:42:36,483 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 06:42:36,484 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853819313] [2020-12-23 06:42:36,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 06:42:36,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 06:42:36,549 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 06:42:36,550 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853819313] [2020-12-23 06:42:36,550 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1484918446] [2020-12-23 06:42:36,550 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 [2020-12-23 06:42:36,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 06:42:36,613 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 3 conjunts are in the unsatisfiable core [2020-12-23 06:42:36,619 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 06:42:36,679 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 06:42:36,679 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 06:42:36,680 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2020-12-23 06:42:36,681 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873460096] [2020-12-23 06:42:36,682 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 06:42:36,682 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 06:42:36,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 06:42:36,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-23 06:42:36,684 INFO L87 Difference]: Start difference. First operand 19 states and 23 transitions. Second operand 4 states. [2020-12-23 06:42:36,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 06:42:36,714 INFO L93 Difference]: Finished difference Result 36 states and 44 transitions. [2020-12-23 06:42:36,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 06:42:36,714 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2020-12-23 06:42:36,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 06:42:36,715 INFO L225 Difference]: With dead ends: 36 [2020-12-23 06:42:36,716 INFO L226 Difference]: Without dead ends: 22 [2020-12-23 06:42:36,717 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-23 06:42:36,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2020-12-23 06:42:36,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2020-12-23 06:42:36,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-12-23 06:42:36,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2020-12-23 06:42:36,723 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 11 [2020-12-23 06:42:36,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 06:42:36,723 INFO L481 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2020-12-23 06:42:36,723 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 06:42:36,723 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2020-12-23 06:42:36,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-12-23 06:42:36,724 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 06:42:36,724 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 06:42:36,937 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2020-12-23 06:42:36,938 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 06:42:36,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 06:42:36,940 INFO L82 PathProgramCache]: Analyzing trace with hash -1566025071, now seen corresponding path program 2 times [2020-12-23 06:42:36,940 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 06:42:36,941 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041961677] [2020-12-23 06:42:36,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 06:42:36,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 06:42:36,998 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-12-23 06:42:36,999 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041961677] [2020-12-23 06:42:36,999 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 06:42:36,999 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 06:42:37,000 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603720440] [2020-12-23 06:42:37,000 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 06:42:37,000 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 06:42:37,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 06:42:37,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-23 06:42:37,002 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand 4 states. [2020-12-23 06:42:37,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 06:42:37,030 INFO L93 Difference]: Finished difference Result 34 states and 41 transitions. [2020-12-23 06:42:37,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 06:42:37,031 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2020-12-23 06:42:37,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 06:42:37,032 INFO L225 Difference]: With dead ends: 34 [2020-12-23 06:42:37,032 INFO L226 Difference]: Without dead ends: 27 [2020-12-23 06:42:37,033 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-23 06:42:37,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2020-12-23 06:42:37,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 22. [2020-12-23 06:42:37,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2020-12-23 06:42:37,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2020-12-23 06:42:37,039 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 13 [2020-12-23 06:42:37,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 06:42:37,039 INFO L481 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2020-12-23 06:42:37,039 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 06:42:37,040 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2020-12-23 06:42:37,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-12-23 06:42:37,040 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 06:42:37,041 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 06:42:37,041 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-12-23 06:42:37,041 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 06:42:37,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 06:42:37,042 INFO L82 PathProgramCache]: Analyzing trace with hash 2104278057, now seen corresponding path program 1 times [2020-12-23 06:42:37,042 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 06:42:37,043 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626077288] [2020-12-23 06:42:37,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 06:42:37,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 06:42:37,182 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-12-23 06:42:37,185 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626077288] [2020-12-23 06:42:37,185 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 06:42:37,185 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 06:42:37,186 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439999683] [2020-12-23 06:42:37,186 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 06:42:37,187 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 06:42:37,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 06:42:37,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-12-23 06:42:37,188 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand 5 states. [2020-12-23 06:42:37,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 06:42:37,258 INFO L93 Difference]: Finished difference Result 43 states and 54 transitions. [2020-12-23 06:42:37,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 06:42:37,259 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2020-12-23 06:42:37,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 06:42:37,260 INFO L225 Difference]: With dead ends: 43 [2020-12-23 06:42:37,260 INFO L226 Difference]: Without dead ends: 30 [2020-12-23 06:42:37,263 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-12-23 06:42:37,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2020-12-23 06:42:37,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 23. [2020-12-23 06:42:37,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2020-12-23 06:42:37,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2020-12-23 06:42:37,279 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 17 [2020-12-23 06:42:37,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 06:42:37,279 INFO L481 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2020-12-23 06:42:37,280 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 06:42:37,280 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2020-12-23 06:42:37,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-12-23 06:42:37,281 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 06:42:37,281 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 06:42:37,281 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-12-23 06:42:37,282 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 06:42:37,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 06:42:37,284 INFO L82 PathProgramCache]: Analyzing trace with hash -913507013, now seen corresponding path program 1 times [2020-12-23 06:42:37,285 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 06:42:37,286 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127041990] [2020-12-23 06:42:37,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 06:42:37,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 06:42:37,381 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-12-23 06:42:37,381 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127041990] [2020-12-23 06:42:37,382 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1364568730] [2020-12-23 06:42:37,382 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 [2020-12-23 06:42:37,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 06:42:37,437 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 4 conjunts are in the unsatisfiable core [2020-12-23 06:42:37,439 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 06:42:37,496 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-12-23 06:42:37,496 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 06:42:37,496 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 8 [2020-12-23 06:42:37,497 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141070287] [2020-12-23 06:42:37,497 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-12-23 06:42:37,498 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 06:42:37,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-12-23 06:42:37,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2020-12-23 06:42:37,499 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand 8 states. [2020-12-23 06:42:37,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 06:42:37,680 INFO L93 Difference]: Finished difference Result 53 states and 66 transitions. [2020-12-23 06:42:37,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-23 06:42:37,681 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 20 [2020-12-23 06:42:37,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 06:42:37,682 INFO L225 Difference]: With dead ends: 53 [2020-12-23 06:42:37,682 INFO L226 Difference]: Without dead ends: 37 [2020-12-23 06:42:37,683 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2020-12-23 06:42:37,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2020-12-23 06:42:37,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 31. [2020-12-23 06:42:37,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-12-23 06:42:37,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 37 transitions. [2020-12-23 06:42:37,692 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 37 transitions. Word has length 20 [2020-12-23 06:42:37,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 06:42:37,693 INFO L481 AbstractCegarLoop]: Abstraction has 31 states and 37 transitions. [2020-12-23 06:42:37,693 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-12-23 06:42:37,693 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 37 transitions. [2020-12-23 06:42:37,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-12-23 06:42:37,695 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 06:42:37,696 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 06:42:37,910 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 06:42:37,911 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 06:42:37,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 06:42:37,913 INFO L82 PathProgramCache]: Analyzing trace with hash 34400469, now seen corresponding path program 2 times [2020-12-23 06:42:37,913 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 06:42:37,914 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882375326] [2020-12-23 06:42:37,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 06:42:37,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 06:42:38,009 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-12-23 06:42:38,011 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882375326] [2020-12-23 06:42:38,011 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1373973261] [2020-12-23 06:42:38,012 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 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 [2020-12-23 06:42:38,076 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-12-23 06:42:38,076 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-23 06:42:38,078 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 5 conjunts are in the unsatisfiable core [2020-12-23 06:42:38,080 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 06:42:38,218 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-12-23 06:42:38,219 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 06:42:38,219 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 10 [2020-12-23 06:42:38,219 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203319105] [2020-12-23 06:42:38,220 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-12-23 06:42:38,220 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 06:42:38,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-12-23 06:42:38,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2020-12-23 06:42:38,222 INFO L87 Difference]: Start difference. First operand 31 states and 37 transitions. Second operand 10 states. [2020-12-23 06:42:38,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 06:42:38,446 INFO L93 Difference]: Finished difference Result 66 states and 83 transitions. [2020-12-23 06:42:38,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-12-23 06:42:38,448 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 26 [2020-12-23 06:42:38,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 06:42:38,451 INFO L225 Difference]: With dead ends: 66 [2020-12-23 06:42:38,456 INFO L226 Difference]: Without dead ends: 44 [2020-12-23 06:42:38,457 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2020-12-23 06:42:38,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2020-12-23 06:42:38,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 34. [2020-12-23 06:42:38,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2020-12-23 06:42:38,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 40 transitions. [2020-12-23 06:42:38,480 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 40 transitions. Word has length 26 [2020-12-23 06:42:38,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 06:42:38,480 INFO L481 AbstractCegarLoop]: Abstraction has 34 states and 40 transitions. [2020-12-23 06:42:38,480 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-12-23 06:42:38,480 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 40 transitions. [2020-12-23 06:42:38,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-12-23 06:42:38,484 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 06:42:38,484 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 06:42:38,685 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 06:42:38,685 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 06:42:38,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 06:42:38,687 INFO L82 PathProgramCache]: Analyzing trace with hash 593601357, now seen corresponding path program 3 times [2020-12-23 06:42:38,687 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 06:42:38,688 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039194719] [2020-12-23 06:42:38,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 06:42:38,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 06:42:38,853 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2020-12-23 06:42:38,854 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039194719] [2020-12-23 06:42:38,854 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1053536093] [2020-12-23 06:42:38,854 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 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 [2020-12-23 06:42:38,940 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2020-12-23 06:42:38,941 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-23 06:42:38,943 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 5 conjunts are in the unsatisfiable core [2020-12-23 06:42:38,945 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 06:42:39,069 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2020-12-23 06:42:39,070 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 06:42:39,070 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2020-12-23 06:42:39,071 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857157435] [2020-12-23 06:42:39,071 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-12-23 06:42:39,072 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 06:42:39,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-12-23 06:42:39,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-12-23 06:42:39,073 INFO L87 Difference]: Start difference. First operand 34 states and 40 transitions. Second operand 9 states. [2020-12-23 06:42:39,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 06:42:39,212 INFO L93 Difference]: Finished difference Result 56 states and 68 transitions. [2020-12-23 06:42:39,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-23 06:42:39,213 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 31 [2020-12-23 06:42:39,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 06:42:39,214 INFO L225 Difference]: With dead ends: 56 [2020-12-23 06:42:39,214 INFO L226 Difference]: Without dead ends: 39 [2020-12-23 06:42:39,215 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2020-12-23 06:42:39,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2020-12-23 06:42:39,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 37. [2020-12-23 06:42:39,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2020-12-23 06:42:39,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 44 transitions. [2020-12-23 06:42:39,222 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 44 transitions. Word has length 31 [2020-12-23 06:42:39,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 06:42:39,223 INFO L481 AbstractCegarLoop]: Abstraction has 37 states and 44 transitions. [2020-12-23 06:42:39,223 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-12-23 06:42:39,223 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 44 transitions. [2020-12-23 06:42:39,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-12-23 06:42:39,224 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 06:42:39,225 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 06:42:39,431 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 06:42:39,432 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 06:42:39,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 06:42:39,434 INFO L82 PathProgramCache]: Analyzing trace with hash -1074369433, now seen corresponding path program 4 times [2020-12-23 06:42:39,434 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 06:42:39,435 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609263592] [2020-12-23 06:42:39,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 06:42:39,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 06:42:39,598 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 12 proven. 5 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2020-12-23 06:42:39,599 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609263592] [2020-12-23 06:42:39,599 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [578566109] [2020-12-23 06:42:39,599 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 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 [2020-12-23 06:42:39,656 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-12-23 06:42:39,656 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-23 06:42:39,658 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 6 conjunts are in the unsatisfiable core [2020-12-23 06:42:39,660 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 06:42:39,777 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 3 proven. 17 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2020-12-23 06:42:39,777 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 06:42:39,777 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 12 [2020-12-23 06:42:39,778 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631657009] [2020-12-23 06:42:39,779 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-12-23 06:42:39,780 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 06:42:39,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-12-23 06:42:39,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2020-12-23 06:42:39,781 INFO L87 Difference]: Start difference. First operand 37 states and 44 transitions. Second operand 12 states. [2020-12-23 06:42:40,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 06:42:40,072 INFO L93 Difference]: Finished difference Result 72 states and 92 transitions. [2020-12-23 06:42:40,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-12-23 06:42:40,073 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 34 [2020-12-23 06:42:40,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 06:42:40,075 INFO L225 Difference]: With dead ends: 72 [2020-12-23 06:42:40,080 INFO L226 Difference]: Without dead ends: 55 [2020-12-23 06:42:40,081 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=136, Invalid=284, Unknown=0, NotChecked=0, Total=420 [2020-12-23 06:42:40,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2020-12-23 06:42:40,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 51. [2020-12-23 06:42:40,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2020-12-23 06:42:40,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 63 transitions. [2020-12-23 06:42:40,111 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 63 transitions. Word has length 34 [2020-12-23 06:42:40,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 06:42:40,111 INFO L481 AbstractCegarLoop]: Abstraction has 51 states and 63 transitions. [2020-12-23 06:42:40,111 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-12-23 06:42:40,111 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 63 transitions. [2020-12-23 06:42:40,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2020-12-23 06:42:40,114 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 06:42:40,115 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 06:42:40,325 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 06:42:40,326 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 06:42:40,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 06:42:40,327 INFO L82 PathProgramCache]: Analyzing trace with hash -483995587, now seen corresponding path program 5 times [2020-12-23 06:42:40,327 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 06:42:40,328 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368325005] [2020-12-23 06:42:40,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 06:42:40,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 06:42:40,524 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 26 proven. 12 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2020-12-23 06:42:40,524 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368325005] [2020-12-23 06:42:40,525 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [87671610] [2020-12-23 06:42:40,525 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 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 [2020-12-23 06:42:40,606 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2020-12-23 06:42:40,606 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-23 06:42:40,608 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 4 conjunts are in the unsatisfiable core [2020-12-23 06:42:40,611 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 06:42:40,693 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2020-12-23 06:42:40,694 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-12-23 06:42:40,694 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 11 [2020-12-23 06:42:40,694 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836357534] [2020-12-23 06:42:40,695 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 06:42:40,695 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 06:42:40,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 06:42:40,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2020-12-23 06:42:40,696 INFO L87 Difference]: Start difference. First operand 51 states and 63 transitions. Second operand 5 states. [2020-12-23 06:42:40,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 06:42:40,757 INFO L93 Difference]: Finished difference Result 80 states and 100 transitions. [2020-12-23 06:42:40,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 06:42:40,758 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 45 [2020-12-23 06:42:40,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 06:42:40,759 INFO L225 Difference]: With dead ends: 80 [2020-12-23 06:42:40,759 INFO L226 Difference]: Without dead ends: 53 [2020-12-23 06:42:40,760 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2020-12-23 06:42:40,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2020-12-23 06:42:40,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 51. [2020-12-23 06:42:40,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2020-12-23 06:42:40,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 61 transitions. [2020-12-23 06:42:40,768 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 61 transitions. Word has length 45 [2020-12-23 06:42:40,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 06:42:40,769 INFO L481 AbstractCegarLoop]: Abstraction has 51 states and 61 transitions. [2020-12-23 06:42:40,769 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 06:42:40,769 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 61 transitions. [2020-12-23 06:42:40,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2020-12-23 06:42:40,771 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 06:42:40,771 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 06:42:40,984 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 06:42:40,985 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 06:42:40,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 06:42:40,986 INFO L82 PathProgramCache]: Analyzing trace with hash 1464031703, now seen corresponding path program 6 times [2020-12-23 06:42:40,987 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 06:42:40,987 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055276183] [2020-12-23 06:42:40,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 06:42:41,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 06:42:41,106 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 36 proven. 12 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2020-12-23 06:42:41,107 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055276183] [2020-12-23 06:42:41,107 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1425566838] [2020-12-23 06:42:41,107 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 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 [2020-12-23 06:42:41,253 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2020-12-23 06:42:41,254 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-23 06:42:41,255 INFO L263 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 7 conjunts are in the unsatisfiable core [2020-12-23 06:42:41,258 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 06:42:41,418 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 36 proven. 12 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2020-12-23 06:42:41,418 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 06:42:41,418 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2020-12-23 06:42:41,419 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673707147] [2020-12-23 06:42:41,419 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-12-23 06:42:41,420 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 06:42:41,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-12-23 06:42:41,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2020-12-23 06:42:41,421 INFO L87 Difference]: Start difference. First operand 51 states and 61 transitions. Second operand 13 states. [2020-12-23 06:42:41,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 06:42:41,633 INFO L93 Difference]: Finished difference Result 84 states and 102 transitions. [2020-12-23 06:42:41,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-12-23 06:42:41,634 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 48 [2020-12-23 06:42:41,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 06:42:41,637 INFO L225 Difference]: With dead ends: 84 [2020-12-23 06:42:41,637 INFO L226 Difference]: Without dead ends: 56 [2020-12-23 06:42:41,639 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=98, Invalid=208, Unknown=0, NotChecked=0, Total=306 [2020-12-23 06:42:41,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2020-12-23 06:42:41,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 54. [2020-12-23 06:42:41,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2020-12-23 06:42:41,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 65 transitions. [2020-12-23 06:42:41,660 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 65 transitions. Word has length 48 [2020-12-23 06:42:41,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 06:42:41,661 INFO L481 AbstractCegarLoop]: Abstraction has 54 states and 65 transitions. [2020-12-23 06:42:41,662 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-12-23 06:42:41,662 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 65 transitions. [2020-12-23 06:42:41,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2020-12-23 06:42:41,664 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 06:42:41,664 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 6, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 06:42:41,877 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2020-12-23 06:42:41,878 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 06:42:41,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 06:42:41,879 INFO L82 PathProgramCache]: Analyzing trace with hash 1988798461, now seen corresponding path program 7 times [2020-12-23 06:42:41,880 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 06:42:41,880 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248104564] [2020-12-23 06:42:41,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 06:42:41,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 06:42:41,975 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 43 proven. 20 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2020-12-23 06:42:41,975 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248104564] [2020-12-23 06:42:41,983 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1003895021] [2020-12-23 06:42:41,984 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 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 [2020-12-23 06:42:42,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 06:42:42,056 INFO L263 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 6 conjunts are in the unsatisfiable core [2020-12-23 06:42:42,069 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 06:42:42,196 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2020-12-23 06:42:42,196 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 06:42:42,196 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 12 [2020-12-23 06:42:42,197 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371704199] [2020-12-23 06:42:42,197 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-12-23 06:42:42,198 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 06:42:42,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-12-23 06:42:42,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2020-12-23 06:42:42,199 INFO L87 Difference]: Start difference. First operand 54 states and 65 transitions. Second operand 12 states. [2020-12-23 06:42:42,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 06:42:42,509 INFO L93 Difference]: Finished difference Result 133 states and 160 transitions. [2020-12-23 06:42:42,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-12-23 06:42:42,509 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 51 [2020-12-23 06:42:42,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 06:42:42,510 INFO L225 Difference]: With dead ends: 133 [2020-12-23 06:42:42,511 INFO L226 Difference]: Without dead ends: 90 [2020-12-23 06:42:42,512 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=112, Invalid=350, Unknown=0, NotChecked=0, Total=462 [2020-12-23 06:42:42,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2020-12-23 06:42:42,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 59. [2020-12-23 06:42:42,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2020-12-23 06:42:42,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 71 transitions. [2020-12-23 06:42:42,540 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 71 transitions. Word has length 51 [2020-12-23 06:42:42,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 06:42:42,541 INFO L481 AbstractCegarLoop]: Abstraction has 59 states and 71 transitions. [2020-12-23 06:42:42,541 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-12-23 06:42:42,541 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 71 transitions. [2020-12-23 06:42:42,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2020-12-23 06:42:42,544 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 06:42:42,544 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 7, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 06:42:42,757 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2020-12-23 06:42:42,758 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 06:42:42,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 06:42:42,759 INFO L82 PathProgramCache]: Analyzing trace with hash -1926489495, now seen corresponding path program 8 times [2020-12-23 06:42:42,759 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 06:42:42,760 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939368084] [2020-12-23 06:42:42,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 06:42:42,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 06:42:42,860 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 48 proven. 37 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2020-12-23 06:42:42,861 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939368084] [2020-12-23 06:42:42,861 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1330263909] [2020-12-23 06:42:42,861 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 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 [2020-12-23 06:42:42,945 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-12-23 06:42:42,945 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-23 06:42:42,947 INFO L263 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 7 conjunts are in the unsatisfiable core [2020-12-23 06:42:42,950 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 06:42:43,104 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 48 proven. 37 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2020-12-23 06:42:43,105 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 06:42:43,105 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2020-12-23 06:42:43,105 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100906537] [2020-12-23 06:42:43,106 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-12-23 06:42:43,106 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 06:42:43,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-12-23 06:42:43,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2020-12-23 06:42:43,107 INFO L87 Difference]: Start difference. First operand 59 states and 71 transitions. Second operand 13 states. [2020-12-23 06:42:43,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 06:42:43,315 INFO L93 Difference]: Finished difference Result 93 states and 115 transitions. [2020-12-23 06:42:43,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-12-23 06:42:43,316 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 56 [2020-12-23 06:42:43,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 06:42:43,317 INFO L225 Difference]: With dead ends: 93 [2020-12-23 06:42:43,317 INFO L226 Difference]: Without dead ends: 69 [2020-12-23 06:42:43,318 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=158, Invalid=304, Unknown=0, NotChecked=0, Total=462 [2020-12-23 06:42:43,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2020-12-23 06:42:43,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 62. [2020-12-23 06:42:43,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2020-12-23 06:42:43,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 75 transitions. [2020-12-23 06:42:43,326 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 75 transitions. Word has length 56 [2020-12-23 06:42:43,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 06:42:43,327 INFO L481 AbstractCegarLoop]: Abstraction has 62 states and 75 transitions. [2020-12-23 06:42:43,327 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-12-23 06:42:43,327 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 75 transitions. [2020-12-23 06:42:43,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2020-12-23 06:42:43,328 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 06:42:43,328 INFO L422 BasicCegarLoop]: trace histogram [8, 8, 8, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 06:42:43,542 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 06:42:43,543 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 06:42:43,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 06:42:43,544 INFO L82 PathProgramCache]: Analyzing trace with hash 1118322939, now seen corresponding path program 9 times [2020-12-23 06:42:43,544 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 06:42:43,545 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831991720] [2020-12-23 06:42:43,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 06:42:43,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 06:42:43,680 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 25 proven. 82 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2020-12-23 06:42:43,681 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831991720] [2020-12-23 06:42:43,681 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1702218144] [2020-12-23 06:42:43,681 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 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 [2020-12-23 06:42:43,903 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2020-12-23 06:42:43,903 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-23 06:42:43,905 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 29 conjunts are in the unsatisfiable core [2020-12-23 06:42:43,908 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 06:42:43,959 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 06:42:44,030 INFO L348 Elim1Store]: treesize reduction 67, result has 25.6 percent of original size [2020-12-23 06:42:44,031 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 39 [2020-12-23 06:42:44,035 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 06:42:44,088 INFO L625 ElimStorePlain]: treesize reduction 4, result has 93.5 percent of original size [2020-12-23 06:42:44,099 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-12-23 06:42:44,104 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-12-23 06:42:44,107 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2020-12-23 06:42:44,111 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-12-23 06:42:44,111 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:56, output treesize:58 [2020-12-23 06:42:44,116 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-12-23 06:42:44,118 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-12-23 06:42:44,120 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2020-12-23 06:42:44,172 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-12-23 06:42:44,176 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-12-23 06:42:44,179 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2020-12-23 06:42:44,181 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2020-12-23 06:42:44,264 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 06:42:44,265 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 21 treesize of output 45 [2020-12-23 06:42:44,277 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 06:42:44,278 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 06:42:44,280 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 06:42:44,293 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 06:42:44,330 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 06:42:44,331 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 21 treesize of output 45 [2020-12-23 06:42:44,335 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 06:42:44,336 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 06:42:44,341 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 06:42:44,346 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 06:42:44,360 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 06:42:44,394 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 06:42:44,394 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 26 treesize of output 72 [2020-12-23 06:42:44,400 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-23 06:42:44,402 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 06:42:44,404 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 06:42:44,406 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 06:42:44,412 INFO L547 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-12-23 06:42:44,568 WARN L197 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 35 [2020-12-23 06:42:44,569 INFO L625 ElimStorePlain]: treesize reduction 16, result has 88.4 percent of original size [2020-12-23 06:42:44,576 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2020-12-23 06:42:44,577 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:159, output treesize:59 [2020-12-23 06:42:44,636 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 06:42:44,638 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2020-12-23 06:42:44,643 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 06:42:44,658 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 06:42:44,659 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. [2020-12-23 06:42:44,660 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:42, output treesize:38 [2020-12-23 06:42:44,714 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 06:42:44,734 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 06:42:44,734 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 84 [2020-12-23 06:42:44,739 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 06:42:44,796 INFO L625 ElimStorePlain]: treesize reduction 28, result has 63.6 percent of original size [2020-12-23 06:42:44,798 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. [2020-12-23 06:42:44,799 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:53, output treesize:49 [2020-12-23 06:42:44,847 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 06:42:44,861 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 06:42:44,862 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 84 [2020-12-23 06:42:44,866 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 06:42:44,903 INFO L625 ElimStorePlain]: treesize reduction 28, result has 63.6 percent of original size [2020-12-23 06:42:44,905 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. [2020-12-23 06:42:44,906 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:53, output treesize:49 [2020-12-23 06:42:44,953 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 06:42:44,966 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 06:42:44,967 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 84 [2020-12-23 06:42:44,971 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 06:42:45,007 INFO L625 ElimStorePlain]: treesize reduction 28, result has 63.6 percent of original size [2020-12-23 06:42:45,009 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. [2020-12-23 06:42:45,010 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:53, output treesize:49 [2020-12-23 06:42:45,066 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 06:42:45,082 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 06:42:45,082 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 84 [2020-12-23 06:42:45,086 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 06:42:45,125 INFO L625 ElimStorePlain]: treesize reduction 28, result has 63.6 percent of original size [2020-12-23 06:42:45,131 INFO L547 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2020-12-23 06:42:45,131 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:53, output treesize:49 [2020-12-23 06:42:53,217 WARN L197 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 32 [2020-12-23 06:42:55,314 WARN L197 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 34 [2020-12-23 06:42:57,386 WARN L197 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 37 [2020-12-23 06:42:57,417 INFO L173 IndexEqualityManager]: detected equality via solver [2020-12-23 06:42:57,419 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 06:42:57,425 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 06:42:57,426 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 35 [2020-12-23 06:42:57,430 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 06:42:57,450 INFO L625 ElimStorePlain]: treesize reduction 12, result has 58.6 percent of original size [2020-12-23 06:42:57,452 INFO L547 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 06:42:57,453 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:63, output treesize:10 [2020-12-23 06:42:57,524 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 26 proven. 9 refuted. 0 times theorem prover too weak. 134 trivial. 0 not checked. [2020-12-23 06:42:57,524 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 06:42:57,524 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 14 [2020-12-23 06:42:57,525 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237120465] [2020-12-23 06:42:57,525 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-12-23 06:42:57,526 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 06:42:57,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-12-23 06:42:57,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=172, Unknown=3, NotChecked=0, Total=210 [2020-12-23 06:42:57,527 INFO L87 Difference]: Start difference. First operand 62 states and 75 transitions. Second operand 15 states. [2020-12-23 06:43:17,985 WARN L197 SmtUtils]: Spent 2.05 s on a formula simplification that was a NOOP. DAG size: 58 [2020-12-23 06:43:22,135 WARN L197 SmtUtils]: Spent 4.13 s on a formula simplification. DAG size of input: 66 DAG size of output: 63 [2020-12-23 06:43:26,311 WARN L197 SmtUtils]: Spent 4.15 s on a formula simplification. DAG size of input: 71 DAG size of output: 67 [2020-12-23 06:43:33,009 WARN L197 SmtUtils]: Spent 2.05 s on a formula simplification that was a NOOP. DAG size: 62 [2020-12-23 06:43:36,856 WARN L197 SmtUtils]: Spent 2.05 s on a formula simplification that was a NOOP. DAG size: 61 [2020-12-23 06:43:39,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 06:43:39,253 INFO L93 Difference]: Finished difference Result 122 states and 152 transitions. [2020-12-23 06:43:39,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2020-12-23 06:43:39,254 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 59 [2020-12-23 06:43:39,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 06:43:39,255 INFO L225 Difference]: With dead ends: 122 [2020-12-23 06:43:39,255 INFO L226 Difference]: Without dead ends: 77 [2020-12-23 06:43:39,256 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 52 SyntacticMatches, 3 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 35.4s TimeCoverageRelationStatistics Valid=241, Invalid=682, Unknown=7, NotChecked=0, Total=930 [2020-12-23 06:43:39,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2020-12-23 06:43:39,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 72. [2020-12-23 06:43:39,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2020-12-23 06:43:39,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 87 transitions. [2020-12-23 06:43:39,268 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 87 transitions. Word has length 59 [2020-12-23 06:43:39,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 06:43:39,268 INFO L481 AbstractCegarLoop]: Abstraction has 72 states and 87 transitions. [2020-12-23 06:43:39,268 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-12-23 06:43:39,268 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 87 transitions. [2020-12-23 06:43:39,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2020-12-23 06:43:39,269 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 06:43:39,269 INFO L422 BasicCegarLoop]: trace histogram [10, 10, 9, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 06:43:39,470 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 06:43:39,470 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 06:43:39,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 06:43:39,472 INFO L82 PathProgramCache]: Analyzing trace with hash 539933349, now seen corresponding path program 1 times [2020-12-23 06:43:39,472 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 06:43:39,472 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938293332] [2020-12-23 06:43:39,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 06:43:39,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 06:43:40,076 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 16 proven. 18 refuted. 0 times theorem prover too weak. 221 trivial. 0 not checked. [2020-12-23 06:43:40,077 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938293332] [2020-12-23 06:43:40,077 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [968159044] [2020-12-23 06:43:40,077 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 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 [2020-12-23 06:43:40,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 06:43:40,163 INFO L263 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 29 conjunts are in the unsatisfiable core [2020-12-23 06:43:40,166 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 06:43:40,251 INFO L348 Elim1Store]: treesize reduction 73, result has 33.0 percent of original size [2020-12-23 06:43:40,252 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 15 treesize of output 41 [2020-12-23 06:43:40,254 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 06:43:40,292 INFO L625 ElimStorePlain]: treesize reduction 10, result has 75.6 percent of original size [2020-12-23 06:43:40,295 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 2 disjuncts [2020-12-23 06:43:40,297 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 2 disjuncts [2020-12-23 06:43:40,299 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 3 disjuncts [2020-12-23 06:43:40,300 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-12-23 06:43:40,301 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:15, output treesize:31 [2020-12-23 06:43:40,303 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 2 disjuncts [2020-12-23 06:43:40,304 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 2 disjuncts [2020-12-23 06:43:40,305 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 3 disjuncts [2020-12-23 06:43:40,350 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 2 disjuncts [2020-12-23 06:43:40,352 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 2 disjuncts [2020-12-23 06:43:40,353 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 5 disjuncts [2020-12-23 06:43:40,415 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 06:43:40,416 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 21 treesize of output 61 [2020-12-23 06:43:40,419 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 06:43:40,420 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 06:43:40,422 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 06:43:40,429 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 06:43:40,517 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 06:43:40,518 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 26 treesize of output 96 [2020-12-23 06:43:40,522 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-23 06:43:40,524 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 06:43:40,525 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 06:43:40,527 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 06:43:40,530 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 06:43:40,583 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 06:43:40,583 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 21 treesize of output 61 [2020-12-23 06:43:40,586 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 06:43:40,588 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 06:43:40,590 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 06:43:40,593 INFO L547 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-12-23 06:43:40,639 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 06:43:40,640 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 21 treesize of output 61 [2020-12-23 06:43:40,643 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 06:43:40,645 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 06:43:40,646 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 06:43:40,649 INFO L547 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-12-23 06:43:40,728 INFO L625 ElimStorePlain]: treesize reduction 47, result has 41.3 percent of original size [2020-12-23 06:43:40,732 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2020-12-23 06:43:40,733 INFO L244 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:105, output treesize:21 [2020-12-23 06:43:40,883 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-12-23 06:43:40,884 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 06:43:40,890 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 06:43:40,891 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 06:43:40,891 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:12 [2020-12-23 06:43:40,982 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 06:43:40,983 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 69 [2020-12-23 06:43:40,986 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 06:43:41,006 INFO L625 ElimStorePlain]: treesize reduction 20, result has 53.5 percent of original size [2020-12-23 06:43:41,008 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 06:43:41,008 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:12 [2020-12-23 06:43:41,056 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 06:43:41,056 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 69 [2020-12-23 06:43:41,060 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 06:43:41,079 INFO L625 ElimStorePlain]: treesize reduction 20, result has 53.5 percent of original size [2020-12-23 06:43:41,081 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 06:43:41,082 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:12 [2020-12-23 06:43:41,122 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 06:43:41,123 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 69 [2020-12-23 06:43:41,126 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 06:43:41,146 INFO L625 ElimStorePlain]: treesize reduction 20, result has 53.5 percent of original size [2020-12-23 06:43:41,147 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 06:43:41,148 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:12 [2020-12-23 06:43:41,184 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 06:43:41,185 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 69 [2020-12-23 06:43:41,188 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 06:43:41,207 INFO L625 ElimStorePlain]: treesize reduction 20, result has 53.5 percent of original size [2020-12-23 06:43:41,209 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 06:43:41,209 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:12 [2020-12-23 06:43:41,243 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 06:43:41,244 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 69 [2020-12-23 06:43:41,247 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 06:43:41,265 INFO L625 ElimStorePlain]: treesize reduction 20, result has 53.5 percent of original size [2020-12-23 06:43:41,267 INFO L547 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 06:43:41,268 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:42, output treesize:7 [2020-12-23 06:43:41,370 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 221 trivial. 0 not checked. [2020-12-23 06:43:41,371 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 06:43:41,371 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 22 [2020-12-23 06:43:41,371 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254121400] [2020-12-23 06:43:41,371 INFO L461 AbstractCegarLoop]: Interpolant automaton has 23 states [2020-12-23 06:43:41,372 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 06:43:41,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2020-12-23 06:43:41,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=434, Unknown=0, NotChecked=0, Total=506 [2020-12-23 06:43:41,373 INFO L87 Difference]: Start difference. First operand 72 states and 87 transitions. Second operand 23 states. [2020-12-23 06:43:42,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 06:43:42,910 INFO L93 Difference]: Finished difference Result 102 states and 117 transitions. [2020-12-23 06:43:42,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2020-12-23 06:43:42,911 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 69 [2020-12-23 06:43:42,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 06:43:42,913 INFO L225 Difference]: With dead ends: 102 [2020-12-23 06:43:42,913 INFO L226 Difference]: Without dead ends: 100 [2020-12-23 06:43:42,915 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 342 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=346, Invalid=1460, Unknown=0, NotChecked=0, Total=1806 [2020-12-23 06:43:42,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2020-12-23 06:43:42,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 74. [2020-12-23 06:43:42,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2020-12-23 06:43:42,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 89 transitions. [2020-12-23 06:43:42,948 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 89 transitions. Word has length 69 [2020-12-23 06:43:42,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 06:43:42,948 INFO L481 AbstractCegarLoop]: Abstraction has 74 states and 89 transitions. [2020-12-23 06:43:42,949 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2020-12-23 06:43:42,949 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 89 transitions. [2020-12-23 06:43:42,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2020-12-23 06:43:42,950 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 06:43:42,950 INFO L422 BasicCegarLoop]: trace histogram [10, 10, 9, 5, 5, 5, 5, 5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 06:43:43,163 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2020-12-23 06:43:43,164 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 06:43:43,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 06:43:43,165 INFO L82 PathProgramCache]: Analyzing trace with hash -1470867525, now seen corresponding path program 1 times [2020-12-23 06:43:43,165 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 06:43:43,166 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555823083] [2020-12-23 06:43:43,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 06:43:43,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 06:43:43,730 INFO L134 CoverageAnalysis]: Checked inductivity of 257 backedges. 78 proven. 16 refuted. 0 times theorem prover too weak. 163 trivial. 0 not checked. [2020-12-23 06:43:43,731 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555823083] [2020-12-23 06:43:43,731 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [277942760] [2020-12-23 06:43:43,731 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 [2020-12-23 06:43:43,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 06:43:43,833 INFO L263 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 35 conjunts are in the unsatisfiable core [2020-12-23 06:43:43,836 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 06:43:43,913 INFO L348 Elim1Store]: treesize reduction 73, result has 33.0 percent of original size [2020-12-23 06:43:43,914 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 15 treesize of output 41 [2020-12-23 06:43:43,915 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 06:43:43,953 INFO L625 ElimStorePlain]: treesize reduction 10, result has 75.6 percent of original size [2020-12-23 06:43:43,956 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 2 disjuncts [2020-12-23 06:43:43,958 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 2 disjuncts [2020-12-23 06:43:43,959 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 3 disjuncts [2020-12-23 06:43:43,961 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-12-23 06:43:43,961 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:15, output treesize:31 [2020-12-23 06:43:43,964 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 2 disjuncts [2020-12-23 06:43:43,965 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 2 disjuncts [2020-12-23 06:43:43,966 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 3 disjuncts [2020-12-23 06:43:44,007 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 2 disjuncts [2020-12-23 06:43:44,008 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 2 disjuncts [2020-12-23 06:43:44,010 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 5 disjuncts [2020-12-23 06:43:44,103 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 06:43:44,104 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 26 treesize of output 96 [2020-12-23 06:43:44,107 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-23 06:43:44,108 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 06:43:44,110 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 06:43:44,111 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 06:43:44,114 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 06:43:44,193 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 06:43:44,194 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 21 treesize of output 61 [2020-12-23 06:43:44,197 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 06:43:44,198 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 06:43:44,199 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 06:43:44,203 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 06:43:44,257 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 06:43:44,258 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 21 treesize of output 61 [2020-12-23 06:43:44,260 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 06:43:44,262 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 06:43:44,263 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 06:43:44,266 INFO L547 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-12-23 06:43:44,312 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 06:43:44,312 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 21 treesize of output 61 [2020-12-23 06:43:44,316 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 06:43:44,318 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 06:43:44,321 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 06:43:44,325 INFO L547 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-12-23 06:43:44,431 WARN L197 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 22 [2020-12-23 06:43:44,432 INFO L625 ElimStorePlain]: treesize reduction 66, result has 33.3 percent of original size [2020-12-23 06:43:44,436 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2020-12-23 06:43:44,437 INFO L244 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:105, output treesize:21 [2020-12-23 06:43:44,584 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2020-12-23 06:43:44,585 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 06:43:44,601 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 06:43:44,602 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 06:43:44,602 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2020-12-23 06:43:44,705 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 06:43:44,706 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 54 [2020-12-23 06:43:44,712 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 06:43:44,740 INFO L625 ElimStorePlain]: treesize reduction 22, result has 56.0 percent of original size [2020-12-23 06:43:44,742 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. [2020-12-23 06:43:44,742 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:28 [2020-12-23 06:43:44,932 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 06:43:44,933 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 99 [2020-12-23 06:43:44,937 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 06:43:44,968 INFO L625 ElimStorePlain]: treesize reduction 36, result has 52.0 percent of original size [2020-12-23 06:43:44,971 INFO L547 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-23 06:43:44,971 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:58, output treesize:28 [2020-12-23 06:43:45,066 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 06:43:45,067 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 99 [2020-12-23 06:43:45,071 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 06:43:45,103 INFO L625 ElimStorePlain]: treesize reduction 44, result has 47.0 percent of original size [2020-12-23 06:43:45,105 INFO L547 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-23 06:43:45,106 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:58, output treesize:28 [2020-12-23 06:43:45,210 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 06:43:45,210 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 99 [2020-12-23 06:43:45,214 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 06:43:45,249 INFO L625 ElimStorePlain]: treesize reduction 30, result has 56.5 percent of original size [2020-12-23 06:43:45,251 INFO L547 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-23 06:43:45,252 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:58, output treesize:28 [2020-12-23 06:43:45,319 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 06:43:45,319 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 99 [2020-12-23 06:43:45,323 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 06:43:45,357 INFO L625 ElimStorePlain]: treesize reduction 30, result has 56.5 percent of original size [2020-12-23 06:43:45,360 INFO L547 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-23 06:43:45,360 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:58, output treesize:28 [2020-12-23 06:43:45,416 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 06:43:45,416 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 99 [2020-12-23 06:43:45,420 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 06:43:45,454 INFO L625 ElimStorePlain]: treesize reduction 38, result has 50.6 percent of original size [2020-12-23 06:43:45,457 INFO L547 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-23 06:43:45,458 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:58, output treesize:24 [2020-12-23 06:43:45,925 INFO L134 CoverageAnalysis]: Checked inductivity of 257 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 221 trivial. 0 not checked. [2020-12-23 06:43:45,925 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 06:43:45,925 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 14] total 23 [2020-12-23 06:43:45,926 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925881931] [2020-12-23 06:43:45,926 INFO L461 AbstractCegarLoop]: Interpolant automaton has 24 states [2020-12-23 06:43:45,926 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 06:43:45,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2020-12-23 06:43:45,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=489, Unknown=0, NotChecked=0, Total=552 [2020-12-23 06:43:45,928 INFO L87 Difference]: Start difference. First operand 74 states and 89 transitions. Second operand 24 states. [2020-12-23 06:43:47,866 WARN L197 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 46 [2020-12-23 06:43:48,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 06:43:48,546 INFO L93 Difference]: Finished difference Result 153 states and 182 transitions. [2020-12-23 06:43:48,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2020-12-23 06:43:48,547 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 73 [2020-12-23 06:43:48,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 06:43:48,548 INFO L225 Difference]: With dead ends: 153 [2020-12-23 06:43:48,548 INFO L226 Difference]: Without dead ends: 102 [2020-12-23 06:43:48,550 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 64 SyntacticMatches, 6 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 534 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=336, Invalid=2016, Unknown=0, NotChecked=0, Total=2352 [2020-12-23 06:43:48,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2020-12-23 06:43:48,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 81. [2020-12-23 06:43:48,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2020-12-23 06:43:48,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 96 transitions. [2020-12-23 06:43:48,563 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 96 transitions. Word has length 73 [2020-12-23 06:43:48,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 06:43:48,563 INFO L481 AbstractCegarLoop]: Abstraction has 81 states and 96 transitions. [2020-12-23 06:43:48,563 INFO L482 AbstractCegarLoop]: Interpolant automaton has 24 states. [2020-12-23 06:43:48,563 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 96 transitions. [2020-12-23 06:43:48,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2020-12-23 06:43:48,564 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 06:43:48,564 INFO L422 BasicCegarLoop]: trace histogram [10, 10, 8, 5, 5, 5, 5, 5, 5, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 06:43:48,766 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2020-12-23 06:43:48,767 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 06:43:48,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 06:43:48,768 INFO L82 PathProgramCache]: Analyzing trace with hash -1908267949, now seen corresponding path program 2 times [2020-12-23 06:43:48,768 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 06:43:48,769 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076164393] [2020-12-23 06:43:48,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 06:43:48,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 06:43:49,704 INFO L134 CoverageAnalysis]: Checked inductivity of 263 backedges. 1 proven. 41 refuted. 0 times theorem prover too weak. 221 trivial. 0 not checked. [2020-12-23 06:43:49,705 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076164393] [2020-12-23 06:43:49,705 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [578735233] [2020-12-23 06:43:49,705 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 [2020-12-23 06:43:49,819 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-12-23 06:43:49,819 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-23 06:43:49,822 INFO L263 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 37 conjunts are in the unsatisfiable core [2020-12-23 06:43:49,826 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 06:43:49,903 INFO L348 Elim1Store]: treesize reduction 73, result has 33.0 percent of original size [2020-12-23 06:43:49,904 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 15 treesize of output 41 [2020-12-23 06:43:49,911 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 06:43:49,948 INFO L625 ElimStorePlain]: treesize reduction 10, result has 75.6 percent of original size [2020-12-23 06:43:49,950 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 2 disjuncts [2020-12-23 06:43:49,952 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 2 disjuncts [2020-12-23 06:43:49,953 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 3 disjuncts [2020-12-23 06:43:49,954 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-12-23 06:43:49,955 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:15, output treesize:31 [2020-12-23 06:43:49,956 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 2 disjuncts [2020-12-23 06:43:49,957 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 2 disjuncts [2020-12-23 06:43:49,958 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 3 disjuncts [2020-12-23 06:43:50,010 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 2 disjuncts [2020-12-23 06:43:50,011 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 2 disjuncts [2020-12-23 06:43:50,012 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 5 disjuncts [2020-12-23 06:43:50,109 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 06:43:50,109 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 26 treesize of output 96 [2020-12-23 06:43:50,114 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-23 06:43:50,115 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 06:43:50,116 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 06:43:50,116 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 06:43:50,121 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 06:43:50,184 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 06:43:50,184 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 21 treesize of output 61 [2020-12-23 06:43:50,187 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 06:43:50,188 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 06:43:50,192 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 06:43:50,195 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 06:43:50,247 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 06:43:50,248 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 21 treesize of output 61 [2020-12-23 06:43:50,250 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 06:43:50,251 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 06:43:50,253 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 06:43:50,256 INFO L547 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-12-23 06:43:50,302 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 06:43:50,302 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 21 treesize of output 61 [2020-12-23 06:43:50,306 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 06:43:50,307 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 06:43:50,309 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 06:43:50,311 INFO L547 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-12-23 06:43:50,405 INFO L625 ElimStorePlain]: treesize reduction 66, result has 33.3 percent of original size [2020-12-23 06:43:50,408 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2020-12-23 06:43:50,409 INFO L244 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:105, output treesize:21 [2020-12-23 06:43:50,529 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2020-12-23 06:43:50,530 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 06:43:50,538 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 06:43:50,539 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 06:43:50,539 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2020-12-23 06:43:50,646 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 06:43:50,646 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 54 [2020-12-23 06:43:50,649 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 06:43:50,679 INFO L625 ElimStorePlain]: treesize reduction 22, result has 56.0 percent of original size [2020-12-23 06:43:50,680 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 06:43:50,681 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:32, output treesize:28 [2020-12-23 06:43:50,866 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 06:43:50,868 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 118 [2020-12-23 06:43:50,872 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 06:43:50,930 INFO L625 ElimStorePlain]: treesize reduction 60, result has 42.3 percent of original size [2020-12-23 06:43:50,933 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. [2020-12-23 06:43:50,933 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:44 [2020-12-23 06:43:51,222 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 06:43:51,222 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 62 treesize of output 143 [2020-12-23 06:43:51,229 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 06:43:51,285 INFO L625 ElimStorePlain]: treesize reduction 80, result has 40.7 percent of original size [2020-12-23 06:43:51,289 INFO L547 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-12-23 06:43:51,289 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:74, output treesize:44 [2020-12-23 06:43:51,466 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 06:43:51,467 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 62 treesize of output 143 [2020-12-23 06:43:51,473 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 06:43:51,525 INFO L625 ElimStorePlain]: treesize reduction 68, result has 44.7 percent of original size [2020-12-23 06:43:51,530 INFO L547 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-12-23 06:43:51,531 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:74, output treesize:44 [2020-12-23 06:43:51,659 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 06:43:51,659 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 62 treesize of output 143 [2020-12-23 06:43:51,664 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 06:43:51,724 INFO L625 ElimStorePlain]: treesize reduction 80, result has 40.7 percent of original size [2020-12-23 06:43:51,728 INFO L547 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-12-23 06:43:51,729 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:74, output treesize:44 [2020-12-23 06:43:51,854 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 06:43:51,855 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 62 treesize of output 143 [2020-12-23 06:43:51,860 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 06:43:51,919 INFO L625 ElimStorePlain]: treesize reduction 96, result has 36.4 percent of original size [2020-12-23 06:43:51,923 INFO L547 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-12-23 06:43:51,923 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:74, output treesize:44 [2020-12-23 06:43:52,031 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 06:43:52,031 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 62 treesize of output 143 [2020-12-23 06:43:52,036 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 06:43:52,088 INFO L625 ElimStorePlain]: treesize reduction 68, result has 44.7 percent of original size [2020-12-23 06:43:52,093 INFO L547 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-12-23 06:43:52,093 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 8 variables, input treesize:74, output treesize:40 [2020-12-23 06:43:52,766 INFO L134 CoverageAnalysis]: Checked inductivity of 263 backedges. 1 proven. 41 refuted. 0 times theorem prover too weak. 221 trivial. 0 not checked. [2020-12-23 06:43:52,767 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 06:43:52,767 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 16] total 29 [2020-12-23 06:43:52,767 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345889377] [2020-12-23 06:43:52,768 INFO L461 AbstractCegarLoop]: Interpolant automaton has 30 states [2020-12-23 06:43:52,768 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 06:43:52,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2020-12-23 06:43:52,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=783, Unknown=0, NotChecked=0, Total=870 [2020-12-23 06:43:52,770 INFO L87 Difference]: Start difference. First operand 81 states and 96 transitions. Second operand 30 states. [2020-12-23 06:43:53,916 WARN L197 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 53 [2020-12-23 06:43:54,577 WARN L197 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 57 [2020-12-23 06:43:54,764 WARN L197 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 55 [2020-12-23 06:43:55,420 WARN L197 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 57 [2020-12-23 06:43:56,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 06:43:56,669 INFO L93 Difference]: Finished difference Result 101 states and 116 transitions. [2020-12-23 06:43:56,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2020-12-23 06:43:56,670 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 77 [2020-12-23 06:43:56,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 06:43:56,672 INFO L225 Difference]: With dead ends: 101 [2020-12-23 06:43:56,672 INFO L226 Difference]: Without dead ends: 99 [2020-12-23 06:43:56,674 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 65 SyntacticMatches, 2 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 683 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=453, Invalid=2517, Unknown=0, NotChecked=0, Total=2970 [2020-12-23 06:43:56,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2020-12-23 06:43:56,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 85. [2020-12-23 06:43:56,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2020-12-23 06:43:56,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 100 transitions. [2020-12-23 06:43:56,694 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 100 transitions. Word has length 77 [2020-12-23 06:43:56,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 06:43:56,694 INFO L481 AbstractCegarLoop]: Abstraction has 85 states and 100 transitions. [2020-12-23 06:43:56,695 INFO L482 AbstractCegarLoop]: Interpolant automaton has 30 states. [2020-12-23 06:43:56,695 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 100 transitions. [2020-12-23 06:43:56,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2020-12-23 06:43:56,696 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 06:43:56,696 INFO L422 BasicCegarLoop]: trace histogram [10, 10, 8, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 06:43:56,911 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2020-12-23 06:43:56,912 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 06:43:56,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 06:43:56,913 INFO L82 PathProgramCache]: Analyzing trace with hash -1507902871, now seen corresponding path program 3 times [2020-12-23 06:43:56,913 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 06:43:56,914 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850451682] [2020-12-23 06:43:56,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 06:43:56,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 06:43:57,943 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 121 proven. 47 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2020-12-23 06:43:57,943 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850451682] [2020-12-23 06:43:57,943 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [961092783] [2020-12-23 06:43:57,944 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 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 [2020-12-23 06:43:58,132 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2020-12-23 06:43:58,133 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-23 06:43:58,136 INFO L263 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 29 conjunts are in the unsatisfiable core [2020-12-23 06:43:58,138 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 06:43:58,228 INFO L348 Elim1Store]: treesize reduction 73, result has 33.0 percent of original size [2020-12-23 06:43:58,229 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 15 treesize of output 41 [2020-12-23 06:43:58,231 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 06:43:58,295 INFO L625 ElimStorePlain]: treesize reduction 10, result has 83.9 percent of original size [2020-12-23 06:43:58,297 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 2 disjuncts [2020-12-23 06:43:58,298 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 2 disjuncts [2020-12-23 06:43:58,299 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 3 disjuncts [2020-12-23 06:43:58,300 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-12-23 06:43:58,300 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:52 [2020-12-23 06:43:58,302 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 2 disjuncts [2020-12-23 06:43:58,303 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 2 disjuncts [2020-12-23 06:43:58,304 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 3 disjuncts [2020-12-23 06:43:58,365 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 2 disjuncts [2020-12-23 06:43:58,367 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 2 disjuncts [2020-12-23 06:43:58,368 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 5 disjuncts [2020-12-23 06:43:58,437 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 06:43:58,438 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 21 treesize of output 61 [2020-12-23 06:43:58,440 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 06:43:58,441 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 06:43:58,442 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 06:43:58,445 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 06:43:58,502 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 06:43:58,502 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 21 treesize of output 61 [2020-12-23 06:43:58,505 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 06:43:58,506 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 06:43:58,507 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 06:43:58,509 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 06:43:58,612 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 06:43:58,612 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 26 treesize of output 96 [2020-12-23 06:43:58,624 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-23 06:43:58,625 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 06:43:58,627 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 06:43:58,628 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 06:43:58,632 INFO L547 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-12-23 06:43:58,681 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 06:43:58,681 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 21 treesize of output 61 [2020-12-23 06:43:58,684 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 06:43:58,685 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 06:43:58,687 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 06:43:58,689 INFO L547 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-12-23 06:43:58,824 WARN L197 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 33 [2020-12-23 06:43:58,825 INFO L625 ElimStorePlain]: treesize reduction 108, result has 41.0 percent of original size [2020-12-23 06:43:58,829 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2020-12-23 06:43:58,829 INFO L244 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:189, output treesize:63 [2020-12-23 06:43:58,916 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 06:43:58,918 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 36 [2020-12-23 06:43:58,921 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 06:43:58,937 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 06:43:58,939 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. [2020-12-23 06:43:58,939 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:44, output treesize:40 [2020-12-23 06:43:59,030 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 06:43:59,049 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 06:43:59,050 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 86 [2020-12-23 06:43:59,054 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 06:43:59,108 INFO L625 ElimStorePlain]: treesize reduction 28, result has 64.6 percent of original size [2020-12-23 06:43:59,109 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. [2020-12-23 06:43:59,110 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:51 [2020-12-23 06:43:59,209 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 06:43:59,230 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 06:43:59,231 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 86 [2020-12-23 06:43:59,234 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 06:43:59,284 INFO L625 ElimStorePlain]: treesize reduction 28, result has 64.6 percent of original size [2020-12-23 06:43:59,286 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. [2020-12-23 06:43:59,287 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:51 [2020-12-23 06:43:59,365 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 06:43:59,383 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 06:43:59,383 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 86 [2020-12-23 06:43:59,388 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 06:43:59,439 INFO L625 ElimStorePlain]: treesize reduction 28, result has 64.6 percent of original size [2020-12-23 06:43:59,441 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. [2020-12-23 06:43:59,441 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:51 [2020-12-23 06:43:59,537 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 06:43:59,557 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 06:43:59,558 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 72 [2020-12-23 06:43:59,561 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 06:43:59,610 INFO L625 ElimStorePlain]: treesize reduction 26, result has 62.9 percent of original size [2020-12-23 06:43:59,612 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2020-12-23 06:43:59,613 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:44 [2020-12-23 06:44:00,131 WARN L197 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2020-12-23 06:44:00,393 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 06:44:00,394 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 62 treesize of output 54 [2020-12-23 06:44:00,397 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 06:44:00,399 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 06:44:00,400 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 06:44:00,401 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 06:44:00,402 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 06:44:00,405 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 06:44:00,435 INFO L625 ElimStorePlain]: treesize reduction 46, result has 19.3 percent of original size [2020-12-23 06:44:00,437 INFO L547 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 06:44:00,437 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:66, output treesize:7 [2020-12-23 06:44:00,542 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 60 proven. 11 refuted. 0 times theorem prover too weak. 202 trivial. 0 not checked. [2020-12-23 06:44:00,543 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 06:44:00,543 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 11] total 28 [2020-12-23 06:44:00,543 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718145294] [2020-12-23 06:44:00,544 INFO L461 AbstractCegarLoop]: Interpolant automaton has 28 states [2020-12-23 06:44:00,544 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 06:44:00,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2020-12-23 06:44:00,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=670, Unknown=0, NotChecked=0, Total=756 [2020-12-23 06:44:00,546 INFO L87 Difference]: Start difference. First operand 85 states and 100 transitions. Second operand 28 states. [2020-12-23 06:44:05,352 WARN L197 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 60 [2020-12-23 06:44:05,614 WARN L197 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 57 [2020-12-23 06:44:05,862 WARN L197 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 55 [2020-12-23 06:44:06,040 WARN L197 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 59 [2020-12-23 06:44:06,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 06:44:06,426 INFO L93 Difference]: Finished difference Result 144 states and 171 transitions. [2020-12-23 06:44:06,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-12-23 06:44:06,428 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 81 [2020-12-23 06:44:06,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 06:44:06,428 INFO L225 Difference]: With dead ends: 144 [2020-12-23 06:44:06,429 INFO L226 Difference]: Without dead ends: 82 [2020-12-23 06:44:06,432 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 69 SyntacticMatches, 4 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 350 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=179, Invalid=1081, Unknown=0, NotChecked=0, Total=1260 [2020-12-23 06:44:06,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2020-12-23 06:44:06,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2020-12-23 06:44:06,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2020-12-23 06:44:06,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 96 transitions. [2020-12-23 06:44:06,456 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 96 transitions. Word has length 81 [2020-12-23 06:44:06,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 06:44:06,457 INFO L481 AbstractCegarLoop]: Abstraction has 82 states and 96 transitions. [2020-12-23 06:44:06,457 INFO L482 AbstractCegarLoop]: Interpolant automaton has 28 states. [2020-12-23 06:44:06,457 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 96 transitions. [2020-12-23 06:44:06,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2020-12-23 06:44:06,458 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 06:44:06,458 INFO L422 BasicCegarLoop]: trace histogram [10, 10, 8, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 06:44:06,672 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 06:44:06,673 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 06:44:06,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 06:44:06,674 INFO L82 PathProgramCache]: Analyzing trace with hash -1389330395, now seen corresponding path program 4 times [2020-12-23 06:44:06,675 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 06:44:06,675 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317838849] [2020-12-23 06:44:06,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 06:44:06,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 06:44:08,278 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 115 proven. 92 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2020-12-23 06:44:08,279 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317838849] [2020-12-23 06:44:08,279 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1689200360] [2020-12-23 06:44:08,279 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 06:44:08,400 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-12-23 06:44:08,400 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-23 06:44:08,403 INFO L263 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 43 conjunts are in the unsatisfiable core [2020-12-23 06:44:08,406 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 06:44:09,332 INFO L348 Elim1Store]: treesize reduction 327, result has 9.9 percent of original size [2020-12-23 06:44:09,333 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 85 treesize of output 57 [2020-12-23 06:44:09,335 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 06:44:09,351 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 06:44:09,352 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 06:44:09,353 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:88, output treesize:46 [2020-12-23 06:44:09,795 INFO L348 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2020-12-23 06:44:09,796 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 49 treesize of output 13 [2020-12-23 06:44:09,798 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 06:44:09,801 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 06:44:09,802 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 06:44:09,802 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:49, output treesize:5 [2020-12-23 06:44:09,914 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 90 proven. 123 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2020-12-23 06:44:09,914 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 06:44:09,914 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 21] total 40 [2020-12-23 06:44:09,915 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88673462] [2020-12-23 06:44:09,915 INFO L461 AbstractCegarLoop]: Interpolant automaton has 40 states [2020-12-23 06:44:09,915 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 06:44:09,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2020-12-23 06:44:09,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=1424, Unknown=0, NotChecked=0, Total=1560 [2020-12-23 06:44:09,917 INFO L87 Difference]: Start difference. First operand 82 states and 96 transitions. Second operand 40 states. [2020-12-23 06:44:14,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 06:44:14,853 INFO L93 Difference]: Finished difference Result 194 states and 236 transitions. [2020-12-23 06:44:14,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2020-12-23 06:44:14,855 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 81 [2020-12-23 06:44:14,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 06:44:14,856 INFO L225 Difference]: With dead ends: 194 [2020-12-23 06:44:14,856 INFO L226 Difference]: Without dead ends: 148 [2020-12-23 06:44:14,859 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 67 SyntacticMatches, 6 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1239 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=401, Invalid=4155, Unknown=0, NotChecked=0, Total=4556 [2020-12-23 06:44:14,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2020-12-23 06:44:14,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 130. [2020-12-23 06:44:14,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2020-12-23 06:44:14,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 157 transitions. [2020-12-23 06:44:14,893 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 157 transitions. Word has length 81 [2020-12-23 06:44:14,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 06:44:14,893 INFO L481 AbstractCegarLoop]: Abstraction has 130 states and 157 transitions. [2020-12-23 06:44:14,893 INFO L482 AbstractCegarLoop]: Interpolant automaton has 40 states. [2020-12-23 06:44:14,894 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 157 transitions. [2020-12-23 06:44:14,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2020-12-23 06:44:14,895 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 06:44:14,895 INFO L422 BasicCegarLoop]: trace histogram [10, 10, 6, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 06:44:15,104 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2020-12-23 06:44:15,105 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 06:44:15,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 06:44:15,106 INFO L82 PathProgramCache]: Analyzing trace with hash 144575521, now seen corresponding path program 5 times [2020-12-23 06:44:15,107 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 06:44:15,107 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328242214] [2020-12-23 06:44:15,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 06:44:15,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 06:44:15,645 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 78 proven. 7 refuted. 0 times theorem prover too weak. 188 trivial. 0 not checked. [2020-12-23 06:44:15,646 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328242214] [2020-12-23 06:44:15,646 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [459679155] [2020-12-23 06:44:15,646 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 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 [2020-12-23 06:44:15,732 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2020-12-23 06:44:15,732 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-23 06:44:15,734 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 33 conjunts are in the unsatisfiable core [2020-12-23 06:44:15,736 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 06:44:16,754 WARN L197 SmtUtils]: Spent 254.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 57 [2020-12-23 06:44:16,755 INFO L348 Elim1Store]: treesize reduction 239, result has 46.3 percent of original size [2020-12-23 06:44:16,755 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 71 treesize of output 223 [2020-12-23 06:44:16,759 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-23 06:44:16,761 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 06:44:16,762 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-12-23 06:44:16,765 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 06:44:16,766 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 06:44:16,767 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2020-12-23 06:44:16,767 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 06:44:16,771 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-12-23 06:44:16,771 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 06:44:16,773 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 06:44:16,774 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-12-23 06:44:16,774 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-12-23 06:44:16,779 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-12-23 06:44:16,781 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 2 disjuncts [2020-12-23 06:44:16,782 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 06:44:16,785 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 06:44:16,787 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 06:44:16,789 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 06:44:16,804 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 2 disjuncts [2020-12-23 06:44:16,805 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 06:44:16,808 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 06:44:16,809 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 06:44:16,811 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 06:44:16,813 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 06:44:16,823 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 06:44:17,381 WARN L197 SmtUtils]: Spent 556.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 63 [2020-12-23 06:44:17,382 INFO L625 ElimStorePlain]: treesize reduction 525, result has 34.5 percent of original size [2020-12-23 06:44:17,387 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-12-23 06:44:17,388 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 06:44:17,389 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-12-23 06:44:17,392 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2020-12-23 06:44:17,394 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 06:44:17,396 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 06:44:17,398 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-23 06:44:17,400 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-12-23 06:44:17,402 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2020-12-23 06:44:17,407 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-12-23 06:44:17,408 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:79, output treesize:266 [2020-12-23 06:44:17,411 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-12-23 06:44:17,412 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 06:44:17,414 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-12-23 06:44:17,415 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2020-12-23 06:44:17,417 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 06:44:17,419 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 06:44:17,419 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-23 06:44:17,421 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-12-23 06:44:17,423 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2020-12-23 06:44:17,639 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-12-23 06:44:17,640 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-12-23 06:44:17,641 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 06:44:17,642 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 06:44:17,643 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-12-23 06:44:17,644 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 06:44:17,645 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-12-23 06:44:17,647 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-12-23 06:44:17,648 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 06:44:17,648 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-12-23 06:44:17,650 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2020-12-23 06:44:17,651 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 06:44:17,654 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-12-23 06:44:17,656 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2020-12-23 06:44:17,662 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 06:44:17,663 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-23 06:44:17,665 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2020-12-23 06:44:17,667 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-12-23 06:44:17,670 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-12-23 06:44:17,674 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-12-23 06:44:17,677 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2020-12-23 06:44:17,682 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 06:44:17,684 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-23 06:44:17,689 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 06:44:17,690 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 06:44:17,692 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 06:44:17,693 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-23 06:44:17,694 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-23 06:44:17,696 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 06:44:17,698 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-23 06:44:17,699 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-23 06:44:17,715 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-12-23 06:44:17,716 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 06:44:17,717 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-12-23 06:44:17,720 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2020-12-23 06:44:17,721 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 06:44:17,724 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-12-23 06:44:17,726 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2020-12-23 06:44:17,731 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 06:44:17,733 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-23 06:44:18,147 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 06:44:22,642 INFO L348 Elim1Store]: treesize reduction 35, result has 67.0 percent of original size [2020-12-23 06:44:22,643 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 45 treesize of output 80 [2020-12-23 06:44:22,646 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 06:44:22,647 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 06:44:22,648 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 06:44:22,649 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 06:44:22,649 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 06:44:22,651 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 06:44:22,653 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-12-23 06:44:22,654 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 06:44:22,654 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 06:44:22,658 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 06:44:22,659 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 06:44:22,667 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 06:44:22,668 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 06:44:22,671 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-12-23 06:44:22,671 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 06:44:22,672 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 06:44:22,674 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-12-23 06:44:22,679 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-12-23 06:44:22,700 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 06:44:22,702 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 06:44:22,704 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 06:44:22,705 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:56, output treesize:18 [2020-12-23 06:44:23,221 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 143 proven. 47 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2020-12-23 06:44:23,221 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 06:44:23,221 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 22] total 31 [2020-12-23 06:44:23,222 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195220838] [2020-12-23 06:44:23,222 INFO L461 AbstractCegarLoop]: Interpolant automaton has 31 states [2020-12-23 06:44:23,222 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 06:44:23,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2020-12-23 06:44:23,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=846, Unknown=2, NotChecked=0, Total=930 [2020-12-23 06:44:23,224 INFO L87 Difference]: Start difference. First operand 130 states and 157 transitions. Second operand 31 states. [2020-12-23 06:44:24,911 WARN L197 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 45 [2020-12-23 06:44:28,816 WARN L197 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 56 [2020-12-23 06:44:32,466 WARN L197 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 67 [2020-12-23 06:44:32,727 WARN L197 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 54 [2020-12-23 06:44:38,284 WARN L197 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 29 DAG size of output: 28 [2020-12-23 06:44:39,139 WARN L197 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 48 [2020-12-23 06:44:41,605 WARN L197 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 60 [2020-12-23 06:44:42,485 WARN L197 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 55 [2020-12-23 06:44:42,782 WARN L197 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 47 [2020-12-23 06:44:43,304 WARN L197 SmtUtils]: Spent 207.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2020-12-23 06:44:43,694 WARN L197 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 41 [2020-12-23 06:44:44,208 WARN L197 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 51 [2020-12-23 06:44:44,680 WARN L197 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 41 [2020-12-23 06:44:47,974 WARN L197 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 45 [2020-12-23 06:44:53,297 WARN L197 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 50 [2020-12-23 06:44:53,778 WARN L197 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 90 [2020-12-23 06:44:54,642 WARN L197 SmtUtils]: Spent 629.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 63 [2020-12-23 06:44:55,168 WARN L197 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 98 [2020-12-23 06:44:59,956 WARN L197 SmtUtils]: Spent 2.21 s on a formula simplification. DAG size of input: 108 DAG size of output: 55 [2020-12-23 06:45:00,420 WARN L197 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 96 [2020-12-23 06:45:01,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 06:45:01,091 INFO L93 Difference]: Finished difference Result 348 states and 440 transitions. [2020-12-23 06:45:01,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2020-12-23 06:45:01,092 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 81 [2020-12-23 06:45:01,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 06:45:01,095 INFO L225 Difference]: With dead ends: 348 [2020-12-23 06:45:01,095 INFO L226 Difference]: Without dead ends: 243 [2020-12-23 06:45:01,098 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 72 SyntacticMatches, 5 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2242 ImplicationChecksByTransitivity, 32.1s TimeCoverageRelationStatistics Valid=992, Invalid=7558, Unknown=6, NotChecked=0, Total=8556 [2020-12-23 06:45:01,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2020-12-23 06:45:01,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 185. [2020-12-23 06:45:01,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2020-12-23 06:45:01,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 235 transitions. [2020-12-23 06:45:01,134 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 235 transitions. Word has length 81 [2020-12-23 06:45:01,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 06:45:01,134 INFO L481 AbstractCegarLoop]: Abstraction has 185 states and 235 transitions. [2020-12-23 06:45:01,134 INFO L482 AbstractCegarLoop]: Interpolant automaton has 31 states. [2020-12-23 06:45:01,134 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 235 transitions. [2020-12-23 06:45:01,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2020-12-23 06:45:01,135 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 06:45:01,135 INFO L422 BasicCegarLoop]: trace histogram [10, 10, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 06:45:01,348 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,17 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 06:45:01,349 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 06:45:01,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 06:45:01,350 INFO L82 PathProgramCache]: Analyzing trace with hash 705275299, now seen corresponding path program 6 times [2020-12-23 06:45:01,350 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 06:45:01,350 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005244616] [2020-12-23 06:45:01,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 06:45:01,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 06:45:02,241 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 121 proven. 30 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2020-12-23 06:45:02,242 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005244616] [2020-12-23 06:45:02,242 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1239532080] [2020-12-23 06:45:02,242 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 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 06:45:02,479 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2020-12-23 06:45:02,479 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-23 06:45:02,481 INFO L263 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 41 conjunts are in the unsatisfiable core [2020-12-23 06:45:02,484 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 06:45:02,602 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 06:45:02,603 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 30 treesize of output 59 [2020-12-23 06:45:02,605 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 06:45:02,628 INFO L625 ElimStorePlain]: treesize reduction 20, result has 47.4 percent of original size [2020-12-23 06:45:02,629 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 06:45:02,630 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:7 [2020-12-23 06:45:03,041 INFO L348 Elim1Store]: treesize reduction 120, result has 13.7 percent of original size [2020-12-23 06:45:03,041 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 49 treesize of output 34 [2020-12-23 06:45:03,043 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 06:45:03,052 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 06:45:03,053 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 06:45:03,053 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:52, output treesize:19 [2020-12-23 06:45:03,248 INFO L348 Elim1Store]: treesize reduction 12, result has 85.9 percent of original size [2020-12-23 06:45:03,248 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 38 treesize of output 82 [2020-12-23 06:45:03,250 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 06:45:03,251 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 06:45:03,252 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 06:45:03,253 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 06:45:03,254 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 06:45:03,254 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 06:45:03,260 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 06:45:03,262 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 06:45:03,263 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 06:45:03,263 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 06:45:03,264 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 06:45:03,265 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 06:45:03,266 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 06:45:03,268 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 06:45:03,268 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 06:45:03,268 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 06:45:03,270 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 06:45:03,270 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 06:45:03,272 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 06:45:03,273 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 06:45:03,274 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 06:45:03,276 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 06:45:03,278 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-12-23 06:45:03,279 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 06:45:03,280 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 06:45:03,282 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 06:45:03,282 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 06:45:03,283 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 06:45:03,285 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-12-23 06:45:03,290 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 3 xjuncts. [2020-12-23 06:45:03,444 WARN L197 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 29 [2020-12-23 06:45:03,445 INFO L625 ElimStorePlain]: treesize reduction 83, result has 42.8 percent of original size [2020-12-23 06:45:03,447 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 06:45:03,448 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:44, output treesize:62 [2020-12-23 06:45:03,650 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 06:45:03,797 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 06:45:03,797 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 06:45:04,154 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 0 proven. 206 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2020-12-23 06:45:04,154 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 06:45:04,154 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 20] total 31 [2020-12-23 06:45:04,154 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352726886] [2020-12-23 06:45:04,155 INFO L461 AbstractCegarLoop]: Interpolant automaton has 32 states [2020-12-23 06:45:04,155 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 06:45:04,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2020-12-23 06:45:04,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=831, Unknown=0, NotChecked=0, Total=992 [2020-12-23 06:45:04,156 INFO L87 Difference]: Start difference. First operand 185 states and 235 transitions. Second operand 32 states. [2020-12-23 06:45:07,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 06:45:07,006 INFO L93 Difference]: Finished difference Result 422 states and 549 transitions. [2020-12-23 06:45:07,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2020-12-23 06:45:07,008 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 81 [2020-12-23 06:45:07,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 06:45:07,010 INFO L225 Difference]: With dead ends: 422 [2020-12-23 06:45:07,010 INFO L226 Difference]: Without dead ends: 296 [2020-12-23 06:45:07,012 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 73 SyntacticMatches, 8 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 859 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=625, Invalid=2345, Unknown=0, NotChecked=0, Total=2970 [2020-12-23 06:45:07,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2020-12-23 06:45:07,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 220. [2020-12-23 06:45:07,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2020-12-23 06:45:07,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 287 transitions. [2020-12-23 06:45:07,062 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 287 transitions. Word has length 81 [2020-12-23 06:45:07,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 06:45:07,062 INFO L481 AbstractCegarLoop]: Abstraction has 220 states and 287 transitions. [2020-12-23 06:45:07,062 INFO L482 AbstractCegarLoop]: Interpolant automaton has 32 states. [2020-12-23 06:45:07,063 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 287 transitions. [2020-12-23 06:45:07,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2020-12-23 06:45:07,063 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 06:45:07,064 INFO L422 BasicCegarLoop]: trace histogram [10, 10, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 06:45:07,277 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,18 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 06:45:07,278 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 06:45:07,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 06:45:07,279 INFO L82 PathProgramCache]: Analyzing trace with hash -1238516121, now seen corresponding path program 7 times [2020-12-23 06:45:07,279 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 06:45:07,279 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221572385] [2020-12-23 06:45:07,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 06:45:07,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 06:45:08,112 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 94 proven. 15 refuted. 0 times theorem prover too weak. 164 trivial. 0 not checked. [2020-12-23 06:45:08,112 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221572385] [2020-12-23 06:45:08,112 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [968425745] [2020-12-23 06:45:08,113 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 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 06:45:08,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 06:45:08,204 INFO L263 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 54 conjunts are in the unsatisfiable core [2020-12-23 06:45:08,207 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 06:45:08,301 INFO L348 Elim1Store]: treesize reduction 73, result has 33.0 percent of original size [2020-12-23 06:45:08,302 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 15 treesize of output 41 [2020-12-23 06:45:08,304 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 06:45:08,355 INFO L625 ElimStorePlain]: treesize reduction 10, result has 77.3 percent of original size [2020-12-23 06:45:08,357 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 2 disjuncts [2020-12-23 06:45:08,358 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 2 disjuncts [2020-12-23 06:45:08,358 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 3 disjuncts [2020-12-23 06:45:08,359 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-12-23 06:45:08,359 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:34 [2020-12-23 06:45:08,360 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 2 disjuncts [2020-12-23 06:45:08,361 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 2 disjuncts [2020-12-23 06:45:08,361 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 3 disjuncts [2020-12-23 06:45:08,411 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 2 disjuncts [2020-12-23 06:45:08,412 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 2 disjuncts [2020-12-23 06:45:08,413 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 5 disjuncts [2020-12-23 06:45:08,489 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 06:45:08,489 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 21 treesize of output 61 [2020-12-23 06:45:08,492 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 06:45:08,494 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 06:45:08,495 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 06:45:08,498 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 06:45:08,568 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 06:45:08,568 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 21 treesize of output 61 [2020-12-23 06:45:08,571 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 06:45:08,572 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 06:45:08,573 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 06:45:08,575 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 06:45:08,685 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 06:45:08,685 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 26 treesize of output 96 [2020-12-23 06:45:08,688 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-23 06:45:08,689 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 06:45:08,691 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 06:45:08,691 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 06:45:08,693 INFO L547 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-12-23 06:45:08,756 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 06:45:08,756 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 21 treesize of output 61 [2020-12-23 06:45:08,758 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 06:45:08,760 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 06:45:08,760 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 06:45:08,764 INFO L547 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-12-23 06:45:08,877 WARN L197 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 25 [2020-12-23 06:45:08,878 INFO L625 ElimStorePlain]: treesize reduction 59, result has 43.3 percent of original size [2020-12-23 06:45:08,882 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2020-12-23 06:45:08,882 INFO L244 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:129, output treesize:33 [2020-12-23 06:45:09,006 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2020-12-23 06:45:09,007 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 06:45:09,023 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 06:45:09,024 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 06:45:09,024 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:25 [2020-12-23 06:45:09,154 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 06:45:09,155 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2020-12-23 06:45:09,156 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 06:45:09,176 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 06:45:09,178 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 06:45:09,178 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:38, output treesize:34 [2020-12-23 06:45:09,315 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 06:45:09,317 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 06:45:09,318 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 06:45:09,320 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 36 [2020-12-23 06:45:09,322 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 06:45:09,344 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 06:45:09,345 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 06:45:09,345 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:47, output treesize:43 [2020-12-23 06:45:09,502 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 06:45:09,504 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 06:45:09,505 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 06:45:09,506 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 06:45:09,507 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 06:45:09,508 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 06:45:09,510 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2020-12-23 06:45:09,511 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 06:45:09,533 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 06:45:09,535 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 06:45:09,535 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:49, output treesize:45 [2020-12-23 06:45:09,754 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 06:45:09,755 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 06:45:09,757 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 06:45:09,758 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 06:45:09,759 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 06:45:09,761 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 06:45:09,782 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 06:45:09,783 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 105 [2020-12-23 06:45:09,787 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 06:45:09,853 INFO L625 ElimStorePlain]: treesize reduction 20, result has 74.7 percent of original size [2020-12-23 06:45:09,855 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 06:45:09,855 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:78, output treesize:48 [2020-12-23 06:45:10,078 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 06:45:10,080 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 06:45:10,081 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 06:45:10,083 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 06:45:10,084 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 06:45:10,086 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 06:45:10,108 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 06:45:10,108 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 97 [2020-12-23 06:45:10,111 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 06:45:10,169 INFO L625 ElimStorePlain]: treesize reduction 16, result has 77.8 percent of original size [2020-12-23 06:45:10,171 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 06:45:10,171 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:73, output treesize:45 [2020-12-23 06:45:10,205 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 06:45:10,207 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 06:45:10,208 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 06:45:10,210 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 06:45:10,212 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 06:45:10,213 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 06:45:10,237 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 06:45:10,237 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 105 [2020-12-23 06:45:10,241 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 06:45:10,300 INFO L625 ElimStorePlain]: treesize reduction 20, result has 73.7 percent of original size [2020-12-23 06:45:10,311 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 06:45:10,312 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:75, output treesize:45 [2020-12-23 06:45:10,336 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 06:45:10,338 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 06:45:10,340 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 06:45:10,341 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 06:45:10,343 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 06:45:10,344 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 06:45:10,367 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 06:45:10,367 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 105 [2020-12-23 06:45:10,371 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 06:45:10,432 INFO L625 ElimStorePlain]: treesize reduction 20, result has 73.7 percent of original size [2020-12-23 06:45:10,434 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 06:45:10,435 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:75, output treesize:45 [2020-12-23 06:45:10,456 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 06:45:10,457 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 06:45:10,459 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 06:45:10,460 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 06:45:10,462 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 06:45:10,463 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 06:45:10,487 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 06:45:10,488 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 91 [2020-12-23 06:45:10,492 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 06:45:10,542 INFO L625 ElimStorePlain]: treesize reduction 18, result has 73.9 percent of original size [2020-12-23 06:45:10,544 INFO L547 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 06:45:10,545 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:66, output treesize:38 [2020-12-23 06:45:11,229 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 0 proven. 216 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2020-12-23 06:45:11,229 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 06:45:11,230 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 21] total 31 [2020-12-23 06:45:11,230 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431493323] [2020-12-23 06:45:11,230 INFO L461 AbstractCegarLoop]: Interpolant automaton has 32 states [2020-12-23 06:45:11,230 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 06:45:11,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2020-12-23 06:45:11,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=907, Unknown=0, NotChecked=0, Total=992 [2020-12-23 06:45:11,232 INFO L87 Difference]: Start difference. First operand 220 states and 287 transitions. Second operand 32 states. [2020-12-23 06:45:12,772 WARN L197 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 65 [2020-12-23 06:45:13,007 WARN L197 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 65 [2020-12-23 06:45:13,214 WARN L197 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 67 [2020-12-23 06:45:13,447 WARN L197 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 63 [2020-12-23 06:45:13,673 WARN L197 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 63 [2020-12-23 06:45:13,881 WARN L197 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 67 [2020-12-23 06:45:14,882 WARN L197 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 50 [2020-12-23 06:45:15,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 06:45:15,807 INFO L93 Difference]: Finished difference Result 430 states and 565 transitions. [2020-12-23 06:45:15,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2020-12-23 06:45:15,808 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 81 [2020-12-23 06:45:15,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 06:45:15,809 INFO L225 Difference]: With dead ends: 430 [2020-12-23 06:45:15,809 INFO L226 Difference]: Without dead ends: 235 [2020-12-23 06:45:15,811 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 67 SyntacticMatches, 5 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 794 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=376, Invalid=3284, Unknown=0, NotChecked=0, Total=3660 [2020-12-23 06:45:15,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2020-12-23 06:45:15,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 225. [2020-12-23 06:45:15,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2020-12-23 06:45:15,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 292 transitions. [2020-12-23 06:45:15,855 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 292 transitions. Word has length 81 [2020-12-23 06:45:15,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 06:45:15,855 INFO L481 AbstractCegarLoop]: Abstraction has 225 states and 292 transitions. [2020-12-23 06:45:15,855 INFO L482 AbstractCegarLoop]: Interpolant automaton has 32 states. [2020-12-23 06:45:15,856 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 292 transitions. [2020-12-23 06:45:15,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2020-12-23 06:45:15,856 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 06:45:15,857 INFO L422 BasicCegarLoop]: trace histogram [10, 10, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 06:45:16,059 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2020-12-23 06:45:16,060 INFO L429 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 06:45:16,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 06:45:16,061 INFO L82 PathProgramCache]: Analyzing trace with hash 1741635899, now seen corresponding path program 8 times [2020-12-23 06:45:16,061 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 06:45:16,061 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30146387] [2020-12-23 06:45:16,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 06:45:16,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 06:45:16,566 WARN L197 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 26 [2020-12-23 06:45:18,215 INFO L134 CoverageAnalysis]: Checked inductivity of 287 backedges. 90 proven. 119 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2020-12-23 06:45:18,215 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30146387] [2020-12-23 06:45:18,215 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [785092781] [2020-12-23 06:45:18,215 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 06:45:18,317 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-12-23 06:45:18,318 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-23 06:45:18,319 INFO L263 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 41 conjunts are in the unsatisfiable core [2020-12-23 06:45:18,323 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 06:45:18,426 INFO L348 Elim1Store]: treesize reduction 73, result has 33.0 percent of original size [2020-12-23 06:45:18,427 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 15 treesize of output 41 [2020-12-23 06:45:18,428 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 06:45:18,477 INFO L625 ElimStorePlain]: treesize reduction 10, result has 75.6 percent of original size [2020-12-23 06:45:18,479 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 2 disjuncts [2020-12-23 06:45:18,480 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 2 disjuncts [2020-12-23 06:45:18,480 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 3 disjuncts [2020-12-23 06:45:18,481 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-12-23 06:45:18,481 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:15, output treesize:31 [2020-12-23 06:45:18,482 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 2 disjuncts [2020-12-23 06:45:18,483 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 2 disjuncts [2020-12-23 06:45:18,483 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 3 disjuncts [2020-12-23 06:45:18,552 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 2 disjuncts [2020-12-23 06:45:18,553 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 2 disjuncts [2020-12-23 06:45:18,554 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 5 disjuncts [2020-12-23 06:45:18,679 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 06:45:18,680 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 26 treesize of output 96 [2020-12-23 06:45:18,682 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-23 06:45:18,683 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 06:45:18,683 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 06:45:18,684 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 06:45:18,687 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 06:45:18,758 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 06:45:18,759 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 21 treesize of output 61 [2020-12-23 06:45:18,762 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 06:45:18,762 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 06:45:18,765 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 06:45:18,768 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 06:45:18,838 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 06:45:18,838 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 21 treesize of output 61 [2020-12-23 06:45:18,840 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 06:45:18,841 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 06:45:18,842 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 06:45:18,845 INFO L547 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-12-23 06:45:18,907 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 06:45:18,908 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 21 treesize of output 61 [2020-12-23 06:45:18,910 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 06:45:18,911 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 06:45:18,912 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 06:45:18,915 INFO L547 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-12-23 06:45:19,074 WARN L197 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 22 [2020-12-23 06:45:19,075 INFO L625 ElimStorePlain]: treesize reduction 62, result has 34.7 percent of original size [2020-12-23 06:45:19,078 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2020-12-23 06:45:19,078 INFO L244 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:105, output treesize:21 [2020-12-23 06:45:19,155 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2020-12-23 06:45:19,157 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 06:45:19,167 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 06:45:19,168 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 06:45:19,168 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2020-12-23 06:45:19,324 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 06:45:19,324 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 54 [2020-12-23 06:45:19,326 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 06:45:19,362 INFO L625 ElimStorePlain]: treesize reduction 22, result has 56.0 percent of original size [2020-12-23 06:45:19,363 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 06:45:19,363 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:32, output treesize:28 [2020-12-23 06:45:19,607 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 06:45:19,608 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 118 [2020-12-23 06:45:19,611 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 06:45:19,670 INFO L625 ElimStorePlain]: treesize reduction 60, result has 42.3 percent of original size [2020-12-23 06:45:19,672 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. [2020-12-23 06:45:19,672 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:44 [2020-12-23 06:45:19,993 WARN L197 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2020-12-23 06:45:19,994 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 06:45:19,995 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 47 treesize of output 198 [2020-12-23 06:45:19,999 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 06:45:20,100 WARN L197 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 35 [2020-12-23 06:45:20,101 INFO L625 ElimStorePlain]: treesize reduction 110, result has 35.3 percent of original size [2020-12-23 06:45:20,103 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. [2020-12-23 06:45:20,104 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:64, output treesize:60 [2020-12-23 06:45:20,543 WARN L197 SmtUtils]: Spent 180.00 ms on a formula simplification that was a NOOP. DAG size: 76 [2020-12-23 06:45:20,544 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 06:45:20,544 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 58 treesize of output 294 [2020-12-23 06:45:20,549 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 06:45:20,695 WARN L197 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 42 [2020-12-23 06:45:20,696 INFO L625 ElimStorePlain]: treesize reduction 172, result has 30.6 percent of original size [2020-12-23 06:45:20,702 INFO L547 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2020-12-23 06:45:20,702 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:80, output treesize:76 [2020-12-23 06:45:21,201 WARN L197 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2020-12-23 06:45:21,202 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 06:45:21,202 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 11 case distinctions, treesize of input 84 treesize of output 279 [2020-12-23 06:45:21,213 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 06:45:21,324 WARN L197 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 50 [2020-12-23 06:45:21,325 INFO L625 ElimStorePlain]: treesize reduction 196, result has 30.7 percent of original size [2020-12-23 06:45:21,330 INFO L547 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2020-12-23 06:45:21,330 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 8 variables, input treesize:106, output treesize:76 [2020-12-23 06:45:21,637 WARN L197 SmtUtils]: Spent 154.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2020-12-23 06:45:21,638 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 06:45:21,638 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 11 case distinctions, treesize of input 84 treesize of output 279 [2020-12-23 06:45:21,647 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 06:45:21,782 WARN L197 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 50 [2020-12-23 06:45:21,783 INFO L625 ElimStorePlain]: treesize reduction 228, result has 27.6 percent of original size [2020-12-23 06:45:21,788 INFO L547 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2020-12-23 06:45:21,789 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 8 variables, input treesize:106, output treesize:76 [2020-12-23 06:45:22,064 WARN L197 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2020-12-23 06:45:22,065 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 06:45:22,066 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 11 case distinctions, treesize of input 84 treesize of output 279 [2020-12-23 06:45:22,073 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 06:45:22,195 WARN L197 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 50 [2020-12-23 06:45:22,195 INFO L625 ElimStorePlain]: treesize reduction 196, result has 30.7 percent of original size [2020-12-23 06:45:22,201 INFO L547 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2020-12-23 06:45:22,201 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 8 variables, input treesize:106, output treesize:76 [2020-12-23 06:45:22,438 WARN L197 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2020-12-23 06:45:22,439 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 06:45:22,439 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 11 case distinctions, treesize of input 84 treesize of output 279 [2020-12-23 06:45:22,449 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 06:45:22,567 WARN L197 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 50 [2020-12-23 06:45:22,568 INFO L625 ElimStorePlain]: treesize reduction 196, result has 30.7 percent of original size [2020-12-23 06:45:22,575 INFO L547 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2020-12-23 06:45:22,575 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 8 variables, input treesize:106, output treesize:76 [2020-12-23 06:45:22,762 WARN L197 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2020-12-23 06:45:22,762 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 06:45:22,763 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 11 case distinctions, treesize of input 84 treesize of output 279 [2020-12-23 06:45:22,772 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 06:45:22,889 WARN L197 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 50 [2020-12-23 06:45:22,890 INFO L625 ElimStorePlain]: treesize reduction 220, result has 28.3 percent of original size [2020-12-23 06:45:22,895 INFO L547 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2020-12-23 06:45:22,896 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 10 variables, input treesize:106, output treesize:72 [2020-12-23 06:45:24,450 INFO L134 CoverageAnalysis]: Checked inductivity of 287 backedges. 9 proven. 57 refuted. 0 times theorem prover too weak. 221 trivial. 0 not checked. [2020-12-23 06:45:24,450 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 06:45:24,450 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20] total 40 [2020-12-23 06:45:24,450 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425666340] [2020-12-23 06:45:24,451 INFO L461 AbstractCegarLoop]: Interpolant automaton has 41 states [2020-12-23 06:45:24,451 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 06:45:24,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2020-12-23 06:45:24,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=1516, Unknown=0, NotChecked=0, Total=1640 [2020-12-23 06:45:24,452 INFO L87 Difference]: Start difference. First operand 225 states and 292 transitions. Second operand 41 states. [2020-12-23 06:45:26,147 WARN L197 SmtUtils]: Spent 333.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 72 [2020-12-23 06:45:26,820 WARN L197 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 81 [2020-12-23 06:45:27,161 WARN L197 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 80 [2020-12-23 06:45:27,492 WARN L197 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 77 [2020-12-23 06:45:28,087 WARN L197 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 84 [2020-12-23 06:45:28,521 WARN L197 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 88 [2020-12-23 06:45:28,933 WARN L197 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 83 [2020-12-23 06:45:29,230 WARN L197 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 85 [2020-12-23 06:45:29,550 WARN L197 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 79 [2020-12-23 06:45:29,863 WARN L197 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 79 [2020-12-23 06:45:30,231 WARN L197 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 82 [2020-12-23 06:45:30,507 WARN L197 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 79 [2020-12-23 06:45:31,488 WARN L197 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 86 [2020-12-23 06:45:31,791 WARN L197 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 90 [2020-12-23 06:45:32,463 WARN L197 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 70 [2020-12-23 06:45:32,668 WARN L197 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 67 [2020-12-23 06:45:33,876 WARN L197 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 66 [2020-12-23 06:45:34,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 06:45:34,238 INFO L93 Difference]: Finished difference Result 430 states and 567 transitions. [2020-12-23 06:45:34,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2020-12-23 06:45:34,239 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 85 [2020-12-23 06:45:34,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 06:45:34,246 INFO L225 Difference]: With dead ends: 430 [2020-12-23 06:45:34,246 INFO L226 Difference]: Without dead ends: 316 [2020-12-23 06:45:34,248 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 70 SyntacticMatches, 8 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1786 ImplicationChecksByTransitivity, 10.9s TimeCoverageRelationStatistics Valid=744, Invalid=6062, Unknown=0, NotChecked=0, Total=6806 [2020-12-23 06:45:34,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2020-12-23 06:45:34,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 270. [2020-12-23 06:45:34,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 270 states. [2020-12-23 06:45:34,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 347 transitions. [2020-12-23 06:45:34,313 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 347 transitions. Word has length 85 [2020-12-23 06:45:34,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 06:45:34,314 INFO L481 AbstractCegarLoop]: Abstraction has 270 states and 347 transitions. [2020-12-23 06:45:34,314 INFO L482 AbstractCegarLoop]: Interpolant automaton has 41 states. [2020-12-23 06:45:34,314 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 347 transitions. [2020-12-23 06:45:34,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2020-12-23 06:45:34,315 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 06:45:34,315 INFO L422 BasicCegarLoop]: trace histogram [10, 10, 7, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 06:45:34,528 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,20 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 06:45:34,529 INFO L429 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 06:45:34,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 06:45:34,530 INFO L82 PathProgramCache]: Analyzing trace with hash -1580992173, now seen corresponding path program 9 times [2020-12-23 06:45:34,530 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 06:45:34,530 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462220809] [2020-12-23 06:45:34,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 06:45:34,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 06:45:34,651 INFO L134 CoverageAnalysis]: Checked inductivity of 305 backedges. 33 proven. 17 refuted. 0 times theorem prover too weak. 255 trivial. 0 not checked. [2020-12-23 06:45:34,651 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462220809] [2020-12-23 06:45:34,652 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1800267506] [2020-12-23 06:45:34,652 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 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 06:45:34,886 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2020-12-23 06:45:34,887 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-23 06:45:34,889 INFO L263 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 7 conjunts are in the unsatisfiable core [2020-12-23 06:45:34,891 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 06:45:35,025 INFO L134 CoverageAnalysis]: Checked inductivity of 305 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 255 trivial. 0 not checked. [2020-12-23 06:45:35,025 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-12-23 06:45:35,025 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [8] total 9 [2020-12-23 06:45:35,026 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350545480] [2020-12-23 06:45:35,026 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-12-23 06:45:35,026 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 06:45:35,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-12-23 06:45:35,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-12-23 06:45:35,027 INFO L87 Difference]: Start difference. First operand 270 states and 347 transitions. Second operand 8 states. [2020-12-23 06:45:35,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 06:45:35,206 INFO L93 Difference]: Finished difference Result 273 states and 350 transitions. [2020-12-23 06:45:35,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-23 06:45:35,207 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 89 [2020-12-23 06:45:35,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 06:45:35,208 INFO L225 Difference]: With dead ends: 273 [2020-12-23 06:45:35,208 INFO L226 Difference]: Without dead ends: 0 [2020-12-23 06:45:35,208 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-12-23 06:45:35,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-12-23 06:45:35,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-12-23 06:45:35,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-12-23 06:45:35,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-12-23 06:45:35,210 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 89 [2020-12-23 06:45:35,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 06:45:35,210 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-12-23 06:45:35,211 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-12-23 06:45:35,211 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-12-23 06:45:35,211 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-12-23 06:45:35,424 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2020-12-23 06:45:35,428 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-12-23 06:45:35,614 WARN L197 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 265 DAG size of output: 186 [2020-12-23 06:45:37,266 WARN L197 SmtUtils]: Spent 1.65 s on a formula simplification. DAG size of input: 502 DAG size of output: 448 [2020-12-23 06:45:37,513 WARN L197 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 215 DAG size of output: 215 [2020-12-23 06:45:37,725 WARN L197 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 224 DAG size of output: 224 [2020-12-23 06:45:40,532 WARN L197 SmtUtils]: Spent 2.77 s on a formula simplification. DAG size of input: 183 DAG size of output: 101 [2020-12-23 06:46:06,934 WARN L197 SmtUtils]: Spent 26.40 s on a formula simplification. DAG size of input: 439 DAG size of output: 86 [2020-12-23 06:46:09,261 WARN L197 SmtUtils]: Spent 2.32 s on a formula simplification. DAG size of input: 215 DAG size of output: 83 [2020-12-23 06:46:11,019 WARN L197 SmtUtils]: Spent 1.76 s on a formula simplification. DAG size of input: 224 DAG size of output: 81 [2020-12-23 06:46:13,004 WARN L197 SmtUtils]: Spent 1.98 s on a formula simplification. DAG size of input: 171 DAG size of output: 129 [2020-12-23 06:46:13,010 INFO L189 CegarLoopUtils]: For program point L15(lines 15 17) no Hoare annotation was computed. [2020-12-23 06:46:13,010 INFO L185 CegarLoopUtils]: At program point L15-2(lines 14 19) the Hoare annotation is: (let ((.cse1 (= 1 ULTIMATE.start___VERIFIER_assert_~cond)) (.cse12 (select |#memory_int| |ULTIMATE.start_main_~#array~1.base|))) (let ((.cse0 (= (select |#valid| |~#array~0.base|) 1)) (.cse2 (exists ((|#t~string0.base| Int) (|#t~string1.base| Int)) (and (or (= |#t~string0.base| 0) (= |#t~string1.base| 0) (= |~#array~0.base| 0) (= (select |#valid| 0) 0)) (= (select |#valid| |#t~string0.base|) 1) (= (select |#valid| |#t~string1.base|) 1)))) (.cse3 (= 5 ~n~0)) (.cse4 (= (select .cse12 (+ |ULTIMATE.start_main_~#array~1.offset| 4)) 1)) (.cse5 (= 3 (select .cse12 (+ |ULTIMATE.start_main_~#array~1.offset| 12)))) (.cse6 (= (select .cse12 (+ |ULTIMATE.start_main_~#array~1.offset| 16)) 4)) (.cse8 (let ((.cse13 (<= ~n~0 ULTIMATE.start_SelectionSort_~lh~0)) (.cse14 (<= ULTIMATE.start_SelectionSort_~i~0 (+ ULTIMATE.start_SelectionSort_~lh~0 1))) (.cse15 (<= 0 ULTIMATE.start_main_~i~1)) (.cse16 (<= 5 ~n~0))) (or (and (not (= 0 ULTIMATE.start___VERIFIER_assert_~cond)) .cse13 (= (select .cse12 0) 0) .cse14 .cse15 .cse16 (<= ULTIMATE.start_main_~i~1 4)) (and .cse13 .cse1 (= ULTIMATE.start_main_~i~1 0) .cse14 .cse15 .cse16 (= (select .cse12 (+ |ULTIMATE.start_main_~#array~1.offset| (* ULTIMATE.start_main_~i~1 4))) 0))))) (.cse7 (= 2 (select .cse12 (+ |ULTIMATE.start_main_~#array~1.offset| 8)))) (.cse9 (not (= |ULTIMATE.start_main_~#array~1.base| |~#array~0.base|))) (.cse10 (= |~#array~0.offset| 0)) (.cse11 (= |ULTIMATE.start_main_~#array~1.offset| 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse0 .cse2 .cse3 .cse4 .cse5 (<= 3 ULTIMATE.start_main_~i~1) .cse6 .cse8 .cse7 .cse9 .cse10 .cse11)))) [2020-12-23 06:46:13,010 INFO L189 CegarLoopUtils]: For program point L44-2(lines 44 45) no Hoare annotation was computed. [2020-12-23 06:46:13,011 INFO L185 CegarLoopUtils]: At program point L44-3(lines 44 45) the Hoare annotation is: (let ((.cse19 (select |#memory_int| |~#array~0.base|))) (let ((.cse20 (select .cse19 (+ |~#array~0.offset| 4))) (.cse18 (select |#memory_int| |ULTIMATE.start_main_~#array~1.base|))) (let ((.cse4 (= |~#array~0.offset| 0)) (.cse12 (= 3 (select .cse18 (+ |ULTIMATE.start_main_~#array~1.offset| 12)))) (.cse0 (= (select .cse19 (+ |~#array~0.offset| 16)) 0)) (.cse1 (= (select .cse19 |~#array~0.offset|) 0)) (.cse2 (exists ((|#t~string0.base| Int) (|#t~string1.base| Int)) (and (or (= |#t~string0.base| 0) (= |#t~string1.base| 0) (= (select |#valid| 0) 0)) (not (= |#t~string1.base| |~#array~0.base|)) (= (select |#valid| |#t~string0.base|) 1) (not (= |#t~string0.base| |~#array~0.base|)) (= (select |#valid| |#t~string1.base|) 1)))) (.cse3 (= (select .cse19 (+ |~#array~0.offset| 12)) 0)) (.cse16 (<= 0 |~#array~0.offset|)) (.cse5 (= |ULTIMATE.start_main_~#array~1.offset| 0)) (.cse6 (= (select |#valid| |~#array~0.base|) 1)) (.cse7 (= 5 ~n~0)) (.cse15 (<= |~#array~0.offset| 0)) (.cse8 (<= 0 .cse20)) (.cse9 (< 1 |~#array~0.base|)) (.cse13 (= (select .cse18 (+ |ULTIMATE.start_main_~#array~1.offset| 16)) 4)) (.cse10 (<= .cse20 0)) (.cse11 (= 0 (select .cse19 (+ |~#array~0.offset| 8))))) (or (and .cse0 .cse1 .cse2 .cse3 (not (= |ULTIMATE.start_main_~#array~1.base| |~#array~0.base|)) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (= ULTIMATE.start_main_~i~1 4) .cse11) (and .cse0 .cse1 .cse12 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= ULTIMATE.start_main_~i~1 2) .cse8 .cse9 .cse13 .cse10 .cse11) (and .cse0 .cse1 .cse2 .cse3 (<= (+ ULTIMATE.start_main_~i~1 1) (div (+ |~#array~0.offset| (* |ULTIMATE.start_main_~#array~1.offset| (- 1)) 8) 4)) (exists ((v_ULTIMATE.start_main_~i~1_56 Int) (v_ULTIMATE.start_main_~i~1_55 Int)) (let ((.cse14 (select |#memory_int| |ULTIMATE.start_main_~#array~1.base|))) (and (= (select .cse14 (+ |ULTIMATE.start_main_~#array~1.offset| (* v_ULTIMATE.start_main_~i~1_56 4))) v_ULTIMATE.start_main_~i~1_56) (<= (+ ULTIMATE.start_main_~i~1 1) v_ULTIMATE.start_main_~i~1_56) (<= (+ v_ULTIMATE.start_main_~i~1_56 1) v_ULTIMATE.start_main_~i~1_55) (= (select .cse14 (+ |ULTIMATE.start_main_~#array~1.offset| (* v_ULTIMATE.start_main_~i~1_55 4))) v_ULTIMATE.start_main_~i~1_55) (<= v_ULTIMATE.start_main_~i~1_55 3)))) .cse5 .cse6 (<= 1 ULTIMATE.start_main_~i~1) .cse7 .cse15 .cse8 .cse9 .cse13 .cse10 .cse11) (and (= ULTIMATE.start_main_~i~1 0) .cse0 .cse1 .cse2 .cse3 .cse16 (exists ((v_ULTIMATE.start_main_~i~1_57 Int) (v_ULTIMATE.start_main_~i~1_56 Int) (v_ULTIMATE.start_main_~i~1_55 Int)) (let ((.cse17 (select |#memory_int| |ULTIMATE.start_main_~#array~1.base|))) (and (= (select .cse17 (+ |ULTIMATE.start_main_~#array~1.offset| (* v_ULTIMATE.start_main_~i~1_56 4))) v_ULTIMATE.start_main_~i~1_56) (<= (+ v_ULTIMATE.start_main_~i~1_56 1) v_ULTIMATE.start_main_~i~1_55) (<= (+ v_ULTIMATE.start_main_~i~1_57 1) v_ULTIMATE.start_main_~i~1_56) (= (select .cse17 (+ |ULTIMATE.start_main_~#array~1.offset| (* v_ULTIMATE.start_main_~i~1_55 4))) v_ULTIMATE.start_main_~i~1_55) (= (select .cse17 (+ |ULTIMATE.start_main_~#array~1.offset| (* v_ULTIMATE.start_main_~i~1_57 4))) v_ULTIMATE.start_main_~i~1_57) (<= v_ULTIMATE.start_main_~i~1_55 3) (<= (+ ULTIMATE.start_main_~i~1 1) v_ULTIMATE.start_main_~i~1_57)))) .cse5 .cse6 .cse7 .cse15 .cse8 .cse9 .cse13 .cse10 .cse11) (and (= (select .cse18 0) 0) .cse0 .cse1 .cse12 .cse2 .cse3 .cse16 (exists ((v_ULTIMATE.start_main_~i~1_40 Int)) (and (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~1.base|) (+ (* v_ULTIMATE.start_main_~i~1_40 4) |ULTIMATE.start_main_~#array~1.offset|)) v_ULTIMATE.start_main_~i~1_40) (<= v_ULTIMATE.start_main_~i~1_40 1) (<= (+ ULTIMATE.start_main_~i~1 1) v_ULTIMATE.start_main_~i~1_40))) .cse5 .cse6 .cse7 .cse15 (= (select .cse18 (+ |ULTIMATE.start_main_~#array~1.offset| 4)) 1) .cse8 .cse9 (= 2 (select .cse18 (+ |ULTIMATE.start_main_~#array~1.offset| 8))) .cse13 .cse10 .cse11) (and .cse0 .cse1 .cse2 .cse3 (<= ULTIMATE.start_main_~i~1 3) .cse16 .cse5 .cse6 .cse7 .cse15 .cse8 .cse9 (<= 3 ULTIMATE.start_main_~i~1) .cse13 .cse10 .cse11))))) [2020-12-23 06:46:13,011 INFO L189 CegarLoopUtils]: For program point L44-4(lines 44 45) no Hoare annotation was computed. [2020-12-23 06:46:13,011 INFO L189 CegarLoopUtils]: For program point L40(lines 40 52) no Hoare annotation was computed. [2020-12-23 06:46:13,011 INFO L189 CegarLoopUtils]: For program point L-1(line -1) no Hoare annotation was computed. [2020-12-23 06:46:13,011 INFO L189 CegarLoopUtils]: For program point L32-2(lines 32 33) no Hoare annotation was computed. [2020-12-23 06:46:13,011 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-12-23 06:46:13,012 INFO L185 CegarLoopUtils]: At program point L32-3(lines 32 33) the Hoare annotation is: (let ((.cse15 (select |#memory_int| |ULTIMATE.start_main_~#array~1.base|))) (let ((.cse0 (= (select .cse15 0) 0)) (.cse1 (= 3 (select .cse15 (+ |ULTIMATE.start_main_~#array~1.offset| 12)))) (.cse2 (not (= |ULTIMATE.start_main_~#array~1.base| |~#array~0.base|))) (.cse4 (<= 0 |~#array~0.offset|)) (.cse5 (exists ((v_ULTIMATE.start_main_~i~1_40 Int)) (and (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~1.base|) (+ (* v_ULTIMATE.start_main_~i~1_40 4) |ULTIMATE.start_main_~#array~1.offset|)) v_ULTIMATE.start_main_~i~1_40) (<= v_ULTIMATE.start_main_~i~1_40 1) (<= (+ ULTIMATE.start_main_~i~1 1) v_ULTIMATE.start_main_~i~1_40)))) (.cse6 (= |ULTIMATE.start_main_~#array~1.offset| 0)) (.cse7 (= (select |#valid| |~#array~0.base|) 1)) (.cse8 (exists ((|#t~string0.base| Int) (|#t~string1.base| Int)) (and (or (= |#t~string0.base| 0) (= |#t~string1.base| 0) (= |~#array~0.base| 0) (= (select |#valid| 0) 0)) (= (select |#valid| |#t~string0.base|) 1) (= (select |#valid| |#t~string1.base|) 1)))) (.cse9 (= 5 ~n~0)) (.cse10 (let ((.cse16 (select |#memory_int| |~#array~0.base|))) (<= (select .cse16 (+ (* ULTIMATE.start_SelectionSort_~rh~0 4) |~#array~0.offset|)) (select .cse16 (+ (* ULTIMATE.start_SelectionSort_~i~0 4) |~#array~0.offset| (- 4)))))) (.cse11 (<= |~#array~0.offset| 0)) (.cse12 (= (select .cse15 (+ |ULTIMATE.start_main_~#array~1.offset| 4)) 1)) (.cse13 (= 2 (select .cse15 (+ |ULTIMATE.start_main_~#array~1.offset| 8)))) (.cse14 (= (select .cse15 (+ |ULTIMATE.start_main_~#array~1.offset| 16)) 4)) (.cse3 (+ ULTIMATE.start_SelectionSort_~lh~0 1))) (or (and (< ULTIMATE.start_SelectionSort_~lh~0 ~n~0) .cse0 .cse1 .cse2 (<= ULTIMATE.start_SelectionSort_~i~0 .cse3) .cse4 .cse5 .cse6 (<= .cse3 ULTIMATE.start_SelectionSort_~i~0) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 (<= (+ ULTIMATE.start_SelectionSort_~lh~0 2) ULTIMATE.start_SelectionSort_~i~0) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (< .cse3 ~n~0))))) [2020-12-23 06:46:13,012 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-12-23 06:46:13,012 INFO L189 CegarLoopUtils]: For program point L32-4(lines 32 33) no Hoare annotation was computed. [2020-12-23 06:46:13,012 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 16) no Hoare annotation was computed. [2020-12-23 06:46:13,012 INFO L189 CegarLoopUtils]: For program point L16(line 16) no Hoare annotation was computed. [2020-12-23 06:46:13,012 INFO L189 CegarLoopUtils]: For program point L49-2(lines 49 50) no Hoare annotation was computed. [2020-12-23 06:46:13,013 INFO L185 CegarLoopUtils]: At program point L49-3(lines 49 50) the Hoare annotation is: (let ((.cse13 (select |#memory_int| |ULTIMATE.start_main_~#array~1.base|))) (let ((.cse14 (not (= 0 ULTIMATE.start___VERIFIER_assert_~cond))) (.cse0 (<= ~n~0 ULTIMATE.start_SelectionSort_~lh~0)) (.cse15 (= (select .cse13 0) 0)) (.cse1 (= 3 (select .cse13 (+ |ULTIMATE.start_main_~#array~1.offset| 12)))) (.cse2 (<= ULTIMATE.start_SelectionSort_~i~0 (+ ULTIMATE.start_SelectionSort_~lh~0 1))) (.cse3 (not (= |ULTIMATE.start_main_~#array~1.base| |~#array~0.base|))) (.cse4 (<= 0 ULTIMATE.start_main_~i~1)) (.cse5 (= |~#array~0.offset| 0)) (.cse6 (= |ULTIMATE.start_main_~#array~1.offset| 0)) (.cse7 (= (select |#valid| |~#array~0.base|) 1)) (.cse8 (exists ((|#t~string0.base| Int) (|#t~string1.base| Int)) (and (or (= |#t~string0.base| 0) (= |#t~string1.base| 0) (= |~#array~0.base| 0) (= (select |#valid| 0) 0)) (= (select |#valid| |#t~string0.base|) 1) (= (select |#valid| |#t~string1.base|) 1)))) (.cse9 (= 5 ~n~0)) (.cse10 (= (select .cse13 (+ |ULTIMATE.start_main_~#array~1.offset| 4)) 1)) (.cse11 (= (select .cse13 (+ |ULTIMATE.start_main_~#array~1.offset| 16)) 4)) (.cse12 (= 2 (select .cse13 (+ |ULTIMATE.start_main_~#array~1.offset| 8)))) (.cse16 (<= 5 ~n~0))) (or (and .cse0 (= ULTIMATE.start_main_~i~1 0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (= (select .cse13 (+ |ULTIMATE.start_main_~#array~1.offset| (* ULTIMATE.start_main_~i~1 4))) 0)) (and .cse14 .cse0 .cse15 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= 1 ULTIMATE.start___VERIFIER_assert_~cond) .cse8 .cse9 .cse10 .cse11 .cse12 .cse16) (and .cse14 .cse0 .cse15 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (<= 4 ULTIMATE.start_main_~i~1) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse16)))) [2020-12-23 06:46:13,013 INFO L189 CegarLoopUtils]: For program point L49-4(lines 49 50) no Hoare annotation was computed. [2020-12-23 06:46:13,013 INFO L189 CegarLoopUtils]: For program point L33(line 33) no Hoare annotation was computed. [2020-12-23 06:46:13,013 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-12-23 06:46:13,013 INFO L189 CegarLoopUtils]: For program point L30-2(lines 30 37) no Hoare annotation was computed. [2020-12-23 06:46:13,013 INFO L185 CegarLoopUtils]: At program point L30-3(lines 30 37) the Hoare annotation is: (let ((.cse15 (select |#memory_int| |ULTIMATE.start_main_~#array~1.base|))) (let ((.cse6 (+ ULTIMATE.start_SelectionSort_~lh~0 1)) (.cse2 (not (= |ULTIMATE.start_main_~#array~1.base| |~#array~0.base|))) (.cse3 (= |~#array~0.offset| 0)) (.cse8 (exists ((|#t~string0.base| Int) (|#t~string1.base| Int)) (and (or (= |#t~string0.base| 0) (= |#t~string1.base| 0) (= |~#array~0.base| 0) (= (select |#valid| 0) 0)) (= (select |#valid| |#t~string0.base|) 1) (= (select |#valid| |#t~string1.base|) 1)))) (.cse0 (= (select .cse15 0) 0)) (.cse1 (= 3 (select .cse15 (+ |ULTIMATE.start_main_~#array~1.offset| 12)))) (.cse4 (exists ((v_ULTIMATE.start_main_~i~1_40 Int)) (and (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~1.base|) (+ (* v_ULTIMATE.start_main_~i~1_40 4) |ULTIMATE.start_main_~#array~1.offset|)) v_ULTIMATE.start_main_~i~1_40) (<= v_ULTIMATE.start_main_~i~1_40 1) (<= (+ ULTIMATE.start_main_~i~1 1) v_ULTIMATE.start_main_~i~1_40)))) (.cse5 (= |ULTIMATE.start_main_~#array~1.offset| 0)) (.cse7 (= (select |#valid| |~#array~0.base|) 1)) (.cse9 (= 5 ~n~0)) (.cse10 (= (select .cse15 (+ |ULTIMATE.start_main_~#array~1.offset| 4)) 1)) (.cse12 (= 2 (select .cse15 (+ |ULTIMATE.start_main_~#array~1.offset| 8)))) (.cse11 (= (select .cse15 (+ |ULTIMATE.start_main_~#array~1.offset| 16)) 4))) (or (and (< ULTIMATE.start_SelectionSort_~lh~0 ~n~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= .cse6 ULTIMATE.start_SelectionSort_~i~0) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and (<= ~n~0 ULTIMATE.start_SelectionSort_~lh~0) .cse0 .cse1 (<= ULTIMATE.start_SelectionSort_~i~0 .cse6) .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (let ((.cse13 (select |#memory_int| |~#array~0.base|))) (let ((.cse14 (select .cse13 (+ |~#array~0.offset| 4)))) (and .cse0 (= (select .cse13 (+ |~#array~0.offset| 16)) 0) (= (select .cse13 |~#array~0.offset|) 0) .cse1 (exists ((|#t~string0.base| Int) (|#t~string1.base| Int)) (and (or (= |#t~string0.base| 0) (= |#t~string1.base| 0) (= (select |#valid| 0) 0)) (not (= |#t~string1.base| |~#array~0.base|)) (= (select |#valid| |#t~string0.base|) 1) (not (= |#t~string0.base| |~#array~0.base|)) (= (select |#valid| |#t~string1.base|) 1))) (= (select .cse13 (+ |~#array~0.offset| 12)) 0) (<= 0 |~#array~0.offset|) .cse4 .cse5 .cse7 .cse9 (<= |~#array~0.offset| 0) .cse10 (<= 0 .cse14) (= ULTIMATE.start_SelectionSort_~lh~0 0) (< 1 |~#array~0.base|) .cse12 .cse11 (<= .cse14 0) (= 0 (select .cse13 (+ |~#array~0.offset| 8))))))))) [2020-12-23 06:46:13,013 INFO L189 CegarLoopUtils]: For program point L26(lines 26 38) no Hoare annotation was computed. [2020-12-23 06:46:13,022 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_40,QUANTIFIED] [2020-12-23 06:46:13,024 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_40,QUANTIFIED] [2020-12-23 06:46:13,024 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_40,QUANTIFIED] [2020-12-23 06:46:13,024 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_40,QUANTIFIED] [2020-12-23 06:46:13,024 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-23 06:46:13,025 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] [2020-12-23 06:46:13,025 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-23 06:46:13,025 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] [2020-12-23 06:46:13,026 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_40,QUANTIFIED] [2020-12-23 06:46:13,026 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_40,QUANTIFIED] [2020-12-23 06:46:13,026 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_40,QUANTIFIED] [2020-12-23 06:46:13,026 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_40,QUANTIFIED] [2020-12-23 06:46:13,026 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-23 06:46:13,027 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] [2020-12-23 06:46:13,027 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-23 06:46:13,027 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] [2020-12-23 06:46:13,028 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-23 06:46:13,028 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] [2020-12-23 06:46:13,028 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] [2020-12-23 06:46:13,028 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-23 06:46:13,029 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-23 06:46:13,029 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] [2020-12-23 06:46:13,029 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_40,QUANTIFIED] [2020-12-23 06:46:13,030 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_40,QUANTIFIED] [2020-12-23 06:46:13,030 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_40,QUANTIFIED] [2020-12-23 06:46:13,030 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_40,QUANTIFIED] [2020-12-23 06:46:13,047 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_40,QUANTIFIED] [2020-12-23 06:46:13,049 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_40,QUANTIFIED] [2020-12-23 06:46:13,049 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_40,QUANTIFIED] [2020-12-23 06:46:13,050 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_40,QUANTIFIED] [2020-12-23 06:46:13,050 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-23 06:46:13,050 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] [2020-12-23 06:46:13,050 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-23 06:46:13,051 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] [2020-12-23 06:46:13,051 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_40,QUANTIFIED] [2020-12-23 06:46:13,051 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_40,QUANTIFIED] [2020-12-23 06:46:13,051 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_40,QUANTIFIED] [2020-12-23 06:46:13,052 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_40,QUANTIFIED] [2020-12-23 06:46:13,052 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-23 06:46:13,056 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] [2020-12-23 06:46:13,057 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-23 06:46:13,057 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] [2020-12-23 06:46:13,057 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-23 06:46:13,057 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] [2020-12-23 06:46:13,058 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] [2020-12-23 06:46:13,058 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-23 06:46:13,058 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-23 06:46:13,058 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] [2020-12-23 06:46:13,059 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_40,QUANTIFIED] [2020-12-23 06:46:13,063 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_40,QUANTIFIED] [2020-12-23 06:46:13,064 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_40,QUANTIFIED] [2020-12-23 06:46:13,064 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_40,QUANTIFIED] [2020-12-23 06:46:13,074 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-23 06:46:13,074 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] [2020-12-23 06:46:13,074 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-23 06:46:13,075 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] [2020-12-23 06:46:13,075 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-23 06:46:13,075 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] [2020-12-23 06:46:13,076 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-23 06:46:13,076 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] [2020-12-23 06:46:13,080 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-23 06:46:13,081 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] [2020-12-23 06:46:13,083 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-23 06:46:13,083 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] [2020-12-23 06:46:13,084 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-23 06:46:13,084 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] [2020-12-23 06:46:13,084 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-23 06:46:13,085 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] [2020-12-23 06:46:13,089 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_40,QUANTIFIED] [2020-12-23 06:46:13,094 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_40,QUANTIFIED] [2020-12-23 06:46:13,095 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_40,QUANTIFIED] [2020-12-23 06:46:13,095 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_40,QUANTIFIED] [2020-12-23 06:46:13,095 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-23 06:46:13,095 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] [2020-12-23 06:46:13,096 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-23 06:46:13,096 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] [2020-12-23 06:46:13,096 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_40,QUANTIFIED] [2020-12-23 06:46:13,096 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_40,QUANTIFIED] [2020-12-23 06:46:13,097 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_40,QUANTIFIED] [2020-12-23 06:46:13,097 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_40,QUANTIFIED] [2020-12-23 06:46:13,097 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-23 06:46:13,097 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] [2020-12-23 06:46:13,101 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-23 06:46:13,101 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] [2020-12-23 06:46:13,103 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_40,QUANTIFIED] [2020-12-23 06:46:13,104 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_40,QUANTIFIED] [2020-12-23 06:46:13,106 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_40,QUANTIFIED] [2020-12-23 06:46:13,106 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_40,QUANTIFIED] [2020-12-23 06:46:13,107 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-23 06:46:13,107 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] [2020-12-23 06:46:13,107 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-23 06:46:13,107 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] [2020-12-23 06:46:13,108 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_40,QUANTIFIED] [2020-12-23 06:46:13,108 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_40,QUANTIFIED] [2020-12-23 06:46:13,108 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_40,QUANTIFIED] [2020-12-23 06:46:13,109 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_40,QUANTIFIED] [2020-12-23 06:46:13,110 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-23 06:46:13,111 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] [2020-12-23 06:46:13,111 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-23 06:46:13,111 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] [2020-12-23 06:46:13,113 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-23 06:46:13,114 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] [2020-12-23 06:46:13,114 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-23 06:46:13,119 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] [2020-12-23 06:46:13,120 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-23 06:46:13,120 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] [2020-12-23 06:46:13,120 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-23 06:46:13,120 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] [2020-12-23 06:46:13,120 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-23 06:46:13,121 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] [2020-12-23 06:46:13,121 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-23 06:46:13,121 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] [2020-12-23 06:46:13,125 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-23 06:46:13,126 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] [2020-12-23 06:46:13,126 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-23 06:46:13,126 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] [2020-12-23 06:46:13,127 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-23 06:46:13,127 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] [2020-12-23 06:46:13,127 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-23 06:46:13,127 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] [2020-12-23 06:46:13,127 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-23 06:46:13,128 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] [2020-12-23 06:46:13,128 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-23 06:46:13,132 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] [2020-12-23 06:46:13,139 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-23 06:46:13,139 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] [2020-12-23 06:46:13,139 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] [2020-12-23 06:46:13,139 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-23 06:46:13,140 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-23 06:46:13,143 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] [2020-12-23 06:46:13,144 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-23 06:46:13,144 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] [2020-12-23 06:46:13,144 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] [2020-12-23 06:46:13,144 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-23 06:46:13,144 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-23 06:46:13,145 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] [2020-12-23 06:46:13,145 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-23 06:46:13,145 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] [2020-12-23 06:46:13,146 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] [2020-12-23 06:46:13,146 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-23 06:46:13,146 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-23 06:46:13,146 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] [2020-12-23 06:46:13,147 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_56,QUANTIFIED] [2020-12-23 06:46:13,147 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_56,QUANTIFIED] [2020-12-23 06:46:13,149 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_56,QUANTIFIED] [2020-12-23 06:46:13,149 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_56,QUANTIFIED] [2020-12-23 06:46:13,150 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_55,QUANTIFIED] [2020-12-23 06:46:13,150 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_55,QUANTIFIED] [2020-12-23 06:46:13,150 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_55,QUANTIFIED] [2020-12-23 06:46:13,150 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_55,QUANTIFIED] [2020-12-23 06:46:13,151 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-23 06:46:13,151 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] [2020-12-23 06:46:13,151 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] [2020-12-23 06:46:13,151 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-23 06:46:13,152 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-23 06:46:13,152 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] [2020-12-23 06:46:13,153 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_56,QUANTIFIED] [2020-12-23 06:46:13,153 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_56,QUANTIFIED] [2020-12-23 06:46:13,153 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_56,QUANTIFIED] [2020-12-23 06:46:13,153 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_55,QUANTIFIED] [2020-12-23 06:46:13,154 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_57,QUANTIFIED] [2020-12-23 06:46:13,154 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_56,QUANTIFIED] [2020-12-23 06:46:13,154 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_55,QUANTIFIED] [2020-12-23 06:46:13,154 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_55,QUANTIFIED] [2020-12-23 06:46:13,155 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_57,QUANTIFIED] [2020-12-23 06:46:13,155 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_57,QUANTIFIED] [2020-12-23 06:46:13,155 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_55,QUANTIFIED] [2020-12-23 06:46:13,155 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_57,QUANTIFIED] [2020-12-23 06:46:13,155 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-23 06:46:13,156 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] [2020-12-23 06:46:13,156 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] [2020-12-23 06:46:13,156 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-23 06:46:13,156 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-23 06:46:13,157 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] [2020-12-23 06:46:13,157 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_40,QUANTIFIED] [2020-12-23 06:46:13,157 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_40,QUANTIFIED] [2020-12-23 06:46:13,157 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_40,QUANTIFIED] [2020-12-23 06:46:13,158 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_40,QUANTIFIED] [2020-12-23 06:46:13,158 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-23 06:46:13,158 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] [2020-12-23 06:46:13,158 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] [2020-12-23 06:46:13,158 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-23 06:46:13,159 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-23 06:46:13,159 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] [2020-12-23 06:46:13,164 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-23 06:46:13,165 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] [2020-12-23 06:46:13,166 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] [2020-12-23 06:46:13,167 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-23 06:46:13,167 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-23 06:46:13,167 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] [2020-12-23 06:46:13,168 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-23 06:46:13,168 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] [2020-12-23 06:46:13,168 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] [2020-12-23 06:46:13,168 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-23 06:46:13,169 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-23 06:46:13,169 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] [2020-12-23 06:46:13,169 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-23 06:46:13,169 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] [2020-12-23 06:46:13,170 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] [2020-12-23 06:46:13,170 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-23 06:46:13,170 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-23 06:46:13,170 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] [2020-12-23 06:46:13,171 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_56,QUANTIFIED] [2020-12-23 06:46:13,171 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_56,QUANTIFIED] [2020-12-23 06:46:13,171 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_56,QUANTIFIED] [2020-12-23 06:46:13,171 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_56,QUANTIFIED] [2020-12-23 06:46:13,171 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_55,QUANTIFIED] [2020-12-23 06:46:13,172 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_55,QUANTIFIED] [2020-12-23 06:46:13,172 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_55,QUANTIFIED] [2020-12-23 06:46:13,172 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_55,QUANTIFIED] [2020-12-23 06:46:13,173 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-23 06:46:13,173 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] [2020-12-23 06:46:13,173 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] [2020-12-23 06:46:13,173 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-23 06:46:13,173 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-23 06:46:13,174 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] [2020-12-23 06:46:13,174 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_56,QUANTIFIED] [2020-12-23 06:46:13,175 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_56,QUANTIFIED] [2020-12-23 06:46:13,175 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_56,QUANTIFIED] [2020-12-23 06:46:13,175 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_55,QUANTIFIED] [2020-12-23 06:46:13,175 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_57,QUANTIFIED] [2020-12-23 06:46:13,175 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_56,QUANTIFIED] [2020-12-23 06:46:13,176 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_55,QUANTIFIED] [2020-12-23 06:46:13,176 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_55,QUANTIFIED] [2020-12-23 06:46:13,176 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_57,QUANTIFIED] [2020-12-23 06:46:13,176 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_57,QUANTIFIED] [2020-12-23 06:46:13,178 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_55,QUANTIFIED] [2020-12-23 06:46:13,178 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_57,QUANTIFIED] [2020-12-23 06:46:13,178 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-23 06:46:13,179 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] [2020-12-23 06:46:13,179 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] [2020-12-23 06:46:13,179 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-23 06:46:13,179 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-23 06:46:13,180 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] [2020-12-23 06:46:13,180 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_40,QUANTIFIED] [2020-12-23 06:46:13,180 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_40,QUANTIFIED] [2020-12-23 06:46:13,181 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_40,QUANTIFIED] [2020-12-23 06:46:13,181 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_40,QUANTIFIED] [2020-12-23 06:46:13,182 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-23 06:46:13,182 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] [2020-12-23 06:46:13,182 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] [2020-12-23 06:46:13,182 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-23 06:46:13,183 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-23 06:46:13,184 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] [2020-12-23 06:46:13,189 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.12 06:46:13 BoogieIcfgContainer [2020-12-23 06:46:13,189 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-12-23 06:46:13,190 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-12-23 06:46:13,190 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-12-23 06:46:13,190 INFO L275 PluginConnector]: Witness Printer initialized [2020-12-23 06:46:13,191 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 06:42:35" (3/4) ... [2020-12-23 06:46:13,194 INFO L137 WitnessPrinter]: Generating witness for correct program [2020-12-23 06:46:13,209 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2020-12-23 06:46:13,209 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2020-12-23 06:46:13,210 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2020-12-23 06:46:13,210 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2020-12-23 06:46:13,245 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((unknown-#memory_int-unknown[array][array + 16] == 0 && unknown-#memory_int-unknown[array][array] == 0) && (\exists #t~string0.base : int, #t~string1.base : int :: (((((#t~string0.base == 0 || #t~string1.base == 0) || \valid[0] == 0) && !(#t~string1.base == array)) && \valid[#t~string0.base] == 1) && !(#t~string0.base == array)) && \valid[#t~string1.base] == 1)) && unknown-#memory_int-unknown[array][array + 12] == 0) && !(array == array)) && array == 0) && array == 0) && \valid[array] == 1) && 5 == n) && 0 <= unknown-#memory_int-unknown[array][array + 4]) && 1 < array) && unknown-#memory_int-unknown[array][array + 4] <= 0) && i == 4) && 0 == unknown-#memory_int-unknown[array][array + 8]) || ((((((((((((((unknown-#memory_int-unknown[array][array + 16] == 0 && unknown-#memory_int-unknown[array][array] == 0) && 3 == unknown-#memory_int-unknown[array][array + 12]) && (\exists #t~string0.base : int, #t~string1.base : int :: (((((#t~string0.base == 0 || #t~string1.base == 0) || \valid[0] == 0) && !(#t~string1.base == array)) && \valid[#t~string0.base] == 1) && !(#t~string0.base == array)) && \valid[#t~string1.base] == 1)) && unknown-#memory_int-unknown[array][array + 12] == 0) && array == 0) && array == 0) && \valid[array] == 1) && 5 == n) && i == 2) && 0 <= unknown-#memory_int-unknown[array][array + 4]) && 1 < array) && unknown-#memory_int-unknown[array][array + 16] == 4) && unknown-#memory_int-unknown[array][array + 4] <= 0) && 0 == unknown-#memory_int-unknown[array][array + 8])) || (((((((((((((((unknown-#memory_int-unknown[array][array + 16] == 0 && unknown-#memory_int-unknown[array][array] == 0) && (\exists #t~string0.base : int, #t~string1.base : int :: (((((#t~string0.base == 0 || #t~string1.base == 0) || \valid[0] == 0) && !(#t~string1.base == array)) && \valid[#t~string0.base] == 1) && !(#t~string0.base == array)) && \valid[#t~string1.base] == 1)) && unknown-#memory_int-unknown[array][array + 12] == 0) && i + 1 <= (array + array * -1 + 8) / 4) && (\exists v_ULTIMATE.start_main_~i~1_56 : int, v_ULTIMATE.start_main_~i~1_55 : int :: (((unknown-#memory_int-unknown[array][array + v_ULTIMATE.start_main_~i~1_56 * 4] == v_ULTIMATE.start_main_~i~1_56 && i + 1 <= v_ULTIMATE.start_main_~i~1_56) && v_ULTIMATE.start_main_~i~1_56 + 1 <= v_ULTIMATE.start_main_~i~1_55) && unknown-#memory_int-unknown[array][array + v_ULTIMATE.start_main_~i~1_55 * 4] == v_ULTIMATE.start_main_~i~1_55) && v_ULTIMATE.start_main_~i~1_55 <= 3)) && array == 0) && \valid[array] == 1) && 1 <= i) && 5 == n) && array <= 0) && 0 <= unknown-#memory_int-unknown[array][array + 4]) && 1 < array) && unknown-#memory_int-unknown[array][array + 16] == 4) && unknown-#memory_int-unknown[array][array + 4] <= 0) && 0 == unknown-#memory_int-unknown[array][array + 8])) || (((((((((((((((i == 0 && unknown-#memory_int-unknown[array][array + 16] == 0) && unknown-#memory_int-unknown[array][array] == 0) && (\exists #t~string0.base : int, #t~string1.base : int :: (((((#t~string0.base == 0 || #t~string1.base == 0) || \valid[0] == 0) && !(#t~string1.base == array)) && \valid[#t~string0.base] == 1) && !(#t~string0.base == array)) && \valid[#t~string1.base] == 1)) && unknown-#memory_int-unknown[array][array + 12] == 0) && 0 <= array) && (\exists v_ULTIMATE.start_main_~i~1_57 : int, v_ULTIMATE.start_main_~i~1_56 : int, v_ULTIMATE.start_main_~i~1_55 : int :: (((((unknown-#memory_int-unknown[array][array + v_ULTIMATE.start_main_~i~1_56 * 4] == v_ULTIMATE.start_main_~i~1_56 && v_ULTIMATE.start_main_~i~1_56 + 1 <= v_ULTIMATE.start_main_~i~1_55) && v_ULTIMATE.start_main_~i~1_57 + 1 <= v_ULTIMATE.start_main_~i~1_56) && unknown-#memory_int-unknown[array][array + v_ULTIMATE.start_main_~i~1_55 * 4] == v_ULTIMATE.start_main_~i~1_55) && unknown-#memory_int-unknown[array][array + v_ULTIMATE.start_main_~i~1_57 * 4] == v_ULTIMATE.start_main_~i~1_57) && v_ULTIMATE.start_main_~i~1_55 <= 3) && i + 1 <= v_ULTIMATE.start_main_~i~1_57)) && array == 0) && \valid[array] == 1) && 5 == n) && array <= 0) && 0 <= unknown-#memory_int-unknown[array][array + 4]) && 1 < array) && unknown-#memory_int-unknown[array][array + 16] == 4) && unknown-#memory_int-unknown[array][array + 4] <= 0) && 0 == unknown-#memory_int-unknown[array][array + 8])) || ((((((((((((((((((unknown-#memory_int-unknown[array][0] == 0 && unknown-#memory_int-unknown[array][array + 16] == 0) && unknown-#memory_int-unknown[array][array] == 0) && 3 == unknown-#memory_int-unknown[array][array + 12]) && (\exists #t~string0.base : int, #t~string1.base : int :: (((((#t~string0.base == 0 || #t~string1.base == 0) || \valid[0] == 0) && !(#t~string1.base == array)) && \valid[#t~string0.base] == 1) && !(#t~string0.base == array)) && \valid[#t~string1.base] == 1)) && unknown-#memory_int-unknown[array][array + 12] == 0) && 0 <= array) && (\exists v_ULTIMATE.start_main_~i~1_40 : int :: (unknown-#memory_int-unknown[array][v_ULTIMATE.start_main_~i~1_40 * 4 + array] == v_ULTIMATE.start_main_~i~1_40 && v_ULTIMATE.start_main_~i~1_40 <= 1) && i + 1 <= v_ULTIMATE.start_main_~i~1_40)) && array == 0) && \valid[array] == 1) && 5 == n) && array <= 0) && unknown-#memory_int-unknown[array][array + 4] == 1) && 0 <= unknown-#memory_int-unknown[array][array + 4]) && 1 < array) && 2 == unknown-#memory_int-unknown[array][array + 8]) && unknown-#memory_int-unknown[array][array + 16] == 4) && unknown-#memory_int-unknown[array][array + 4] <= 0) && 0 == unknown-#memory_int-unknown[array][array + 8])) || (((((((((((((((unknown-#memory_int-unknown[array][array + 16] == 0 && unknown-#memory_int-unknown[array][array] == 0) && (\exists #t~string0.base : int, #t~string1.base : int :: (((((#t~string0.base == 0 || #t~string1.base == 0) || \valid[0] == 0) && !(#t~string1.base == array)) && \valid[#t~string0.base] == 1) && !(#t~string0.base == array)) && \valid[#t~string1.base] == 1)) && unknown-#memory_int-unknown[array][array + 12] == 0) && i <= 3) && 0 <= array) && array == 0) && \valid[array] == 1) && 5 == n) && array <= 0) && 0 <= unknown-#memory_int-unknown[array][array + 4]) && 1 < array) && 3 <= i) && unknown-#memory_int-unknown[array][array + 16] == 4) && unknown-#memory_int-unknown[array][array + 4] <= 0) && 0 == unknown-#memory_int-unknown[array][array + 8]) [2020-12-23 06:46:13,246 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((lh < n && unknown-#memory_int-unknown[array][0] == 0) && 3 == unknown-#memory_int-unknown[array][array + 12]) && !(array == array)) && array == 0) && (\exists v_ULTIMATE.start_main_~i~1_40 : int :: (unknown-#memory_int-unknown[array][v_ULTIMATE.start_main_~i~1_40 * 4 + array] == v_ULTIMATE.start_main_~i~1_40 && v_ULTIMATE.start_main_~i~1_40 <= 1) && i + 1 <= v_ULTIMATE.start_main_~i~1_40)) && array == 0) && lh + 1 <= i) && \valid[array] == 1) && (\exists #t~string0.base : int, #t~string1.base : int :: ((((#t~string0.base == 0 || #t~string1.base == 0) || array == 0) || \valid[0] == 0) && \valid[#t~string0.base] == 1) && \valid[#t~string1.base] == 1)) && 5 == n) && unknown-#memory_int-unknown[array][array + 4] == 1) && unknown-#memory_int-unknown[array][array + 16] == 4) && 2 == unknown-#memory_int-unknown[array][array + 8]) || (((((((((((((n <= lh && unknown-#memory_int-unknown[array][0] == 0) && 3 == unknown-#memory_int-unknown[array][array + 12]) && i <= lh + 1) && !(array == array)) && array == 0) && (\exists v_ULTIMATE.start_main_~i~1_40 : int :: (unknown-#memory_int-unknown[array][v_ULTIMATE.start_main_~i~1_40 * 4 + array] == v_ULTIMATE.start_main_~i~1_40 && v_ULTIMATE.start_main_~i~1_40 <= 1) && i + 1 <= v_ULTIMATE.start_main_~i~1_40)) && array == 0) && \valid[array] == 1) && (\exists #t~string0.base : int, #t~string1.base : int :: ((((#t~string0.base == 0 || #t~string1.base == 0) || array == 0) || \valid[0] == 0) && \valid[#t~string0.base] == 1) && \valid[#t~string1.base] == 1)) && 5 == n) && unknown-#memory_int-unknown[array][array + 4] == 1) && unknown-#memory_int-unknown[array][array + 16] == 4) && 2 == unknown-#memory_int-unknown[array][array + 8])) || (((((((((((((((((((unknown-#memory_int-unknown[array][0] == 0 && unknown-#memory_int-unknown[array][array + 16] == 0) && unknown-#memory_int-unknown[array][array] == 0) && 3 == unknown-#memory_int-unknown[array][array + 12]) && (\exists #t~string0.base : int, #t~string1.base : int :: (((((#t~string0.base == 0 || #t~string1.base == 0) || \valid[0] == 0) && !(#t~string1.base == array)) && \valid[#t~string0.base] == 1) && !(#t~string0.base == array)) && \valid[#t~string1.base] == 1)) && unknown-#memory_int-unknown[array][array + 12] == 0) && 0 <= array) && (\exists v_ULTIMATE.start_main_~i~1_40 : int :: (unknown-#memory_int-unknown[array][v_ULTIMATE.start_main_~i~1_40 * 4 + array] == v_ULTIMATE.start_main_~i~1_40 && v_ULTIMATE.start_main_~i~1_40 <= 1) && i + 1 <= v_ULTIMATE.start_main_~i~1_40)) && array == 0) && \valid[array] == 1) && 5 == n) && array <= 0) && unknown-#memory_int-unknown[array][array + 4] == 1) && 0 <= unknown-#memory_int-unknown[array][array + 4]) && lh == 0) && 1 < array) && 2 == unknown-#memory_int-unknown[array][array + 8]) && unknown-#memory_int-unknown[array][array + 16] == 4) && unknown-#memory_int-unknown[array][array + 4] <= 0) && 0 == unknown-#memory_int-unknown[array][array + 8]) [2020-12-23 06:46:13,246 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((n <= lh && i == 0) && 3 == unknown-#memory_int-unknown[array][array + 12]) && i <= lh + 1) && !(array == array)) && 0 <= i) && array == 0) && array == 0) && \valid[array] == 1) && (\exists #t~string0.base : int, #t~string1.base : int :: ((((#t~string0.base == 0 || #t~string1.base == 0) || array == 0) || \valid[0] == 0) && \valid[#t~string0.base] == 1) && \valid[#t~string1.base] == 1)) && 5 == n) && unknown-#memory_int-unknown[array][array + 4] == 1) && unknown-#memory_int-unknown[array][array + 16] == 4) && 2 == unknown-#memory_int-unknown[array][array + 8]) && unknown-#memory_int-unknown[array][array + i * 4] == 0) || ((((((((((((((((!(0 == cond) && n <= lh) && unknown-#memory_int-unknown[array][0] == 0) && 3 == unknown-#memory_int-unknown[array][array + 12]) && i <= lh + 1) && !(array == array)) && 0 <= i) && array == 0) && array == 0) && \valid[array] == 1) && 1 == cond) && (\exists #t~string0.base : int, #t~string1.base : int :: ((((#t~string0.base == 0 || #t~string1.base == 0) || array == 0) || \valid[0] == 0) && \valid[#t~string0.base] == 1) && \valid[#t~string1.base] == 1)) && 5 == n) && unknown-#memory_int-unknown[array][array + 4] == 1) && unknown-#memory_int-unknown[array][array + 16] == 4) && 2 == unknown-#memory_int-unknown[array][array + 8]) && 5 <= n)) || ((((((((((((((((!(0 == cond) && n <= lh) && unknown-#memory_int-unknown[array][0] == 0) && 3 == unknown-#memory_int-unknown[array][array + 12]) && i <= lh + 1) && !(array == array)) && 0 <= i) && array == 0) && array == 0) && 4 <= i) && \valid[array] == 1) && (\exists #t~string0.base : int, #t~string1.base : int :: ((((#t~string0.base == 0 || #t~string1.base == 0) || array == 0) || \valid[0] == 0) && \valid[#t~string0.base] == 1) && \valid[#t~string1.base] == 1)) && 5 == n) && unknown-#memory_int-unknown[array][array + 4] == 1) && unknown-#memory_int-unknown[array][array + 16] == 4) && 2 == unknown-#memory_int-unknown[array][array + 8]) && 5 <= n) [2020-12-23 06:46:13,246 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((lh < n && unknown-#memory_int-unknown[array][0] == 0) && 3 == unknown-#memory_int-unknown[array][array + 12]) && !(array == array)) && i <= lh + 1) && 0 <= array) && (\exists v_ULTIMATE.start_main_~i~1_40 : int :: (unknown-#memory_int-unknown[array][v_ULTIMATE.start_main_~i~1_40 * 4 + array] == v_ULTIMATE.start_main_~i~1_40 && v_ULTIMATE.start_main_~i~1_40 <= 1) && i + 1 <= v_ULTIMATE.start_main_~i~1_40)) && array == 0) && lh + 1 <= i) && \valid[array] == 1) && (\exists #t~string0.base : int, #t~string1.base : int :: ((((#t~string0.base == 0 || #t~string1.base == 0) || array == 0) || \valid[0] == 0) && \valid[#t~string0.base] == 1) && \valid[#t~string1.base] == 1)) && 5 == n) && unknown-#memory_int-unknown[array][rh * 4 + array] <= unknown-#memory_int-unknown[array][i * 4 + array + -4]) && array <= 0) && unknown-#memory_int-unknown[array][array + 4] == 1) && 2 == unknown-#memory_int-unknown[array][array + 8]) && unknown-#memory_int-unknown[array][array + 16] == 4) || (((((((((((((((unknown-#memory_int-unknown[array][0] == 0 && 3 == unknown-#memory_int-unknown[array][array + 12]) && !(array == array)) && 0 <= array) && (\exists v_ULTIMATE.start_main_~i~1_40 : int :: (unknown-#memory_int-unknown[array][v_ULTIMATE.start_main_~i~1_40 * 4 + array] == v_ULTIMATE.start_main_~i~1_40 && v_ULTIMATE.start_main_~i~1_40 <= 1) && i + 1 <= v_ULTIMATE.start_main_~i~1_40)) && array == 0) && lh + 2 <= i) && \valid[array] == 1) && (\exists #t~string0.base : int, #t~string1.base : int :: ((((#t~string0.base == 0 || #t~string1.base == 0) || array == 0) || \valid[0] == 0) && \valid[#t~string0.base] == 1) && \valid[#t~string1.base] == 1)) && 5 == n) && unknown-#memory_int-unknown[array][rh * 4 + array] <= unknown-#memory_int-unknown[array][i * 4 + array + -4]) && array <= 0) && unknown-#memory_int-unknown[array][array + 4] == 1) && 2 == unknown-#memory_int-unknown[array][array + 8]) && unknown-#memory_int-unknown[array][array + 16] == 4) && lh + 1 < n) [2020-12-23 06:46:13,246 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((\valid[array] == 1 && 1 == cond) && (\exists #t~string0.base : int, #t~string1.base : int :: ((((#t~string0.base == 0 || #t~string1.base == 0) || array == 0) || \valid[0] == 0) && \valid[#t~string0.base] == 1) && \valid[#t~string1.base] == 1)) && 5 == n) && unknown-#memory_int-unknown[array][array + 4] == 1) && 3 == unknown-#memory_int-unknown[array][array + 12]) && unknown-#memory_int-unknown[array][array + 16] == 4) && 2 == unknown-#memory_int-unknown[array][array + 8]) && (((((((!(0 == cond) && n <= lh) && unknown-#memory_int-unknown[array][0] == 0) && i <= lh + 1) && 0 <= i) && 5 <= n) && i <= 4) || ((((((n <= lh && 1 == cond) && i == 0) && i <= lh + 1) && 0 <= i) && 5 <= n) && unknown-#memory_int-unknown[array][array + i * 4] == 0))) && !(array == array)) && array == 0) && array == 0) || (((((((((((\valid[array] == 1 && (\exists #t~string0.base : int, #t~string1.base : int :: ((((#t~string0.base == 0 || #t~string1.base == 0) || array == 0) || \valid[0] == 0) && \valid[#t~string0.base] == 1) && \valid[#t~string1.base] == 1)) && 5 == n) && unknown-#memory_int-unknown[array][array + 4] == 1) && 3 == unknown-#memory_int-unknown[array][array + 12]) && 3 <= i) && unknown-#memory_int-unknown[array][array + 16] == 4) && (((((((!(0 == cond) && n <= lh) && unknown-#memory_int-unknown[array][0] == 0) && i <= lh + 1) && 0 <= i) && 5 <= n) && i <= 4) || ((((((n <= lh && 1 == cond) && i == 0) && i <= lh + 1) && 0 <= i) && 5 <= n) && unknown-#memory_int-unknown[array][array + i * 4] == 0))) && 2 == unknown-#memory_int-unknown[array][array + 8]) && !(array == array)) && array == 0) && array == 0) [2020-12-23 06:46:13,265 INFO L141 WitnessManager]: Wrote witness to /storage/repos/svcomp/c/loops/eureka_05.i-witness.graphml [2020-12-23 06:46:13,265 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-12-23 06:46:13,275 INFO L168 Benchmark]: Toolchain (without parser) took 218432.87 ms. Allocated memory was 151.0 MB in the beginning and 314.6 MB in the end (delta: 163.6 MB). Free memory was 126.5 MB in the beginning and 239.8 MB in the end (delta: -113.3 MB). Peak memory consumption was 51.0 MB. Max. memory is 8.0 GB. [2020-12-23 06:46:13,276 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 151.0 MB. Free memory is still 124.7 MB. There was no memory consumed. Max. memory is 8.0 GB. [2020-12-23 06:46:13,276 INFO L168 Benchmark]: CACSL2BoogieTranslator took 404.96 ms. Allocated memory is still 151.0 MB. Free memory was 126.3 MB in the beginning and 116.4 MB in the end (delta: 9.9 MB). Peak memory consumption was 10.5 MB. Max. memory is 8.0 GB. [2020-12-23 06:46:13,277 INFO L168 Benchmark]: Boogie Procedure Inliner took 47.95 ms. Allocated memory is still 151.0 MB. Free memory was 116.2 MB in the beginning and 114.7 MB in the end (delta: 1.5 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. [2020-12-23 06:46:13,278 INFO L168 Benchmark]: Boogie Preprocessor took 32.36 ms. Allocated memory is still 151.0 MB. Free memory was 114.7 MB in the beginning and 113.6 MB in the end (delta: 1.2 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. [2020-12-23 06:46:13,278 INFO L168 Benchmark]: RCFGBuilder took 492.31 ms. Allocated memory is still 151.0 MB. Free memory was 113.4 MB in the beginning and 131.9 MB in the end (delta: -18.5 MB). Peak memory consumption was 14.7 MB. Max. memory is 8.0 GB. [2020-12-23 06:46:13,279 INFO L168 Benchmark]: TraceAbstraction took 217367.49 ms. Allocated memory was 151.0 MB in the beginning and 314.6 MB in the end (delta: 163.6 MB). Free memory was 131.4 MB in the beginning and 243.0 MB in the end (delta: -111.6 MB). Peak memory consumption was 194.9 MB. Max. memory is 8.0 GB. [2020-12-23 06:46:13,279 INFO L168 Benchmark]: Witness Printer took 75.49 ms. Allocated memory is still 314.6 MB. Free memory was 242.4 MB in the beginning and 239.8 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2020-12-23 06:46:13,281 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23 ms. Allocated memory is still 151.0 MB. Free memory is still 124.7 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 404.96 ms. Allocated memory is still 151.0 MB. Free memory was 126.3 MB in the beginning and 116.4 MB in the end (delta: 9.9 MB). Peak memory consumption was 10.5 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 47.95 ms. Allocated memory is still 151.0 MB. Free memory was 116.2 MB in the beginning and 114.7 MB in the end (delta: 1.5 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 32.36 ms. Allocated memory is still 151.0 MB. Free memory was 114.7 MB in the beginning and 113.6 MB in the end (delta: 1.2 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. * RCFGBuilder took 492.31 ms. Allocated memory is still 151.0 MB. Free memory was 113.4 MB in the beginning and 131.9 MB in the end (delta: -18.5 MB). Peak memory consumption was 14.7 MB. Max. memory is 8.0 GB. * TraceAbstraction took 217367.49 ms. Allocated memory was 151.0 MB in the beginning and 314.6 MB in the end (delta: 163.6 MB). Free memory was 131.4 MB in the beginning and 243.0 MB in the end (delta: -111.6 MB). Peak memory consumption was 194.9 MB. Max. memory is 8.0 GB. * Witness Printer took 75.49 ms. Allocated memory is still 314.6 MB. Free memory was 242.4 MB in the beginning and 239.8 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_40,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_40,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_40,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_40,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_40,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_40,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_40,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_40,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_40,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_40,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_40,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_40,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_40,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_40,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_40,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_40,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_40,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_40,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_40,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_40,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_40,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_40,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_40,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_40,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_40,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_40,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_40,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_40,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_40,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_40,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_40,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_40,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_40,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_40,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_40,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_40,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_40,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_40,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_40,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_40,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_56,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_56,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_56,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_56,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_55,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_55,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_55,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_55,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_56,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_56,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_56,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_55,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_57,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_56,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_55,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_55,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_57,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_57,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_55,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_57,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_40,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_40,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_40,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_40,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_56,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_56,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_56,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_56,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_55,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_55,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_55,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_55,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_56,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_56,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_56,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_55,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_57,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_56,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_55,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_55,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_57,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_57,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_55,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_57,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_40,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_40,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_40,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_40,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 16]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 30]: Loop Invariant [2020-12-23 06:46:13,302 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_40,QUANTIFIED] [2020-12-23 06:46:13,303 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_40,QUANTIFIED] [2020-12-23 06:46:13,303 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_40,QUANTIFIED] [2020-12-23 06:46:13,305 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_40,QUANTIFIED] [2020-12-23 06:46:13,305 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-23 06:46:13,305 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] [2020-12-23 06:46:13,305 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-23 06:46:13,305 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] [2020-12-23 06:46:13,306 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_40,QUANTIFIED] [2020-12-23 06:46:13,306 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_40,QUANTIFIED] [2020-12-23 06:46:13,306 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_40,QUANTIFIED] [2020-12-23 06:46:13,306 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_40,QUANTIFIED] [2020-12-23 06:46:13,306 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-23 06:46:13,307 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] [2020-12-23 06:46:13,307 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-23 06:46:13,307 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] [2020-12-23 06:46:13,307 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-23 06:46:13,308 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] [2020-12-23 06:46:13,308 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] [2020-12-23 06:46:13,308 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-23 06:46:13,308 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-23 06:46:13,308 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] [2020-12-23 06:46:13,309 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_40,QUANTIFIED] [2020-12-23 06:46:13,309 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_40,QUANTIFIED] [2020-12-23 06:46:13,309 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_40,QUANTIFIED] [2020-12-23 06:46:13,309 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_40,QUANTIFIED] [2020-12-23 06:46:13,315 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_40,QUANTIFIED] [2020-12-23 06:46:13,316 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_40,QUANTIFIED] [2020-12-23 06:46:13,317 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_40,QUANTIFIED] [2020-12-23 06:46:13,318 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_40,QUANTIFIED] [2020-12-23 06:46:13,318 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-23 06:46:13,318 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] [2020-12-23 06:46:13,318 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-23 06:46:13,318 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] [2020-12-23 06:46:13,319 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_40,QUANTIFIED] [2020-12-23 06:46:13,319 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_40,QUANTIFIED] [2020-12-23 06:46:13,319 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_40,QUANTIFIED] [2020-12-23 06:46:13,319 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_40,QUANTIFIED] [2020-12-23 06:46:13,320 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-23 06:46:13,320 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] [2020-12-23 06:46:13,320 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-23 06:46:13,321 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] [2020-12-23 06:46:13,321 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-23 06:46:13,321 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] [2020-12-23 06:46:13,321 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] [2020-12-23 06:46:13,322 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-23 06:46:13,322 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-23 06:46:13,322 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] [2020-12-23 06:46:13,322 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_40,QUANTIFIED] [2020-12-23 06:46:13,323 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_40,QUANTIFIED] [2020-12-23 06:46:13,323 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_40,QUANTIFIED] [2020-12-23 06:46:13,323 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_40,QUANTIFIED] Derived loop invariant: ((((((((((((((lh < n && unknown-#memory_int-unknown[array][0] == 0) && 3 == unknown-#memory_int-unknown[array][array + 12]) && !(array == array)) && array == 0) && (\exists v_ULTIMATE.start_main_~i~1_40 : int :: (unknown-#memory_int-unknown[array][v_ULTIMATE.start_main_~i~1_40 * 4 + array] == v_ULTIMATE.start_main_~i~1_40 && v_ULTIMATE.start_main_~i~1_40 <= 1) && i + 1 <= v_ULTIMATE.start_main_~i~1_40)) && array == 0) && lh + 1 <= i) && \valid[array] == 1) && (\exists #t~string0.base : int, #t~string1.base : int :: ((((#t~string0.base == 0 || #t~string1.base == 0) || array == 0) || \valid[0] == 0) && \valid[#t~string0.base] == 1) && \valid[#t~string1.base] == 1)) && 5 == n) && unknown-#memory_int-unknown[array][array + 4] == 1) && unknown-#memory_int-unknown[array][array + 16] == 4) && 2 == unknown-#memory_int-unknown[array][array + 8]) || (((((((((((((n <= lh && unknown-#memory_int-unknown[array][0] == 0) && 3 == unknown-#memory_int-unknown[array][array + 12]) && i <= lh + 1) && !(array == array)) && array == 0) && (\exists v_ULTIMATE.start_main_~i~1_40 : int :: (unknown-#memory_int-unknown[array][v_ULTIMATE.start_main_~i~1_40 * 4 + array] == v_ULTIMATE.start_main_~i~1_40 && v_ULTIMATE.start_main_~i~1_40 <= 1) && i + 1 <= v_ULTIMATE.start_main_~i~1_40)) && array == 0) && \valid[array] == 1) && (\exists #t~string0.base : int, #t~string1.base : int :: ((((#t~string0.base == 0 || #t~string1.base == 0) || array == 0) || \valid[0] == 0) && \valid[#t~string0.base] == 1) && \valid[#t~string1.base] == 1)) && 5 == n) && unknown-#memory_int-unknown[array][array + 4] == 1) && unknown-#memory_int-unknown[array][array + 16] == 4) && 2 == unknown-#memory_int-unknown[array][array + 8])) || (((((((((((((((((((unknown-#memory_int-unknown[array][0] == 0 && unknown-#memory_int-unknown[array][array + 16] == 0) && unknown-#memory_int-unknown[array][array] == 0) && 3 == unknown-#memory_int-unknown[array][array + 12]) && (\exists #t~string0.base : int, #t~string1.base : int :: (((((#t~string0.base == 0 || #t~string1.base == 0) || \valid[0] == 0) && !(#t~string1.base == array)) && \valid[#t~string0.base] == 1) && !(#t~string0.base == array)) && \valid[#t~string1.base] == 1)) && unknown-#memory_int-unknown[array][array + 12] == 0) && 0 <= array) && (\exists v_ULTIMATE.start_main_~i~1_40 : int :: (unknown-#memory_int-unknown[array][v_ULTIMATE.start_main_~i~1_40 * 4 + array] == v_ULTIMATE.start_main_~i~1_40 && v_ULTIMATE.start_main_~i~1_40 <= 1) && i + 1 <= v_ULTIMATE.start_main_~i~1_40)) && array == 0) && \valid[array] == 1) && 5 == n) && array <= 0) && unknown-#memory_int-unknown[array][array + 4] == 1) && 0 <= unknown-#memory_int-unknown[array][array + 4]) && lh == 0) && 1 < array) && 2 == unknown-#memory_int-unknown[array][array + 8]) && unknown-#memory_int-unknown[array][array + 16] == 4) && unknown-#memory_int-unknown[array][array + 4] <= 0) && 0 == unknown-#memory_int-unknown[array][array + 8]) - InvariantResult [Line: 14]: Loop Invariant [2020-12-23 06:46:13,325 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-23 06:46:13,325 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] [2020-12-23 06:46:13,326 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-23 06:46:13,326 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] [2020-12-23 06:46:13,326 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-23 06:46:13,326 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] [2020-12-23 06:46:13,327 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-23 06:46:13,327 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] [2020-12-23 06:46:13,328 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-23 06:46:13,329 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] [2020-12-23 06:46:13,329 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-23 06:46:13,329 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] [2020-12-23 06:46:13,329 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-23 06:46:13,329 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] [2020-12-23 06:46:13,330 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-23 06:46:13,330 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] Derived loop invariant: (((((((((((\valid[array] == 1 && 1 == cond) && (\exists #t~string0.base : int, #t~string1.base : int :: ((((#t~string0.base == 0 || #t~string1.base == 0) || array == 0) || \valid[0] == 0) && \valid[#t~string0.base] == 1) && \valid[#t~string1.base] == 1)) && 5 == n) && unknown-#memory_int-unknown[array][array + 4] == 1) && 3 == unknown-#memory_int-unknown[array][array + 12]) && unknown-#memory_int-unknown[array][array + 16] == 4) && 2 == unknown-#memory_int-unknown[array][array + 8]) && (((((((!(0 == cond) && n <= lh) && unknown-#memory_int-unknown[array][0] == 0) && i <= lh + 1) && 0 <= i) && 5 <= n) && i <= 4) || ((((((n <= lh && 1 == cond) && i == 0) && i <= lh + 1) && 0 <= i) && 5 <= n) && unknown-#memory_int-unknown[array][array + i * 4] == 0))) && !(array == array)) && array == 0) && array == 0) || (((((((((((\valid[array] == 1 && (\exists #t~string0.base : int, #t~string1.base : int :: ((((#t~string0.base == 0 || #t~string1.base == 0) || array == 0) || \valid[0] == 0) && \valid[#t~string0.base] == 1) && \valid[#t~string1.base] == 1)) && 5 == n) && unknown-#memory_int-unknown[array][array + 4] == 1) && 3 == unknown-#memory_int-unknown[array][array + 12]) && 3 <= i) && unknown-#memory_int-unknown[array][array + 16] == 4) && (((((((!(0 == cond) && n <= lh) && unknown-#memory_int-unknown[array][0] == 0) && i <= lh + 1) && 0 <= i) && 5 <= n) && i <= 4) || ((((((n <= lh && 1 == cond) && i == 0) && i <= lh + 1) && 0 <= i) && 5 <= n) && unknown-#memory_int-unknown[array][array + i * 4] == 0))) && 2 == unknown-#memory_int-unknown[array][array + 8]) && !(array == array)) && array == 0) && array == 0) - InvariantResult [Line: 32]: Loop Invariant [2020-12-23 06:46:13,331 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_40,QUANTIFIED] [2020-12-23 06:46:13,331 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_40,QUANTIFIED] [2020-12-23 06:46:13,331 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_40,QUANTIFIED] [2020-12-23 06:46:13,332 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_40,QUANTIFIED] [2020-12-23 06:46:13,332 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-23 06:46:13,332 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] [2020-12-23 06:46:13,332 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-23 06:46:13,332 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] [2020-12-23 06:46:13,333 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_40,QUANTIFIED] [2020-12-23 06:46:13,333 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_40,QUANTIFIED] [2020-12-23 06:46:13,333 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_40,QUANTIFIED] [2020-12-23 06:46:13,333 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_40,QUANTIFIED] [2020-12-23 06:46:13,333 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-23 06:46:13,333 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] [2020-12-23 06:46:13,334 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-23 06:46:13,334 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] [2020-12-23 06:46:13,336 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_40,QUANTIFIED] [2020-12-23 06:46:13,336 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_40,QUANTIFIED] [2020-12-23 06:46:13,336 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_40,QUANTIFIED] [2020-12-23 06:46:13,336 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_40,QUANTIFIED] [2020-12-23 06:46:13,337 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-23 06:46:13,337 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] [2020-12-23 06:46:13,337 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-23 06:46:13,337 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] [2020-12-23 06:46:13,337 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_40,QUANTIFIED] [2020-12-23 06:46:13,337 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_40,QUANTIFIED] [2020-12-23 06:46:13,338 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_40,QUANTIFIED] [2020-12-23 06:46:13,338 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_40,QUANTIFIED] [2020-12-23 06:46:13,338 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-23 06:46:13,338 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] [2020-12-23 06:46:13,338 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-23 06:46:13,339 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] Derived loop invariant: ((((((((((((((((lh < n && unknown-#memory_int-unknown[array][0] == 0) && 3 == unknown-#memory_int-unknown[array][array + 12]) && !(array == array)) && i <= lh + 1) && 0 <= array) && (\exists v_ULTIMATE.start_main_~i~1_40 : int :: (unknown-#memory_int-unknown[array][v_ULTIMATE.start_main_~i~1_40 * 4 + array] == v_ULTIMATE.start_main_~i~1_40 && v_ULTIMATE.start_main_~i~1_40 <= 1) && i + 1 <= v_ULTIMATE.start_main_~i~1_40)) && array == 0) && lh + 1 <= i) && \valid[array] == 1) && (\exists #t~string0.base : int, #t~string1.base : int :: ((((#t~string0.base == 0 || #t~string1.base == 0) || array == 0) || \valid[0] == 0) && \valid[#t~string0.base] == 1) && \valid[#t~string1.base] == 1)) && 5 == n) && unknown-#memory_int-unknown[array][rh * 4 + array] <= unknown-#memory_int-unknown[array][i * 4 + array + -4]) && array <= 0) && unknown-#memory_int-unknown[array][array + 4] == 1) && 2 == unknown-#memory_int-unknown[array][array + 8]) && unknown-#memory_int-unknown[array][array + 16] == 4) || (((((((((((((((unknown-#memory_int-unknown[array][0] == 0 && 3 == unknown-#memory_int-unknown[array][array + 12]) && !(array == array)) && 0 <= array) && (\exists v_ULTIMATE.start_main_~i~1_40 : int :: (unknown-#memory_int-unknown[array][v_ULTIMATE.start_main_~i~1_40 * 4 + array] == v_ULTIMATE.start_main_~i~1_40 && v_ULTIMATE.start_main_~i~1_40 <= 1) && i + 1 <= v_ULTIMATE.start_main_~i~1_40)) && array == 0) && lh + 2 <= i) && \valid[array] == 1) && (\exists #t~string0.base : int, #t~string1.base : int :: ((((#t~string0.base == 0 || #t~string1.base == 0) || array == 0) || \valid[0] == 0) && \valid[#t~string0.base] == 1) && \valid[#t~string1.base] == 1)) && 5 == n) && unknown-#memory_int-unknown[array][rh * 4 + array] <= unknown-#memory_int-unknown[array][i * 4 + array + -4]) && array <= 0) && unknown-#memory_int-unknown[array][array + 4] == 1) && 2 == unknown-#memory_int-unknown[array][array + 8]) && unknown-#memory_int-unknown[array][array + 16] == 4) && lh + 1 < n) - InvariantResult [Line: 49]: Loop Invariant [2020-12-23 06:46:13,340 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-23 06:46:13,340 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] [2020-12-23 06:46:13,340 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-23 06:46:13,340 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] [2020-12-23 06:46:13,340 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-23 06:46:13,341 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] [2020-12-23 06:46:13,341 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-23 06:46:13,341 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] [2020-12-23 06:46:13,341 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-23 06:46:13,341 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] [2020-12-23 06:46:13,342 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-23 06:46:13,342 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] [2020-12-23 06:46:13,343 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-23 06:46:13,343 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] [2020-12-23 06:46:13,343 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-23 06:46:13,343 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] [2020-12-23 06:46:13,343 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-23 06:46:13,344 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] [2020-12-23 06:46:13,344 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-23 06:46:13,344 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] [2020-12-23 06:46:13,344 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-23 06:46:13,344 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] [2020-12-23 06:46:13,344 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-23 06:46:13,345 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] Derived loop invariant: (((((((((((((((n <= lh && i == 0) && 3 == unknown-#memory_int-unknown[array][array + 12]) && i <= lh + 1) && !(array == array)) && 0 <= i) && array == 0) && array == 0) && \valid[array] == 1) && (\exists #t~string0.base : int, #t~string1.base : int :: ((((#t~string0.base == 0 || #t~string1.base == 0) || array == 0) || \valid[0] == 0) && \valid[#t~string0.base] == 1) && \valid[#t~string1.base] == 1)) && 5 == n) && unknown-#memory_int-unknown[array][array + 4] == 1) && unknown-#memory_int-unknown[array][array + 16] == 4) && 2 == unknown-#memory_int-unknown[array][array + 8]) && unknown-#memory_int-unknown[array][array + i * 4] == 0) || ((((((((((((((((!(0 == cond) && n <= lh) && unknown-#memory_int-unknown[array][0] == 0) && 3 == unknown-#memory_int-unknown[array][array + 12]) && i <= lh + 1) && !(array == array)) && 0 <= i) && array == 0) && array == 0) && \valid[array] == 1) && 1 == cond) && (\exists #t~string0.base : int, #t~string1.base : int :: ((((#t~string0.base == 0 || #t~string1.base == 0) || array == 0) || \valid[0] == 0) && \valid[#t~string0.base] == 1) && \valid[#t~string1.base] == 1)) && 5 == n) && unknown-#memory_int-unknown[array][array + 4] == 1) && unknown-#memory_int-unknown[array][array + 16] == 4) && 2 == unknown-#memory_int-unknown[array][array + 8]) && 5 <= n)) || ((((((((((((((((!(0 == cond) && n <= lh) && unknown-#memory_int-unknown[array][0] == 0) && 3 == unknown-#memory_int-unknown[array][array + 12]) && i <= lh + 1) && !(array == array)) && 0 <= i) && array == 0) && array == 0) && 4 <= i) && \valid[array] == 1) && (\exists #t~string0.base : int, #t~string1.base : int :: ((((#t~string0.base == 0 || #t~string1.base == 0) || array == 0) || \valid[0] == 0) && \valid[#t~string0.base] == 1) && \valid[#t~string1.base] == 1)) && 5 == n) && unknown-#memory_int-unknown[array][array + 4] == 1) && unknown-#memory_int-unknown[array][array + 16] == 4) && 2 == unknown-#memory_int-unknown[array][array + 8]) && 5 <= n) - InvariantResult [Line: 44]: Loop Invariant [2020-12-23 06:46:13,346 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-23 06:46:13,347 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] [2020-12-23 06:46:13,348 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] [2020-12-23 06:46:13,348 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-23 06:46:13,348 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-23 06:46:13,348 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] [2020-12-23 06:46:13,349 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-23 06:46:13,350 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] [2020-12-23 06:46:13,350 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] [2020-12-23 06:46:13,350 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-23 06:46:13,350 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-23 06:46:13,350 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] [2020-12-23 06:46:13,351 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-23 06:46:13,351 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] [2020-12-23 06:46:13,351 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] [2020-12-23 06:46:13,351 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-23 06:46:13,352 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-23 06:46:13,352 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] [2020-12-23 06:46:13,352 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_56,QUANTIFIED] [2020-12-23 06:46:13,352 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_56,QUANTIFIED] [2020-12-23 06:46:13,352 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_56,QUANTIFIED] [2020-12-23 06:46:13,353 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_56,QUANTIFIED] [2020-12-23 06:46:13,353 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_55,QUANTIFIED] [2020-12-23 06:46:13,353 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_55,QUANTIFIED] [2020-12-23 06:46:13,353 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_55,QUANTIFIED] [2020-12-23 06:46:13,353 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_55,QUANTIFIED] [2020-12-23 06:46:13,354 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-23 06:46:13,354 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] [2020-12-23 06:46:13,354 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] [2020-12-23 06:46:13,354 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-23 06:46:13,354 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-23 06:46:13,355 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] [2020-12-23 06:46:13,355 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_56,QUANTIFIED] [2020-12-23 06:46:13,355 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_56,QUANTIFIED] [2020-12-23 06:46:13,355 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_56,QUANTIFIED] [2020-12-23 06:46:13,355 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_55,QUANTIFIED] [2020-12-23 06:46:13,356 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_57,QUANTIFIED] [2020-12-23 06:46:13,356 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_56,QUANTIFIED] [2020-12-23 06:46:13,356 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_55,QUANTIFIED] [2020-12-23 06:46:13,356 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_55,QUANTIFIED] [2020-12-23 06:46:13,356 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_57,QUANTIFIED] [2020-12-23 06:46:13,357 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_57,QUANTIFIED] [2020-12-23 06:46:13,357 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_55,QUANTIFIED] [2020-12-23 06:46:13,357 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_57,QUANTIFIED] [2020-12-23 06:46:13,357 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-23 06:46:13,357 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] [2020-12-23 06:46:13,358 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] [2020-12-23 06:46:13,358 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-23 06:46:13,358 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-23 06:46:13,358 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] [2020-12-23 06:46:13,359 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_40,QUANTIFIED] [2020-12-23 06:46:13,359 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_40,QUANTIFIED] [2020-12-23 06:46:13,359 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_40,QUANTIFIED] [2020-12-23 06:46:13,359 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_40,QUANTIFIED] [2020-12-23 06:46:13,359 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-23 06:46:13,360 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] [2020-12-23 06:46:13,360 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] [2020-12-23 06:46:13,360 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-23 06:46:13,360 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-23 06:46:13,360 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] [2020-12-23 06:46:13,363 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-23 06:46:13,364 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] [2020-12-23 06:46:13,364 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] [2020-12-23 06:46:13,364 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-23 06:46:13,364 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-23 06:46:13,365 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] [2020-12-23 06:46:13,365 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-23 06:46:13,365 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] [2020-12-23 06:46:13,365 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] [2020-12-23 06:46:13,365 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-23 06:46:13,366 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-23 06:46:13,366 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] [2020-12-23 06:46:13,366 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-23 06:46:13,366 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] [2020-12-23 06:46:13,367 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] [2020-12-23 06:46:13,367 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-23 06:46:13,367 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-23 06:46:13,367 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] [2020-12-23 06:46:13,368 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_56,QUANTIFIED] [2020-12-23 06:46:13,368 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_56,QUANTIFIED] [2020-12-23 06:46:13,368 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_56,QUANTIFIED] [2020-12-23 06:46:13,368 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_56,QUANTIFIED] [2020-12-23 06:46:13,368 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_55,QUANTIFIED] [2020-12-23 06:46:13,368 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_55,QUANTIFIED] [2020-12-23 06:46:13,369 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_55,QUANTIFIED] [2020-12-23 06:46:13,369 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_55,QUANTIFIED] [2020-12-23 06:46:13,369 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-23 06:46:13,369 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] [2020-12-23 06:46:13,370 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] [2020-12-23 06:46:13,370 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-23 06:46:13,370 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-23 06:46:13,370 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] [2020-12-23 06:46:13,370 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_56,QUANTIFIED] [2020-12-23 06:46:13,371 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_56,QUANTIFIED] [2020-12-23 06:46:13,371 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_56,QUANTIFIED] [2020-12-23 06:46:13,371 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_55,QUANTIFIED] [2020-12-23 06:46:13,371 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_57,QUANTIFIED] [2020-12-23 06:46:13,371 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_56,QUANTIFIED] [2020-12-23 06:46:13,372 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_55,QUANTIFIED] [2020-12-23 06:46:13,372 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_55,QUANTIFIED] [2020-12-23 06:46:13,372 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_57,QUANTIFIED] [2020-12-23 06:46:13,372 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_57,QUANTIFIED] [2020-12-23 06:46:13,372 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_55,QUANTIFIED] [2020-12-23 06:46:13,372 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_57,QUANTIFIED] [2020-12-23 06:46:13,373 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-23 06:46:13,373 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] [2020-12-23 06:46:13,373 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] [2020-12-23 06:46:13,373 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-23 06:46:13,374 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-23 06:46:13,374 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] [2020-12-23 06:46:13,374 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_40,QUANTIFIED] [2020-12-23 06:46:13,374 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_40,QUANTIFIED] [2020-12-23 06:46:13,374 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_40,QUANTIFIED] [2020-12-23 06:46:13,375 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1_40,QUANTIFIED] [2020-12-23 06:46:13,375 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-23 06:46:13,375 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] [2020-12-23 06:46:13,375 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] [2020-12-23 06:46:13,375 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-23 06:46:13,376 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string0.base,QUANTIFIED] [2020-12-23 06:46:13,376 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[#t~string1.base,QUANTIFIED] Derived loop invariant: (((((((((((((((((unknown-#memory_int-unknown[array][array + 16] == 0 && unknown-#memory_int-unknown[array][array] == 0) && (\exists #t~string0.base : int, #t~string1.base : int :: (((((#t~string0.base == 0 || #t~string1.base == 0) || \valid[0] == 0) && !(#t~string1.base == array)) && \valid[#t~string0.base] == 1) && !(#t~string0.base == array)) && \valid[#t~string1.base] == 1)) && unknown-#memory_int-unknown[array][array + 12] == 0) && !(array == array)) && array == 0) && array == 0) && \valid[array] == 1) && 5 == n) && 0 <= unknown-#memory_int-unknown[array][array + 4]) && 1 < array) && unknown-#memory_int-unknown[array][array + 4] <= 0) && i == 4) && 0 == unknown-#memory_int-unknown[array][array + 8]) || ((((((((((((((unknown-#memory_int-unknown[array][array + 16] == 0 && unknown-#memory_int-unknown[array][array] == 0) && 3 == unknown-#memory_int-unknown[array][array + 12]) && (\exists #t~string0.base : int, #t~string1.base : int :: (((((#t~string0.base == 0 || #t~string1.base == 0) || \valid[0] == 0) && !(#t~string1.base == array)) && \valid[#t~string0.base] == 1) && !(#t~string0.base == array)) && \valid[#t~string1.base] == 1)) && unknown-#memory_int-unknown[array][array + 12] == 0) && array == 0) && array == 0) && \valid[array] == 1) && 5 == n) && i == 2) && 0 <= unknown-#memory_int-unknown[array][array + 4]) && 1 < array) && unknown-#memory_int-unknown[array][array + 16] == 4) && unknown-#memory_int-unknown[array][array + 4] <= 0) && 0 == unknown-#memory_int-unknown[array][array + 8])) || (((((((((((((((unknown-#memory_int-unknown[array][array + 16] == 0 && unknown-#memory_int-unknown[array][array] == 0) && (\exists #t~string0.base : int, #t~string1.base : int :: (((((#t~string0.base == 0 || #t~string1.base == 0) || \valid[0] == 0) && !(#t~string1.base == array)) && \valid[#t~string0.base] == 1) && !(#t~string0.base == array)) && \valid[#t~string1.base] == 1)) && unknown-#memory_int-unknown[array][array + 12] == 0) && i + 1 <= (array + array * -1 + 8) / 4) && (\exists v_ULTIMATE.start_main_~i~1_56 : int, v_ULTIMATE.start_main_~i~1_55 : int :: (((unknown-#memory_int-unknown[array][array + v_ULTIMATE.start_main_~i~1_56 * 4] == v_ULTIMATE.start_main_~i~1_56 && i + 1 <= v_ULTIMATE.start_main_~i~1_56) && v_ULTIMATE.start_main_~i~1_56 + 1 <= v_ULTIMATE.start_main_~i~1_55) && unknown-#memory_int-unknown[array][array + v_ULTIMATE.start_main_~i~1_55 * 4] == v_ULTIMATE.start_main_~i~1_55) && v_ULTIMATE.start_main_~i~1_55 <= 3)) && array == 0) && \valid[array] == 1) && 1 <= i) && 5 == n) && array <= 0) && 0 <= unknown-#memory_int-unknown[array][array + 4]) && 1 < array) && unknown-#memory_int-unknown[array][array + 16] == 4) && unknown-#memory_int-unknown[array][array + 4] <= 0) && 0 == unknown-#memory_int-unknown[array][array + 8])) || (((((((((((((((i == 0 && unknown-#memory_int-unknown[array][array + 16] == 0) && unknown-#memory_int-unknown[array][array] == 0) && (\exists #t~string0.base : int, #t~string1.base : int :: (((((#t~string0.base == 0 || #t~string1.base == 0) || \valid[0] == 0) && !(#t~string1.base == array)) && \valid[#t~string0.base] == 1) && !(#t~string0.base == array)) && \valid[#t~string1.base] == 1)) && unknown-#memory_int-unknown[array][array + 12] == 0) && 0 <= array) && (\exists v_ULTIMATE.start_main_~i~1_57 : int, v_ULTIMATE.start_main_~i~1_56 : int, v_ULTIMATE.start_main_~i~1_55 : int :: (((((unknown-#memory_int-unknown[array][array + v_ULTIMATE.start_main_~i~1_56 * 4] == v_ULTIMATE.start_main_~i~1_56 && v_ULTIMATE.start_main_~i~1_56 + 1 <= v_ULTIMATE.start_main_~i~1_55) && v_ULTIMATE.start_main_~i~1_57 + 1 <= v_ULTIMATE.start_main_~i~1_56) && unknown-#memory_int-unknown[array][array + v_ULTIMATE.start_main_~i~1_55 * 4] == v_ULTIMATE.start_main_~i~1_55) && unknown-#memory_int-unknown[array][array + v_ULTIMATE.start_main_~i~1_57 * 4] == v_ULTIMATE.start_main_~i~1_57) && v_ULTIMATE.start_main_~i~1_55 <= 3) && i + 1 <= v_ULTIMATE.start_main_~i~1_57)) && array == 0) && \valid[array] == 1) && 5 == n) && array <= 0) && 0 <= unknown-#memory_int-unknown[array][array + 4]) && 1 < array) && unknown-#memory_int-unknown[array][array + 16] == 4) && unknown-#memory_int-unknown[array][array + 4] <= 0) && 0 == unknown-#memory_int-unknown[array][array + 8])) || ((((((((((((((((((unknown-#memory_int-unknown[array][0] == 0 && unknown-#memory_int-unknown[array][array + 16] == 0) && unknown-#memory_int-unknown[array][array] == 0) && 3 == unknown-#memory_int-unknown[array][array + 12]) && (\exists #t~string0.base : int, #t~string1.base : int :: (((((#t~string0.base == 0 || #t~string1.base == 0) || \valid[0] == 0) && !(#t~string1.base == array)) && \valid[#t~string0.base] == 1) && !(#t~string0.base == array)) && \valid[#t~string1.base] == 1)) && unknown-#memory_int-unknown[array][array + 12] == 0) && 0 <= array) && (\exists v_ULTIMATE.start_main_~i~1_40 : int :: (unknown-#memory_int-unknown[array][v_ULTIMATE.start_main_~i~1_40 * 4 + array] == v_ULTIMATE.start_main_~i~1_40 && v_ULTIMATE.start_main_~i~1_40 <= 1) && i + 1 <= v_ULTIMATE.start_main_~i~1_40)) && array == 0) && \valid[array] == 1) && 5 == n) && array <= 0) && unknown-#memory_int-unknown[array][array + 4] == 1) && 0 <= unknown-#memory_int-unknown[array][array + 4]) && 1 < array) && 2 == unknown-#memory_int-unknown[array][array + 8]) && unknown-#memory_int-unknown[array][array + 16] == 4) && unknown-#memory_int-unknown[array][array + 4] <= 0) && 0 == unknown-#memory_int-unknown[array][array + 8])) || (((((((((((((((unknown-#memory_int-unknown[array][array + 16] == 0 && unknown-#memory_int-unknown[array][array] == 0) && (\exists #t~string0.base : int, #t~string1.base : int :: (((((#t~string0.base == 0 || #t~string1.base == 0) || \valid[0] == 0) && !(#t~string1.base == array)) && \valid[#t~string0.base] == 1) && !(#t~string0.base == array)) && \valid[#t~string1.base] == 1)) && unknown-#memory_int-unknown[array][array + 12] == 0) && i <= 3) && 0 <= array) && array == 0) && \valid[array] == 1) && 5 == n) && array <= 0) && 0 <= unknown-#memory_int-unknown[array][array + 4]) && 1 < array) && 3 <= i) && unknown-#memory_int-unknown[array][array + 16] == 4) && unknown-#memory_int-unknown[array][array + 4] <= 0) && 0 == unknown-#memory_int-unknown[array][array + 8]) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 22 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 179.4s, OverallIterations: 23, TraceHistogramMax: 10, AutomataDifference: 117.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 37.5s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 421 SDtfs, 2543 SDslu, 3039 SDs, 0 SdLazy, 7071 SolverSat, 1174 SolverUnsat, 14 SolverUnknown, 0 SolverNotchecked, 42.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1788 GetRequests, 1051 SyntacticMatches, 47 SemanticMatches, 690 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9339 ImplicationChecksByTransitivity, 106.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=270occurred in iteration=22, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 23 MinimizatonAttempts, 352 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 5 LocationsWithAnnotation, 5 PreInvPairs, 113 NumberOfFragments, 2177 HoareAnnotationTreeSize, 5 FomulaSimplifications, 517337 FormulaSimplificationTreeSizeReduction, 2.3s HoareSimplificationTime, 5 FomulaSimplificationsInter, 365773 FormulaSimplificationTreeSizeReductionInter, 35.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 2.3s SatisfiabilityAnalysisTime, 52.7s InterpolantComputationTime, 2397 NumberOfCodeBlocks, 2250 NumberOfCodeBlocksAsserted, 90 NumberOfCheckSat, 2354 ConstructedInterpolants, 251 QuantifiedInterpolants, 2438116 SizeOfPredicates, 224 NumberOfNonLiveVariables, 3578 ConjunctsInSsa, 425 ConjunctsInUnsatCore, 43 InterpolantComputations, 5 PerfectInterpolantSequences, 5396/6849 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! [MP z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process Received shutdown request...