./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/reducercommutativity/avg10-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version f4b24e32 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/avg10-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 431bc26901e3cf271c74e4f10a5bc241d4509dbbafd99aaf0126c46ffc8b7c33 --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-14 16:30:46,903 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-14 16:30:46,905 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-14 16:30:46,940 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-14 16:30:46,941 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-14 16:30:46,942 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-14 16:30:46,944 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-14 16:30:46,946 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-14 16:30:46,947 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-14 16:30:46,950 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-14 16:30:46,951 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-14 16:30:46,953 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-14 16:30:46,953 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-14 16:30:46,954 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-14 16:30:46,955 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-14 16:30:46,957 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-14 16:30:46,958 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-14 16:30:46,959 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-14 16:30:46,960 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-14 16:30:46,964 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-14 16:30:46,965 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-14 16:30:46,965 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-14 16:30:46,966 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-14 16:30:46,966 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-14 16:30:46,968 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-14 16:30:46,970 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-14 16:30:46,970 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-14 16:30:46,970 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-14 16:30:46,971 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-14 16:30:46,971 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-14 16:30:46,972 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-14 16:30:46,972 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-14 16:30:46,974 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-14 16:30:46,975 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-14 16:30:46,975 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-14 16:30:46,976 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-14 16:30:46,976 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-14 16:30:46,977 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-14 16:30:46,977 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-14 16:30:46,977 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-14 16:30:46,977 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-14 16:30:46,979 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-14 16:30:46,980 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2022-07-14 16:30:47,001 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-14 16:30:47,002 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-14 16:30:47,003 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-14 16:30:47,003 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-14 16:30:47,004 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-14 16:30:47,004 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-14 16:30:47,004 INFO L138 SettingsManager]: * Use SBE=true [2022-07-14 16:30:47,004 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-07-14 16:30:47,005 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-07-14 16:30:47,005 INFO L138 SettingsManager]: * Use old map elimination=false [2022-07-14 16:30:47,005 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-07-14 16:30:47,005 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-07-14 16:30:47,006 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-07-14 16:30:47,006 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-14 16:30:47,006 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-14 16:30:47,006 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-14 16:30:47,006 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-14 16:30:47,006 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-14 16:30:47,006 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-14 16:30:47,007 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-07-14 16:30:47,007 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-07-14 16:30:47,007 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-07-14 16:30:47,007 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-14 16:30:47,007 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-14 16:30:47,007 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-07-14 16:30:47,008 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-14 16:30:47,008 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-07-14 16:30:47,008 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-14 16:30:47,008 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-14 16:30:47,008 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-14 16:30:47,008 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-14 16:30:47,009 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-07-14 16:30:47,009 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 -> 431bc26901e3cf271c74e4f10a5bc241d4509dbbafd99aaf0126c46ffc8b7c33 [2022-07-14 16:30:47,181 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-14 16:30:47,206 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-14 16:30:47,208 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-14 16:30:47,209 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-14 16:30:47,209 INFO L275 PluginConnector]: CDTParser initialized [2022-07-14 16:30:47,211 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/reducercommutativity/avg10-2.i [2022-07-14 16:30:47,260 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1bdec8f56/4144d06150454180a214dbe56fff5565/FLAG90c038f07 [2022-07-14 16:30:47,625 INFO L306 CDTParser]: Found 1 translation units. [2022-07-14 16:30:47,626 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/reducercommutativity/avg10-2.i [2022-07-14 16:30:47,632 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1bdec8f56/4144d06150454180a214dbe56fff5565/FLAG90c038f07 [2022-07-14 16:30:48,048 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1bdec8f56/4144d06150454180a214dbe56fff5565 [2022-07-14 16:30:48,050 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-14 16:30:48,051 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-14 16:30:48,067 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-14 16:30:48,067 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-14 16:30:48,070 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-14 16:30:48,070 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 04:30:48" (1/1) ... [2022-07-14 16:30:48,071 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ae1c00c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:30:48, skipping insertion in model container [2022-07-14 16:30:48,071 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 04:30:48" (1/1) ... [2022-07-14 16:30:48,075 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-14 16:30:48,086 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-14 16:30:48,219 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/avg10-2.i[1282,1295] [2022-07-14 16:30:48,220 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 16:30:48,226 INFO L203 MainTranslator]: Completed pre-run [2022-07-14 16:30:48,245 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/avg10-2.i[1282,1295] [2022-07-14 16:30:48,246 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 16:30:48,253 INFO L208 MainTranslator]: Completed translation [2022-07-14 16:30:48,254 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:30:48 WrapperNode [2022-07-14 16:30:48,254 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-14 16:30:48,254 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-14 16:30:48,254 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-14 16:30:48,254 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-14 16:30:48,259 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:30:48" (1/1) ... [2022-07-14 16:30:48,263 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:30:48" (1/1) ... [2022-07-14 16:30:48,280 INFO L137 Inliner]: procedures = 16, calls = 22, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 114 [2022-07-14 16:30:48,280 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-14 16:30:48,281 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-14 16:30:48,281 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-14 16:30:48,281 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-14 16:30:48,286 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:30:48" (1/1) ... [2022-07-14 16:30:48,287 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:30:48" (1/1) ... [2022-07-14 16:30:48,288 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:30:48" (1/1) ... [2022-07-14 16:30:48,289 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:30:48" (1/1) ... [2022-07-14 16:30:48,293 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:30:48" (1/1) ... [2022-07-14 16:30:48,298 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:30:48" (1/1) ... [2022-07-14 16:30:48,299 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:30:48" (1/1) ... [2022-07-14 16:30:48,300 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-14 16:30:48,301 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-14 16:30:48,301 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-14 16:30:48,301 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-14 16:30:48,302 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:30:48" (1/1) ... [2022-07-14 16:30:48,307 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 16:30:48,315 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 16:30:48,323 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-14 16:30:48,325 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-14 16:30:48,361 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-14 16:30:48,362 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-14 16:30:48,362 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-14 16:30:48,362 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-14 16:30:48,362 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-14 16:30:48,362 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-14 16:30:48,362 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-14 16:30:48,362 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-14 16:30:48,404 INFO L234 CfgBuilder]: Building ICFG [2022-07-14 16:30:48,405 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-14 16:30:48,562 INFO L275 CfgBuilder]: Performing block encoding [2022-07-14 16:30:48,566 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-14 16:30:48,566 INFO L299 CfgBuilder]: Removed 5 assume(true) statements. [2022-07-14 16:30:48,568 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 04:30:48 BoogieIcfgContainer [2022-07-14 16:30:48,568 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-14 16:30:48,568 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-07-14 16:30:48,569 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-07-14 16:30:48,571 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-07-14 16:30:48,571 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-14 16:30:48,571 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 14.07 04:30:48" (1/3) ... [2022-07-14 16:30:48,572 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2f042cfb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.07 04:30:48, skipping insertion in model container [2022-07-14 16:30:48,572 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-14 16:30:48,572 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:30:48" (2/3) ... [2022-07-14 16:30:48,573 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2f042cfb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.07 04:30:48, skipping insertion in model container [2022-07-14 16:30:48,573 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-14 16:30:48,573 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 04:30:48" (3/3) ... [2022-07-14 16:30:48,574 INFO L354 chiAutomizerObserver]: Analyzing ICFG avg10-2.i [2022-07-14 16:30:48,646 INFO L255 stractBuchiCegarLoop]: Interprodecural is true [2022-07-14 16:30:48,646 INFO L256 stractBuchiCegarLoop]: Hoare is false [2022-07-14 16:30:48,646 INFO L257 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-07-14 16:30:48,646 INFO L258 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-07-14 16:30:48,646 INFO L259 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-07-14 16:30:48,646 INFO L260 stractBuchiCegarLoop]: Difference is false [2022-07-14 16:30:48,646 INFO L261 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-07-14 16:30:48,646 INFO L265 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-07-14 16:30:48,660 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-14 16:30:48,678 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 10 [2022-07-14 16:30:48,678 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 16:30:48,678 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 16:30:48,682 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-14 16:30:48,683 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-14 16:30:48,683 INFO L287 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-07-14 16:30:48,684 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-14 16:30:48,686 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 10 [2022-07-14 16:30:48,687 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 16:30:48,687 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 16:30:48,687 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-14 16:30:48,687 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-14 16:30:48,692 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(40);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-14 16:30:48,692 INFO L754 eck$LassoCheckResult]: Loop: 14#L34-3true assume !!(main_~i~1#1 < 10);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-14 16:30:48,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 16:30:48,700 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2022-07-14 16:30:48,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 16:30:48,709 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306419580] [2022-07-14 16:30:48,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 16:30:48,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 16:30:48,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 16:30:48,790 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 16:30:48,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 16:30:48,835 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 16:30:48,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 16:30:48,837 INFO L85 PathProgramCache]: Analyzing trace with hash 1283, now seen corresponding path program 1 times [2022-07-14 16:30:48,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 16:30:48,839 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542912752] [2022-07-14 16:30:48,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 16:30:48,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 16:30:48,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 16:30:48,859 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 16:30:48,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 16:30:48,867 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 16:30:48,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 16:30:48,868 INFO L85 PathProgramCache]: Analyzing trace with hash 925765, now seen corresponding path program 1 times [2022-07-14 16:30:48,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 16:30:48,868 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846034040] [2022-07-14 16:30:48,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 16:30:48,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 16:30:48,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 16:30:48,895 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 16:30:48,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 16:30:48,922 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 16:30:49,174 INFO L210 LassoAnalysis]: Preferences: [2022-07-14 16:30:49,175 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-14 16:30:49,175 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-14 16:30:49,175 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-14 16:30:49,176 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-14 16:30:49,176 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 16:30:49,176 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-14 16:30:49,176 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-14 16:30:49,176 INFO L133 ssoRankerPreferences]: Filename of dumped script: avg10-2.i_Iteration1_Lasso [2022-07-14 16:30:49,176 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-14 16:30:49,176 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-14 16:30:49,191 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-14 16:30:49,195 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-14 16:30:49,196 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-14 16:30:49,199 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-14 16:30:49,201 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-14 16:30:49,204 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-14 16:30:49,206 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-14 16:30:49,208 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-14 16:30:49,210 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-14 16:30:49,213 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-14 16:30:49,346 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-14 16:30:49,349 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-14 16:30:49,350 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-14 16:30:49,352 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-14 16:30:49,355 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-14 16:30:49,357 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-14 16:30:49,359 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-14 16:30:49,361 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-14 16:30:49,571 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-14 16:30:49,573 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-14 16:30:49,575 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 16:30:49,575 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 16:30:49,582 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-14 16:30:49,584 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-14 16:30:49,585 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-14 16:30:49,590 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 16:30:49,591 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 16:30:49,591 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 16:30:49,591 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 16:30:49,591 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 16:30:49,593 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 16:30:49,593 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 16:30:49,609 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 16:30:49,624 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-14 16:30:49,625 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 16:30:49,625 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 16:30:49,626 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-14 16:30:49,627 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-14 16:30:49,628 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-14 16:30:49,633 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 16:30:49,633 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 16:30:49,634 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 16:30:49,634 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 16:30:49,634 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 16:30:49,634 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 16:30:49,634 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 16:30:49,638 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 16:30:49,652 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2022-07-14 16:30:49,653 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 16:30:49,653 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 16:30:49,655 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-14 16:30:49,656 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-14 16:30:49,661 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-14 16:30:49,667 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 16:30:49,667 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 16:30:49,667 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 16:30:49,667 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 16:30:49,669 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 16:30:49,669 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 16:30:49,679 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 16:30:49,696 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-14 16:30:49,697 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 16:30:49,697 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 16:30:49,698 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-14 16:30:49,709 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-14 16:30:49,715 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 16:30:49,715 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 16:30:49,715 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 16:30:49,715 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 16:30:49,715 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 16:30:49,716 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 16:30:49,716 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 16:30:49,720 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-14 16:30:49,728 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 16:30:49,743 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-14 16:30:49,743 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 16:30:49,743 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 16:30:49,744 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-14 16:30:49,745 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-14 16:30:49,746 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-14 16:30:49,751 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 16:30:49,752 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 16:30:49,752 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 16:30:49,752 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 16:30:49,752 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 16:30:49,752 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 16:30:49,752 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 16:30:49,761 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 16:30:49,778 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-14 16:30:49,778 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 16:30:49,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 16:30:49,780 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-14 16:30:49,781 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-14 16:30:49,782 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-14 16:30:49,787 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 16:30:49,787 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 16:30:49,787 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 16:30:49,787 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 16:30:49,787 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 16:30:49,788 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 16:30:49,788 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 16:30:49,803 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 16:30:49,819 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-14 16:30:49,820 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 16:30:49,820 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 16:30:49,821 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-14 16:30:49,822 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-14 16:30:49,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-14 16:30:49,828 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 16:30:49,828 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 16:30:49,828 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 16:30:49,828 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 16:30:49,828 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 16:30:49,829 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 16:30:49,829 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 16:30:49,835 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 16:30:49,850 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-14 16:30:49,850 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 16:30:49,850 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 16:30:49,854 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-14 16:30:49,855 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-14 16:30:49,856 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-14 16:30:49,861 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 16:30:49,861 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 16:30:49,861 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 16:30:49,861 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 16:30:49,861 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 16:30:49,861 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 16:30:49,861 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 16:30:49,870 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 16:30:49,887 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-14 16:30:49,887 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 16:30:49,887 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 16:30:49,892 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-14 16:30:49,893 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-14 16:30:49,894 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-14 16:30:49,899 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 16:30:49,899 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 16:30:49,899 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 16:30:49,899 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 16:30:49,901 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 16:30:49,901 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 16:30:49,917 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 16:30:49,934 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-14 16:30:49,935 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 16:30:49,935 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 16:30:49,940 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-14 16:30:49,948 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-14 16:30:49,948 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-14 16:30:49,953 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 16:30:49,953 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 16:30:49,953 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 16:30:49,953 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 16:30:49,980 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 16:30:49,980 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 16:30:49,999 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 16:30:50,014 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-14 16:30:50,015 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 16:30:50,015 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 16:30:50,016 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-14 16:30:50,017 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-14 16:30:50,019 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-14 16:30:50,023 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 16:30:50,024 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 16:30:50,024 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 16:30:50,024 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 16:30:50,028 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 16:30:50,028 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 16:30:50,047 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 16:30:50,063 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-14 16:30:50,063 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 16:30:50,063 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 16:30:50,064 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-14 16:30:50,065 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-14 16:30:50,066 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-14 16:30:50,071 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 16:30:50,071 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 16:30:50,071 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 16:30:50,072 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 16:30:50,075 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 16:30:50,075 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 16:30:50,092 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-14 16:30:50,107 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2022-07-14 16:30:50,107 INFO L444 ModelExtractionUtils]: 0 out of 13 variables were initially zero. Simplification set additionally 10 variables to zero. [2022-07-14 16:30:50,109 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 16:30:50,109 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 16:30:50,110 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-14 16:30:50,111 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-14 16:30:50,112 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-14 16:30:50,148 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-07-14 16:30:50,148 INFO L513 LassoAnalysis]: Proved termination. [2022-07-14 16:30:50,148 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) = 19*v_rep(select #length ULTIMATE.start_main_~#x~0#1.base)_1 - 8*ULTIMATE.start_main_~i~1#1 Supporting invariants [] [2022-07-14 16:30:50,185 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-14 16:30:50,194 INFO L293 tatePredicateManager]: 5 out of 5 supporting invariants were superfluous and have been removed [2022-07-14 16:30:50,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 16:30:50,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 16:30:50,228 INFO L263 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-14 16:30:50,228 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 16:30:50,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 16:30:50,246 INFO L263 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-14 16:30:50,246 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 16:30:50,266 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-14 16:30:50,285 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-14 16:30:50,286 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-14 16:30:50,343 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-14 16:30:50,344 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-14 16:30:50,348 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-14 16:30:50,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 61 transitions. [2022-07-14 16:30:50,349 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 61 transitions. Stem has 2 letters. Loop has 2 letters. [2022-07-14 16:30:50,349 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-14 16:30:50,349 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 61 transitions. Stem has 4 letters. Loop has 2 letters. [2022-07-14 16:30:50,349 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-14 16:30:50,349 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 61 transitions. Stem has 2 letters. Loop has 4 letters. [2022-07-14 16:30:50,349 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-14 16:30:50,350 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 66 states and 92 transitions. [2022-07-14 16:30:50,356 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2022-07-14 16:30:50,359 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 66 states to 19 states and 24 transitions. [2022-07-14 16:30:50,359 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2022-07-14 16:30:50,360 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2022-07-14 16:30:50,360 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 24 transitions. [2022-07-14 16:30:50,360 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-14 16:30:50,360 INFO L369 hiAutomatonCegarLoop]: Abstraction has 19 states and 24 transitions. [2022-07-14 16:30:50,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 24 transitions. [2022-07-14 16:30:50,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2022-07-14 16:30:50,374 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-14 16:30:50,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 24 transitions. [2022-07-14 16:30:50,375 INFO L392 hiAutomatonCegarLoop]: Abstraction has 19 states and 24 transitions. [2022-07-14 16:30:50,375 INFO L374 stractBuchiCegarLoop]: Abstraction has 19 states and 24 transitions. [2022-07-14 16:30:50,376 INFO L287 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-07-14 16:30:50,376 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 24 transitions. [2022-07-14 16:30:50,376 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2022-07-14 16:30:50,376 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 16:30:50,376 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 16:30:50,376 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2022-07-14 16:30:50,376 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-14 16:30:50,377 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(40);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 < 10); 155#L34-4 assume { :begin_inline_avg } true;avg_#in~x#1.base, avg_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc avg_#res#1;havoc avg_#t~mem2#1, avg_#t~post1#1, avg_~x#1.base, avg_~x#1.offset, avg_~i~0#1, avg_~ret~0#1;avg_~x#1.base, avg_~x#1.offset := avg_#in~x#1.base, avg_#in~x#1.offset;havoc avg_~i~0#1;havoc avg_~ret~0#1;avg_~ret~0#1 := 0;avg_~i~0#1 := 0; 156#L20-3 [2022-07-14 16:30:50,377 INFO L754 eck$LassoCheckResult]: Loop: 156#L20-3 assume !!(avg_~i~0#1 < 10);call avg_#t~mem2#1 := read~int(avg_~x#1.base, avg_~x#1.offset + 4 * avg_~i~0#1, 4);avg_~ret~0#1 := avg_~ret~0#1 + avg_#t~mem2#1;havoc avg_#t~mem2#1; 169#L20-2 avg_#t~post1#1 := avg_~i~0#1;avg_~i~0#1 := 1 + avg_#t~post1#1;havoc avg_#t~post1#1; 156#L20-3 [2022-07-14 16:30:50,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 16:30:50,377 INFO L85 PathProgramCache]: Analyzing trace with hash 925707, now seen corresponding path program 1 times [2022-07-14 16:30:50,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 16:30:50,377 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213303308] [2022-07-14 16:30:50,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 16:30:50,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 16:30:50,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 16:30:50,400 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-14 16:30:50,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 16:30:50,401 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213303308] [2022-07-14 16:30:50,401 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [213303308] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 16:30:50,401 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 16:30:50,401 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 16:30:50,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273510474] [2022-07-14 16:30:50,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 16:30:50,403 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-14 16:30:50,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 16:30:50,403 INFO L85 PathProgramCache]: Analyzing trace with hash 1731, now seen corresponding path program 1 times [2022-07-14 16:30:50,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 16:30:50,404 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15872562] [2022-07-14 16:30:50,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 16:30:50,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 16:30:50,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 16:30:50,407 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 16:30:50,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 16:30:50,411 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 16:30:50,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 16:30:50,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 16:30:50,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 16:30:50,440 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-14 16:30:50,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 16:30:50,450 INFO L93 Difference]: Finished difference Result 20 states and 24 transitions. [2022-07-14 16:30:50,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 16:30:50,452 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 24 transitions. [2022-07-14 16:30:50,457 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2022-07-14 16:30:50,457 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 20 states and 24 transitions. [2022-07-14 16:30:50,457 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2022-07-14 16:30:50,457 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2022-07-14 16:30:50,457 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 24 transitions. [2022-07-14 16:30:50,457 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-14 16:30:50,457 INFO L369 hiAutomatonCegarLoop]: Abstraction has 20 states and 24 transitions. [2022-07-14 16:30:50,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 24 transitions. [2022-07-14 16:30:50,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2022-07-14 16:30:50,459 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-14 16:30:50,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions. [2022-07-14 16:30:50,462 INFO L392 hiAutomatonCegarLoop]: Abstraction has 19 states and 23 transitions. [2022-07-14 16:30:50,462 INFO L374 stractBuchiCegarLoop]: Abstraction has 19 states and 23 transitions. [2022-07-14 16:30:50,462 INFO L287 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-07-14 16:30:50,462 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 23 transitions. [2022-07-14 16:30:50,462 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2022-07-14 16:30:50,463 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 16:30:50,463 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 16:30:50,463 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2022-07-14 16:30:50,463 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-14 16:30:50,464 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(40);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 < 10);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 < 10); 200#L34-4 assume { :begin_inline_avg } true;avg_#in~x#1.base, avg_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc avg_#res#1;havoc avg_#t~mem2#1, avg_#t~post1#1, avg_~x#1.base, avg_~x#1.offset, avg_~i~0#1, avg_~ret~0#1;avg_~x#1.base, avg_~x#1.offset := avg_#in~x#1.base, avg_#in~x#1.offset;havoc avg_~i~0#1;havoc avg_~ret~0#1;avg_~ret~0#1 := 0;avg_~i~0#1 := 0; 201#L20-3 [2022-07-14 16:30:50,464 INFO L754 eck$LassoCheckResult]: Loop: 201#L20-3 assume !!(avg_~i~0#1 < 10);call avg_#t~mem2#1 := read~int(avg_~x#1.base, avg_~x#1.offset + 4 * avg_~i~0#1, 4);avg_~ret~0#1 := avg_~ret~0#1 + avg_#t~mem2#1;havoc avg_#t~mem2#1; 214#L20-2 avg_#t~post1#1 := avg_~i~0#1;avg_~i~0#1 := 1 + avg_#t~post1#1;havoc avg_#t~post1#1; 201#L20-3 [2022-07-14 16:30:50,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 16:30:50,465 INFO L85 PathProgramCache]: Analyzing trace with hash 889660429, now seen corresponding path program 1 times [2022-07-14 16:30:50,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 16:30:50,465 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939106882] [2022-07-14 16:30:50,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 16:30:50,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 16:30:50,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 16:30:50,498 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-14 16:30:50,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 16:30:50,501 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939106882] [2022-07-14 16:30:50,501 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1939106882] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 16:30:50,501 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [282338173] [2022-07-14 16:30:50,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 16:30:50,502 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 16:30:50,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 16:30:50,503 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-14 16:30:50,504 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-14 16:30:50,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 16:30:50,553 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-14 16:30:50,553 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 16:30:50,574 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-14 16:30:50,574 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 16:30:50,585 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-14 16:30:50,593 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-14 16:30:50,593 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [282338173] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 16:30:50,593 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 16:30:50,593 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2022-07-14 16:30:50,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252430681] [2022-07-14 16:30:50,594 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 16:30:50,594 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-14 16:30:50,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 16:30:50,594 INFO L85 PathProgramCache]: Analyzing trace with hash 1731, now seen corresponding path program 2 times [2022-07-14 16:30:50,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 16:30:50,594 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435048973] [2022-07-14 16:30:50,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 16:30:50,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 16:30:50,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 16:30:50,602 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 16:30:50,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 16:30:50,611 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 16:30:50,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 16:30:50,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-14 16:30:50,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-07-14 16:30:50,638 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-14 16:30:50,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 16:30:50,661 INFO L93 Difference]: Finished difference Result 25 states and 29 transitions. [2022-07-14 16:30:50,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-14 16:30:50,662 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 29 transitions. [2022-07-14 16:30:50,664 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2022-07-14 16:30:50,665 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 25 states and 29 transitions. [2022-07-14 16:30:50,665 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2022-07-14 16:30:50,665 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2022-07-14 16:30:50,665 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 29 transitions. [2022-07-14 16:30:50,666 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-14 16:30:50,666 INFO L369 hiAutomatonCegarLoop]: Abstraction has 25 states and 29 transitions. [2022-07-14 16:30:50,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 29 transitions. [2022-07-14 16:30:50,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2022-07-14 16:30:50,668 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-14 16:30:50,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2022-07-14 16:30:50,669 INFO L392 hiAutomatonCegarLoop]: Abstraction has 25 states and 29 transitions. [2022-07-14 16:30:50,669 INFO L374 stractBuchiCegarLoop]: Abstraction has 25 states and 29 transitions. [2022-07-14 16:30:50,670 INFO L287 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2022-07-14 16:30:50,670 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 29 transitions. [2022-07-14 16:30:50,671 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2022-07-14 16:30:50,671 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 16:30:50,672 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 16:30:50,672 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 1, 1, 1, 1] [2022-07-14 16:30:50,672 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-14 16:30:50,672 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(40);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 < 10);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 < 10);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 < 10);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 < 10);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 < 10); 284#L34-4 assume { :begin_inline_avg } true;avg_#in~x#1.base, avg_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc avg_#res#1;havoc avg_#t~mem2#1, avg_#t~post1#1, avg_~x#1.base, avg_~x#1.offset, avg_~i~0#1, avg_~ret~0#1;avg_~x#1.base, avg_~x#1.offset := avg_#in~x#1.base, avg_#in~x#1.offset;havoc avg_~i~0#1;havoc avg_~ret~0#1;avg_~ret~0#1 := 0;avg_~i~0#1 := 0; 285#L20-3 [2022-07-14 16:30:50,673 INFO L754 eck$LassoCheckResult]: Loop: 285#L20-3 assume !!(avg_~i~0#1 < 10);call avg_#t~mem2#1 := read~int(avg_~x#1.base, avg_~x#1.offset + 4 * avg_~i~0#1, 4);avg_~ret~0#1 := avg_~ret~0#1 + avg_#t~mem2#1;havoc avg_#t~mem2#1; 298#L20-2 avg_#t~post1#1 := avg_~i~0#1;avg_~i~0#1 := 1 + avg_#t~post1#1;havoc avg_#t~post1#1; 285#L20-3 [2022-07-14 16:30:50,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 16:30:50,673 INFO L85 PathProgramCache]: Analyzing trace with hash 833936659, now seen corresponding path program 2 times [2022-07-14 16:30:50,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 16:30:50,674 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899820626] [2022-07-14 16:30:50,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 16:30:50,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 16:30:50,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 16:30:50,716 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-14 16:30:50,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 16:30:50,716 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899820626] [2022-07-14 16:30:50,716 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1899820626] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 16:30:50,717 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1489441001] [2022-07-14 16:30:50,717 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-14 16:30:50,717 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 16:30:50,717 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 16:30:50,718 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-14 16:30:50,722 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-14 16:30:50,754 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-14 16:30:50,755 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 16:30:50,755 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-14 16:30:50,756 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 16:30:50,777 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-14 16:30:50,777 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 16:30:50,829 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-14 16:30:50,830 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1489441001] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 16:30:50,830 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 16:30:50,830 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2022-07-14 16:30:50,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141351581] [2022-07-14 16:30:50,830 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 16:30:50,832 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-14 16:30:50,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 16:30:50,832 INFO L85 PathProgramCache]: Analyzing trace with hash 1731, now seen corresponding path program 3 times [2022-07-14 16:30:50,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 16:30:50,832 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645841958] [2022-07-14 16:30:50,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 16:30:50,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 16:30:50,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 16:30:50,841 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 16:30:50,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 16:30:50,848 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 16:30:50,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 16:30:50,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-14 16:30:50,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2022-07-14 16:30:50,874 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. cyclomatic complexity: 9 Second operand has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 13 states have internal predecessors, (25), 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-14 16:30:50,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 16:30:50,900 INFO L93 Difference]: Finished difference Result 37 states and 41 transitions. [2022-07-14 16:30:50,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-14 16:30:50,904 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 41 transitions. [2022-07-14 16:30:50,904 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2022-07-14 16:30:50,905 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 37 states and 41 transitions. [2022-07-14 16:30:50,905 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2022-07-14 16:30:50,905 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2022-07-14 16:30:50,905 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 41 transitions. [2022-07-14 16:30:50,905 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-14 16:30:50,905 INFO L369 hiAutomatonCegarLoop]: Abstraction has 37 states and 41 transitions. [2022-07-14 16:30:50,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states and 41 transitions. [2022-07-14 16:30:50,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2022-07-14 16:30:50,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 37 states have (on average 1.1081081081081081) internal successors, (41), 36 states have internal predecessors, (41), 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-14 16:30:50,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2022-07-14 16:30:50,907 INFO L392 hiAutomatonCegarLoop]: Abstraction has 37 states and 41 transitions. [2022-07-14 16:30:50,907 INFO L374 stractBuchiCegarLoop]: Abstraction has 37 states and 41 transitions. [2022-07-14 16:30:50,907 INFO L287 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2022-07-14 16:30:50,907 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 37 states and 41 transitions. [2022-07-14 16:30:50,907 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2022-07-14 16:30:50,907 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 16:30:50,908 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 16:30:50,912 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [10, 10, 1, 1, 1, 1] [2022-07-14 16:30:50,912 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-14 16:30:50,912 INFO L752 eck$LassoCheckResult]: Stem: 424#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); 425#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(40);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; 436#L34-3 assume !!(main_~i~1#1 < 10);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; 443#L34-2 main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 444#L34-3 assume !!(main_~i~1#1 < 10);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; 439#L34-2 main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 440#L34-3 assume !!(main_~i~1#1 < 10);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; 460#L34-2 main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 459#L34-3 assume !!(main_~i~1#1 < 10);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; 458#L34-2 main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 457#L34-3 assume !!(main_~i~1#1 < 10);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; 456#L34-2 main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 455#L34-3 assume !!(main_~i~1#1 < 10);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; 454#L34-2 main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 453#L34-3 assume !!(main_~i~1#1 < 10);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; 452#L34-2 main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 451#L34-3 assume !!(main_~i~1#1 < 10);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; 450#L34-2 main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 449#L34-3 assume !!(main_~i~1#1 < 10);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; 448#L34-2 main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 447#L34-3 assume !!(main_~i~1#1 < 10);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; 446#L34-2 main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 445#L34-3 assume !(main_~i~1#1 < 10); 428#L34-4 assume { :begin_inline_avg } true;avg_#in~x#1.base, avg_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc avg_#res#1;havoc avg_#t~mem2#1, avg_#t~post1#1, avg_~x#1.base, avg_~x#1.offset, avg_~i~0#1, avg_~ret~0#1;avg_~x#1.base, avg_~x#1.offset := avg_#in~x#1.base, avg_#in~x#1.offset;havoc avg_~i~0#1;havoc avg_~ret~0#1;avg_~ret~0#1 := 0;avg_~i~0#1 := 0; 429#L20-3 [2022-07-14 16:30:50,913 INFO L754 eck$LassoCheckResult]: Loop: 429#L20-3 assume !!(avg_~i~0#1 < 10);call avg_#t~mem2#1 := read~int(avg_~x#1.base, avg_~x#1.offset + 4 * avg_~i~0#1, 4);avg_~ret~0#1 := avg_~ret~0#1 + avg_#t~mem2#1;havoc avg_#t~mem2#1; 442#L20-2 avg_#t~post1#1 := avg_~i~0#1;avg_~i~0#1 := 1 + avg_#t~post1#1;havoc avg_#t~post1#1; 429#L20-3 [2022-07-14 16:30:50,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 16:30:50,914 INFO L85 PathProgramCache]: Analyzing trace with hash 2127272351, now seen corresponding path program 3 times [2022-07-14 16:30:50,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 16:30:50,916 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933598422] [2022-07-14 16:30:50,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 16:30:50,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 16:30:50,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 16:30:50,954 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 16:30:50,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 16:30:50,972 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 16:30:50,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 16:30:50,973 INFO L85 PathProgramCache]: Analyzing trace with hash 1731, now seen corresponding path program 4 times [2022-07-14 16:30:50,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 16:30:50,973 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619285041] [2022-07-14 16:30:50,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 16:30:50,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 16:30:50,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 16:30:50,976 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 16:30:50,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 16:30:50,978 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 16:30:50,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 16:30:50,979 INFO L85 PathProgramCache]: Analyzing trace with hash -95702815, now seen corresponding path program 1 times [2022-07-14 16:30:50,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 16:30:50,979 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542807031] [2022-07-14 16:30:50,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 16:30:50,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 16:30:51,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 16:30:51,005 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 16:30:51,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 16:30:51,039 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 16:30:54,326 INFO L210 LassoAnalysis]: Preferences: [2022-07-14 16:30:54,326 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-14 16:30:54,326 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-14 16:30:54,326 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-14 16:30:54,326 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-14 16:30:54,326 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 16:30:54,326 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-14 16:30:54,326 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-14 16:30:54,326 INFO L133 ssoRankerPreferences]: Filename of dumped script: avg10-2.i_Iteration5_Lasso [2022-07-14 16:30:54,326 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-14 16:30:54,326 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-14 16:30:54,349 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-14 16:30:54,351 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-14 16:30:54,352 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-14 16:30:54,353 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-14 16:30:54,354 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-14 16:30:54,356 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-14 16:30:54,357 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-14 16:30:55,022 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-14 16:30:55,024 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-14 16:30:55,025 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-14 16:30:55,026 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-14 16:30:55,027 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-14 16:30:55,028 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-14 16:30:55,030 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-14 16:30:55,031 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-14 16:30:55,032 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-14 16:30:55,033 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-14 16:30:55,035 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-14 16:30:55,036 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-14 16:30:55,037 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-14 16:30:55,038 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-14 16:30:55,039 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-14 16:30:55,312 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-14 16:30:55,312 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-14 16:30:55,312 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 16:30:55,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 16:30:55,352 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-14 16:30:55,353 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-14 16:30:55,354 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-14 16:30:55,360 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 16:30:55,360 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 16:30:55,360 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 16:30:55,360 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 16:30:55,360 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 16:30:55,361 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 16:30:55,361 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 16:30:55,376 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 16:30:55,393 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-14 16:30:55,394 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 16:30:55,394 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 16:30:55,395 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-14 16:30:55,396 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-14 16:30:55,397 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-14 16:30:55,403 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 16:30:55,403 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 16:30:55,403 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 16:30:55,403 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 16:30:55,403 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 16:30:55,404 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 16:30:55,404 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 16:30:55,419 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 16:30:55,435 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-14 16:30:55,435 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 16:30:55,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 16:30:55,436 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-14 16:30:55,437 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-14 16:30:55,438 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-14 16:30:55,444 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 16:30:55,444 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 16:30:55,444 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 16:30:55,444 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 16:30:55,444 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 16:30:55,445 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 16:30:55,445 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 16:30:55,446 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 16:30:55,461 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-14 16:30:55,461 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 16:30:55,462 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 16:30:55,462 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-14 16:30:55,466 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-14 16:30:55,466 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-14 16:30:55,472 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 16:30:55,472 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 16:30:55,473 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 16:30:55,473 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 16:30:55,473 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 16:30:55,473 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 16:30:55,473 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 16:30:55,487 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 16:30:55,503 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2022-07-14 16:30:55,503 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 16:30:55,504 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 16:30:55,505 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-14 16:30:55,516 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-14 16:30:55,518 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-14 16:30:55,523 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 16:30:55,524 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 16:30:55,524 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 16:30:55,524 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 16:30:55,525 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 16:30:55,525 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 16:30:55,537 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 16:30:55,553 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-14 16:30:55,553 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 16:30:55,553 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 16:30:55,554 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-14 16:30:55,562 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-14 16:30:55,562 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-14 16:30:55,568 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 16:30:55,568 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 16:30:55,568 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 16:30:55,568 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 16:30:55,568 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 16:30:55,568 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 16:30:55,568 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 16:30:55,577 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 16:30:55,592 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-14 16:30:55,593 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 16:30:55,593 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 16:30:55,594 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-14 16:30:55,594 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-14 16:30:55,601 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-14 16:30:55,619 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 16:30:55,619 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 16:30:55,619 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 16:30:55,619 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 16:30:55,632 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 16:30:55,632 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 16:30:55,634 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 16:30:55,652 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-14 16:30:55,652 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 16:30:55,652 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 16:30:55,653 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-14 16:30:55,654 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-14 16:30:55,657 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-14 16:30:55,662 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 16:30:55,662 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 16:30:55,662 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 16:30:55,662 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 16:30:55,664 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 16:30:55,664 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 16:30:55,666 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 16:30:55,683 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-14 16:30:55,683 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 16:30:55,684 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 16:30:55,684 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-14 16:30:55,686 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-14 16:30:55,687 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-14 16:30:55,692 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 16:30:55,693 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 16:30:55,693 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 16:30:55,693 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 16:30:55,694 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 16:30:55,694 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 16:30:55,707 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 16:30:55,723 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2022-07-14 16:30:55,724 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 16:30:55,724 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 16:30:55,725 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-14 16:30:55,725 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-14 16:30:55,727 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-14 16:30:55,732 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 16:30:55,733 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 16:30:55,733 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 16:30:55,733 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 16:30:55,734 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 16:30:55,734 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 16:30:55,745 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 16:30:55,763 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-14 16:30:55,764 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 16:30:55,764 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 16:30:55,765 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-14 16:30:55,771 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-14 16:30:55,771 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-14 16:30:55,777 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 16:30:55,777 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 16:30:55,777 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 16:30:55,777 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 16:30:55,781 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 16:30:55,781 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 16:30:55,792 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-14 16:30:55,817 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2022-07-14 16:30:55,817 INFO L444 ModelExtractionUtils]: 5 out of 19 variables were initially zero. Simplification set additionally 11 variables to zero. [2022-07-14 16:30:55,817 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 16:30:55,817 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 16:30:55,832 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-14 16:30:55,835 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-14 16:30:55,844 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-07-14 16:30:55,844 INFO L513 LassoAnalysis]: Proved termination. [2022-07-14 16:30:55,844 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_avg_~i~0#1) = -2*ULTIMATE.start_avg_~i~0#1 + 19 Supporting invariants [] [2022-07-14 16:30:55,835 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-14 16:30:55,860 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Ended with exit code 0 [2022-07-14 16:30:56,038 INFO L293 tatePredicateManager]: 74 out of 74 supporting invariants were superfluous and have been removed [2022-07-14 16:30:56,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 16:30:56,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 16:30:56,074 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-14 16:30:56,074 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 16:30:56,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 16:30:56,099 INFO L263 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-14 16:30:56,099 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 16:30:56,108 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-14 16:30:56,108 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-14 16:30:56,108 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 37 states and 41 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-14 16:30:56,119 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 37 states and 41 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 41 states and 48 transitions. Complement of second has 7 states. [2022-07-14 16:30:56,119 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-14 16:30:56,120 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-14 16:30:56,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 10 transitions. [2022-07-14 16:30:56,120 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 24 letters. Loop has 2 letters. [2022-07-14 16:30:56,121 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-14 16:30:56,121 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 26 letters. Loop has 2 letters. [2022-07-14 16:30:56,121 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-14 16:30:56,121 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 24 letters. Loop has 4 letters. [2022-07-14 16:30:56,121 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-14 16:30:56,121 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 48 transitions. [2022-07-14 16:30:56,122 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2022-07-14 16:30:56,122 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 38 states and 43 transitions. [2022-07-14 16:30:56,122 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2022-07-14 16:30:56,123 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2022-07-14 16:30:56,123 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 43 transitions. [2022-07-14 16:30:56,123 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-14 16:30:56,123 INFO L369 hiAutomatonCegarLoop]: Abstraction has 38 states and 43 transitions. [2022-07-14 16:30:56,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states and 43 transitions. [2022-07-14 16:30:56,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2022-07-14 16:30:56,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 38 states have (on average 1.131578947368421) internal successors, (43), 37 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-14 16:30:56,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 43 transitions. [2022-07-14 16:30:56,125 INFO L392 hiAutomatonCegarLoop]: Abstraction has 38 states and 43 transitions. [2022-07-14 16:30:56,125 INFO L374 stractBuchiCegarLoop]: Abstraction has 38 states and 43 transitions. [2022-07-14 16:30:56,125 INFO L287 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2022-07-14 16:30:56,125 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 38 states and 43 transitions. [2022-07-14 16:30:56,126 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2022-07-14 16:30:56,126 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 16:30:56,126 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 16:30:56,126 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [10, 10, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 16:30:56,126 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-14 16:30:56,127 INFO L752 eck$LassoCheckResult]: Stem: 900#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); 901#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(40);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; 912#L34-3 assume !!(main_~i~1#1 < 10);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; 920#L34-2 main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 921#L34-3 assume !!(main_~i~1#1 < 10);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; 915#L34-2 main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 916#L34-3 assume !!(main_~i~1#1 < 10);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; 937#L34-2 main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 936#L34-3 assume !!(main_~i~1#1 < 10);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; 935#L34-2 main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 934#L34-3 assume !!(main_~i~1#1 < 10);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; 933#L34-2 main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 932#L34-3 assume !!(main_~i~1#1 < 10);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; 931#L34-2 main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 930#L34-3 assume !!(main_~i~1#1 < 10);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; 929#L34-2 main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 928#L34-3 assume !!(main_~i~1#1 < 10);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; 927#L34-2 main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 926#L34-3 assume !!(main_~i~1#1 < 10);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; 925#L34-2 main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 924#L34-3 assume !!(main_~i~1#1 < 10);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; 923#L34-2 main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 922#L34-3 assume !(main_~i~1#1 < 10); 904#L34-4 assume { :begin_inline_avg } true;avg_#in~x#1.base, avg_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc avg_#res#1;havoc avg_#t~mem2#1, avg_#t~post1#1, avg_~x#1.base, avg_~x#1.offset, avg_~i~0#1, avg_~ret~0#1;avg_~x#1.base, avg_~x#1.offset := avg_#in~x#1.base, avg_#in~x#1.offset;havoc avg_~i~0#1;havoc avg_~ret~0#1;avg_~ret~0#1 := 0;avg_~i~0#1 := 0; 905#L20-3 assume !(avg_~i~0#1 < 10); 913#L20-4 avg_#res#1 := (if (if avg_~ret~0#1 < 0 && 0 != avg_~ret~0#1 % 10 then 1 + avg_~ret~0#1 / 10 else avg_~ret~0#1 / 10) % 4294967296 <= 2147483647 then (if avg_~ret~0#1 < 0 && 0 != avg_~ret~0#1 % 10 then 1 + avg_~ret~0#1 / 10 else avg_~ret~0#1 / 10) % 4294967296 else (if avg_~ret~0#1 < 0 && 0 != avg_~ret~0#1 % 10 then 1 + avg_~ret~0#1 / 10 else avg_~ret~0#1 / 10) % 4294967296 - 4294967296); 914#L23 main_#t~ret5#1 := avg_#res#1;assume { :end_inline_avg } 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_avg } true;avg_#in~x#1.base, avg_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc avg_#res#1;havoc avg_#t~mem2#1, avg_#t~post1#1, avg_~x#1.base, avg_~x#1.offset, avg_~i~0#1, avg_~ret~0#1;avg_~x#1.base, avg_~x#1.offset := avg_#in~x#1.base, avg_#in~x#1.offset;havoc avg_~i~0#1;havoc avg_~ret~0#1;avg_~ret~0#1 := 0;avg_~i~0#1 := 0; 910#L20-8 [2022-07-14 16:30:56,127 INFO L754 eck$LassoCheckResult]: Loop: 910#L20-8 assume !!(avg_~i~0#1 < 10);call avg_#t~mem2#1 := read~int(avg_~x#1.base, avg_~x#1.offset + 4 * avg_~i~0#1, 4);avg_~ret~0#1 := avg_~ret~0#1 + avg_#t~mem2#1;havoc avg_#t~mem2#1; 911#L20-7 avg_#t~post1#1 := avg_~i~0#1;avg_~i~0#1 := 1 + avg_#t~post1#1;havoc avg_#t~post1#1; 910#L20-8 [2022-07-14 16:30:56,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 16:30:56,127 INFO L85 PathProgramCache]: Analyzing trace with hash 1328178265, now seen corresponding path program 1 times [2022-07-14 16:30:56,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 16:30:56,127 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911491467] [2022-07-14 16:30:56,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 16:30:56,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 16:30:56,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 16:30:56,176 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2022-07-14 16:30:56,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 16:30:56,176 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911491467] [2022-07-14 16:30:56,176 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1911491467] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 16:30:56,176 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 16:30:56,176 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 16:30:56,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892037876] [2022-07-14 16:30:56,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 16:30:56,177 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-14 16:30:56,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 16:30:56,177 INFO L85 PathProgramCache]: Analyzing trace with hash 2243, now seen corresponding path program 1 times [2022-07-14 16:30:56,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 16:30:56,178 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150802028] [2022-07-14 16:30:56,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 16:30:56,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 16:30:56,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 16:30:56,181 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 16:30:56,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 16:30:56,203 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 16:30:56,231 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-14 16:30:56,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 16:30:56,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 16:30:56,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 16:30:56,238 INFO L87 Difference]: Start difference. First operand 38 states and 43 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-14 16:30:56,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 16:30:56,251 INFO L93 Difference]: Finished difference Result 43 states and 47 transitions. [2022-07-14 16:30:56,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 16:30:56,252 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 47 transitions. [2022-07-14 16:30:56,252 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2022-07-14 16:30:56,253 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 43 states and 47 transitions. [2022-07-14 16:30:56,253 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2022-07-14 16:30:56,253 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2022-07-14 16:30:56,253 INFO L73 IsDeterministic]: Start isDeterministic. Operand 43 states and 47 transitions. [2022-07-14 16:30:56,253 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-14 16:30:56,253 INFO L369 hiAutomatonCegarLoop]: Abstraction has 43 states and 47 transitions. [2022-07-14 16:30:56,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states and 47 transitions. [2022-07-14 16:30:56,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 39. [2022-07-14 16:30:56,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 39 states have (on average 1.1025641025641026) internal successors, (43), 38 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-14 16:30:56,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2022-07-14 16:30:56,255 INFO L392 hiAutomatonCegarLoop]: Abstraction has 39 states and 43 transitions. [2022-07-14 16:30:56,255 INFO L374 stractBuchiCegarLoop]: Abstraction has 39 states and 43 transitions. [2022-07-14 16:30:56,255 INFO L287 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2022-07-14 16:30:56,255 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 43 transitions. [2022-07-14 16:30:56,255 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2022-07-14 16:30:56,255 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 16:30:56,255 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 16:30:56,256 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 16:30:56,256 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-14 16:30:56,256 INFO L752 eck$LassoCheckResult]: Stem: 989#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); 990#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(40);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; 999#L34-3 assume !!(main_~i~1#1 < 10);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; 1002#L34-2 main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1003#L34-3 assume !!(main_~i~1#1 < 10);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; 1008#L34-2 main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1025#L34-3 assume !!(main_~i~1#1 < 10);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; 1024#L34-2 main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1023#L34-3 assume !!(main_~i~1#1 < 10);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; 1022#L34-2 main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1021#L34-3 assume !!(main_~i~1#1 < 10);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; 1020#L34-2 main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1019#L34-3 assume !!(main_~i~1#1 < 10);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; 1018#L34-2 main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1017#L34-3 assume !!(main_~i~1#1 < 10);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; 1016#L34-2 main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1015#L34-3 assume !!(main_~i~1#1 < 10);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; 1014#L34-2 main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1013#L34-3 assume !!(main_~i~1#1 < 10);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; 1012#L34-2 main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1011#L34-3 assume !!(main_~i~1#1 < 10);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; 1010#L34-2 main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1009#L34-3 assume !(main_~i~1#1 < 10); 991#L34-4 assume { :begin_inline_avg } true;avg_#in~x#1.base, avg_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc avg_#res#1;havoc avg_#t~mem2#1, avg_#t~post1#1, avg_~x#1.base, avg_~x#1.offset, avg_~i~0#1, avg_~ret~0#1;avg_~x#1.base, avg_~x#1.offset := avg_#in~x#1.base, avg_#in~x#1.offset;havoc avg_~i~0#1;havoc avg_~ret~0#1;avg_~ret~0#1 := 0;avg_~i~0#1 := 0; 992#L20-3 assume !!(avg_~i~0#1 < 10);call avg_#t~mem2#1 := read~int(avg_~x#1.base, avg_~x#1.offset + 4 * avg_~i~0#1, 4);avg_~ret~0#1 := avg_~ret~0#1 + avg_#t~mem2#1;havoc avg_#t~mem2#1; 1005#L20-2 avg_#t~post1#1 := avg_~i~0#1;avg_~i~0#1 := 1 + avg_#t~post1#1;havoc avg_#t~post1#1; 1006#L20-3 assume !(avg_~i~0#1 < 10); 1000#L20-4 avg_#res#1 := (if (if avg_~ret~0#1 < 0 && 0 != avg_~ret~0#1 % 10 then 1 + avg_~ret~0#1 / 10 else avg_~ret~0#1 / 10) % 4294967296 <= 2147483647 then (if avg_~ret~0#1 < 0 && 0 != avg_~ret~0#1 % 10 then 1 + avg_~ret~0#1 / 10 else avg_~ret~0#1 / 10) % 4294967296 else (if avg_~ret~0#1 < 0 && 0 != avg_~ret~0#1 % 10 then 1 + avg_~ret~0#1 / 10 else avg_~ret~0#1 / 10) % 4294967296 - 4294967296); 1001#L23 main_#t~ret5#1 := avg_#res#1;assume { :end_inline_avg } 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_avg } true;avg_#in~x#1.base, avg_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc avg_#res#1;havoc avg_#t~mem2#1, avg_#t~post1#1, avg_~x#1.base, avg_~x#1.offset, avg_~i~0#1, avg_~ret~0#1;avg_~x#1.base, avg_~x#1.offset := avg_#in~x#1.base, avg_#in~x#1.offset;havoc avg_~i~0#1;havoc avg_~ret~0#1;avg_~ret~0#1 := 0;avg_~i~0#1 := 0; 997#L20-8 assume !!(avg_~i~0#1 < 10);call avg_#t~mem2#1 := read~int(avg_~x#1.base, avg_~x#1.offset + 4 * avg_~i~0#1, 4);avg_~ret~0#1 := avg_~ret~0#1 + avg_#t~mem2#1;havoc avg_#t~mem2#1; 998#L20-7 [2022-07-14 16:30:56,256 INFO L754 eck$LassoCheckResult]: Loop: 998#L20-7 avg_#t~post1#1 := avg_~i~0#1;avg_~i~0#1 := 1 + avg_#t~post1#1;havoc avg_#t~post1#1; 1007#L20-8 assume !!(avg_~i~0#1 < 10);call avg_#t~mem2#1 := read~int(avg_~x#1.base, avg_~x#1.offset + 4 * avg_~i~0#1, 4);avg_~ret~0#1 := avg_~ret~0#1 + avg_#t~mem2#1;havoc avg_#t~mem2#1; 998#L20-7 [2022-07-14 16:30:56,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 16:30:56,256 INFO L85 PathProgramCache]: Analyzing trace with hash -1721709263, now seen corresponding path program 1 times [2022-07-14 16:30:56,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 16:30:56,256 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224808031] [2022-07-14 16:30:56,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 16:30:56,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 16:30:56,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 16:30:56,292 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2022-07-14 16:30:56,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 16:30:56,292 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224808031] [2022-07-14 16:30:56,292 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1224808031] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 16:30:56,292 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [578513728] [2022-07-14 16:30:56,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 16:30:56,292 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 16:30:56,293 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 16:30:56,294 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 16:30:56,317 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2022-07-14 16:30:56,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 16:30:56,359 INFO L263 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-14 16:30:56,361 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 16:30:56,372 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2022-07-14 16:30:56,372 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 16:30:56,384 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2022-07-14 16:30:56,385 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [578513728] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 16:30:56,385 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 16:30:56,385 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2022-07-14 16:30:56,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504838311] [2022-07-14 16:30:56,387 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 16:30:56,387 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-14 16:30:56,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 16:30:56,388 INFO L85 PathProgramCache]: Analyzing trace with hash 2303, now seen corresponding path program 2 times [2022-07-14 16:30:56,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 16:30:56,388 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989420639] [2022-07-14 16:30:56,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 16:30:56,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 16:30:56,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 16:30:56,401 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 16:30:56,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 16:30:56,414 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 16:30:56,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 16:30:56,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-14 16:30:56,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-07-14 16:30:56,438 INFO L87 Difference]: Start difference. First operand 39 states and 43 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-14 16:30:56,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 16:30:56,479 INFO L93 Difference]: Finished difference Result 58 states and 62 transitions. [2022-07-14 16:30:56,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-14 16:30:56,480 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 58 states and 62 transitions. [2022-07-14 16:30:56,480 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2022-07-14 16:30:56,481 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 58 states to 58 states and 62 transitions. [2022-07-14 16:30:56,481 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2022-07-14 16:30:56,481 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2022-07-14 16:30:56,481 INFO L73 IsDeterministic]: Start isDeterministic. Operand 58 states and 62 transitions. [2022-07-14 16:30:56,481 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-14 16:30:56,481 INFO L369 hiAutomatonCegarLoop]: Abstraction has 58 states and 62 transitions. [2022-07-14 16:30:56,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states and 62 transitions. [2022-07-14 16:30:56,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 51. [2022-07-14 16:30:56,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 51 states have (on average 1.0784313725490196) internal successors, (55), 50 states have internal predecessors, (55), 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-14 16:30:56,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 55 transitions. [2022-07-14 16:30:56,496 INFO L392 hiAutomatonCegarLoop]: Abstraction has 51 states and 55 transitions. [2022-07-14 16:30:56,496 INFO L374 stractBuchiCegarLoop]: Abstraction has 51 states and 55 transitions. [2022-07-14 16:30:56,496 INFO L287 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2022-07-14 16:30:56,496 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 51 states and 55 transitions. [2022-07-14 16:30:56,497 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2022-07-14 16:30:56,497 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 16:30:56,497 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 16:30:56,499 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [10, 10, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 16:30:56,499 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-14 16:30:56,500 INFO L752 eck$LassoCheckResult]: Stem: 1268#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); 1269#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(40);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; 1280#L34-3 assume !!(main_~i~1#1 < 10);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; 1290#L34-2 main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1291#L34-3 assume !!(main_~i~1#1 < 10);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; 1283#L34-2 main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1284#L34-3 assume !!(main_~i~1#1 < 10);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; 1318#L34-2 main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1317#L34-3 assume !!(main_~i~1#1 < 10);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; 1316#L34-2 main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1315#L34-3 assume !!(main_~i~1#1 < 10);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; 1314#L34-2 main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1313#L34-3 assume !!(main_~i~1#1 < 10);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; 1312#L34-2 main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1311#L34-3 assume !!(main_~i~1#1 < 10);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; 1310#L34-2 main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1309#L34-3 assume !!(main_~i~1#1 < 10);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; 1308#L34-2 main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1307#L34-3 assume !!(main_~i~1#1 < 10);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; 1306#L34-2 main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1305#L34-3 assume !!(main_~i~1#1 < 10);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; 1304#L34-2 main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1303#L34-3 assume !(main_~i~1#1 < 10); 1272#L34-4 assume { :begin_inline_avg } true;avg_#in~x#1.base, avg_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc avg_#res#1;havoc avg_#t~mem2#1, avg_#t~post1#1, avg_~x#1.base, avg_~x#1.offset, avg_~i~0#1, avg_~ret~0#1;avg_~x#1.base, avg_~x#1.offset := avg_#in~x#1.base, avg_#in~x#1.offset;havoc avg_~i~0#1;havoc avg_~ret~0#1;avg_~ret~0#1 := 0;avg_~i~0#1 := 0; 1273#L20-3 assume !!(avg_~i~0#1 < 10);call avg_#t~mem2#1 := read~int(avg_~x#1.base, avg_~x#1.offset + 4 * avg_~i~0#1, 4);avg_~ret~0#1 := avg_~ret~0#1 + avg_#t~mem2#1;havoc avg_#t~mem2#1; 1286#L20-2 avg_#t~post1#1 := avg_~i~0#1;avg_~i~0#1 := 1 + avg_#t~post1#1;havoc avg_#t~post1#1; 1287#L20-3 assume !!(avg_~i~0#1 < 10);call avg_#t~mem2#1 := read~int(avg_~x#1.base, avg_~x#1.offset + 4 * avg_~i~0#1, 4);avg_~ret~0#1 := avg_~ret~0#1 + avg_#t~mem2#1;havoc avg_#t~mem2#1; 1288#L20-2 avg_#t~post1#1 := avg_~i~0#1;avg_~i~0#1 := 1 + avg_#t~post1#1;havoc avg_#t~post1#1; 1302#L20-3 assume !!(avg_~i~0#1 < 10);call avg_#t~mem2#1 := read~int(avg_~x#1.base, avg_~x#1.offset + 4 * avg_~i~0#1, 4);avg_~ret~0#1 := avg_~ret~0#1 + avg_#t~mem2#1;havoc avg_#t~mem2#1; 1301#L20-2 avg_#t~post1#1 := avg_~i~0#1;avg_~i~0#1 := 1 + avg_#t~post1#1;havoc avg_#t~post1#1; 1299#L20-3 assume !!(avg_~i~0#1 < 10);call avg_#t~mem2#1 := read~int(avg_~x#1.base, avg_~x#1.offset + 4 * avg_~i~0#1, 4);avg_~ret~0#1 := avg_~ret~0#1 + avg_#t~mem2#1;havoc avg_#t~mem2#1; 1296#L20-2 avg_#t~post1#1 := avg_~i~0#1;avg_~i~0#1 := 1 + avg_#t~post1#1;havoc avg_#t~post1#1; 1295#L20-3 assume !(avg_~i~0#1 < 10); 1281#L20-4 avg_#res#1 := (if (if avg_~ret~0#1 < 0 && 0 != avg_~ret~0#1 % 10 then 1 + avg_~ret~0#1 / 10 else avg_~ret~0#1 / 10) % 4294967296 <= 2147483647 then (if avg_~ret~0#1 < 0 && 0 != avg_~ret~0#1 % 10 then 1 + avg_~ret~0#1 / 10 else avg_~ret~0#1 / 10) % 4294967296 else (if avg_~ret~0#1 < 0 && 0 != avg_~ret~0#1 % 10 then 1 + avg_~ret~0#1 / 10 else avg_~ret~0#1 / 10) % 4294967296 - 4294967296); 1282#L23 main_#t~ret5#1 := avg_#res#1;assume { :end_inline_avg } 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_avg } true;avg_#in~x#1.base, avg_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc avg_#res#1;havoc avg_#t~mem2#1, avg_#t~post1#1, avg_~x#1.base, avg_~x#1.offset, avg_~i~0#1, avg_~ret~0#1;avg_~x#1.base, avg_~x#1.offset := avg_#in~x#1.base, avg_#in~x#1.offset;havoc avg_~i~0#1;havoc avg_~ret~0#1;avg_~ret~0#1 := 0;avg_~i~0#1 := 0; 1278#L20-8 assume !!(avg_~i~0#1 < 10);call avg_#t~mem2#1 := read~int(avg_~x#1.base, avg_~x#1.offset + 4 * avg_~i~0#1, 4);avg_~ret~0#1 := avg_~ret~0#1 + avg_#t~mem2#1;havoc avg_#t~mem2#1; 1279#L20-7 avg_#t~post1#1 := avg_~i~0#1;avg_~i~0#1 := 1 + avg_#t~post1#1;havoc avg_#t~post1#1; 1289#L20-8 assume !!(avg_~i~0#1 < 10);call avg_#t~mem2#1 := read~int(avg_~x#1.base, avg_~x#1.offset + 4 * avg_~i~0#1, 4);avg_~ret~0#1 := avg_~ret~0#1 + avg_#t~mem2#1;havoc avg_#t~mem2#1; 1300#L20-7 avg_#t~post1#1 := avg_~i~0#1;avg_~i~0#1 := 1 + avg_#t~post1#1;havoc avg_#t~post1#1; 1298#L20-8 assume !!(avg_~i~0#1 < 10);call avg_#t~mem2#1 := read~int(avg_~x#1.base, avg_~x#1.offset + 4 * avg_~i~0#1, 4);avg_~ret~0#1 := avg_~ret~0#1 + avg_#t~mem2#1;havoc avg_#t~mem2#1; 1297#L20-7 avg_#t~post1#1 := avg_~i~0#1;avg_~i~0#1 := 1 + avg_#t~post1#1;havoc avg_#t~post1#1; 1294#L20-8 assume !!(avg_~i~0#1 < 10);call avg_#t~mem2#1 := read~int(avg_~x#1.base, avg_~x#1.offset + 4 * avg_~i~0#1, 4);avg_~ret~0#1 := avg_~ret~0#1 + avg_#t~mem2#1;havoc avg_#t~mem2#1; 1293#L20-7 [2022-07-14 16:30:56,500 INFO L754 eck$LassoCheckResult]: Loop: 1293#L20-7 avg_#t~post1#1 := avg_~i~0#1;avg_~i~0#1 := 1 + avg_#t~post1#1;havoc avg_#t~post1#1; 1292#L20-8 assume !!(avg_~i~0#1 < 10);call avg_#t~mem2#1 := read~int(avg_~x#1.base, avg_~x#1.offset + 4 * avg_~i~0#1, 4);avg_~ret~0#1 := avg_~ret~0#1 + avg_#t~mem2#1;havoc avg_#t~mem2#1; 1293#L20-7 [2022-07-14 16:30:56,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 16:30:56,500 INFO L85 PathProgramCache]: Analyzing trace with hash 512696561, now seen corresponding path program 1 times [2022-07-14 16:30:56,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 16:30:56,501 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500145407] [2022-07-14 16:30:56,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 16:30:56,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 16:30:56,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 16:30:56,575 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2022-07-14 16:30:56,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 16:30:56,575 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500145407] [2022-07-14 16:30:56,575 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [500145407] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 16:30:56,575 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1580684421] [2022-07-14 16:30:56,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 16:30:56,575 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 16:30:56,575 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 16:30:56,576 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 16:30:56,577 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2022-07-14 16:30:56,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 16:30:56,639 INFO L263 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-14 16:30:56,641 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 16:30:56,657 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2022-07-14 16:30:56,657 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 16:30:56,698 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2022-07-14 16:30:56,699 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1580684421] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 16:30:56,699 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 16:30:56,699 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2022-07-14 16:30:56,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31273301] [2022-07-14 16:30:56,699 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 16:30:56,700 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-14 16:30:56,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 16:30:56,700 INFO L85 PathProgramCache]: Analyzing trace with hash 2303, now seen corresponding path program 3 times [2022-07-14 16:30:56,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 16:30:56,700 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088070712] [2022-07-14 16:30:56,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 16:30:56,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 16:30:56,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 16:30:56,703 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 16:30:56,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 16:30:56,705 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 16:30:56,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 16:30:56,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-14 16:30:56,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2022-07-14 16:30:56,729 INFO L87 Difference]: Start difference. First operand 51 states and 55 transitions. cyclomatic complexity: 9 Second operand has 13 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 13 states have internal predecessors, (32), 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-14 16:30:56,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 16:30:56,828 INFO L93 Difference]: Finished difference Result 94 states and 98 transitions. [2022-07-14 16:30:56,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-14 16:30:56,829 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 94 states and 98 transitions. [2022-07-14 16:30:56,830 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2022-07-14 16:30:56,830 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 94 states to 94 states and 98 transitions. [2022-07-14 16:30:56,830 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 54 [2022-07-14 16:30:56,830 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 54 [2022-07-14 16:30:56,830 INFO L73 IsDeterministic]: Start isDeterministic. Operand 94 states and 98 transitions. [2022-07-14 16:30:56,831 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-14 16:30:56,831 INFO L369 hiAutomatonCegarLoop]: Abstraction has 94 states and 98 transitions. [2022-07-14 16:30:56,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states and 98 transitions. [2022-07-14 16:30:56,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 75. [2022-07-14 16:30:56,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 75 states have (on average 1.0533333333333332) internal successors, (79), 74 states have internal predecessors, (79), 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-14 16:30:56,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 79 transitions. [2022-07-14 16:30:56,834 INFO L392 hiAutomatonCegarLoop]: Abstraction has 75 states and 79 transitions. [2022-07-14 16:30:56,834 INFO L374 stractBuchiCegarLoop]: Abstraction has 75 states and 79 transitions. [2022-07-14 16:30:56,834 INFO L287 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2022-07-14 16:30:56,834 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 75 states and 79 transitions. [2022-07-14 16:30:56,835 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2022-07-14 16:30:56,835 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 16:30:56,835 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 16:30:56,836 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [10, 10, 10, 10, 10, 9, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 16:30:56,836 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-14 16:30:56,836 INFO L752 eck$LassoCheckResult]: Stem: 1675#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); 1676#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(40);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; 1687#L34-3 assume !!(main_~i~1#1 < 10);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; 1690#L34-2 main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1691#L34-3 assume !!(main_~i~1#1 < 10);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; 1697#L34-2 main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1749#L34-3 assume !!(main_~i~1#1 < 10);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; 1748#L34-2 main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1747#L34-3 assume !!(main_~i~1#1 < 10);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; 1746#L34-2 main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1745#L34-3 assume !!(main_~i~1#1 < 10);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; 1744#L34-2 main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1743#L34-3 assume !!(main_~i~1#1 < 10);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; 1742#L34-2 main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1741#L34-3 assume !!(main_~i~1#1 < 10);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; 1740#L34-2 main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1739#L34-3 assume !!(main_~i~1#1 < 10);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; 1738#L34-2 main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1737#L34-3 assume !!(main_~i~1#1 < 10);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; 1736#L34-2 main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1735#L34-3 assume !!(main_~i~1#1 < 10);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; 1734#L34-2 main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1733#L34-3 assume !(main_~i~1#1 < 10); 1679#L34-4 assume { :begin_inline_avg } true;avg_#in~x#1.base, avg_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc avg_#res#1;havoc avg_#t~mem2#1, avg_#t~post1#1, avg_~x#1.base, avg_~x#1.offset, avg_~i~0#1, avg_~ret~0#1;avg_~x#1.base, avg_~x#1.offset := avg_#in~x#1.base, avg_#in~x#1.offset;havoc avg_~i~0#1;havoc avg_~ret~0#1;avg_~ret~0#1 := 0;avg_~i~0#1 := 0; 1680#L20-3 assume !!(avg_~i~0#1 < 10);call avg_#t~mem2#1 := read~int(avg_~x#1.base, avg_~x#1.offset + 4 * avg_~i~0#1, 4);avg_~ret~0#1 := avg_~ret~0#1 + avg_#t~mem2#1;havoc avg_#t~mem2#1; 1693#L20-2 avg_#t~post1#1 := avg_~i~0#1;avg_~i~0#1 := 1 + avg_#t~post1#1;havoc avg_#t~post1#1; 1694#L20-3 assume !!(avg_~i~0#1 < 10);call avg_#t~mem2#1 := read~int(avg_~x#1.base, avg_~x#1.offset + 4 * avg_~i~0#1, 4);avg_~ret~0#1 := avg_~ret~0#1 + avg_#t~mem2#1;havoc avg_#t~mem2#1; 1695#L20-2 avg_#t~post1#1 := avg_~i~0#1;avg_~i~0#1 := 1 + avg_#t~post1#1;havoc avg_#t~post1#1; 1732#L20-3 assume !!(avg_~i~0#1 < 10);call avg_#t~mem2#1 := read~int(avg_~x#1.base, avg_~x#1.offset + 4 * avg_~i~0#1, 4);avg_~ret~0#1 := avg_~ret~0#1 + avg_#t~mem2#1;havoc avg_#t~mem2#1; 1731#L20-2 avg_#t~post1#1 := avg_~i~0#1;avg_~i~0#1 := 1 + avg_#t~post1#1;havoc avg_#t~post1#1; 1729#L20-3 assume !!(avg_~i~0#1 < 10);call avg_#t~mem2#1 := read~int(avg_~x#1.base, avg_~x#1.offset + 4 * avg_~i~0#1, 4);avg_~ret~0#1 := avg_~ret~0#1 + avg_#t~mem2#1;havoc avg_#t~mem2#1; 1727#L20-2 avg_#t~post1#1 := avg_~i~0#1;avg_~i~0#1 := 1 + avg_#t~post1#1;havoc avg_#t~post1#1; 1725#L20-3 assume !!(avg_~i~0#1 < 10);call avg_#t~mem2#1 := read~int(avg_~x#1.base, avg_~x#1.offset + 4 * avg_~i~0#1, 4);avg_~ret~0#1 := avg_~ret~0#1 + avg_#t~mem2#1;havoc avg_#t~mem2#1; 1723#L20-2 avg_#t~post1#1 := avg_~i~0#1;avg_~i~0#1 := 1 + avg_#t~post1#1;havoc avg_#t~post1#1; 1721#L20-3 assume !!(avg_~i~0#1 < 10);call avg_#t~mem2#1 := read~int(avg_~x#1.base, avg_~x#1.offset + 4 * avg_~i~0#1, 4);avg_~ret~0#1 := avg_~ret~0#1 + avg_#t~mem2#1;havoc avg_#t~mem2#1; 1719#L20-2 avg_#t~post1#1 := avg_~i~0#1;avg_~i~0#1 := 1 + avg_#t~post1#1;havoc avg_#t~post1#1; 1717#L20-3 assume !!(avg_~i~0#1 < 10);call avg_#t~mem2#1 := read~int(avg_~x#1.base, avg_~x#1.offset + 4 * avg_~i~0#1, 4);avg_~ret~0#1 := avg_~ret~0#1 + avg_#t~mem2#1;havoc avg_#t~mem2#1; 1715#L20-2 avg_#t~post1#1 := avg_~i~0#1;avg_~i~0#1 := 1 + avg_#t~post1#1;havoc avg_#t~post1#1; 1713#L20-3 assume !!(avg_~i~0#1 < 10);call avg_#t~mem2#1 := read~int(avg_~x#1.base, avg_~x#1.offset + 4 * avg_~i~0#1, 4);avg_~ret~0#1 := avg_~ret~0#1 + avg_#t~mem2#1;havoc avg_#t~mem2#1; 1711#L20-2 avg_#t~post1#1 := avg_~i~0#1;avg_~i~0#1 := 1 + avg_#t~post1#1;havoc avg_#t~post1#1; 1709#L20-3 assume !!(avg_~i~0#1 < 10);call avg_#t~mem2#1 := read~int(avg_~x#1.base, avg_~x#1.offset + 4 * avg_~i~0#1, 4);avg_~ret~0#1 := avg_~ret~0#1 + avg_#t~mem2#1;havoc avg_#t~mem2#1; 1707#L20-2 avg_#t~post1#1 := avg_~i~0#1;avg_~i~0#1 := 1 + avg_#t~post1#1;havoc avg_#t~post1#1; 1705#L20-3 assume !!(avg_~i~0#1 < 10);call avg_#t~mem2#1 := read~int(avg_~x#1.base, avg_~x#1.offset + 4 * avg_~i~0#1, 4);avg_~ret~0#1 := avg_~ret~0#1 + avg_#t~mem2#1;havoc avg_#t~mem2#1; 1702#L20-2 avg_#t~post1#1 := avg_~i~0#1;avg_~i~0#1 := 1 + avg_#t~post1#1;havoc avg_#t~post1#1; 1701#L20-3 assume !(avg_~i~0#1 < 10); 1688#L20-4 avg_#res#1 := (if (if avg_~ret~0#1 < 0 && 0 != avg_~ret~0#1 % 10 then 1 + avg_~ret~0#1 / 10 else avg_~ret~0#1 / 10) % 4294967296 <= 2147483647 then (if avg_~ret~0#1 < 0 && 0 != avg_~ret~0#1 % 10 then 1 + avg_~ret~0#1 / 10 else avg_~ret~0#1 / 10) % 4294967296 else (if avg_~ret~0#1 < 0 && 0 != avg_~ret~0#1 % 10 then 1 + avg_~ret~0#1 / 10 else avg_~ret~0#1 / 10) % 4294967296 - 4294967296); 1689#L23 main_#t~ret5#1 := avg_#res#1;assume { :end_inline_avg } 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_avg } true;avg_#in~x#1.base, avg_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc avg_#res#1;havoc avg_#t~mem2#1, avg_#t~post1#1, avg_~x#1.base, avg_~x#1.offset, avg_~i~0#1, avg_~ret~0#1;avg_~x#1.base, avg_~x#1.offset := avg_#in~x#1.base, avg_#in~x#1.offset;havoc avg_~i~0#1;havoc avg_~ret~0#1;avg_~ret~0#1 := 0;avg_~i~0#1 := 0; 1685#L20-8 assume !!(avg_~i~0#1 < 10);call avg_#t~mem2#1 := read~int(avg_~x#1.base, avg_~x#1.offset + 4 * avg_~i~0#1, 4);avg_~ret~0#1 := avg_~ret~0#1 + avg_#t~mem2#1;havoc avg_#t~mem2#1; 1686#L20-7 avg_#t~post1#1 := avg_~i~0#1;avg_~i~0#1 := 1 + avg_#t~post1#1;havoc avg_#t~post1#1; 1696#L20-8 assume !!(avg_~i~0#1 < 10);call avg_#t~mem2#1 := read~int(avg_~x#1.base, avg_~x#1.offset + 4 * avg_~i~0#1, 4);avg_~ret~0#1 := avg_~ret~0#1 + avg_#t~mem2#1;havoc avg_#t~mem2#1; 1730#L20-7 avg_#t~post1#1 := avg_~i~0#1;avg_~i~0#1 := 1 + avg_#t~post1#1;havoc avg_#t~post1#1; 1728#L20-8 assume !!(avg_~i~0#1 < 10);call avg_#t~mem2#1 := read~int(avg_~x#1.base, avg_~x#1.offset + 4 * avg_~i~0#1, 4);avg_~ret~0#1 := avg_~ret~0#1 + avg_#t~mem2#1;havoc avg_#t~mem2#1; 1726#L20-7 avg_#t~post1#1 := avg_~i~0#1;avg_~i~0#1 := 1 + avg_#t~post1#1;havoc avg_#t~post1#1; 1724#L20-8 assume !!(avg_~i~0#1 < 10);call avg_#t~mem2#1 := read~int(avg_~x#1.base, avg_~x#1.offset + 4 * avg_~i~0#1, 4);avg_~ret~0#1 := avg_~ret~0#1 + avg_#t~mem2#1;havoc avg_#t~mem2#1; 1722#L20-7 avg_#t~post1#1 := avg_~i~0#1;avg_~i~0#1 := 1 + avg_#t~post1#1;havoc avg_#t~post1#1; 1720#L20-8 assume !!(avg_~i~0#1 < 10);call avg_#t~mem2#1 := read~int(avg_~x#1.base, avg_~x#1.offset + 4 * avg_~i~0#1, 4);avg_~ret~0#1 := avg_~ret~0#1 + avg_#t~mem2#1;havoc avg_#t~mem2#1; 1718#L20-7 avg_#t~post1#1 := avg_~i~0#1;avg_~i~0#1 := 1 + avg_#t~post1#1;havoc avg_#t~post1#1; 1716#L20-8 assume !!(avg_~i~0#1 < 10);call avg_#t~mem2#1 := read~int(avg_~x#1.base, avg_~x#1.offset + 4 * avg_~i~0#1, 4);avg_~ret~0#1 := avg_~ret~0#1 + avg_#t~mem2#1;havoc avg_#t~mem2#1; 1714#L20-7 avg_#t~post1#1 := avg_~i~0#1;avg_~i~0#1 := 1 + avg_#t~post1#1;havoc avg_#t~post1#1; 1712#L20-8 assume !!(avg_~i~0#1 < 10);call avg_#t~mem2#1 := read~int(avg_~x#1.base, avg_~x#1.offset + 4 * avg_~i~0#1, 4);avg_~ret~0#1 := avg_~ret~0#1 + avg_#t~mem2#1;havoc avg_#t~mem2#1; 1710#L20-7 avg_#t~post1#1 := avg_~i~0#1;avg_~i~0#1 := 1 + avg_#t~post1#1;havoc avg_#t~post1#1; 1708#L20-8 assume !!(avg_~i~0#1 < 10);call avg_#t~mem2#1 := read~int(avg_~x#1.base, avg_~x#1.offset + 4 * avg_~i~0#1, 4);avg_~ret~0#1 := avg_~ret~0#1 + avg_#t~mem2#1;havoc avg_#t~mem2#1; 1706#L20-7 avg_#t~post1#1 := avg_~i~0#1;avg_~i~0#1 := 1 + avg_#t~post1#1;havoc avg_#t~post1#1; 1704#L20-8 assume !!(avg_~i~0#1 < 10);call avg_#t~mem2#1 := read~int(avg_~x#1.base, avg_~x#1.offset + 4 * avg_~i~0#1, 4);avg_~ret~0#1 := avg_~ret~0#1 + avg_#t~mem2#1;havoc avg_#t~mem2#1; 1703#L20-7 avg_#t~post1#1 := avg_~i~0#1;avg_~i~0#1 := 1 + avg_#t~post1#1;havoc avg_#t~post1#1; 1700#L20-8 assume !!(avg_~i~0#1 < 10);call avg_#t~mem2#1 := read~int(avg_~x#1.base, avg_~x#1.offset + 4 * avg_~i~0#1, 4);avg_~ret~0#1 := avg_~ret~0#1 + avg_#t~mem2#1;havoc avg_#t~mem2#1; 1699#L20-7 [2022-07-14 16:30:56,836 INFO L754 eck$LassoCheckResult]: Loop: 1699#L20-7 avg_#t~post1#1 := avg_~i~0#1;avg_~i~0#1 := 1 + avg_#t~post1#1;havoc avg_#t~post1#1; 1698#L20-8 assume !!(avg_~i~0#1 < 10);call avg_#t~mem2#1 := read~int(avg_~x#1.base, avg_~x#1.offset + 4 * avg_~i~0#1, 4);avg_~ret~0#1 := avg_~ret~0#1 + avg_#t~mem2#1;havoc avg_#t~mem2#1; 1699#L20-7 [2022-07-14 16:30:56,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 16:30:56,837 INFO L85 PathProgramCache]: Analyzing trace with hash -549950095, now seen corresponding path program 2 times [2022-07-14 16:30:56,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 16:30:56,837 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87251667] [2022-07-14 16:30:56,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 16:30:56,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 16:30:56,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 16:30:56,980 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 16:30:57,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 16:30:57,102 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 16:30:57,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 16:30:57,102 INFO L85 PathProgramCache]: Analyzing trace with hash 2303, now seen corresponding path program 4 times [2022-07-14 16:30:57,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 16:30:57,102 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111161301] [2022-07-14 16:30:57,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 16:30:57,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 16:30:57,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 16:30:57,105 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 16:30:57,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 16:30:57,107 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 16:30:57,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 16:30:57,107 INFO L85 PathProgramCache]: Analyzing trace with hash -221062545, now seen corresponding path program 3 times [2022-07-14 16:30:57,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 16:30:57,107 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645736476] [2022-07-14 16:30:57,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 16:30:57,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 16:30:57,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 16:30:57,203 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 81 proven. 19 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2022-07-14 16:30:57,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 16:30:57,204 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645736476] [2022-07-14 16:30:57,204 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [645736476] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 16:30:57,204 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [413882641] [2022-07-14 16:30:57,204 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-14 16:30:57,204 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 16:30:57,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 16:30:57,206 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-14 16:30:57,207 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-14 16:30:57,363 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2022-07-14 16:30:57,363 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 16:30:57,365 INFO L263 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-14 16:30:57,367 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 16:30:57,399 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2022-07-14 16:30:57,399 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 16:30:57,399 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [413882641] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 16:30:57,399 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-14 16:30:57,399 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [12] total 13 [2022-07-14 16:30:57,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400201650] [2022-07-14 16:30:57,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 16:30:57,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 16:30:57,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-14 16:30:57,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2022-07-14 16:30:57,426 INFO L87 Difference]: Start difference. First operand 75 states and 79 transitions. cyclomatic complexity: 9 Second operand has 13 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 13 states have internal predecessors, (32), 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-14 16:30:57,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 16:30:57,537 INFO L93 Difference]: Finished difference Result 94 states and 95 transitions. [2022-07-14 16:30:57,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-14 16:30:57,537 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 94 states and 95 transitions. [2022-07-14 16:30:57,538 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-07-14 16:30:57,538 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 94 states to 72 states and 73 transitions. [2022-07-14 16:30:57,539 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 32 [2022-07-14 16:30:57,539 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 52 [2022-07-14 16:30:57,539 INFO L73 IsDeterministic]: Start isDeterministic. Operand 72 states and 73 transitions. [2022-07-14 16:30:57,539 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-14 16:30:57,539 INFO L369 hiAutomatonCegarLoop]: Abstraction has 72 states and 73 transitions. [2022-07-14 16:30:57,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states and 73 transitions. [2022-07-14 16:30:57,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2022-07-14 16:30:57,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 72 states have (on average 1.0138888888888888) internal successors, (73), 71 states have internal predecessors, (73), 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-14 16:30:57,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 73 transitions. [2022-07-14 16:30:57,541 INFO L392 hiAutomatonCegarLoop]: Abstraction has 72 states and 73 transitions. [2022-07-14 16:30:57,541 INFO L374 stractBuchiCegarLoop]: Abstraction has 72 states and 73 transitions. [2022-07-14 16:30:57,541 INFO L287 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2022-07-14 16:30:57,541 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 72 states and 73 transitions. [2022-07-14 16:30:57,542 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-07-14 16:30:57,542 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 16:30:57,542 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 16:30:57,542 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 16:30:57,542 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-14 16:30:57,543 INFO L752 eck$LassoCheckResult]: Stem: 2064#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); 2065#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(40);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; 2074#L34-3 assume !!(main_~i~1#1 < 10);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; 2082#L34-2 main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2083#L34-3 assume !!(main_~i~1#1 < 10);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; 2077#L34-2 main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2078#L34-3 assume !!(main_~i~1#1 < 10);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; 2135#L34-2 main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2134#L34-3 assume !!(main_~i~1#1 < 10);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; 2133#L34-2 main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2132#L34-3 assume !!(main_~i~1#1 < 10);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; 2131#L34-2 main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2130#L34-3 assume !!(main_~i~1#1 < 10);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; 2129#L34-2 main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2128#L34-3 assume !!(main_~i~1#1 < 10);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; 2127#L34-2 main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2126#L34-3 assume !!(main_~i~1#1 < 10);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; 2125#L34-2 main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2124#L34-3 assume !!(main_~i~1#1 < 10);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; 2123#L34-2 main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2122#L34-3 assume !!(main_~i~1#1 < 10);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; 2121#L34-2 main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2120#L34-3 assume !(main_~i~1#1 < 10); 2068#L34-4 assume { :begin_inline_avg } true;avg_#in~x#1.base, avg_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc avg_#res#1;havoc avg_#t~mem2#1, avg_#t~post1#1, avg_~x#1.base, avg_~x#1.offset, avg_~i~0#1, avg_~ret~0#1;avg_~x#1.base, avg_~x#1.offset := avg_#in~x#1.base, avg_#in~x#1.offset;havoc avg_~i~0#1;havoc avg_~ret~0#1;avg_~ret~0#1 := 0;avg_~i~0#1 := 0; 2069#L20-3 assume !!(avg_~i~0#1 < 10);call avg_#t~mem2#1 := read~int(avg_~x#1.base, avg_~x#1.offset + 4 * avg_~i~0#1, 4);avg_~ret~0#1 := avg_~ret~0#1 + avg_#t~mem2#1;havoc avg_#t~mem2#1; 2079#L20-2 avg_#t~post1#1 := avg_~i~0#1;avg_~i~0#1 := 1 + avg_#t~post1#1;havoc avg_#t~post1#1; 2080#L20-3 assume !!(avg_~i~0#1 < 10);call avg_#t~mem2#1 := read~int(avg_~x#1.base, avg_~x#1.offset + 4 * avg_~i~0#1, 4);avg_~ret~0#1 := avg_~ret~0#1 + avg_#t~mem2#1;havoc avg_#t~mem2#1; 2119#L20-2 avg_#t~post1#1 := avg_~i~0#1;avg_~i~0#1 := 1 + avg_#t~post1#1;havoc avg_#t~post1#1; 2118#L20-3 assume !!(avg_~i~0#1 < 10);call avg_#t~mem2#1 := read~int(avg_~x#1.base, avg_~x#1.offset + 4 * avg_~i~0#1, 4);avg_~ret~0#1 := avg_~ret~0#1 + avg_#t~mem2#1;havoc avg_#t~mem2#1; 2117#L20-2 avg_#t~post1#1 := avg_~i~0#1;avg_~i~0#1 := 1 + avg_#t~post1#1;havoc avg_#t~post1#1; 2116#L20-3 assume !!(avg_~i~0#1 < 10);call avg_#t~mem2#1 := read~int(avg_~x#1.base, avg_~x#1.offset + 4 * avg_~i~0#1, 4);avg_~ret~0#1 := avg_~ret~0#1 + avg_#t~mem2#1;havoc avg_#t~mem2#1; 2114#L20-2 avg_#t~post1#1 := avg_~i~0#1;avg_~i~0#1 := 1 + avg_#t~post1#1;havoc avg_#t~post1#1; 2112#L20-3 assume !!(avg_~i~0#1 < 10);call avg_#t~mem2#1 := read~int(avg_~x#1.base, avg_~x#1.offset + 4 * avg_~i~0#1, 4);avg_~ret~0#1 := avg_~ret~0#1 + avg_#t~mem2#1;havoc avg_#t~mem2#1; 2110#L20-2 avg_#t~post1#1 := avg_~i~0#1;avg_~i~0#1 := 1 + avg_#t~post1#1;havoc avg_#t~post1#1; 2108#L20-3 assume !!(avg_~i~0#1 < 10);call avg_#t~mem2#1 := read~int(avg_~x#1.base, avg_~x#1.offset + 4 * avg_~i~0#1, 4);avg_~ret~0#1 := avg_~ret~0#1 + avg_#t~mem2#1;havoc avg_#t~mem2#1; 2106#L20-2 avg_#t~post1#1 := avg_~i~0#1;avg_~i~0#1 := 1 + avg_#t~post1#1;havoc avg_#t~post1#1; 2104#L20-3 assume !!(avg_~i~0#1 < 10);call avg_#t~mem2#1 := read~int(avg_~x#1.base, avg_~x#1.offset + 4 * avg_~i~0#1, 4);avg_~ret~0#1 := avg_~ret~0#1 + avg_#t~mem2#1;havoc avg_#t~mem2#1; 2102#L20-2 avg_#t~post1#1 := avg_~i~0#1;avg_~i~0#1 := 1 + avg_#t~post1#1;havoc avg_#t~post1#1; 2100#L20-3 assume !!(avg_~i~0#1 < 10);call avg_#t~mem2#1 := read~int(avg_~x#1.base, avg_~x#1.offset + 4 * avg_~i~0#1, 4);avg_~ret~0#1 := avg_~ret~0#1 + avg_#t~mem2#1;havoc avg_#t~mem2#1; 2098#L20-2 avg_#t~post1#1 := avg_~i~0#1;avg_~i~0#1 := 1 + avg_#t~post1#1;havoc avg_#t~post1#1; 2096#L20-3 assume !!(avg_~i~0#1 < 10);call avg_#t~mem2#1 := read~int(avg_~x#1.base, avg_~x#1.offset + 4 * avg_~i~0#1, 4);avg_~ret~0#1 := avg_~ret~0#1 + avg_#t~mem2#1;havoc avg_#t~mem2#1; 2094#L20-2 avg_#t~post1#1 := avg_~i~0#1;avg_~i~0#1 := 1 + avg_#t~post1#1;havoc avg_#t~post1#1; 2092#L20-3 assume !!(avg_~i~0#1 < 10);call avg_#t~mem2#1 := read~int(avg_~x#1.base, avg_~x#1.offset + 4 * avg_~i~0#1, 4);avg_~ret~0#1 := avg_~ret~0#1 + avg_#t~mem2#1;havoc avg_#t~mem2#1; 2090#L20-2 avg_#t~post1#1 := avg_~i~0#1;avg_~i~0#1 := 1 + avg_#t~post1#1;havoc avg_#t~post1#1; 2088#L20-3 assume !(avg_~i~0#1 < 10); 2075#L20-4 avg_#res#1 := (if (if avg_~ret~0#1 < 0 && 0 != avg_~ret~0#1 % 10 then 1 + avg_~ret~0#1 / 10 else avg_~ret~0#1 / 10) % 4294967296 <= 2147483647 then (if avg_~ret~0#1 < 0 && 0 != avg_~ret~0#1 % 10 then 1 + avg_~ret~0#1 / 10 else avg_~ret~0#1 / 10) % 4294967296 else (if avg_~ret~0#1 < 0 && 0 != avg_~ret~0#1 % 10 then 1 + avg_~ret~0#1 / 10 else avg_~ret~0#1 / 10) % 4294967296 - 4294967296); 2076#L23 main_#t~ret5#1 := avg_#res#1;assume { :end_inline_avg } 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_avg } true;avg_#in~x#1.base, avg_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc avg_#res#1;havoc avg_#t~mem2#1, avg_#t~post1#1, avg_~x#1.base, avg_~x#1.offset, avg_~i~0#1, avg_~ret~0#1;avg_~x#1.base, avg_~x#1.offset := avg_#in~x#1.base, avg_#in~x#1.offset;havoc avg_~i~0#1;havoc avg_~ret~0#1;avg_~ret~0#1 := 0;avg_~i~0#1 := 0; 2072#L20-8 assume !!(avg_~i~0#1 < 10);call avg_#t~mem2#1 := read~int(avg_~x#1.base, avg_~x#1.offset + 4 * avg_~i~0#1, 4);avg_~ret~0#1 := avg_~ret~0#1 + avg_#t~mem2#1;havoc avg_#t~mem2#1; 2073#L20-7 avg_#t~post1#1 := avg_~i~0#1;avg_~i~0#1 := 1 + avg_#t~post1#1;havoc avg_#t~post1#1; 2081#L20-8 assume !!(avg_~i~0#1 < 10);call avg_#t~mem2#1 := read~int(avg_~x#1.base, avg_~x#1.offset + 4 * avg_~i~0#1, 4);avg_~ret~0#1 := avg_~ret~0#1 + avg_#t~mem2#1;havoc avg_#t~mem2#1; 2115#L20-7 avg_#t~post1#1 := avg_~i~0#1;avg_~i~0#1 := 1 + avg_#t~post1#1;havoc avg_#t~post1#1; 2113#L20-8 assume !!(avg_~i~0#1 < 10);call avg_#t~mem2#1 := read~int(avg_~x#1.base, avg_~x#1.offset + 4 * avg_~i~0#1, 4);avg_~ret~0#1 := avg_~ret~0#1 + avg_#t~mem2#1;havoc avg_#t~mem2#1; 2111#L20-7 avg_#t~post1#1 := avg_~i~0#1;avg_~i~0#1 := 1 + avg_#t~post1#1;havoc avg_#t~post1#1; 2109#L20-8 assume !!(avg_~i~0#1 < 10);call avg_#t~mem2#1 := read~int(avg_~x#1.base, avg_~x#1.offset + 4 * avg_~i~0#1, 4);avg_~ret~0#1 := avg_~ret~0#1 + avg_#t~mem2#1;havoc avg_#t~mem2#1; 2107#L20-7 avg_#t~post1#1 := avg_~i~0#1;avg_~i~0#1 := 1 + avg_#t~post1#1;havoc avg_#t~post1#1; 2105#L20-8 assume !!(avg_~i~0#1 < 10);call avg_#t~mem2#1 := read~int(avg_~x#1.base, avg_~x#1.offset + 4 * avg_~i~0#1, 4);avg_~ret~0#1 := avg_~ret~0#1 + avg_#t~mem2#1;havoc avg_#t~mem2#1; 2103#L20-7 avg_#t~post1#1 := avg_~i~0#1;avg_~i~0#1 := 1 + avg_#t~post1#1;havoc avg_#t~post1#1; 2101#L20-8 assume !!(avg_~i~0#1 < 10);call avg_#t~mem2#1 := read~int(avg_~x#1.base, avg_~x#1.offset + 4 * avg_~i~0#1, 4);avg_~ret~0#1 := avg_~ret~0#1 + avg_#t~mem2#1;havoc avg_#t~mem2#1; 2099#L20-7 avg_#t~post1#1 := avg_~i~0#1;avg_~i~0#1 := 1 + avg_#t~post1#1;havoc avg_#t~post1#1; 2097#L20-8 assume !!(avg_~i~0#1 < 10);call avg_#t~mem2#1 := read~int(avg_~x#1.base, avg_~x#1.offset + 4 * avg_~i~0#1, 4);avg_~ret~0#1 := avg_~ret~0#1 + avg_#t~mem2#1;havoc avg_#t~mem2#1; 2095#L20-7 avg_#t~post1#1 := avg_~i~0#1;avg_~i~0#1 := 1 + avg_#t~post1#1;havoc avg_#t~post1#1; 2093#L20-8 assume !!(avg_~i~0#1 < 10);call avg_#t~mem2#1 := read~int(avg_~x#1.base, avg_~x#1.offset + 4 * avg_~i~0#1, 4);avg_~ret~0#1 := avg_~ret~0#1 + avg_#t~mem2#1;havoc avg_#t~mem2#1; 2091#L20-7 avg_#t~post1#1 := avg_~i~0#1;avg_~i~0#1 := 1 + avg_#t~post1#1;havoc avg_#t~post1#1; 2089#L20-8 assume !!(avg_~i~0#1 < 10);call avg_#t~mem2#1 := read~int(avg_~x#1.base, avg_~x#1.offset + 4 * avg_~i~0#1, 4);avg_~ret~0#1 := avg_~ret~0#1 + avg_#t~mem2#1;havoc avg_#t~mem2#1; 2087#L20-7 avg_#t~post1#1 := avg_~i~0#1;avg_~i~0#1 := 1 + avg_#t~post1#1;havoc avg_#t~post1#1; 2086#L20-8 assume !!(avg_~i~0#1 < 10);call avg_#t~mem2#1 := read~int(avg_~x#1.base, avg_~x#1.offset + 4 * avg_~i~0#1, 4);avg_~ret~0#1 := avg_~ret~0#1 + avg_#t~mem2#1;havoc avg_#t~mem2#1; 2085#L20-7 avg_#t~post1#1 := avg_~i~0#1;avg_~i~0#1 := 1 + avg_#t~post1#1;havoc avg_#t~post1#1; 2084#L20-8 assume !(avg_~i~0#1 < 10); 2066#L20-9 avg_#res#1 := (if (if avg_~ret~0#1 < 0 && 0 != avg_~ret~0#1 % 10 then 1 + avg_~ret~0#1 / 10 else avg_~ret~0#1 / 10) % 4294967296 <= 2147483647 then (if avg_~ret~0#1 < 0 && 0 != avg_~ret~0#1 % 10 then 1 + avg_~ret~0#1 / 10 else avg_~ret~0#1 / 10) % 4294967296 else (if avg_~ret~0#1 < 0 && 0 != avg_~ret~0#1 % 10 then 1 + avg_~ret~0#1 / 10 else avg_~ret~0#1 / 10) % 4294967296 - 4294967296); 2067#L23-1 main_#t~ret8#1 := avg_#res#1;assume { :end_inline_avg } 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; 2071#L43-3 [2022-07-14 16:30:57,543 INFO L754 eck$LassoCheckResult]: Loop: 2071#L43-3 assume !!(main_~i~2#1 < 9);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; 2070#L43-2 main_#t~post10#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 2071#L43-3 [2022-07-14 16:30:57,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 16:30:57,543 INFO L85 PathProgramCache]: Analyzing trace with hash -1987708689, now seen corresponding path program 1 times [2022-07-14 16:30:57,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 16:30:57,543 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557255750] [2022-07-14 16:30:57,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 16:30:57,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 16:30:57,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 16:30:57,696 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 16:30:57,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 16:30:57,769 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 16:30:57,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 16:30:57,771 INFO L85 PathProgramCache]: Analyzing trace with hash 2755, now seen corresponding path program 1 times [2022-07-14 16:30:57,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 16:30:57,771 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364372599] [2022-07-14 16:30:57,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 16:30:57,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 16:30:57,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 16:30:57,775 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 16:30:57,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 16:30:57,778 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 16:30:57,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 16:30:57,778 INFO L85 PathProgramCache]: Analyzing trace with hash 1072398385, now seen corresponding path program 1 times [2022-07-14 16:30:57,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 16:30:57,778 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502481883] [2022-07-14 16:30:57,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 16:30:57,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 16:30:57,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 16:30:57,928 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 16:30:57,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 16:30:57,990 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 16:31:16,697 WARN L233 SmtUtils]: Spent 18.67s on a formula simplification. DAG size of input: 557 DAG size of output: 419 (called from [L 279] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-07-14 16:32:53,918 WARN L233 SmtUtils]: Spent 5.34s on a formula simplification that was a NOOP. DAG size: 249 (called from [L 316] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-07-14 16:32:53,922 INFO L210 LassoAnalysis]: Preferences: [2022-07-14 16:32:53,922 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-14 16:32:53,922 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-14 16:32:53,922 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-14 16:32:53,923 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-14 16:32:53,923 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 16:32:53,923 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-14 16:32:53,923 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-14 16:32:53,923 INFO L133 ssoRankerPreferences]: Filename of dumped script: avg10-2.i_Iteration10_Lasso [2022-07-14 16:32:53,923 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-14 16:32:53,923 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-14 16:32:53,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-14 16:32:53,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-14 16:32:53,941 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-14 16:32:53,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-14 16:33:07,735 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-14 16:33:07,747 INFO L158 Benchmark]: Toolchain (without parser) took 139696.12ms. Allocated memory was 100.7MB in the beginning and 180.4MB in the end (delta: 79.7MB). Free memory was 67.5MB in the beginning and 111.7MB in the end (delta: -44.2MB). Peak memory consumption was 114.3MB. Max. memory is 16.1GB. [2022-07-14 16:33:07,748 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 100.7MB. Free memory was 54.9MB in the beginning and 54.9MB in the end (delta: 14.1kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-14 16:33:07,748 INFO L158 Benchmark]: CACSL2BoogieTranslator took 186.67ms. Allocated memory is still 100.7MB. Free memory was 67.3MB in the beginning and 75.0MB in the end (delta: -7.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-14 16:33:07,748 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.15ms. Allocated memory is still 100.7MB. Free memory was 74.7MB in the beginning and 73.1MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-14 16:33:07,748 INFO L158 Benchmark]: Boogie Preprocessor took 19.52ms. Allocated memory is still 100.7MB. Free memory was 72.9MB in the beginning and 71.6MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-14 16:33:07,748 INFO L158 Benchmark]: RCFGBuilder took 266.95ms. Allocated memory is still 100.7MB. Free memory was 71.3MB in the beginning and 59.3MB in the end (delta: 12.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-07-14 16:33:07,749 INFO L158 Benchmark]: BuchiAutomizer took 139178.38ms. Allocated memory was 100.7MB in the beginning and 180.4MB in the end (delta: 79.7MB). Free memory was 59.3MB in the beginning and 111.7MB in the end (delta: -52.4MB). Peak memory consumption was 109.0MB. Max. memory is 16.1GB. [2022-07-14 16:33:07,750 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.18ms. Allocated memory is still 100.7MB. Free memory was 54.9MB in the beginning and 54.9MB in the end (delta: 14.1kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 186.67ms. Allocated memory is still 100.7MB. Free memory was 67.3MB in the beginning and 75.0MB in the end (delta: -7.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 26.15ms. Allocated memory is still 100.7MB. Free memory was 74.7MB in the beginning and 73.1MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 19.52ms. Allocated memory is still 100.7MB. Free memory was 72.9MB in the beginning and 71.6MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 266.95ms. Allocated memory is still 100.7MB. Free memory was 71.3MB in the beginning and 59.3MB in the end (delta: 12.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * BuchiAutomizer took 139178.38ms. Allocated memory was 100.7MB in the beginning and 180.4MB in the end (delta: 79.7MB). Free memory was 59.3MB in the beginning and 111.7MB in the end (delta: -52.4MB). Peak memory consumption was 109.0MB. 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-14 16:33:07,775 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-14 16:33:07,984 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Ended with exit code 0 [2022-07-14 16:33:08,184 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Ended with exit code 0 [2022-07-14 16:33:08,384 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2022-07-14 16:33:08,584 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2022-07-14 16:33:08,776 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