/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/reducercommutativity/sum05-2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-178dd20 [2021-01-06 10:15:52,534 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-01-06 10:15:52,537 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-01-06 10:15:52,591 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-01-06 10:15:52,592 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-01-06 10:15:52,598 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-01-06 10:15:52,602 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-01-06 10:15:52,609 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-01-06 10:15:52,612 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-01-06 10:15:52,619 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-01-06 10:15:52,623 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-01-06 10:15:52,625 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-01-06 10:15:52,625 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-01-06 10:15:52,629 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-01-06 10:15:52,632 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-01-06 10:15:52,634 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-01-06 10:15:52,636 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-01-06 10:15:52,639 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-01-06 10:15:52,648 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-01-06 10:15:52,657 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-01-06 10:15:52,659 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-01-06 10:15:52,661 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-01-06 10:15:52,663 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-01-06 10:15:52,666 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-01-06 10:15:52,675 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-01-06 10:15:52,676 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-01-06 10:15:52,676 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-01-06 10:15:52,679 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-01-06 10:15:52,680 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-01-06 10:15:52,681 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-01-06 10:15:52,682 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-01-06 10:15:52,683 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-01-06 10:15:52,685 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-01-06 10:15:52,686 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-01-06 10:15:52,688 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-01-06 10:15:52,688 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-01-06 10:15:52,689 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-01-06 10:15:52,697 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-01-06 10:15:52,698 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-01-06 10:15:52,699 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-01-06 10:15:52,700 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-01-06 10:15:52,701 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-01-06 10:15:52,773 INFO L113 SettingsManager]: Loading preferences was successful [2021-01-06 10:15:52,774 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-01-06 10:15:52,776 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-01-06 10:15:52,776 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-01-06 10:15:52,777 INFO L138 SettingsManager]: * Use SBE=true [2021-01-06 10:15:52,777 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-01-06 10:15:52,777 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-01-06 10:15:52,778 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-01-06 10:15:52,778 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-01-06 10:15:52,778 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-01-06 10:15:52,779 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-01-06 10:15:52,779 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-01-06 10:15:52,779 INFO L138 SettingsManager]: * Use constant arrays=true [2021-01-06 10:15:52,779 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-01-06 10:15:52,780 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-01-06 10:15:52,780 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-01-06 10:15:52,780 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-01-06 10:15:52,781 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-06 10:15:52,781 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-01-06 10:15:52,781 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-01-06 10:15:52,782 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-01-06 10:15:52,782 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-01-06 10:15:52,783 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-01-06 10:15:52,783 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-01-06 10:15:52,783 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-01-06 10:15:52,783 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-01-06 10:15:53,229 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-01-06 10:15:53,260 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-01-06 10:15:53,262 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-01-06 10:15:53,264 INFO L271 PluginConnector]: Initializing CDTParser... [2021-01-06 10:15:53,264 INFO L275 PluginConnector]: CDTParser initialized [2021-01-06 10:15:53,265 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/reducercommutativity/sum05-2.i [2021-01-06 10:15:53,340 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/793c165ab/a9315a9ddac745e8bd5900d94aa06b55/FLAGe3490a2f4 [2021-01-06 10:15:54,002 INFO L306 CDTParser]: Found 1 translation units. [2021-01-06 10:15:54,003 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/reducercommutativity/sum05-2.i [2021-01-06 10:15:54,011 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/793c165ab/a9315a9ddac745e8bd5900d94aa06b55/FLAGe3490a2f4 [2021-01-06 10:15:54,332 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/793c165ab/a9315a9ddac745e8bd5900d94aa06b55 [2021-01-06 10:15:54,339 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-01-06 10:15:54,344 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-01-06 10:15:54,346 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-01-06 10:15:54,346 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-01-06 10:15:54,350 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-01-06 10:15:54,351 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 10:15:54" (1/1) ... [2021-01-06 10:15:54,353 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@45e75ad2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 10:15:54, skipping insertion in model container [2021-01-06 10:15:54,353 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 10:15:54" (1/1) ... [2021-01-06 10:15:54,362 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-01-06 10:15:54,379 INFO L178 MainTranslator]: Built tables and reachable declarations left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~i~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: ArrayLHS[VariableLHS[~x~0,],[IdentifierExpression[~i~1,]]] left hand side expression in assignment: lhs: VariableLHS[~ret~1,] left hand side expression in assignment: lhs: VariableLHS[~temp~0,] left hand side expression in assignment: lhs: ArrayLHS[VariableLHS[~x~0,],[IntegerLiteral[0]]] left hand side expression in assignment: lhs: ArrayLHS[VariableLHS[~x~0,],[IntegerLiteral[1]]] left hand side expression in assignment: lhs: VariableLHS[~ret2~0,] left hand side expression in assignment: lhs: VariableLHS[~temp~0,] left hand side expression in assignment: lhs: ArrayLHS[VariableLHS[~x~0,],[IdentifierExpression[~i~2,]]] left hand side expression in assignment: lhs: ArrayLHS[VariableLHS[~x~0,],[IntegerLiteral[4]]] left hand side expression in assignment: lhs: VariableLHS[~ret5~0,] [2021-01-06 10:15:54,548 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/reducercommutativity/sum05-2.i[1271,1284] [2021-01-06 10:15:54,552 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 10:15:54,561 INFO L203 MainTranslator]: Completed pre-run left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~i~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#x~0,],base],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[~#x~0,],offset],BinaryExpression[ARITHMUL,IntegerLiteral[4],IdentifierExpression[~i~1,]]]]] left hand side expression in assignment: lhs: VariableLHS[~ret~1,] left hand side expression in assignment: lhs: VariableLHS[~temp~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#x~0,],base],StructAccessExpression[IdentifierExpression[~#x~0,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#x~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[4],StructAccessExpression[IdentifierExpression[~#x~0,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~ret2~0,] left hand side expression in assignment: lhs: VariableLHS[~temp~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#x~0,],base],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[~#x~0,],offset],BinaryExpression[ARITHMUL,IntegerLiteral[4],IdentifierExpression[~i~2,]]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#x~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~#x~0,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~ret5~0,] [2021-01-06 10:15:54,588 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/reducercommutativity/sum05-2.i[1271,1284] [2021-01-06 10:15:54,590 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 10:15:54,609 INFO L208 MainTranslator]: Completed translation [2021-01-06 10:15:54,609 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 10:15:54 WrapperNode [2021-01-06 10:15:54,610 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-01-06 10:15:54,611 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-01-06 10:15:54,612 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-01-06 10:15:54,612 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-01-06 10:15:54,622 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 10:15:54" (1/1) ... [2021-01-06 10:15:54,632 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 10:15:54" (1/1) ... [2021-01-06 10:15:54,681 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-01-06 10:15:54,685 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-01-06 10:15:54,685 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-01-06 10:15:54,685 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-01-06 10:15:54,697 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 10:15:54" (1/1) ... [2021-01-06 10:15:54,697 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 10:15:54" (1/1) ... [2021-01-06 10:15:54,705 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 10:15:54" (1/1) ... [2021-01-06 10:15:54,706 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 10:15:54" (1/1) ... [2021-01-06 10:15:54,727 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 10:15:54" (1/1) ... [2021-01-06 10:15:54,737 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 10:15:54" (1/1) ... [2021-01-06 10:15:54,744 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 10:15:54" (1/1) ... [2021-01-06 10:15:54,753 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-01-06 10:15:54,757 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-01-06 10:15:54,757 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-01-06 10:15:54,757 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-01-06 10:15:54,759 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 10:15:54" (1/1) ... No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-06 10:15:54,883 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-01-06 10:15:54,884 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-01-06 10:15:54,884 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-01-06 10:15:54,884 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-01-06 10:15:54,884 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-01-06 10:15:54,885 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-01-06 10:15:54,885 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-01-06 10:15:55,502 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-01-06 10:15:55,502 INFO L299 CfgBuilder]: Removed 15 assume(true) statements. [2021-01-06 10:15:55,504 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 10:15:55 BoogieIcfgContainer [2021-01-06 10:15:55,504 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-01-06 10:15:55,506 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-01-06 10:15:55,506 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-01-06 10:15:55,510 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-01-06 10:15:55,510 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.01 10:15:54" (1/3) ... [2021-01-06 10:15:55,511 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5206b344 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 10:15:55, skipping insertion in model container [2021-01-06 10:15:55,511 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 10:15:54" (2/3) ... [2021-01-06 10:15:55,512 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5206b344 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 10:15:55, skipping insertion in model container [2021-01-06 10:15:55,512 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 10:15:55" (3/3) ... [2021-01-06 10:15:55,514 INFO L111 eAbstractionObserver]: Analyzing ICFG sum05-2.i [2021-01-06 10:15:55,521 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-01-06 10:15:55,526 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2021-01-06 10:15:55,547 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-01-06 10:15:55,576 INFO L377 AbstractCegarLoop]: Interprodecural is true [2021-01-06 10:15:55,576 INFO L378 AbstractCegarLoop]: Hoare is true [2021-01-06 10:15:55,576 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-01-06 10:15:55,576 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-01-06 10:15:55,576 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-01-06 10:15:55,577 INFO L382 AbstractCegarLoop]: Difference is false [2021-01-06 10:15:55,577 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-01-06 10:15:55,577 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-01-06 10:15:55,593 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states. [2021-01-06 10:15:55,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-01-06 10:15:55,600 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 10:15:55,600 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 10:15:55,601 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 10:15:55,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 10:15:55,608 INFO L82 PathProgramCache]: Analyzing trace with hash 1858201700, now seen corresponding path program 1 times [2021-01-06 10:15:55,618 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 10:15:55,619 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721576215] [2021-01-06 10:15:55,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 10:15:55,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 10:15:55,887 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 10:15:55,888 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721576215] [2021-01-06 10:15:55,889 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 10:15:55,889 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 10:15:55,890 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109121537] [2021-01-06 10:15:55,895 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 10:15:55,895 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 10:15:55,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 10:15:55,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 10:15:55,921 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 3 states. [2021-01-06 10:15:55,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 10:15:55,989 INFO L93 Difference]: Finished difference Result 52 states and 72 transitions. [2021-01-06 10:15:55,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 10:15:55,993 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2021-01-06 10:15:55,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 10:15:56,020 INFO L225 Difference]: With dead ends: 52 [2021-01-06 10:15:56,020 INFO L226 Difference]: Without dead ends: 25 [2021-01-06 10:15:56,023 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 10:15:56,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2021-01-06 10:15:56,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2021-01-06 10:15:56,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2021-01-06 10:15:56,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2021-01-06 10:15:56,072 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 17 [2021-01-06 10:15:56,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 10:15:56,072 INFO L481 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2021-01-06 10:15:56,073 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 10:15:56,073 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2021-01-06 10:15:56,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-01-06 10:15:56,075 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 10:15:56,076 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 10:15:56,076 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-01-06 10:15:56,077 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 10:15:56,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 10:15:56,081 INFO L82 PathProgramCache]: Analyzing trace with hash 290125730, now seen corresponding path program 1 times [2021-01-06 10:15:56,081 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 10:15:56,082 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746539523] [2021-01-06 10:15:56,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 10:15:56,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 10:15:56,214 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 10:15:56,216 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1746539523] [2021-01-06 10:15:56,218 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [271851727] [2021-01-06 10:15:56,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 10:15:56,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 10:15:56,377 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 2 conjunts are in the unsatisfiable core [2021-01-06 10:15:56,384 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 10:15:56,441 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-01-06 10:15:56,442 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-01-06 10:15:56,442 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2021-01-06 10:15:56,444 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015030230] [2021-01-06 10:15:56,445 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 10:15:56,445 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 10:15:56,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 10:15:56,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-01-06 10:15:56,447 INFO L87 Difference]: Start difference. First operand 24 states and 28 transitions. Second operand 3 states. [2021-01-06 10:15:56,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 10:15:56,515 INFO L93 Difference]: Finished difference Result 46 states and 55 transitions. [2021-01-06 10:15:56,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 10:15:56,516 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2021-01-06 10:15:56,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 10:15:56,517 INFO L225 Difference]: With dead ends: 46 [2021-01-06 10:15:56,517 INFO L226 Difference]: Without dead ends: 30 [2021-01-06 10:15:56,519 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-01-06 10:15:56,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2021-01-06 10:15:56,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 27. [2021-01-06 10:15:56,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2021-01-06 10:15:56,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2021-01-06 10:15:56,525 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 19 [2021-01-06 10:15:56,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 10:15:56,525 INFO L481 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2021-01-06 10:15:56,525 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 10:15:56,526 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2021-01-06 10:15:56,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-01-06 10:15:56,526 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 10:15:56,527 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 10:15:56,741 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2021-01-06 10:15:56,742 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 10:15:56,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 10:15:56,743 INFO L82 PathProgramCache]: Analyzing trace with hash 1760334112, now seen corresponding path program 1 times [2021-01-06 10:15:56,744 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 10:15:56,744 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411067536] [2021-01-06 10:15:56,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 10:15:56,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 10:15:56,791 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-01-06 10:15:56,791 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411067536] [2021-01-06 10:15:56,792 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2069375187] [2021-01-06 10:15:56,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 10:15:56,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 10:15:56,886 INFO L263 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 2 conjunts are in the unsatisfiable core [2021-01-06 10:15:56,889 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 10:15:56,924 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-01-06 10:15:56,925 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-01-06 10:15:56,925 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2021-01-06 10:15:56,925 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240096009] [2021-01-06 10:15:56,926 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 10:15:56,926 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 10:15:56,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 10:15:56,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-01-06 10:15:56,928 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand 3 states. [2021-01-06 10:15:56,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 10:15:56,945 INFO L93 Difference]: Finished difference Result 38 states and 43 transitions. [2021-01-06 10:15:56,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 10:15:56,946 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2021-01-06 10:15:56,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 10:15:56,947 INFO L225 Difference]: With dead ends: 38 [2021-01-06 10:15:56,947 INFO L226 Difference]: Without dead ends: 29 [2021-01-06 10:15:56,948 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-01-06 10:15:56,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2021-01-06 10:15:56,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2021-01-06 10:15:56,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2021-01-06 10:15:56,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2021-01-06 10:15:56,955 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 25 [2021-01-06 10:15:56,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 10:15:56,955 INFO L481 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2021-01-06 10:15:56,955 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 10:15:56,956 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2021-01-06 10:15:56,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-01-06 10:15:56,957 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 10:15:56,957 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 10:15:57,167 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 10:15:57,168 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 10:15:57,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 10:15:57,170 INFO L82 PathProgramCache]: Analyzing trace with hash 1208457118, now seen corresponding path program 1 times [2021-01-06 10:15:57,171 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 10:15:57,172 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032804830] [2021-01-06 10:15:57,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 10:15:57,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 10:15:57,244 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-01-06 10:15:57,244 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032804830] [2021-01-06 10:15:57,245 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1340519190] [2021-01-06 10:15:57,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 10:15:57,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 10:15:57,344 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 3 conjunts are in the unsatisfiable core [2021-01-06 10:15:57,347 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 10:15:57,413 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-01-06 10:15:57,414 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 10:15:57,414 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2021-01-06 10:15:57,415 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753146867] [2021-01-06 10:15:57,415 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 10:15:57,415 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 10:15:57,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 10:15:57,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-01-06 10:15:57,417 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand 5 states. [2021-01-06 10:15:57,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 10:15:57,441 INFO L93 Difference]: Finished difference Result 54 states and 62 transitions. [2021-01-06 10:15:57,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 10:15:57,442 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2021-01-06 10:15:57,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 10:15:57,443 INFO L225 Difference]: With dead ends: 54 [2021-01-06 10:15:57,443 INFO L226 Difference]: Without dead ends: 31 [2021-01-06 10:15:57,444 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-01-06 10:15:57,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2021-01-06 10:15:57,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2021-01-06 10:15:57,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2021-01-06 10:15:57,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2021-01-06 10:15:57,450 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 27 [2021-01-06 10:15:57,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 10:15:57,450 INFO L481 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2021-01-06 10:15:57,450 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 10:15:57,450 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2021-01-06 10:15:57,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-01-06 10:15:57,451 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 10:15:57,452 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 10:15:57,665 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 10:15:57,666 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 10:15:57,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 10:15:57,666 INFO L82 PathProgramCache]: Analyzing trace with hash -1993526948, now seen corresponding path program 2 times [2021-01-06 10:15:57,667 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 10:15:57,667 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152763270] [2021-01-06 10:15:57,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 10:15:57,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 10:15:57,722 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-01-06 10:15:57,723 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152763270] [2021-01-06 10:15:57,723 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [172870950] [2021-01-06 10:15:57,723 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 10:15:57,799 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-01-06 10:15:57,800 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-06 10:15:57,801 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 3 conjunts are in the unsatisfiable core [2021-01-06 10:15:57,804 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 10:15:57,850 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-01-06 10:15:57,851 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 10:15:57,851 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2021-01-06 10:15:57,852 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112006824] [2021-01-06 10:15:57,852 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-06 10:15:57,852 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 10:15:57,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-06 10:15:57,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-01-06 10:15:57,854 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand 6 states. [2021-01-06 10:15:57,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 10:15:57,944 INFO L93 Difference]: Finished difference Result 61 states and 71 transitions. [2021-01-06 10:15:57,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-06 10:15:57,945 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 29 [2021-01-06 10:15:57,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 10:15:57,946 INFO L225 Difference]: With dead ends: 61 [2021-01-06 10:15:57,947 INFO L226 Difference]: Without dead ends: 42 [2021-01-06 10:15:57,947 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-01-06 10:15:57,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2021-01-06 10:15:57,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 38. [2021-01-06 10:15:57,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2021-01-06 10:15:57,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2021-01-06 10:15:57,957 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 29 [2021-01-06 10:15:57,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 10:15:57,958 INFO L481 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2021-01-06 10:15:57,958 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-06 10:15:57,958 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2021-01-06 10:15:57,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-01-06 10:15:57,959 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 10:15:57,959 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 10:15:58,172 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 10:15:58,173 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 10:15:58,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 10:15:58,174 INFO L82 PathProgramCache]: Analyzing trace with hash 1059243608, now seen corresponding path program 3 times [2021-01-06 10:15:58,175 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 10:15:58,175 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444490952] [2021-01-06 10:15:58,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 10:15:58,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 10:15:58,259 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-01-06 10:15:58,260 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444490952] [2021-01-06 10:15:58,260 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [927635978] [2021-01-06 10:15:58,260 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 10:15:58,351 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-01-06 10:15:58,352 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-06 10:15:58,353 INFO L263 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 4 conjunts are in the unsatisfiable core [2021-01-06 10:15:58,356 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 10:15:58,446 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-01-06 10:15:58,447 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 10:15:58,447 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2021-01-06 10:15:58,447 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381865476] [2021-01-06 10:15:58,448 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-01-06 10:15:58,448 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 10:15:58,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-01-06 10:15:58,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2021-01-06 10:15:58,449 INFO L87 Difference]: Start difference. First operand 38 states and 42 transitions. Second operand 8 states. [2021-01-06 10:15:58,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 10:15:58,554 INFO L93 Difference]: Finished difference Result 81 states and 92 transitions. [2021-01-06 10:15:58,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-01-06 10:15:58,555 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 37 [2021-01-06 10:15:58,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 10:15:58,556 INFO L225 Difference]: With dead ends: 81 [2021-01-06 10:15:58,556 INFO L226 Difference]: Without dead ends: 50 [2021-01-06 10:15:58,557 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2021-01-06 10:15:58,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2021-01-06 10:15:58,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 46. [2021-01-06 10:15:58,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2021-01-06 10:15:58,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 50 transitions. [2021-01-06 10:15:58,566 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 50 transitions. Word has length 37 [2021-01-06 10:15:58,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 10:15:58,566 INFO L481 AbstractCegarLoop]: Abstraction has 46 states and 50 transitions. [2021-01-06 10:15:58,566 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2021-01-06 10:15:58,566 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 50 transitions. [2021-01-06 10:15:58,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-01-06 10:15:58,568 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 10:15:58,568 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 10:15:58,782 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2021-01-06 10:15:58,783 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 10:15:58,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 10:15:58,784 INFO L82 PathProgramCache]: Analyzing trace with hash -1892525292, now seen corresponding path program 4 times [2021-01-06 10:15:58,785 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 10:15:58,785 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715739408] [2021-01-06 10:15:58,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 10:15:58,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 10:15:58,881 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2021-01-06 10:15:58,882 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715739408] [2021-01-06 10:15:58,882 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [373985590] [2021-01-06 10:15:58,882 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 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 10:15:58,950 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-01-06 10:15:58,950 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-06 10:15:58,951 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 5 conjunts are in the unsatisfiable core [2021-01-06 10:15:58,954 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 10:15:59,063 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2021-01-06 10:15:59,064 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 10:15:59,064 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2021-01-06 10:15:59,064 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994606580] [2021-01-06 10:15:59,065 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-01-06 10:15:59,065 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 10:15:59,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-01-06 10:15:59,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2021-01-06 10:15:59,066 INFO L87 Difference]: Start difference. First operand 46 states and 50 transitions. Second operand 10 states. [2021-01-06 10:15:59,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 10:15:59,176 INFO L93 Difference]: Finished difference Result 95 states and 106 transitions. [2021-01-06 10:15:59,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-01-06 10:15:59,177 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 45 [2021-01-06 10:15:59,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 10:15:59,178 INFO L225 Difference]: With dead ends: 95 [2021-01-06 10:15:59,178 INFO L226 Difference]: Without dead ends: 58 [2021-01-06 10:15:59,179 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2021-01-06 10:15:59,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2021-01-06 10:15:59,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 54. [2021-01-06 10:15:59,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2021-01-06 10:15:59,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 58 transitions. [2021-01-06 10:15:59,186 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 58 transitions. Word has length 45 [2021-01-06 10:15:59,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 10:15:59,186 INFO L481 AbstractCegarLoop]: Abstraction has 54 states and 58 transitions. [2021-01-06 10:15:59,186 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2021-01-06 10:15:59,186 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2021-01-06 10:15:59,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2021-01-06 10:15:59,188 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 10:15:59,188 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 10:15:59,402 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 10:15:59,403 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 10:15:59,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 10:15:59,404 INFO L82 PathProgramCache]: Analyzing trace with hash 1726969040, now seen corresponding path program 5 times [2021-01-06 10:15:59,404 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 10:15:59,405 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658357852] [2021-01-06 10:15:59,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 10:15:59,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 10:15:59,492 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2021-01-06 10:15:59,492 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658357852] [2021-01-06 10:15:59,493 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2051178285] [2021-01-06 10:15:59,493 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 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 10:15:59,601 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2021-01-06 10:15:59,602 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-06 10:15:59,603 INFO L263 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 6 conjunts are in the unsatisfiable core [2021-01-06 10:15:59,606 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 10:15:59,711 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2021-01-06 10:15:59,712 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 10:15:59,712 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2021-01-06 10:15:59,712 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748849994] [2021-01-06 10:15:59,713 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-01-06 10:15:59,713 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 10:15:59,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-01-06 10:15:59,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2021-01-06 10:15:59,714 INFO L87 Difference]: Start difference. First operand 54 states and 58 transitions. Second operand 12 states. [2021-01-06 10:15:59,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 10:15:59,867 INFO L93 Difference]: Finished difference Result 105 states and 116 transitions. [2021-01-06 10:15:59,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-01-06 10:15:59,867 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 53 [2021-01-06 10:15:59,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 10:15:59,868 INFO L225 Difference]: With dead ends: 105 [2021-01-06 10:15:59,868 INFO L226 Difference]: Without dead ends: 62 [2021-01-06 10:15:59,869 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2021-01-06 10:15:59,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2021-01-06 10:15:59,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2021-01-06 10:15:59,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2021-01-06 10:15:59,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 66 transitions. [2021-01-06 10:15:59,876 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 66 transitions. Word has length 53 [2021-01-06 10:15:59,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 10:15:59,876 INFO L481 AbstractCegarLoop]: Abstraction has 62 states and 66 transitions. [2021-01-06 10:15:59,877 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2021-01-06 10:15:59,877 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 66 transitions. [2021-01-06 10:15:59,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-01-06 10:15:59,878 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 10:15:59,878 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 10:16:00,092 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 10:16:00,093 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 10:16:00,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 10:16:00,094 INFO L82 PathProgramCache]: Analyzing trace with hash -1850748020, now seen corresponding path program 6 times [2021-01-06 10:16:00,095 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 10:16:00,095 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006664805] [2021-01-06 10:16:00,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 10:16:00,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 10:16:00,193 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2021-01-06 10:16:00,194 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006664805] [2021-01-06 10:16:00,195 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1551041522] [2021-01-06 10:16:00,196 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 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 10:16:00,472 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2021-01-06 10:16:00,472 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-06 10:16:00,474 INFO L263 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 4 conjunts are in the unsatisfiable core [2021-01-06 10:16:00,477 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 10:16:00,557 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2021-01-06 10:16:00,558 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 10:16:00,559 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2021-01-06 10:16:00,561 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573664049] [2021-01-06 10:16:00,562 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-06 10:16:00,562 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 10:16:00,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-06 10:16:00,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-01-06 10:16:00,563 INFO L87 Difference]: Start difference. First operand 62 states and 66 transitions. Second operand 6 states. [2021-01-06 10:16:00,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 10:16:00,590 INFO L93 Difference]: Finished difference Result 82 states and 87 transitions. [2021-01-06 10:16:00,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 10:16:00,591 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 61 [2021-01-06 10:16:00,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 10:16:00,594 INFO L225 Difference]: With dead ends: 82 [2021-01-06 10:16:00,594 INFO L226 Difference]: Without dead ends: 65 [2021-01-06 10:16:00,594 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-01-06 10:16:00,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2021-01-06 10:16:00,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 64. [2021-01-06 10:16:00,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2021-01-06 10:16:00,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 68 transitions. [2021-01-06 10:16:00,611 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 68 transitions. Word has length 61 [2021-01-06 10:16:00,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 10:16:00,613 INFO L481 AbstractCegarLoop]: Abstraction has 64 states and 68 transitions. [2021-01-06 10:16:00,613 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-06 10:16:00,613 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 68 transitions. [2021-01-06 10:16:00,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-01-06 10:16:00,620 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 10:16:00,620 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 10:16:00,821 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2021-01-06 10:16:00,822 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 10:16:00,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 10:16:00,823 INFO L82 PathProgramCache]: Analyzing trace with hash -164647158, now seen corresponding path program 7 times [2021-01-06 10:16:00,823 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 10:16:00,823 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260068177] [2021-01-06 10:16:00,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 10:16:00,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 10:16:00,911 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2021-01-06 10:16:00,911 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260068177] [2021-01-06 10:16:00,912 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [562702933] [2021-01-06 10:16:00,912 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 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 10:16:00,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 10:16:01,000 INFO L263 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 5 conjunts are in the unsatisfiable core [2021-01-06 10:16:01,004 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 10:16:01,070 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2021-01-06 10:16:01,071 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 10:16:01,071 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2021-01-06 10:16:01,071 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523473639] [2021-01-06 10:16:01,072 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-01-06 10:16:01,072 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 10:16:01,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-01-06 10:16:01,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2021-01-06 10:16:01,073 INFO L87 Difference]: Start difference. First operand 64 states and 68 transitions. Second operand 7 states. [2021-01-06 10:16:01,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 10:16:01,098 INFO L93 Difference]: Finished difference Result 83 states and 88 transitions. [2021-01-06 10:16:01,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-06 10:16:01,098 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 63 [2021-01-06 10:16:01,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 10:16:01,099 INFO L225 Difference]: With dead ends: 83 [2021-01-06 10:16:01,099 INFO L226 Difference]: Without dead ends: 66 [2021-01-06 10:16:01,100 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2021-01-06 10:16:01,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2021-01-06 10:16:01,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2021-01-06 10:16:01,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2021-01-06 10:16:01,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 70 transitions. [2021-01-06 10:16:01,106 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 70 transitions. Word has length 63 [2021-01-06 10:16:01,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 10:16:01,106 INFO L481 AbstractCegarLoop]: Abstraction has 66 states and 70 transitions. [2021-01-06 10:16:01,106 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2021-01-06 10:16:01,107 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 70 transitions. [2021-01-06 10:16:01,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-01-06 10:16:01,107 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 10:16:01,108 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 10:16:01,321 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 10:16:01,322 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 10:16:01,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 10:16:01,323 INFO L82 PathProgramCache]: Analyzing trace with hash 975610632, now seen corresponding path program 8 times [2021-01-06 10:16:01,323 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 10:16:01,323 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170588441] [2021-01-06 10:16:01,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 10:16:01,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 10:16:05,162 WARN L197 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 42 [2021-01-06 10:16:05,440 WARN L197 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 60 [2021-01-06 10:16:05,725 WARN L197 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 60 [2021-01-06 10:16:06,012 WARN L197 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 60 [2021-01-06 10:16:06,320 WARN L197 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 60 [2021-01-06 10:16:06,618 WARN L197 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 57 [2021-01-06 10:16:06,919 WARN L197 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 54 [2021-01-06 10:16:07,187 WARN L197 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 57 [2021-01-06 10:16:07,456 WARN L197 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 57 [2021-01-06 10:16:07,795 WARN L197 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 62 [2021-01-06 10:16:10,076 WARN L197 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 58 [2021-01-06 10:16:10,819 WARN L197 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 49 [2021-01-06 10:16:12,919 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 0 proven. 116 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 10:16:12,919 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170588441] [2021-01-06 10:16:12,920 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [65337105] [2021-01-06 10:16:12,920 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 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 10:16:13,538 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-01-06 10:16:13,538 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-06 10:16:13,542 WARN L261 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 142 conjunts are in the unsatisfiable core [2021-01-06 10:16:13,548 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 10:16:13,615 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-01-06 10:16:13,618 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 10:16:13,627 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 10:16:13,633 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 10:16:13,633 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:10 [2021-01-06 10:16:13,660 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-01-06 10:16:13,661 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 10:16:13,670 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 10:16:13,673 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 10:16:13,674 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:10 [2021-01-06 10:16:13,700 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-01-06 10:16:13,701 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 10:16:13,710 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 10:16:13,715 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 10:16:13,715 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:3 [2021-01-06 10:16:14,326 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 10:16:14,531 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 10:16:14,533 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 10:16:14,539 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 10:16:14,573 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 287 treesize of output 216 [2021-01-06 10:16:14,591 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 10:16:14,593 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 10:16:14,595 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 10:16:14,599 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 10:16:14,601 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 10:16:14,603 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 10:16:14,604 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 10:16:14,605 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 10:16:14,607 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 10:16:14,608 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 10:16:14,617 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 10:16:14,621 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 10:16:14,623 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 10:16:14,632 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 10:16:14,634 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 10:16:14,637 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 10:16:14,639 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 10:16:14,640 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 10:16:14,642 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 10:16:14,643 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 10:16:14,645 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 10:16:14,646 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 10:16:14,647 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 10:16:14,650 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 132 treesize of output 84 [2021-01-06 10:16:14,654 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-06 10:16:14,664 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 10:16:14,665 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-06 10:16:14,678 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 286 treesize of output 215 [2021-01-06 10:16:14,685 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 10:16:14,687 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 10:16:14,689 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 10:16:14,690 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 10:16:14,692 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 10:16:14,693 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 10:16:14,695 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 10:16:14,696 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 10:16:14,697 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 10:16:14,699 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 10:16:14,705 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 10:16:14,707 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 10:16:14,709 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 10:16:14,716 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 10:16:14,719 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 10:16:14,721 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 10:16:14,722 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 10:16:14,724 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 10:16:14,725 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 10:16:14,727 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 10:16:14,729 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 10:16:14,730 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 10:16:14,732 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 10:16:14,734 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 131 treesize of output 83 [2021-01-06 10:16:14,738 INFO L547 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-01-06 10:16:14,743 INFO L625 ElimStorePlain]: treesize reduction 151, result has 0.7 percent of original size [2021-01-06 10:16:14,743 INFO L547 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-06 10:16:14,755 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 285 treesize of output 214 [2021-01-06 10:16:14,763 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 10:16:14,765 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 10:16:14,766 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 10:16:14,768 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 10:16:14,769 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 10:16:14,770 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 10:16:14,772 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 10:16:14,773 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 10:16:14,775 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 10:16:14,776 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 10:16:14,782 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 10:16:14,785 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 10:16:14,787 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 10:16:14,794 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 10:16:14,795 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 10:16:14,797 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 10:16:14,798 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 10:16:14,800 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 10:16:14,801 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 10:16:14,803 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 10:16:14,804 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 10:16:14,806 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 10:16:14,807 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 10:16:14,810 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 130 treesize of output 82 [2021-01-06 10:16:14,813 INFO L547 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-01-06 10:16:14,823 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 10:16:14,824 INFO L547 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-06 10:16:14,832 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 286 treesize of output 215 [2021-01-06 10:16:14,834 INFO L547 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-01-06 10:16:14,967 WARN L197 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 44 [2021-01-06 10:16:14,968 INFO L625 ElimStorePlain]: treesize reduction 159, result has 54.7 percent of original size [2021-01-06 10:16:14,969 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2021-01-06 10:16:14,970 INFO L244 ElimStorePlain]: Needed 8 recursive calls to eliminate 1 variables, input treesize:1237, output treesize:192 [2021-01-06 10:16:16,267 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 10:16:16,268 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 10:16:16,272 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 10:16:16,465 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-06 10:16:16,480 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 10:16:16,485 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: variable got div captured [2021-01-06 10:16:16,485 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2021-01-06 10:16:16,485 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2021-01-06 10:16:16,486 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107154391] [2021-01-06 10:16:16,486 INFO L461 AbstractCegarLoop]: Interpolant automaton has 51 states [2021-01-06 10:16:16,486 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 10:16:16,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2021-01-06 10:16:16,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=2500, Unknown=0, NotChecked=0, Total=2652 [2021-01-06 10:16:16,488 INFO L87 Difference]: Start difference. First operand 66 states and 70 transitions. Second operand 51 states. [2021-01-06 10:16:20,172 WARN L197 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 47 [2021-01-06 10:16:20,607 WARN L197 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 64 [2021-01-06 10:16:21,115 WARN L197 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 68 [2021-01-06 10:16:21,468 WARN L197 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 55 [2021-01-06 10:16:22,069 WARN L197 SmtUtils]: Spent 263.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 67 [2021-01-06 10:16:22,482 WARN L197 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 55 [2021-01-06 10:16:23,032 WARN L197 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 67 [2021-01-06 10:16:23,432 WARN L197 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 62 [2021-01-06 10:16:24,102 WARN L197 SmtUtils]: Spent 283.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 69 [2021-01-06 10:16:24,653 WARN L197 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 78 [2021-01-06 10:16:26,675 WARN L197 SmtUtils]: Spent 611.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 74 [2021-01-06 10:16:29,726 WARN L197 SmtUtils]: Spent 1.09 s on a formula simplification. DAG size of input: 109 DAG size of output: 94 [2021-01-06 10:16:31,480 WARN L197 SmtUtils]: Spent 818.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 98 [2021-01-06 10:16:32,832 WARN L197 SmtUtils]: Spent 527.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 78 [2021-01-06 10:16:34,374 WARN L197 SmtUtils]: Spent 988.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 96 [2021-01-06 10:16:35,679 WARN L197 SmtUtils]: Spent 605.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 83 [2021-01-06 10:16:36,612 WARN L197 SmtUtils]: Spent 448.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 81 [2021-01-06 10:16:37,484 WARN L197 SmtUtils]: Spent 310.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 76 [2021-01-06 10:16:38,555 WARN L197 SmtUtils]: Spent 544.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 84 [2021-01-06 10:16:39,268 WARN L197 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 57 [2021-01-06 10:16:40,528 WARN L197 SmtUtils]: Spent 307.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 59 [2021-01-06 10:16:41,325 WARN L197 SmtUtils]: Spent 318.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 61 [2021-01-06 10:16:41,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 10:16:41,586 INFO L93 Difference]: Finished difference Result 129 states and 137 transitions. [2021-01-06 10:16:41,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2021-01-06 10:16:41,588 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 65 [2021-01-06 10:16:41,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 10:16:41,589 INFO L225 Difference]: With dead ends: 129 [2021-01-06 10:16:41,589 INFO L226 Difference]: Without dead ends: 124 [2021-01-06 10:16:41,592 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 23 SyntacticMatches, 21 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1267 ImplicationChecksByTransitivity, 27.5s TimeCoverageRelationStatistics Valid=335, Invalid=5215, Unknown=0, NotChecked=0, Total=5550 [2021-01-06 10:16:41,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2021-01-06 10:16:41,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 95. [2021-01-06 10:16:41,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2021-01-06 10:16:41,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 102 transitions. [2021-01-06 10:16:41,615 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 102 transitions. Word has length 65 [2021-01-06 10:16:41,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 10:16:41,615 INFO L481 AbstractCegarLoop]: Abstraction has 95 states and 102 transitions. [2021-01-06 10:16:41,616 INFO L482 AbstractCegarLoop]: Interpolant automaton has 51 states. [2021-01-06 10:16:41,616 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 102 transitions. [2021-01-06 10:16:41,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-01-06 10:16:41,617 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 10:16:41,617 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 10:16:41,823 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 10:16:41,824 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 10:16:41,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 10:16:41,825 INFO L82 PathProgramCache]: Analyzing trace with hash -1384915130, now seen corresponding path program 9 times [2021-01-06 10:16:41,825 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 10:16:41,825 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554631993] [2021-01-06 10:16:41,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 10:16:41,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 10:16:41,968 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 27 proven. 9 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2021-01-06 10:16:41,969 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554631993] [2021-01-06 10:16:41,969 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1612605459] [2021-01-06 10:16:41,969 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 10:16:42,235 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2021-01-06 10:16:42,235 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-06 10:16:42,237 INFO L263 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 7 conjunts are in the unsatisfiable core [2021-01-06 10:16:42,240 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 10:16:42,359 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2021-01-06 10:16:42,360 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-01-06 10:16:42,360 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [8] total 9 [2021-01-06 10:16:42,360 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48238961] [2021-01-06 10:16:42,361 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-01-06 10:16:42,361 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 10:16:42,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-01-06 10:16:42,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2021-01-06 10:16:42,362 INFO L87 Difference]: Start difference. First operand 95 states and 102 transitions. Second operand 8 states. [2021-01-06 10:16:42,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 10:16:42,516 INFO L93 Difference]: Finished difference Result 104 states and 111 transitions. [2021-01-06 10:16:42,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-01-06 10:16:42,518 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 67 [2021-01-06 10:16:42,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 10:16:42,518 INFO L225 Difference]: With dead ends: 104 [2021-01-06 10:16:42,519 INFO L226 Difference]: Without dead ends: 0 [2021-01-06 10:16:42,520 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2021-01-06 10:16:42,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-01-06 10:16:42,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-01-06 10:16:42,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2021-01-06 10:16:42,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-01-06 10:16:42,520 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 67 [2021-01-06 10:16:42,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 10:16:42,521 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-01-06 10:16:42,521 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2021-01-06 10:16:42,521 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-01-06 10:16:42,521 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-01-06 10:16:42,730 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2021-01-06 10:16:42,734 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-01-06 10:16:42,969 WARN L197 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2021-01-06 10:16:43,467 WARN L197 SmtUtils]: Spent 413.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 71 [2021-01-06 10:16:45,478 WARN L197 SmtUtils]: Spent 2.01 s on a formula simplification. DAG size of input: 194 DAG size of output: 182 [2021-01-06 10:16:52,752 WARN L197 SmtUtils]: Spent 7.19 s on a formula simplification. DAG size of input: 296 DAG size of output: 259 [2021-01-06 10:16:54,237 WARN L197 SmtUtils]: Spent 1.48 s on a formula simplification. DAG size of input: 131 DAG size of output: 126 [2021-01-06 10:16:54,242 INFO L185 CegarLoopUtils]: At program point L23(lines 15 24) the Hoare annotation is: (let ((.cse7 (select |#memory_int| |ULTIMATE.start_main_~#x~0.base|))) (let ((.cse2 (select .cse7 (+ |ULTIMATE.start_main_~#x~0.offset| 4)))) (let ((.cse8 (store .cse7 |ULTIMATE.start_main_~#x~0.offset| .cse2))) (let ((.cse3 (select .cse8 (+ |ULTIMATE.start_main_~#x~0.offset| 8))) (.cse4 (select .cse8 (+ |ULTIMATE.start_main_~#x~0.offset| 12))) (.cse5 (select .cse8 (+ |ULTIMATE.start_main_~#x~0.offset| 16))) (.cse6 (select .cse7 |ULTIMATE.start_main_~#x~0.offset|))) (let ((.cse0 (+ .cse2 .cse3 .cse4 .cse5 .cse6))) (let ((.cse1 (* 4294967296 (div .cse0 4294967296)))) (and (<= ULTIMATE.start_sum_~ret~0 .cse0) (<= .cse0 ULTIMATE.start_sum_~ret~0) (= |ULTIMATE.start_main_~#x~0.offset| 0) (or (= .cse0 (+ |ULTIMATE.start_sum_#res| .cse1 4294967296)) (<= .cse0 (+ .cse1 2147483647))) (<= 5 ULTIMATE.start_sum_~i~0) (or (= (+ |ULTIMATE.start_sum_#res| .cse1) .cse0) (<= .cse0 (+ (* 4294967296 (div (+ .cse2 .cse3 .cse4 .cse5 .cse6 (- 2147483648)) 4294967296)) 4294967295)))))))))) [2021-01-06 10:16:54,242 INFO L185 CegarLoopUtils]: At program point L23-1(lines 15 24) the Hoare annotation is: (let ((.cse8 (select |#memory_int| |ULTIMATE.start_main_~#x~0.base|))) (let ((.cse3 (select .cse8 (+ |ULTIMATE.start_main_~#x~0.offset| 12))) (.cse4 (select .cse8 4)) (.cse5 (select .cse8 (+ |ULTIMATE.start_main_~#x~0.offset| 16))) (.cse6 (select .cse8 |ULTIMATE.start_main_~#x~0.offset|)) (.cse7 (select .cse8 (+ |ULTIMATE.start_main_~#x~0.offset| 8)))) (let ((.cse1 (+ .cse3 .cse4 .cse5 .cse6 .cse7))) (and (= |ULTIMATE.start_main_~#x~0.offset| 0) (let ((.cse0 (* 4294967296 (div ULTIMATE.start_sum_~ret~0 4294967296)))) (or (< (+ .cse0 2147483647) ULTIMATE.start_sum_~ret~0) (= (+ .cse0 ULTIMATE.start_main_~ret~1) ULTIMATE.start_sum_~ret~0))) (<= 5 ULTIMATE.start_sum_~i~0) (<= ULTIMATE.start_sum_~ret~0 .cse1) (<= .cse1 ULTIMATE.start_sum_~ret~0) (let ((.cse2 (= |ULTIMATE.start_sum_#res| ULTIMATE.start_main_~ret~1))) (or (and .cse2 (= .cse1 (+ ULTIMATE.start_main_~ret~1 (* 4294967296 (div .cse1 4294967296)) 4294967296))) (and (<= (* 4294967296 (div (+ .cse3 .cse4 .cse5 .cse6 .cse7 2147483648) 4294967296)) .cse1) .cse2))))))) [2021-01-06 10:16:54,243 INFO L185 CegarLoopUtils]: At program point L23-2(lines 15 24) the Hoare annotation is: (let ((.cse4 (+ |ULTIMATE.start_main_~#x~0.offset| 12)) (.cse6 (+ |ULTIMATE.start_main_~#x~0.offset| 16)) (.cse5 (select |#memory_int| |ULTIMATE.start_main_~#x~0.base|)) (.cse3 (+ |ULTIMATE.start_main_~#x~0.offset| 8))) (let ((.cse7 (+ (select .cse5 .cse4) (select .cse5 4) (select .cse5 .cse6) (select .cse5 |ULTIMATE.start_main_~#x~0.offset|) (select .cse5 .cse3)))) (and (let ((.cse1 (let ((.cse2 (store .cse5 .cse6 ULTIMATE.start_main_~temp~0))) (+ (select .cse2 0) (select .cse2 (+ |ULTIMATE.start_main_~#x~0.offset| 4)) (select .cse2 .cse3) (select .cse2 .cse4) ULTIMATE.start_main_~temp~0)))) (let ((.cse0 (* 4294967296 (div .cse1 4294967296)))) (or (= (+ ULTIMATE.start_main_~ret~1 .cse0 4294967296) .cse1) (= (+ ULTIMATE.start_main_~ret~1 .cse0) .cse1)))) (= |ULTIMATE.start_main_~#x~0.offset| 0) (<= ULTIMATE.start_sum_~ret~0 .cse7) (= |ULTIMATE.start_sum_#res| ULTIMATE.start_main_~ret~1) (<= .cse7 ULTIMATE.start_sum_~ret~0) (let ((.cse9 (= ULTIMATE.start_main_~ret2~0 ULTIMATE.start_main_~ret~1)) (.cse8 (* 4294967296 (div ULTIMATE.start_sum_~ret~0 4294967296)))) (or (and (<= ULTIMATE.start_sum_~ret~0 (+ .cse8 2147483647)) .cse9 (= (+ .cse8 ULTIMATE.start_main_~ret~1) ULTIMATE.start_sum_~ret~0)) (and (= ULTIMATE.start_sum_~ret~0 (+ ULTIMATE.start_main_~ret~1 .cse8 4294967296)) .cse9 (<= (+ .cse8 2147483648) ULTIMATE.start_sum_~ret~0))))))) [2021-01-06 10:16:54,243 INFO L192 CegarLoopUtils]: At program point L52(lines 26 53) the Hoare annotation is: true [2021-01-06 10:16:54,243 INFO L189 CegarLoopUtils]: For program point L-1(line -1) no Hoare annotation was computed. [2021-01-06 10:16:54,243 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-01-06 10:16:54,243 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-01-06 10:16:54,243 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 50) no Hoare annotation was computed. [2021-01-06 10:16:54,244 INFO L189 CegarLoopUtils]: For program point L20-2(lines 20 22) no Hoare annotation was computed. [2021-01-06 10:16:54,244 INFO L185 CegarLoopUtils]: At program point L20-3(lines 20 22) the Hoare annotation is: (let ((.cse19 (select |#memory_int| |ULTIMATE.start_main_~#x~0.base|))) (let ((.cse15 (select .cse19 (+ |ULTIMATE.start_main_~#x~0.offset| 4)))) (let ((.cse18 (store .cse19 |ULTIMATE.start_main_~#x~0.offset| .cse15)) (.cse9 (* ULTIMATE.start_sum_~i~0 4))) (let ((.cse8 (select |#memory_int| ULTIMATE.start_sum_~x.base)) (.cse2 (+ .cse9 ULTIMATE.start_sum_~x.offset)) (.cse10 (+ |ULTIMATE.start_main_~#x~0.offset| 8)) (.cse5 (+ |ULTIMATE.start_main_~#x~0.offset| 12)) (.cse16 (select .cse18 (+ |ULTIMATE.start_main_~#x~0.offset| 16))) (.cse17 (select .cse19 |ULTIMATE.start_main_~#x~0.offset|))) (let ((.cse0 (+ .cse15 (select .cse18 .cse10) (select .cse18 .cse5) .cse16 .cse17)) (.cse1 (= |ULTIMATE.start_main_~#x~0.offset| 0)) (.cse3 (= |ULTIMATE.start_main_~#x~0.base| ULTIMATE.start_sum_~x.base)) (.cse12 (+ .cse15 .cse16 .cse17)) (.cse4 (= ULTIMATE.start_sum_~x.offset 0)) (.cse7 (select .cse8 .cse2))) (or (and (<= ULTIMATE.start_sum_~ret~0 .cse0) (<= .cse0 ULTIMATE.start_sum_~ret~0) .cse1 (<= 5 ULTIMATE.start_sum_~i~0)) (and (= .cse2 |ULTIMATE.start_main_~#x~0.offset|) .cse3 (= ULTIMATE.start_sum_~ret~0 0) .cse4 (= ULTIMATE.start_sum_~i~0 0)) (let ((.cse6 (+ .cse7 (select .cse8 (+ .cse9 |ULTIMATE.start_main_~#x~0.offset| 4)) ULTIMATE.start_sum_~ret~0))) (and .cse1 (= .cse2 .cse5) (<= .cse0 .cse6) .cse3 (<= .cse6 .cse0) .cse4)) (let ((.cse11 (+ ULTIMATE.start_sum_~ret~0 (select .cse8 (+ .cse9 |ULTIMATE.start_main_~#x~0.offset| 8))))) (and .cse1 .cse3 (= .cse2 .cse10) .cse4 (<= .cse11 .cse12) (<= .cse12 .cse11))) (let ((.cse13 (+ .cse7 ULTIMATE.start_sum_~ret~0))) (and (<= .cse13 .cse0) .cse1 .cse3 (<= .cse0 .cse13) (<= ULTIMATE.start_sum_~i~0 4) .cse4 (<= 4 ULTIMATE.start_sum_~i~0))) (let ((.cse14 (+ .cse7 (select .cse8 (+ .cse9 |ULTIMATE.start_main_~#x~0.offset| 12)) ULTIMATE.start_sum_~ret~0))) (and .cse1 .cse3 (<= .cse14 .cse12) (<= .cse12 .cse14) (= .cse9 4) .cse4)))))))) [2021-01-06 10:16:54,244 INFO L189 CegarLoopUtils]: For program point L49(lines 49 51) no Hoare annotation was computed. [2021-01-06 10:16:54,244 INFO L189 CegarLoopUtils]: For program point L20-4(lines 20 22) no Hoare annotation was computed. [2021-01-06 10:16:54,244 INFO L189 CegarLoopUtils]: For program point L49-2(lines 49 51) no Hoare annotation was computed. [2021-01-06 10:16:54,244 INFO L189 CegarLoopUtils]: For program point L20-7(lines 20 22) no Hoare annotation was computed. [2021-01-06 10:16:54,245 INFO L185 CegarLoopUtils]: At program point L20-8(lines 20 22) the Hoare annotation is: (let ((.cse20 (* ULTIMATE.start_sum_~i~0 4))) (let ((.cse21 (select |#memory_int| ULTIMATE.start_sum_~x.base)) (.cse1 (+ .cse20 ULTIMATE.start_sum_~x.offset)) (.cse41 (+ |ULTIMATE.start_main_~#x~0.offset| 8)) (.cse26 (select |#memory_int| |ULTIMATE.start_main_~#x~0.base|)) (.cse2 (+ |ULTIMATE.start_main_~#x~0.offset| 12))) (let ((.cse25 (select .cse26 .cse2)) (.cse27 (+ |ULTIMATE.start_main_~#x~0.offset| 16)) (.cse0 (= |ULTIMATE.start_main_~#x~0.offset| 0)) (.cse3 (= |ULTIMATE.start_main_~#x~0.base| ULTIMATE.start_sum_~x.base)) (.cse9 (= ULTIMATE.start_sum_~x.offset 0)) (.cse10 (select .cse26 4)) (.cse11 (select .cse26 |ULTIMATE.start_main_~#x~0.offset|)) (.cse12 (select .cse26 .cse41)) (.cse7 (select .cse21 .cse1)) (.cse8 (select .cse21 (+ .cse20 |ULTIMATE.start_main_~#x~0.offset| 4))) (.cse18 (select .cse21 (+ .cse20 |ULTIMATE.start_main_~#x~0.offset| 8)))) (or (let ((.cse5 (+ .cse7 .cse8 ULTIMATE.start_sum_~ret~0))) (let ((.cse13 (div .cse5 4294967296))) (let ((.cse4 (+ .cse10 .cse11 .cse12)) (.cse6 (* .cse13 4294967296))) (and .cse0 (= .cse1 .cse2) .cse3 (<= .cse4 ULTIMATE.start_sum_~ret~0) (<= ULTIMATE.start_sum_~ret~0 .cse4) (or (= .cse5 (+ ULTIMATE.start_main_~ret~1 .cse6)) (<= .cse5 (+ (* 4294967296 (div (+ .cse7 .cse8 ULTIMATE.start_sum_~ret~0 (- 2147483648)) 4294967296)) 4294967295))) .cse9 (or (= (+ .cse7 .cse8 .cse10 .cse11 .cse12) (+ ULTIMATE.start_main_~ret~1 .cse6 4294967296)) (<= .cse5 (+ (* 4294967296 .cse13) 2147483647))))))) (let ((.cse17 (select .cse21 (+ .cse20 |ULTIMATE.start_main_~#x~0.offset| 12)))) (let ((.cse19 (+ .cse7 .cse17 ULTIMATE.start_sum_~ret~0 .cse18 .cse12))) (let ((.cse14 (* (div .cse19 4294967296) 4294967296)) (.cse15 (+ .cse7 .cse17 .cse18 .cse11 .cse12))) (and (<= .cse11 ULTIMATE.start_sum_~ret~0) .cse0 .cse3 (or (= (+ ULTIMATE.start_main_~ret~1 .cse14 4294967296) .cse15) (let ((.cse16 (+ .cse7 .cse17 .cse8 ULTIMATE.start_sum_~ret~0 .cse18))) (<= .cse16 (+ (* 4294967296 (div .cse16 4294967296)) 2147483647)))) (or (= (+ ULTIMATE.start_main_~ret~1 .cse14) .cse15) (<= .cse19 (+ (* 4294967296 (div (+ .cse7 .cse17 ULTIMATE.start_sum_~ret~0 .cse18 .cse12 (- 2147483648)) 4294967296)) 4294967295))) (= .cse20 4) .cse9 (<= ULTIMATE.start_sum_~ret~0 .cse11))))) (let ((.cse28 (div ULTIMATE.start_sum_~ret~0 4294967296))) (let ((.cse22 (+ (* 4294967296 .cse28) 2147483647)) (.cse24 (* .cse28 4294967296)) (.cse23 (+ .cse25 .cse10 (select .cse26 .cse27) .cse11 .cse12))) (and .cse0 (or (<= ULTIMATE.start_sum_~ret~0 .cse22) (= .cse23 (+ .cse24 ULTIMATE.start_main_~ret~1 4294967296))) (<= 5 ULTIMATE.start_sum_~i~0) (or (< .cse22 ULTIMATE.start_sum_~ret~0) (= (+ .cse24 ULTIMATE.start_main_~ret~1) ULTIMATE.start_sum_~ret~0)) (<= ULTIMATE.start_sum_~ret~0 .cse23) (<= .cse23 ULTIMATE.start_sum_~ret~0)))) (let ((.cse29 (+ .cse7 ULTIMATE.start_sum_~ret~0))) (let ((.cse30 (div .cse29 4294967296))) (let ((.cse32 (+ .cse7 .cse25 .cse10 .cse11 .cse12)) (.cse33 (* .cse30 4294967296))) (and (or (<= .cse29 (+ (* 4294967296 .cse30) 2147483647)) (let ((.cse31 (+ ULTIMATE.start_main_~ret~1 .cse33 4294967296))) (and (= .cse31 .cse29) (= .cse32 .cse31)))) .cse0 .cse3 (or (<= .cse29 (+ (* 4294967296 (div (+ .cse7 ULTIMATE.start_sum_~ret~0 (- 2147483648)) 4294967296)) 4294967295)) (let ((.cse34 (+ ULTIMATE.start_main_~ret~1 .cse33))) (and (= .cse32 .cse34) (= .cse34 .cse29)))) (< (+ (* 4 ULTIMATE.start_sum_~i~0) ULTIMATE.start_sum_~x.offset) (+ |ULTIMATE.start_main_~#x~0.offset| 17)) .cse9 (<= 4 ULTIMATE.start_sum_~i~0))))) (let ((.cse38 (select .cse21 .cse2)) (.cse39 (select .cse21 .cse27)) (.cse40 (select .cse21 (+ |ULTIMATE.start_main_~#x~0.offset| 4)))) (let ((.cse36 (+ .cse38 .cse39 .cse40 .cse7 .cse12))) (let ((.cse35 (* (div .cse36 4294967296) 4294967296))) (and .cse0 .cse3 (= ULTIMATE.start_sum_~ret~0 0) (or (= (+ ULTIMATE.start_main_~ret~1 .cse35 4294967296) .cse36) (let ((.cse37 (+ .cse38 .cse39 .cse40 .cse7 (select .cse21 .cse41)))) (<= .cse37 (+ (* 4294967296 (div .cse37 4294967296)) 2147483647)))) (or (= (+ ULTIMATE.start_main_~ret~1 .cse35) (+ .cse38 .cse39 .cse40 .cse11 .cse12)) (<= .cse36 (+ (* 4294967296 (div (+ .cse38 .cse39 .cse40 .cse7 .cse12 (- 2147483648)) 4294967296)) 4294967295))) .cse9 (= ULTIMATE.start_sum_~i~0 0))))) (let ((.cse42 (+ .cse7 .cse8 ULTIMATE.start_sum_~ret~0 .cse18))) (let ((.cse43 (div .cse42 4294967296))) (let ((.cse45 (+ .cse8 .cse10 .cse18 .cse11 .cse12)) (.cse46 (* .cse43 4294967296))) (and (= .cse20 8) .cse0 (or (<= .cse42 (+ (* 4294967296 .cse43) 2147483647)) (let ((.cse44 (+ ULTIMATE.start_main_~ret~1 .cse46 4294967296))) (and (= .cse42 .cse44) (= .cse44 .cse45)))) .cse3 .cse9 (or (<= .cse42 (+ (* 4294967296 (div (+ .cse7 .cse8 ULTIMATE.start_sum_~ret~0 .cse18 (- 2147483648)) 4294967296)) 4294967295)) (let ((.cse47 (+ ULTIMATE.start_main_~ret~1 .cse46))) (and (= .cse42 .cse47) (= .cse45 .cse47)))))))))))) [2021-01-06 10:16:54,245 INFO L189 CegarLoopUtils]: For program point L20-9(lines 20 22) no Hoare annotation was computed. [2021-01-06 10:16:54,246 INFO L189 CegarLoopUtils]: For program point L20-12(lines 20 22) no Hoare annotation was computed. [2021-01-06 10:16:54,247 INFO L185 CegarLoopUtils]: At program point L20-13(lines 20 22) the Hoare annotation is: (let ((.cse34 (* ULTIMATE.start_sum_~i~0 4))) (let ((.cse16 (+ |ULTIMATE.start_main_~#x~0.offset| 4)) (.cse11 (+ |ULTIMATE.start_main_~#x~0.offset| 8)) (.cse18 (+ |ULTIMATE.start_main_~#x~0.offset| 12)) (.cse55 (select |#memory_int| |ULTIMATE.start_main_~#x~0.base|)) (.cse17 (+ |ULTIMATE.start_main_~#x~0.offset| 16)) (.cse41 (+ .cse34 ULTIMATE.start_sum_~x.offset)) (.cse10 (select |#memory_int| ULTIMATE.start_sum_~x.base))) (let ((.cse37 (select .cse10 (+ .cse34 4))) (.cse39 (select .cse10 (+ .cse34 8))) (.cse2 (= |ULTIMATE.start_main_~#x~0.base| ULTIMATE.start_sum_~x.base)) (.cse14 (= ULTIMATE.start_sum_~x.offset 0)) (.cse9 (select .cse10 .cse41)) (.cse31 (select .cse10 (+ .cse34 |ULTIMATE.start_main_~#x~0.offset| 4))) (.cse32 (select .cse10 (+ .cse34 |ULTIMATE.start_main_~#x~0.offset| 8))) (.cse1 (= |ULTIMATE.start_main_~#x~0.offset| 0)) (.cse0 (= ULTIMATE.start_main_~ret2~0 ULTIMATE.start_main_~ret~1)) (.cse15 (let ((.cse57 (let ((.cse58 (store .cse55 .cse17 ULTIMATE.start_main_~temp~0))) (+ (select .cse58 0) (select .cse58 .cse16) (select .cse58 .cse11) (select .cse58 .cse18) ULTIMATE.start_main_~temp~0)))) (let ((.cse56 (* (div .cse57 4294967296) 4294967296))) (or (= (+ ULTIMATE.start_main_~ret~1 .cse56) .cse57) (= (+ ULTIMATE.start_main_~ret~1 .cse56 4294967296) .cse57))))) (.cse25 (select .cse55 .cse18)) (.cse26 (select .cse55 4)) (.cse12 (select .cse55 |ULTIMATE.start_main_~#x~0.offset|)) (.cse13 (select .cse55 .cse11))) (or (let ((.cse6 (select .cse10 .cse18)) (.cse7 (select .cse10 .cse17)) (.cse8 (select .cse10 .cse16))) (let ((.cse4 (+ .cse6 .cse7 .cse8 .cse9 .cse13))) (let ((.cse3 (* (div .cse4 4294967296) 4294967296))) (and .cse0 .cse1 .cse2 (= ULTIMATE.start_sum_~ret~0 0) (or (= (+ ULTIMATE.start_main_~ret~1 .cse3 4294967296) .cse4) (let ((.cse5 (+ .cse6 .cse7 .cse8 .cse9 (select .cse10 .cse11)))) (<= .cse5 (+ (* 4294967296 (div .cse5 4294967296)) 2147483647)))) (or (= (+ ULTIMATE.start_main_~ret~1 .cse3) (+ .cse6 .cse7 .cse8 .cse12 .cse13)) (<= .cse4 (+ (* 4294967296 (div (+ .cse6 .cse7 .cse8 .cse9 .cse13 (- 2147483648)) 4294967296)) 4294967295))) .cse14 .cse15 (= ULTIMATE.start_sum_~i~0 0))))) (let ((.cse19 (+ .cse9 ULTIMATE.start_sum_~ret~0))) (let ((.cse21 (div .cse19 4294967296))) (let ((.cse24 (* .cse21 4294967296))) (let ((.cse20 (+ ULTIMATE.start_main_~ret~1 .cse24 4294967296)) (.cse22 (+ .cse9 .cse25 .cse26 .cse12 .cse13))) (and (or (and .cse0 (<= (* 4294967296 (div (+ .cse9 ULTIMATE.start_sum_~ret~0 2147483648) 4294967296)) .cse19)) (and .cse0 (= .cse20 .cse19))) .cse1 (or (<= .cse19 (+ (* 4294967296 .cse21) 2147483647)) (= .cse22 .cse20)) .cse2 (or (<= .cse19 (+ (* 4294967296 (div (+ .cse9 ULTIMATE.start_sum_~ret~0 (- 2147483648)) 4294967296)) 4294967295)) (let ((.cse23 (+ ULTIMATE.start_main_~ret~1 .cse24))) (and (= .cse22 .cse23) (= .cse23 .cse19)))) (< (+ (* 4 ULTIMATE.start_sum_~i~0) ULTIMATE.start_sum_~x.offset) (+ |ULTIMATE.start_main_~#x~0.offset| 17)) .cse14 (<= 4 ULTIMATE.start_sum_~i~0) .cse15))))) (let ((.cse30 (select .cse10 (+ .cse34 |ULTIMATE.start_main_~#x~0.offset| 12)))) (let ((.cse33 (+ .cse9 .cse30 ULTIMATE.start_sum_~ret~0 .cse32 .cse13))) (let ((.cse27 (* (div .cse33 4294967296) 4294967296)) (.cse28 (+ .cse9 .cse30 .cse32 .cse12 .cse13))) (and .cse1 .cse2 (or (= (+ ULTIMATE.start_main_~ret~1 .cse27 4294967296) .cse28) (let ((.cse29 (+ .cse9 .cse30 .cse31 ULTIMATE.start_sum_~ret~0 .cse32))) (<= .cse29 (+ (* 4294967296 (div .cse29 4294967296)) 2147483647)))) (or (= (+ ULTIMATE.start_main_~ret~1 .cse27) .cse28) (<= .cse33 (+ (* 4294967296 (div (+ .cse9 .cse30 ULTIMATE.start_sum_~ret~0 .cse32 .cse13 (- 2147483648)) 4294967296)) 4294967295))) (= .cse34 4) .cse14 (<= ULTIMATE.start_sum_~ret~0 .cse12) (let ((.cse38 (select .cse10 (+ .cse34 12)))) (let ((.cse35 (+ .cse9 .cse37 ULTIMATE.start_sum_~ret~0 .cse38 .cse39))) (let ((.cse36 (* (div .cse35 4294967296) 4294967296))) (or (and .cse0 (= .cse35 (+ ULTIMATE.start_main_~ret~1 .cse36)) (<= (* 4294967296 (div (+ .cse9 .cse37 ULTIMATE.start_sum_~ret~0 .cse38 .cse39 2147483648) 4294967296)) .cse35)) (and .cse0 (= .cse35 (+ ULTIMATE.start_main_~ret~1 .cse36 4294967296))))))) .cse15)))) (let ((.cse42 (+ .cse26 .cse12 .cse13))) (and (let ((.cse40 (+ .cse9 .cse37 ULTIMATE.start_sum_~ret~0))) (or (and .cse0 (<= .cse40 (+ (* 4294967296 (div (+ .cse9 .cse37 ULTIMATE.start_sum_~ret~0 (- 2147483648)) 4294967296)) 4294967295))) (and .cse0 (= (+ (* (div .cse40 4294967296) 4294967296) ULTIMATE.start_main_~ret~1) .cse40)))) (<= 3 ULTIMATE.start_sum_~i~0) (= .cse41 .cse18) .cse2 (<= .cse42 ULTIMATE.start_sum_~ret~0) (<= ULTIMATE.start_sum_~i~0 3) (<= ULTIMATE.start_sum_~ret~0 .cse42) .cse14 (let ((.cse44 (+ .cse9 .cse31 ULTIMATE.start_sum_~ret~0))) (let ((.cse43 (div .cse44 4294967296))) (or (= (+ .cse9 .cse31 .cse26 .cse12 .cse13) (+ ULTIMATE.start_main_~ret~1 (* .cse43 4294967296) 4294967296)) (<= .cse44 (+ (* 4294967296 .cse43) 2147483647))))) .cse15)) (let ((.cse47 (+ .cse9 .cse31 ULTIMATE.start_sum_~ret~0 .cse32))) (let ((.cse50 (div .cse47 4294967296))) (let ((.cse49 (* .cse50 4294967296)) (.cse48 (+ .cse31 .cse26 .cse32 .cse12 .cse13))) (and (let ((.cse45 (+ .cse9 .cse37 ULTIMATE.start_sum_~ret~0 .cse39))) (let ((.cse46 (* (div .cse45 4294967296) 4294967296))) (or (and .cse0 (<= .cse45 (+ (* 4294967296 (div (+ .cse9 .cse37 ULTIMATE.start_sum_~ret~0 .cse39 (- 2147483648)) 4294967296)) 4294967295)) (= .cse45 (+ ULTIMATE.start_main_~ret~1 .cse46 4294967296))) (and .cse0 (<= (* 4294967296 (div (+ .cse9 .cse37 ULTIMATE.start_sum_~ret~0 .cse39 2147483648) 4294967296)) .cse45) (= .cse45 (+ ULTIMATE.start_main_~ret~1 .cse46)))))) .cse1 (<= 2 ULTIMATE.start_sum_~i~0) (or (<= .cse47 (+ (* 4294967296 (div (+ .cse9 .cse31 ULTIMATE.start_sum_~ret~0 .cse32 (- 2147483648)) 4294967296)) 4294967295)) (= .cse48 (+ ULTIMATE.start_main_~ret~1 .cse49))) .cse2 (<= ULTIMATE.start_sum_~i~0 2) (or (<= .cse47 (+ (* 4294967296 .cse50) 2147483647)) (= (+ ULTIMATE.start_main_~ret~1 .cse49 4294967296) .cse48)) .cse14 .cse15)))) (let ((.cse54 (+ .cse25 .cse26 (select .cse55 .cse17) .cse12 .cse13))) (and .cse1 (let ((.cse53 (div ULTIMATE.start_sum_~ret~0 4294967296))) (let ((.cse52 (* .cse53 4294967296)) (.cse51 (* 4294967296 .cse53))) (or (and (<= ULTIMATE.start_sum_~ret~0 (+ .cse51 2147483647)) .cse0 (= (+ .cse52 ULTIMATE.start_main_~ret~1) ULTIMATE.start_sum_~ret~0)) (and .cse0 (= ULTIMATE.start_sum_~ret~0 (+ ULTIMATE.start_main_~ret~1 .cse52 4294967296)) (<= (+ .cse51 2147483648) ULTIMATE.start_sum_~ret~0))))) (<= 5 ULTIMATE.start_sum_~i~0) (<= ULTIMATE.start_sum_~ret~0 .cse54) (<= .cse54 ULTIMATE.start_sum_~ret~0) .cse15)))))) [2021-01-06 10:16:54,247 INFO L189 CegarLoopUtils]: For program point L20-14(lines 20 22) no Hoare annotation was computed. [2021-01-06 10:16:54,247 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-01-06 10:16:54,247 INFO L189 CegarLoopUtils]: For program point L50(line 50) no Hoare annotation was computed. [2021-01-06 10:16:54,247 INFO L189 CegarLoopUtils]: For program point L34-2(lines 34 36) no Hoare annotation was computed. [2021-01-06 10:16:54,247 INFO L185 CegarLoopUtils]: At program point L34-3(lines 34 36) the Hoare annotation is: (= |ULTIMATE.start_main_~#x~0.offset| 0) [2021-01-06 10:16:54,248 INFO L189 CegarLoopUtils]: For program point L34-4(lines 34 36) no Hoare annotation was computed. [2021-01-06 10:16:54,248 INFO L189 CegarLoopUtils]: For program point L43-2(lines 43 45) no Hoare annotation was computed. [2021-01-06 10:16:54,248 INFO L185 CegarLoopUtils]: At program point L43-3(lines 43 45) the Hoare annotation is: (let ((.cse14 (select |#memory_int| |ULTIMATE.start_main_~#x~0.base|)) (.cse12 (* ULTIMATE.start_main_~i~2 4))) (let ((.cse7 (select .cse14 (+ |ULTIMATE.start_main_~#x~0.offset| .cse12 4)))) (let ((.cse16 (+ |ULTIMATE.start_main_~#x~0.offset| 8)) (.cse20 (+ |ULTIMATE.start_main_~#x~0.offset| 4)) (.cse9 (store .cse14 (+ |ULTIMATE.start_main_~#x~0.offset| .cse12) .cse7))) (let ((.cse15 (+ |ULTIMATE.start_main_~#x~0.offset| 16)) (.cse23 (select .cse9 0)) (.cse26 (select .cse9 .cse20)) (.cse11 (select .cse9 .cse16))) (let ((.cse0 (or (and (< 2 ULTIMATE.start_main_~i~2) (not (= ULTIMATE.start_main_~i~2 3))) (and (= .cse12 12) (let ((.cse32 (+ .cse23 .cse7 .cse26 .cse11 ULTIMATE.start_main_~temp~0))) (let ((.cse31 (* (div .cse32 4294967296) 4294967296))) (or (= (+ ULTIMATE.start_main_~ret~1 .cse31 4294967296) .cse32) (= (+ ULTIMATE.start_main_~ret~1 .cse31) .cse32))))))) (.cse10 (+ |ULTIMATE.start_main_~#x~0.offset| 12)) (.cse8 (select .cse9 .cse15)) (.cse1 (= |ULTIMATE.start_main_~#x~0.offset| 0)) (.cse2 (let ((.cse30 (div ULTIMATE.start_sum_~ret~0 4294967296))) (let ((.cse28 (= ULTIMATE.start_main_~ret2~0 ULTIMATE.start_main_~ret~1)) (.cse29 (* .cse30 4294967296)) (.cse27 (* 4294967296 .cse30))) (or (and (<= ULTIMATE.start_sum_~ret~0 (+ .cse27 2147483647)) .cse28 (= (+ .cse29 ULTIMATE.start_main_~ret~1) ULTIMATE.start_sum_~ret~0)) (and .cse28 (= ULTIMATE.start_sum_~ret~0 (+ ULTIMATE.start_main_~ret~1 .cse29 4294967296)) (<= (+ .cse27 2147483648) ULTIMATE.start_sum_~ret~0)))))) (.cse3 (<= 5 ULTIMATE.start_sum_~i~0)) (.cse4 (= |ULTIMATE.start_sum_#res| ULTIMATE.start_main_~ret~1))) (or (and .cse0 .cse1 .cse2 .cse3 (<= ULTIMATE.start_main_~i~2 3) .cse4) (let ((.cse13 (+ (select .cse14 .cse10) (select .cse14 4) (select .cse14 .cse15) (select .cse14 |ULTIMATE.start_main_~#x~0.offset|) (select .cse14 .cse16)))) (and (let ((.cse5 (+ .cse7 .cse8 (select .cse9 .cse10) .cse11 ULTIMATE.start_main_~temp~0))) (let ((.cse6 (* (div .cse5 4294967296) 4294967296))) (or (= .cse5 (+ ULTIMATE.start_main_~ret~1 .cse6 4294967296)) (= .cse5 (+ ULTIMATE.start_main_~ret~1 .cse6))))) .cse1 (= .cse12 0) .cse2 .cse3 (<= ULTIMATE.start_sum_~ret~0 .cse13) .cse4 (<= .cse13 ULTIMATE.start_sum_~ret~0))) (and .cse0 .cse1 .cse2 .cse3 .cse4 (let ((.cse18 (let ((.cse19 (store .cse14 .cse15 ULTIMATE.start_main_~temp~0))) (+ (select .cse19 0) (select .cse19 .cse20) (select .cse19 .cse16) (select .cse19 .cse10) ULTIMATE.start_main_~temp~0)))) (let ((.cse17 (* (div .cse18 4294967296) 4294967296))) (or (= (+ ULTIMATE.start_main_~ret~1 .cse17) .cse18) (= (+ ULTIMATE.start_main_~ret~1 .cse17 4294967296) .cse18))))) (and (let ((.cse21 (+ (select .cse9 (+ |ULTIMATE.start_main_~#x~0.offset| .cse12 8)) .cse7 .cse23 .cse8 ULTIMATE.start_main_~temp~0))) (let ((.cse22 (* (div .cse21 4294967296) 4294967296))) (or (= .cse21 (+ ULTIMATE.start_main_~ret~1 .cse22)) (= .cse21 (+ ULTIMATE.start_main_~ret~1 .cse22 4294967296))))) (= .cse12 .cse20) .cse1 .cse2 .cse3 .cse4) (and (let ((.cse24 (+ .cse7 .cse23 .cse26 .cse8 ULTIMATE.start_main_~temp~0))) (let ((.cse25 (* (div .cse24 4294967296) 4294967296))) (or (= .cse24 (+ ULTIMATE.start_main_~ret~1 .cse25)) (= .cse24 (+ ULTIMATE.start_main_~ret~1 .cse25 4294967296))))) .cse1 .cse2 .cse3 .cse4 (= .cse12 .cse16)))))))) [2021-01-06 10:16:54,248 INFO L189 CegarLoopUtils]: For program point L43-4(lines 43 45) no Hoare annotation was computed. [2021-01-06 10:16:54,464 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.01 10:16:54 BoogieIcfgContainer [2021-01-06 10:16:54,464 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-01-06 10:16:54,465 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-01-06 10:16:54,465 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-01-06 10:16:54,465 INFO L275 PluginConnector]: Witness Printer initialized [2021-01-06 10:16:54,466 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 10:15:55" (3/4) ... [2021-01-06 10:16:54,474 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-01-06 10:16:54,493 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2021-01-06 10:16:54,493 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2021-01-06 10:16:54,494 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-01-06 10:16:54,494 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-01-06 10:16:54,533 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((ret <= unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x := unknown-#memory_int-unknown[x][x + 4]][x + 8] + unknown-#memory_int-unknown[x][x := unknown-#memory_int-unknown[x][x + 4]][x + 12] + unknown-#memory_int-unknown[x][x := unknown-#memory_int-unknown[x][x + 4]][x + 16] + unknown-#memory_int-unknown[x][x] && unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x := unknown-#memory_int-unknown[x][x + 4]][x + 8] + unknown-#memory_int-unknown[x][x := unknown-#memory_int-unknown[x][x + 4]][x + 12] + unknown-#memory_int-unknown[x][x := unknown-#memory_int-unknown[x][x + 4]][x + 16] + unknown-#memory_int-unknown[x][x] <= ret) && x == 0) && (unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x := unknown-#memory_int-unknown[x][x + 4]][x + 8] + unknown-#memory_int-unknown[x][x := unknown-#memory_int-unknown[x][x + 4]][x + 12] + unknown-#memory_int-unknown[x][x := unknown-#memory_int-unknown[x][x + 4]][x + 16] + unknown-#memory_int-unknown[x][x] == \result + 4294967296 * ((unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x := unknown-#memory_int-unknown[x][x + 4]][x + 8] + unknown-#memory_int-unknown[x][x := unknown-#memory_int-unknown[x][x + 4]][x + 12] + unknown-#memory_int-unknown[x][x := unknown-#memory_int-unknown[x][x + 4]][x + 16] + unknown-#memory_int-unknown[x][x]) / 4294967296) + 4294967296 || unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x := unknown-#memory_int-unknown[x][x + 4]][x + 8] + unknown-#memory_int-unknown[x][x := unknown-#memory_int-unknown[x][x + 4]][x + 12] + unknown-#memory_int-unknown[x][x := unknown-#memory_int-unknown[x][x + 4]][x + 16] + unknown-#memory_int-unknown[x][x] <= 4294967296 * ((unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x := unknown-#memory_int-unknown[x][x + 4]][x + 8] + unknown-#memory_int-unknown[x][x := unknown-#memory_int-unknown[x][x + 4]][x + 12] + unknown-#memory_int-unknown[x][x := unknown-#memory_int-unknown[x][x + 4]][x + 16] + unknown-#memory_int-unknown[x][x]) / 4294967296) + 2147483647)) && 5 <= i) && (\result + 4294967296 * ((unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x := unknown-#memory_int-unknown[x][x + 4]][x + 8] + unknown-#memory_int-unknown[x][x := unknown-#memory_int-unknown[x][x + 4]][x + 12] + unknown-#memory_int-unknown[x][x := unknown-#memory_int-unknown[x][x + 4]][x + 16] + unknown-#memory_int-unknown[x][x]) / 4294967296) == unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x := unknown-#memory_int-unknown[x][x + 4]][x + 8] + unknown-#memory_int-unknown[x][x := unknown-#memory_int-unknown[x][x + 4]][x + 12] + unknown-#memory_int-unknown[x][x := unknown-#memory_int-unknown[x][x + 4]][x + 16] + unknown-#memory_int-unknown[x][x] || unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x := unknown-#memory_int-unknown[x][x + 4]][x + 8] + unknown-#memory_int-unknown[x][x := unknown-#memory_int-unknown[x][x + 4]][x + 12] + unknown-#memory_int-unknown[x][x := unknown-#memory_int-unknown[x][x + 4]][x + 16] + unknown-#memory_int-unknown[x][x] <= 4294967296 * ((unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x := unknown-#memory_int-unknown[x][x + 4]][x + 8] + unknown-#memory_int-unknown[x][x := unknown-#memory_int-unknown[x][x + 4]][x + 12] + unknown-#memory_int-unknown[x][x := unknown-#memory_int-unknown[x][x + 4]][x + 16] + unknown-#memory_int-unknown[x][x] + -2147483648) / 4294967296) + 4294967295) [2021-01-06 10:16:54,534 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((x == 0 && (4294967296 * (ret / 4294967296) + 2147483647 < ret || 4294967296 * (ret / 4294967296) + ret == ret)) && 5 <= i) && ret <= unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x] + unknown-#memory_int-unknown[x][x + 8]) && unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x] + unknown-#memory_int-unknown[x][x + 8] <= ret) && ((\result == ret && unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x] + unknown-#memory_int-unknown[x][x + 8] == ret + 4294967296 * ((unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x] + unknown-#memory_int-unknown[x][x + 8]) / 4294967296) + 4294967296) || (4294967296 * ((unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x] + unknown-#memory_int-unknown[x][x + 8] + 2147483648) / 4294967296) <= unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x] + unknown-#memory_int-unknown[x][x + 8] && \result == ret)) [2021-01-06 10:16:54,535 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((2 < i && !(i == 3)) || (i * 4 == 12 && (ret + (unknown-#memory_int-unknown[x][x + i * 4 := unknown-#memory_int-unknown[x][x + i * 4 + 4]][0] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + unknown-#memory_int-unknown[x][x + i * 4 := unknown-#memory_int-unknown[x][x + i * 4 + 4]][x + 4] + unknown-#memory_int-unknown[x][x + i * 4 := unknown-#memory_int-unknown[x][x + i * 4 + 4]][x + 8] + temp) / 4294967296 * 4294967296 + 4294967296 == unknown-#memory_int-unknown[x][x + i * 4 := unknown-#memory_int-unknown[x][x + i * 4 + 4]][0] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + unknown-#memory_int-unknown[x][x + i * 4 := unknown-#memory_int-unknown[x][x + i * 4 + 4]][x + 4] + unknown-#memory_int-unknown[x][x + i * 4 := unknown-#memory_int-unknown[x][x + i * 4 + 4]][x + 8] + temp || ret + (unknown-#memory_int-unknown[x][x + i * 4 := unknown-#memory_int-unknown[x][x + i * 4 + 4]][0] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + unknown-#memory_int-unknown[x][x + i * 4 := unknown-#memory_int-unknown[x][x + i * 4 + 4]][x + 4] + unknown-#memory_int-unknown[x][x + i * 4 := unknown-#memory_int-unknown[x][x + i * 4 + 4]][x + 8] + temp) / 4294967296 * 4294967296 == unknown-#memory_int-unknown[x][x + i * 4 := unknown-#memory_int-unknown[x][x + i * 4 + 4]][0] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + unknown-#memory_int-unknown[x][x + i * 4 := unknown-#memory_int-unknown[x][x + i * 4 + 4]][x + 4] + unknown-#memory_int-unknown[x][x + i * 4 := unknown-#memory_int-unknown[x][x + i * 4 + 4]][x + 8] + temp))) && x == 0) && (((ret <= 4294967296 * (ret / 4294967296) + 2147483647 && ret2 == ret) && ret / 4294967296 * 4294967296 + ret == ret) || ((ret2 == ret && ret == ret + ret / 4294967296 * 4294967296 + 4294967296) && 4294967296 * (ret / 4294967296) + 2147483648 <= ret))) && 5 <= i) && i <= 3) && \result == ret) || ((((((((unknown-#memory_int-unknown[x][x + i * 4 + 4] + unknown-#memory_int-unknown[x][x + i * 4 := unknown-#memory_int-unknown[x][x + i * 4 + 4]][x + 16] + unknown-#memory_int-unknown[x][x + i * 4 := unknown-#memory_int-unknown[x][x + i * 4 + 4]][x + 12] + unknown-#memory_int-unknown[x][x + i * 4 := unknown-#memory_int-unknown[x][x + i * 4 + 4]][x + 8] + temp == ret + (unknown-#memory_int-unknown[x][x + i * 4 + 4] + unknown-#memory_int-unknown[x][x + i * 4 := unknown-#memory_int-unknown[x][x + i * 4 + 4]][x + 16] + unknown-#memory_int-unknown[x][x + i * 4 := unknown-#memory_int-unknown[x][x + i * 4 + 4]][x + 12] + unknown-#memory_int-unknown[x][x + i * 4 := unknown-#memory_int-unknown[x][x + i * 4 + 4]][x + 8] + temp) / 4294967296 * 4294967296 + 4294967296 || unknown-#memory_int-unknown[x][x + i * 4 + 4] + unknown-#memory_int-unknown[x][x + i * 4 := unknown-#memory_int-unknown[x][x + i * 4 + 4]][x + 16] + unknown-#memory_int-unknown[x][x + i * 4 := unknown-#memory_int-unknown[x][x + i * 4 + 4]][x + 12] + unknown-#memory_int-unknown[x][x + i * 4 := unknown-#memory_int-unknown[x][x + i * 4 + 4]][x + 8] + temp == ret + (unknown-#memory_int-unknown[x][x + i * 4 + 4] + unknown-#memory_int-unknown[x][x + i * 4 := unknown-#memory_int-unknown[x][x + i * 4 + 4]][x + 16] + unknown-#memory_int-unknown[x][x + i * 4 := unknown-#memory_int-unknown[x][x + i * 4 + 4]][x + 12] + unknown-#memory_int-unknown[x][x + i * 4 := unknown-#memory_int-unknown[x][x + i * 4 + 4]][x + 8] + temp) / 4294967296 * 4294967296) && x == 0) && i * 4 == 0) && (((ret <= 4294967296 * (ret / 4294967296) + 2147483647 && ret2 == ret) && ret / 4294967296 * 4294967296 + ret == ret) || ((ret2 == ret && ret == ret + ret / 4294967296 * 4294967296 + 4294967296) && 4294967296 * (ret / 4294967296) + 2147483648 <= ret))) && 5 <= i) && ret <= unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x] + unknown-#memory_int-unknown[x][x + 8]) && \result == ret) && unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x] + unknown-#memory_int-unknown[x][x + 8] <= ret)) || (((((((2 < i && !(i == 3)) || (i * 4 == 12 && (ret + (unknown-#memory_int-unknown[x][x + i * 4 := unknown-#memory_int-unknown[x][x + i * 4 + 4]][0] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + unknown-#memory_int-unknown[x][x + i * 4 := unknown-#memory_int-unknown[x][x + i * 4 + 4]][x + 4] + unknown-#memory_int-unknown[x][x + i * 4 := unknown-#memory_int-unknown[x][x + i * 4 + 4]][x + 8] + temp) / 4294967296 * 4294967296 + 4294967296 == unknown-#memory_int-unknown[x][x + i * 4 := unknown-#memory_int-unknown[x][x + i * 4 + 4]][0] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + unknown-#memory_int-unknown[x][x + i * 4 := unknown-#memory_int-unknown[x][x + i * 4 + 4]][x + 4] + unknown-#memory_int-unknown[x][x + i * 4 := unknown-#memory_int-unknown[x][x + i * 4 + 4]][x + 8] + temp || ret + (unknown-#memory_int-unknown[x][x + i * 4 := unknown-#memory_int-unknown[x][x + i * 4 + 4]][0] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + unknown-#memory_int-unknown[x][x + i * 4 := unknown-#memory_int-unknown[x][x + i * 4 + 4]][x + 4] + unknown-#memory_int-unknown[x][x + i * 4 := unknown-#memory_int-unknown[x][x + i * 4 + 4]][x + 8] + temp) / 4294967296 * 4294967296 == unknown-#memory_int-unknown[x][x + i * 4 := unknown-#memory_int-unknown[x][x + i * 4 + 4]][0] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + unknown-#memory_int-unknown[x][x + i * 4 := unknown-#memory_int-unknown[x][x + i * 4 + 4]][x + 4] + unknown-#memory_int-unknown[x][x + i * 4 := unknown-#memory_int-unknown[x][x + i * 4 + 4]][x + 8] + temp))) && x == 0) && (((ret <= 4294967296 * (ret / 4294967296) + 2147483647 && ret2 == ret) && ret / 4294967296 * 4294967296 + ret == ret) || ((ret2 == ret && ret == ret + ret / 4294967296 * 4294967296 + 4294967296) && 4294967296 * (ret / 4294967296) + 2147483648 <= ret))) && 5 <= i) && \result == ret) && (ret + (unknown-#memory_int-unknown[x][x + 16 := temp][0] + unknown-#memory_int-unknown[x][x + 16 := temp][x + 4] + unknown-#memory_int-unknown[x][x + 16 := temp][x + 8] + unknown-#memory_int-unknown[x][x + 16 := temp][x + 12] + temp) / 4294967296 * 4294967296 == unknown-#memory_int-unknown[x][x + 16 := temp][0] + unknown-#memory_int-unknown[x][x + 16 := temp][x + 4] + unknown-#memory_int-unknown[x][x + 16 := temp][x + 8] + unknown-#memory_int-unknown[x][x + 16 := temp][x + 12] + temp || ret + (unknown-#memory_int-unknown[x][x + 16 := temp][0] + unknown-#memory_int-unknown[x][x + 16 := temp][x + 4] + unknown-#memory_int-unknown[x][x + 16 := temp][x + 8] + unknown-#memory_int-unknown[x][x + 16 := temp][x + 12] + temp) / 4294967296 * 4294967296 + 4294967296 == unknown-#memory_int-unknown[x][x + 16 := temp][0] + unknown-#memory_int-unknown[x][x + 16 := temp][x + 4] + unknown-#memory_int-unknown[x][x + 16 := temp][x + 8] + unknown-#memory_int-unknown[x][x + 16 := temp][x + 12] + temp))) || ((((((unknown-#memory_int-unknown[x][x + i * 4 := unknown-#memory_int-unknown[x][x + i * 4 + 4]][x + i * 4 + 8] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + unknown-#memory_int-unknown[x][x + i * 4 := unknown-#memory_int-unknown[x][x + i * 4 + 4]][0] + unknown-#memory_int-unknown[x][x + i * 4 := unknown-#memory_int-unknown[x][x + i * 4 + 4]][x + 16] + temp == ret + (unknown-#memory_int-unknown[x][x + i * 4 := unknown-#memory_int-unknown[x][x + i * 4 + 4]][x + i * 4 + 8] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + unknown-#memory_int-unknown[x][x + i * 4 := unknown-#memory_int-unknown[x][x + i * 4 + 4]][0] + unknown-#memory_int-unknown[x][x + i * 4 := unknown-#memory_int-unknown[x][x + i * 4 + 4]][x + 16] + temp) / 4294967296 * 4294967296 || unknown-#memory_int-unknown[x][x + i * 4 := unknown-#memory_int-unknown[x][x + i * 4 + 4]][x + i * 4 + 8] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + unknown-#memory_int-unknown[x][x + i * 4 := unknown-#memory_int-unknown[x][x + i * 4 + 4]][0] + unknown-#memory_int-unknown[x][x + i * 4 := unknown-#memory_int-unknown[x][x + i * 4 + 4]][x + 16] + temp == ret + (unknown-#memory_int-unknown[x][x + i * 4 := unknown-#memory_int-unknown[x][x + i * 4 + 4]][x + i * 4 + 8] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + unknown-#memory_int-unknown[x][x + i * 4 := unknown-#memory_int-unknown[x][x + i * 4 + 4]][0] + unknown-#memory_int-unknown[x][x + i * 4 := unknown-#memory_int-unknown[x][x + i * 4 + 4]][x + 16] + temp) / 4294967296 * 4294967296 + 4294967296) && i * 4 == x + 4) && x == 0) && (((ret <= 4294967296 * (ret / 4294967296) + 2147483647 && ret2 == ret) && ret / 4294967296 * 4294967296 + ret == ret) || ((ret2 == ret && ret == ret + ret / 4294967296 * 4294967296 + 4294967296) && 4294967296 * (ret / 4294967296) + 2147483648 <= ret))) && 5 <= i) && \result == ret)) || ((((((unknown-#memory_int-unknown[x][x + i * 4 + 4] + unknown-#memory_int-unknown[x][x + i * 4 := unknown-#memory_int-unknown[x][x + i * 4 + 4]][0] + unknown-#memory_int-unknown[x][x + i * 4 := unknown-#memory_int-unknown[x][x + i * 4 + 4]][x + 4] + unknown-#memory_int-unknown[x][x + i * 4 := unknown-#memory_int-unknown[x][x + i * 4 + 4]][x + 16] + temp == ret + (unknown-#memory_int-unknown[x][x + i * 4 + 4] + unknown-#memory_int-unknown[x][x + i * 4 := unknown-#memory_int-unknown[x][x + i * 4 + 4]][0] + unknown-#memory_int-unknown[x][x + i * 4 := unknown-#memory_int-unknown[x][x + i * 4 + 4]][x + 4] + unknown-#memory_int-unknown[x][x + i * 4 := unknown-#memory_int-unknown[x][x + i * 4 + 4]][x + 16] + temp) / 4294967296 * 4294967296 || unknown-#memory_int-unknown[x][x + i * 4 + 4] + unknown-#memory_int-unknown[x][x + i * 4 := unknown-#memory_int-unknown[x][x + i * 4 + 4]][0] + unknown-#memory_int-unknown[x][x + i * 4 := unknown-#memory_int-unknown[x][x + i * 4 + 4]][x + 4] + unknown-#memory_int-unknown[x][x + i * 4 := unknown-#memory_int-unknown[x][x + i * 4 + 4]][x + 16] + temp == ret + (unknown-#memory_int-unknown[x][x + i * 4 + 4] + unknown-#memory_int-unknown[x][x + i * 4 := unknown-#memory_int-unknown[x][x + i * 4 + 4]][0] + unknown-#memory_int-unknown[x][x + i * 4 := unknown-#memory_int-unknown[x][x + i * 4 + 4]][x + 4] + unknown-#memory_int-unknown[x][x + i * 4 := unknown-#memory_int-unknown[x][x + i * 4 + 4]][x + 16] + temp) / 4294967296 * 4294967296 + 4294967296) && x == 0) && (((ret <= 4294967296 * (ret / 4294967296) + 2147483647 && ret2 == ret) && ret / 4294967296 * 4294967296 + ret == ret) || ((ret2 == ret && ret == ret + ret / 4294967296 * 4294967296 + 4294967296) && 4294967296 * (ret / 4294967296) + 2147483648 <= ret))) && 5 <= i) && \result == ret) && i * 4 == x + 8) [2021-01-06 10:16:54,540 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((ret + 4294967296 * ((unknown-#memory_int-unknown[x][x + 16 := temp][0] + unknown-#memory_int-unknown[x][x + 16 := temp][x + 4] + unknown-#memory_int-unknown[x][x + 16 := temp][x + 8] + unknown-#memory_int-unknown[x][x + 16 := temp][x + 12] + temp) / 4294967296) + 4294967296 == unknown-#memory_int-unknown[x][x + 16 := temp][0] + unknown-#memory_int-unknown[x][x + 16 := temp][x + 4] + unknown-#memory_int-unknown[x][x + 16 := temp][x + 8] + unknown-#memory_int-unknown[x][x + 16 := temp][x + 12] + temp || ret + 4294967296 * ((unknown-#memory_int-unknown[x][x + 16 := temp][0] + unknown-#memory_int-unknown[x][x + 16 := temp][x + 4] + unknown-#memory_int-unknown[x][x + 16 := temp][x + 8] + unknown-#memory_int-unknown[x][x + 16 := temp][x + 12] + temp) / 4294967296) == unknown-#memory_int-unknown[x][x + 16 := temp][0] + unknown-#memory_int-unknown[x][x + 16 := temp][x + 4] + unknown-#memory_int-unknown[x][x + 16 := temp][x + 8] + unknown-#memory_int-unknown[x][x + 16 := temp][x + 12] + temp) && x == 0) && ret <= unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x] + unknown-#memory_int-unknown[x][x + 8]) && \result == ret) && unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x] + unknown-#memory_int-unknown[x][x + 8] <= ret) && (((ret <= 4294967296 * (ret / 4294967296) + 2147483647 && ret2 == ret) && 4294967296 * (ret / 4294967296) + ret == ret) || ((ret == ret + 4294967296 * (ret / 4294967296) + 4294967296 && ret2 == ret) && 4294967296 * (ret / 4294967296) + 2147483648 <= ret)) [2021-01-06 10:16:54,610 INFO L141 WitnessManager]: Wrote witness to /storage/repos/svcomp/c/reducercommutativity/sum05-2.i-witness.graphml [2021-01-06 10:16:54,610 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-01-06 10:16:54,611 INFO L168 Benchmark]: Toolchain (without parser) took 60267.79 ms. Allocated memory was 151.0 MB in the beginning and 241.2 MB in the end (delta: 90.2 MB). Free memory was 127.1 MB in the beginning and 99.8 MB in the end (delta: 27.4 MB). Peak memory consumption was 118.3 MB. Max. memory is 8.0 GB. [2021-01-06 10:16:54,612 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 151.0 MB. Free memory is still 126.8 MB. There was no memory consumed. Max. memory is 8.0 GB. [2021-01-06 10:16:54,612 INFO L168 Benchmark]: CACSL2BoogieTranslator took 264.29 ms. Allocated memory is still 151.0 MB. Free memory was 127.0 MB in the beginning and 116.7 MB in the end (delta: 10.2 MB). Peak memory consumption was 10.5 MB. Max. memory is 8.0 GB. [2021-01-06 10:16:54,613 INFO L168 Benchmark]: Boogie Procedure Inliner took 70.15 ms. Allocated memory is still 151.0 MB. Free memory was 116.7 MB in the beginning and 115.0 MB in the end (delta: 1.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2021-01-06 10:16:54,613 INFO L168 Benchmark]: Boogie Preprocessor took 68.65 ms. Allocated memory is still 151.0 MB. Free memory was 115.0 MB in the beginning and 113.8 MB in the end (delta: 1.2 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. [2021-01-06 10:16:54,614 INFO L168 Benchmark]: RCFGBuilder took 747.24 ms. Allocated memory is still 151.0 MB. Free memory was 113.6 MB in the beginning and 131.0 MB in the end (delta: -17.4 MB). Peak memory consumption was 17.9 MB. Max. memory is 8.0 GB. [2021-01-06 10:16:54,614 INFO L168 Benchmark]: TraceAbstraction took 58958.24 ms. Allocated memory was 151.0 MB in the beginning and 241.2 MB in the end (delta: 90.2 MB). Free memory was 130.4 MB in the beginning and 108.7 MB in the end (delta: 21.8 MB). Peak memory consumption was 146.6 MB. Max. memory is 8.0 GB. [2021-01-06 10:16:54,614 INFO L168 Benchmark]: Witness Printer took 145.38 ms. Allocated memory is still 241.2 MB. Free memory was 108.7 MB in the beginning and 99.8 MB in the end (delta: 8.9 MB). Peak memory consumption was 8.4 MB. Max. memory is 8.0 GB. [2021-01-06 10:16:54,618 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.18 ms. Allocated memory is still 151.0 MB. Free memory is still 126.8 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 264.29 ms. Allocated memory is still 151.0 MB. Free memory was 127.0 MB in the beginning and 116.7 MB in the end (delta: 10.2 MB). Peak memory consumption was 10.5 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 70.15 ms. Allocated memory is still 151.0 MB. Free memory was 116.7 MB in the beginning and 115.0 MB in the end (delta: 1.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 68.65 ms. Allocated memory is still 151.0 MB. Free memory was 115.0 MB in the beginning and 113.8 MB in the end (delta: 1.2 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. * RCFGBuilder took 747.24 ms. Allocated memory is still 151.0 MB. Free memory was 113.6 MB in the beginning and 131.0 MB in the end (delta: -17.4 MB). Peak memory consumption was 17.9 MB. Max. memory is 8.0 GB. * TraceAbstraction took 58958.24 ms. Allocated memory was 151.0 MB in the beginning and 241.2 MB in the end (delta: 90.2 MB). Free memory was 130.4 MB in the beginning and 108.7 MB in the end (delta: 21.8 MB). Peak memory consumption was 146.6 MB. Max. memory is 8.0 GB. * Witness Printer took 145.38 ms. Allocated memory is still 241.2 MB. Free memory was 108.7 MB in the beginning and 99.8 MB in the end (delta: 8.9 MB). Peak memory consumption was 8.4 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 50]: 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: 34]: Loop Invariant Derived loop invariant: x == 0 - InvariantResult [Line: 15]: Loop Invariant Derived loop invariant: (((((ret + 4294967296 * ((unknown-#memory_int-unknown[x][x + 16 := temp][0] + unknown-#memory_int-unknown[x][x + 16 := temp][x + 4] + unknown-#memory_int-unknown[x][x + 16 := temp][x + 8] + unknown-#memory_int-unknown[x][x + 16 := temp][x + 12] + temp) / 4294967296) + 4294967296 == unknown-#memory_int-unknown[x][x + 16 := temp][0] + unknown-#memory_int-unknown[x][x + 16 := temp][x + 4] + unknown-#memory_int-unknown[x][x + 16 := temp][x + 8] + unknown-#memory_int-unknown[x][x + 16 := temp][x + 12] + temp || ret + 4294967296 * ((unknown-#memory_int-unknown[x][x + 16 := temp][0] + unknown-#memory_int-unknown[x][x + 16 := temp][x + 4] + unknown-#memory_int-unknown[x][x + 16 := temp][x + 8] + unknown-#memory_int-unknown[x][x + 16 := temp][x + 12] + temp) / 4294967296) == unknown-#memory_int-unknown[x][x + 16 := temp][0] + unknown-#memory_int-unknown[x][x + 16 := temp][x + 4] + unknown-#memory_int-unknown[x][x + 16 := temp][x + 8] + unknown-#memory_int-unknown[x][x + 16 := temp][x + 12] + temp) && x == 0) && ret <= unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x] + unknown-#memory_int-unknown[x][x + 8]) && \result == ret) && unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x] + unknown-#memory_int-unknown[x][x + 8] <= ret) && (((ret <= 4294967296 * (ret / 4294967296) + 2147483647 && ret2 == ret) && 4294967296 * (ret / 4294967296) + ret == ret) || ((ret == ret + 4294967296 * (ret / 4294967296) + 4294967296 && ret2 == ret) && 4294967296 * (ret / 4294967296) + 2147483648 <= ret)) - InvariantResult [Line: 15]: Loop Invariant Derived loop invariant: ((((x == 0 && (4294967296 * (ret / 4294967296) + 2147483647 < ret || 4294967296 * (ret / 4294967296) + ret == ret)) && 5 <= i) && ret <= unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x] + unknown-#memory_int-unknown[x][x + 8]) && unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x] + unknown-#memory_int-unknown[x][x + 8] <= ret) && ((\result == ret && unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x] + unknown-#memory_int-unknown[x][x + 8] == ret + 4294967296 * ((unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x] + unknown-#memory_int-unknown[x][x + 8]) / 4294967296) + 4294967296) || (4294967296 * ((unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x] + unknown-#memory_int-unknown[x][x + 8] + 2147483648) / 4294967296) <= unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x] + unknown-#memory_int-unknown[x][x + 8] && \result == ret)) - InvariantResult [Line: 20]: Loop Invariant Derived loop invariant: (((((((ret <= unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x := unknown-#memory_int-unknown[x][x + 4]][x + 8] + unknown-#memory_int-unknown[x][x := unknown-#memory_int-unknown[x][x + 4]][x + 12] + unknown-#memory_int-unknown[x][x := unknown-#memory_int-unknown[x][x + 4]][x + 16] + unknown-#memory_int-unknown[x][x] && unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x := unknown-#memory_int-unknown[x][x + 4]][x + 8] + unknown-#memory_int-unknown[x][x := unknown-#memory_int-unknown[x][x + 4]][x + 12] + unknown-#memory_int-unknown[x][x := unknown-#memory_int-unknown[x][x + 4]][x + 16] + unknown-#memory_int-unknown[x][x] <= ret) && x == 0) && 5 <= i) || ((((i * 4 + x == x && x == x) && ret == 0) && x == 0) && i == 0)) || (((((x == 0 && i * 4 + x == x + 12) && unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x := unknown-#memory_int-unknown[x][x + 4]][x + 8] + unknown-#memory_int-unknown[x][x := unknown-#memory_int-unknown[x][x + 4]][x + 12] + unknown-#memory_int-unknown[x][x := unknown-#memory_int-unknown[x][x + 4]][x + 16] + unknown-#memory_int-unknown[x][x] <= unknown-#memory_int-unknown[x][i * 4 + x] + unknown-#memory_int-unknown[x][i * 4 + x + 4] + ret) && x == x) && unknown-#memory_int-unknown[x][i * 4 + x] + unknown-#memory_int-unknown[x][i * 4 + x + 4] + ret <= unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x := unknown-#memory_int-unknown[x][x + 4]][x + 8] + unknown-#memory_int-unknown[x][x := unknown-#memory_int-unknown[x][x + 4]][x + 12] + unknown-#memory_int-unknown[x][x := unknown-#memory_int-unknown[x][x + 4]][x + 16] + unknown-#memory_int-unknown[x][x]) && x == 0)) || (((((x == 0 && x == x) && i * 4 + x == x + 8) && x == 0) && ret + unknown-#memory_int-unknown[x][i * 4 + x + 8] <= unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x := unknown-#memory_int-unknown[x][x + 4]][x + 16] + unknown-#memory_int-unknown[x][x]) && unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x := unknown-#memory_int-unknown[x][x + 4]][x + 16] + unknown-#memory_int-unknown[x][x] <= ret + unknown-#memory_int-unknown[x][i * 4 + x + 8])) || ((((((unknown-#memory_int-unknown[x][i * 4 + x] + ret <= unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x := unknown-#memory_int-unknown[x][x + 4]][x + 8] + unknown-#memory_int-unknown[x][x := unknown-#memory_int-unknown[x][x + 4]][x + 12] + unknown-#memory_int-unknown[x][x := unknown-#memory_int-unknown[x][x + 4]][x + 16] + unknown-#memory_int-unknown[x][x] && x == 0) && x == x) && unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x := unknown-#memory_int-unknown[x][x + 4]][x + 8] + unknown-#memory_int-unknown[x][x := unknown-#memory_int-unknown[x][x + 4]][x + 12] + unknown-#memory_int-unknown[x][x := unknown-#memory_int-unknown[x][x + 4]][x + 16] + unknown-#memory_int-unknown[x][x] <= unknown-#memory_int-unknown[x][i * 4 + x] + ret) && i <= 4) && x == 0) && 4 <= i)) || (((((x == 0 && x == x) && unknown-#memory_int-unknown[x][i * 4 + x] + unknown-#memory_int-unknown[x][i * 4 + x + 12] + ret <= unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x := unknown-#memory_int-unknown[x][x + 4]][x + 16] + unknown-#memory_int-unknown[x][x]) && unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x := unknown-#memory_int-unknown[x][x + 4]][x + 16] + unknown-#memory_int-unknown[x][x] <= unknown-#memory_int-unknown[x][i * 4 + x] + unknown-#memory_int-unknown[x][i * 4 + x + 12] + ret) && i * 4 == 4) && x == 0) - InvariantResult [Line: 20]: Loop Invariant Derived loop invariant: (((((((((((x == 0 && i * 4 + x == x + 12) && x == x) && unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x] + unknown-#memory_int-unknown[x][x + 8] <= ret) && ret <= unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x] + unknown-#memory_int-unknown[x][x + 8]) && (unknown-#memory_int-unknown[x][i * 4 + x] + unknown-#memory_int-unknown[x][i * 4 + x + 4] + ret == ret + (unknown-#memory_int-unknown[x][i * 4 + x] + unknown-#memory_int-unknown[x][i * 4 + x + 4] + ret) / 4294967296 * 4294967296 || unknown-#memory_int-unknown[x][i * 4 + x] + unknown-#memory_int-unknown[x][i * 4 + x + 4] + ret <= 4294967296 * ((unknown-#memory_int-unknown[x][i * 4 + x] + unknown-#memory_int-unknown[x][i * 4 + x + 4] + ret + -2147483648) / 4294967296) + 4294967295)) && x == 0) && (unknown-#memory_int-unknown[x][i * 4 + x] + unknown-#memory_int-unknown[x][i * 4 + x + 4] + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x] + unknown-#memory_int-unknown[x][x + 8] == ret + (unknown-#memory_int-unknown[x][i * 4 + x] + unknown-#memory_int-unknown[x][i * 4 + x + 4] + ret) / 4294967296 * 4294967296 + 4294967296 || unknown-#memory_int-unknown[x][i * 4 + x] + unknown-#memory_int-unknown[x][i * 4 + x + 4] + ret <= 4294967296 * ((unknown-#memory_int-unknown[x][i * 4 + x] + unknown-#memory_int-unknown[x][i * 4 + x + 4] + ret) / 4294967296) + 2147483647)) || (((((((unknown-#memory_int-unknown[x][x] <= ret && x == 0) && x == x) && (ret + (unknown-#memory_int-unknown[x][i * 4 + x] + unknown-#memory_int-unknown[x][i * 4 + x + 12] + ret + unknown-#memory_int-unknown[x][i * 4 + x + 8] + unknown-#memory_int-unknown[x][x + 8]) / 4294967296 * 4294967296 + 4294967296 == unknown-#memory_int-unknown[x][i * 4 + x] + unknown-#memory_int-unknown[x][i * 4 + x + 12] + unknown-#memory_int-unknown[x][i * 4 + x + 8] + unknown-#memory_int-unknown[x][x] + unknown-#memory_int-unknown[x][x + 8] || unknown-#memory_int-unknown[x][i * 4 + x] + unknown-#memory_int-unknown[x][i * 4 + x + 12] + unknown-#memory_int-unknown[x][i * 4 + x + 4] + ret + unknown-#memory_int-unknown[x][i * 4 + x + 8] <= 4294967296 * ((unknown-#memory_int-unknown[x][i * 4 + x] + unknown-#memory_int-unknown[x][i * 4 + x + 12] + unknown-#memory_int-unknown[x][i * 4 + x + 4] + ret + unknown-#memory_int-unknown[x][i * 4 + x + 8]) / 4294967296) + 2147483647)) && (ret + (unknown-#memory_int-unknown[x][i * 4 + x] + unknown-#memory_int-unknown[x][i * 4 + x + 12] + ret + unknown-#memory_int-unknown[x][i * 4 + x + 8] + unknown-#memory_int-unknown[x][x + 8]) / 4294967296 * 4294967296 == unknown-#memory_int-unknown[x][i * 4 + x] + unknown-#memory_int-unknown[x][i * 4 + x + 12] + unknown-#memory_int-unknown[x][i * 4 + x + 8] + unknown-#memory_int-unknown[x][x] + unknown-#memory_int-unknown[x][x + 8] || unknown-#memory_int-unknown[x][i * 4 + x] + unknown-#memory_int-unknown[x][i * 4 + x + 12] + ret + unknown-#memory_int-unknown[x][i * 4 + x + 8] + unknown-#memory_int-unknown[x][x + 8] <= 4294967296 * ((unknown-#memory_int-unknown[x][i * 4 + x] + unknown-#memory_int-unknown[x][i * 4 + x + 12] + ret + unknown-#memory_int-unknown[x][i * 4 + x + 8] + unknown-#memory_int-unknown[x][x + 8] + -2147483648) / 4294967296) + 4294967295)) && i * 4 == 4) && x == 0) && ret <= unknown-#memory_int-unknown[x][x])) || (((((x == 0 && (ret <= 4294967296 * (ret / 4294967296) + 2147483647 || unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x] + unknown-#memory_int-unknown[x][x + 8] == ret / 4294967296 * 4294967296 + ret + 4294967296)) && 5 <= i) && (4294967296 * (ret / 4294967296) + 2147483647 < ret || ret / 4294967296 * 4294967296 + ret == ret)) && ret <= unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x] + unknown-#memory_int-unknown[x][x + 8]) && unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x] + unknown-#memory_int-unknown[x][x + 8] <= ret)) || (((((((unknown-#memory_int-unknown[x][i * 4 + x] + ret <= 4294967296 * ((unknown-#memory_int-unknown[x][i * 4 + x] + ret) / 4294967296) + 2147483647 || (ret + (unknown-#memory_int-unknown[x][i * 4 + x] + ret) / 4294967296 * 4294967296 + 4294967296 == unknown-#memory_int-unknown[x][i * 4 + x] + ret && unknown-#memory_int-unknown[x][i * 4 + x] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x] + unknown-#memory_int-unknown[x][x + 8] == ret + (unknown-#memory_int-unknown[x][i * 4 + x] + ret) / 4294967296 * 4294967296 + 4294967296)) && x == 0) && x == x) && (unknown-#memory_int-unknown[x][i * 4 + x] + ret <= 4294967296 * ((unknown-#memory_int-unknown[x][i * 4 + x] + ret + -2147483648) / 4294967296) + 4294967295 || (unknown-#memory_int-unknown[x][i * 4 + x] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x] + unknown-#memory_int-unknown[x][x + 8] == ret + (unknown-#memory_int-unknown[x][i * 4 + x] + ret) / 4294967296 * 4294967296 && ret + (unknown-#memory_int-unknown[x][i * 4 + x] + ret) / 4294967296 * 4294967296 == unknown-#memory_int-unknown[x][i * 4 + x] + ret))) && 4 * i + x < x + 17) && x == 0) && 4 <= i)) || ((((((x == 0 && x == x) && ret == 0) && (ret + (unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][i * 4 + x] + unknown-#memory_int-unknown[x][x + 8]) / 4294967296 * 4294967296 + 4294967296 == unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][i * 4 + x] + unknown-#memory_int-unknown[x][x + 8] || unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][i * 4 + x] + unknown-#memory_int-unknown[x][x + 8] <= 4294967296 * ((unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][i * 4 + x] + unknown-#memory_int-unknown[x][x + 8]) / 4294967296) + 2147483647)) && (ret + (unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][i * 4 + x] + unknown-#memory_int-unknown[x][x + 8]) / 4294967296 * 4294967296 == unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x] + unknown-#memory_int-unknown[x][x + 8] || unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][i * 4 + x] + unknown-#memory_int-unknown[x][x + 8] <= 4294967296 * ((unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][i * 4 + x] + unknown-#memory_int-unknown[x][x + 8] + -2147483648) / 4294967296) + 4294967295)) && x == 0) && i == 0)) || (((((i * 4 == 8 && x == 0) && (unknown-#memory_int-unknown[x][i * 4 + x] + unknown-#memory_int-unknown[x][i * 4 + x + 4] + ret + unknown-#memory_int-unknown[x][i * 4 + x + 8] <= 4294967296 * ((unknown-#memory_int-unknown[x][i * 4 + x] + unknown-#memory_int-unknown[x][i * 4 + x + 4] + ret + unknown-#memory_int-unknown[x][i * 4 + x + 8]) / 4294967296) + 2147483647 || (unknown-#memory_int-unknown[x][i * 4 + x] + unknown-#memory_int-unknown[x][i * 4 + x + 4] + ret + unknown-#memory_int-unknown[x][i * 4 + x + 8] == ret + (unknown-#memory_int-unknown[x][i * 4 + x] + unknown-#memory_int-unknown[x][i * 4 + x + 4] + ret + unknown-#memory_int-unknown[x][i * 4 + x + 8]) / 4294967296 * 4294967296 + 4294967296 && ret + (unknown-#memory_int-unknown[x][i * 4 + x] + unknown-#memory_int-unknown[x][i * 4 + x + 4] + ret + unknown-#memory_int-unknown[x][i * 4 + x + 8]) / 4294967296 * 4294967296 + 4294967296 == unknown-#memory_int-unknown[x][i * 4 + x + 4] + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][i * 4 + x + 8] + unknown-#memory_int-unknown[x][x] + unknown-#memory_int-unknown[x][x + 8]))) && x == x) && x == 0) && (unknown-#memory_int-unknown[x][i * 4 + x] + unknown-#memory_int-unknown[x][i * 4 + x + 4] + ret + unknown-#memory_int-unknown[x][i * 4 + x + 8] <= 4294967296 * ((unknown-#memory_int-unknown[x][i * 4 + x] + unknown-#memory_int-unknown[x][i * 4 + x + 4] + ret + unknown-#memory_int-unknown[x][i * 4 + x + 8] + -2147483648) / 4294967296) + 4294967295 || (unknown-#memory_int-unknown[x][i * 4 + x] + unknown-#memory_int-unknown[x][i * 4 + x + 4] + ret + unknown-#memory_int-unknown[x][i * 4 + x + 8] == ret + (unknown-#memory_int-unknown[x][i * 4 + x] + unknown-#memory_int-unknown[x][i * 4 + x + 4] + ret + unknown-#memory_int-unknown[x][i * 4 + x + 8]) / 4294967296 * 4294967296 && unknown-#memory_int-unknown[x][i * 4 + x + 4] + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][i * 4 + x + 8] + unknown-#memory_int-unknown[x][x] + unknown-#memory_int-unknown[x][x + 8] == ret + (unknown-#memory_int-unknown[x][i * 4 + x] + unknown-#memory_int-unknown[x][i * 4 + x + 4] + ret + unknown-#memory_int-unknown[x][i * 4 + x + 8]) / 4294967296 * 4294967296))) - InvariantResult [Line: 15]: Loop Invariant Derived loop invariant: ((((ret <= unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x := unknown-#memory_int-unknown[x][x + 4]][x + 8] + unknown-#memory_int-unknown[x][x := unknown-#memory_int-unknown[x][x + 4]][x + 12] + unknown-#memory_int-unknown[x][x := unknown-#memory_int-unknown[x][x + 4]][x + 16] + unknown-#memory_int-unknown[x][x] && unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x := unknown-#memory_int-unknown[x][x + 4]][x + 8] + unknown-#memory_int-unknown[x][x := unknown-#memory_int-unknown[x][x + 4]][x + 12] + unknown-#memory_int-unknown[x][x := unknown-#memory_int-unknown[x][x + 4]][x + 16] + unknown-#memory_int-unknown[x][x] <= ret) && x == 0) && (unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x := unknown-#memory_int-unknown[x][x + 4]][x + 8] + unknown-#memory_int-unknown[x][x := unknown-#memory_int-unknown[x][x + 4]][x + 12] + unknown-#memory_int-unknown[x][x := unknown-#memory_int-unknown[x][x + 4]][x + 16] + unknown-#memory_int-unknown[x][x] == \result + 4294967296 * ((unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x := unknown-#memory_int-unknown[x][x + 4]][x + 8] + unknown-#memory_int-unknown[x][x := unknown-#memory_int-unknown[x][x + 4]][x + 12] + unknown-#memory_int-unknown[x][x := unknown-#memory_int-unknown[x][x + 4]][x + 16] + unknown-#memory_int-unknown[x][x]) / 4294967296) + 4294967296 || unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x := unknown-#memory_int-unknown[x][x + 4]][x + 8] + unknown-#memory_int-unknown[x][x := unknown-#memory_int-unknown[x][x + 4]][x + 12] + unknown-#memory_int-unknown[x][x := unknown-#memory_int-unknown[x][x + 4]][x + 16] + unknown-#memory_int-unknown[x][x] <= 4294967296 * ((unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x := unknown-#memory_int-unknown[x][x + 4]][x + 8] + unknown-#memory_int-unknown[x][x := unknown-#memory_int-unknown[x][x + 4]][x + 12] + unknown-#memory_int-unknown[x][x := unknown-#memory_int-unknown[x][x + 4]][x + 16] + unknown-#memory_int-unknown[x][x]) / 4294967296) + 2147483647)) && 5 <= i) && (\result + 4294967296 * ((unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x := unknown-#memory_int-unknown[x][x + 4]][x + 8] + unknown-#memory_int-unknown[x][x := unknown-#memory_int-unknown[x][x + 4]][x + 12] + unknown-#memory_int-unknown[x][x := unknown-#memory_int-unknown[x][x + 4]][x + 16] + unknown-#memory_int-unknown[x][x]) / 4294967296) == unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x := unknown-#memory_int-unknown[x][x + 4]][x + 8] + unknown-#memory_int-unknown[x][x := unknown-#memory_int-unknown[x][x + 4]][x + 12] + unknown-#memory_int-unknown[x][x := unknown-#memory_int-unknown[x][x + 4]][x + 16] + unknown-#memory_int-unknown[x][x] || unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x := unknown-#memory_int-unknown[x][x + 4]][x + 8] + unknown-#memory_int-unknown[x][x := unknown-#memory_int-unknown[x][x + 4]][x + 12] + unknown-#memory_int-unknown[x][x := unknown-#memory_int-unknown[x][x + 4]][x + 16] + unknown-#memory_int-unknown[x][x] <= 4294967296 * ((unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x := unknown-#memory_int-unknown[x][x + 4]][x + 8] + unknown-#memory_int-unknown[x][x := unknown-#memory_int-unknown[x][x + 4]][x + 12] + unknown-#memory_int-unknown[x][x := unknown-#memory_int-unknown[x][x + 4]][x + 16] + unknown-#memory_int-unknown[x][x] + -2147483648) / 4294967296) + 4294967295) - InvariantResult [Line: 20]: Loop Invariant Derived loop invariant: ((((((((((((ret2 == ret && x == 0) && x == x) && ret == 0) && (ret + (unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][i * 4 + x] + unknown-#memory_int-unknown[x][x + 8]) / 4294967296 * 4294967296 + 4294967296 == unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][i * 4 + x] + unknown-#memory_int-unknown[x][x + 8] || unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][i * 4 + x] + unknown-#memory_int-unknown[x][x + 8] <= 4294967296 * ((unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][i * 4 + x] + unknown-#memory_int-unknown[x][x + 8]) / 4294967296) + 2147483647)) && (ret + (unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][i * 4 + x] + unknown-#memory_int-unknown[x][x + 8]) / 4294967296 * 4294967296 == unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x] + unknown-#memory_int-unknown[x][x + 8] || unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][i * 4 + x] + unknown-#memory_int-unknown[x][x + 8] <= 4294967296 * ((unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][i * 4 + x] + unknown-#memory_int-unknown[x][x + 8] + -2147483648) / 4294967296) + 4294967295)) && x == 0) && (ret + (unknown-#memory_int-unknown[x][x + 16 := temp][0] + unknown-#memory_int-unknown[x][x + 16 := temp][x + 4] + unknown-#memory_int-unknown[x][x + 16 := temp][x + 8] + unknown-#memory_int-unknown[x][x + 16 := temp][x + 12] + temp) / 4294967296 * 4294967296 == unknown-#memory_int-unknown[x][x + 16 := temp][0] + unknown-#memory_int-unknown[x][x + 16 := temp][x + 4] + unknown-#memory_int-unknown[x][x + 16 := temp][x + 8] + unknown-#memory_int-unknown[x][x + 16 := temp][x + 12] + temp || ret + (unknown-#memory_int-unknown[x][x + 16 := temp][0] + unknown-#memory_int-unknown[x][x + 16 := temp][x + 4] + unknown-#memory_int-unknown[x][x + 16 := temp][x + 8] + unknown-#memory_int-unknown[x][x + 16 := temp][x + 12] + temp) / 4294967296 * 4294967296 + 4294967296 == unknown-#memory_int-unknown[x][x + 16 := temp][0] + unknown-#memory_int-unknown[x][x + 16 := temp][x + 4] + unknown-#memory_int-unknown[x][x + 16 := temp][x + 8] + unknown-#memory_int-unknown[x][x + 16 := temp][x + 12] + temp)) && i == 0) || ((((((((((ret2 == ret && 4294967296 * ((unknown-#memory_int-unknown[x][i * 4 + x] + ret + 2147483648) / 4294967296) <= unknown-#memory_int-unknown[x][i * 4 + x] + ret) || (ret2 == ret && ret + (unknown-#memory_int-unknown[x][i * 4 + x] + ret) / 4294967296 * 4294967296 + 4294967296 == unknown-#memory_int-unknown[x][i * 4 + x] + ret)) && x == 0) && (unknown-#memory_int-unknown[x][i * 4 + x] + ret <= 4294967296 * ((unknown-#memory_int-unknown[x][i * 4 + x] + ret) / 4294967296) + 2147483647 || unknown-#memory_int-unknown[x][i * 4 + x] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x] + unknown-#memory_int-unknown[x][x + 8] == ret + (unknown-#memory_int-unknown[x][i * 4 + x] + ret) / 4294967296 * 4294967296 + 4294967296)) && x == x) && (unknown-#memory_int-unknown[x][i * 4 + x] + ret <= 4294967296 * ((unknown-#memory_int-unknown[x][i * 4 + x] + ret + -2147483648) / 4294967296) + 4294967295 || (unknown-#memory_int-unknown[x][i * 4 + x] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x] + unknown-#memory_int-unknown[x][x + 8] == ret + (unknown-#memory_int-unknown[x][i * 4 + x] + ret) / 4294967296 * 4294967296 && ret + (unknown-#memory_int-unknown[x][i * 4 + x] + ret) / 4294967296 * 4294967296 == unknown-#memory_int-unknown[x][i * 4 + x] + ret))) && 4 * i + x < x + 17) && x == 0) && 4 <= i) && (ret + (unknown-#memory_int-unknown[x][x + 16 := temp][0] + unknown-#memory_int-unknown[x][x + 16 := temp][x + 4] + unknown-#memory_int-unknown[x][x + 16 := temp][x + 8] + unknown-#memory_int-unknown[x][x + 16 := temp][x + 12] + temp) / 4294967296 * 4294967296 == unknown-#memory_int-unknown[x][x + 16 := temp][0] + unknown-#memory_int-unknown[x][x + 16 := temp][x + 4] + unknown-#memory_int-unknown[x][x + 16 := temp][x + 8] + unknown-#memory_int-unknown[x][x + 16 := temp][x + 12] + temp || ret + (unknown-#memory_int-unknown[x][x + 16 := temp][0] + unknown-#memory_int-unknown[x][x + 16 := temp][x + 4] + unknown-#memory_int-unknown[x][x + 16 := temp][x + 8] + unknown-#memory_int-unknown[x][x + 16 := temp][x + 12] + temp) / 4294967296 * 4294967296 + 4294967296 == unknown-#memory_int-unknown[x][x + 16 := temp][0] + unknown-#memory_int-unknown[x][x + 16 := temp][x + 4] + unknown-#memory_int-unknown[x][x + 16 := temp][x + 8] + unknown-#memory_int-unknown[x][x + 16 := temp][x + 12] + temp))) || ((((((((x == 0 && x == x) && (ret + (unknown-#memory_int-unknown[x][i * 4 + x] + unknown-#memory_int-unknown[x][i * 4 + x + 12] + ret + unknown-#memory_int-unknown[x][i * 4 + x + 8] + unknown-#memory_int-unknown[x][x + 8]) / 4294967296 * 4294967296 + 4294967296 == unknown-#memory_int-unknown[x][i * 4 + x] + unknown-#memory_int-unknown[x][i * 4 + x + 12] + unknown-#memory_int-unknown[x][i * 4 + x + 8] + unknown-#memory_int-unknown[x][x] + unknown-#memory_int-unknown[x][x + 8] || unknown-#memory_int-unknown[x][i * 4 + x] + unknown-#memory_int-unknown[x][i * 4 + x + 12] + unknown-#memory_int-unknown[x][i * 4 + x + 4] + ret + unknown-#memory_int-unknown[x][i * 4 + x + 8] <= 4294967296 * ((unknown-#memory_int-unknown[x][i * 4 + x] + unknown-#memory_int-unknown[x][i * 4 + x + 12] + unknown-#memory_int-unknown[x][i * 4 + x + 4] + ret + unknown-#memory_int-unknown[x][i * 4 + x + 8]) / 4294967296) + 2147483647)) && (ret + (unknown-#memory_int-unknown[x][i * 4 + x] + unknown-#memory_int-unknown[x][i * 4 + x + 12] + ret + unknown-#memory_int-unknown[x][i * 4 + x + 8] + unknown-#memory_int-unknown[x][x + 8]) / 4294967296 * 4294967296 == unknown-#memory_int-unknown[x][i * 4 + x] + unknown-#memory_int-unknown[x][i * 4 + x + 12] + unknown-#memory_int-unknown[x][i * 4 + x + 8] + unknown-#memory_int-unknown[x][x] + unknown-#memory_int-unknown[x][x + 8] || unknown-#memory_int-unknown[x][i * 4 + x] + unknown-#memory_int-unknown[x][i * 4 + x + 12] + ret + unknown-#memory_int-unknown[x][i * 4 + x + 8] + unknown-#memory_int-unknown[x][x + 8] <= 4294967296 * ((unknown-#memory_int-unknown[x][i * 4 + x] + unknown-#memory_int-unknown[x][i * 4 + x + 12] + ret + unknown-#memory_int-unknown[x][i * 4 + x + 8] + unknown-#memory_int-unknown[x][x + 8] + -2147483648) / 4294967296) + 4294967295)) && i * 4 == 4) && x == 0) && ret <= unknown-#memory_int-unknown[x][x]) && (((ret2 == ret && unknown-#memory_int-unknown[x][i * 4 + x] + unknown-#memory_int-unknown[x][i * 4 + 4] + ret + unknown-#memory_int-unknown[x][i * 4 + 12] + unknown-#memory_int-unknown[x][i * 4 + 8] == ret + (unknown-#memory_int-unknown[x][i * 4 + x] + unknown-#memory_int-unknown[x][i * 4 + 4] + ret + unknown-#memory_int-unknown[x][i * 4 + 12] + unknown-#memory_int-unknown[x][i * 4 + 8]) / 4294967296 * 4294967296) && 4294967296 * ((unknown-#memory_int-unknown[x][i * 4 + x] + unknown-#memory_int-unknown[x][i * 4 + 4] + ret + unknown-#memory_int-unknown[x][i * 4 + 12] + unknown-#memory_int-unknown[x][i * 4 + 8] + 2147483648) / 4294967296) <= unknown-#memory_int-unknown[x][i * 4 + x] + unknown-#memory_int-unknown[x][i * 4 + 4] + ret + unknown-#memory_int-unknown[x][i * 4 + 12] + unknown-#memory_int-unknown[x][i * 4 + 8]) || (ret2 == ret && unknown-#memory_int-unknown[x][i * 4 + x] + unknown-#memory_int-unknown[x][i * 4 + 4] + ret + unknown-#memory_int-unknown[x][i * 4 + 12] + unknown-#memory_int-unknown[x][i * 4 + 8] == ret + (unknown-#memory_int-unknown[x][i * 4 + x] + unknown-#memory_int-unknown[x][i * 4 + 4] + ret + unknown-#memory_int-unknown[x][i * 4 + 12] + unknown-#memory_int-unknown[x][i * 4 + 8]) / 4294967296 * 4294967296 + 4294967296))) && (ret + (unknown-#memory_int-unknown[x][x + 16 := temp][0] + unknown-#memory_int-unknown[x][x + 16 := temp][x + 4] + unknown-#memory_int-unknown[x][x + 16 := temp][x + 8] + unknown-#memory_int-unknown[x][x + 16 := temp][x + 12] + temp) / 4294967296 * 4294967296 == unknown-#memory_int-unknown[x][x + 16 := temp][0] + unknown-#memory_int-unknown[x][x + 16 := temp][x + 4] + unknown-#memory_int-unknown[x][x + 16 := temp][x + 8] + unknown-#memory_int-unknown[x][x + 16 := temp][x + 12] + temp || ret + (unknown-#memory_int-unknown[x][x + 16 := temp][0] + unknown-#memory_int-unknown[x][x + 16 := temp][x + 4] + unknown-#memory_int-unknown[x][x + 16 := temp][x + 8] + unknown-#memory_int-unknown[x][x + 16 := temp][x + 12] + temp) / 4294967296 * 4294967296 + 4294967296 == unknown-#memory_int-unknown[x][x + 16 := temp][0] + unknown-#memory_int-unknown[x][x + 16 := temp][x + 4] + unknown-#memory_int-unknown[x][x + 16 := temp][x + 8] + unknown-#memory_int-unknown[x][x + 16 := temp][x + 12] + temp))) || (((((((((((ret2 == ret && unknown-#memory_int-unknown[x][i * 4 + x] + unknown-#memory_int-unknown[x][i * 4 + 4] + ret <= 4294967296 * ((unknown-#memory_int-unknown[x][i * 4 + x] + unknown-#memory_int-unknown[x][i * 4 + 4] + ret + -2147483648) / 4294967296) + 4294967295) || (ret2 == ret && (unknown-#memory_int-unknown[x][i * 4 + x] + unknown-#memory_int-unknown[x][i * 4 + 4] + ret) / 4294967296 * 4294967296 + ret == unknown-#memory_int-unknown[x][i * 4 + x] + unknown-#memory_int-unknown[x][i * 4 + 4] + ret)) && 3 <= i) && i * 4 + x == x + 12) && x == x) && unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x] + unknown-#memory_int-unknown[x][x + 8] <= ret) && i <= 3) && ret <= unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x] + unknown-#memory_int-unknown[x][x + 8]) && x == 0) && (unknown-#memory_int-unknown[x][i * 4 + x] + unknown-#memory_int-unknown[x][i * 4 + x + 4] + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x] + unknown-#memory_int-unknown[x][x + 8] == ret + (unknown-#memory_int-unknown[x][i * 4 + x] + unknown-#memory_int-unknown[x][i * 4 + x + 4] + ret) / 4294967296 * 4294967296 + 4294967296 || unknown-#memory_int-unknown[x][i * 4 + x] + unknown-#memory_int-unknown[x][i * 4 + x + 4] + ret <= 4294967296 * ((unknown-#memory_int-unknown[x][i * 4 + x] + unknown-#memory_int-unknown[x][i * 4 + x + 4] + ret) / 4294967296) + 2147483647)) && (ret + (unknown-#memory_int-unknown[x][x + 16 := temp][0] + unknown-#memory_int-unknown[x][x + 16 := temp][x + 4] + unknown-#memory_int-unknown[x][x + 16 := temp][x + 8] + unknown-#memory_int-unknown[x][x + 16 := temp][x + 12] + temp) / 4294967296 * 4294967296 == unknown-#memory_int-unknown[x][x + 16 := temp][0] + unknown-#memory_int-unknown[x][x + 16 := temp][x + 4] + unknown-#memory_int-unknown[x][x + 16 := temp][x + 8] + unknown-#memory_int-unknown[x][x + 16 := temp][x + 12] + temp || ret + (unknown-#memory_int-unknown[x][x + 16 := temp][0] + unknown-#memory_int-unknown[x][x + 16 := temp][x + 4] + unknown-#memory_int-unknown[x][x + 16 := temp][x + 8] + unknown-#memory_int-unknown[x][x + 16 := temp][x + 12] + temp) / 4294967296 * 4294967296 + 4294967296 == unknown-#memory_int-unknown[x][x + 16 := temp][0] + unknown-#memory_int-unknown[x][x + 16 := temp][x + 4] + unknown-#memory_int-unknown[x][x + 16 := temp][x + 8] + unknown-#memory_int-unknown[x][x + 16 := temp][x + 12] + temp))) || (((((((((((ret2 == ret && unknown-#memory_int-unknown[x][i * 4 + x] + unknown-#memory_int-unknown[x][i * 4 + 4] + ret + unknown-#memory_int-unknown[x][i * 4 + 8] <= 4294967296 * ((unknown-#memory_int-unknown[x][i * 4 + x] + unknown-#memory_int-unknown[x][i * 4 + 4] + ret + unknown-#memory_int-unknown[x][i * 4 + 8] + -2147483648) / 4294967296) + 4294967295) && unknown-#memory_int-unknown[x][i * 4 + x] + unknown-#memory_int-unknown[x][i * 4 + 4] + ret + unknown-#memory_int-unknown[x][i * 4 + 8] == ret + (unknown-#memory_int-unknown[x][i * 4 + x] + unknown-#memory_int-unknown[x][i * 4 + 4] + ret + unknown-#memory_int-unknown[x][i * 4 + 8]) / 4294967296 * 4294967296 + 4294967296) || ((ret2 == ret && 4294967296 * ((unknown-#memory_int-unknown[x][i * 4 + x] + unknown-#memory_int-unknown[x][i * 4 + 4] + ret + unknown-#memory_int-unknown[x][i * 4 + 8] + 2147483648) / 4294967296) <= unknown-#memory_int-unknown[x][i * 4 + x] + unknown-#memory_int-unknown[x][i * 4 + 4] + ret + unknown-#memory_int-unknown[x][i * 4 + 8]) && unknown-#memory_int-unknown[x][i * 4 + x] + unknown-#memory_int-unknown[x][i * 4 + 4] + ret + unknown-#memory_int-unknown[x][i * 4 + 8] == ret + (unknown-#memory_int-unknown[x][i * 4 + x] + unknown-#memory_int-unknown[x][i * 4 + 4] + ret + unknown-#memory_int-unknown[x][i * 4 + 8]) / 4294967296 * 4294967296)) && x == 0) && 2 <= i) && (unknown-#memory_int-unknown[x][i * 4 + x] + unknown-#memory_int-unknown[x][i * 4 + x + 4] + ret + unknown-#memory_int-unknown[x][i * 4 + x + 8] <= 4294967296 * ((unknown-#memory_int-unknown[x][i * 4 + x] + unknown-#memory_int-unknown[x][i * 4 + x + 4] + ret + unknown-#memory_int-unknown[x][i * 4 + x + 8] + -2147483648) / 4294967296) + 4294967295 || unknown-#memory_int-unknown[x][i * 4 + x + 4] + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][i * 4 + x + 8] + unknown-#memory_int-unknown[x][x] + unknown-#memory_int-unknown[x][x + 8] == ret + (unknown-#memory_int-unknown[x][i * 4 + x] + unknown-#memory_int-unknown[x][i * 4 + x + 4] + ret + unknown-#memory_int-unknown[x][i * 4 + x + 8]) / 4294967296 * 4294967296)) && x == x) && i <= 2) && (unknown-#memory_int-unknown[x][i * 4 + x] + unknown-#memory_int-unknown[x][i * 4 + x + 4] + ret + unknown-#memory_int-unknown[x][i * 4 + x + 8] <= 4294967296 * ((unknown-#memory_int-unknown[x][i * 4 + x] + unknown-#memory_int-unknown[x][i * 4 + x + 4] + ret + unknown-#memory_int-unknown[x][i * 4 + x + 8]) / 4294967296) + 2147483647 || ret + (unknown-#memory_int-unknown[x][i * 4 + x] + unknown-#memory_int-unknown[x][i * 4 + x + 4] + ret + unknown-#memory_int-unknown[x][i * 4 + x + 8]) / 4294967296 * 4294967296 + 4294967296 == unknown-#memory_int-unknown[x][i * 4 + x + 4] + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][i * 4 + x + 8] + unknown-#memory_int-unknown[x][x] + unknown-#memory_int-unknown[x][x + 8])) && x == 0) && (ret + (unknown-#memory_int-unknown[x][x + 16 := temp][0] + unknown-#memory_int-unknown[x][x + 16 := temp][x + 4] + unknown-#memory_int-unknown[x][x + 16 := temp][x + 8] + unknown-#memory_int-unknown[x][x + 16 := temp][x + 12] + temp) / 4294967296 * 4294967296 == unknown-#memory_int-unknown[x][x + 16 := temp][0] + unknown-#memory_int-unknown[x][x + 16 := temp][x + 4] + unknown-#memory_int-unknown[x][x + 16 := temp][x + 8] + unknown-#memory_int-unknown[x][x + 16 := temp][x + 12] + temp || ret + (unknown-#memory_int-unknown[x][x + 16 := temp][0] + unknown-#memory_int-unknown[x][x + 16 := temp][x + 4] + unknown-#memory_int-unknown[x][x + 16 := temp][x + 8] + unknown-#memory_int-unknown[x][x + 16 := temp][x + 12] + temp) / 4294967296 * 4294967296 + 4294967296 == unknown-#memory_int-unknown[x][x + 16 := temp][0] + unknown-#memory_int-unknown[x][x + 16 := temp][x + 4] + unknown-#memory_int-unknown[x][x + 16 := temp][x + 8] + unknown-#memory_int-unknown[x][x + 16 := temp][x + 12] + temp))) || (((((x == 0 && (((ret <= 4294967296 * (ret / 4294967296) + 2147483647 && ret2 == ret) && ret / 4294967296 * 4294967296 + ret == ret) || ((ret2 == ret && ret == ret + ret / 4294967296 * 4294967296 + 4294967296) && 4294967296 * (ret / 4294967296) + 2147483648 <= ret))) && 5 <= i) && ret <= unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x] + unknown-#memory_int-unknown[x][x + 8]) && unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x] + unknown-#memory_int-unknown[x][x + 8] <= ret) && (ret + (unknown-#memory_int-unknown[x][x + 16 := temp][0] + unknown-#memory_int-unknown[x][x + 16 := temp][x + 4] + unknown-#memory_int-unknown[x][x + 16 := temp][x + 8] + unknown-#memory_int-unknown[x][x + 16 := temp][x + 12] + temp) / 4294967296 * 4294967296 == unknown-#memory_int-unknown[x][x + 16 := temp][0] + unknown-#memory_int-unknown[x][x + 16 := temp][x + 4] + unknown-#memory_int-unknown[x][x + 16 := temp][x + 8] + unknown-#memory_int-unknown[x][x + 16 := temp][x + 12] + temp || ret + (unknown-#memory_int-unknown[x][x + 16 := temp][0] + unknown-#memory_int-unknown[x][x + 16 := temp][x + 4] + unknown-#memory_int-unknown[x][x + 16 := temp][x + 8] + unknown-#memory_int-unknown[x][x + 16 := temp][x + 12] + temp) / 4294967296 * 4294967296 + 4294967296 == unknown-#memory_int-unknown[x][x + 16 := temp][0] + unknown-#memory_int-unknown[x][x + 16 := temp][x + 4] + unknown-#memory_int-unknown[x][x + 16 := temp][x + 8] + unknown-#memory_int-unknown[x][x + 16 := temp][x + 12] + temp)) - InvariantResult [Line: 43]: Loop Invariant Derived loop invariant: ((((((((((2 < i && !(i == 3)) || (i * 4 == 12 && (ret + (unknown-#memory_int-unknown[x][x + i * 4 := unknown-#memory_int-unknown[x][x + i * 4 + 4]][0] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + unknown-#memory_int-unknown[x][x + i * 4 := unknown-#memory_int-unknown[x][x + i * 4 + 4]][x + 4] + unknown-#memory_int-unknown[x][x + i * 4 := unknown-#memory_int-unknown[x][x + i * 4 + 4]][x + 8] + temp) / 4294967296 * 4294967296 + 4294967296 == unknown-#memory_int-unknown[x][x + i * 4 := unknown-#memory_int-unknown[x][x + i * 4 + 4]][0] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + unknown-#memory_int-unknown[x][x + i * 4 := unknown-#memory_int-unknown[x][x + i * 4 + 4]][x + 4] + unknown-#memory_int-unknown[x][x + i * 4 := unknown-#memory_int-unknown[x][x + i * 4 + 4]][x + 8] + temp || ret + (unknown-#memory_int-unknown[x][x + i * 4 := unknown-#memory_int-unknown[x][x + i * 4 + 4]][0] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + unknown-#memory_int-unknown[x][x + i * 4 := unknown-#memory_int-unknown[x][x + i * 4 + 4]][x + 4] + unknown-#memory_int-unknown[x][x + i * 4 := unknown-#memory_int-unknown[x][x + i * 4 + 4]][x + 8] + temp) / 4294967296 * 4294967296 == unknown-#memory_int-unknown[x][x + i * 4 := unknown-#memory_int-unknown[x][x + i * 4 + 4]][0] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + unknown-#memory_int-unknown[x][x + i * 4 := unknown-#memory_int-unknown[x][x + i * 4 + 4]][x + 4] + unknown-#memory_int-unknown[x][x + i * 4 := unknown-#memory_int-unknown[x][x + i * 4 + 4]][x + 8] + temp))) && x == 0) && (((ret <= 4294967296 * (ret / 4294967296) + 2147483647 && ret2 == ret) && ret / 4294967296 * 4294967296 + ret == ret) || ((ret2 == ret && ret == ret + ret / 4294967296 * 4294967296 + 4294967296) && 4294967296 * (ret / 4294967296) + 2147483648 <= ret))) && 5 <= i) && i <= 3) && \result == ret) || ((((((((unknown-#memory_int-unknown[x][x + i * 4 + 4] + unknown-#memory_int-unknown[x][x + i * 4 := unknown-#memory_int-unknown[x][x + i * 4 + 4]][x + 16] + unknown-#memory_int-unknown[x][x + i * 4 := unknown-#memory_int-unknown[x][x + i * 4 + 4]][x + 12] + unknown-#memory_int-unknown[x][x + i * 4 := unknown-#memory_int-unknown[x][x + i * 4 + 4]][x + 8] + temp == ret + (unknown-#memory_int-unknown[x][x + i * 4 + 4] + unknown-#memory_int-unknown[x][x + i * 4 := unknown-#memory_int-unknown[x][x + i * 4 + 4]][x + 16] + unknown-#memory_int-unknown[x][x + i * 4 := unknown-#memory_int-unknown[x][x + i * 4 + 4]][x + 12] + unknown-#memory_int-unknown[x][x + i * 4 := unknown-#memory_int-unknown[x][x + i * 4 + 4]][x + 8] + temp) / 4294967296 * 4294967296 + 4294967296 || unknown-#memory_int-unknown[x][x + i * 4 + 4] + unknown-#memory_int-unknown[x][x + i * 4 := unknown-#memory_int-unknown[x][x + i * 4 + 4]][x + 16] + unknown-#memory_int-unknown[x][x + i * 4 := unknown-#memory_int-unknown[x][x + i * 4 + 4]][x + 12] + unknown-#memory_int-unknown[x][x + i * 4 := unknown-#memory_int-unknown[x][x + i * 4 + 4]][x + 8] + temp == ret + (unknown-#memory_int-unknown[x][x + i * 4 + 4] + unknown-#memory_int-unknown[x][x + i * 4 := unknown-#memory_int-unknown[x][x + i * 4 + 4]][x + 16] + unknown-#memory_int-unknown[x][x + i * 4 := unknown-#memory_int-unknown[x][x + i * 4 + 4]][x + 12] + unknown-#memory_int-unknown[x][x + i * 4 := unknown-#memory_int-unknown[x][x + i * 4 + 4]][x + 8] + temp) / 4294967296 * 4294967296) && x == 0) && i * 4 == 0) && (((ret <= 4294967296 * (ret / 4294967296) + 2147483647 && ret2 == ret) && ret / 4294967296 * 4294967296 + ret == ret) || ((ret2 == ret && ret == ret + ret / 4294967296 * 4294967296 + 4294967296) && 4294967296 * (ret / 4294967296) + 2147483648 <= ret))) && 5 <= i) && ret <= unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x] + unknown-#memory_int-unknown[x][x + 8]) && \result == ret) && unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x] + unknown-#memory_int-unknown[x][x + 8] <= ret)) || (((((((2 < i && !(i == 3)) || (i * 4 == 12 && (ret + (unknown-#memory_int-unknown[x][x + i * 4 := unknown-#memory_int-unknown[x][x + i * 4 + 4]][0] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + unknown-#memory_int-unknown[x][x + i * 4 := unknown-#memory_int-unknown[x][x + i * 4 + 4]][x + 4] + unknown-#memory_int-unknown[x][x + i * 4 := unknown-#memory_int-unknown[x][x + i * 4 + 4]][x + 8] + temp) / 4294967296 * 4294967296 + 4294967296 == unknown-#memory_int-unknown[x][x + i * 4 := unknown-#memory_int-unknown[x][x + i * 4 + 4]][0] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + unknown-#memory_int-unknown[x][x + i * 4 := unknown-#memory_int-unknown[x][x + i * 4 + 4]][x + 4] + unknown-#memory_int-unknown[x][x + i * 4 := unknown-#memory_int-unknown[x][x + i * 4 + 4]][x + 8] + temp || ret + (unknown-#memory_int-unknown[x][x + i * 4 := unknown-#memory_int-unknown[x][x + i * 4 + 4]][0] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + unknown-#memory_int-unknown[x][x + i * 4 := unknown-#memory_int-unknown[x][x + i * 4 + 4]][x + 4] + unknown-#memory_int-unknown[x][x + i * 4 := unknown-#memory_int-unknown[x][x + i * 4 + 4]][x + 8] + temp) / 4294967296 * 4294967296 == unknown-#memory_int-unknown[x][x + i * 4 := unknown-#memory_int-unknown[x][x + i * 4 + 4]][0] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + unknown-#memory_int-unknown[x][x + i * 4 := unknown-#memory_int-unknown[x][x + i * 4 + 4]][x + 4] + unknown-#memory_int-unknown[x][x + i * 4 := unknown-#memory_int-unknown[x][x + i * 4 + 4]][x + 8] + temp))) && x == 0) && (((ret <= 4294967296 * (ret / 4294967296) + 2147483647 && ret2 == ret) && ret / 4294967296 * 4294967296 + ret == ret) || ((ret2 == ret && ret == ret + ret / 4294967296 * 4294967296 + 4294967296) && 4294967296 * (ret / 4294967296) + 2147483648 <= ret))) && 5 <= i) && \result == ret) && (ret + (unknown-#memory_int-unknown[x][x + 16 := temp][0] + unknown-#memory_int-unknown[x][x + 16 := temp][x + 4] + unknown-#memory_int-unknown[x][x + 16 := temp][x + 8] + unknown-#memory_int-unknown[x][x + 16 := temp][x + 12] + temp) / 4294967296 * 4294967296 == unknown-#memory_int-unknown[x][x + 16 := temp][0] + unknown-#memory_int-unknown[x][x + 16 := temp][x + 4] + unknown-#memory_int-unknown[x][x + 16 := temp][x + 8] + unknown-#memory_int-unknown[x][x + 16 := temp][x + 12] + temp || ret + (unknown-#memory_int-unknown[x][x + 16 := temp][0] + unknown-#memory_int-unknown[x][x + 16 := temp][x + 4] + unknown-#memory_int-unknown[x][x + 16 := temp][x + 8] + unknown-#memory_int-unknown[x][x + 16 := temp][x + 12] + temp) / 4294967296 * 4294967296 + 4294967296 == unknown-#memory_int-unknown[x][x + 16 := temp][0] + unknown-#memory_int-unknown[x][x + 16 := temp][x + 4] + unknown-#memory_int-unknown[x][x + 16 := temp][x + 8] + unknown-#memory_int-unknown[x][x + 16 := temp][x + 12] + temp))) || ((((((unknown-#memory_int-unknown[x][x + i * 4 := unknown-#memory_int-unknown[x][x + i * 4 + 4]][x + i * 4 + 8] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + unknown-#memory_int-unknown[x][x + i * 4 := unknown-#memory_int-unknown[x][x + i * 4 + 4]][0] + unknown-#memory_int-unknown[x][x + i * 4 := unknown-#memory_int-unknown[x][x + i * 4 + 4]][x + 16] + temp == ret + (unknown-#memory_int-unknown[x][x + i * 4 := unknown-#memory_int-unknown[x][x + i * 4 + 4]][x + i * 4 + 8] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + unknown-#memory_int-unknown[x][x + i * 4 := unknown-#memory_int-unknown[x][x + i * 4 + 4]][0] + unknown-#memory_int-unknown[x][x + i * 4 := unknown-#memory_int-unknown[x][x + i * 4 + 4]][x + 16] + temp) / 4294967296 * 4294967296 || unknown-#memory_int-unknown[x][x + i * 4 := unknown-#memory_int-unknown[x][x + i * 4 + 4]][x + i * 4 + 8] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + unknown-#memory_int-unknown[x][x + i * 4 := unknown-#memory_int-unknown[x][x + i * 4 + 4]][0] + unknown-#memory_int-unknown[x][x + i * 4 := unknown-#memory_int-unknown[x][x + i * 4 + 4]][x + 16] + temp == ret + (unknown-#memory_int-unknown[x][x + i * 4 := unknown-#memory_int-unknown[x][x + i * 4 + 4]][x + i * 4 + 8] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + unknown-#memory_int-unknown[x][x + i * 4 := unknown-#memory_int-unknown[x][x + i * 4 + 4]][0] + unknown-#memory_int-unknown[x][x + i * 4 := unknown-#memory_int-unknown[x][x + i * 4 + 4]][x + 16] + temp) / 4294967296 * 4294967296 + 4294967296) && i * 4 == x + 4) && x == 0) && (((ret <= 4294967296 * (ret / 4294967296) + 2147483647 && ret2 == ret) && ret / 4294967296 * 4294967296 + ret == ret) || ((ret2 == ret && ret == ret + ret / 4294967296 * 4294967296 + 4294967296) && 4294967296 * (ret / 4294967296) + 2147483648 <= ret))) && 5 <= i) && \result == ret)) || ((((((unknown-#memory_int-unknown[x][x + i * 4 + 4] + unknown-#memory_int-unknown[x][x + i * 4 := unknown-#memory_int-unknown[x][x + i * 4 + 4]][0] + unknown-#memory_int-unknown[x][x + i * 4 := unknown-#memory_int-unknown[x][x + i * 4 + 4]][x + 4] + unknown-#memory_int-unknown[x][x + i * 4 := unknown-#memory_int-unknown[x][x + i * 4 + 4]][x + 16] + temp == ret + (unknown-#memory_int-unknown[x][x + i * 4 + 4] + unknown-#memory_int-unknown[x][x + i * 4 := unknown-#memory_int-unknown[x][x + i * 4 + 4]][0] + unknown-#memory_int-unknown[x][x + i * 4 := unknown-#memory_int-unknown[x][x + i * 4 + 4]][x + 4] + unknown-#memory_int-unknown[x][x + i * 4 := unknown-#memory_int-unknown[x][x + i * 4 + 4]][x + 16] + temp) / 4294967296 * 4294967296 || unknown-#memory_int-unknown[x][x + i * 4 + 4] + unknown-#memory_int-unknown[x][x + i * 4 := unknown-#memory_int-unknown[x][x + i * 4 + 4]][0] + unknown-#memory_int-unknown[x][x + i * 4 := unknown-#memory_int-unknown[x][x + i * 4 + 4]][x + 4] + unknown-#memory_int-unknown[x][x + i * 4 := unknown-#memory_int-unknown[x][x + i * 4 + 4]][x + 16] + temp == ret + (unknown-#memory_int-unknown[x][x + i * 4 + 4] + unknown-#memory_int-unknown[x][x + i * 4 := unknown-#memory_int-unknown[x][x + i * 4 + 4]][0] + unknown-#memory_int-unknown[x][x + i * 4 := unknown-#memory_int-unknown[x][x + i * 4 + 4]][x + 4] + unknown-#memory_int-unknown[x][x + i * 4 := unknown-#memory_int-unknown[x][x + i * 4 + 4]][x + 16] + temp) / 4294967296 * 4294967296 + 4294967296) && x == 0) && (((ret <= 4294967296 * (ret / 4294967296) + 2147483647 && ret2 == ret) && ret / 4294967296 * 4294967296 + ret == ret) || ((ret2 == ret && ret == ret + ret / 4294967296 * 4294967296 + 4294967296) && 4294967296 * (ret / 4294967296) + 2147483648 <= ret))) && 5 <= i) && \result == ret) && i * 4 == x + 8) - InvariantResult [Line: 26]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 27 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 47.1s, OverallIterations: 12, TraceHistogramMax: 6, AutomataDifference: 26.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 11.5s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 252 SDtfs, 215 SDslu, 853 SDs, 0 SdLazy, 3131 SolverSat, 203 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 7.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 589 GetRequests, 441 SyntacticMatches, 21 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1323 ImplicationChecksByTransitivity, 27.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=95occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 12 MinimizatonAttempts, 48 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 9 LocationsWithAnnotation, 9 PreInvPairs, 41 NumberOfFragments, 9586 HoareAnnotationTreeSize, 9 FomulaSimplifications, 51 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 9 FomulaSimplificationsInter, 692 FormulaSimplificationTreeSizeReductionInter, 11.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.6s SatisfiabilityAnalysisTime, 12.4s InterpolantComputationTime, 934 NumberOfCodeBlocks, 914 NumberOfCodeBlocksAsserted, 39 NumberOfCheckSat, 912 ConstructedInterpolants, 0 QuantifiedInterpolants, 879416 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1576 ConjunctsInSsa, 41 ConjunctsInUnsatCore, 22 InterpolantComputations, 4 PerfectInterpolantSequences, 873/1088 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! Received shutdown request...