./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/reducercommutativity/sep05-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 20ed64ec 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/sep05-1.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 b1dceb134ad462d5f95d7af7b0695951aa1c5481 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.1-dev-20ed64e [2021-08-27 17:35:41,121 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-27 17:35:41,123 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-27 17:35:41,165 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-27 17:35:41,166 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-27 17:35:41,169 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-27 17:35:41,171 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-27 17:35:41,176 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-27 17:35:41,179 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-27 17:35:41,182 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-27 17:35:41,183 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-27 17:35:41,187 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-27 17:35:41,187 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-27 17:35:41,189 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-27 17:35:41,191 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-27 17:35:41,192 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-27 17:35:41,193 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-27 17:35:41,194 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-27 17:35:41,197 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-27 17:35:41,201 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-27 17:35:41,202 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-27 17:35:41,203 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-27 17:35:41,204 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-27 17:35:41,205 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-27 17:35:41,207 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-27 17:35:41,207 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-27 17:35:41,207 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-27 17:35:41,208 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-27 17:35:41,208 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-27 17:35:41,209 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-27 17:35:41,209 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-27 17:35:41,210 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-27 17:35:41,210 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-27 17:35:41,211 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-27 17:35:41,212 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-27 17:35:41,212 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-27 17:35:41,212 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-27 17:35:41,213 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-27 17:35:41,213 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-27 17:35:41,213 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-27 17:35:41,214 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-27 17:35:41,215 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2021-08-27 17:35:41,241 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-27 17:35:41,241 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-27 17:35:41,242 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-27 17:35:41,242 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-27 17:35:41,244 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-27 17:35:41,244 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-27 17:35:41,244 INFO L138 SettingsManager]: * Use SBE=true [2021-08-27 17:35:41,244 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2021-08-27 17:35:41,244 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2021-08-27 17:35:41,244 INFO L138 SettingsManager]: * Use old map elimination=false [2021-08-27 17:35:41,245 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2021-08-27 17:35:41,245 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2021-08-27 17:35:41,246 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2021-08-27 17:35:41,246 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-27 17:35:41,246 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-27 17:35:41,246 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-08-27 17:35:41,246 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-27 17:35:41,247 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-27 17:35:41,247 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-27 17:35:41,247 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2021-08-27 17:35:41,247 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2021-08-27 17:35:41,247 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2021-08-27 17:35:41,247 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-27 17:35:41,248 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-08-27 17:35:41,248 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2021-08-27 17:35:41,248 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-27 17:35:41,248 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2021-08-27 17:35:41,249 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-27 17:35:41,249 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-27 17:35:41,249 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-27 17:35:41,249 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-27 17:35:41,250 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-08-27 17:35:41,251 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-08-27 17:35:41,251 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 -> b1dceb134ad462d5f95d7af7b0695951aa1c5481 [2021-08-27 17:35:41,538 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-27 17:35:41,563 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-27 17:35:41,567 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-27 17:35:41,568 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-27 17:35:41,568 INFO L275 PluginConnector]: CDTParser initialized [2021-08-27 17:35:41,569 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/reducercommutativity/sep05-1.i [2021-08-27 17:35:41,646 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aa6ccd082/402cc13c3cf74511ac2fa47f92a003b4/FLAGb3c2e3a71 [2021-08-27 17:35:42,106 INFO L306 CDTParser]: Found 1 translation units. [2021-08-27 17:35:42,106 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/reducercommutativity/sep05-1.i [2021-08-27 17:35:42,112 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aa6ccd082/402cc13c3cf74511ac2fa47f92a003b4/FLAGb3c2e3a71 [2021-08-27 17:35:42,131 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aa6ccd082/402cc13c3cf74511ac2fa47f92a003b4 [2021-08-27 17:35:42,134 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-27 17:35:42,136 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-08-27 17:35:42,138 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-27 17:35:42,138 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-27 17:35:42,141 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-27 17:35:42,142 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 05:35:42" (1/1) ... [2021-08-27 17:35:42,142 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@29525b2e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:35:42, skipping insertion in model container [2021-08-27 17:35:42,143 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 05:35:42" (1/1) ... [2021-08-27 17:35:42,148 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-27 17:35:42,162 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-27 17:35:42,294 WARN L228 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/sep05-1.i[1287,1300] [2021-08-27 17:35:42,295 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-27 17:35:42,302 INFO L203 MainTranslator]: Completed pre-run [2021-08-27 17:35:42,327 WARN L228 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/sep05-1.i[1287,1300] [2021-08-27 17:35:42,328 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-27 17:35:42,339 INFO L208 MainTranslator]: Completed translation [2021-08-27 17:35:42,339 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:35:42 WrapperNode [2021-08-27 17:35:42,339 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-27 17:35:42,340 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-08-27 17:35:42,341 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-08-27 17:35:42,341 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-08-27 17:35:42,373 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:35:42" (1/1) ... [2021-08-27 17:35:42,384 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:35:42" (1/1) ... [2021-08-27 17:35:42,408 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-08-27 17:35:42,409 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-27 17:35:42,409 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-27 17:35:42,409 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-27 17:35:42,416 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:35:42" (1/1) ... [2021-08-27 17:35:42,416 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:35:42" (1/1) ... [2021-08-27 17:35:42,418 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:35:42" (1/1) ... [2021-08-27 17:35:42,418 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:35:42" (1/1) ... [2021-08-27 17:35:42,424 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:35:42" (1/1) ... [2021-08-27 17:35:42,428 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:35:42" (1/1) ... [2021-08-27 17:35:42,430 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:35:42" (1/1) ... [2021-08-27 17:35:42,432 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-27 17:35:42,432 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-27 17:35:42,433 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-27 17:35:42,433 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-27 17:35:42,433 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:35:42" (1/1) ... [2021-08-27 17:35:42,439 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:35:42,444 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:35:42,458 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) [2021-08-27 17:35:42,467 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 [2021-08-27 17:35:42,497 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-08-27 17:35:42,497 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-27 17:35:42,497 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-08-27 17:35:42,497 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-27 17:35:42,497 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-27 17:35:42,498 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-08-27 17:35:42,498 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-08-27 17:35:42,854 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-27 17:35:42,855 INFO L299 CfgBuilder]: Removed 15 assume(true) statements. [2021-08-27 17:35:42,856 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 05:35:42 BoogieIcfgContainer [2021-08-27 17:35:42,856 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-27 17:35:42,857 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2021-08-27 17:35:42,857 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2021-08-27 17:35:42,859 INFO L275 PluginConnector]: BuchiAutomizer initialized [2021-08-27 17:35:42,860 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-08-27 17:35:42,860 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 27.08 05:35:42" (1/3) ... [2021-08-27 17:35:42,861 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@80cd134 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 27.08 05:35:42, skipping insertion in model container [2021-08-27 17:35:42,861 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-08-27 17:35:42,861 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:35:42" (2/3) ... [2021-08-27 17:35:42,861 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@80cd134 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 27.08 05:35:42, skipping insertion in model container [2021-08-27 17:35:42,861 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-08-27 17:35:42,861 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 05:35:42" (3/3) ... [2021-08-27 17:35:42,862 INFO L389 chiAutomizerObserver]: Analyzing ICFG sep05-1.i [2021-08-27 17:35:42,896 INFO L359 BuchiCegarLoop]: Interprodecural is true [2021-08-27 17:35:42,897 INFO L360 BuchiCegarLoop]: Hoare is false [2021-08-27 17:35:42,897 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2021-08-27 17:35:42,897 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2021-08-27 17:35:42,897 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-08-27 17:35:42,897 INFO L364 BuchiCegarLoop]: Difference is false [2021-08-27 17:35:42,897 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-08-27 17:35:42,897 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2021-08-27 17:35:42,910 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 28 states, 27 states have (on average 1.5185185185185186) internal successors, (41), 27 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) [2021-08-27 17:35:42,924 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 13 [2021-08-27 17:35:42,924 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 17:35:42,924 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 17:35:42,929 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-08-27 17:35:42,929 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-08-27 17:35:42,929 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2021-08-27 17:35:42,930 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 28 states, 27 states have (on average 1.5185185185185186) internal successors, (41), 27 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) [2021-08-27 17:35:42,932 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 13 [2021-08-27 17:35:42,932 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 17:35:42,932 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 17:35:42,932 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-08-27 17:35:42,932 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-08-27 17:35:42,938 INFO L791 eck$LassoCheckResult]: Stem: 19#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(10); 6#L-1true havoc main_#res;havoc main_#t~nondet8, main_#t~post7, main_~i~1, main_#t~ret9, main_#t~mem10, main_#t~mem11, main_#t~ret12, main_#t~mem13, main_#t~mem15, main_#t~post14, main_~i~2, main_#t~ret16, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 27#L37-3true [2021-08-27 17:35:42,938 INFO L793 eck$LassoCheckResult]: Loop: 27#L37-3true assume !!(main_~i~1 < 5);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 18#L37-2true main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 27#L37-3true [2021-08-27 17:35:42,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:35:42,943 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2021-08-27 17:35:42,950 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:35:42,950 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115900505] [2021-08-27 17:35:42,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:35:42,951 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:35:43,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:35:43,044 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 17:35:43,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:35:43,091 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 17:35:43,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:35:43,101 INFO L82 PathProgramCache]: Analyzing trace with hash 1283, now seen corresponding path program 1 times [2021-08-27 17:35:43,101 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:35:43,103 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136916079] [2021-08-27 17:35:43,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:35:43,103 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:35:43,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:35:43,122 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 17:35:43,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:35:43,134 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 17:35:43,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:35:43,139 INFO L82 PathProgramCache]: Analyzing trace with hash 925765, now seen corresponding path program 1 times [2021-08-27 17:35:43,139 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:35:43,140 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774711517] [2021-08-27 17:35:43,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:35:43,140 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:35:43,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:35:43,161 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 17:35:43,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:35:43,192 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 17:35:43,581 INFO L210 LassoAnalysis]: Preferences: [2021-08-27 17:35:43,581 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-08-27 17:35:43,582 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-08-27 17:35:43,582 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-08-27 17:35:43,582 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-08-27 17:35:43,582 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:35:43,582 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-08-27 17:35:43,582 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-08-27 17:35:43,582 INFO L133 ssoRankerPreferences]: Filename of dumped script: sep05-1.i_Iteration1_Lasso [2021-08-27 17:35:43,583 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-08-27 17:35:43,583 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-08-27 17:35:43,599 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:35:43,767 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:35:43,771 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:35:43,773 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:35:43,778 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:35:43,781 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:35:43,784 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:35:43,787 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:35:43,790 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:35:43,793 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:35:43,795 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:35:43,800 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:35:43,802 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:35:43,805 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:35:43,807 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:35:43,810 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:35:43,812 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:35:43,814 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:35:43,817 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:35:44,077 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-08-27 17:35:44,081 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-08-27 17:35:44,082 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:35:44,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:35:44,084 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) [2021-08-27 17:35:44,094 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 [2021-08-27 17:35:44,094 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 [2021-08-27 17:35:44,101 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:35:44,102 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:35:44,102 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:35:44,102 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:35:44,108 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 17:35:44,108 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 17:35:44,125 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:35:44,152 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2021-08-27 17:35:44,153 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:35:44,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:35:44,154 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) [2021-08-27 17:35:44,159 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 [2021-08-27 17:35:44,159 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 [2021-08-27 17:35:44,166 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:35:44,167 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 17:35:44,167 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:35:44,167 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:35:44,167 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:35:44,169 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 17:35:44,169 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 17:35:44,184 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:35:44,210 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 [2021-08-27 17:35:44,211 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:35:44,211 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:35:44,212 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) [2021-08-27 17:35:44,220 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 [2021-08-27 17:35:44,228 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:35:44,228 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:35:44,228 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:35:44,228 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:35:44,233 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 17:35:44,233 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 17:35:44,238 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 [2021-08-27 17:35:44,256 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:35:44,279 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 [2021-08-27 17:35:44,279 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:35:44,280 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:35:44,281 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) [2021-08-27 17:35:44,292 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 [2021-08-27 17:35:44,299 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:35:44,299 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:35:44,299 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:35:44,299 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:35:44,304 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 17:35:44,304 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 17:35:44,308 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 [2021-08-27 17:35:44,308 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:35:44,333 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 [2021-08-27 17:35:44,334 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:35:44,334 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:35:44,335 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) [2021-08-27 17:35:44,337 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 [2021-08-27 17:35:44,338 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 [2021-08-27 17:35:44,345 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:35:44,345 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:35:44,345 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:35:44,346 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:35:44,351 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 17:35:44,351 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 17:35:44,372 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:35:44,399 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 [2021-08-27 17:35:44,400 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:35:44,400 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:35:44,401 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) [2021-08-27 17:35:44,402 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 [2021-08-27 17:35:44,403 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 [2021-08-27 17:35:44,410 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:35:44,410 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:35:44,410 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:35:44,411 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:35:44,416 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 17:35:44,416 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 17:35:44,436 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-08-27 17:35:44,460 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2021-08-27 17:35:44,460 INFO L444 ModelExtractionUtils]: 0 out of 13 variables were initially zero. Simplification set additionally 10 variables to zero. [2021-08-27 17:35:44,462 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:35:44,462 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:35:44,465 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) [2021-08-27 17:35:44,467 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 [2021-08-27 17:35:44,468 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-08-27 17:35:44,501 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2021-08-27 17:35:44,501 INFO L513 LassoAnalysis]: Proved termination. [2021-08-27 17:35:44,502 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~1, v_rep(select #length ULTIMATE.start_main_~#x~0.base)_1) = -8*ULTIMATE.start_main_~i~1 + 9*v_rep(select #length ULTIMATE.start_main_~#x~0.base)_1 Supporting invariants [] [2021-08-27 17:35:44,527 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 [2021-08-27 17:35:44,542 INFO L297 tatePredicateManager]: 7 out of 7 supporting invariants were superfluous and have been removed [2021-08-27 17:35:44,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:35:44,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 17:35:44,576 INFO L263 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 2 conjunts are in the unsatisfiable core [2021-08-27 17:35:44,577 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 17:35:44,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 17:35:44,615 WARN L261 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 6 conjunts are in the unsatisfiable core [2021-08-27 17:35:44,615 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 17:35:44,647 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 17:35:44,658 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 [2021-08-27 17:35:44,660 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 28 states, 27 states have (on average 1.5185185185185186) internal successors, (41), 27 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) 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) [2021-08-27 17:35:44,683 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 [2021-08-27 17:35:44,742 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 28 states, 27 states have (on average 1.5185185185185186) internal successors, (41), 27 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). 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 75 states and 110 transitions. Complement of second has 8 states. [2021-08-27 17:35:44,743 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 [2021-08-27 17:35:44,744 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) [2021-08-27 17:35:44,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 73 transitions. [2021-08-27 17:35:44,746 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 73 transitions. Stem has 2 letters. Loop has 2 letters. [2021-08-27 17:35:44,747 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-27 17:35:44,747 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 73 transitions. Stem has 4 letters. Loop has 2 letters. [2021-08-27 17:35:44,747 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-27 17:35:44,747 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 73 transitions. Stem has 2 letters. Loop has 4 letters. [2021-08-27 17:35:44,747 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-27 17:35:44,748 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 75 states and 110 transitions. [2021-08-27 17:35:44,752 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2021-08-27 17:35:44,754 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 75 states to 22 states and 30 transitions. [2021-08-27 17:35:44,755 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2021-08-27 17:35:44,755 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2021-08-27 17:35:44,756 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 30 transitions. [2021-08-27 17:35:44,756 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 17:35:44,756 INFO L681 BuchiCegarLoop]: Abstraction has 22 states and 30 transitions. [2021-08-27 17:35:44,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 30 transitions. [2021-08-27 17:35:44,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2021-08-27 17:35:44,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 21 states have internal predecessors, (30), 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) [2021-08-27 17:35:44,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 30 transitions. [2021-08-27 17:35:44,776 INFO L704 BuchiCegarLoop]: Abstraction has 22 states and 30 transitions. [2021-08-27 17:35:44,776 INFO L587 BuchiCegarLoop]: Abstraction has 22 states and 30 transitions. [2021-08-27 17:35:44,777 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2021-08-27 17:35:44,777 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 30 transitions. [2021-08-27 17:35:44,777 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2021-08-27 17:35:44,777 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 17:35:44,777 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 17:35:44,778 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2021-08-27 17:35:44,778 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-08-27 17:35:44,778 INFO L791 eck$LassoCheckResult]: Stem: 173#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(10); 174#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~post7, main_~i~1, main_#t~ret9, main_#t~mem10, main_#t~mem11, main_#t~ret12, main_#t~mem13, main_#t~mem15, main_#t~post14, main_~i~2, main_#t~ret16, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 182#L37-3 assume !(main_~i~1 < 5); 187#L37-4 sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem4, sep_#t~post5, sep_#t~post6, sep_#t~post3, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; 188#L18-3 [2021-08-27 17:35:44,778 INFO L793 eck$LassoCheckResult]: Loop: 188#L18-3 assume !!(sep_~i~0 < 5);call sep_#t~mem4 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 191#L20 assume 0 == (if sep_#t~mem4 < 0 && 0 != sep_#t~mem4 % 2 then sep_#t~mem4 % 2 - 2 else sep_#t~mem4 % 2);havoc sep_#t~mem4;sep_#t~post5 := sep_~ret~0;sep_~ret~0 := 1 + sep_#t~post5;havoc sep_#t~post5; 189#L18-2 sep_#t~post3 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post3;havoc sep_#t~post3; 188#L18-3 [2021-08-27 17:35:44,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:35:44,779 INFO L82 PathProgramCache]: Analyzing trace with hash 925707, now seen corresponding path program 1 times [2021-08-27 17:35:44,779 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:35:44,779 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464101686] [2021-08-27 17:35:44,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:35:44,779 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:35:44,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 17:35:44,814 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 17:35:44,814 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 17:35:44,814 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464101686] [2021-08-27 17:35:44,815 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [464101686] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 17:35:44,815 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 17:35:44,815 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-27 17:35:44,818 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189039341] [2021-08-27 17:35:44,821 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-27 17:35:44,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:35:44,821 INFO L82 PathProgramCache]: Analyzing trace with hash 53723, now seen corresponding path program 1 times [2021-08-27 17:35:44,822 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:35:44,822 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74732791] [2021-08-27 17:35:44,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:35:44,822 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:35:44,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:35:44,839 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 17:35:44,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:35:44,850 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 17:35:44,931 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 17:35:44,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-27 17:35:44,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 17:35:44,935 INFO L87 Difference]: Start difference. First operand 22 states and 30 transitions. cyclomatic complexity: 13 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) [2021-08-27 17:35:44,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 17:35:44,954 INFO L93 Difference]: Finished difference Result 23 states and 30 transitions. [2021-08-27 17:35:44,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-27 17:35:44,955 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 30 transitions. [2021-08-27 17:35:44,956 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2021-08-27 17:35:44,959 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 23 states and 30 transitions. [2021-08-27 17:35:44,959 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2021-08-27 17:35:44,960 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2021-08-27 17:35:44,960 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 30 transitions. [2021-08-27 17:35:44,960 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 17:35:44,960 INFO L681 BuchiCegarLoop]: Abstraction has 23 states and 30 transitions. [2021-08-27 17:35:44,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 30 transitions. [2021-08-27 17:35:44,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2021-08-27 17:35:44,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 21 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) [2021-08-27 17:35:44,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 29 transitions. [2021-08-27 17:35:44,964 INFO L704 BuchiCegarLoop]: Abstraction has 22 states and 29 transitions. [2021-08-27 17:35:44,964 INFO L587 BuchiCegarLoop]: Abstraction has 22 states and 29 transitions. [2021-08-27 17:35:44,964 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2021-08-27 17:35:44,964 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 29 transitions. [2021-08-27 17:35:44,967 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2021-08-27 17:35:44,967 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 17:35:44,967 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 17:35:44,967 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2021-08-27 17:35:44,968 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-08-27 17:35:44,968 INFO L791 eck$LassoCheckResult]: Stem: 224#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(10); 225#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~post7, main_~i~1, main_#t~ret9, main_#t~mem10, main_#t~mem11, main_#t~ret12, main_#t~mem13, main_#t~mem15, main_#t~post14, main_~i~2, main_#t~ret16, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 233#L37-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 222#L37-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 223#L37-3 assume !(main_~i~1 < 5); 238#L37-4 sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem4, sep_#t~post5, sep_#t~post6, sep_#t~post3, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; 239#L18-3 [2021-08-27 17:35:44,968 INFO L793 eck$LassoCheckResult]: Loop: 239#L18-3 assume !!(sep_~i~0 < 5);call sep_#t~mem4 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 242#L20 assume 0 == (if sep_#t~mem4 < 0 && 0 != sep_#t~mem4 % 2 then sep_#t~mem4 % 2 - 2 else sep_#t~mem4 % 2);havoc sep_#t~mem4;sep_#t~post5 := sep_~ret~0;sep_~ret~0 := 1 + sep_#t~post5;havoc sep_#t~post5; 240#L18-2 sep_#t~post3 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post3;havoc sep_#t~post3; 239#L18-3 [2021-08-27 17:35:44,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:35:44,968 INFO L82 PathProgramCache]: Analyzing trace with hash 889660429, now seen corresponding path program 1 times [2021-08-27 17:35:44,969 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:35:44,969 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715433917] [2021-08-27 17:35:44,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:35:44,969 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:35:44,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 17:35:45,021 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 17:35:45,022 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 17:35:45,022 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715433917] [2021-08-27 17:35:45,023 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1715433917] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 17:35:45,023 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1545384409] [2021-08-27 17:35:45,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:35:45,024 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 17:35:45,024 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:35:45,029 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 17:35:45,034 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-08-27 17:35:45,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 17:35:45,080 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 3 conjunts are in the unsatisfiable core [2021-08-27 17:35:45,080 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 17:35:45,103 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 17:35:45,103 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1545384409] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 17:35:45,103 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 17:35:45,103 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2021-08-27 17:35:45,104 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918287799] [2021-08-27 17:35:45,104 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-27 17:35:45,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:35:45,104 INFO L82 PathProgramCache]: Analyzing trace with hash 53723, now seen corresponding path program 2 times [2021-08-27 17:35:45,105 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:35:45,105 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585611380] [2021-08-27 17:35:45,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:35:45,105 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:35:45,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:35:45,111 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 17:35:45,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:35:45,117 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 17:35:45,168 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 17:35:45,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-27 17:35:45,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-08-27 17:35:45,169 INFO L87 Difference]: Start difference. First operand 22 states and 29 transitions. cyclomatic complexity: 12 Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 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) [2021-08-27 17:35:45,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 17:35:45,183 INFO L93 Difference]: Finished difference Result 25 states and 32 transitions. [2021-08-27 17:35:45,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 17:35:45,184 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 32 transitions. [2021-08-27 17:35:45,185 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2021-08-27 17:35:45,185 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 25 states and 32 transitions. [2021-08-27 17:35:45,185 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2021-08-27 17:35:45,185 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2021-08-27 17:35:45,186 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 32 transitions. [2021-08-27 17:35:45,186 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 17:35:45,186 INFO L681 BuchiCegarLoop]: Abstraction has 25 states and 32 transitions. [2021-08-27 17:35:45,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 32 transitions. [2021-08-27 17:35:45,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2021-08-27 17:35:45,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 23 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 17:35:45,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 31 transitions. [2021-08-27 17:35:45,188 INFO L704 BuchiCegarLoop]: Abstraction has 24 states and 31 transitions. [2021-08-27 17:35:45,188 INFO L587 BuchiCegarLoop]: Abstraction has 24 states and 31 transitions. [2021-08-27 17:35:45,188 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2021-08-27 17:35:45,189 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 31 transitions. [2021-08-27 17:35:45,189 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2021-08-27 17:35:45,189 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 17:35:45,189 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 17:35:45,190 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1] [2021-08-27 17:35:45,190 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-08-27 17:35:45,190 INFO L791 eck$LassoCheckResult]: Stem: 294#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(10); 295#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~post7, main_~i~1, main_#t~ret9, main_#t~mem10, main_#t~mem11, main_#t~ret12, main_#t~mem13, main_#t~mem15, main_#t~post14, main_~i~2, main_#t~ret16, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 303#L37-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 292#L37-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 293#L37-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 314#L37-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 315#L37-3 assume !(main_~i~1 < 5); 308#L37-4 sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem4, sep_#t~post5, sep_#t~post6, sep_#t~post3, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; 309#L18-3 [2021-08-27 17:35:45,190 INFO L793 eck$LassoCheckResult]: Loop: 309#L18-3 assume !!(sep_~i~0 < 5);call sep_#t~mem4 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 312#L20 assume 0 == (if sep_#t~mem4 < 0 && 0 != sep_#t~mem4 % 2 then sep_#t~mem4 % 2 - 2 else sep_#t~mem4 % 2);havoc sep_#t~mem4;sep_#t~post5 := sep_~ret~0;sep_~ret~0 := 1 + sep_#t~post5;havoc sep_#t~post5; 310#L18-2 sep_#t~post3 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post3;havoc sep_#t~post3; 309#L18-3 [2021-08-27 17:35:45,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:35:45,191 INFO L82 PathProgramCache]: Analyzing trace with hash 265236367, now seen corresponding path program 2 times [2021-08-27 17:35:45,191 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:35:45,191 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298299704] [2021-08-27 17:35:45,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:35:45,191 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:35:45,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 17:35:45,223 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 17:35:45,224 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 17:35:45,224 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298299704] [2021-08-27 17:35:45,224 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [298299704] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 17:35:45,224 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [113231361] [2021-08-27 17:35:45,224 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-08-27 17:35:45,225 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 17:35:45,225 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:35:45,226 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 17:35:45,260 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-08-27 17:35:45,285 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-08-27 17:35:45,286 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-27 17:35:45,286 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 4 conjunts are in the unsatisfiable core [2021-08-27 17:35:45,289 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 17:35:45,325 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 17:35:45,325 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [113231361] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 17:35:45,325 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 17:35:45,325 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2021-08-27 17:35:45,325 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000961011] [2021-08-27 17:35:45,326 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-27 17:35:45,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:35:45,326 INFO L82 PathProgramCache]: Analyzing trace with hash 53723, now seen corresponding path program 3 times [2021-08-27 17:35:45,326 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:35:45,326 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377654485] [2021-08-27 17:35:45,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:35:45,327 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:35:45,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:35:45,340 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 17:35:45,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:35:45,354 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 17:35:45,427 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 17:35:45,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-27 17:35:45,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-08-27 17:35:45,428 INFO L87 Difference]: Start difference. First operand 24 states and 31 transitions. cyclomatic complexity: 12 Second operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 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) [2021-08-27 17:35:45,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 17:35:45,452 INFO L93 Difference]: Finished difference Result 27 states and 34 transitions. [2021-08-27 17:35:45,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-27 17:35:45,453 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 34 transitions. [2021-08-27 17:35:45,456 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2021-08-27 17:35:45,457 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 27 states and 34 transitions. [2021-08-27 17:35:45,457 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2021-08-27 17:35:45,457 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2021-08-27 17:35:45,457 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 34 transitions. [2021-08-27 17:35:45,458 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 17:35:45,458 INFO L681 BuchiCegarLoop]: Abstraction has 27 states and 34 transitions. [2021-08-27 17:35:45,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 34 transitions. [2021-08-27 17:35:45,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2021-08-27 17:35:45,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 25 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 17:35:45,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 33 transitions. [2021-08-27 17:35:45,460 INFO L704 BuchiCegarLoop]: Abstraction has 26 states and 33 transitions. [2021-08-27 17:35:45,460 INFO L587 BuchiCegarLoop]: Abstraction has 26 states and 33 transitions. [2021-08-27 17:35:45,460 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2021-08-27 17:35:45,460 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 33 transitions. [2021-08-27 17:35:45,465 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2021-08-27 17:35:45,465 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 17:35:45,465 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 17:35:45,466 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 1, 1, 1, 1] [2021-08-27 17:35:45,466 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-08-27 17:35:45,466 INFO L791 eck$LassoCheckResult]: Stem: 375#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(10); 376#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~post7, main_~i~1, main_#t~ret9, main_#t~mem10, main_#t~mem11, main_#t~ret12, main_#t~mem13, main_#t~mem15, main_#t~post14, main_~i~2, main_#t~ret16, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 384#L37-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 373#L37-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 374#L37-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 395#L37-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 398#L37-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 397#L37-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 396#L37-3 assume !(main_~i~1 < 5); 389#L37-4 sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem4, sep_#t~post5, sep_#t~post6, sep_#t~post3, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; 390#L18-3 [2021-08-27 17:35:45,466 INFO L793 eck$LassoCheckResult]: Loop: 390#L18-3 assume !!(sep_~i~0 < 5);call sep_#t~mem4 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 393#L20 assume 0 == (if sep_#t~mem4 < 0 && 0 != sep_#t~mem4 % 2 then sep_#t~mem4 % 2 - 2 else sep_#t~mem4 % 2);havoc sep_#t~mem4;sep_#t~post5 := sep_~ret~0;sep_~ret~0 := 1 + sep_#t~post5;havoc sep_#t~post5; 391#L18-2 sep_#t~post3 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post3;havoc sep_#t~post3; 390#L18-3 [2021-08-27 17:35:45,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:35:45,467 INFO L82 PathProgramCache]: Analyzing trace with hash 1489134225, now seen corresponding path program 3 times [2021-08-27 17:35:45,467 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:35:45,468 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195643492] [2021-08-27 17:35:45,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:35:45,468 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:35:45,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 17:35:45,526 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 17:35:45,527 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 17:35:45,527 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195643492] [2021-08-27 17:35:45,527 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [195643492] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 17:35:45,527 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1976845695] [2021-08-27 17:35:45,527 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-08-27 17:35:45,527 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 17:35:45,528 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:35:45,529 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 17:35:45,532 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2021-08-27 17:35:45,596 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2021-08-27 17:35:45,596 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-27 17:35:45,597 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 5 conjunts are in the unsatisfiable core [2021-08-27 17:35:45,597 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 17:35:45,633 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 17:35:45,633 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1976845695] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 17:35:45,633 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 17:35:45,634 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2021-08-27 17:35:45,634 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099039523] [2021-08-27 17:35:45,634 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-27 17:35:45,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:35:45,635 INFO L82 PathProgramCache]: Analyzing trace with hash 53723, now seen corresponding path program 4 times [2021-08-27 17:35:45,635 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:35:45,635 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543626289] [2021-08-27 17:35:45,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:35:45,635 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:35:45,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:35:45,640 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 17:35:45,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:35:45,644 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 17:35:45,693 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 17:35:45,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-27 17:35:45,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2021-08-27 17:35:45,694 INFO L87 Difference]: Start difference. First operand 26 states and 33 transitions. cyclomatic complexity: 12 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) [2021-08-27 17:35:45,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 17:35:45,715 INFO L93 Difference]: Finished difference Result 29 states and 36 transitions. [2021-08-27 17:35:45,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-27 17:35:45,716 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 36 transitions. [2021-08-27 17:35:45,716 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2021-08-27 17:35:45,717 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 29 states and 36 transitions. [2021-08-27 17:35:45,717 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2021-08-27 17:35:45,718 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2021-08-27 17:35:45,718 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 36 transitions. [2021-08-27 17:35:45,718 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 17:35:45,719 INFO L681 BuchiCegarLoop]: Abstraction has 29 states and 36 transitions. [2021-08-27 17:35:45,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 36 transitions. [2021-08-27 17:35:45,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2021-08-27 17:35:45,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 28 states have (on average 1.25) internal successors, (35), 27 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) [2021-08-27 17:35:45,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 35 transitions. [2021-08-27 17:35:45,727 INFO L704 BuchiCegarLoop]: Abstraction has 28 states and 35 transitions. [2021-08-27 17:35:45,727 INFO L587 BuchiCegarLoop]: Abstraction has 28 states and 35 transitions. [2021-08-27 17:35:45,727 INFO L425 BuchiCegarLoop]: ======== Iteration 6============ [2021-08-27 17:35:45,728 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 35 transitions. [2021-08-27 17:35:45,730 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2021-08-27 17:35:45,730 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 17:35:45,730 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 17:35:45,730 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 1, 1, 1, 1] [2021-08-27 17:35:45,730 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-08-27 17:35:45,731 INFO L791 eck$LassoCheckResult]: Stem: 467#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(10); 468#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~post7, main_~i~1, main_#t~ret9, main_#t~mem10, main_#t~mem11, main_#t~ret12, main_#t~mem13, main_#t~mem15, main_#t~post14, main_~i~2, main_#t~ret16, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 476#L37-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 487#L37-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 488#L37-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 465#L37-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 466#L37-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 492#L37-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 491#L37-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 490#L37-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 489#L37-3 assume !(main_~i~1 < 5); 481#L37-4 sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem4, sep_#t~post5, sep_#t~post6, sep_#t~post3, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; 482#L18-3 [2021-08-27 17:35:45,731 INFO L793 eck$LassoCheckResult]: Loop: 482#L18-3 assume !!(sep_~i~0 < 5);call sep_#t~mem4 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 485#L20 assume 0 == (if sep_#t~mem4 < 0 && 0 != sep_#t~mem4 % 2 then sep_#t~mem4 % 2 - 2 else sep_#t~mem4 % 2);havoc sep_#t~mem4;sep_#t~post5 := sep_~ret~0;sep_~ret~0 := 1 + sep_#t~post5;havoc sep_#t~post5; 483#L18-2 sep_#t~post3 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post3;havoc sep_#t~post3; 482#L18-3 [2021-08-27 17:35:45,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:35:45,731 INFO L82 PathProgramCache]: Analyzing trace with hash 833936659, now seen corresponding path program 4 times [2021-08-27 17:35:45,732 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:35:45,732 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930804212] [2021-08-27 17:35:45,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:35:45,732 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:35:45,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 17:35:45,778 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 17:35:45,779 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 17:35:45,779 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930804212] [2021-08-27 17:35:45,779 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [930804212] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 17:35:45,779 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [606048530] [2021-08-27 17:35:45,780 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-08-27 17:35:45,780 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 17:35:45,780 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:35:45,781 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 17:35:45,809 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2021-08-27 17:35:45,853 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-08-27 17:35:45,853 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-27 17:35:45,854 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 6 conjunts are in the unsatisfiable core [2021-08-27 17:35:45,854 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 17:35:45,899 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 17:35:45,900 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [606048530] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 17:35:45,900 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 17:35:45,900 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2021-08-27 17:35:45,900 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337948030] [2021-08-27 17:35:45,901 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-27 17:35:45,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:35:45,901 INFO L82 PathProgramCache]: Analyzing trace with hash 53723, now seen corresponding path program 5 times [2021-08-27 17:35:45,901 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:35:45,901 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377828749] [2021-08-27 17:35:45,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:35:45,902 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:35:45,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:35:45,906 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 17:35:45,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:35:45,910 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 17:35:46,000 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 17:35:46,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-08-27 17:35:46,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2021-08-27 17:35:46,002 INFO L87 Difference]: Start difference. First operand 28 states and 35 transitions. cyclomatic complexity: 12 Second operand has 8 states, 8 states have (on average 1.875) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 17:35:46,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 17:35:46,022 INFO L93 Difference]: Finished difference Result 30 states and 37 transitions. [2021-08-27 17:35:46,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-27 17:35:46,023 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 37 transitions. [2021-08-27 17:35:46,024 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2021-08-27 17:35:46,024 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 30 states and 37 transitions. [2021-08-27 17:35:46,024 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2021-08-27 17:35:46,024 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2021-08-27 17:35:46,024 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 37 transitions. [2021-08-27 17:35:46,025 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 17:35:46,025 INFO L681 BuchiCegarLoop]: Abstraction has 30 states and 37 transitions. [2021-08-27 17:35:46,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 37 transitions. [2021-08-27 17:35:46,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2021-08-27 17:35:46,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 29 states have internal predecessors, (37), 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) [2021-08-27 17:35:46,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2021-08-27 17:35:46,026 INFO L704 BuchiCegarLoop]: Abstraction has 30 states and 37 transitions. [2021-08-27 17:35:46,027 INFO L587 BuchiCegarLoop]: Abstraction has 30 states and 37 transitions. [2021-08-27 17:35:46,027 INFO L425 BuchiCegarLoop]: ======== Iteration 7============ [2021-08-27 17:35:46,027 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 37 transitions. [2021-08-27 17:35:46,027 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2021-08-27 17:35:46,027 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 17:35:46,027 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 17:35:46,028 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 1, 1, 1, 1] [2021-08-27 17:35:46,028 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-08-27 17:35:46,028 INFO L791 eck$LassoCheckResult]: Stem: 569#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(10); 570#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~post7, main_~i~1, main_#t~ret9, main_#t~mem10, main_#t~mem11, main_#t~ret12, main_#t~mem13, main_#t~mem15, main_#t~post14, main_~i~2, main_#t~ret16, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 578#L37-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 567#L37-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 568#L37-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 589#L37-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 596#L37-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 595#L37-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 594#L37-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 593#L37-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 592#L37-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 591#L37-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 590#L37-3 assume !(main_~i~1 < 5); 583#L37-4 sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem4, sep_#t~post5, sep_#t~post6, sep_#t~post3, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; 584#L18-3 [2021-08-27 17:35:46,028 INFO L793 eck$LassoCheckResult]: Loop: 584#L18-3 assume !!(sep_~i~0 < 5);call sep_#t~mem4 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 587#L20 assume 0 == (if sep_#t~mem4 < 0 && 0 != sep_#t~mem4 % 2 then sep_#t~mem4 % 2 - 2 else sep_#t~mem4 % 2);havoc sep_#t~mem4;sep_#t~post5 := sep_~ret~0;sep_~ret~0 := 1 + sep_#t~post5;havoc sep_#t~post5; 585#L18-2 sep_#t~post3 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post3;havoc sep_#t~post3; 584#L18-3 [2021-08-27 17:35:46,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:35:46,031 INFO L82 PathProgramCache]: Analyzing trace with hash -1745699051, now seen corresponding path program 5 times [2021-08-27 17:35:46,031 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:35:46,032 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956054222] [2021-08-27 17:35:46,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:35:46,032 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:35:46,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:35:46,043 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 17:35:46,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:35:46,072 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 17:35:46,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:35:46,073 INFO L82 PathProgramCache]: Analyzing trace with hash 53723, now seen corresponding path program 6 times [2021-08-27 17:35:46,073 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:35:46,073 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716871742] [2021-08-27 17:35:46,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:35:46,073 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:35:46,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:35:46,077 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 17:35:46,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:35:46,092 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 17:35:46,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:35:46,093 INFO L82 PathProgramCache]: Analyzing trace with hash 1638582855, now seen corresponding path program 1 times [2021-08-27 17:35:46,093 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:35:46,093 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388926327] [2021-08-27 17:35:46,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:35:46,093 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:35:46,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:35:46,128 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 17:35:46,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:35:46,163 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 17:35:47,255 INFO L210 LassoAnalysis]: Preferences: [2021-08-27 17:35:47,255 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-08-27 17:35:47,255 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-08-27 17:35:47,255 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-08-27 17:35:47,255 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-08-27 17:35:47,255 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:35:47,255 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-08-27 17:35:47,255 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-08-27 17:35:47,255 INFO L133 ssoRankerPreferences]: Filename of dumped script: sep05-1.i_Iteration7_Lasso [2021-08-27 17:35:47,255 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-08-27 17:35:47,255 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-08-27 17:35:47,259 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:35:47,262 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:35:47,265 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:35:47,268 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:35:47,271 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:35:47,273 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:35:47,275 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:35:47,279 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:35:47,281 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:35:47,283 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:35:47,286 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:35:47,289 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:35:47,292 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:35:47,294 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:35:47,296 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:35:47,298 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:35:47,300 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:35:47,303 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:35:47,511 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:35:47,513 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:35:47,515 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:35:47,517 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:35:47,519 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:35:47,522 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:35:47,524 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:35:47,526 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:35:47,835 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-08-27 17:35:47,835 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-08-27 17:35:47,835 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:35:47,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:35:47,842 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) [2021-08-27 17:35:47,843 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 [2021-08-27 17:35:47,844 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 [2021-08-27 17:35:47,849 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:35:47,849 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 17:35:47,849 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:35:47,850 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:35:47,850 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:35:47,850 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 17:35:47,850 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 17:35:47,851 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:35:47,876 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2021-08-27 17:35:47,876 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:35:47,876 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:35:47,885 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) [2021-08-27 17:35:47,900 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 [2021-08-27 17:35:47,906 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:35:47,906 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 17:35:47,906 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:35:47,907 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:35:47,907 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:35:47,907 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 17:35:47,907 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 17:35:47,910 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 [2021-08-27 17:35:47,919 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:35:47,938 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 [2021-08-27 17:35:47,938 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:35:47,938 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:35:47,939 INFO L229 MonitoredProcess]: Starting monitored process 15 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) [2021-08-27 17:35:47,939 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2021-08-27 17:35:47,941 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 [2021-08-27 17:35:47,947 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:35:47,947 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:35:47,947 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:35:47,947 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:35:47,948 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 17:35:47,948 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 17:35:47,959 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:35:47,974 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2021-08-27 17:35:47,975 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:35:47,975 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:35:47,976 INFO L229 MonitoredProcess]: Starting monitored process 16 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) [2021-08-27 17:35:47,981 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2021-08-27 17:35:47,986 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 [2021-08-27 17:35:47,992 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:35:47,992 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 17:35:47,992 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:35:47,992 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:35:47,993 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:35:47,993 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 17:35:47,993 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 17:35:48,006 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:35:48,022 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2021-08-27 17:35:48,023 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:35:48,023 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:35:48,024 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) [2021-08-27 17:35:48,025 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 [2021-08-27 17:35:48,026 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 [2021-08-27 17:35:48,032 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:35:48,032 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 17:35:48,032 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:35:48,032 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:35:48,032 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:35:48,032 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 17:35:48,032 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 17:35:48,033 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:35:48,050 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 [2021-08-27 17:35:48,051 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:35:48,051 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:35:48,052 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) [2021-08-27 17:35:48,055 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 [2021-08-27 17:35:48,056 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 [2021-08-27 17:35:48,062 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:35:48,062 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 17:35:48,062 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:35:48,062 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:35:48,062 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:35:48,063 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 17:35:48,063 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 17:35:48,064 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:35:48,079 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 [2021-08-27 17:35:48,079 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:35:48,079 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:35:48,105 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) [2021-08-27 17:35:48,106 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 [2021-08-27 17:35:48,108 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 [2021-08-27 17:35:48,115 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:35:48,115 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:35:48,115 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:35:48,115 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:35:48,130 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 17:35:48,131 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 17:35:48,145 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:35:48,163 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 [2021-08-27 17:35:48,163 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:35:48,163 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:35:48,164 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) [2021-08-27 17:35:48,167 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 [2021-08-27 17:35:48,168 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 [2021-08-27 17:35:48,173 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:35:48,173 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 17:35:48,173 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:35:48,174 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:35:48,174 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:35:48,174 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 17:35:48,174 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 17:35:48,179 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:35:48,196 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 [2021-08-27 17:35:48,196 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:35:48,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:35:48,196 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) [2021-08-27 17:35:48,198 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 [2021-08-27 17:35:48,199 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 17:35:48,205 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:35:48,205 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 17:35:48,205 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:35:48,205 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:35:48,205 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:35:48,205 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 17:35:48,206 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 17:35:48,206 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:35:48,221 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 [2021-08-27 17:35:48,222 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:35:48,222 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:35:48,222 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) [2021-08-27 17:35:48,224 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 [2021-08-27 17:35:48,225 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 [2021-08-27 17:35:48,230 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:35:48,230 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:35:48,230 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:35:48,230 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:35:48,232 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 17:35:48,232 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 17:35:48,256 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:35:48,290 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 [2021-08-27 17:35:48,290 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:35:48,290 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:35:48,291 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) [2021-08-27 17:35:48,297 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 [2021-08-27 17:35:48,297 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 [2021-08-27 17:35:48,304 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:35:48,304 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 17:35:48,304 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:35:48,304 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:35:48,304 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:35:48,304 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 17:35:48,304 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 17:35:48,319 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:35:48,341 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 [2021-08-27 17:35:48,342 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:35:48,342 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:35:48,343 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) [2021-08-27 17:35:48,344 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 [2021-08-27 17:35:48,345 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 17:35:48,351 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:35:48,352 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:35:48,352 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:35:48,352 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:35:48,357 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 17:35:48,357 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 17:35:48,375 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:35:48,391 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 [2021-08-27 17:35:48,392 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:35:48,392 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:35:48,392 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) [2021-08-27 17:35:48,393 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 [2021-08-27 17:35:48,394 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 [2021-08-27 17:35:48,399 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:35:48,399 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 17:35:48,400 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:35:48,400 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:35:48,400 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:35:48,400 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 17:35:48,400 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 17:35:48,401 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:35:48,416 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 [2021-08-27 17:35:48,416 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:35:48,417 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:35:48,417 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) [2021-08-27 17:35:48,418 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 [2021-08-27 17:35:48,419 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 [2021-08-27 17:35:48,424 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:35:48,424 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 17:35:48,424 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:35:48,425 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:35:48,425 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:35:48,425 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 17:35:48,425 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 17:35:48,428 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:35:48,443 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Ended with exit code 0 [2021-08-27 17:35:48,443 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:35:48,443 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:35:48,444 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) [2021-08-27 17:35:48,445 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 [2021-08-27 17:35:48,446 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 [2021-08-27 17:35:48,450 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:35:48,451 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 17:35:48,451 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:35:48,451 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:35:48,451 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:35:48,452 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 17:35:48,452 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 17:35:48,453 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:35:48,467 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2021-08-27 17:35:48,467 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:35:48,467 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:35:48,468 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) [2021-08-27 17:35:48,469 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 [2021-08-27 17:35:48,470 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 [2021-08-27 17:35:48,475 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:35:48,475 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 17:35:48,476 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:35:48,476 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:35:48,476 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:35:48,476 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 17:35:48,476 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 17:35:48,480 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:35:48,495 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 [2021-08-27 17:35:48,495 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:35:48,495 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:35:48,496 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 17:35:48,497 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2021-08-27 17:35:48,497 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 [2021-08-27 17:35:48,503 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:35:48,503 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 17:35:48,503 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:35:48,503 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:35:48,503 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:35:48,504 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 17:35:48,504 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 17:35:48,505 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:35:48,521 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Ended with exit code 0 [2021-08-27 17:35:48,521 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:35:48,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:35:48,522 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 17:35:48,523 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2021-08-27 17:35:48,524 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 [2021-08-27 17:35:48,529 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:35:48,529 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:35:48,529 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:35:48,529 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:35:48,531 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 17:35:48,531 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 17:35:48,534 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:35:48,549 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Ended with exit code 0 [2021-08-27 17:35:48,549 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:35:48,549 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:35:48,550 INFO L229 MonitoredProcess]: Starting monitored process 31 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) [2021-08-27 17:35:48,550 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2021-08-27 17:35:48,551 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 [2021-08-27 17:35:48,557 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:35:48,557 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 17:35:48,557 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:35:48,557 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:35:48,557 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:35:48,558 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 17:35:48,558 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 17:35:48,559 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:35:48,573 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Ended with exit code 0 [2021-08-27 17:35:48,574 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:35:48,574 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:35:48,575 INFO L229 MonitoredProcess]: Starting monitored process 32 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) [2021-08-27 17:35:48,575 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2021-08-27 17:35:48,576 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 [2021-08-27 17:35:48,582 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:35:48,582 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 17:35:48,582 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:35:48,582 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:35:48,582 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:35:48,582 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 17:35:48,582 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 17:35:48,592 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:35:48,606 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Forceful destruction successful, exit code 0 [2021-08-27 17:35:48,606 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:35:48,606 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:35:48,607 INFO L229 MonitoredProcess]: Starting monitored process 33 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) [2021-08-27 17:35:48,607 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2021-08-27 17:35:48,609 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 17:35:48,614 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:35:48,615 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:35:48,615 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:35:48,615 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:35:48,618 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 17:35:48,618 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 17:35:48,656 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:35:48,678 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Forceful destruction successful, exit code 0 [2021-08-27 17:35:48,678 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:35:48,679 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:35:48,679 INFO L229 MonitoredProcess]: Starting monitored process 34 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) [2021-08-27 17:35:48,685 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2021-08-27 17:35:48,685 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 [2021-08-27 17:35:48,691 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:35:48,691 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:35:48,691 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:35:48,691 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:35:48,697 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 17:35:48,698 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 17:35:48,720 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-08-27 17:35:48,783 INFO L443 ModelExtractionUtils]: Simplification made 14 calls to the SMT solver. [2021-08-27 17:35:48,783 INFO L444 ModelExtractionUtils]: 11 out of 25 variables were initially zero. Simplification set additionally 11 variables to zero. [2021-08-27 17:35:48,784 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:35:48,784 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:35:48,804 INFO L229 MonitoredProcess]: Starting monitored process 35 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) [2021-08-27 17:35:48,806 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-08-27 17:35:48,814 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2021-08-27 17:35:48,821 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2021-08-27 17:35:48,821 INFO L513 LassoAnalysis]: Proved termination. [2021-08-27 17:35:48,822 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_sep_~x.base)_1, ULTIMATE.start_sep_~i~0) = 9*v_rep(select #length ULTIMATE.start_sep_~x.base)_1 - 8*ULTIMATE.start_sep_~i~0 Supporting invariants [] [2021-08-27 17:35:48,862 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Forceful destruction successful, exit code 0 [2021-08-27 17:35:48,889 INFO L297 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2021-08-27 17:35:48,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:35:48,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 17:35:48,923 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 2 conjunts are in the unsatisfiable core [2021-08-27 17:35:48,924 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 17:35:48,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 17:35:48,977 INFO L263 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 6 conjunts are in the unsatisfiable core [2021-08-27 17:35:48,978 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 17:35:49,020 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 17:35:49,021 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 [2021-08-27 17:35:49,021 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 30 states and 37 transitions. cyclomatic complexity: 12 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) [2021-08-27 17:35:49,038 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 30 states and 37 transitions. cyclomatic complexity: 12. 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) Result 35 states and 46 transitions. Complement of second has 7 states. [2021-08-27 17:35:49,040 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 [2021-08-27 17:35:49,040 INFO L82 GeneralOperation]: Start removeUnreachable. 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) [2021-08-27 17:35:49,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2021-08-27 17:35:49,041 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 14 letters. Loop has 3 letters. [2021-08-27 17:35:49,041 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-27 17:35:49,041 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 17 letters. Loop has 3 letters. [2021-08-27 17:35:49,042 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-27 17:35:49,042 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 14 letters. Loop has 6 letters. [2021-08-27 17:35:49,042 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-27 17:35:49,042 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 46 transitions. [2021-08-27 17:35:49,043 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2021-08-27 17:35:49,043 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 31 states and 39 transitions. [2021-08-27 17:35:49,043 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2021-08-27 17:35:49,043 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2021-08-27 17:35:49,043 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 39 transitions. [2021-08-27 17:35:49,043 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 17:35:49,043 INFO L681 BuchiCegarLoop]: Abstraction has 31 states and 39 transitions. [2021-08-27 17:35:49,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 39 transitions. [2021-08-27 17:35:49,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2021-08-27 17:35:49,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 30 states have internal predecessors, (39), 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) [2021-08-27 17:35:49,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 39 transitions. [2021-08-27 17:35:49,045 INFO L704 BuchiCegarLoop]: Abstraction has 31 states and 39 transitions. [2021-08-27 17:35:49,045 INFO L587 BuchiCegarLoop]: Abstraction has 31 states and 39 transitions. [2021-08-27 17:35:49,045 INFO L425 BuchiCegarLoop]: ======== Iteration 8============ [2021-08-27 17:35:49,045 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 39 transitions. [2021-08-27 17:35:49,046 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2021-08-27 17:35:49,046 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 17:35:49,046 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 17:35:49,046 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 17:35:49,046 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-08-27 17:35:49,047 INFO L791 eck$LassoCheckResult]: Stem: 753#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(10); 754#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~post7, main_~i~1, main_#t~ret9, main_#t~mem10, main_#t~mem11, main_#t~ret12, main_#t~mem13, main_#t~mem15, main_#t~post14, main_~i~2, main_#t~ret16, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 762#L37-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 751#L37-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 752#L37-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 774#L37-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 781#L37-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 780#L37-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 779#L37-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 778#L37-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 777#L37-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 776#L37-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 775#L37-3 assume !(main_~i~1 < 5); 767#L37-4 sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem4, sep_#t~post5, sep_#t~post6, sep_#t~post3, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; 768#L18-3 assume !(sep_~i~0 < 5); 771#L18-4 sep_#res := (if sep_~ret~0 % 4294967296 <= 2147483647 then sep_~ret~0 % 4294967296 else sep_~ret~0 % 4294967296 - 4294967296); 755#L25 main_#t~ret9 := sep_#res;main_~ret~1 := main_#t~ret9;havoc main_#t~ret9;call main_#t~mem10 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem10;havoc main_#t~mem10;call main_#t~mem11 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem11, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem11;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem4, sep_#t~post5, sep_#t~post6, sep_#t~post3, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; 756#L18-8 [2021-08-27 17:35:49,047 INFO L793 eck$LassoCheckResult]: Loop: 756#L18-8 assume !!(sep_~i~0 < 5);call sep_#t~mem4 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 766#L20-2 assume 0 == (if sep_#t~mem4 < 0 && 0 != sep_#t~mem4 % 2 then sep_#t~mem4 % 2 - 2 else sep_#t~mem4 % 2);havoc sep_#t~mem4;sep_#t~post5 := sep_~ret~0;sep_~ret~0 := 1 + sep_#t~post5;havoc sep_#t~post5; 773#L18-7 sep_#t~post3 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post3;havoc sep_#t~post3; 756#L18-8 [2021-08-27 17:35:49,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:35:49,047 INFO L82 PathProgramCache]: Analyzing trace with hash 1638581187, now seen corresponding path program 1 times [2021-08-27 17:35:49,047 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:35:49,047 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7229046] [2021-08-27 17:35:49,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:35:49,047 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:35:49,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 17:35:49,069 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2021-08-27 17:35:49,069 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 17:35:49,069 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7229046] [2021-08-27 17:35:49,069 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [7229046] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 17:35:49,069 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 17:35:49,069 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-27 17:35:49,069 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883371658] [2021-08-27 17:35:49,069 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-27 17:35:49,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:35:49,070 INFO L82 PathProgramCache]: Analyzing trace with hash 74576, now seen corresponding path program 1 times [2021-08-27 17:35:49,070 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:35:49,070 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572000837] [2021-08-27 17:35:49,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:35:49,070 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:35:49,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:35:49,078 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 17:35:49,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:35:49,082 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 17:35:49,138 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Forceful destruction successful, exit code 0 [2021-08-27 17:35:49,148 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 17:35:49,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-27 17:35:49,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 17:35:49,148 INFO L87 Difference]: Start difference. First operand 31 states and 39 transitions. cyclomatic complexity: 13 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) [2021-08-27 17:35:49,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 17:35:49,179 INFO L93 Difference]: Finished difference Result 39 states and 49 transitions. [2021-08-27 17:35:49,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-27 17:35:49,179 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 49 transitions. [2021-08-27 17:35:49,180 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2021-08-27 17:35:49,180 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 39 states and 49 transitions. [2021-08-27 17:35:49,180 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2021-08-27 17:35:49,180 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2021-08-27 17:35:49,180 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 49 transitions. [2021-08-27 17:35:49,180 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 17:35:49,181 INFO L681 BuchiCegarLoop]: Abstraction has 39 states and 49 transitions. [2021-08-27 17:35:49,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states and 49 transitions. [2021-08-27 17:35:49,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 32. [2021-08-27 17:35:49,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 32 states have (on average 1.21875) internal successors, (39), 31 states have internal predecessors, (39), 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) [2021-08-27 17:35:49,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 39 transitions. [2021-08-27 17:35:49,182 INFO L704 BuchiCegarLoop]: Abstraction has 32 states and 39 transitions. [2021-08-27 17:35:49,182 INFO L587 BuchiCegarLoop]: Abstraction has 32 states and 39 transitions. [2021-08-27 17:35:49,182 INFO L425 BuchiCegarLoop]: ======== Iteration 9============ [2021-08-27 17:35:49,182 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 39 transitions. [2021-08-27 17:35:49,183 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2021-08-27 17:35:49,183 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 17:35:49,183 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 17:35:49,183 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 17:35:49,183 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-08-27 17:35:49,184 INFO L791 eck$LassoCheckResult]: Stem: 829#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(10); 830#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~post7, main_~i~1, main_#t~ret9, main_#t~mem10, main_#t~mem11, main_#t~ret12, main_#t~mem13, main_#t~mem15, main_#t~post14, main_~i~2, main_#t~ret16, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 838#L37-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 827#L37-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 828#L37-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 851#L37-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 858#L37-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 857#L37-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 856#L37-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 855#L37-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 854#L37-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 853#L37-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 852#L37-3 assume !(main_~i~1 < 5); 843#L37-4 sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem4, sep_#t~post5, sep_#t~post6, sep_#t~post3, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; 844#L18-3 assume !!(sep_~i~0 < 5);call sep_#t~mem4 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 847#L20 assume !(0 == (if sep_#t~mem4 < 0 && 0 != sep_#t~mem4 % 2 then sep_#t~mem4 % 2 - 2 else sep_#t~mem4 % 2));havoc sep_#t~mem4;sep_#t~post6 := sep_~ret~0;sep_~ret~0 := sep_#t~post6 - 1;havoc sep_#t~post6; 845#L18-2 sep_#t~post3 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post3;havoc sep_#t~post3; 846#L18-3 assume !(sep_~i~0 < 5); 848#L18-4 sep_#res := (if sep_~ret~0 % 4294967296 <= 2147483647 then sep_~ret~0 % 4294967296 else sep_~ret~0 % 4294967296 - 4294967296); 831#L25 main_#t~ret9 := sep_#res;main_~ret~1 := main_#t~ret9;havoc main_#t~ret9;call main_#t~mem10 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem10;havoc main_#t~mem10;call main_#t~mem11 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem11, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem11;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem4, sep_#t~post5, sep_#t~post6, sep_#t~post3, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; 832#L18-8 assume !!(sep_~i~0 < 5);call sep_#t~mem4 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 841#L20-2 [2021-08-27 17:35:49,184 INFO L793 eck$LassoCheckResult]: Loop: 841#L20-2 assume 0 == (if sep_#t~mem4 < 0 && 0 != sep_#t~mem4 % 2 then sep_#t~mem4 % 2 - 2 else sep_#t~mem4 % 2);havoc sep_#t~mem4;sep_#t~post5 := sep_~ret~0;sep_~ret~0 := 1 + sep_#t~post5;havoc sep_#t~post5; 849#L18-7 sep_#t~post3 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post3;havoc sep_#t~post3; 850#L18-8 assume !!(sep_~i~0 < 5);call sep_#t~mem4 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 841#L20-2 [2021-08-27 17:35:49,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:35:49,184 INFO L82 PathProgramCache]: Analyzing trace with hash -1567455174, now seen corresponding path program 1 times [2021-08-27 17:35:49,184 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:35:49,184 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855245691] [2021-08-27 17:35:49,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:35:49,184 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:35:49,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 17:35:49,214 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2021-08-27 17:35:49,214 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 17:35:49,214 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855245691] [2021-08-27 17:35:49,214 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1855245691] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 17:35:49,214 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1538749732] [2021-08-27 17:35:49,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:35:49,215 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 17:35:49,215 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:35:49,215 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 17:35:49,217 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2021-08-27 17:35:49,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 17:35:49,303 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 3 conjunts are in the unsatisfiable core [2021-08-27 17:35:49,304 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 17:35:49,360 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2021-08-27 17:35:49,360 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1538749732] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 17:35:49,360 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 17:35:49,360 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2021-08-27 17:35:49,360 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286095829] [2021-08-27 17:35:49,361 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-27 17:35:49,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:35:49,361 INFO L82 PathProgramCache]: Analyzing trace with hash 77576, now seen corresponding path program 2 times [2021-08-27 17:35:49,361 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:35:49,361 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043732179] [2021-08-27 17:35:49,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:35:49,361 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:35:49,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:35:49,366 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 17:35:49,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:35:49,369 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 17:35:49,422 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 17:35:49,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-27 17:35:49,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-08-27 17:35:49,423 INFO L87 Difference]: Start difference. First operand 32 states and 39 transitions. cyclomatic complexity: 12 Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 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) [2021-08-27 17:35:49,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 17:35:49,453 INFO L93 Difference]: Finished difference Result 48 states and 61 transitions. [2021-08-27 17:35:49,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 17:35:49,453 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 48 states and 61 transitions. [2021-08-27 17:35:49,454 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2021-08-27 17:35:49,454 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 48 states to 48 states and 61 transitions. [2021-08-27 17:35:49,454 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2021-08-27 17:35:49,454 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2021-08-27 17:35:49,454 INFO L73 IsDeterministic]: Start isDeterministic. Operand 48 states and 61 transitions. [2021-08-27 17:35:49,455 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 17:35:49,455 INFO L681 BuchiCegarLoop]: Abstraction has 48 states and 61 transitions. [2021-08-27 17:35:49,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states and 61 transitions. [2021-08-27 17:35:49,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 38. [2021-08-27 17:35:49,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 38 states have (on average 1.236842105263158) internal successors, (47), 37 states have internal predecessors, (47), 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) [2021-08-27 17:35:49,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 47 transitions. [2021-08-27 17:35:49,457 INFO L704 BuchiCegarLoop]: Abstraction has 38 states and 47 transitions. [2021-08-27 17:35:49,457 INFO L587 BuchiCegarLoop]: Abstraction has 38 states and 47 transitions. [2021-08-27 17:35:49,457 INFO L425 BuchiCegarLoop]: ======== Iteration 10============ [2021-08-27 17:35:49,457 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 38 states and 47 transitions. [2021-08-27 17:35:49,457 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2021-08-27 17:35:49,457 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 17:35:49,457 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 17:35:49,458 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 17:35:49,458 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-08-27 17:35:49,458 INFO L791 eck$LassoCheckResult]: Stem: 977#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(10); 978#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~post7, main_~i~1, main_#t~ret9, main_#t~mem10, main_#t~mem11, main_#t~ret12, main_#t~mem13, main_#t~mem15, main_#t~post14, main_~i~2, main_#t~ret16, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 986#L37-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 975#L37-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 976#L37-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 1002#L37-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 1011#L37-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 1010#L37-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 1009#L37-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 1008#L37-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 1007#L37-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 1006#L37-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 1005#L37-3 assume !(main_~i~1 < 5); 992#L37-4 sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem4, sep_#t~post5, sep_#t~post6, sep_#t~post3, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; 993#L18-3 assume !!(sep_~i~0 < 5);call sep_#t~mem4 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 997#L20 assume !(0 == (if sep_#t~mem4 < 0 && 0 != sep_#t~mem4 % 2 then sep_#t~mem4 % 2 - 2 else sep_#t~mem4 % 2));havoc sep_#t~mem4;sep_#t~post6 := sep_~ret~0;sep_~ret~0 := sep_#t~post6 - 1;havoc sep_#t~post6; 1003#L18-2 sep_#t~post3 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post3;havoc sep_#t~post3; 998#L18-3 assume !!(sep_~i~0 < 5);call sep_#t~mem4 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 999#L20 assume !(0 == (if sep_#t~mem4 < 0 && 0 != sep_#t~mem4 % 2 then sep_#t~mem4 % 2 - 2 else sep_#t~mem4 % 2));havoc sep_#t~mem4;sep_#t~post6 := sep_~ret~0;sep_~ret~0 := sep_#t~post6 - 1;havoc sep_#t~post6; 994#L18-2 sep_#t~post3 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post3;havoc sep_#t~post3; 995#L18-3 assume !(sep_~i~0 < 5); 1000#L18-4 sep_#res := (if sep_~ret~0 % 4294967296 <= 2147483647 then sep_~ret~0 % 4294967296 else sep_~ret~0 % 4294967296 - 4294967296); 979#L25 main_#t~ret9 := sep_#res;main_~ret~1 := main_#t~ret9;havoc main_#t~ret9;call main_#t~mem10 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem10;havoc main_#t~mem10;call main_#t~mem11 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem11, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem11;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem4, sep_#t~post5, sep_#t~post6, sep_#t~post3, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; 980#L18-8 assume !!(sep_~i~0 < 5);call sep_#t~mem4 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1012#L20-2 assume !(0 == (if sep_#t~mem4 < 0 && 0 != sep_#t~mem4 % 2 then sep_#t~mem4 % 2 - 2 else sep_#t~mem4 % 2));havoc sep_#t~mem4;sep_#t~post6 := sep_~ret~0;sep_~ret~0 := sep_#t~post6 - 1;havoc sep_#t~post6; 1001#L18-7 sep_#t~post3 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post3;havoc sep_#t~post3; 989#L18-8 assume !!(sep_~i~0 < 5);call sep_#t~mem4 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 990#L20-2 [2021-08-27 17:35:49,458 INFO L793 eck$LassoCheckResult]: Loop: 990#L20-2 assume 0 == (if sep_#t~mem4 < 0 && 0 != sep_#t~mem4 % 2 then sep_#t~mem4 % 2 - 2 else sep_#t~mem4 % 2);havoc sep_#t~mem4;sep_#t~post5 := sep_~ret~0;sep_~ret~0 := 1 + sep_#t~post5;havoc sep_#t~post5; 996#L18-7 sep_#t~post3 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post3;havoc sep_#t~post3; 1004#L18-8 assume !!(sep_~i~0 < 5);call sep_#t~mem4 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 990#L20-2 [2021-08-27 17:35:49,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:35:49,459 INFO L82 PathProgramCache]: Analyzing trace with hash -1248848095, now seen corresponding path program 1 times [2021-08-27 17:35:49,459 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:35:49,459 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301255645] [2021-08-27 17:35:49,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:35:49,459 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:35:49,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 17:35:49,518 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2021-08-27 17:35:49,518 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 17:35:49,518 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301255645] [2021-08-27 17:35:49,518 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1301255645] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 17:35:49,518 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [619431150] [2021-08-27 17:35:49,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:35:49,519 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 17:35:49,519 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:35:49,529 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 17:35:49,530 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Waiting until timeout for monitored process [2021-08-27 17:35:49,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 17:35:49,638 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 4 conjunts are in the unsatisfiable core [2021-08-27 17:35:49,639 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 17:35:49,714 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2021-08-27 17:35:49,715 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [619431150] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 17:35:49,715 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 17:35:49,715 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2021-08-27 17:35:49,715 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635096055] [2021-08-27 17:35:49,715 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-27 17:35:49,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:35:49,716 INFO L82 PathProgramCache]: Analyzing trace with hash 77576, now seen corresponding path program 3 times [2021-08-27 17:35:49,716 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:35:49,716 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446453203] [2021-08-27 17:35:49,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:35:49,716 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:35:49,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:35:49,721 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 17:35:49,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:35:49,724 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 17:35:49,775 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 17:35:49,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-27 17:35:49,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-08-27 17:35:49,778 INFO L87 Difference]: Start difference. First operand 38 states and 47 transitions. cyclomatic complexity: 14 Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 17:35:49,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 17:35:49,819 INFO L93 Difference]: Finished difference Result 57 states and 73 transitions. [2021-08-27 17:35:49,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-27 17:35:49,819 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 57 states and 73 transitions. [2021-08-27 17:35:49,820 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2021-08-27 17:35:49,821 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 57 states to 57 states and 73 transitions. [2021-08-27 17:35:49,821 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 36 [2021-08-27 17:35:49,821 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36 [2021-08-27 17:35:49,821 INFO L73 IsDeterministic]: Start isDeterministic. Operand 57 states and 73 transitions. [2021-08-27 17:35:49,821 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 17:35:49,821 INFO L681 BuchiCegarLoop]: Abstraction has 57 states and 73 transitions. [2021-08-27 17:35:49,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states and 73 transitions. [2021-08-27 17:35:49,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 44. [2021-08-27 17:35:49,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 44 states have (on average 1.25) internal successors, (55), 43 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) [2021-08-27 17:35:49,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 55 transitions. [2021-08-27 17:35:49,824 INFO L704 BuchiCegarLoop]: Abstraction has 44 states and 55 transitions. [2021-08-27 17:35:49,824 INFO L587 BuchiCegarLoop]: Abstraction has 44 states and 55 transitions. [2021-08-27 17:35:49,824 INFO L425 BuchiCegarLoop]: ======== Iteration 11============ [2021-08-27 17:35:49,824 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 44 states and 55 transitions. [2021-08-27 17:35:49,825 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2021-08-27 17:35:49,825 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 17:35:49,825 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 17:35:49,826 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 17:35:49,826 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-08-27 17:35:49,826 INFO L791 eck$LassoCheckResult]: Stem: 1159#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(10); 1160#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~post7, main_~i~1, main_#t~ret9, main_#t~mem10, main_#t~mem11, main_#t~ret12, main_#t~mem13, main_#t~mem15, main_#t~post14, main_~i~2, main_#t~ret16, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 1168#L37-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 1157#L37-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 1158#L37-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 1185#L37-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 1197#L37-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 1196#L37-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 1195#L37-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 1194#L37-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 1193#L37-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 1192#L37-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 1191#L37-3 assume !(main_~i~1 < 5); 1174#L37-4 sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem4, sep_#t~post5, sep_#t~post6, sep_#t~post3, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; 1175#L18-3 assume !!(sep_~i~0 < 5);call sep_#t~mem4 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1178#L20 assume !(0 == (if sep_#t~mem4 < 0 && 0 != sep_#t~mem4 % 2 then sep_#t~mem4 % 2 - 2 else sep_#t~mem4 % 2));havoc sep_#t~mem4;sep_#t~post6 := sep_~ret~0;sep_~ret~0 := sep_#t~post6 - 1;havoc sep_#t~post6; 1200#L18-2 sep_#t~post3 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post3;havoc sep_#t~post3; 1199#L18-3 assume !!(sep_~i~0 < 5);call sep_#t~mem4 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1186#L20 assume !(0 == (if sep_#t~mem4 < 0 && 0 != sep_#t~mem4 % 2 then sep_#t~mem4 % 2 - 2 else sep_#t~mem4 % 2));havoc sep_#t~mem4;sep_#t~post6 := sep_~ret~0;sep_~ret~0 := sep_#t~post6 - 1;havoc sep_#t~post6; 1176#L18-2 sep_#t~post3 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post3;havoc sep_#t~post3; 1177#L18-3 assume !!(sep_~i~0 < 5);call sep_#t~mem4 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1179#L20 assume !(0 == (if sep_#t~mem4 < 0 && 0 != sep_#t~mem4 % 2 then sep_#t~mem4 % 2 - 2 else sep_#t~mem4 % 2));havoc sep_#t~mem4;sep_#t~post6 := sep_~ret~0;sep_~ret~0 := sep_#t~post6 - 1;havoc sep_#t~post6; 1188#L18-2 sep_#t~post3 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post3;havoc sep_#t~post3; 1187#L18-3 assume !(sep_~i~0 < 5); 1180#L18-4 sep_#res := (if sep_~ret~0 % 4294967296 <= 2147483647 then sep_~ret~0 % 4294967296 else sep_~ret~0 % 4294967296 - 4294967296); 1161#L25 main_#t~ret9 := sep_#res;main_~ret~1 := main_#t~ret9;havoc main_#t~ret9;call main_#t~mem10 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem10;havoc main_#t~mem10;call main_#t~mem11 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem11, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem11;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem4, sep_#t~post5, sep_#t~post6, sep_#t~post3, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; 1162#L18-8 assume !!(sep_~i~0 < 5);call sep_#t~mem4 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1198#L20-2 assume !(0 == (if sep_#t~mem4 < 0 && 0 != sep_#t~mem4 % 2 then sep_#t~mem4 % 2 - 2 else sep_#t~mem4 % 2));havoc sep_#t~mem4;sep_#t~post6 := sep_~ret~0;sep_~ret~0 := sep_#t~post6 - 1;havoc sep_#t~post6; 1183#L18-7 sep_#t~post3 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post3;havoc sep_#t~post3; 1184#L18-8 assume !!(sep_~i~0 < 5);call sep_#t~mem4 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1181#L20-2 assume !(0 == (if sep_#t~mem4 < 0 && 0 != sep_#t~mem4 % 2 then sep_#t~mem4 % 2 - 2 else sep_#t~mem4 % 2));havoc sep_#t~mem4;sep_#t~post6 := sep_~ret~0;sep_~ret~0 := sep_#t~post6 - 1;havoc sep_#t~post6; 1182#L18-7 sep_#t~post3 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post3;havoc sep_#t~post3; 1171#L18-8 assume !!(sep_~i~0 < 5);call sep_#t~mem4 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1172#L20-2 [2021-08-27 17:35:49,826 INFO L793 eck$LassoCheckResult]: Loop: 1172#L20-2 assume 0 == (if sep_#t~mem4 < 0 && 0 != sep_#t~mem4 % 2 then sep_#t~mem4 % 2 - 2 else sep_#t~mem4 % 2);havoc sep_#t~mem4;sep_#t~post5 := sep_~ret~0;sep_~ret~0 := 1 + sep_#t~post5;havoc sep_#t~post5; 1190#L18-7 sep_#t~post3 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post3;havoc sep_#t~post3; 1189#L18-8 assume !!(sep_~i~0 < 5);call sep_#t~mem4 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1172#L20-2 [2021-08-27 17:35:49,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:35:49,827 INFO L82 PathProgramCache]: Analyzing trace with hash -1685621030, now seen corresponding path program 2 times [2021-08-27 17:35:49,827 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:35:49,827 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109330346] [2021-08-27 17:35:49,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:35:49,827 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:35:49,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 17:35:49,873 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2021-08-27 17:35:49,873 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 17:35:49,873 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109330346] [2021-08-27 17:35:49,873 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [109330346] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 17:35:49,874 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1467387872] [2021-08-27 17:35:49,874 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-08-27 17:35:49,874 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 17:35:49,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:35:49,875 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 17:35:49,903 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Waiting until timeout for monitored process [2021-08-27 17:35:50,002 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-08-27 17:35:50,002 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-27 17:35:50,003 INFO L263 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 5 conjunts are in the unsatisfiable core [2021-08-27 17:35:50,005 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 17:35:50,095 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2021-08-27 17:35:50,095 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1467387872] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 17:35:50,095 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 17:35:50,096 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2021-08-27 17:35:50,097 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233181474] [2021-08-27 17:35:50,097 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-27 17:35:50,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:35:50,097 INFO L82 PathProgramCache]: Analyzing trace with hash 77576, now seen corresponding path program 4 times [2021-08-27 17:35:50,097 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:35:50,097 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243968897] [2021-08-27 17:35:50,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:35:50,098 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:35:50,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:35:50,108 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 17:35:50,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:35:50,112 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 17:35:50,167 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 17:35:50,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-27 17:35:50,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2021-08-27 17:35:50,167 INFO L87 Difference]: Start difference. First operand 44 states and 55 transitions. cyclomatic complexity: 16 Second operand has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 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) [2021-08-27 17:35:50,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 17:35:50,224 INFO L93 Difference]: Finished difference Result 66 states and 85 transitions. [2021-08-27 17:35:50,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-27 17:35:50,224 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 66 states and 85 transitions. [2021-08-27 17:35:50,224 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2021-08-27 17:35:50,225 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 66 states to 66 states and 85 transitions. [2021-08-27 17:35:50,225 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 42 [2021-08-27 17:35:50,225 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 42 [2021-08-27 17:35:50,225 INFO L73 IsDeterministic]: Start isDeterministic. Operand 66 states and 85 transitions. [2021-08-27 17:35:50,225 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 17:35:50,225 INFO L681 BuchiCegarLoop]: Abstraction has 66 states and 85 transitions. [2021-08-27 17:35:50,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states and 85 transitions. [2021-08-27 17:35:50,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 50. [2021-08-27 17:35:50,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 50 states have (on average 1.26) internal successors, (63), 49 states have internal predecessors, (63), 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) [2021-08-27 17:35:50,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 63 transitions. [2021-08-27 17:35:50,228 INFO L704 BuchiCegarLoop]: Abstraction has 50 states and 63 transitions. [2021-08-27 17:35:50,228 INFO L587 BuchiCegarLoop]: Abstraction has 50 states and 63 transitions. [2021-08-27 17:35:50,228 INFO L425 BuchiCegarLoop]: ======== Iteration 12============ [2021-08-27 17:35:50,228 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 50 states and 63 transitions. [2021-08-27 17:35:50,228 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2021-08-27 17:35:50,228 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 17:35:50,228 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 17:35:50,229 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 17:35:50,229 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-08-27 17:35:50,229 INFO L791 eck$LassoCheckResult]: Stem: 1375#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(10); 1376#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~post7, main_~i~1, main_#t~ret9, main_#t~mem10, main_#t~mem11, main_#t~ret12, main_#t~mem13, main_#t~mem15, main_#t~post14, main_~i~2, main_#t~ret16, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 1384#L37-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 1373#L37-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 1374#L37-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 1399#L37-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 1412#L37-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 1411#L37-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 1410#L37-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 1409#L37-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 1408#L37-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 1407#L37-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 1406#L37-3 assume !(main_~i~1 < 5); 1390#L37-4 sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem4, sep_#t~post5, sep_#t~post6, sep_#t~post3, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; 1391#L18-3 assume !!(sep_~i~0 < 5);call sep_#t~mem4 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1394#L20 assume !(0 == (if sep_#t~mem4 < 0 && 0 != sep_#t~mem4 % 2 then sep_#t~mem4 % 2 - 2 else sep_#t~mem4 % 2));havoc sep_#t~mem4;sep_#t~post6 := sep_~ret~0;sep_~ret~0 := sep_#t~post6 - 1;havoc sep_#t~post6; 1392#L18-2 sep_#t~post3 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post3;havoc sep_#t~post3; 1393#L18-3 assume !!(sep_~i~0 < 5);call sep_#t~mem4 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1395#L20 assume !(0 == (if sep_#t~mem4 < 0 && 0 != sep_#t~mem4 % 2 then sep_#t~mem4 % 2 - 2 else sep_#t~mem4 % 2));havoc sep_#t~mem4;sep_#t~post6 := sep_~ret~0;sep_~ret~0 := sep_#t~post6 - 1;havoc sep_#t~post6; 1422#L18-2 sep_#t~post3 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post3;havoc sep_#t~post3; 1421#L18-3 assume !!(sep_~i~0 < 5);call sep_#t~mem4 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1420#L20 assume !(0 == (if sep_#t~mem4 < 0 && 0 != sep_#t~mem4 % 2 then sep_#t~mem4 % 2 - 2 else sep_#t~mem4 % 2));havoc sep_#t~mem4;sep_#t~post6 := sep_~ret~0;sep_~ret~0 := sep_#t~post6 - 1;havoc sep_#t~post6; 1419#L18-2 sep_#t~post3 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post3;havoc sep_#t~post3; 1418#L18-3 assume !!(sep_~i~0 < 5);call sep_#t~mem4 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1401#L20 assume !(0 == (if sep_#t~mem4 < 0 && 0 != sep_#t~mem4 % 2 then sep_#t~mem4 % 2 - 2 else sep_#t~mem4 % 2));havoc sep_#t~mem4;sep_#t~post6 := sep_~ret~0;sep_~ret~0 := sep_#t~post6 - 1;havoc sep_#t~post6; 1402#L18-2 sep_#t~post3 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post3;havoc sep_#t~post3; 1400#L18-3 assume !(sep_~i~0 < 5); 1396#L18-4 sep_#res := (if sep_~ret~0 % 4294967296 <= 2147483647 then sep_~ret~0 % 4294967296 else sep_~ret~0 % 4294967296 - 4294967296); 1377#L25 main_#t~ret9 := sep_#res;main_~ret~1 := main_#t~ret9;havoc main_#t~ret9;call main_#t~mem10 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem10;havoc main_#t~mem10;call main_#t~mem11 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem11, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem11;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem4, sep_#t~post5, sep_#t~post6, sep_#t~post3, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; 1378#L18-8 assume !!(sep_~i~0 < 5);call sep_#t~mem4 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1397#L20-2 assume !(0 == (if sep_#t~mem4 < 0 && 0 != sep_#t~mem4 % 2 then sep_#t~mem4 % 2 - 2 else sep_#t~mem4 % 2));havoc sep_#t~mem4;sep_#t~post6 := sep_~ret~0;sep_~ret~0 := sep_#t~post6 - 1;havoc sep_#t~post6; 1398#L18-7 sep_#t~post3 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post3;havoc sep_#t~post3; 1387#L18-8 assume !!(sep_~i~0 < 5);call sep_#t~mem4 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1388#L20-2 assume !(0 == (if sep_#t~mem4 < 0 && 0 != sep_#t~mem4 % 2 then sep_#t~mem4 % 2 - 2 else sep_#t~mem4 % 2));havoc sep_#t~mem4;sep_#t~post6 := sep_~ret~0;sep_~ret~0 := sep_#t~post6 - 1;havoc sep_#t~post6; 1417#L18-7 sep_#t~post3 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post3;havoc sep_#t~post3; 1416#L18-8 assume !!(sep_~i~0 < 5);call sep_#t~mem4 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1415#L20-2 assume !(0 == (if sep_#t~mem4 < 0 && 0 != sep_#t~mem4 % 2 then sep_#t~mem4 % 2 - 2 else sep_#t~mem4 % 2));havoc sep_#t~mem4;sep_#t~post6 := sep_~ret~0;sep_~ret~0 := sep_#t~post6 - 1;havoc sep_#t~post6; 1414#L18-7 sep_#t~post3 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post3;havoc sep_#t~post3; 1413#L18-8 assume !!(sep_~i~0 < 5);call sep_#t~mem4 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1404#L20-2 [2021-08-27 17:35:50,233 INFO L793 eck$LassoCheckResult]: Loop: 1404#L20-2 assume 0 == (if sep_#t~mem4 < 0 && 0 != sep_#t~mem4 % 2 then sep_#t~mem4 % 2 - 2 else sep_#t~mem4 % 2);havoc sep_#t~mem4;sep_#t~post5 := sep_~ret~0;sep_~ret~0 := 1 + sep_#t~post5;havoc sep_#t~post5; 1405#L18-7 sep_#t~post3 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post3;havoc sep_#t~post3; 1403#L18-8 assume !!(sep_~i~0 < 5);call sep_#t~mem4 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1404#L20-2 [2021-08-27 17:35:50,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:35:50,233 INFO L82 PathProgramCache]: Analyzing trace with hash -534676351, now seen corresponding path program 3 times [2021-08-27 17:35:50,233 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:35:50,233 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307962031] [2021-08-27 17:35:50,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:35:50,233 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:35:50,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 17:35:50,302 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2021-08-27 17:35:50,302 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 17:35:50,303 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307962031] [2021-08-27 17:35:50,303 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1307962031] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 17:35:50,303 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1958386352] [2021-08-27 17:35:50,303 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-08-27 17:35:50,303 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 17:35:50,303 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:35:50,308 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 17:35:50,338 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Waiting until timeout for monitored process [2021-08-27 17:35:50,517 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2021-08-27 17:35:50,517 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-27 17:35:50,518 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 6 conjunts are in the unsatisfiable core [2021-08-27 17:35:50,520 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 17:35:50,628 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2021-08-27 17:35:50,629 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1958386352] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 17:35:50,629 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 17:35:50,629 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2021-08-27 17:35:50,629 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902264899] [2021-08-27 17:35:50,629 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-27 17:35:50,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:35:50,630 INFO L82 PathProgramCache]: Analyzing trace with hash 77576, now seen corresponding path program 5 times [2021-08-27 17:35:50,630 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:35:50,630 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002057257] [2021-08-27 17:35:50,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:35:50,630 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:35:50,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:35:50,635 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 17:35:50,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:35:50,638 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 17:35:50,689 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 17:35:50,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-08-27 17:35:50,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2021-08-27 17:35:50,689 INFO L87 Difference]: Start difference. First operand 50 states and 63 transitions. cyclomatic complexity: 18 Second operand has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 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) [2021-08-27 17:35:50,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 17:35:50,754 INFO L93 Difference]: Finished difference Result 69 states and 88 transitions. [2021-08-27 17:35:50,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-27 17:35:50,754 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 69 states and 88 transitions. [2021-08-27 17:35:50,755 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2021-08-27 17:35:50,755 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 69 states to 69 states and 88 transitions. [2021-08-27 17:35:50,755 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 44 [2021-08-27 17:35:50,755 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 44 [2021-08-27 17:35:50,755 INFO L73 IsDeterministic]: Start isDeterministic. Operand 69 states and 88 transitions. [2021-08-27 17:35:50,756 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 17:35:50,756 INFO L681 BuchiCegarLoop]: Abstraction has 69 states and 88 transitions. [2021-08-27 17:35:50,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states and 88 transitions. [2021-08-27 17:35:50,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 56. [2021-08-27 17:35:50,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 56 states have (on average 1.2678571428571428) internal successors, (71), 55 states have internal predecessors, (71), 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) [2021-08-27 17:35:50,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 71 transitions. [2021-08-27 17:35:50,758 INFO L704 BuchiCegarLoop]: Abstraction has 56 states and 71 transitions. [2021-08-27 17:35:50,758 INFO L587 BuchiCegarLoop]: Abstraction has 56 states and 71 transitions. [2021-08-27 17:35:50,758 INFO L425 BuchiCegarLoop]: ======== Iteration 13============ [2021-08-27 17:35:50,759 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 56 states and 71 transitions. [2021-08-27 17:35:50,759 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2021-08-27 17:35:50,759 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 17:35:50,759 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 17:35:50,760 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 17:35:50,760 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-08-27 17:35:50,760 INFO L791 eck$LassoCheckResult]: Stem: 1619#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(10); 1620#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~post7, main_~i~1, main_#t~ret9, main_#t~mem10, main_#t~mem11, main_#t~ret12, main_#t~mem13, main_#t~mem15, main_#t~post14, main_~i~2, main_#t~ret16, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 1628#L37-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 1617#L37-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 1618#L37-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 1643#L37-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 1672#L37-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 1671#L37-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 1670#L37-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 1669#L37-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 1668#L37-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 1667#L37-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 1666#L37-3 assume !(main_~i~1 < 5); 1634#L37-4 sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem4, sep_#t~post5, sep_#t~post6, sep_#t~post3, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; 1635#L18-3 assume !!(sep_~i~0 < 5);call sep_#t~mem4 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1638#L20 assume !(0 == (if sep_#t~mem4 < 0 && 0 != sep_#t~mem4 % 2 then sep_#t~mem4 % 2 - 2 else sep_#t~mem4 % 2));havoc sep_#t~mem4;sep_#t~post6 := sep_~ret~0;sep_~ret~0 := sep_#t~post6 - 1;havoc sep_#t~post6; 1636#L18-2 sep_#t~post3 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post3;havoc sep_#t~post3; 1637#L18-3 assume !!(sep_~i~0 < 5);call sep_#t~mem4 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1639#L20 assume !(0 == (if sep_#t~mem4 < 0 && 0 != sep_#t~mem4 % 2 then sep_#t~mem4 % 2 - 2 else sep_#t~mem4 % 2));havoc sep_#t~mem4;sep_#t~post6 := sep_~ret~0;sep_~ret~0 := sep_#t~post6 - 1;havoc sep_#t~post6; 1663#L18-2 sep_#t~post3 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post3;havoc sep_#t~post3; 1661#L18-3 assume !!(sep_~i~0 < 5);call sep_#t~mem4 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1659#L20 assume !(0 == (if sep_#t~mem4 < 0 && 0 != sep_#t~mem4 % 2 then sep_#t~mem4 % 2 - 2 else sep_#t~mem4 % 2));havoc sep_#t~mem4;sep_#t~post6 := sep_~ret~0;sep_~ret~0 := sep_#t~post6 - 1;havoc sep_#t~post6; 1657#L18-2 sep_#t~post3 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post3;havoc sep_#t~post3; 1655#L18-3 assume !!(sep_~i~0 < 5);call sep_#t~mem4 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1653#L20 assume !(0 == (if sep_#t~mem4 < 0 && 0 != sep_#t~mem4 % 2 then sep_#t~mem4 % 2 - 2 else sep_#t~mem4 % 2));havoc sep_#t~mem4;sep_#t~post6 := sep_~ret~0;sep_~ret~0 := sep_#t~post6 - 1;havoc sep_#t~post6; 1651#L18-2 sep_#t~post3 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post3;havoc sep_#t~post3; 1650#L18-3 assume !!(sep_~i~0 < 5);call sep_#t~mem4 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1645#L20 assume !(0 == (if sep_#t~mem4 < 0 && 0 != sep_#t~mem4 % 2 then sep_#t~mem4 % 2 - 2 else sep_#t~mem4 % 2));havoc sep_#t~mem4;sep_#t~post6 := sep_~ret~0;sep_~ret~0 := sep_#t~post6 - 1;havoc sep_#t~post6; 1646#L18-2 sep_#t~post3 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post3;havoc sep_#t~post3; 1644#L18-3 assume !(sep_~i~0 < 5); 1640#L18-4 sep_#res := (if sep_~ret~0 % 4294967296 <= 2147483647 then sep_~ret~0 % 4294967296 else sep_~ret~0 % 4294967296 - 4294967296); 1621#L25 main_#t~ret9 := sep_#res;main_~ret~1 := main_#t~ret9;havoc main_#t~ret9;call main_#t~mem10 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem10;havoc main_#t~mem10;call main_#t~mem11 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem11, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem11;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem4, sep_#t~post5, sep_#t~post6, sep_#t~post3, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; 1622#L18-8 assume !!(sep_~i~0 < 5);call sep_#t~mem4 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1641#L20-2 assume !(0 == (if sep_#t~mem4 < 0 && 0 != sep_#t~mem4 % 2 then sep_#t~mem4 % 2 - 2 else sep_#t~mem4 % 2));havoc sep_#t~mem4;sep_#t~post6 := sep_~ret~0;sep_~ret~0 := sep_#t~post6 - 1;havoc sep_#t~post6; 1642#L18-7 sep_#t~post3 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post3;havoc sep_#t~post3; 1631#L18-8 assume !!(sep_~i~0 < 5);call sep_#t~mem4 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1632#L20-2 assume !(0 == (if sep_#t~mem4 < 0 && 0 != sep_#t~mem4 % 2 then sep_#t~mem4 % 2 - 2 else sep_#t~mem4 % 2));havoc sep_#t~mem4;sep_#t~post6 := sep_~ret~0;sep_~ret~0 := sep_#t~post6 - 1;havoc sep_#t~post6; 1665#L18-7 sep_#t~post3 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post3;havoc sep_#t~post3; 1664#L18-8 assume !!(sep_~i~0 < 5);call sep_#t~mem4 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1662#L20-2 assume !(0 == (if sep_#t~mem4 < 0 && 0 != sep_#t~mem4 % 2 then sep_#t~mem4 % 2 - 2 else sep_#t~mem4 % 2));havoc sep_#t~mem4;sep_#t~post6 := sep_~ret~0;sep_~ret~0 := sep_#t~post6 - 1;havoc sep_#t~post6; 1660#L18-7 sep_#t~post3 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post3;havoc sep_#t~post3; 1658#L18-8 assume !!(sep_~i~0 < 5);call sep_#t~mem4 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1656#L20-2 assume !(0 == (if sep_#t~mem4 < 0 && 0 != sep_#t~mem4 % 2 then sep_#t~mem4 % 2 - 2 else sep_#t~mem4 % 2));havoc sep_#t~mem4;sep_#t~post6 := sep_~ret~0;sep_~ret~0 := sep_#t~post6 - 1;havoc sep_#t~post6; 1654#L18-7 sep_#t~post3 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post3;havoc sep_#t~post3; 1652#L18-8 assume !!(sep_~i~0 < 5);call sep_#t~mem4 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1648#L20-2 [2021-08-27 17:35:50,760 INFO L793 eck$LassoCheckResult]: Loop: 1648#L20-2 assume 0 == (if sep_#t~mem4 < 0 && 0 != sep_#t~mem4 % 2 then sep_#t~mem4 % 2 - 2 else sep_#t~mem4 % 2);havoc sep_#t~mem4;sep_#t~post5 := sep_~ret~0;sep_~ret~0 := 1 + sep_#t~post5;havoc sep_#t~post5; 1649#L18-7 sep_#t~post3 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post3;havoc sep_#t~post3; 1647#L18-8 assume !!(sep_~i~0 < 5);call sep_#t~mem4 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1648#L20-2 [2021-08-27 17:35:50,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:35:50,760 INFO L82 PathProgramCache]: Analyzing trace with hash 1616244090, now seen corresponding path program 4 times [2021-08-27 17:35:50,760 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:35:50,761 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229418494] [2021-08-27 17:35:50,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:35:50,761 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:35:50,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:35:50,852 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 17:35:50,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:35:50,925 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 17:35:50,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:35:50,926 INFO L82 PathProgramCache]: Analyzing trace with hash 77576, now seen corresponding path program 6 times [2021-08-27 17:35:50,926 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:35:50,926 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896497677] [2021-08-27 17:35:50,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:35:50,926 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:35:50,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:35:50,930 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 17:35:50,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:35:50,932 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 17:35:50,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:35:50,932 INFO L82 PathProgramCache]: Analyzing trace with hash -1350622481, now seen corresponding path program 1 times [2021-08-27 17:35:50,933 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:35:50,933 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553447848] [2021-08-27 17:35:50,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:35:50,933 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:35:50,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 17:35:51,018 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 22 proven. 13 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2021-08-27 17:35:51,019 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 17:35:51,019 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553447848] [2021-08-27 17:35:51,019 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [553447848] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 17:35:51,019 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [624043626] [2021-08-27 17:35:51,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:35:51,019 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 17:35:51,019 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:35:51,024 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 17:35:51,056 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Waiting until timeout for monitored process [2021-08-27 17:35:51,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 17:35:51,181 INFO L263 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 7 conjunts are in the unsatisfiable core [2021-08-27 17:35:51,183 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 17:35:51,319 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2021-08-27 17:35:51,320 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [624043626] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 17:35:51,320 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-08-27 17:35:51,320 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 8 [2021-08-27 17:35:51,320 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623022154] [2021-08-27 17:35:51,389 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 17:35:51,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-08-27 17:35:51,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2021-08-27 17:35:51,390 INFO L87 Difference]: Start difference. First operand 56 states and 71 transitions. cyclomatic complexity: 20 Second operand has 8 states, 7 states have (on average 4.0) internal successors, (28), 8 states have internal predecessors, (28), 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) [2021-08-27 17:35:51,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 17:35:51,460 INFO L93 Difference]: Finished difference Result 69 states and 85 transitions. [2021-08-27 17:35:51,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-08-27 17:35:51,461 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 69 states and 85 transitions. [2021-08-27 17:35:51,461 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-08-27 17:35:51,462 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 69 states to 52 states and 63 transitions. [2021-08-27 17:35:51,462 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2021-08-27 17:35:51,462 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 42 [2021-08-27 17:35:51,462 INFO L73 IsDeterministic]: Start isDeterministic. Operand 52 states and 63 transitions. [2021-08-27 17:35:51,463 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 17:35:51,463 INFO L681 BuchiCegarLoop]: Abstraction has 52 states and 63 transitions. [2021-08-27 17:35:51,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states and 63 transitions. [2021-08-27 17:35:51,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2021-08-27 17:35:51,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 52 states have (on average 1.2115384615384615) internal successors, (63), 51 states have internal predecessors, (63), 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) [2021-08-27 17:35:51,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 63 transitions. [2021-08-27 17:35:51,465 INFO L704 BuchiCegarLoop]: Abstraction has 52 states and 63 transitions. [2021-08-27 17:35:51,465 INFO L587 BuchiCegarLoop]: Abstraction has 52 states and 63 transitions. [2021-08-27 17:35:51,465 INFO L425 BuchiCegarLoop]: ======== Iteration 14============ [2021-08-27 17:35:51,466 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 52 states and 63 transitions. [2021-08-27 17:35:51,466 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-08-27 17:35:51,466 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 17:35:51,466 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 17:35:51,467 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 17:35:51,467 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-08-27 17:35:51,468 INFO L791 eck$LassoCheckResult]: Stem: 1899#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(10); 1900#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~post7, main_~i~1, main_#t~ret9, main_#t~mem10, main_#t~mem11, main_#t~ret12, main_#t~mem13, main_#t~mem15, main_#t~post14, main_~i~2, main_#t~ret16, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 1906#L37-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 1897#L37-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 1898#L37-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 1917#L37-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 1932#L37-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 1930#L37-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 1928#L37-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 1926#L37-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 1924#L37-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 1921#L37-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 1920#L37-3 assume !(main_~i~1 < 5); 1909#L37-4 sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem4, sep_#t~post5, sep_#t~post6, sep_#t~post3, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; 1910#L18-3 assume !!(sep_~i~0 < 5);call sep_#t~mem4 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1948#L20 assume !(0 == (if sep_#t~mem4 < 0 && 0 != sep_#t~mem4 % 2 then sep_#t~mem4 % 2 - 2 else sep_#t~mem4 % 2));havoc sep_#t~mem4;sep_#t~post6 := sep_~ret~0;sep_~ret~0 := sep_#t~post6 - 1;havoc sep_#t~post6; 1911#L18-2 sep_#t~post3 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post3;havoc sep_#t~post3; 1912#L18-3 assume !!(sep_~i~0 < 5);call sep_#t~mem4 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1913#L20 assume !(0 == (if sep_#t~mem4 < 0 && 0 != sep_#t~mem4 % 2 then sep_#t~mem4 % 2 - 2 else sep_#t~mem4 % 2));havoc sep_#t~mem4;sep_#t~post6 := sep_~ret~0;sep_~ret~0 := sep_#t~post6 - 1;havoc sep_#t~post6; 1918#L18-2 sep_#t~post3 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post3;havoc sep_#t~post3; 1947#L18-3 assume !!(sep_~i~0 < 5);call sep_#t~mem4 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1946#L20 assume !(0 == (if sep_#t~mem4 < 0 && 0 != sep_#t~mem4 % 2 then sep_#t~mem4 % 2 - 2 else sep_#t~mem4 % 2));havoc sep_#t~mem4;sep_#t~post6 := sep_~ret~0;sep_~ret~0 := sep_#t~post6 - 1;havoc sep_#t~post6; 1945#L18-2 sep_#t~post3 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post3;havoc sep_#t~post3; 1944#L18-3 assume !!(sep_~i~0 < 5);call sep_#t~mem4 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1943#L20 assume !(0 == (if sep_#t~mem4 < 0 && 0 != sep_#t~mem4 % 2 then sep_#t~mem4 % 2 - 2 else sep_#t~mem4 % 2));havoc sep_#t~mem4;sep_#t~post6 := sep_~ret~0;sep_~ret~0 := sep_#t~post6 - 1;havoc sep_#t~post6; 1942#L18-2 sep_#t~post3 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post3;havoc sep_#t~post3; 1941#L18-3 assume !!(sep_~i~0 < 5);call sep_#t~mem4 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1940#L20 assume !(0 == (if sep_#t~mem4 < 0 && 0 != sep_#t~mem4 % 2 then sep_#t~mem4 % 2 - 2 else sep_#t~mem4 % 2));havoc sep_#t~mem4;sep_#t~post6 := sep_~ret~0;sep_~ret~0 := sep_#t~post6 - 1;havoc sep_#t~post6; 1939#L18-2 sep_#t~post3 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post3;havoc sep_#t~post3; 1938#L18-3 assume !(sep_~i~0 < 5); 1914#L18-4 sep_#res := (if sep_~ret~0 % 4294967296 <= 2147483647 then sep_~ret~0 % 4294967296 else sep_~ret~0 % 4294967296 - 4294967296); 1901#L25 main_#t~ret9 := sep_#res;main_~ret~1 := main_#t~ret9;havoc main_#t~ret9;call main_#t~mem10 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem10;havoc main_#t~mem10;call main_#t~mem11 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem11, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem11;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem4, sep_#t~post5, sep_#t~post6, sep_#t~post3, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; 1902#L18-8 assume !!(sep_~i~0 < 5);call sep_#t~mem4 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1907#L20-2 assume !(0 == (if sep_#t~mem4 < 0 && 0 != sep_#t~mem4 % 2 then sep_#t~mem4 % 2 - 2 else sep_#t~mem4 % 2));havoc sep_#t~mem4;sep_#t~post6 := sep_~ret~0;sep_~ret~0 := sep_#t~post6 - 1;havoc sep_#t~post6; 1915#L18-7 sep_#t~post3 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post3;havoc sep_#t~post3; 1916#L18-8 assume !!(sep_~i~0 < 5);call sep_#t~mem4 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1937#L20-2 assume !(0 == (if sep_#t~mem4 < 0 && 0 != sep_#t~mem4 % 2 then sep_#t~mem4 % 2 - 2 else sep_#t~mem4 % 2));havoc sep_#t~mem4;sep_#t~post6 := sep_~ret~0;sep_~ret~0 := sep_#t~post6 - 1;havoc sep_#t~post6; 1936#L18-7 sep_#t~post3 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post3;havoc sep_#t~post3; 1935#L18-8 assume !!(sep_~i~0 < 5);call sep_#t~mem4 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1934#L20-2 assume !(0 == (if sep_#t~mem4 < 0 && 0 != sep_#t~mem4 % 2 then sep_#t~mem4 % 2 - 2 else sep_#t~mem4 % 2));havoc sep_#t~mem4;sep_#t~post6 := sep_~ret~0;sep_~ret~0 := sep_#t~post6 - 1;havoc sep_#t~post6; 1933#L18-7 sep_#t~post3 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post3;havoc sep_#t~post3; 1931#L18-8 assume !!(sep_~i~0 < 5);call sep_#t~mem4 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1929#L20-2 assume !(0 == (if sep_#t~mem4 < 0 && 0 != sep_#t~mem4 % 2 then sep_#t~mem4 % 2 - 2 else sep_#t~mem4 % 2));havoc sep_#t~mem4;sep_#t~post6 := sep_~ret~0;sep_~ret~0 := sep_#t~post6 - 1;havoc sep_#t~post6; 1927#L18-7 sep_#t~post3 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post3;havoc sep_#t~post3; 1925#L18-8 assume !!(sep_~i~0 < 5);call sep_#t~mem4 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1923#L20-2 assume !(0 == (if sep_#t~mem4 < 0 && 0 != sep_#t~mem4 % 2 then sep_#t~mem4 % 2 - 2 else sep_#t~mem4 % 2));havoc sep_#t~mem4;sep_#t~post6 := sep_~ret~0;sep_~ret~0 := sep_#t~post6 - 1;havoc sep_#t~post6; 1922#L18-7 sep_#t~post3 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post3;havoc sep_#t~post3; 1919#L18-8 assume !(sep_~i~0 < 5); 1908#L18-9 sep_#res := (if sep_~ret~0 % 4294967296 <= 2147483647 then sep_~ret~0 % 4294967296 else sep_~ret~0 % 4294967296 - 4294967296); 1903#L25-1 main_#t~ret12 := sep_#res;main_~ret2~0 := main_#t~ret12;havoc main_#t~ret12;call main_#t~mem13 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem13;havoc main_#t~mem13;main_~i~2 := 0; 1904#L46-3 [2021-08-27 17:35:51,468 INFO L793 eck$LassoCheckResult]: Loop: 1904#L46-3 assume !!(main_~i~2 < 4);call main_#t~mem15 := read~int(main_~#x~0.base, main_~#x~0.offset + 4 * (1 + main_~i~2), 4);call write~int(main_#t~mem15, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~2, 4);havoc main_#t~mem15; 1905#L46-2 main_#t~post14 := main_~i~2;main_~i~2 := 1 + main_#t~post14;havoc main_#t~post14; 1904#L46-3 [2021-08-27 17:35:51,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:35:51,468 INFO L82 PathProgramCache]: Analyzing trace with hash -866233935, now seen corresponding path program 1 times [2021-08-27 17:35:51,469 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:35:51,469 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793347911] [2021-08-27 17:35:51,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:35:51,469 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:35:51,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:35:51,533 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 17:35:51,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:35:51,596 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 17:35:51,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:35:51,597 INFO L82 PathProgramCache]: Analyzing trace with hash 3075, now seen corresponding path program 1 times [2021-08-27 17:35:51,597 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:35:51,597 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398159291] [2021-08-27 17:35:51,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:35:51,597 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:35:51,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:35:51,600 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 17:35:51,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:35:51,602 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 17:35:51,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:35:51,602 INFO L82 PathProgramCache]: Analyzing trace with hash 772846003, now seen corresponding path program 1 times [2021-08-27 17:35:51,602 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:35:51,602 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570396807] [2021-08-27 17:35:51,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:35:51,603 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:35:51,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:35:51,655 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 17:35:51,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:35:51,708 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 17:35:55,855 INFO L210 LassoAnalysis]: Preferences: [2021-08-27 17:35:55,855 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-08-27 17:35:55,855 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-08-27 17:35:55,855 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-08-27 17:35:55,855 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-08-27 17:35:55,855 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:35:55,855 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-08-27 17:35:55,855 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-08-27 17:35:55,855 INFO L133 ssoRankerPreferences]: Filename of dumped script: sep05-1.i_Iteration14_Lasso [2021-08-27 17:35:55,855 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-08-27 17:35:55,855 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-08-27 17:35:55,858 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:35:55,861 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:35:55,864 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:35:55,865 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:35:55,868 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:35:55,870 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:35:55,875 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:35:55,877 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:35:55,879 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:35:55,881 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:35:55,883 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:35:55,885 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:35:55,887 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:35:55,888 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:35:55,890 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:35:55,892 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:35:55,894 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:35:55,895 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:35:55,897 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:35:56,504 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:35:56,506 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:35:56,508 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:35:57,037 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-08-27 17:35:57,037 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-08-27 17:35:57,037 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:35:57,037 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:35:57,040 INFO L229 MonitoredProcess]: Starting monitored process 41 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) [2021-08-27 17:35:57,041 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2021-08-27 17:35:57,042 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 [2021-08-27 17:35:57,047 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:35:57,047 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 17:35:57,047 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:35:57,047 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:35:57,047 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:35:57,048 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 17:35:57,048 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 17:35:57,054 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:35:57,071 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Ended with exit code 0 [2021-08-27 17:35:57,071 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:35:57,071 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:35:57,072 INFO L229 MonitoredProcess]: Starting monitored process 42 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) [2021-08-27 17:35:57,073 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2021-08-27 17:35:57,074 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 [2021-08-27 17:35:57,079 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:35:57,079 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 17:35:57,079 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:35:57,079 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:35:57,079 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:35:57,080 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 17:35:57,080 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 17:35:57,081 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:35:57,095 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Ended with exit code 0 [2021-08-27 17:35:57,095 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:35:57,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:35:57,096 INFO L229 MonitoredProcess]: Starting monitored process 43 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) [2021-08-27 17:35:57,097 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process [2021-08-27 17:35:57,098 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 [2021-08-27 17:35:57,103 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:35:57,103 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 17:35:57,103 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:35:57,103 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:35:57,103 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:35:57,103 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 17:35:57,103 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 17:35:57,104 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:35:57,119 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Forceful destruction successful, exit code 0 [2021-08-27 17:35:57,119 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:35:57,119 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:35:57,119 INFO L229 MonitoredProcess]: Starting monitored process 44 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) [2021-08-27 17:35:57,120 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Waiting until timeout for monitored process [2021-08-27 17:35:57,121 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 [2021-08-27 17:35:57,126 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:35:57,126 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:35:57,126 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:35:57,126 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:35:57,128 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 17:35:57,128 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 17:35:57,130 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:35:57,144 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Forceful destruction successful, exit code 0 [2021-08-27 17:35:57,144 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:35:57,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:35:57,145 INFO L229 MonitoredProcess]: Starting monitored process 45 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) [2021-08-27 17:35:57,146 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Waiting until timeout for monitored process [2021-08-27 17:35:57,147 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 [2021-08-27 17:35:57,152 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:35:57,152 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 17:35:57,152 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:35:57,152 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:35:57,152 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:35:57,153 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 17:35:57,153 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 17:35:57,157 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:35:57,173 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Forceful destruction successful, exit code 0 [2021-08-27 17:35:57,174 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:35:57,174 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:35:57,174 INFO L229 MonitoredProcess]: Starting monitored process 46 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) [2021-08-27 17:35:57,175 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Waiting until timeout for monitored process [2021-08-27 17:35:57,176 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 [2021-08-27 17:35:57,181 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:35:57,182 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:35:57,182 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:35:57,182 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:35:57,185 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 17:35:57,185 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 17:35:57,195 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:35:57,210 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Ended with exit code 0 [2021-08-27 17:35:57,210 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:35:57,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:35:57,211 INFO L229 MonitoredProcess]: Starting monitored process 47 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) [2021-08-27 17:35:57,214 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Waiting until timeout for monitored process [2021-08-27 17:35:57,215 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 [2021-08-27 17:35:57,220 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:35:57,220 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 17:35:57,220 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:35:57,220 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:35:57,220 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:35:57,221 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 17:35:57,221 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 17:35:57,222 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:35:57,238 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Ended with exit code 0 [2021-08-27 17:35:57,239 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:35:57,239 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:35:57,239 INFO L229 MonitoredProcess]: Starting monitored process 48 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) [2021-08-27 17:35:57,240 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Waiting until timeout for monitored process [2021-08-27 17:35:57,241 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 [2021-08-27 17:35:57,246 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:35:57,246 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:35:57,246 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:35:57,246 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:35:57,247 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 17:35:57,247 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 17:35:57,249 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:35:57,267 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Forceful destruction successful, exit code 0 [2021-08-27 17:35:57,267 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:35:57,267 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:35:57,268 INFO L229 MonitoredProcess]: Starting monitored process 49 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) [2021-08-27 17:35:57,268 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Waiting until timeout for monitored process [2021-08-27 17:35:57,270 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 [2021-08-27 17:35:57,275 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:35:57,275 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:35:57,275 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:35:57,275 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:35:57,276 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 17:35:57,276 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 17:35:57,278 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:35:57,295 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Forceful destruction successful, exit code 0 [2021-08-27 17:35:57,295 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:35:57,295 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:35:57,296 INFO L229 MonitoredProcess]: Starting monitored process 50 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) [2021-08-27 17:35:57,296 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Waiting until timeout for monitored process [2021-08-27 17:35:57,298 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 [2021-08-27 17:35:57,303 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:35:57,303 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 17:35:57,303 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:35:57,303 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:35:57,303 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:35:57,304 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 17:35:57,304 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 17:35:57,305 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:35:57,320 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Ended with exit code 0 [2021-08-27 17:35:57,320 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:35:57,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:35:57,321 INFO L229 MonitoredProcess]: Starting monitored process 51 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) [2021-08-27 17:35:57,322 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Waiting until timeout for monitored process [2021-08-27 17:35:57,323 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 [2021-08-27 17:35:57,328 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:35:57,328 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 17:35:57,328 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:35:57,328 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:35:57,328 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:35:57,328 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 17:35:57,328 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 17:35:57,329 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:35:57,344 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Ended with exit code 0 [2021-08-27 17:35:57,344 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:35:57,344 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:35:57,345 INFO L229 MonitoredProcess]: Starting monitored process 52 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) [2021-08-27 17:35:57,345 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Waiting until timeout for monitored process [2021-08-27 17:35:57,346 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 [2021-08-27 17:35:57,352 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:35:57,352 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 17:35:57,352 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:35:57,352 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:35:57,352 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:35:57,353 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 17:35:57,353 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 17:35:57,360 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:35:57,375 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Forceful destruction successful, exit code 0 [2021-08-27 17:35:57,376 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:35:57,376 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:35:57,376 INFO L229 MonitoredProcess]: Starting monitored process 53 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) [2021-08-27 17:35:57,377 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Waiting until timeout for monitored process [2021-08-27 17:35:57,379 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 [2021-08-27 17:35:57,385 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:35:57,385 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 17:35:57,385 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:35:57,385 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:35:57,385 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:35:57,386 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 17:35:57,386 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 17:35:57,387 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:35:57,401 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Ended with exit code 0 [2021-08-27 17:35:57,401 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:35:57,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:35:57,402 INFO L229 MonitoredProcess]: Starting monitored process 54 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) [2021-08-27 17:35:57,403 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Waiting until timeout for monitored process [2021-08-27 17:35:57,405 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 [2021-08-27 17:35:57,410 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:35:57,410 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 17:35:57,410 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:35:57,410 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:35:57,410 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:35:57,411 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 17:35:57,411 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 17:35:57,415 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:35:57,429 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Ended with exit code 0 [2021-08-27 17:35:57,429 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:35:57,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:35:57,431 INFO L229 MonitoredProcess]: Starting monitored process 55 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) [2021-08-27 17:35:57,433 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Waiting until timeout for monitored process [2021-08-27 17:35:57,433 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 [2021-08-27 17:35:57,438 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:35:57,438 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:35:57,439 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:35:57,439 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:35:57,440 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 17:35:57,440 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 17:35:57,442 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:35:57,457 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Ended with exit code 0 [2021-08-27 17:35:57,463 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:35:57,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:35:57,464 INFO L229 MonitoredProcess]: Starting monitored process 56 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) [2021-08-27 17:35:57,472 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Waiting until timeout for monitored process [2021-08-27 17:35:57,473 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 [2021-08-27 17:35:57,478 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:35:57,478 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 17:35:57,478 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:35:57,478 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:35:57,478 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:35:57,478 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 17:35:57,478 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 17:35:57,479 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:35:57,493 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Forceful destruction successful, exit code 0 [2021-08-27 17:35:57,494 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:35:57,494 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:35:57,494 INFO L229 MonitoredProcess]: Starting monitored process 57 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) [2021-08-27 17:35:57,495 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Waiting until timeout for monitored process [2021-08-27 17:35:57,496 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 [2021-08-27 17:35:57,501 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:35:57,501 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 17:35:57,501 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:35:57,501 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:35:57,501 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:35:57,502 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 17:35:57,502 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 17:35:57,502 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:35:57,516 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Ended with exit code 0 [2021-08-27 17:35:57,517 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:35:57,517 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:35:57,517 INFO L229 MonitoredProcess]: Starting monitored process 58 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) [2021-08-27 17:35:57,518 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Waiting until timeout for monitored process [2021-08-27 17:35:57,519 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 [2021-08-27 17:35:57,524 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:35:57,524 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 17:35:57,524 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:35:57,524 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:35:57,524 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:35:57,526 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 17:35:57,527 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 17:35:57,527 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:35:57,542 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Ended with exit code 0 [2021-08-27 17:35:57,542 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:35:57,542 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:35:57,543 INFO L229 MonitoredProcess]: Starting monitored process 59 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) [2021-08-27 17:35:57,543 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Waiting until timeout for monitored process [2021-08-27 17:35:57,544 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 [2021-08-27 17:35:57,549 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:35:57,550 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:35:57,550 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:35:57,550 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:35:57,551 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 17:35:57,551 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 17:35:57,553 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:35:57,568 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Ended with exit code 0 [2021-08-27 17:35:57,568 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:35:57,568 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:35:57,568 INFO L229 MonitoredProcess]: Starting monitored process 60 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) [2021-08-27 17:35:57,574 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Waiting until timeout for monitored process [2021-08-27 17:35:57,575 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 [2021-08-27 17:35:57,581 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:35:57,581 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:35:57,581 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:35:57,581 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:35:57,583 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 17:35:57,583 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 17:35:57,598 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:35:57,619 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Forceful destruction successful, exit code 0 [2021-08-27 17:35:57,620 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:35:57,620 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:35:57,621 INFO L229 MonitoredProcess]: Starting monitored process 61 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) [2021-08-27 17:35:57,643 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Waiting until timeout for monitored process [2021-08-27 17:35:57,644 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 [2021-08-27 17:35:57,649 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:35:57,649 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:35:57,649 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:35:57,649 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:35:57,650 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 17:35:57,650 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 17:35:57,653 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:35:57,667 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Forceful destruction successful, exit code 0 [2021-08-27 17:35:57,667 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:35:57,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:35:57,668 INFO L229 MonitoredProcess]: Starting monitored process 62 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) [2021-08-27 17:35:57,668 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Waiting until timeout for monitored process [2021-08-27 17:35:57,669 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 [2021-08-27 17:35:57,674 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:35:57,675 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 17:35:57,675 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:35:57,675 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:35:57,675 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:35:57,675 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 17:35:57,675 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 17:35:57,684 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:35:57,699 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Ended with exit code 0 [2021-08-27 17:35:57,699 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:35:57,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:35:57,700 INFO L229 MonitoredProcess]: Starting monitored process 63 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) [2021-08-27 17:35:57,700 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Waiting until timeout for monitored process [2021-08-27 17:35:57,701 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 [2021-08-27 17:35:57,706 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:35:57,707 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 17:35:57,707 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:35:57,707 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:35:57,707 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:35:57,707 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 17:35:57,707 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 17:35:57,708 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:35:57,723 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Ended with exit code 0 [2021-08-27 17:35:57,723 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:35:57,723 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:35:57,724 INFO L229 MonitoredProcess]: Starting monitored process 64 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) [2021-08-27 17:35:57,724 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Waiting until timeout for monitored process [2021-08-27 17:35:57,726 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 [2021-08-27 17:35:57,731 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:35:57,731 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:35:57,731 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:35:57,732 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:35:57,733 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 17:35:57,733 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 17:35:57,735 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:35:57,749 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Ended with exit code 0 [2021-08-27 17:35:57,749 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:35:57,750 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:35:57,750 INFO L229 MonitoredProcess]: Starting monitored process 65 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) [2021-08-27 17:35:57,751 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Waiting until timeout for monitored process [2021-08-27 17:35:57,752 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 [2021-08-27 17:35:57,757 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:35:57,757 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:35:57,758 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:35:57,758 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:35:57,759 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 17:35:57,759 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 17:35:57,761 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:35:57,775 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Ended with exit code 0 [2021-08-27 17:35:57,776 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:35:57,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:35:57,776 INFO L229 MonitoredProcess]: Starting monitored process 66 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) [2021-08-27 17:35:57,777 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Waiting until timeout for monitored process [2021-08-27 17:35:57,778 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 [2021-08-27 17:35:57,783 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:35:57,783 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 17:35:57,783 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:35:57,783 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:35:57,783 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:35:57,784 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 17:35:57,784 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 17:35:57,785 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:35:57,799 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Ended with exit code 0 [2021-08-27 17:35:57,800 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:35:57,800 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:35:57,800 INFO L229 MonitoredProcess]: Starting monitored process 67 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) [2021-08-27 17:35:57,801 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Waiting until timeout for monitored process [2021-08-27 17:35:57,802 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 [2021-08-27 17:35:57,808 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:35:57,808 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:35:57,808 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:35:57,808 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:35:57,812 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 17:35:57,812 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 17:35:57,820 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:35:57,835 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Ended with exit code 0 [2021-08-27 17:35:57,835 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:35:57,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:35:57,836 INFO L229 MonitoredProcess]: Starting monitored process 68 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) [2021-08-27 17:35:57,838 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Waiting until timeout for monitored process [2021-08-27 17:35:57,839 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 [2021-08-27 17:35:57,844 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:35:57,844 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:35:57,844 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:35:57,844 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:35:57,845 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 17:35:57,845 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 17:35:57,852 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:35:57,866 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Ended with exit code 0 [2021-08-27 17:35:57,867 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:35:57,867 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:35:57,867 INFO L229 MonitoredProcess]: Starting monitored process 69 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) [2021-08-27 17:35:57,868 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Waiting until timeout for monitored process [2021-08-27 17:35:57,869 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 [2021-08-27 17:35:57,874 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:35:57,874 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 17:35:57,875 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:35:57,875 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:35:57,875 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:35:57,875 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 17:35:57,875 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 17:35:57,876 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:35:57,891 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Ended with exit code 0 [2021-08-27 17:35:57,891 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:35:57,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:35:57,892 INFO L229 MonitoredProcess]: Starting monitored process 70 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) [2021-08-27 17:35:57,892 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Waiting until timeout for monitored process [2021-08-27 17:35:57,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 [2021-08-27 17:35:57,899 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:35:57,899 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:35:57,899 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:35:57,899 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:35:57,900 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 17:35:57,900 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 17:35:57,904 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:35:57,919 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Ended with exit code 0 [2021-08-27 17:35:57,919 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:35:57,919 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:35:57,920 INFO L229 MonitoredProcess]: Starting monitored process 71 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) [2021-08-27 17:35:57,920 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Waiting until timeout for monitored process [2021-08-27 17:35:57,922 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 [2021-08-27 17:35:57,926 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:35:57,927 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 17:35:57,927 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:35:57,927 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:35:57,927 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:35:57,927 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 17:35:57,927 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 17:35:57,928 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:35:57,943 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Ended with exit code 0 [2021-08-27 17:35:57,943 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:35:57,943 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:35:57,944 INFO L229 MonitoredProcess]: Starting monitored process 72 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) [2021-08-27 17:35:57,945 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Waiting until timeout for monitored process [2021-08-27 17:35:57,946 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 [2021-08-27 17:35:57,951 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:35:57,951 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:35:57,952 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:35:57,952 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:35:57,953 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 17:35:57,953 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 17:35:57,956 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:35:57,971 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Ended with exit code 0 [2021-08-27 17:35:57,971 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:35:57,971 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:35:57,972 INFO L229 MonitoredProcess]: Starting monitored process 73 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) [2021-08-27 17:35:57,972 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Waiting until timeout for monitored process [2021-08-27 17:35:57,974 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 [2021-08-27 17:35:57,979 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:35:57,979 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:35:57,979 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:35:57,979 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:35:57,982 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 17:35:57,982 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 17:35:57,987 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:35:58,001 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Forceful destruction successful, exit code 0 [2021-08-27 17:35:58,002 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:35:58,002 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:35:58,002 INFO L229 MonitoredProcess]: Starting monitored process 74 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) [2021-08-27 17:35:58,003 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Waiting until timeout for monitored process [2021-08-27 17:35:58,004 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 [2021-08-27 17:35:58,009 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:35:58,009 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:35:58,009 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:35:58,010 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:35:58,017 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 17:35:58,017 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 17:35:58,036 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-08-27 17:35:58,071 INFO L443 ModelExtractionUtils]: Simplification made 14 calls to the SMT solver. [2021-08-27 17:35:58,072 INFO L444 ModelExtractionUtils]: 4 out of 28 variables were initially zero. Simplification set additionally 21 variables to zero. [2021-08-27 17:35:58,073 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:35:58,073 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:35:58,074 INFO L229 MonitoredProcess]: Starting monitored process 75 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) [2021-08-27 17:35:58,075 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (75)] Waiting until timeout for monitored process [2021-08-27 17:35:58,076 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-08-27 17:35:58,081 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2021-08-27 17:35:58,082 INFO L513 LassoAnalysis]: Proved termination. [2021-08-27 17:35:58,082 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~2) = -2*ULTIMATE.start_main_~i~2 + 7 Supporting invariants [] [2021-08-27 17:35:58,098 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Forceful destruction successful, exit code 0 [2021-08-27 17:35:58,225 INFO L297 tatePredicateManager]: 48 out of 48 supporting invariants were superfluous and have been removed [2021-08-27 17:35:58,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:35:58,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 17:35:58,292 INFO L263 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 2 conjunts are in the unsatisfiable core [2021-08-27 17:35:58,293 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 17:35:58,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 17:35:58,454 INFO L263 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 4 conjunts are in the unsatisfiable core [2021-08-27 17:35:58,454 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 17:35:58,470 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 17:35:58,471 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 [2021-08-27 17:35:58,472 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 52 states and 63 transitions. cyclomatic complexity: 13 Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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) [2021-08-27 17:35:58,482 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 52 states and 63 transitions. cyclomatic complexity: 13. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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 54 states and 66 transitions. Complement of second has 4 states. [2021-08-27 17:35:58,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2021-08-27 17:35:58,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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) [2021-08-27 17:35:58,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 22 transitions. [2021-08-27 17:35:58,483 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 22 transitions. Stem has 50 letters. Loop has 2 letters. [2021-08-27 17:35:58,483 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-27 17:35:58,483 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 22 transitions. Stem has 52 letters. Loop has 2 letters. [2021-08-27 17:35:58,483 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-27 17:35:58,484 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 22 transitions. Stem has 50 letters. Loop has 4 letters. [2021-08-27 17:35:58,484 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-27 17:35:58,484 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 54 states and 66 transitions. [2021-08-27 17:35:58,485 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2021-08-27 17:35:58,485 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 54 states to 0 states and 0 transitions. [2021-08-27 17:35:58,485 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2021-08-27 17:35:58,485 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2021-08-27 17:35:58,485 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2021-08-27 17:35:58,485 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 17:35:58,485 INFO L681 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-08-27 17:35:58,485 INFO L704 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-08-27 17:35:58,485 INFO L587 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-08-27 17:35:58,486 INFO L425 BuchiCegarLoop]: ======== Iteration 15============ [2021-08-27 17:35:58,486 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2021-08-27 17:35:58,486 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2021-08-27 17:35:58,486 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2021-08-27 17:35:58,491 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 27.08 05:35:58 BoogieIcfgContainer [2021-08-27 17:35:58,491 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2021-08-27 17:35:58,491 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-08-27 17:35:58,491 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-08-27 17:35:58,492 INFO L275 PluginConnector]: Witness Printer initialized [2021-08-27 17:35:58,492 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 05:35:42" (3/4) ... [2021-08-27 17:35:58,494 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-08-27 17:35:58,494 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-08-27 17:35:58,495 INFO L168 Benchmark]: Toolchain (without parser) took 16359.08 ms. Allocated memory was 60.8 MB in the beginning and 243.3 MB in the end (delta: 182.5 MB). Free memory was 40.1 MB in the beginning and 73.3 MB in the end (delta: -33.2 MB). Peak memory consumption was 147.7 MB. Max. memory is 16.1 GB. [2021-08-27 17:35:58,495 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 60.8 MB. Free memory was 43.2 MB in the beginning and 43.2 MB in the end (delta: 42.9 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-27 17:35:58,496 INFO L168 Benchmark]: CACSL2BoogieTranslator took 201.81 ms. Allocated memory is still 60.8 MB. Free memory was 39.8 MB in the beginning and 30.1 MB in the end (delta: 9.8 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2021-08-27 17:35:58,496 INFO L168 Benchmark]: Boogie Procedure Inliner took 67.50 ms. Allocated memory is still 60.8 MB. Free memory was 29.9 MB in the beginning and 44.1 MB in the end (delta: -14.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-08-27 17:35:58,496 INFO L168 Benchmark]: Boogie Preprocessor took 23.28 ms. Allocated memory is still 60.8 MB. Free memory was 44.1 MB in the beginning and 42.6 MB in the end (delta: 1.5 MB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-27 17:35:58,496 INFO L168 Benchmark]: RCFGBuilder took 423.68 ms. Allocated memory was 60.8 MB in the beginning and 73.4 MB in the end (delta: 12.6 MB). Free memory was 42.6 MB in the beginning and 53.2 MB in the end (delta: -10.6 MB). Peak memory consumption was 20.6 MB. Max. memory is 16.1 GB. [2021-08-27 17:35:58,497 INFO L168 Benchmark]: BuchiAutomizer took 15633.94 ms. Allocated memory was 73.4 MB in the beginning and 243.3 MB in the end (delta: 169.9 MB). Free memory was 53.2 MB in the beginning and 73.3 MB in the end (delta: -20.0 MB). Peak memory consumption was 149.1 MB. Max. memory is 16.1 GB. [2021-08-27 17:35:58,497 INFO L168 Benchmark]: Witness Printer took 2.91 ms. Allocated memory is still 243.3 MB. Free memory is still 73.3 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-08-27 17:35:58,498 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.17 ms. Allocated memory is still 60.8 MB. Free memory was 43.2 MB in the beginning and 43.2 MB in the end (delta: 42.9 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 201.81 ms. Allocated memory is still 60.8 MB. Free memory was 39.8 MB in the beginning and 30.1 MB in the end (delta: 9.8 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 67.50 ms. Allocated memory is still 60.8 MB. Free memory was 29.9 MB in the beginning and 44.1 MB in the end (delta: -14.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 23.28 ms. Allocated memory is still 60.8 MB. Free memory was 44.1 MB in the beginning and 42.6 MB in the end (delta: 1.5 MB). There was no memory consumed. Max. memory is 16.1 GB. * RCFGBuilder took 423.68 ms. Allocated memory was 60.8 MB in the beginning and 73.4 MB in the end (delta: 12.6 MB). Free memory was 42.6 MB in the beginning and 53.2 MB in the end (delta: -10.6 MB). Peak memory consumption was 20.6 MB. Max. memory is 16.1 GB. * BuchiAutomizer took 15633.94 ms. Allocated memory was 73.4 MB in the beginning and 243.3 MB in the end (delta: 169.9 MB). Free memory was 53.2 MB in the beginning and 73.3 MB in the end (delta: -20.0 MB). Peak memory consumption was 149.1 MB. Max. memory is 16.1 GB. * Witness Printer took 2.91 ms. Allocated memory is still 243.3 MB. Free memory is still 73.3 MB. There was no memory consumed. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 14 terminating modules (11 trivial, 3 deterministic, 0 nondeterministic). One deterministic module has affine ranking function 9 * unknown-#length-unknown[x] + -8 * i and consists of 5 locations. One deterministic module has affine ranking function -8 * i + 9 * unknown-#length-unknown[x] and consists of 4 locations. One deterministic module has affine ranking function 7 + -2 * i and consists of 3 locations. 11 modules have a trivial ranking function, the largest among these consists of 8 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 15.6s and 15 iterations. TraceHistogramMax:5. Analysis of lassos took 14.4s. Construction of modules took 0.2s. Büchi inclusion checks took 0.7s. Highest rank in rank-based complementation 3. Minimization of det autom 14. Minimization of nondet autom 0. Automata minimization 42.1ms AutomataMinimizationTime, 13 MinimizatonAttempts, 63 StatesRemovedByMinimization, 9 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 56 states and ocurred in iteration 12. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 334 SDtfs, 332 SDslu, 505 SDs, 0 SdLazy, 319 SolverSat, 87 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 288.0ms Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU10 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital260 mio100 ax100 hnf100 lsp93 ukn52 mio100 lsp44 div100 bol100 ite100 ukn100 eq162 hnf91 smp93 dnf100 smp100 tf100 neg100 sie103 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 43ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2021-08-27 17:35:58,525 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (75)] Forceful destruction successful, exit code 0 [2021-08-27 17:35:58,736 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Ended with exit code 0 [2021-08-27 17:35:58,936 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Ended with exit code 0 [2021-08-27 17:35:59,137 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Ended with exit code 0 [2021-08-27 17:35:59,337 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Forceful destruction successful, exit code 0 [2021-08-27 17:35:59,537 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Ended with exit code 0 [2021-08-27 17:35:59,738 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2021-08-27 17:35:59,938 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2021-08-27 17:36:00,138 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2021-08-27 17:36:00,340 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2021-08-27 17:36:00,545 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request...