./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/reducercommutativity/sum05-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 791161d1 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/reducercommutativity/sum05-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 11bff2dc480380b1206bedd51506b0437b9af4529e78b5beefb811437146f17f --- Real Ultimate output --- This is Ultimate 0.2.2-?-791161d [2022-07-23 16:02:58,116 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-23 16:02:58,118 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-23 16:02:58,153 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-23 16:02:58,154 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-23 16:02:58,155 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-23 16:02:58,156 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-23 16:02:58,158 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-23 16:02:58,160 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-23 16:02:58,163 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-23 16:02:58,164 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-23 16:02:58,166 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-23 16:02:58,166 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-23 16:02:58,167 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-23 16:02:58,168 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-23 16:02:58,170 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-23 16:02:58,171 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-23 16:02:58,172 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-23 16:02:58,173 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-23 16:02:58,177 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-23 16:02:58,179 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-23 16:02:58,180 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-23 16:02:58,180 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-23 16:02:58,181 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-23 16:02:58,182 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-23 16:02:58,187 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-23 16:02:58,187 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-23 16:02:58,188 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-23 16:02:58,189 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-23 16:02:58,189 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-23 16:02:58,190 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-23 16:02:58,190 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-23 16:02:58,191 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-23 16:02:58,192 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-23 16:02:58,192 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-23 16:02:58,193 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-23 16:02:58,193 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-23 16:02:58,193 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-23 16:02:58,193 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-23 16:02:58,194 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-23 16:02:58,194 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-23 16:02:58,196 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-23 16:02:58,197 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2022-07-23 16:02:58,221 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-23 16:02:58,222 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-23 16:02:58,222 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-23 16:02:58,222 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-23 16:02:58,223 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-23 16:02:58,224 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-23 16:02:58,224 INFO L138 SettingsManager]: * Use SBE=true [2022-07-23 16:02:58,224 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-07-23 16:02:58,224 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-07-23 16:02:58,225 INFO L138 SettingsManager]: * Use old map elimination=false [2022-07-23 16:02:58,225 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-07-23 16:02:58,225 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-07-23 16:02:58,225 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-07-23 16:02:58,225 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-23 16:02:58,225 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-23 16:02:58,225 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-23 16:02:58,226 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-23 16:02:58,226 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-23 16:02:58,226 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-23 16:02:58,226 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-07-23 16:02:58,226 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-07-23 16:02:58,226 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-07-23 16:02:58,226 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-23 16:02:58,227 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-23 16:02:58,227 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-07-23 16:02:58,227 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-23 16:02:58,227 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-07-23 16:02:58,227 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-23 16:02:58,227 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-23 16:02:58,228 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-23 16:02:58,228 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-23 16:02:58,228 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-07-23 16:02:58,229 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR 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/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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 11bff2dc480380b1206bedd51506b0437b9af4529e78b5beefb811437146f17f [2022-07-23 16:02:58,430 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-23 16:02:58,445 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-23 16:02:58,446 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-23 16:02:58,448 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-23 16:02:58,448 INFO L275 PluginConnector]: CDTParser initialized [2022-07-23 16:02:58,449 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/reducercommutativity/sum05-2.i [2022-07-23 16:02:58,487 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/70347e5b2/a00130e2e8de437c866aece10cbc47cf/FLAG40d0d8c24 [2022-07-23 16:02:58,805 INFO L306 CDTParser]: Found 1 translation units. [2022-07-23 16:02:58,806 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/reducercommutativity/sum05-2.i [2022-07-23 16:02:58,810 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/70347e5b2/a00130e2e8de437c866aece10cbc47cf/FLAG40d0d8c24 [2022-07-23 16:02:58,818 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/70347e5b2/a00130e2e8de437c866aece10cbc47cf [2022-07-23 16:02:58,820 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-23 16:02:58,821 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-23 16:02:58,822 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-23 16:02:58,822 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-23 16:02:58,824 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-23 16:02:58,825 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.07 04:02:58" (1/1) ... [2022-07-23 16:02:58,825 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@516ebc5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 04:02:58, skipping insertion in model container [2022-07-23 16:02:58,825 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.07 04:02:58" (1/1) ... [2022-07-23 16:02:58,830 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-23 16:02:58,840 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-23 16:02:58,950 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/reducercommutativity/sum05-2.i[1271,1284] [2022-07-23 16:02:58,951 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-23 16:02:58,955 INFO L203 MainTranslator]: Completed pre-run [2022-07-23 16:02:58,975 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/reducercommutativity/sum05-2.i[1271,1284] [2022-07-23 16:02:58,977 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-23 16:02:58,990 INFO L208 MainTranslator]: Completed translation [2022-07-23 16:02:58,990 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 04:02:58 WrapperNode [2022-07-23 16:02:58,991 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-23 16:02:58,991 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-23 16:02:58,992 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-23 16:02:58,992 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-23 16:02:58,996 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 04:02:58" (1/1) ... [2022-07-23 16:02:59,001 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 04:02:58" (1/1) ... [2022-07-23 16:02:59,014 INFO L137 Inliner]: procedures = 16, calls = 22, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 114 [2022-07-23 16:02:59,014 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-23 16:02:59,015 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-23 16:02:59,015 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-23 16:02:59,015 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-23 16:02:59,020 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 04:02:58" (1/1) ... [2022-07-23 16:02:59,020 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 04:02:58" (1/1) ... [2022-07-23 16:02:59,022 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 04:02:58" (1/1) ... [2022-07-23 16:02:59,022 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 04:02:58" (1/1) ... [2022-07-23 16:02:59,027 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 04:02:58" (1/1) ... [2022-07-23 16:02:59,030 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 04:02:58" (1/1) ... [2022-07-23 16:02:59,030 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 04:02:58" (1/1) ... [2022-07-23 16:02:59,032 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-23 16:02:59,032 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-23 16:02:59,032 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-23 16:02:59,033 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-23 16:02:59,033 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 04:02:58" (1/1) ... [2022-07-23 16:02:59,038 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 16:02:59,045 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 16:02:59,055 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 16:02:59,060 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2022-07-23 16:02:59,080 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-23 16:02:59,080 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-23 16:02:59,081 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-23 16:02:59,081 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-23 16:02:59,081 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-23 16:02:59,081 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-23 16:02:59,081 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-23 16:02:59,081 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-23 16:02:59,123 INFO L234 CfgBuilder]: Building ICFG [2022-07-23 16:02:59,124 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-23 16:02:59,238 INFO L275 CfgBuilder]: Performing block encoding [2022-07-23 16:02:59,242 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-23 16:02:59,242 INFO L299 CfgBuilder]: Removed 5 assume(true) statements. [2022-07-23 16:02:59,243 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 04:02:59 BoogieIcfgContainer [2022-07-23 16:02:59,243 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-23 16:02:59,244 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-07-23 16:02:59,244 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-07-23 16:02:59,257 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-07-23 16:02:59,257 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-23 16:02:59,257 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 23.07 04:02:58" (1/3) ... [2022-07-23 16:02:59,266 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6a7aa386 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.07 04:02:59, skipping insertion in model container [2022-07-23 16:02:59,266 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-23 16:02:59,266 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 04:02:58" (2/3) ... [2022-07-23 16:02:59,267 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6a7aa386 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.07 04:02:59, skipping insertion in model container [2022-07-23 16:02:59,267 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-23 16:02:59,267 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 04:02:59" (3/3) ... [2022-07-23 16:02:59,268 INFO L354 chiAutomizerObserver]: Analyzing ICFG sum05-2.i [2022-07-23 16:02:59,328 INFO L255 stractBuchiCegarLoop]: Interprodecural is true [2022-07-23 16:02:59,329 INFO L256 stractBuchiCegarLoop]: Hoare is false [2022-07-23 16:02:59,329 INFO L257 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-07-23 16:02:59,329 INFO L258 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-07-23 16:02:59,329 INFO L259 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-07-23 16:02:59,329 INFO L260 stractBuchiCegarLoop]: Difference is false [2022-07-23 16:02:59,329 INFO L261 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-07-23 16:02:59,334 INFO L265 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-07-23 16:02:59,339 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 25 states, 24 states have (on average 1.4583333333333333) internal successors, (35), 24 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 16:02:59,358 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 10 [2022-07-23 16:02:59,358 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-23 16:02:59,359 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-23 16:02:59,362 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-23 16:02:59,362 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-23 16:02:59,362 INFO L287 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-07-23 16:02:59,363 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 25 states, 24 states have (on average 1.4583333333333333) internal successors, (35), 24 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 16:02:59,365 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 10 [2022-07-23 16:02:59,365 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-23 16:02:59,365 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-23 16:02:59,365 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-23 16:02:59,366 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-23 16:02:59,370 INFO L752 eck$LassoCheckResult]: Stem: 15#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); 7#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post3#1, main_~i~1#1, main_#t~ret5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~ret8#1, main_#t~mem9#1, main_#t~mem11#1, main_#t~post10#1, main_~i~2#1, main_#t~ret12#1, main_~#x~0#1.base, main_~#x~0#1.offset, main_~temp~0#1, main_~ret~1#1, main_~ret2~0#1, main_~ret5~0#1;call main_~#x~0#1.base, main_~#x~0#1.offset := #Ultimate.allocOnStack(20);havoc main_~temp~0#1;havoc main_~ret~1#1;havoc main_~ret2~0#1;havoc main_~ret5~0#1;main_~i~1#1 := 0; 14#L34-3true [2022-07-23 16:02:59,370 INFO L754 eck$LassoCheckResult]: Loop: 14#L34-3true assume !!(main_~i~1#1 < 5);call write~int(main_#t~nondet4#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet4#1; 10#L34-2true main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 14#L34-3true [2022-07-23 16:02:59,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 16:02:59,376 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2022-07-23 16:02:59,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 16:02:59,387 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755853921] [2022-07-23 16:02:59,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 16:02:59,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 16:02:59,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 16:02:59,455 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 16:02:59,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 16:02:59,473 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 16:02:59,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 16:02:59,475 INFO L85 PathProgramCache]: Analyzing trace with hash 1283, now seen corresponding path program 1 times [2022-07-23 16:02:59,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 16:02:59,476 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843577823] [2022-07-23 16:02:59,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 16:02:59,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 16:02:59,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 16:02:59,483 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 16:02:59,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 16:02:59,489 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 16:02:59,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 16:02:59,490 INFO L85 PathProgramCache]: Analyzing trace with hash 925765, now seen corresponding path program 1 times [2022-07-23 16:02:59,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 16:02:59,491 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695505970] [2022-07-23 16:02:59,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 16:02:59,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 16:02:59,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 16:02:59,505 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 16:02:59,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 16:02:59,532 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 16:02:59,735 INFO L210 LassoAnalysis]: Preferences: [2022-07-23 16:02:59,736 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-23 16:02:59,737 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-23 16:02:59,737 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-23 16:02:59,737 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-23 16:02:59,737 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 16:02:59,738 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-23 16:02:59,738 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-23 16:02:59,738 INFO L133 ssoRankerPreferences]: Filename of dumped script: sum05-2.i_Iteration1_Lasso [2022-07-23 16:02:59,738 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-23 16:02:59,738 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-23 16:02:59,752 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 16:02:59,758 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 16:02:59,760 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 16:02:59,763 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 16:02:59,765 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 16:02:59,768 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 16:02:59,769 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 16:02:59,771 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 16:02:59,774 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 16:02:59,776 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 16:02:59,936 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 16:02:59,938 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 16:02:59,940 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 16:02:59,942 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 16:02:59,944 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 16:02:59,945 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 16:02:59,947 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 16:02:59,950 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 16:03:00,163 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-23 16:03:00,166 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-23 16:03:00,167 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 16:03:00,167 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 16:03:00,169 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 16:03:00,171 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2022-07-23 16:03:00,173 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 16:03:00,179 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 16:03:00,179 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 16:03:00,180 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 16:03:00,180 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 16:03:00,180 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 16:03:00,183 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-23 16:03:00,183 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 16:03:00,187 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 16:03:00,203 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2022-07-23 16:03:00,206 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 16:03:00,206 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 16:03:00,207 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 16:03:00,208 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2022-07-23 16:03:00,210 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 16:03:00,216 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 16:03:00,216 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 16:03:00,216 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 16:03:00,216 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 16:03:00,216 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 16:03:00,217 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-23 16:03:00,217 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 16:03:00,225 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 16:03:00,241 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2022-07-23 16:03:00,242 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 16:03:00,242 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 16:03:00,243 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 16:03:00,244 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2022-07-23 16:03:00,246 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 16:03:00,252 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 16:03:00,252 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 16:03:00,252 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 16:03:00,252 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 16:03:00,254 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-23 16:03:00,254 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-23 16:03:00,266 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 16:03:00,285 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2022-07-23 16:03:00,285 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 16:03:00,285 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 16:03:00,286 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 16:03:00,288 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2022-07-23 16:03:00,289 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 16:03:00,295 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 16:03:00,295 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 16:03:00,295 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 16:03:00,295 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 16:03:00,295 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 16:03:00,296 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-23 16:03:00,296 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 16:03:00,311 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 16:03:00,341 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2022-07-23 16:03:00,341 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 16:03:00,341 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 16:03:00,343 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 16:03:00,343 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2022-07-23 16:03:00,345 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 16:03:00,351 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 16:03:00,351 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 16:03:00,351 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 16:03:00,351 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 16:03:00,351 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 16:03:00,352 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-23 16:03:00,352 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 16:03:00,357 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 16:03:00,373 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2022-07-23 16:03:00,374 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 16:03:00,374 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 16:03:00,375 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 16:03:00,376 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2022-07-23 16:03:00,378 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 16:03:00,384 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 16:03:00,384 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 16:03:00,384 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 16:03:00,384 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 16:03:00,384 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 16:03:00,384 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-23 16:03:00,384 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 16:03:00,394 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 16:03:00,411 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2022-07-23 16:03:00,411 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 16:03:00,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 16:03:00,412 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 16:03:00,413 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2022-07-23 16:03:00,415 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 16:03:00,421 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 16:03:00,421 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 16:03:00,421 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 16:03:00,421 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 16:03:00,421 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 16:03:00,421 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-23 16:03:00,422 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 16:03:00,422 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 16:03:00,438 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2022-07-23 16:03:00,439 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 16:03:00,439 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 16:03:00,440 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 16:03:00,440 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2022-07-23 16:03:00,442 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 16:03:00,447 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 16:03:00,447 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 16:03:00,448 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 16:03:00,448 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 16:03:00,448 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 16:03:00,448 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-23 16:03:00,448 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 16:03:00,463 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 16:03:00,479 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2022-07-23 16:03:00,480 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 16:03:00,480 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 16:03:00,481 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 16:03:00,482 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2022-07-23 16:03:00,483 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 16:03:00,489 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 16:03:00,489 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 16:03:00,489 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 16:03:00,489 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 16:03:00,491 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-23 16:03:00,491 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-23 16:03:00,497 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 16:03:00,513 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2022-07-23 16:03:00,513 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 16:03:00,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 16:03:00,514 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 16:03:00,516 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2022-07-23 16:03:00,517 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 16:03:00,526 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 16:03:00,527 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 16:03:00,527 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 16:03:00,527 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 16:03:00,537 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-23 16:03:00,537 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-23 16:03:00,551 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 16:03:00,567 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2022-07-23 16:03:00,568 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 16:03:00,568 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 16:03:00,569 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 16:03:00,570 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2022-07-23 16:03:00,572 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 16:03:00,577 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 16:03:00,578 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 16:03:00,578 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 16:03:00,578 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 16:03:00,579 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-23 16:03:00,579 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-23 16:03:00,589 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 16:03:00,605 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2022-07-23 16:03:00,605 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 16:03:00,605 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 16:03:00,606 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 16:03:00,608 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2022-07-23 16:03:00,609 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 16:03:00,615 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 16:03:00,615 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 16:03:00,615 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 16:03:00,615 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 16:03:00,618 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-23 16:03:00,619 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-23 16:03:00,639 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-23 16:03:00,664 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2022-07-23 16:03:00,664 INFO L444 ModelExtractionUtils]: 5 out of 13 variables were initially zero. Simplification set additionally 5 variables to zero. [2022-07-23 16:03:00,665 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 16:03:00,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 16:03:00,667 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 16:03:00,698 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-23 16:03:00,706 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2022-07-23 16:03:00,732 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-07-23 16:03:00,732 INFO L513 LassoAnalysis]: Proved termination. [2022-07-23 16:03:00,733 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~#x~0#1.base)_1, ULTIMATE.start_main_~i~1#1) = 9*v_rep(select #length ULTIMATE.start_main_~#x~0#1.base)_1 - 8*ULTIMATE.start_main_~i~1#1 Supporting invariants [] [2022-07-23 16:03:00,769 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2022-07-23 16:03:00,780 INFO L293 tatePredicateManager]: 5 out of 5 supporting invariants were superfluous and have been removed [2022-07-23 16:03:00,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 16:03:00,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 16:03:00,819 INFO L263 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-23 16:03:00,820 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 16:03:00,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 16:03:00,832 INFO L263 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-23 16:03:00,832 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 16:03:00,859 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 16:03:00,894 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2022-07-23 16:03:00,895 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 25 states, 24 states have (on average 1.4583333333333333) internal successors, (35), 24 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 16:03:00,904 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2022-07-23 16:03:00,972 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 25 states, 24 states have (on average 1.4583333333333333) internal successors, (35), 24 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0). Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 66 states and 92 transitions. Complement of second has 8 states. [2022-07-23 16:03:00,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2022-07-23 16:03:00,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 16:03:00,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 61 transitions. [2022-07-23 16:03:00,979 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 61 transitions. Stem has 2 letters. Loop has 2 letters. [2022-07-23 16:03:00,979 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-23 16:03:00,979 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 61 transitions. Stem has 4 letters. Loop has 2 letters. [2022-07-23 16:03:00,979 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-23 16:03:00,979 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 61 transitions. Stem has 2 letters. Loop has 4 letters. [2022-07-23 16:03:00,980 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-23 16:03:00,980 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 66 states and 92 transitions. [2022-07-23 16:03:00,984 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2022-07-23 16:03:00,987 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 66 states to 19 states and 24 transitions. [2022-07-23 16:03:00,988 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2022-07-23 16:03:00,988 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2022-07-23 16:03:00,988 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 24 transitions. [2022-07-23 16:03:00,989 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-23 16:03:00,989 INFO L369 hiAutomatonCegarLoop]: Abstraction has 19 states and 24 transitions. [2022-07-23 16:03:00,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 24 transitions. [2022-07-23 16:03:01,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2022-07-23 16:03:01,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.263157894736842) internal successors, (24), 18 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 16:03:01,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 24 transitions. [2022-07-23 16:03:01,005 INFO L392 hiAutomatonCegarLoop]: Abstraction has 19 states and 24 transitions. [2022-07-23 16:03:01,005 INFO L374 stractBuchiCegarLoop]: Abstraction has 19 states and 24 transitions. [2022-07-23 16:03:01,006 INFO L287 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-07-23 16:03:01,006 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 24 transitions. [2022-07-23 16:03:01,006 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2022-07-23 16:03:01,007 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-23 16:03:01,007 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-23 16:03:01,007 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2022-07-23 16:03:01,007 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-23 16:03:01,007 INFO L752 eck$LassoCheckResult]: Stem: 151#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); 152#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post3#1, main_~i~1#1, main_#t~ret5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~ret8#1, main_#t~mem9#1, main_#t~mem11#1, main_#t~post10#1, main_~i~2#1, main_#t~ret12#1, main_~#x~0#1.base, main_~#x~0#1.offset, main_~temp~0#1, main_~ret~1#1, main_~ret2~0#1, main_~ret5~0#1;call main_~#x~0#1.base, main_~#x~0#1.offset := #Ultimate.allocOnStack(20);havoc main_~temp~0#1;havoc main_~ret~1#1;havoc main_~ret2~0#1;havoc main_~ret5~0#1;main_~i~1#1 := 0; 163#L34-3 assume !(main_~i~1#1 < 5); 155#L34-4 assume { :begin_inline_sum } true;sum_#in~x#1.base, sum_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc sum_#res#1;havoc sum_#t~mem2#1, sum_#t~post1#1, sum_~x#1.base, sum_~x#1.offset, sum_~i~0#1, sum_~ret~0#1;sum_~x#1.base, sum_~x#1.offset := sum_#in~x#1.base, sum_#in~x#1.offset;havoc sum_~i~0#1;havoc sum_~ret~0#1;sum_~ret~0#1 := 0;sum_~i~0#1 := 0; 156#L20-3 [2022-07-23 16:03:01,007 INFO L754 eck$LassoCheckResult]: Loop: 156#L20-3 assume !!(sum_~i~0#1 < 5);call sum_#t~mem2#1 := read~int(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem2#1;havoc sum_#t~mem2#1; 169#L20-2 sum_#t~post1#1 := sum_~i~0#1;sum_~i~0#1 := 1 + sum_#t~post1#1;havoc sum_#t~post1#1; 156#L20-3 [2022-07-23 16:03:01,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 16:03:01,008 INFO L85 PathProgramCache]: Analyzing trace with hash 925707, now seen corresponding path program 1 times [2022-07-23 16:03:01,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 16:03:01,008 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020909100] [2022-07-23 16:03:01,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 16:03:01,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 16:03:01,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 16:03:01,037 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 16:03:01,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 16:03:01,037 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020909100] [2022-07-23 16:03:01,038 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1020909100] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 16:03:01,038 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 16:03:01,038 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-23 16:03:01,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275144970] [2022-07-23 16:03:01,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 16:03:01,040 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-23 16:03:01,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 16:03:01,040 INFO L85 PathProgramCache]: Analyzing trace with hash 1731, now seen corresponding path program 1 times [2022-07-23 16:03:01,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 16:03:01,041 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132667140] [2022-07-23 16:03:01,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 16:03:01,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 16:03:01,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 16:03:01,045 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 16:03:01,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 16:03:01,049 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 16:03:01,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 16:03:01,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-23 16:03:01,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 16:03:01,078 INFO L87 Difference]: Start difference. First operand 19 states and 24 transitions. cyclomatic complexity: 10 Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 16:03:01,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 16:03:01,085 INFO L93 Difference]: Finished difference Result 20 states and 24 transitions. [2022-07-23 16:03:01,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-23 16:03:01,086 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 24 transitions. [2022-07-23 16:03:01,087 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2022-07-23 16:03:01,087 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 20 states and 24 transitions. [2022-07-23 16:03:01,087 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2022-07-23 16:03:01,087 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2022-07-23 16:03:01,088 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 24 transitions. [2022-07-23 16:03:01,088 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-23 16:03:01,088 INFO L369 hiAutomatonCegarLoop]: Abstraction has 20 states and 24 transitions. [2022-07-23 16:03:01,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 24 transitions. [2022-07-23 16:03:01,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2022-07-23 16:03:01,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 18 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 16:03:01,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions. [2022-07-23 16:03:01,090 INFO L392 hiAutomatonCegarLoop]: Abstraction has 19 states and 23 transitions. [2022-07-23 16:03:01,090 INFO L374 stractBuchiCegarLoop]: Abstraction has 19 states and 23 transitions. [2022-07-23 16:03:01,090 INFO L287 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-07-23 16:03:01,090 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 23 transitions. [2022-07-23 16:03:01,090 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2022-07-23 16:03:01,090 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-23 16:03:01,091 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-23 16:03:01,091 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2022-07-23 16:03:01,091 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-23 16:03:01,091 INFO L752 eck$LassoCheckResult]: Stem: 196#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); 197#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post3#1, main_~i~1#1, main_#t~ret5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~ret8#1, main_#t~mem9#1, main_#t~mem11#1, main_#t~post10#1, main_~i~2#1, main_#t~ret12#1, main_~#x~0#1.base, main_~#x~0#1.offset, main_~temp~0#1, main_~ret~1#1, main_~ret2~0#1, main_~ret5~0#1;call main_~#x~0#1.base, main_~#x~0#1.offset := #Ultimate.allocOnStack(20);havoc main_~temp~0#1;havoc main_~ret~1#1;havoc main_~ret2~0#1;havoc main_~ret5~0#1;main_~i~1#1 := 0; 208#L34-3 assume !!(main_~i~1#1 < 5);call write~int(main_#t~nondet4#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet4#1; 211#L34-2 main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 212#L34-3 assume !(main_~i~1#1 < 5); 200#L34-4 assume { :begin_inline_sum } true;sum_#in~x#1.base, sum_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc sum_#res#1;havoc sum_#t~mem2#1, sum_#t~post1#1, sum_~x#1.base, sum_~x#1.offset, sum_~i~0#1, sum_~ret~0#1;sum_~x#1.base, sum_~x#1.offset := sum_#in~x#1.base, sum_#in~x#1.offset;havoc sum_~i~0#1;havoc sum_~ret~0#1;sum_~ret~0#1 := 0;sum_~i~0#1 := 0; 201#L20-3 [2022-07-23 16:03:01,091 INFO L754 eck$LassoCheckResult]: Loop: 201#L20-3 assume !!(sum_~i~0#1 < 5);call sum_#t~mem2#1 := read~int(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem2#1;havoc sum_#t~mem2#1; 214#L20-2 sum_#t~post1#1 := sum_~i~0#1;sum_~i~0#1 := 1 + sum_#t~post1#1;havoc sum_#t~post1#1; 201#L20-3 [2022-07-23 16:03:01,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 16:03:01,092 INFO L85 PathProgramCache]: Analyzing trace with hash 889660429, now seen corresponding path program 1 times [2022-07-23 16:03:01,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 16:03:01,092 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819457426] [2022-07-23 16:03:01,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 16:03:01,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 16:03:01,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 16:03:01,134 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 16:03:01,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 16:03:01,135 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819457426] [2022-07-23 16:03:01,135 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [819457426] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 16:03:01,135 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [286324840] [2022-07-23 16:03:01,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 16:03:01,136 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 16:03:01,136 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 16:03:01,144 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-23 16:03:01,165 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-07-23 16:03:01,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 16:03:01,178 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-23 16:03:01,178 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 16:03:01,194 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 16:03:01,195 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 16:03:01,210 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 16:03:01,210 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [286324840] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 16:03:01,210 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 16:03:01,210 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2022-07-23 16:03:01,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721547603] [2022-07-23 16:03:01,211 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 16:03:01,211 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-23 16:03:01,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 16:03:01,211 INFO L85 PathProgramCache]: Analyzing trace with hash 1731, now seen corresponding path program 2 times [2022-07-23 16:03:01,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 16:03:01,212 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990075806] [2022-07-23 16:03:01,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 16:03:01,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 16:03:01,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 16:03:01,219 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 16:03:01,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 16:03:01,232 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 16:03:01,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 16:03:01,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-23 16:03:01,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-07-23 16:03:01,265 INFO L87 Difference]: Start difference. First operand 19 states and 23 transitions. cyclomatic complexity: 9 Second operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 16:03:01,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 16:03:01,291 INFO L93 Difference]: Finished difference Result 25 states and 29 transitions. [2022-07-23 16:03:01,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-23 16:03:01,293 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 29 transitions. [2022-07-23 16:03:01,296 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2022-07-23 16:03:01,297 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 25 states and 29 transitions. [2022-07-23 16:03:01,297 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2022-07-23 16:03:01,298 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2022-07-23 16:03:01,298 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 29 transitions. [2022-07-23 16:03:01,298 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-23 16:03:01,298 INFO L369 hiAutomatonCegarLoop]: Abstraction has 25 states and 29 transitions. [2022-07-23 16:03:01,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 29 transitions. [2022-07-23 16:03:01,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2022-07-23 16:03:01,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 1.16) internal successors, (29), 24 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 16:03:01,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2022-07-23 16:03:01,304 INFO L392 hiAutomatonCegarLoop]: Abstraction has 25 states and 29 transitions. [2022-07-23 16:03:01,304 INFO L374 stractBuchiCegarLoop]: Abstraction has 25 states and 29 transitions. [2022-07-23 16:03:01,304 INFO L287 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2022-07-23 16:03:01,304 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 29 transitions. [2022-07-23 16:03:01,304 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2022-07-23 16:03:01,305 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-23 16:03:01,305 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-23 16:03:01,305 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 1, 1, 1, 1] [2022-07-23 16:03:01,305 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-23 16:03:01,305 INFO L752 eck$LassoCheckResult]: Stem: 282#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); 283#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post3#1, main_~i~1#1, main_#t~ret5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~ret8#1, main_#t~mem9#1, main_#t~mem11#1, main_#t~post10#1, main_~i~2#1, main_#t~ret12#1, main_~#x~0#1.base, main_~#x~0#1.offset, main_~temp~0#1, main_~ret~1#1, main_~ret2~0#1, main_~ret5~0#1;call main_~#x~0#1.base, main_~#x~0#1.offset := #Ultimate.allocOnStack(20);havoc main_~temp~0#1;havoc main_~ret~1#1;havoc main_~ret2~0#1;havoc main_~ret5~0#1;main_~i~1#1 := 0; 292#L34-3 assume !!(main_~i~1#1 < 5);call write~int(main_#t~nondet4#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet4#1; 299#L34-2 main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 300#L34-3 assume !!(main_~i~1#1 < 5);call write~int(main_#t~nondet4#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet4#1; 295#L34-2 main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 296#L34-3 assume !!(main_~i~1#1 < 5);call write~int(main_#t~nondet4#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet4#1; 304#L34-2 main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 303#L34-3 assume !!(main_~i~1#1 < 5);call write~int(main_#t~nondet4#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet4#1; 302#L34-2 main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 301#L34-3 assume !(main_~i~1#1 < 5); 284#L34-4 assume { :begin_inline_sum } true;sum_#in~x#1.base, sum_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc sum_#res#1;havoc sum_#t~mem2#1, sum_#t~post1#1, sum_~x#1.base, sum_~x#1.offset, sum_~i~0#1, sum_~ret~0#1;sum_~x#1.base, sum_~x#1.offset := sum_#in~x#1.base, sum_#in~x#1.offset;havoc sum_~i~0#1;havoc sum_~ret~0#1;sum_~ret~0#1 := 0;sum_~i~0#1 := 0; 285#L20-3 [2022-07-23 16:03:01,305 INFO L754 eck$LassoCheckResult]: Loop: 285#L20-3 assume !!(sum_~i~0#1 < 5);call sum_#t~mem2#1 := read~int(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem2#1;havoc sum_#t~mem2#1; 298#L20-2 sum_#t~post1#1 := sum_~i~0#1;sum_~i~0#1 := 1 + sum_#t~post1#1;havoc sum_#t~post1#1; 285#L20-3 [2022-07-23 16:03:01,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 16:03:01,305 INFO L85 PathProgramCache]: Analyzing trace with hash 833936659, now seen corresponding path program 2 times [2022-07-23 16:03:01,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 16:03:01,306 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806118130] [2022-07-23 16:03:01,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 16:03:01,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 16:03:01,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 16:03:01,370 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 16:03:01,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 16:03:01,370 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806118130] [2022-07-23 16:03:01,371 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1806118130] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 16:03:01,371 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [877189108] [2022-07-23 16:03:01,371 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-23 16:03:01,371 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 16:03:01,371 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 16:03:01,372 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-23 16:03:01,373 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-07-23 16:03:01,407 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-23 16:03:01,407 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-23 16:03:01,408 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-23 16:03:01,408 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 16:03:01,430 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 16:03:01,430 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 16:03:01,450 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 16:03:01,451 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [877189108] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 16:03:01,451 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 16:03:01,451 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 8 [2022-07-23 16:03:01,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520411208] [2022-07-23 16:03:01,451 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 16:03:01,451 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-23 16:03:01,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 16:03:01,452 INFO L85 PathProgramCache]: Analyzing trace with hash 1731, now seen corresponding path program 3 times [2022-07-23 16:03:01,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 16:03:01,452 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414000791] [2022-07-23 16:03:01,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 16:03:01,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 16:03:01,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 16:03:01,455 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 16:03:01,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 16:03:01,458 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 16:03:01,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 16:03:01,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-23 16:03:01,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2022-07-23 16:03:01,484 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. cyclomatic complexity: 9 Second operand has 8 states, 8 states have (on average 1.875) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 16:03:01,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 16:03:01,499 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2022-07-23 16:03:01,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 16:03:01,500 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 31 transitions. [2022-07-23 16:03:01,500 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2022-07-23 16:03:01,501 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 27 states and 31 transitions. [2022-07-23 16:03:01,501 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2022-07-23 16:03:01,501 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2022-07-23 16:03:01,501 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 31 transitions. [2022-07-23 16:03:01,501 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-23 16:03:01,501 INFO L369 hiAutomatonCegarLoop]: Abstraction has 27 states and 31 transitions. [2022-07-23 16:03:01,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 31 transitions. [2022-07-23 16:03:01,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-07-23 16:03:01,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 26 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 16:03:01,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2022-07-23 16:03:01,518 INFO L392 hiAutomatonCegarLoop]: Abstraction has 27 states and 31 transitions. [2022-07-23 16:03:01,518 INFO L374 stractBuchiCegarLoop]: Abstraction has 27 states and 31 transitions. [2022-07-23 16:03:01,518 INFO L287 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2022-07-23 16:03:01,518 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 31 transitions. [2022-07-23 16:03:01,519 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2022-07-23 16:03:01,519 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-23 16:03:01,519 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-23 16:03:01,519 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 5, 1, 1, 1, 1] [2022-07-23 16:03:01,519 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-23 16:03:01,519 INFO L752 eck$LassoCheckResult]: Stem: 411#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); 412#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post3#1, main_~i~1#1, main_#t~ret5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~ret8#1, main_#t~mem9#1, main_#t~mem11#1, main_#t~post10#1, main_~i~2#1, main_#t~ret12#1, main_~#x~0#1.base, main_~#x~0#1.offset, main_~temp~0#1, main_~ret~1#1, main_~ret2~0#1, main_~ret5~0#1;call main_~#x~0#1.base, main_~#x~0#1.offset := #Ultimate.allocOnStack(20);havoc main_~temp~0#1;havoc main_~ret~1#1;havoc main_~ret2~0#1;havoc main_~ret5~0#1;main_~i~1#1 := 0; 421#L34-3 assume !!(main_~i~1#1 < 5);call write~int(main_#t~nondet4#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet4#1; 428#L34-2 main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 429#L34-3 assume !!(main_~i~1#1 < 5);call write~int(main_#t~nondet4#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet4#1; 424#L34-2 main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 425#L34-3 assume !!(main_~i~1#1 < 5);call write~int(main_#t~nondet4#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet4#1; 435#L34-2 main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 434#L34-3 assume !!(main_~i~1#1 < 5);call write~int(main_#t~nondet4#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet4#1; 433#L34-2 main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 432#L34-3 assume !!(main_~i~1#1 < 5);call write~int(main_#t~nondet4#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet4#1; 431#L34-2 main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 430#L34-3 assume !(main_~i~1#1 < 5); 413#L34-4 assume { :begin_inline_sum } true;sum_#in~x#1.base, sum_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc sum_#res#1;havoc sum_#t~mem2#1, sum_#t~post1#1, sum_~x#1.base, sum_~x#1.offset, sum_~i~0#1, sum_~ret~0#1;sum_~x#1.base, sum_~x#1.offset := sum_#in~x#1.base, sum_#in~x#1.offset;havoc sum_~i~0#1;havoc sum_~ret~0#1;sum_~ret~0#1 := 0;sum_~i~0#1 := 0; 414#L20-3 [2022-07-23 16:03:01,522 INFO L754 eck$LassoCheckResult]: Loop: 414#L20-3 assume !!(sum_~i~0#1 < 5);call sum_#t~mem2#1 := read~int(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem2#1;havoc sum_#t~mem2#1; 427#L20-2 sum_#t~post1#1 := sum_~i~0#1;sum_~i~0#1 := 1 + sum_#t~post1#1;havoc sum_#t~post1#1; 414#L20-3 [2022-07-23 16:03:01,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 16:03:01,522 INFO L85 PathProgramCache]: Analyzing trace with hash -1745699051, now seen corresponding path program 3 times [2022-07-23 16:03:01,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 16:03:01,523 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479734168] [2022-07-23 16:03:01,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 16:03:01,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 16:03:01,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 16:03:01,536 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 16:03:01,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 16:03:01,569 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 16:03:01,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 16:03:01,570 INFO L85 PathProgramCache]: Analyzing trace with hash 1731, now seen corresponding path program 4 times [2022-07-23 16:03:01,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 16:03:01,570 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440796936] [2022-07-23 16:03:01,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 16:03:01,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 16:03:01,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 16:03:01,573 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 16:03:01,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 16:03:01,575 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 16:03:01,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 16:03:01,575 INFO L85 PathProgramCache]: Analyzing trace with hash 1715425495, now seen corresponding path program 1 times [2022-07-23 16:03:01,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 16:03:01,576 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25410851] [2022-07-23 16:03:01,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 16:03:01,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 16:03:01,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 16:03:01,590 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 16:03:01,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 16:03:01,602 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 16:03:02,123 INFO L210 LassoAnalysis]: Preferences: [2022-07-23 16:03:02,124 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-23 16:03:02,124 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-23 16:03:02,124 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-23 16:03:02,124 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-23 16:03:02,124 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 16:03:02,124 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-23 16:03:02,124 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-23 16:03:02,124 INFO L133 ssoRankerPreferences]: Filename of dumped script: sum05-2.i_Iteration5_Lasso [2022-07-23 16:03:02,124 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-23 16:03:02,124 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-23 16:03:02,126 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 16:03:02,127 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 16:03:02,129 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 16:03:02,130 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 16:03:02,132 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 16:03:02,444 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 16:03:02,446 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 16:03:02,447 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 16:03:02,449 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 16:03:02,450 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 16:03:02,452 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 16:03:02,453 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 16:03:02,455 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 16:03:02,456 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 16:03:02,457 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 16:03:02,459 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 16:03:02,460 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 16:03:02,461 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 16:03:02,463 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 16:03:02,464 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 16:03:02,465 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 16:03:02,467 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 16:03:02,707 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-23 16:03:02,707 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-23 16:03:02,707 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 16:03:02,708 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 16:03:02,748 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 16:03:02,749 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2022-07-23 16:03:02,751 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 16:03:02,756 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 16:03:02,756 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 16:03:02,756 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 16:03:02,756 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 16:03:02,756 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 16:03:02,757 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-23 16:03:02,757 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 16:03:02,771 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 16:03:02,786 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2022-07-23 16:03:02,786 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 16:03:02,787 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 16:03:02,793 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 16:03:02,794 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2022-07-23 16:03:02,795 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 16:03:02,800 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 16:03:02,800 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 16:03:02,800 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 16:03:02,800 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 16:03:02,800 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 16:03:02,801 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-23 16:03:02,801 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 16:03:02,802 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 16:03:02,818 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2022-07-23 16:03:02,819 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 16:03:02,819 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 16:03:02,820 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 16:03:02,821 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2022-07-23 16:03:02,823 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 16:03:02,828 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 16:03:02,828 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 16:03:02,829 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 16:03:02,829 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 16:03:02,829 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 16:03:02,829 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-23 16:03:02,829 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 16:03:02,830 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 16:03:02,846 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2022-07-23 16:03:02,846 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 16:03:02,847 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 16:03:02,847 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 16:03:02,851 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2022-07-23 16:03:02,854 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 16:03:02,860 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 16:03:02,860 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 16:03:02,860 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 16:03:02,860 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 16:03:02,870 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-23 16:03:02,870 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-23 16:03:02,886 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 16:03:02,904 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2022-07-23 16:03:02,904 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 16:03:02,904 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 16:03:02,906 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 16:03:02,907 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2022-07-23 16:03:02,909 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 16:03:02,915 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 16:03:02,915 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 16:03:02,915 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 16:03:02,915 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 16:03:02,916 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-23 16:03:02,916 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-23 16:03:02,932 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 16:03:02,949 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2022-07-23 16:03:02,950 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 16:03:02,950 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 16:03:02,964 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 16:03:02,968 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2022-07-23 16:03:02,968 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 16:03:02,973 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 16:03:02,974 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 16:03:02,974 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 16:03:02,974 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 16:03:02,975 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-23 16:03:02,975 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-23 16:03:03,003 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 16:03:03,021 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2022-07-23 16:03:03,021 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 16:03:03,021 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 16:03:03,022 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 16:03:03,023 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2022-07-23 16:03:03,024 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 16:03:03,030 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 16:03:03,030 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 16:03:03,030 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 16:03:03,030 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 16:03:03,036 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-23 16:03:03,036 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-23 16:03:03,049 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 16:03:03,064 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2022-07-23 16:03:03,065 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 16:03:03,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 16:03:03,066 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 16:03:03,068 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2022-07-23 16:03:03,069 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 16:03:03,075 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 16:03:03,075 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 16:03:03,075 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 16:03:03,075 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 16:03:03,076 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-23 16:03:03,076 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-23 16:03:03,086 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 16:03:03,105 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2022-07-23 16:03:03,105 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 16:03:03,106 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 16:03:03,107 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 16:03:03,107 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2022-07-23 16:03:03,109 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 16:03:03,114 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 16:03:03,114 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 16:03:03,114 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 16:03:03,114 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 16:03:03,115 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-23 16:03:03,115 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-23 16:03:03,136 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 16:03:03,160 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Ended with exit code 0 [2022-07-23 16:03:03,161 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 16:03:03,161 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 16:03:03,162 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 16:03:03,164 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2022-07-23 16:03:03,164 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 16:03:03,169 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 16:03:03,170 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 16:03:03,170 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 16:03:03,170 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 16:03:03,171 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-23 16:03:03,171 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-23 16:03:03,173 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 16:03:03,189 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2022-07-23 16:03:03,189 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 16:03:03,189 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 16:03:03,197 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 16:03:03,198 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2022-07-23 16:03:03,199 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 16:03:03,204 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 16:03:03,204 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 16:03:03,205 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 16:03:03,205 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 16:03:03,206 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-23 16:03:03,206 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-23 16:03:03,208 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 16:03:03,225 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2022-07-23 16:03:03,225 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 16:03:03,225 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 16:03:03,226 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 16:03:03,229 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2022-07-23 16:03:03,229 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 16:03:03,234 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 16:03:03,234 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 16:03:03,234 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 16:03:03,235 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 16:03:03,236 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-23 16:03:03,236 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-23 16:03:03,255 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 16:03:03,270 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0 [2022-07-23 16:03:03,270 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 16:03:03,271 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 16:03:03,271 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 16:03:03,279 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2022-07-23 16:03:03,280 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 16:03:03,286 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 16:03:03,286 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 16:03:03,286 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 16:03:03,286 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 16:03:03,290 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-23 16:03:03,291 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-23 16:03:03,305 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-23 16:03:03,336 INFO L443 ModelExtractionUtils]: Simplification made 16 calls to the SMT solver. [2022-07-23 16:03:03,336 INFO L444 ModelExtractionUtils]: 1 out of 16 variables were initially zero. Simplification set additionally 12 variables to zero. [2022-07-23 16:03:03,336 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 16:03:03,336 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 16:03:03,345 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 16:03:03,353 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2022-07-23 16:03:03,354 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-23 16:03:03,360 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-07-23 16:03:03,360 INFO L513 LassoAnalysis]: Proved termination. [2022-07-23 16:03:03,361 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_sum_~i~0#1) = -2*ULTIMATE.start_sum_~i~0#1 + 9 Supporting invariants [] [2022-07-23 16:03:03,376 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Ended with exit code 0 [2022-07-23 16:03:03,447 INFO L293 tatePredicateManager]: 29 out of 29 supporting invariants were superfluous and have been removed [2022-07-23 16:03:03,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 16:03:03,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 16:03:03,477 INFO L263 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-23 16:03:03,477 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 16:03:03,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 16:03:03,491 INFO L263 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-23 16:03:03,491 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 16:03:03,498 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 16:03:03,499 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2022-07-23 16:03:03,499 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states and 31 transitions. cyclomatic complexity: 9 Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 16:03:03,510 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 27 states and 31 transitions. cyclomatic complexity: 9. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 31 states and 38 transitions. Complement of second has 7 states. [2022-07-23 16:03:03,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2022-07-23 16:03:03,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 16:03:03,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 10 transitions. [2022-07-23 16:03:03,512 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 14 letters. Loop has 2 letters. [2022-07-23 16:03:03,513 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-23 16:03:03,513 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 16 letters. Loop has 2 letters. [2022-07-23 16:03:03,513 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-23 16:03:03,513 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 14 letters. Loop has 4 letters. [2022-07-23 16:03:03,513 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-23 16:03:03,513 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 38 transitions. [2022-07-23 16:03:03,514 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2022-07-23 16:03:03,514 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 28 states and 33 transitions. [2022-07-23 16:03:03,514 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2022-07-23 16:03:03,514 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2022-07-23 16:03:03,514 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 33 transitions. [2022-07-23 16:03:03,514 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-23 16:03:03,514 INFO L369 hiAutomatonCegarLoop]: Abstraction has 28 states and 33 transitions. [2022-07-23 16:03:03,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 33 transitions. [2022-07-23 16:03:03,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2022-07-23 16:03:03,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 27 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 16:03:03,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 33 transitions. [2022-07-23 16:03:03,516 INFO L392 hiAutomatonCegarLoop]: Abstraction has 28 states and 33 transitions. [2022-07-23 16:03:03,516 INFO L374 stractBuchiCegarLoop]: Abstraction has 28 states and 33 transitions. [2022-07-23 16:03:03,516 INFO L287 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2022-07-23 16:03:03,516 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 33 transitions. [2022-07-23 16:03:03,516 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2022-07-23 16:03:03,516 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-23 16:03:03,516 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-23 16:03:03,516 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 5, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 16:03:03,516 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-23 16:03:03,517 INFO L752 eck$LassoCheckResult]: Stem: 657#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); 658#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post3#1, main_~i~1#1, main_#t~ret5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~ret8#1, main_#t~mem9#1, main_#t~mem11#1, main_#t~post10#1, main_~i~2#1, main_#t~ret12#1, main_~#x~0#1.base, main_~#x~0#1.offset, main_~temp~0#1, main_~ret~1#1, main_~ret2~0#1, main_~ret5~0#1;call main_~#x~0#1.base, main_~#x~0#1.offset := #Ultimate.allocOnStack(20);havoc main_~temp~0#1;havoc main_~ret~1#1;havoc main_~ret2~0#1;havoc main_~ret5~0#1;main_~i~1#1 := 0; 667#L34-3 assume !!(main_~i~1#1 < 5);call write~int(main_#t~nondet4#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet4#1; 675#L34-2 main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 676#L34-3 assume !!(main_~i~1#1 < 5);call write~int(main_#t~nondet4#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet4#1; 670#L34-2 main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 671#L34-3 assume !!(main_~i~1#1 < 5);call write~int(main_#t~nondet4#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet4#1; 682#L34-2 main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 681#L34-3 assume !!(main_~i~1#1 < 5);call write~int(main_#t~nondet4#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet4#1; 680#L34-2 main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 679#L34-3 assume !!(main_~i~1#1 < 5);call write~int(main_#t~nondet4#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet4#1; 678#L34-2 main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 677#L34-3 assume !(main_~i~1#1 < 5); 659#L34-4 assume { :begin_inline_sum } true;sum_#in~x#1.base, sum_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc sum_#res#1;havoc sum_#t~mem2#1, sum_#t~post1#1, sum_~x#1.base, sum_~x#1.offset, sum_~i~0#1, sum_~ret~0#1;sum_~x#1.base, sum_~x#1.offset := sum_#in~x#1.base, sum_#in~x#1.offset;havoc sum_~i~0#1;havoc sum_~ret~0#1;sum_~ret~0#1 := 0;sum_~i~0#1 := 0; 660#L20-3 assume !(sum_~i~0#1 < 5); 668#L20-4 sum_#res#1 := (if sum_~ret~0#1 % 4294967296 <= 2147483647 then sum_~ret~0#1 % 4294967296 else sum_~ret~0#1 % 4294967296 - 4294967296); 669#L23 main_#t~ret5#1 := sum_#res#1;assume { :end_inline_sum } true;main_~ret~1#1 := main_#t~ret5#1;havoc main_#t~ret5#1;call main_#t~mem6#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset, 4);main_~temp~0#1 := main_#t~mem6#1;havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int(main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4);call write~int(main_#t~mem7#1, main_~#x~0#1.base, main_~#x~0#1.offset, 4);havoc main_#t~mem7#1;call write~int(main_~temp~0#1, main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4);assume { :begin_inline_sum } true;sum_#in~x#1.base, sum_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc sum_#res#1;havoc sum_#t~mem2#1, sum_#t~post1#1, sum_~x#1.base, sum_~x#1.offset, sum_~i~0#1, sum_~ret~0#1;sum_~x#1.base, sum_~x#1.offset := sum_#in~x#1.base, sum_#in~x#1.offset;havoc sum_~i~0#1;havoc sum_~ret~0#1;sum_~ret~0#1 := 0;sum_~i~0#1 := 0; 665#L20-8 [2022-07-23 16:03:03,517 INFO L754 eck$LassoCheckResult]: Loop: 665#L20-8 assume !!(sum_~i~0#1 < 5);call sum_#t~mem2#1 := read~int(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem2#1;havoc sum_#t~mem2#1; 666#L20-7 sum_#t~post1#1 := sum_~i~0#1;sum_~i~0#1 := 1 + sum_#t~post1#1;havoc sum_#t~post1#1; 665#L20-8 [2022-07-23 16:03:03,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 16:03:03,517 INFO L85 PathProgramCache]: Analyzing trace with hash 1638581027, now seen corresponding path program 1 times [2022-07-23 16:03:03,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 16:03:03,517 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244779824] [2022-07-23 16:03:03,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 16:03:03,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 16:03:03,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 16:03:03,566 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-07-23 16:03:03,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 16:03:03,566 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244779824] [2022-07-23 16:03:03,566 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [244779824] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 16:03:03,566 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 16:03:03,566 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-23 16:03:03,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526252075] [2022-07-23 16:03:03,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 16:03:03,567 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-23 16:03:03,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 16:03:03,567 INFO L85 PathProgramCache]: Analyzing trace with hash 2243, now seen corresponding path program 1 times [2022-07-23 16:03:03,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 16:03:03,567 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112781746] [2022-07-23 16:03:03,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 16:03:03,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 16:03:03,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 16:03:03,572 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 16:03:03,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 16:03:03,580 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 16:03:03,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 16:03:03,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-23 16:03:03,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 16:03:03,608 INFO L87 Difference]: Start difference. First operand 28 states and 33 transitions. cyclomatic complexity: 10 Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 16:03:03,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 16:03:03,621 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2022-07-23 16:03:03,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-23 16:03:03,623 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 37 transitions. [2022-07-23 16:03:03,625 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2022-07-23 16:03:03,625 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 33 states and 37 transitions. [2022-07-23 16:03:03,625 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2022-07-23 16:03:03,626 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2022-07-23 16:03:03,626 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 37 transitions. [2022-07-23 16:03:03,627 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-23 16:03:03,627 INFO L369 hiAutomatonCegarLoop]: Abstraction has 33 states and 37 transitions. [2022-07-23 16:03:03,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 37 transitions. [2022-07-23 16:03:03,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 29. [2022-07-23 16:03:03,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 28 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 16:03:03,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2022-07-23 16:03:03,633 INFO L392 hiAutomatonCegarLoop]: Abstraction has 29 states and 33 transitions. [2022-07-23 16:03:03,633 INFO L374 stractBuchiCegarLoop]: Abstraction has 29 states and 33 transitions. [2022-07-23 16:03:03,634 INFO L287 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2022-07-23 16:03:03,634 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 33 transitions. [2022-07-23 16:03:03,636 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2022-07-23 16:03:03,636 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-23 16:03:03,636 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-23 16:03:03,637 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 16:03:03,637 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-23 16:03:03,638 INFO L752 eck$LassoCheckResult]: Stem: 724#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); 725#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post3#1, main_~i~1#1, main_#t~ret5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~ret8#1, main_#t~mem9#1, main_#t~mem11#1, main_#t~post10#1, main_~i~2#1, main_#t~ret12#1, main_~#x~0#1.base, main_~#x~0#1.offset, main_~temp~0#1, main_~ret~1#1, main_~ret2~0#1, main_~ret5~0#1;call main_~#x~0#1.base, main_~#x~0#1.offset := #Ultimate.allocOnStack(20);havoc main_~temp~0#1;havoc main_~ret~1#1;havoc main_~ret2~0#1;havoc main_~ret5~0#1;main_~i~1#1 := 0; 734#L34-3 assume !!(main_~i~1#1 < 5);call write~int(main_#t~nondet4#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet4#1; 737#L34-2 main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 738#L34-3 assume !!(main_~i~1#1 < 5);call write~int(main_#t~nondet4#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet4#1; 743#L34-2 main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 750#L34-3 assume !!(main_~i~1#1 < 5);call write~int(main_#t~nondet4#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet4#1; 749#L34-2 main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 748#L34-3 assume !!(main_~i~1#1 < 5);call write~int(main_#t~nondet4#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet4#1; 747#L34-2 main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 746#L34-3 assume !!(main_~i~1#1 < 5);call write~int(main_#t~nondet4#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet4#1; 745#L34-2 main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 744#L34-3 assume !(main_~i~1#1 < 5); 726#L34-4 assume { :begin_inline_sum } true;sum_#in~x#1.base, sum_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc sum_#res#1;havoc sum_#t~mem2#1, sum_#t~post1#1, sum_~x#1.base, sum_~x#1.offset, sum_~i~0#1, sum_~ret~0#1;sum_~x#1.base, sum_~x#1.offset := sum_#in~x#1.base, sum_#in~x#1.offset;havoc sum_~i~0#1;havoc sum_~ret~0#1;sum_~ret~0#1 := 0;sum_~i~0#1 := 0; 727#L20-3 assume !!(sum_~i~0#1 < 5);call sum_#t~mem2#1 := read~int(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem2#1;havoc sum_#t~mem2#1; 740#L20-2 sum_#t~post1#1 := sum_~i~0#1;sum_~i~0#1 := 1 + sum_#t~post1#1;havoc sum_#t~post1#1; 741#L20-3 assume !(sum_~i~0#1 < 5); 735#L20-4 sum_#res#1 := (if sum_~ret~0#1 % 4294967296 <= 2147483647 then sum_~ret~0#1 % 4294967296 else sum_~ret~0#1 % 4294967296 - 4294967296); 736#L23 main_#t~ret5#1 := sum_#res#1;assume { :end_inline_sum } true;main_~ret~1#1 := main_#t~ret5#1;havoc main_#t~ret5#1;call main_#t~mem6#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset, 4);main_~temp~0#1 := main_#t~mem6#1;havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int(main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4);call write~int(main_#t~mem7#1, main_~#x~0#1.base, main_~#x~0#1.offset, 4);havoc main_#t~mem7#1;call write~int(main_~temp~0#1, main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4);assume { :begin_inline_sum } true;sum_#in~x#1.base, sum_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc sum_#res#1;havoc sum_#t~mem2#1, sum_#t~post1#1, sum_~x#1.base, sum_~x#1.offset, sum_~i~0#1, sum_~ret~0#1;sum_~x#1.base, sum_~x#1.offset := sum_#in~x#1.base, sum_#in~x#1.offset;havoc sum_~i~0#1;havoc sum_~ret~0#1;sum_~ret~0#1 := 0;sum_~i~0#1 := 0; 732#L20-8 assume !!(sum_~i~0#1 < 5);call sum_#t~mem2#1 := read~int(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem2#1;havoc sum_#t~mem2#1; 733#L20-7 [2022-07-23 16:03:03,638 INFO L754 eck$LassoCheckResult]: Loop: 733#L20-7 sum_#t~post1#1 := sum_~i~0#1;sum_~i~0#1 := 1 + sum_#t~post1#1;havoc sum_#t~post1#1; 742#L20-8 assume !!(sum_~i~0#1 < 5);call sum_#t~mem2#1 := read~int(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem2#1;havoc sum_#t~mem2#1; 733#L20-7 [2022-07-23 16:03:03,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 16:03:03,638 INFO L85 PathProgramCache]: Analyzing trace with hash -1577614809, now seen corresponding path program 1 times [2022-07-23 16:03:03,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 16:03:03,639 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541890757] [2022-07-23 16:03:03,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 16:03:03,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 16:03:03,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 16:03:03,692 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-07-23 16:03:03,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 16:03:03,692 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541890757] [2022-07-23 16:03:03,692 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [541890757] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 16:03:03,692 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1367076016] [2022-07-23 16:03:03,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 16:03:03,692 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 16:03:03,692 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 16:03:03,693 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-23 16:03:03,704 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2022-07-23 16:03:03,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 16:03:03,766 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-23 16:03:03,767 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 16:03:03,772 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Forceful destruction successful, exit code 0 [2022-07-23 16:03:03,774 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-07-23 16:03:03,774 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 16:03:03,784 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-07-23 16:03:03,784 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1367076016] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 16:03:03,784 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 16:03:03,784 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2022-07-23 16:03:03,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649839120] [2022-07-23 16:03:03,784 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 16:03:03,785 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-23 16:03:03,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 16:03:03,785 INFO L85 PathProgramCache]: Analyzing trace with hash 2303, now seen corresponding path program 2 times [2022-07-23 16:03:03,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 16:03:03,785 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810920074] [2022-07-23 16:03:03,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 16:03:03,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 16:03:03,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 16:03:03,788 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 16:03:03,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 16:03:03,807 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 16:03:03,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 16:03:03,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-23 16:03:03,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-07-23 16:03:03,830 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. cyclomatic complexity: 9 Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 16:03:03,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 16:03:03,870 INFO L93 Difference]: Finished difference Result 48 states and 52 transitions. [2022-07-23 16:03:03,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-23 16:03:03,871 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 48 states and 52 transitions. [2022-07-23 16:03:03,871 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2022-07-23 16:03:03,875 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 48 states to 48 states and 52 transitions. [2022-07-23 16:03:03,875 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2022-07-23 16:03:03,875 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2022-07-23 16:03:03,875 INFO L73 IsDeterministic]: Start isDeterministic. Operand 48 states and 52 transitions. [2022-07-23 16:03:03,875 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-23 16:03:03,875 INFO L369 hiAutomatonCegarLoop]: Abstraction has 48 states and 52 transitions. [2022-07-23 16:03:03,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states and 52 transitions. [2022-07-23 16:03:03,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 41. [2022-07-23 16:03:03,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 41 states have (on average 1.0975609756097562) internal successors, (45), 40 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 16:03:03,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2022-07-23 16:03:03,881 INFO L392 hiAutomatonCegarLoop]: Abstraction has 41 states and 45 transitions. [2022-07-23 16:03:03,882 INFO L374 stractBuchiCegarLoop]: Abstraction has 41 states and 45 transitions. [2022-07-23 16:03:03,882 INFO L287 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2022-07-23 16:03:03,882 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 41 states and 45 transitions. [2022-07-23 16:03:03,882 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2022-07-23 16:03:03,882 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-23 16:03:03,882 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-23 16:03:03,883 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 5, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 16:03:03,883 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-23 16:03:03,883 INFO L752 eck$LassoCheckResult]: Stem: 925#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); 926#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post3#1, main_~i~1#1, main_#t~ret5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~ret8#1, main_#t~mem9#1, main_#t~mem11#1, main_#t~post10#1, main_~i~2#1, main_#t~ret12#1, main_~#x~0#1.base, main_~#x~0#1.offset, main_~temp~0#1, main_~ret~1#1, main_~ret2~0#1, main_~ret5~0#1;call main_~#x~0#1.base, main_~#x~0#1.offset := #Ultimate.allocOnStack(20);havoc main_~temp~0#1;havoc main_~ret~1#1;havoc main_~ret2~0#1;havoc main_~ret5~0#1;main_~i~1#1 := 0; 935#L34-3 assume !!(main_~i~1#1 < 5);call write~int(main_#t~nondet4#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet4#1; 938#L34-2 main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 939#L34-3 assume !!(main_~i~1#1 < 5);call write~int(main_#t~nondet4#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet4#1; 945#L34-2 main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 963#L34-3 assume !!(main_~i~1#1 < 5);call write~int(main_#t~nondet4#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet4#1; 962#L34-2 main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 961#L34-3 assume !!(main_~i~1#1 < 5);call write~int(main_#t~nondet4#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet4#1; 960#L34-2 main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 959#L34-3 assume !!(main_~i~1#1 < 5);call write~int(main_#t~nondet4#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet4#1; 958#L34-2 main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 957#L34-3 assume !(main_~i~1#1 < 5); 927#L34-4 assume { :begin_inline_sum } true;sum_#in~x#1.base, sum_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc sum_#res#1;havoc sum_#t~mem2#1, sum_#t~post1#1, sum_~x#1.base, sum_~x#1.offset, sum_~i~0#1, sum_~ret~0#1;sum_~x#1.base, sum_~x#1.offset := sum_#in~x#1.base, sum_#in~x#1.offset;havoc sum_~i~0#1;havoc sum_~ret~0#1;sum_~ret~0#1 := 0;sum_~i~0#1 := 0; 928#L20-3 assume !!(sum_~i~0#1 < 5);call sum_#t~mem2#1 := read~int(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem2#1;havoc sum_#t~mem2#1; 941#L20-2 sum_#t~post1#1 := sum_~i~0#1;sum_~i~0#1 := 1 + sum_#t~post1#1;havoc sum_#t~post1#1; 942#L20-3 assume !!(sum_~i~0#1 < 5);call sum_#t~mem2#1 := read~int(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem2#1;havoc sum_#t~mem2#1; 943#L20-2 sum_#t~post1#1 := sum_~i~0#1;sum_~i~0#1 := 1 + sum_#t~post1#1;havoc sum_#t~post1#1; 956#L20-3 assume !!(sum_~i~0#1 < 5);call sum_#t~mem2#1 := read~int(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem2#1;havoc sum_#t~mem2#1; 955#L20-2 sum_#t~post1#1 := sum_~i~0#1;sum_~i~0#1 := 1 + sum_#t~post1#1;havoc sum_#t~post1#1; 954#L20-3 assume !!(sum_~i~0#1 < 5);call sum_#t~mem2#1 := read~int(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem2#1;havoc sum_#t~mem2#1; 951#L20-2 sum_#t~post1#1 := sum_~i~0#1;sum_~i~0#1 := 1 + sum_#t~post1#1;havoc sum_#t~post1#1; 950#L20-3 assume !(sum_~i~0#1 < 5); 936#L20-4 sum_#res#1 := (if sum_~ret~0#1 % 4294967296 <= 2147483647 then sum_~ret~0#1 % 4294967296 else sum_~ret~0#1 % 4294967296 - 4294967296); 937#L23 main_#t~ret5#1 := sum_#res#1;assume { :end_inline_sum } true;main_~ret~1#1 := main_#t~ret5#1;havoc main_#t~ret5#1;call main_#t~mem6#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset, 4);main_~temp~0#1 := main_#t~mem6#1;havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int(main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4);call write~int(main_#t~mem7#1, main_~#x~0#1.base, main_~#x~0#1.offset, 4);havoc main_#t~mem7#1;call write~int(main_~temp~0#1, main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4);assume { :begin_inline_sum } true;sum_#in~x#1.base, sum_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc sum_#res#1;havoc sum_#t~mem2#1, sum_#t~post1#1, sum_~x#1.base, sum_~x#1.offset, sum_~i~0#1, sum_~ret~0#1;sum_~x#1.base, sum_~x#1.offset := sum_#in~x#1.base, sum_#in~x#1.offset;havoc sum_~i~0#1;havoc sum_~ret~0#1;sum_~ret~0#1 := 0;sum_~i~0#1 := 0; 933#L20-8 assume !!(sum_~i~0#1 < 5);call sum_#t~mem2#1 := read~int(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem2#1;havoc sum_#t~mem2#1; 934#L20-7 sum_#t~post1#1 := sum_~i~0#1;sum_~i~0#1 := 1 + sum_#t~post1#1;havoc sum_#t~post1#1; 944#L20-8 assume !!(sum_~i~0#1 < 5);call sum_#t~mem2#1 := read~int(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem2#1;havoc sum_#t~mem2#1; 953#L20-7 sum_#t~post1#1 := sum_~i~0#1;sum_~i~0#1 := 1 + sum_#t~post1#1;havoc sum_#t~post1#1; 952#L20-8 assume !!(sum_~i~0#1 < 5);call sum_#t~mem2#1 := read~int(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem2#1;havoc sum_#t~mem2#1; 949#L20-7 sum_#t~post1#1 := sum_~i~0#1;sum_~i~0#1 := 1 + sum_#t~post1#1;havoc sum_#t~post1#1; 948#L20-8 assume !!(sum_~i~0#1 < 5);call sum_#t~mem2#1 := read~int(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem2#1;havoc sum_#t~mem2#1; 947#L20-7 [2022-07-23 16:03:03,883 INFO L754 eck$LassoCheckResult]: Loop: 947#L20-7 sum_#t~post1#1 := sum_~i~0#1;sum_~i~0#1 := 1 + sum_#t~post1#1;havoc sum_#t~post1#1; 946#L20-8 assume !!(sum_~i~0#1 < 5);call sum_#t~mem2#1 := read~int(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem2#1;havoc sum_#t~mem2#1; 947#L20-7 [2022-07-23 16:03:03,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 16:03:03,884 INFO L85 PathProgramCache]: Analyzing trace with hash 1218450663, now seen corresponding path program 1 times [2022-07-23 16:03:03,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 16:03:03,884 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115631589] [2022-07-23 16:03:03,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 16:03:03,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 16:03:03,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 16:03:03,934 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-07-23 16:03:03,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 16:03:03,934 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115631589] [2022-07-23 16:03:03,934 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1115631589] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 16:03:03,934 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [200248596] [2022-07-23 16:03:03,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 16:03:03,934 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 16:03:03,934 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 16:03:03,935 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-23 16:03:03,936 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2022-07-23 16:03:03,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 16:03:03,986 INFO L263 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-23 16:03:03,987 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 16:03:04,000 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-07-23 16:03:04,000 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 16:03:04,014 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-07-23 16:03:04,014 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [200248596] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 16:03:04,014 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 16:03:04,014 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 8 [2022-07-23 16:03:04,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104173167] [2022-07-23 16:03:04,014 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 16:03:04,014 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-23 16:03:04,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 16:03:04,015 INFO L85 PathProgramCache]: Analyzing trace with hash 2303, now seen corresponding path program 3 times [2022-07-23 16:03:04,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 16:03:04,015 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703464872] [2022-07-23 16:03:04,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 16:03:04,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 16:03:04,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 16:03:04,017 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 16:03:04,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 16:03:04,019 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 16:03:04,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 16:03:04,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-23 16:03:04,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2022-07-23 16:03:04,051 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. cyclomatic complexity: 9 Second operand has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 16:03:04,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 16:03:04,097 INFO L93 Difference]: Finished difference Result 54 states and 58 transitions. [2022-07-23 16:03:04,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 16:03:04,097 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 54 states and 58 transitions. [2022-07-23 16:03:04,098 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2022-07-23 16:03:04,098 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 54 states to 54 states and 58 transitions. [2022-07-23 16:03:04,098 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 34 [2022-07-23 16:03:04,098 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 34 [2022-07-23 16:03:04,098 INFO L73 IsDeterministic]: Start isDeterministic. Operand 54 states and 58 transitions. [2022-07-23 16:03:04,098 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-23 16:03:04,099 INFO L369 hiAutomatonCegarLoop]: Abstraction has 54 states and 58 transitions. [2022-07-23 16:03:04,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states and 58 transitions. [2022-07-23 16:03:04,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 45. [2022-07-23 16:03:04,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 45 states have (on average 1.0888888888888888) internal successors, (49), 44 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 16:03:04,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 49 transitions. [2022-07-23 16:03:04,100 INFO L392 hiAutomatonCegarLoop]: Abstraction has 45 states and 49 transitions. [2022-07-23 16:03:04,100 INFO L374 stractBuchiCegarLoop]: Abstraction has 45 states and 49 transitions. [2022-07-23 16:03:04,100 INFO L287 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2022-07-23 16:03:04,100 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 45 states and 49 transitions. [2022-07-23 16:03:04,101 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2022-07-23 16:03:04,101 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-23 16:03:04,101 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-23 16:03:04,101 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 16:03:04,101 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-23 16:03:04,101 INFO L752 eck$LassoCheckResult]: Stem: 1215#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); 1216#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post3#1, main_~i~1#1, main_#t~ret5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~ret8#1, main_#t~mem9#1, main_#t~mem11#1, main_#t~post10#1, main_~i~2#1, main_#t~ret12#1, main_~#x~0#1.base, main_~#x~0#1.offset, main_~temp~0#1, main_~ret~1#1, main_~ret2~0#1, main_~ret5~0#1;call main_~#x~0#1.base, main_~#x~0#1.offset := #Ultimate.allocOnStack(20);havoc main_~temp~0#1;havoc main_~ret~1#1;havoc main_~ret2~0#1;havoc main_~ret5~0#1;main_~i~1#1 := 0; 1227#L34-3 assume !!(main_~i~1#1 < 5);call write~int(main_#t~nondet4#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet4#1; 1230#L34-2 main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1231#L34-3 assume !!(main_~i~1#1 < 5);call write~int(main_#t~nondet4#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet4#1; 1237#L34-2 main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1259#L34-3 assume !!(main_~i~1#1 < 5);call write~int(main_#t~nondet4#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet4#1; 1258#L34-2 main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1257#L34-3 assume !!(main_~i~1#1 < 5);call write~int(main_#t~nondet4#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet4#1; 1256#L34-2 main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1255#L34-3 assume !!(main_~i~1#1 < 5);call write~int(main_#t~nondet4#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet4#1; 1254#L34-2 main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1253#L34-3 assume !(main_~i~1#1 < 5); 1219#L34-4 assume { :begin_inline_sum } true;sum_#in~x#1.base, sum_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc sum_#res#1;havoc sum_#t~mem2#1, sum_#t~post1#1, sum_~x#1.base, sum_~x#1.offset, sum_~i~0#1, sum_~ret~0#1;sum_~x#1.base, sum_~x#1.offset := sum_#in~x#1.base, sum_#in~x#1.offset;havoc sum_~i~0#1;havoc sum_~ret~0#1;sum_~ret~0#1 := 0;sum_~i~0#1 := 0; 1220#L20-3 assume !!(sum_~i~0#1 < 5);call sum_#t~mem2#1 := read~int(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem2#1;havoc sum_#t~mem2#1; 1233#L20-2 sum_#t~post1#1 := sum_~i~0#1;sum_~i~0#1 := 1 + sum_#t~post1#1;havoc sum_#t~post1#1; 1234#L20-3 assume !!(sum_~i~0#1 < 5);call sum_#t~mem2#1 := read~int(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem2#1;havoc sum_#t~mem2#1; 1235#L20-2 sum_#t~post1#1 := sum_~i~0#1;sum_~i~0#1 := 1 + sum_#t~post1#1;havoc sum_#t~post1#1; 1252#L20-3 assume !!(sum_~i~0#1 < 5);call sum_#t~mem2#1 := read~int(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem2#1;havoc sum_#t~mem2#1; 1251#L20-2 sum_#t~post1#1 := sum_~i~0#1;sum_~i~0#1 := 1 + sum_#t~post1#1;havoc sum_#t~post1#1; 1249#L20-3 assume !!(sum_~i~0#1 < 5);call sum_#t~mem2#1 := read~int(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem2#1;havoc sum_#t~mem2#1; 1247#L20-2 sum_#t~post1#1 := sum_~i~0#1;sum_~i~0#1 := 1 + sum_#t~post1#1;havoc sum_#t~post1#1; 1245#L20-3 assume !!(sum_~i~0#1 < 5);call sum_#t~mem2#1 := read~int(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem2#1;havoc sum_#t~mem2#1; 1242#L20-2 sum_#t~post1#1 := sum_~i~0#1;sum_~i~0#1 := 1 + sum_#t~post1#1;havoc sum_#t~post1#1; 1241#L20-3 assume !(sum_~i~0#1 < 5); 1228#L20-4 sum_#res#1 := (if sum_~ret~0#1 % 4294967296 <= 2147483647 then sum_~ret~0#1 % 4294967296 else sum_~ret~0#1 % 4294967296 - 4294967296); 1229#L23 main_#t~ret5#1 := sum_#res#1;assume { :end_inline_sum } true;main_~ret~1#1 := main_#t~ret5#1;havoc main_#t~ret5#1;call main_#t~mem6#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset, 4);main_~temp~0#1 := main_#t~mem6#1;havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int(main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4);call write~int(main_#t~mem7#1, main_~#x~0#1.base, main_~#x~0#1.offset, 4);havoc main_#t~mem7#1;call write~int(main_~temp~0#1, main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4);assume { :begin_inline_sum } true;sum_#in~x#1.base, sum_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc sum_#res#1;havoc sum_#t~mem2#1, sum_#t~post1#1, sum_~x#1.base, sum_~x#1.offset, sum_~i~0#1, sum_~ret~0#1;sum_~x#1.base, sum_~x#1.offset := sum_#in~x#1.base, sum_#in~x#1.offset;havoc sum_~i~0#1;havoc sum_~ret~0#1;sum_~ret~0#1 := 0;sum_~i~0#1 := 0; 1225#L20-8 assume !!(sum_~i~0#1 < 5);call sum_#t~mem2#1 := read~int(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem2#1;havoc sum_#t~mem2#1; 1226#L20-7 sum_#t~post1#1 := sum_~i~0#1;sum_~i~0#1 := 1 + sum_#t~post1#1;havoc sum_#t~post1#1; 1236#L20-8 assume !!(sum_~i~0#1 < 5);call sum_#t~mem2#1 := read~int(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem2#1;havoc sum_#t~mem2#1; 1250#L20-7 sum_#t~post1#1 := sum_~i~0#1;sum_~i~0#1 := 1 + sum_#t~post1#1;havoc sum_#t~post1#1; 1248#L20-8 assume !!(sum_~i~0#1 < 5);call sum_#t~mem2#1 := read~int(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem2#1;havoc sum_#t~mem2#1; 1246#L20-7 sum_#t~post1#1 := sum_~i~0#1;sum_~i~0#1 := 1 + sum_#t~post1#1;havoc sum_#t~post1#1; 1244#L20-8 assume !!(sum_~i~0#1 < 5);call sum_#t~mem2#1 := read~int(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem2#1;havoc sum_#t~mem2#1; 1243#L20-7 sum_#t~post1#1 := sum_~i~0#1;sum_~i~0#1 := 1 + sum_#t~post1#1;havoc sum_#t~post1#1; 1240#L20-8 assume !!(sum_~i~0#1 < 5);call sum_#t~mem2#1 := read~int(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem2#1;havoc sum_#t~mem2#1; 1239#L20-7 [2022-07-23 16:03:04,101 INFO L754 eck$LassoCheckResult]: Loop: 1239#L20-7 sum_#t~post1#1 := sum_~i~0#1;sum_~i~0#1 := 1 + sum_#t~post1#1;havoc sum_#t~post1#1; 1238#L20-8 assume !!(sum_~i~0#1 < 5);call sum_#t~mem2#1 := read~int(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem2#1;havoc sum_#t~mem2#1; 1239#L20-7 [2022-07-23 16:03:04,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 16:03:04,102 INFO L85 PathProgramCache]: Analyzing trace with hash -2144167641, now seen corresponding path program 2 times [2022-07-23 16:03:04,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 16:03:04,102 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312559319] [2022-07-23 16:03:04,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 16:03:04,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 16:03:04,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 16:03:04,136 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 16:03:04,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 16:03:04,156 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 16:03:04,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 16:03:04,156 INFO L85 PathProgramCache]: Analyzing trace with hash 2303, now seen corresponding path program 4 times [2022-07-23 16:03:04,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 16:03:04,157 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793591436] [2022-07-23 16:03:04,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 16:03:04,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 16:03:04,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 16:03:04,159 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 16:03:04,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 16:03:04,161 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 16:03:04,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 16:03:04,161 INFO L85 PathProgramCache]: Analyzing trace with hash 1039200421, now seen corresponding path program 3 times [2022-07-23 16:03:04,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 16:03:04,161 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537014903] [2022-07-23 16:03:04,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 16:03:04,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 16:03:04,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 16:03:04,205 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 16 proven. 9 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2022-07-23 16:03:04,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 16:03:04,205 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537014903] [2022-07-23 16:03:04,205 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [537014903] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 16:03:04,205 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1977512008] [2022-07-23 16:03:04,205 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-23 16:03:04,205 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 16:03:04,205 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 16:03:04,206 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-23 16:03:04,207 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2022-07-23 16:03:04,300 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2022-07-23 16:03:04,300 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-23 16:03:04,301 INFO L263 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-23 16:03:04,302 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 16:03:04,318 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2022-07-23 16:03:04,318 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 16:03:04,318 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1977512008] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 16:03:04,318 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-23 16:03:04,319 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 8 [2022-07-23 16:03:04,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072919637] [2022-07-23 16:03:04,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 16:03:04,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 16:03:04,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-23 16:03:04,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2022-07-23 16:03:04,350 INFO L87 Difference]: Start difference. First operand 45 states and 49 transitions. cyclomatic complexity: 9 Second operand has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 16:03:04,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 16:03:04,407 INFO L93 Difference]: Finished difference Result 54 states and 55 transitions. [2022-07-23 16:03:04,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-23 16:03:04,408 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 54 states and 55 transitions. [2022-07-23 16:03:04,408 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-07-23 16:03:04,408 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 54 states to 42 states and 43 transitions. [2022-07-23 16:03:04,408 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2022-07-23 16:03:04,408 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 32 [2022-07-23 16:03:04,408 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 43 transitions. [2022-07-23 16:03:04,409 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-23 16:03:04,409 INFO L369 hiAutomatonCegarLoop]: Abstraction has 42 states and 43 transitions. [2022-07-23 16:03:04,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 43 transitions. [2022-07-23 16:03:04,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2022-07-23 16:03:04,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 42 states have (on average 1.0238095238095237) internal successors, (43), 41 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 16:03:04,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 43 transitions. [2022-07-23 16:03:04,410 INFO L392 hiAutomatonCegarLoop]: Abstraction has 42 states and 43 transitions. [2022-07-23 16:03:04,410 INFO L374 stractBuchiCegarLoop]: Abstraction has 42 states and 43 transitions. [2022-07-23 16:03:04,410 INFO L287 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2022-07-23 16:03:04,410 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 42 states and 43 transitions. [2022-07-23 16:03:04,410 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-07-23 16:03:04,411 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-23 16:03:04,430 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-23 16:03:04,431 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 16:03:04,431 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-23 16:03:04,431 INFO L752 eck$LassoCheckResult]: Stem: 1441#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); 1442#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post3#1, main_~i~1#1, main_#t~ret5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~ret8#1, main_#t~mem9#1, main_#t~mem11#1, main_#t~post10#1, main_~i~2#1, main_#t~ret12#1, main_~#x~0#1.base, main_~#x~0#1.offset, main_~temp~0#1, main_~ret~1#1, main_~ret2~0#1, main_~ret5~0#1;call main_~#x~0#1.base, main_~#x~0#1.offset := #Ultimate.allocOnStack(20);havoc main_~temp~0#1;havoc main_~ret~1#1;havoc main_~ret2~0#1;havoc main_~ret5~0#1;main_~i~1#1 := 0; 1449#L34-3 assume !!(main_~i~1#1 < 5);call write~int(main_#t~nondet4#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet4#1; 1457#L34-2 main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1458#L34-3 assume !!(main_~i~1#1 < 5);call write~int(main_#t~nondet4#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet4#1; 1452#L34-2 main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1453#L34-3 assume !!(main_~i~1#1 < 5);call write~int(main_#t~nondet4#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet4#1; 1480#L34-2 main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1479#L34-3 assume !!(main_~i~1#1 < 5);call write~int(main_#t~nondet4#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet4#1; 1478#L34-2 main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1477#L34-3 assume !!(main_~i~1#1 < 5);call write~int(main_#t~nondet4#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet4#1; 1476#L34-2 main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1475#L34-3 assume !(main_~i~1#1 < 5); 1443#L34-4 assume { :begin_inline_sum } true;sum_#in~x#1.base, sum_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc sum_#res#1;havoc sum_#t~mem2#1, sum_#t~post1#1, sum_~x#1.base, sum_~x#1.offset, sum_~i~0#1, sum_~ret~0#1;sum_~x#1.base, sum_~x#1.offset := sum_#in~x#1.base, sum_#in~x#1.offset;havoc sum_~i~0#1;havoc sum_~ret~0#1;sum_~ret~0#1 := 0;sum_~i~0#1 := 0; 1444#L20-3 assume !!(sum_~i~0#1 < 5);call sum_#t~mem2#1 := read~int(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem2#1;havoc sum_#t~mem2#1; 1454#L20-2 sum_#t~post1#1 := sum_~i~0#1;sum_~i~0#1 := 1 + sum_#t~post1#1;havoc sum_#t~post1#1; 1455#L20-3 assume !!(sum_~i~0#1 < 5);call sum_#t~mem2#1 := read~int(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem2#1;havoc sum_#t~mem2#1; 1473#L20-2 sum_#t~post1#1 := sum_~i~0#1;sum_~i~0#1 := 1 + sum_#t~post1#1;havoc sum_#t~post1#1; 1471#L20-3 assume !!(sum_~i~0#1 < 5);call sum_#t~mem2#1 := read~int(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem2#1;havoc sum_#t~mem2#1; 1469#L20-2 sum_#t~post1#1 := sum_~i~0#1;sum_~i~0#1 := 1 + sum_#t~post1#1;havoc sum_#t~post1#1; 1467#L20-3 assume !!(sum_~i~0#1 < 5);call sum_#t~mem2#1 := read~int(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem2#1;havoc sum_#t~mem2#1; 1465#L20-2 sum_#t~post1#1 := sum_~i~0#1;sum_~i~0#1 := 1 + sum_#t~post1#1;havoc sum_#t~post1#1; 1463#L20-3 assume !!(sum_~i~0#1 < 5);call sum_#t~mem2#1 := read~int(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem2#1;havoc sum_#t~mem2#1; 1461#L20-2 sum_#t~post1#1 := sum_~i~0#1;sum_~i~0#1 := 1 + sum_#t~post1#1;havoc sum_#t~post1#1; 1460#L20-3 assume !(sum_~i~0#1 < 5); 1450#L20-4 sum_#res#1 := (if sum_~ret~0#1 % 4294967296 <= 2147483647 then sum_~ret~0#1 % 4294967296 else sum_~ret~0#1 % 4294967296 - 4294967296); 1451#L23 main_#t~ret5#1 := sum_#res#1;assume { :end_inline_sum } true;main_~ret~1#1 := main_#t~ret5#1;havoc main_#t~ret5#1;call main_#t~mem6#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset, 4);main_~temp~0#1 := main_#t~mem6#1;havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int(main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4);call write~int(main_#t~mem7#1, main_~#x~0#1.base, main_~#x~0#1.offset, 4);havoc main_#t~mem7#1;call write~int(main_~temp~0#1, main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4);assume { :begin_inline_sum } true;sum_#in~x#1.base, sum_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc sum_#res#1;havoc sum_#t~mem2#1, sum_#t~post1#1, sum_~x#1.base, sum_~x#1.offset, sum_~i~0#1, sum_~ret~0#1;sum_~x#1.base, sum_~x#1.offset := sum_#in~x#1.base, sum_#in~x#1.offset;havoc sum_~i~0#1;havoc sum_~ret~0#1;sum_~ret~0#1 := 0;sum_~i~0#1 := 0; 1447#L20-8 assume !!(sum_~i~0#1 < 5);call sum_#t~mem2#1 := read~int(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem2#1;havoc sum_#t~mem2#1; 1448#L20-7 sum_#t~post1#1 := sum_~i~0#1;sum_~i~0#1 := 1 + sum_#t~post1#1;havoc sum_#t~post1#1; 1456#L20-8 assume !!(sum_~i~0#1 < 5);call sum_#t~mem2#1 := read~int(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem2#1;havoc sum_#t~mem2#1; 1474#L20-7 sum_#t~post1#1 := sum_~i~0#1;sum_~i~0#1 := 1 + sum_#t~post1#1;havoc sum_#t~post1#1; 1472#L20-8 assume !!(sum_~i~0#1 < 5);call sum_#t~mem2#1 := read~int(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem2#1;havoc sum_#t~mem2#1; 1470#L20-7 sum_#t~post1#1 := sum_~i~0#1;sum_~i~0#1 := 1 + sum_#t~post1#1;havoc sum_#t~post1#1; 1468#L20-8 assume !!(sum_~i~0#1 < 5);call sum_#t~mem2#1 := read~int(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem2#1;havoc sum_#t~mem2#1; 1466#L20-7 sum_#t~post1#1 := sum_~i~0#1;sum_~i~0#1 := 1 + sum_#t~post1#1;havoc sum_#t~post1#1; 1464#L20-8 assume !!(sum_~i~0#1 < 5);call sum_#t~mem2#1 := read~int(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem2#1;havoc sum_#t~mem2#1; 1462#L20-7 sum_#t~post1#1 := sum_~i~0#1;sum_~i~0#1 := 1 + sum_#t~post1#1;havoc sum_#t~post1#1; 1459#L20-8 assume !(sum_~i~0#1 < 5); 1439#L20-9 sum_#res#1 := (if sum_~ret~0#1 % 4294967296 <= 2147483647 then sum_~ret~0#1 % 4294967296 else sum_~ret~0#1 % 4294967296 - 4294967296); 1440#L23-1 main_#t~ret8#1 := sum_#res#1;assume { :end_inline_sum } true;main_~ret2~0#1 := main_#t~ret8#1;havoc main_#t~ret8#1;call main_#t~mem9#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset, 4);main_~temp~0#1 := main_#t~mem9#1;havoc main_#t~mem9#1;main_~i~2#1 := 0; 1446#L43-3 [2022-07-23 16:03:04,432 INFO L754 eck$LassoCheckResult]: Loop: 1446#L43-3 assume !!(main_~i~2#1 < 4);call main_#t~mem11#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset + 4 * (1 + main_~i~2#1), 4);call write~int(main_#t~mem11#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~2#1, 4);havoc main_#t~mem11#1; 1445#L43-2 main_#t~post10#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 1446#L43-3 [2022-07-23 16:03:04,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 16:03:04,432 INFO L85 PathProgramCache]: Analyzing trace with hash -2055775835, now seen corresponding path program 1 times [2022-07-23 16:03:04,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 16:03:04,432 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700406436] [2022-07-23 16:03:04,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 16:03:04,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 16:03:04,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 16:03:04,450 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 16:03:04,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 16:03:04,472 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 16:03:04,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 16:03:04,473 INFO L85 PathProgramCache]: Analyzing trace with hash 2755, now seen corresponding path program 1 times [2022-07-23 16:03:04,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 16:03:04,473 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455772398] [2022-07-23 16:03:04,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 16:03:04,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 16:03:04,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 16:03:04,475 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 16:03:04,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 16:03:04,477 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 16:03:04,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 16:03:04,477 INFO L85 PathProgramCache]: Analyzing trace with hash 84380519, now seen corresponding path program 1 times [2022-07-23 16:03:04,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 16:03:04,477 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676807952] [2022-07-23 16:03:04,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 16:03:04,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 16:03:04,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 16:03:04,513 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 16:03:04,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 16:03:04,555 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 16:03:09,386 INFO L210 LassoAnalysis]: Preferences: [2022-07-23 16:03:09,387 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-23 16:03:09,387 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-23 16:03:09,387 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-23 16:03:09,387 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-23 16:03:09,396 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 16:03:09,396 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-23 16:03:09,396 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-23 16:03:09,396 INFO L133 ssoRankerPreferences]: Filename of dumped script: sum05-2.i_Iteration10_Lasso [2022-07-23 16:03:09,396 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-23 16:03:09,396 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-23 16:03:09,404 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 16:03:09,407 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 16:03:09,409 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 16:03:09,410 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 16:03:09,411 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 16:03:09,413 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 16:03:09,414 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 16:03:09,415 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 16:03:09,416 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 16:03:09,417 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 16:03:09,418 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 16:03:09,420 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 16:03:12,879 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.IllegalArgumentException at de.uni_freiburg.informatik.ultimate.util.datastructures.ScopedHashMap.put(ScopedHashMap.java:331) at java.base/java.util.AbstractMap.putAll(AbstractMap.java:281) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.PureSubstitution.(PureSubstitution.java:81) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.Substitution.(Substitution.java:48) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.Substitution.apply(Substitution.java:59) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.replaceMapReads(MapEliminator.java:518) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.getRewrittenTransFormula(MapEliminator.java:342) at de.uni_freiburg.informatik.ultimate.lassoranker.preprocessors.MapEliminationLassoPreprocessor.process(MapEliminationLassoPreprocessor.java:109) at de.uni_freiburg.informatik.ultimate.lassoranker.variables.LassoBuilder.applyPreprocessor(LassoBuilder.java:154) at de.uni_freiburg.informatik.ultimate.lassoranker.variables.LassoBuilder.preprocess(LassoBuilder.java:262) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.preprocess(LassoAnalysis.java:280) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.(LassoAnalysis.java:229) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.synthesize(LassoCheck.java:601) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.checkLassoTermination(LassoCheck.java:914) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.(LassoCheck.java:823) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.(LassoCheck.java:247) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.cegar.AbstractBuchiCegarLoop.runCegarLoop(AbstractBuchiCegarLoop.java:310) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:146) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:363) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-07-23 16:03:12,883 INFO L158 Benchmark]: Toolchain (without parser) took 14061.39ms. Allocated memory was 83.9MB in the beginning and 180.4MB in the end (delta: 96.5MB). Free memory was 45.3MB in the beginning and 141.0MB in the end (delta: -95.6MB). Peak memory consumption was 91.7MB. Max. memory is 16.1GB. [2022-07-23 16:03:12,884 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 83.9MB. Free memory was 61.9MB in the beginning and 61.8MB in the end (delta: 76.9kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-23 16:03:12,884 INFO L158 Benchmark]: CACSL2BoogieTranslator took 168.87ms. Allocated memory was 83.9MB in the beginning and 123.7MB in the end (delta: 39.8MB). Free memory was 45.2MB in the beginning and 96.9MB in the end (delta: -51.8MB). Peak memory consumption was 8.3MB. Max. memory is 16.1GB. [2022-07-23 16:03:12,884 INFO L158 Benchmark]: Boogie Procedure Inliner took 22.76ms. Allocated memory is still 123.7MB. Free memory was 96.9MB in the beginning and 95.1MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-23 16:03:12,885 INFO L158 Benchmark]: Boogie Preprocessor took 17.25ms. Allocated memory is still 123.7MB. Free memory was 95.1MB in the beginning and 93.7MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-23 16:03:12,885 INFO L158 Benchmark]: RCFGBuilder took 211.22ms. Allocated memory is still 123.7MB. Free memory was 93.7MB in the beginning and 81.8MB in the end (delta: 11.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-07-23 16:03:12,885 INFO L158 Benchmark]: BuchiAutomizer took 13637.97ms. Allocated memory was 123.7MB in the beginning and 180.4MB in the end (delta: 56.6MB). Free memory was 81.8MB in the beginning and 141.0MB in the end (delta: -59.1MB). Peak memory consumption was 87.6MB. Max. memory is 16.1GB. [2022-07-23 16:03:12,886 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.14ms. Allocated memory is still 83.9MB. Free memory was 61.9MB in the beginning and 61.8MB in the end (delta: 76.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 168.87ms. Allocated memory was 83.9MB in the beginning and 123.7MB in the end (delta: 39.8MB). Free memory was 45.2MB in the beginning and 96.9MB in the end (delta: -51.8MB). Peak memory consumption was 8.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 22.76ms. Allocated memory is still 123.7MB. Free memory was 96.9MB in the beginning and 95.1MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 17.25ms. Allocated memory is still 123.7MB. Free memory was 95.1MB in the beginning and 93.7MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 211.22ms. Allocated memory is still 123.7MB. Free memory was 93.7MB in the beginning and 81.8MB in the end (delta: 11.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * BuchiAutomizer took 13637.97ms. Allocated memory was 123.7MB in the beginning and 180.4MB in the end (delta: 56.6MB). Free memory was 81.8MB in the beginning and 141.0MB in the end (delta: -59.1MB). Peak memory consumption was 87.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: IllegalArgumentException: null de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: IllegalArgumentException: null: de.uni_freiburg.informatik.ultimate.util.datastructures.ScopedHashMap.put(ScopedHashMap.java:331) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-07-23 16:03:12,909 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Forceful destruction successful, exit code 0 [2022-07-23 16:03:13,123 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Forceful destruction successful, exit code 0 [2022-07-23 16:03:13,339 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Forceful destruction successful, exit code 0 [2022-07-23 16:03:13,537 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-07-23 16:03:13,740 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-07-23 16:03:13,929 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis No suitable file found in config dir /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config using search string *Termination*32bit*_Bitvector*.epf No suitable settings file found using Termination*32bit*_Bitvector ERROR: UNSUPPORTED PROPERTY Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: IllegalArgumentException: null