./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/loops/invert_string-3.c --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/loops/invert_string-3.c -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 e0ffc577d494a5308847d196b5326d78dd21a5a9 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis No suitable file found in config dir /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config using search string *Termination*32bit*_Bitvector*.epf No suitable settings file found using Termination*32bit*_Bitvector ERROR: UNSUPPORTED PROPERTY Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: MapEliminator tries to combine Int and (Array Int Int) --- Real Ultimate output --- This is Ultimate 0.2.1-dev-20ed64e [2021-08-27 15:17:54,648 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-27 15:17:54,650 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-27 15:17:54,682 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-27 15:17:54,682 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-27 15:17:54,685 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-27 15:17:54,686 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-27 15:17:54,690 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-27 15:17:54,692 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-27 15:17:54,695 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-27 15:17:54,696 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-27 15:17:54,698 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-27 15:17:54,699 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-27 15:17:54,701 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-27 15:17:54,702 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-27 15:17:54,705 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-27 15:17:54,705 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-27 15:17:54,706 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-27 15:17:54,707 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-27 15:17:54,708 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-27 15:17:54,708 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-27 15:17:54,709 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-27 15:17:54,710 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-27 15:17:54,710 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-27 15:17:54,713 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-27 15:17:54,713 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-27 15:17:54,713 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-27 15:17:54,714 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-27 15:17:54,714 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-27 15:17:54,714 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-27 15:17:54,715 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-27 15:17:54,715 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-27 15:17:54,715 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-27 15:17:54,716 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-27 15:17:54,716 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-27 15:17:54,717 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-27 15:17:54,717 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-27 15:17:54,717 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-27 15:17:54,717 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-27 15:17:54,718 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-27 15:17:54,718 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-27 15:17:54,719 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2021-08-27 15:17:54,733 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-27 15:17:54,734 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-27 15:17:54,734 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-27 15:17:54,734 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-27 15:17:54,735 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-27 15:17:54,735 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-27 15:17:54,735 INFO L138 SettingsManager]: * Use SBE=true [2021-08-27 15:17:54,736 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2021-08-27 15:17:54,736 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2021-08-27 15:17:54,736 INFO L138 SettingsManager]: * Use old map elimination=false [2021-08-27 15:17:54,736 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2021-08-27 15:17:54,736 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2021-08-27 15:17:54,736 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2021-08-27 15:17:54,738 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-27 15:17:54,738 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-27 15:17:54,738 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-08-27 15:17:54,738 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-27 15:17:54,739 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-27 15:17:54,739 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-27 15:17:54,745 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2021-08-27 15:17:54,745 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2021-08-27 15:17:54,745 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2021-08-27 15:17:54,745 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-27 15:17:54,746 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-08-27 15:17:54,746 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2021-08-27 15:17:54,746 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-27 15:17:54,746 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2021-08-27 15:17:54,746 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-27 15:17:54,746 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-27 15:17:54,746 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-27 15:17:54,746 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-27 15:17:54,746 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-08-27 15:17:54,747 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-08-27 15:17:54,747 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 -> e0ffc577d494a5308847d196b5326d78dd21a5a9 [2021-08-27 15:17:54,964 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-27 15:17:54,977 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-27 15:17:54,979 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-27 15:17:54,980 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-27 15:17:54,980 INFO L275 PluginConnector]: CDTParser initialized [2021-08-27 15:17:54,981 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loops/invert_string-3.c [2021-08-27 15:17:55,026 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/020d0bda8/1111cb357d13419490ce07416236c18d/FLAG442405984 [2021-08-27 15:17:55,313 INFO L306 CDTParser]: Found 1 translation units. [2021-08-27 15:17:55,314 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops/invert_string-3.c [2021-08-27 15:17:55,318 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/020d0bda8/1111cb357d13419490ce07416236c18d/FLAG442405984 [2021-08-27 15:17:55,756 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/020d0bda8/1111cb357d13419490ce07416236c18d [2021-08-27 15:17:55,758 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-27 15:17:55,759 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-08-27 15:17:55,764 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-27 15:17:55,764 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-27 15:17:55,766 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-27 15:17:55,767 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 03:17:55" (1/1) ... [2021-08-27 15:17:55,769 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f807821 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:17:55, skipping insertion in model container [2021-08-27 15:17:55,769 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 03:17:55" (1/1) ... [2021-08-27 15:17:55,773 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-27 15:17:55,783 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-27 15:17:55,871 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/loops/invert_string-3.c[327,340] [2021-08-27 15:17:55,880 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-27 15:17:55,885 INFO L203 MainTranslator]: Completed pre-run [2021-08-27 15:17:55,892 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/loops/invert_string-3.c[327,340] [2021-08-27 15:17:55,902 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-27 15:17:55,911 INFO L208 MainTranslator]: Completed translation [2021-08-27 15:17:55,911 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:17:55 WrapperNode [2021-08-27 15:17:55,911 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-27 15:17:55,912 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-08-27 15:17:55,912 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-08-27 15:17:55,912 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-08-27 15:17:55,944 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:17:55" (1/1) ... [2021-08-27 15:17:55,973 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:17:55" (1/1) ... [2021-08-27 15:17:55,993 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-08-27 15:17:55,994 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-27 15:17:55,994 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-27 15:17:55,994 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-27 15:17:56,000 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:17:55" (1/1) ... [2021-08-27 15:17:56,000 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:17:55" (1/1) ... [2021-08-27 15:17:56,004 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:17:55" (1/1) ... [2021-08-27 15:17:56,004 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:17:55" (1/1) ... [2021-08-27 15:17:56,015 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:17:55" (1/1) ... [2021-08-27 15:17:56,018 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:17:55" (1/1) ... [2021-08-27 15:17:56,024 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:17:55" (1/1) ... [2021-08-27 15:17:56,027 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-27 15:17:56,028 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-27 15:17:56,028 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-27 15:17:56,028 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-27 15:17:56,030 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:17:55" (1/1) ... [2021-08-27 15:17:56,034 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 15:17:56,043 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 15:17:56,052 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 15:17:56,068 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 15:17:56,087 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-08-27 15:17:56,087 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-27 15:17:56,088 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-08-27 15:17:56,088 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-27 15:17:56,088 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-27 15:17:56,088 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-08-27 15:17:56,088 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-08-27 15:17:56,369 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-27 15:17:56,369 INFO L299 CfgBuilder]: Removed 9 assume(true) statements. [2021-08-27 15:17:56,373 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 03:17:56 BoogieIcfgContainer [2021-08-27 15:17:56,373 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-27 15:17:56,374 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2021-08-27 15:17:56,374 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2021-08-27 15:17:56,376 INFO L275 PluginConnector]: BuchiAutomizer initialized [2021-08-27 15:17:56,376 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-08-27 15:17:56,377 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 27.08 03:17:55" (1/3) ... [2021-08-27 15:17:56,377 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@465d4007 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 27.08 03:17:56, skipping insertion in model container [2021-08-27 15:17:56,377 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-08-27 15:17:56,378 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:17:55" (2/3) ... [2021-08-27 15:17:56,385 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@465d4007 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 27.08 03:17:56, skipping insertion in model container [2021-08-27 15:17:56,385 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-08-27 15:17:56,385 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 03:17:56" (3/3) ... [2021-08-27 15:17:56,386 INFO L389 chiAutomizerObserver]: Analyzing ICFG invert_string-3.c [2021-08-27 15:17:56,430 INFO L359 BuchiCegarLoop]: Interprodecural is true [2021-08-27 15:17:56,430 INFO L360 BuchiCegarLoop]: Hoare is false [2021-08-27 15:17:56,430 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2021-08-27 15:17:56,431 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2021-08-27 15:17:56,431 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-08-27 15:17:56,431 INFO L364 BuchiCegarLoop]: Difference is false [2021-08-27 15:17:56,431 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-08-27 15:17:56,431 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2021-08-27 15:17:56,442 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 17 states, 16 states have (on average 1.4375) internal successors, (23), 16 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 15:17:56,458 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2021-08-27 15:17:56,458 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 15:17:56,458 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 15:17:56,462 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-08-27 15:17:56,462 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-08-27 15:17:56,462 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2021-08-27 15:17:56,462 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 17 states, 16 states have (on average 1.4375) internal successors, (23), 16 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 15:17:56,463 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2021-08-27 15:17:56,464 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 15:17:56,464 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 15:17:56,464 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-08-27 15:17:56,464 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-08-27 15:17:56,468 INFO L791 eck$LassoCheckResult]: Stem: 4#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(18);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 6#L-1true havoc main_#res;havoc main_#t~nondet8, main_#t~post7, main_#t~mem10, main_#t~post11, main_#t~post9, main_#t~mem13, main_#t~mem14, main_#t~post15, main_#t~post12, main_~max~0, main_~#str1~0.base, main_~#str1~0.offset, main_~#str2~0.base, main_~#str2~0.offset, main_~i~0, main_~j~0;main_~max~0 := 5;call main_~#str1~0.base, main_~#str1~0.offset := #Ultimate.allocOnStack((if main_~max~0 % 4294967296 % 4294967296 <= 2147483647 then main_~max~0 % 4294967296 % 4294967296 else main_~max~0 % 4294967296 % 4294967296 - 4294967296));call main_~#str2~0.base, main_~#str2~0.offset := #Ultimate.allocOnStack((if main_~max~0 % 4294967296 % 4294967296 <= 2147483647 then main_~max~0 % 4294967296 % 4294967296 else main_~max~0 % 4294967296 % 4294967296 - 4294967296));havoc main_~i~0;havoc main_~j~0;main_~i~0 := 0; 15#L18-3true [2021-08-27 15:17:56,468 INFO L793 eck$LassoCheckResult]: Loop: 15#L18-3true assume !!(main_~i~0 % 4294967296 < main_~max~0 % 4294967296);call write~int(main_#t~nondet8, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet8; 10#L18-2true main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 15#L18-3true [2021-08-27 15:17:56,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 15:17:56,476 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2021-08-27 15:17:56,481 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 15:17:56,482 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805617006] [2021-08-27 15:17:56,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 15:17:56,483 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 15:17:56,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 15:17:56,563 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 15:17:56,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 15:17:56,617 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 15:17:56,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 15:17:56,628 INFO L82 PathProgramCache]: Analyzing trace with hash 1283, now seen corresponding path program 1 times [2021-08-27 15:17:56,628 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 15:17:56,629 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272621727] [2021-08-27 15:17:56,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 15:17:56,629 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 15:17:56,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 15:17:56,644 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 15:17:56,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 15:17:56,650 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 15:17:56,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 15:17:56,651 INFO L82 PathProgramCache]: Analyzing trace with hash 925765, now seen corresponding path program 1 times [2021-08-27 15:17:56,651 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 15:17:56,651 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247311565] [2021-08-27 15:17:56,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 15:17:56,652 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 15:17:56,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 15:17:56,695 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 15:17:56,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 15:17:56,729 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 15:17:57,525 INFO L210 LassoAnalysis]: Preferences: [2021-08-27 15:17:57,526 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-08-27 15:17:57,526 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-08-27 15:17:57,526 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-08-27 15:17:57,526 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-08-27 15:17:57,526 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 15:17:57,526 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-08-27 15:17:57,526 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-08-27 15:17:57,526 INFO L133 ssoRankerPreferences]: Filename of dumped script: invert_string-3.c_Iteration1_Lasso [2021-08-27 15:17:57,526 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-08-27 15:17:57,526 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-08-27 15:17:57,537 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 15:17:57,542 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 15:17:57,547 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 15:17:57,550 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 15:17:57,553 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 15:17:57,557 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 15:17:57,561 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 15:17:57,565 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 15:17:57,568 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 15:17:57,571 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 15:17:57,575 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 15:17:57,788 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 15:17:57,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 15:17:57,797 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 15:17:57,799 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 15:17:57,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 15:17:58,144 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-08-27 15:17:58,147 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-08-27 15:17:58,148 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 15:17:58,149 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 15:17:58,149 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 15:17:58,151 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 15:17:58,152 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 15:17:58,160 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 15:17:58,160 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 15:17:58,161 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 15:17:58,161 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 15:17:58,161 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 15:17:58,162 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 15:17:58,162 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 15:17:58,193 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 15:17:58,214 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2021-08-27 15:17:58,214 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 15:17:58,214 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 15:17:58,215 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 15:17:58,217 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 15:17:58,218 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 15:17:58,225 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 15:17:58,225 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 15:17:58,226 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 15:17:58,226 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 15:17:58,229 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 15:17:58,229 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 15:17:58,249 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 15:17:58,268 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 15:17:58,268 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 15:17:58,268 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 15:17:58,273 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 15:17:58,274 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 15:17:58,275 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 15:17:58,282 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 15:17:58,282 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 15:17:58,282 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 15:17:58,282 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 15:17:58,282 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 15:17:58,283 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 15:17:58,283 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 15:17:58,289 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 15:17:58,305 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 15:17:58,306 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 15:17:58,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 15:17:58,307 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 15:17:58,307 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 15:17:58,309 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 15:17:58,315 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 15:17:58,315 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 15:17:58,316 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 15:17:58,316 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 15:17:58,316 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 15:17:58,317 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 15:17:58,317 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 15:17:58,321 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 15:17:58,338 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 15:17:58,339 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 15:17:58,339 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 15:17:58,340 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 15:17:58,341 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 15:17:58,342 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 15:17:58,348 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 15:17:58,348 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 15:17:58,348 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 15:17:58,348 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 15:17:58,350 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 15:17:58,350 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 15:17:58,365 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 15:17:58,393 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 15:17:58,394 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 15:17:58,394 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 15:17:58,395 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 15:17:58,396 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 15:17:58,397 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 15:17:58,404 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 15:17:58,404 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 15:17:58,404 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 15:17:58,404 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 15:17:58,406 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 15:17:58,406 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 15:17:58,416 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 15:17:58,431 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2021-08-27 15:17:58,432 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 15:17:58,432 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 15:17:58,433 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 15:17:58,433 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 15:17:58,435 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 15:17:58,441 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 15:17:58,441 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 15:17:58,441 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 15:17:58,441 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 15:17:58,441 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 15:17:58,442 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 15:17:58,442 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 15:17:58,442 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 15:17:58,458 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 15:17:58,458 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 15:17:58,458 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 15:17:58,459 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 15:17:58,460 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2021-08-27 15:17:58,461 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 15:17:58,468 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 15:17:58,468 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 15:17:58,468 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 15:17:58,468 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 15:17:58,468 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 15:17:58,469 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 15:17:58,469 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 15:17:58,471 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 15:17:58,488 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2021-08-27 15:17:58,489 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 15:17:58,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 15:17:58,490 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 15:17:58,490 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2021-08-27 15:17:58,491 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 15:17:58,498 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 15:17:58,498 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 15:17:58,498 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 15:17:58,499 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 15:17:58,500 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 15:17:58,500 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 15:17:58,506 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 15:17:58,522 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2021-08-27 15:17:58,522 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 15:17:58,522 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 15:17:58,523 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 15:17:58,526 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2021-08-27 15:17:58,527 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 15:17:58,533 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 15:17:58,534 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 15:17:58,534 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 15:17:58,534 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 15:17:58,534 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 15:17:58,534 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 15:17:58,534 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 15:17:58,538 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 15:17:58,553 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2021-08-27 15:17:58,553 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 15:17:58,554 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 15:17:58,557 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 15:17:58,557 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2021-08-27 15:17:58,559 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 15:17:58,565 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 15:17:58,565 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 15:17:58,565 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 15:17:58,565 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 15:17:58,567 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 15:17:58,567 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 15:17:58,574 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 15:17:58,590 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2021-08-27 15:17:58,590 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 15:17:58,590 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 15:17:58,591 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 15:17:58,594 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 15:17:58,596 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 15:17:58,602 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 15:17:58,603 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 15:17:58,603 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 15:17:58,603 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 15:17:58,604 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 15:17:58,604 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 15:17:58,607 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 15:17:58,623 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2021-08-27 15:17:58,623 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 15:17:58,623 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 15:17:58,625 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 15:17:58,628 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 15:17:58,628 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 15:17:58,635 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 15:17:58,635 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 15:17:58,635 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 15:17:58,635 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 15:17:58,635 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 15:17:58,635 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 15:17:58,635 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 15:17:58,640 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 15:17:58,659 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 15:17:58,659 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 15:17:58,659 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 15:17:58,660 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 15:17:58,660 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 15:17:58,662 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 15:17:58,668 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 15:17:58,669 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 15:17:58,669 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 15:17:58,669 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 15:17:58,670 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 15:17:58,670 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 15:17:58,677 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 15:17:58,693 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2021-08-27 15:17:58,693 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 15:17:58,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 15:17:58,694 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 15:17:58,694 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 15:17:58,697 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 15:17:58,703 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 15:17:58,703 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 15:17:58,703 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 15:17:58,703 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 15:17:58,705 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 15:17:58,705 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 15:17:58,707 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 15:17:58,724 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2021-08-27 15:17:58,725 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 15:17:58,725 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 15:17:58,725 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 15:17:58,726 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 15:17:58,728 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 15:17:58,734 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 15:17:58,734 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 15:17:58,734 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 15:17:58,734 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 15:17:58,737 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 15:17:58,737 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 15:17:58,747 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 15:17:58,764 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 15:17:58,764 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 15:17:58,765 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 15:17:58,765 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 15:17:58,766 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 15:17:58,768 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 15:17:58,774 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 15:17:58,775 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 15:17:58,775 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 15:17:58,775 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 15:17:58,778 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 15:17:58,778 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 15:17:58,800 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 15:17:58,817 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 15:17:58,817 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 15:17:58,817 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 15:17:58,818 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 15:17:58,819 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 15:17:58,820 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 15:17:58,827 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 15:17:58,827 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 15:17:58,827 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 15:17:58,828 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 15:17:58,830 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 15:17:58,830 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 15:17:58,836 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 15:17:58,853 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 15:17:58,853 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 15:17:58,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 15:17:58,854 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 15:17:58,855 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 15:17:58,856 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 15:17:58,862 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 15:17:58,863 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 15:17:58,863 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 15:17:58,863 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 15:17:58,864 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 15:17:58,864 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 15:17:58,880 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 15:17:58,901 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 15:17:58,901 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 15:17:58,901 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 15:17:58,906 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 15:17:58,917 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 15:17:58,923 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 15:17:58,923 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 15:17:58,923 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 15:17:58,923 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 15:17:58,925 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 15:17:58,925 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 15:17:58,928 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 15:17:58,940 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 15:17:58,959 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 15:17:58,959 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 15:17:58,959 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 15:17:58,960 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 15:17:58,961 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 15:17:58,963 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 15:17:58,970 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 15:17:58,970 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 15:17:58,970 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 15:17:58,970 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 15:17:58,970 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 15:17:58,971 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 15:17:58,971 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 15:17:58,993 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 15:17:59,009 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 15:17:59,009 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 15:17:59,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 15:17:59,010 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 15:17:59,011 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 15:17:59,012 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 15:17:59,018 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 15:17:59,019 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 15:17:59,019 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 15:17:59,019 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 15:17:59,020 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 15:17:59,020 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 15:17:59,024 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 15:17:59,040 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 15:17:59,040 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 15:17:59,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 15:17:59,041 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 15:17:59,042 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 15:17:59,043 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 15:17:59,050 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 15:17:59,050 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 15:17:59,050 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 15:17:59,050 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 15:17:59,052 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 15:17:59,052 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 15:17:59,058 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 15:17:59,076 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 15:17:59,076 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 15:17:59,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 15:17:59,077 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 15:17:59,077 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 15:17:59,079 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 15:17:59,085 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 15:17:59,086 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 15:17:59,086 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 15:17:59,086 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 15:17:59,092 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 15:17:59,092 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 15:17:59,127 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-08-27 15:17:59,152 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2021-08-27 15:17:59,152 INFO L444 ModelExtractionUtils]: 3 out of 22 variables were initially zero. Simplification set additionally 15 variables to zero. [2021-08-27 15:17:59,153 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 15:17:59,154 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 15:17:59,173 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 15:17:59,208 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-08-27 15:17:59,217 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 15:17:59,225 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2021-08-27 15:17:59,225 INFO L513 LassoAnalysis]: Proved termination. [2021-08-27 15:17:59,226 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0, v_rep(select #length ULTIMATE.start_main_~#str1~0.base)_1, ULTIMATE.start_main_~#str1~0.offset) = -1*ULTIMATE.start_main_~i~0 + 1*v_rep(select #length ULTIMATE.start_main_~#str1~0.base)_1 - 1*ULTIMATE.start_main_~#str1~0.offset Supporting invariants [] [2021-08-27 15:17:59,279 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 15:17:59,317 INFO L297 tatePredicateManager]: 16 out of 16 supporting invariants were superfluous and have been removed [2021-08-27 15:17:59,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 15:17:59,356 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2021-08-27 15:17:59,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 15:17:59,376 INFO L263 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 2 conjunts are in the unsatisfiable core [2021-08-27 15:17:59,376 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 15:17:59,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 15:17:59,392 INFO L263 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2021-08-27 15:17:59,392 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 15:17:59,411 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 15:17:59,420 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 15:17:59,421 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 17 states, 16 states have (on average 1.4375) internal successors, (23), 16 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) 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 15:17:59,448 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 17 states, 16 states have (on average 1.4375) internal successors, (23), 16 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0). 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 33 states and 47 transitions. Complement of second has 8 states. [2021-08-27 15:17:59,449 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 15:17:59,450 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 15:17:59,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 23 transitions. [2021-08-27 15:17:59,451 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 23 transitions. Stem has 2 letters. Loop has 2 letters. [2021-08-27 15:17:59,452 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-27 15:17:59,452 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 23 transitions. Stem has 4 letters. Loop has 2 letters. [2021-08-27 15:17:59,452 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-27 15:17:59,452 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 23 transitions. Stem has 2 letters. Loop has 4 letters. [2021-08-27 15:17:59,452 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-27 15:17:59,453 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 47 transitions. [2021-08-27 15:17:59,454 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2021-08-27 15:17:59,456 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 14 states and 19 transitions. [2021-08-27 15:17:59,457 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2021-08-27 15:17:59,457 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2021-08-27 15:17:59,457 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 19 transitions. [2021-08-27 15:17:59,458 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 15:17:59,458 INFO L681 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2021-08-27 15:17:59,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 19 transitions. [2021-08-27 15:17:59,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2021-08-27 15:17:59,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 13 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 15:17:59,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 19 transitions. [2021-08-27 15:17:59,473 INFO L704 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2021-08-27 15:17:59,474 INFO L587 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2021-08-27 15:17:59,474 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2021-08-27 15:17:59,474 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 19 transitions. [2021-08-27 15:17:59,474 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2021-08-27 15:17:59,474 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 15:17:59,474 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 15:17:59,475 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2021-08-27 15:17:59,475 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-08-27 15:17:59,475 INFO L791 eck$LassoCheckResult]: Stem: 154#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(18);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 155#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~post7, main_#t~mem10, main_#t~post11, main_#t~post9, main_#t~mem13, main_#t~mem14, main_#t~post15, main_#t~post12, main_~max~0, main_~#str1~0.base, main_~#str1~0.offset, main_~#str2~0.base, main_~#str2~0.offset, main_~i~0, main_~j~0;main_~max~0 := 5;call main_~#str1~0.base, main_~#str1~0.offset := #Ultimate.allocOnStack((if main_~max~0 % 4294967296 % 4294967296 <= 2147483647 then main_~max~0 % 4294967296 % 4294967296 else main_~max~0 % 4294967296 % 4294967296 - 4294967296));call main_~#str2~0.base, main_~#str2~0.offset := #Ultimate.allocOnStack((if main_~max~0 % 4294967296 % 4294967296 <= 2147483647 then main_~max~0 % 4294967296 % 4294967296 else main_~max~0 % 4294967296 % 4294967296 - 4294967296));havoc main_~i~0;havoc main_~j~0;main_~i~0 := 0; 158#L18-3 assume !(main_~i~0 % 4294967296 < main_~max~0 % 4294967296); 167#L18-4 call write~int(0, main_~#str1~0.base, main_~#str1~0.offset + (if (main_~max~0 - 1) % 4294967296 % 4294967296 <= 2147483647 then (main_~max~0 - 1) % 4294967296 % 4294967296 else (main_~max~0 - 1) % 4294967296 % 4294967296 - 4294967296), 1);main_~j~0 := 0;main_~i~0 := (if (main_~max~0 - 1) % 4294967296 % 4294967296 <= 2147483647 then (main_~max~0 - 1) % 4294967296 % 4294967296 else (main_~max~0 - 1) % 4294967296 % 4294967296 - 4294967296); 166#L26-3 [2021-08-27 15:17:59,475 INFO L793 eck$LassoCheckResult]: Loop: 166#L26-3 assume !!(main_~i~0 >= 0);call main_#t~mem10 := read~int(main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);call write~int(main_#t~mem10, main_~#str2~0.base, main_~#str2~0.offset + main_~j~0, 1);havoc main_#t~mem10;main_#t~post11 := main_~j~0;main_~j~0 := 1 + main_#t~post11;havoc main_#t~post11; 165#L26-2 main_#t~post9 := main_~i~0;main_~i~0 := main_#t~post9 - 1;havoc main_#t~post9; 166#L26-3 [2021-08-27 15:17:59,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 15:17:59,476 INFO L82 PathProgramCache]: Analyzing trace with hash 925707, now seen corresponding path program 1 times [2021-08-27 15:17:59,476 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 15:17:59,476 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989660353] [2021-08-27 15:17:59,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 15:17:59,476 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 15:17:59,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 15:17:59,599 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 15:17:59,599 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 15:17:59,600 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989660353] [2021-08-27 15:17:59,600 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [989660353] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 15:17:59,601 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 15:17:59,601 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-27 15:17:59,601 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816688246] [2021-08-27 15:17:59,603 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-27 15:17:59,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 15:17:59,603 INFO L82 PathProgramCache]: Analyzing trace with hash 1731, now seen corresponding path program 1 times [2021-08-27 15:17:59,603 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 15:17:59,603 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049317403] [2021-08-27 15:17:59,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 15:17:59,604 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 15:17:59,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 15:17:59,618 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 15:17:59,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 15:17:59,628 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 15:17:59,697 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 15:17:59,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-27 15:17:59,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 15:17:59,700 INFO L87 Difference]: Start difference. First operand 14 states and 19 transitions. cyclomatic complexity: 8 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 15:17:59,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 15:17:59,721 INFO L93 Difference]: Finished difference Result 15 states and 17 transitions. [2021-08-27 15:17:59,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-27 15:17:59,722 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 17 transitions. [2021-08-27 15:17:59,723 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2021-08-27 15:17:59,723 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 14 states and 16 transitions. [2021-08-27 15:17:59,723 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2021-08-27 15:17:59,723 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2021-08-27 15:17:59,723 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 16 transitions. [2021-08-27 15:17:59,723 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 15:17:59,723 INFO L681 BuchiCegarLoop]: Abstraction has 14 states and 16 transitions. [2021-08-27 15:17:59,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 16 transitions. [2021-08-27 15:17:59,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2021-08-27 15:17:59,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 12 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 15:17:59,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 15 transitions. [2021-08-27 15:17:59,724 INFO L704 BuchiCegarLoop]: Abstraction has 13 states and 15 transitions. [2021-08-27 15:17:59,724 INFO L587 BuchiCegarLoop]: Abstraction has 13 states and 15 transitions. [2021-08-27 15:17:59,724 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2021-08-27 15:17:59,724 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 15 transitions. [2021-08-27 15:17:59,725 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2021-08-27 15:17:59,725 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 15:17:59,725 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 15:17:59,725 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2021-08-27 15:17:59,725 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-08-27 15:17:59,725 INFO L791 eck$LassoCheckResult]: Stem: 191#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(18);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 192#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~post7, main_#t~mem10, main_#t~post11, main_#t~post9, main_#t~mem13, main_#t~mem14, main_#t~post15, main_#t~post12, main_~max~0, main_~#str1~0.base, main_~#str1~0.offset, main_~#str2~0.base, main_~#str2~0.offset, main_~i~0, main_~j~0;main_~max~0 := 5;call main_~#str1~0.base, main_~#str1~0.offset := #Ultimate.allocOnStack((if main_~max~0 % 4294967296 % 4294967296 <= 2147483647 then main_~max~0 % 4294967296 % 4294967296 else main_~max~0 % 4294967296 % 4294967296 - 4294967296));call main_~#str2~0.base, main_~#str2~0.offset := #Ultimate.allocOnStack((if main_~max~0 % 4294967296 % 4294967296 <= 2147483647 then main_~max~0 % 4294967296 % 4294967296 else main_~max~0 % 4294967296 % 4294967296 - 4294967296));havoc main_~i~0;havoc main_~j~0;main_~i~0 := 0; 200#L18-3 assume !!(main_~i~0 % 4294967296 < main_~max~0 % 4294967296);call write~int(main_#t~nondet8, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet8; 194#L18-2 main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 195#L18-3 assume !(main_~i~0 % 4294967296 < main_~max~0 % 4294967296); 201#L18-4 call write~int(0, main_~#str1~0.base, main_~#str1~0.offset + (if (main_~max~0 - 1) % 4294967296 % 4294967296 <= 2147483647 then (main_~max~0 - 1) % 4294967296 % 4294967296 else (main_~max~0 - 1) % 4294967296 % 4294967296 - 4294967296), 1);main_~j~0 := 0;main_~i~0 := (if (main_~max~0 - 1) % 4294967296 % 4294967296 <= 2147483647 then (main_~max~0 - 1) % 4294967296 % 4294967296 else (main_~max~0 - 1) % 4294967296 % 4294967296 - 4294967296); 199#L26-3 [2021-08-27 15:17:59,725 INFO L793 eck$LassoCheckResult]: Loop: 199#L26-3 assume !!(main_~i~0 >= 0);call main_#t~mem10 := read~int(main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);call write~int(main_#t~mem10, main_~#str2~0.base, main_~#str2~0.offset + main_~j~0, 1);havoc main_#t~mem10;main_#t~post11 := main_~j~0;main_~j~0 := 1 + main_#t~post11;havoc main_#t~post11; 198#L26-2 main_#t~post9 := main_~i~0;main_~i~0 := main_#t~post9 - 1;havoc main_#t~post9; 199#L26-3 [2021-08-27 15:17:59,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 15:17:59,725 INFO L82 PathProgramCache]: Analyzing trace with hash 889660429, now seen corresponding path program 1 times [2021-08-27 15:17:59,726 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 15:17:59,726 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033593076] [2021-08-27 15:17:59,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 15:17:59,726 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 15:17:59,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 15:17:59,801 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 15:17:59,801 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 15:17:59,801 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033593076] [2021-08-27 15:17:59,802 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1033593076] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 15:17:59,802 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1395030388] [2021-08-27 15:17:59,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 15:17:59,802 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 15:17:59,802 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 15:17:59,805 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 15:17:59,806 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2021-08-27 15:17:59,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 15:17:59,844 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 7 conjunts are in the unsatisfiable core [2021-08-27 15:17:59,845 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 15:17:59,894 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 15:17:59,895 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1395030388] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 15:17:59,895 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 15:17:59,895 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2021-08-27 15:17:59,895 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479645750] [2021-08-27 15:17:59,895 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-27 15:17:59,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 15:17:59,895 INFO L82 PathProgramCache]: Analyzing trace with hash 1731, now seen corresponding path program 2 times [2021-08-27 15:17:59,896 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 15:17:59,896 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026589541] [2021-08-27 15:17:59,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 15:17:59,896 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 15:17:59,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 15:17:59,899 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 15:17:59,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 15:17:59,902 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 15:17:59,958 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 15:17:59,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-27 15:17:59,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-08-27 15:17:59,959 INFO L87 Difference]: Start difference. First operand 13 states and 15 transitions. cyclomatic complexity: 5 Second operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 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 15:17:59,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 15:17:59,995 INFO L93 Difference]: Finished difference Result 16 states and 18 transitions. [2021-08-27 15:17:59,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 15:17:59,995 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 18 transitions. [2021-08-27 15:17:59,996 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2021-08-27 15:17:59,996 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 16 states and 18 transitions. [2021-08-27 15:17:59,996 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2021-08-27 15:17:59,996 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2021-08-27 15:17:59,996 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 18 transitions. [2021-08-27 15:17:59,996 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 15:17:59,996 INFO L681 BuchiCegarLoop]: Abstraction has 16 states and 18 transitions. [2021-08-27 15:17:59,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 18 transitions. [2021-08-27 15:18:00,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2021-08-27 15:18:00,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 14 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 15:18:00,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2021-08-27 15:18:00,003 INFO L704 BuchiCegarLoop]: Abstraction has 15 states and 17 transitions. [2021-08-27 15:18:00,003 INFO L587 BuchiCegarLoop]: Abstraction has 15 states and 17 transitions. [2021-08-27 15:18:00,003 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2021-08-27 15:18:00,003 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 17 transitions. [2021-08-27 15:18:00,005 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2021-08-27 15:18:00,005 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 15:18:00,005 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 15:18:00,006 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1] [2021-08-27 15:18:00,006 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-08-27 15:18:00,006 INFO L791 eck$LassoCheckResult]: Stem: 244#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(18);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 245#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~post7, main_#t~mem10, main_#t~post11, main_#t~post9, main_#t~mem13, main_#t~mem14, main_#t~post15, main_#t~post12, main_~max~0, main_~#str1~0.base, main_~#str1~0.offset, main_~#str2~0.base, main_~#str2~0.offset, main_~i~0, main_~j~0;main_~max~0 := 5;call main_~#str1~0.base, main_~#str1~0.offset := #Ultimate.allocOnStack((if main_~max~0 % 4294967296 % 4294967296 <= 2147483647 then main_~max~0 % 4294967296 % 4294967296 else main_~max~0 % 4294967296 % 4294967296 - 4294967296));call main_~#str2~0.base, main_~#str2~0.offset := #Ultimate.allocOnStack((if main_~max~0 % 4294967296 % 4294967296 <= 2147483647 then main_~max~0 % 4294967296 % 4294967296 else main_~max~0 % 4294967296 % 4294967296 - 4294967296));havoc main_~i~0;havoc main_~j~0;main_~i~0 := 0; 253#L18-3 assume !!(main_~i~0 % 4294967296 < main_~max~0 % 4294967296);call write~int(main_#t~nondet8, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet8; 247#L18-2 main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 248#L18-3 assume !!(main_~i~0 % 4294967296 < main_~max~0 % 4294967296);call write~int(main_#t~nondet8, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet8; 254#L18-2 main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 256#L18-3 assume !(main_~i~0 % 4294967296 < main_~max~0 % 4294967296); 255#L18-4 call write~int(0, main_~#str1~0.base, main_~#str1~0.offset + (if (main_~max~0 - 1) % 4294967296 % 4294967296 <= 2147483647 then (main_~max~0 - 1) % 4294967296 % 4294967296 else (main_~max~0 - 1) % 4294967296 % 4294967296 - 4294967296), 1);main_~j~0 := 0;main_~i~0 := (if (main_~max~0 - 1) % 4294967296 % 4294967296 <= 2147483647 then (main_~max~0 - 1) % 4294967296 % 4294967296 else (main_~max~0 - 1) % 4294967296 % 4294967296 - 4294967296); 252#L26-3 [2021-08-27 15:18:00,006 INFO L793 eck$LassoCheckResult]: Loop: 252#L26-3 assume !!(main_~i~0 >= 0);call main_#t~mem10 := read~int(main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);call write~int(main_#t~mem10, main_~#str2~0.base, main_~#str2~0.offset + main_~j~0, 1);havoc main_#t~mem10;main_#t~post11 := main_~j~0;main_~j~0 := 1 + main_#t~post11;havoc main_#t~post11; 251#L26-2 main_#t~post9 := main_~i~0;main_~i~0 := main_#t~post9 - 1;havoc main_#t~post9; 252#L26-3 [2021-08-27 15:18:00,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 15:18:00,006 INFO L82 PathProgramCache]: Analyzing trace with hash 265236367, now seen corresponding path program 2 times [2021-08-27 15:18:00,007 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 15:18:00,007 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931047663] [2021-08-27 15:18:00,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 15:18:00,007 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 15:18:00,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 15:18:00,109 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 15:18:00,110 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 15:18:00,110 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931047663] [2021-08-27 15:18:00,110 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1931047663] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 15:18:00,110 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [904766776] [2021-08-27 15:18:00,110 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-08-27 15:18:00,110 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 15:18:00,120 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 15:18:00,121 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 15:18:00,122 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2021-08-27 15:18:00,173 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-08-27 15:18:00,174 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-27 15:18:00,175 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 16 conjunts are in the unsatisfiable core [2021-08-27 15:18:00,175 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 15:18:00,212 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: Alternating quantifiers not yet supported [2021-08-27 15:18:00,212 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2021-08-27 15:18:00,212 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2021-08-27 15:18:00,213 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697016914] [2021-08-27 15:18:00,213 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-27 15:18:00,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 15:18:00,213 INFO L82 PathProgramCache]: Analyzing trace with hash 1731, now seen corresponding path program 3 times [2021-08-27 15:18:00,213 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 15:18:00,213 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921948392] [2021-08-27 15:18:00,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 15:18:00,213 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 15:18:00,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 15:18:00,216 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 15:18:00,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 15:18:00,218 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 15:18:00,272 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 15:18:00,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-27 15:18:00,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2021-08-27 15:18:00,273 INFO L87 Difference]: Start difference. First operand 15 states and 17 transitions. cyclomatic complexity: 5 Second operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 15:18:00,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 15:18:00,314 INFO L93 Difference]: Finished difference Result 18 states and 20 transitions. [2021-08-27 15:18:00,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-27 15:18:00,314 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 20 transitions. [2021-08-27 15:18:00,315 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2021-08-27 15:18:00,315 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 18 states and 20 transitions. [2021-08-27 15:18:00,315 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2021-08-27 15:18:00,315 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2021-08-27 15:18:00,315 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 20 transitions. [2021-08-27 15:18:00,315 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 15:18:00,315 INFO L681 BuchiCegarLoop]: Abstraction has 18 states and 20 transitions. [2021-08-27 15:18:00,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 20 transitions. [2021-08-27 15:18:00,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2021-08-27 15:18:00,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 16 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 15:18:00,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2021-08-27 15:18:00,317 INFO L704 BuchiCegarLoop]: Abstraction has 17 states and 19 transitions. [2021-08-27 15:18:00,317 INFO L587 BuchiCegarLoop]: Abstraction has 17 states and 19 transitions. [2021-08-27 15:18:00,317 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2021-08-27 15:18:00,317 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 19 transitions. [2021-08-27 15:18:00,317 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2021-08-27 15:18:00,317 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 15:18:00,317 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 15:18:00,317 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 1, 1, 1, 1] [2021-08-27 15:18:00,317 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-08-27 15:18:00,317 INFO L791 eck$LassoCheckResult]: Stem: 291#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(18);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 292#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~post7, main_#t~mem10, main_#t~post11, main_#t~post9, main_#t~mem13, main_#t~mem14, main_#t~post15, main_#t~post12, main_~max~0, main_~#str1~0.base, main_~#str1~0.offset, main_~#str2~0.base, main_~#str2~0.offset, main_~i~0, main_~j~0;main_~max~0 := 5;call main_~#str1~0.base, main_~#str1~0.offset := #Ultimate.allocOnStack((if main_~max~0 % 4294967296 % 4294967296 <= 2147483647 then main_~max~0 % 4294967296 % 4294967296 else main_~max~0 % 4294967296 % 4294967296 - 4294967296));call main_~#str2~0.base, main_~#str2~0.offset := #Ultimate.allocOnStack((if main_~max~0 % 4294967296 % 4294967296 <= 2147483647 then main_~max~0 % 4294967296 % 4294967296 else main_~max~0 % 4294967296 % 4294967296 - 4294967296));havoc main_~i~0;havoc main_~j~0;main_~i~0 := 0; 300#L18-3 assume !!(main_~i~0 % 4294967296 < main_~max~0 % 4294967296);call write~int(main_#t~nondet8, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet8; 301#L18-2 main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 302#L18-3 assume !!(main_~i~0 % 4294967296 < main_~max~0 % 4294967296);call write~int(main_#t~nondet8, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet8; 294#L18-2 main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 295#L18-3 assume !!(main_~i~0 % 4294967296 < main_~max~0 % 4294967296);call write~int(main_#t~nondet8, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet8; 305#L18-2 main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 304#L18-3 assume !(main_~i~0 % 4294967296 < main_~max~0 % 4294967296); 303#L18-4 call write~int(0, main_~#str1~0.base, main_~#str1~0.offset + (if (main_~max~0 - 1) % 4294967296 % 4294967296 <= 2147483647 then (main_~max~0 - 1) % 4294967296 % 4294967296 else (main_~max~0 - 1) % 4294967296 % 4294967296 - 4294967296), 1);main_~j~0 := 0;main_~i~0 := (if (main_~max~0 - 1) % 4294967296 % 4294967296 <= 2147483647 then (main_~max~0 - 1) % 4294967296 % 4294967296 else (main_~max~0 - 1) % 4294967296 % 4294967296 - 4294967296); 299#L26-3 [2021-08-27 15:18:00,317 INFO L793 eck$LassoCheckResult]: Loop: 299#L26-3 assume !!(main_~i~0 >= 0);call main_#t~mem10 := read~int(main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);call write~int(main_#t~mem10, main_~#str2~0.base, main_~#str2~0.offset + main_~j~0, 1);havoc main_#t~mem10;main_#t~post11 := main_~j~0;main_~j~0 := 1 + main_#t~post11;havoc main_#t~post11; 298#L26-2 main_#t~post9 := main_~i~0;main_~i~0 := main_#t~post9 - 1;havoc main_#t~post9; 299#L26-3 [2021-08-27 15:18:00,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 15:18:00,318 INFO L82 PathProgramCache]: Analyzing trace with hash 1489134225, now seen corresponding path program 3 times [2021-08-27 15:18:00,318 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 15:18:00,318 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838309755] [2021-08-27 15:18:00,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 15:18:00,318 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 15:18:00,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 15:18:00,410 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 15:18:00,410 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 15:18:00,410 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838309755] [2021-08-27 15:18:00,410 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1838309755] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 15:18:00,410 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [801409121] [2021-08-27 15:18:00,410 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-08-27 15:18:00,410 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 15:18:00,410 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 15:18:00,417 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 15:18:00,419 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2021-08-27 15:18:00,480 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2021-08-27 15:18:00,480 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-27 15:18:00,481 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 19 conjunts are in the unsatisfiable core [2021-08-27 15:18:00,482 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 15:18:00,505 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: Alternating quantifiers not yet supported [2021-08-27 15:18:00,506 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2021-08-27 15:18:00,506 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2021-08-27 15:18:00,506 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786339768] [2021-08-27 15:18:00,506 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-27 15:18:00,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 15:18:00,506 INFO L82 PathProgramCache]: Analyzing trace with hash 1731, now seen corresponding path program 4 times [2021-08-27 15:18:00,507 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 15:18:00,507 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238817977] [2021-08-27 15:18:00,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 15:18:00,507 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 15:18:00,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 15:18:00,510 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 15:18:00,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 15:18:00,512 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 15:18:00,563 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 15:18:00,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-27 15:18:00,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2021-08-27 15:18:00,564 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. cyclomatic complexity: 5 Second operand has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 7 states have internal predecessors, (10), 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 15:18:00,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 15:18:00,631 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2021-08-27 15:18:00,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-27 15:18:00,631 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 22 transitions. [2021-08-27 15:18:00,633 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2021-08-27 15:18:00,634 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 20 states and 22 transitions. [2021-08-27 15:18:00,634 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2021-08-27 15:18:00,634 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2021-08-27 15:18:00,634 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 22 transitions. [2021-08-27 15:18:00,634 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 15:18:00,634 INFO L681 BuchiCegarLoop]: Abstraction has 20 states and 22 transitions. [2021-08-27 15:18:00,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 22 transitions. [2021-08-27 15:18:00,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2021-08-27 15:18:00,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.105263157894737) internal successors, (21), 18 states have internal predecessors, (21), 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 15:18:00,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2021-08-27 15:18:00,637 INFO L704 BuchiCegarLoop]: Abstraction has 19 states and 21 transitions. [2021-08-27 15:18:00,637 INFO L587 BuchiCegarLoop]: Abstraction has 19 states and 21 transitions. [2021-08-27 15:18:00,637 INFO L425 BuchiCegarLoop]: ======== Iteration 6============ [2021-08-27 15:18:00,637 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 21 transitions. [2021-08-27 15:18:00,638 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2021-08-27 15:18:00,638 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 15:18:00,638 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 15:18:00,639 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 1, 1, 1, 1] [2021-08-27 15:18:00,639 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-08-27 15:18:00,639 INFO L791 eck$LassoCheckResult]: Stem: 345#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(18);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 346#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~post7, main_#t~mem10, main_#t~post11, main_#t~post9, main_#t~mem13, main_#t~mem14, main_#t~post15, main_#t~post12, main_~max~0, main_~#str1~0.base, main_~#str1~0.offset, main_~#str2~0.base, main_~#str2~0.offset, main_~i~0, main_~j~0;main_~max~0 := 5;call main_~#str1~0.base, main_~#str1~0.offset := #Ultimate.allocOnStack((if main_~max~0 % 4294967296 % 4294967296 <= 2147483647 then main_~max~0 % 4294967296 % 4294967296 else main_~max~0 % 4294967296 % 4294967296 - 4294967296));call main_~#str2~0.base, main_~#str2~0.offset := #Ultimate.allocOnStack((if main_~max~0 % 4294967296 % 4294967296 <= 2147483647 then main_~max~0 % 4294967296 % 4294967296 else main_~max~0 % 4294967296 % 4294967296 - 4294967296));havoc main_~i~0;havoc main_~j~0;main_~i~0 := 0; 354#L18-3 assume !!(main_~i~0 % 4294967296 < main_~max~0 % 4294967296);call write~int(main_#t~nondet8, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet8; 355#L18-2 main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 356#L18-3 assume !!(main_~i~0 % 4294967296 < main_~max~0 % 4294967296);call write~int(main_#t~nondet8, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet8; 348#L18-2 main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 349#L18-3 assume !!(main_~i~0 % 4294967296 < main_~max~0 % 4294967296);call write~int(main_#t~nondet8, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet8; 361#L18-2 main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 360#L18-3 assume !!(main_~i~0 % 4294967296 < main_~max~0 % 4294967296);call write~int(main_#t~nondet8, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet8; 359#L18-2 main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 358#L18-3 assume !(main_~i~0 % 4294967296 < main_~max~0 % 4294967296); 357#L18-4 call write~int(0, main_~#str1~0.base, main_~#str1~0.offset + (if (main_~max~0 - 1) % 4294967296 % 4294967296 <= 2147483647 then (main_~max~0 - 1) % 4294967296 % 4294967296 else (main_~max~0 - 1) % 4294967296 % 4294967296 - 4294967296), 1);main_~j~0 := 0;main_~i~0 := (if (main_~max~0 - 1) % 4294967296 % 4294967296 <= 2147483647 then (main_~max~0 - 1) % 4294967296 % 4294967296 else (main_~max~0 - 1) % 4294967296 % 4294967296 - 4294967296); 353#L26-3 [2021-08-27 15:18:00,639 INFO L793 eck$LassoCheckResult]: Loop: 353#L26-3 assume !!(main_~i~0 >= 0);call main_#t~mem10 := read~int(main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);call write~int(main_#t~mem10, main_~#str2~0.base, main_~#str2~0.offset + main_~j~0, 1);havoc main_#t~mem10;main_#t~post11 := main_~j~0;main_~j~0 := 1 + main_#t~post11;havoc main_#t~post11; 352#L26-2 main_#t~post9 := main_~i~0;main_~i~0 := main_#t~post9 - 1;havoc main_#t~post9; 353#L26-3 [2021-08-27 15:18:00,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 15:18:00,639 INFO L82 PathProgramCache]: Analyzing trace with hash 833936659, now seen corresponding path program 4 times [2021-08-27 15:18:00,639 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 15:18:00,640 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738802026] [2021-08-27 15:18:00,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 15:18:00,640 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 15:18:00,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 15:18:00,755 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 15:18:00,756 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 15:18:00,756 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738802026] [2021-08-27 15:18:00,756 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [738802026] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 15:18:00,756 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1028516802] [2021-08-27 15:18:00,756 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-08-27 15:18:00,756 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 15:18:00,756 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 15:18:00,764 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 15:18:00,772 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2021-08-27 15:18:00,829 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-08-27 15:18:00,829 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-27 15:18:00,830 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 19 conjunts are in the unsatisfiable core [2021-08-27 15:18:00,830 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 15:18:00,869 INFO L354 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2021-08-27 15:18:00,870 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 15 [2021-08-27 15:18:00,876 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-08-27 15:18:01,066 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 15:18:01,066 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1028516802] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 15:18:01,066 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 15:18:01,066 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 13 [2021-08-27 15:18:01,067 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348841030] [2021-08-27 15:18:01,067 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-27 15:18:01,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 15:18:01,067 INFO L82 PathProgramCache]: Analyzing trace with hash 1731, now seen corresponding path program 5 times [2021-08-27 15:18:01,068 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 15:18:01,068 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722968002] [2021-08-27 15:18:01,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 15:18:01,068 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 15:18:01,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 15:18:01,071 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 15:18:01,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 15:18:01,076 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 15:18:01,147 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 15:18:01,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-08-27 15:18:01,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2021-08-27 15:18:01,148 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. cyclomatic complexity: 5 Second operand has 13 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 13 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 15:18:01,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 15:18:01,241 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2021-08-27 15:18:01,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-27 15:18:01,242 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 24 transitions. [2021-08-27 15:18:01,244 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2021-08-27 15:18:01,244 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 22 states and 24 transitions. [2021-08-27 15:18:01,244 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2021-08-27 15:18:01,244 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2021-08-27 15:18:01,244 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 24 transitions. [2021-08-27 15:18:01,244 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 15:18:01,244 INFO L681 BuchiCegarLoop]: Abstraction has 22 states and 24 transitions. [2021-08-27 15:18:01,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 24 transitions. [2021-08-27 15:18:01,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2021-08-27 15:18:01,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 20 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 15:18:01,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2021-08-27 15:18:01,247 INFO L704 BuchiCegarLoop]: Abstraction has 21 states and 23 transitions. [2021-08-27 15:18:01,247 INFO L587 BuchiCegarLoop]: Abstraction has 21 states and 23 transitions. [2021-08-27 15:18:01,247 INFO L425 BuchiCegarLoop]: ======== Iteration 7============ [2021-08-27 15:18:01,247 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 23 transitions. [2021-08-27 15:18:01,250 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2021-08-27 15:18:01,250 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 15:18:01,250 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 15:18:01,251 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 1, 1, 1, 1] [2021-08-27 15:18:01,251 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-08-27 15:18:01,251 INFO L791 eck$LassoCheckResult]: Stem: 436#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(18);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 437#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~post7, main_#t~mem10, main_#t~post11, main_#t~post9, main_#t~mem13, main_#t~mem14, main_#t~post15, main_#t~post12, main_~max~0, main_~#str1~0.base, main_~#str1~0.offset, main_~#str2~0.base, main_~#str2~0.offset, main_~i~0, main_~j~0;main_~max~0 := 5;call main_~#str1~0.base, main_~#str1~0.offset := #Ultimate.allocOnStack((if main_~max~0 % 4294967296 % 4294967296 <= 2147483647 then main_~max~0 % 4294967296 % 4294967296 else main_~max~0 % 4294967296 % 4294967296 - 4294967296));call main_~#str2~0.base, main_~#str2~0.offset := #Ultimate.allocOnStack((if main_~max~0 % 4294967296 % 4294967296 <= 2147483647 then main_~max~0 % 4294967296 % 4294967296 else main_~max~0 % 4294967296 % 4294967296 - 4294967296));havoc main_~i~0;havoc main_~j~0;main_~i~0 := 0; 444#L18-3 assume !!(main_~i~0 % 4294967296 < main_~max~0 % 4294967296);call write~int(main_#t~nondet8, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet8; 445#L18-2 main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 446#L18-3 assume !!(main_~i~0 % 4294967296 < main_~max~0 % 4294967296);call write~int(main_#t~nondet8, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet8; 438#L18-2 main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 439#L18-3 assume !!(main_~i~0 % 4294967296 < main_~max~0 % 4294967296);call write~int(main_#t~nondet8, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet8; 453#L18-2 main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 452#L18-3 assume !!(main_~i~0 % 4294967296 < main_~max~0 % 4294967296);call write~int(main_#t~nondet8, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet8; 451#L18-2 main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 450#L18-3 assume !!(main_~i~0 % 4294967296 < main_~max~0 % 4294967296);call write~int(main_#t~nondet8, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet8; 449#L18-2 main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 448#L18-3 assume !(main_~i~0 % 4294967296 < main_~max~0 % 4294967296); 447#L18-4 call write~int(0, main_~#str1~0.base, main_~#str1~0.offset + (if (main_~max~0 - 1) % 4294967296 % 4294967296 <= 2147483647 then (main_~max~0 - 1) % 4294967296 % 4294967296 else (main_~max~0 - 1) % 4294967296 % 4294967296 - 4294967296), 1);main_~j~0 := 0;main_~i~0 := (if (main_~max~0 - 1) % 4294967296 % 4294967296 <= 2147483647 then (main_~max~0 - 1) % 4294967296 % 4294967296 else (main_~max~0 - 1) % 4294967296 % 4294967296 - 4294967296); 443#L26-3 [2021-08-27 15:18:01,251 INFO L793 eck$LassoCheckResult]: Loop: 443#L26-3 assume !!(main_~i~0 >= 0);call main_#t~mem10 := read~int(main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);call write~int(main_#t~mem10, main_~#str2~0.base, main_~#str2~0.offset + main_~j~0, 1);havoc main_#t~mem10;main_#t~post11 := main_~j~0;main_~j~0 := 1 + main_#t~post11;havoc main_#t~post11; 442#L26-2 main_#t~post9 := main_~i~0;main_~i~0 := main_#t~post9 - 1;havoc main_#t~post9; 443#L26-3 [2021-08-27 15:18:01,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 15:18:01,251 INFO L82 PathProgramCache]: Analyzing trace with hash -1745699051, now seen corresponding path program 5 times [2021-08-27 15:18:01,251 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 15:18:01,251 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783691531] [2021-08-27 15:18:01,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 15:18:01,252 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 15:18:01,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 15:18:01,272 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 15:18:01,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 15:18:01,290 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 15:18:01,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 15:18:01,290 INFO L82 PathProgramCache]: Analyzing trace with hash 1731, now seen corresponding path program 6 times [2021-08-27 15:18:01,290 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 15:18:01,291 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533607263] [2021-08-27 15:18:01,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 15:18:01,291 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 15:18:01,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 15:18:01,305 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 15:18:01,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 15:18:01,307 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 15:18:01,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 15:18:01,308 INFO L82 PathProgramCache]: Analyzing trace with hash 1715425495, now seen corresponding path program 1 times [2021-08-27 15:18:01,308 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 15:18:01,308 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995912630] [2021-08-27 15:18:01,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 15:18:01,308 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 15:18:01,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 15:18:01,325 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 15:18:01,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 15:18:01,351 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 15:18:04,402 INFO L210 LassoAnalysis]: Preferences: [2021-08-27 15:18:04,402 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-08-27 15:18:04,402 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-08-27 15:18:04,402 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-08-27 15:18:04,402 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-08-27 15:18:04,402 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 15:18:04,402 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-08-27 15:18:04,402 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-08-27 15:18:04,403 INFO L133 ssoRankerPreferences]: Filename of dumped script: invert_string-3.c_Iteration7_Lasso [2021-08-27 15:18:04,403 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-08-27 15:18:04,403 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-08-27 15:18:04,403 WARN L313 ript$VariableManager]: TermVariabe aux_div_aux_mod_v_ULTIMATE.start_main_~i~0_55_61_63 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-27 15:18:04,403 WARN L313 ript$VariableManager]: TermVariabe aux_div_v_ULTIMATE.start_main_~i~0_55_61 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-27 15:18:04,403 WARN L313 ript$VariableManager]: TermVariabe aux_mod_aux_mod_v_ULTIMATE.start_main_~i~0_55_61_63 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-27 15:18:04,415 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 15:18:04,422 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 15:18:04,424 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 15:18:04,427 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 15:18:04,429 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 15:18:04,431 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 15:18:04,432 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 15:18:04,434 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 15:18:04,437 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 15:18:04,438 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 15:18:04,440 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 15:18:04,442 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 15:18:04,444 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 15:18:04,841 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 15:18:04,843 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 15:18:05,224 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-08-27 15:18:05,224 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-08-27 15:18:05,224 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 15:18:05,225 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 15:18:05,225 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 15:18:05,226 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 15:18:05,227 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 15:18:05,234 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 15:18:05,234 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 15:18:05,234 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 15:18:05,234 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 15:18:05,235 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 15:18:05,235 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 15:18:05,243 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 15:18:05,259 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Forceful destruction successful, exit code 0 [2021-08-27 15:18:05,259 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 15:18:05,259 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 15:18:05,259 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 15:18:05,260 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 15:18:05,262 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 15:18:05,268 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 15:18:05,268 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 15:18:05,268 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 15:18:05,268 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 15:18:05,268 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 15:18:05,268 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 15:18:05,268 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 15:18:05,269 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 15:18:05,285 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 15:18:05,286 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 15:18:05,286 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 15:18:05,288 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 15:18:05,293 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 15:18:05,299 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 15:18:05,299 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 15:18:05,299 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 15:18:05,299 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 15:18:05,299 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 15:18:05,301 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 15:18:05,301 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 15:18:05,303 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 15:18:05,318 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Ended with exit code 0 [2021-08-27 15:18:05,318 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 15:18:05,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 15:18:05,319 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 15:18:05,319 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 15:18:05,321 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 15:18:05,327 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 15:18:05,328 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 15:18:05,328 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 15:18:05,328 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 15:18:05,328 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 15:18:05,328 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 15:18:05,328 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 15:18:05,329 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 15:18:05,344 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Ended with exit code 0 [2021-08-27 15:18:05,344 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 15:18:05,344 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 15:18:05,345 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 15:18:05,345 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 15:18:05,347 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 15:18:05,353 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 15:18:05,353 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 15:18:05,353 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 15:18:05,353 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 15:18:05,354 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 15:18:05,354 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 15:18:05,354 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 15:18:05,355 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 15:18:05,370 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Ended with exit code 0 [2021-08-27 15:18:05,370 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 15:18:05,370 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 15:18:05,371 INFO L229 MonitoredProcess]: Starting monitored process 36 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 15:18:05,381 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 15:18:05,387 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 15:18:05,388 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 15:18:05,388 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 15:18:05,388 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 15:18:05,388 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 15:18:05,388 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 15:18:05,388 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 15:18:05,391 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2021-08-27 15:18:05,400 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 15:18:05,417 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Forceful destruction successful, exit code 0 [2021-08-27 15:18:05,417 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 15:18:05,417 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 15:18:05,421 INFO L229 MonitoredProcess]: Starting monitored process 37 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 15:18:05,423 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2021-08-27 15:18:05,424 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 15:18:05,431 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 15:18:05,431 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 15:18:05,431 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 15:18:05,431 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 15:18:05,431 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 15:18:05,432 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 15:18:05,432 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 15:18:05,432 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 15:18:05,447 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Forceful destruction successful, exit code 0 [2021-08-27 15:18:05,448 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 15:18:05,448 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 15:18:05,448 INFO L229 MonitoredProcess]: Starting monitored process 38 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 15:18:05,450 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2021-08-27 15:18:05,450 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 15:18:05,457 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 15:18:05,457 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 15:18:05,457 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 15:18:05,457 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 15:18:05,458 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 15:18:05,458 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 15:18:05,468 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 15:18:05,486 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Forceful destruction successful, exit code 0 [2021-08-27 15:18:05,486 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 15:18:05,486 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 15:18:05,487 INFO L229 MonitoredProcess]: Starting monitored process 39 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 15:18:05,488 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2021-08-27 15:18:05,489 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 15:18:05,495 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 15:18:05,495 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 15:18:05,495 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 15:18:05,495 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 15:18:05,495 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 15:18:05,495 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 15:18:05,496 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 15:18:05,496 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 15:18:05,512 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Forceful destruction successful, exit code 0 [2021-08-27 15:18:05,512 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 15:18:05,512 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 15:18:05,512 INFO L229 MonitoredProcess]: Starting monitored process 40 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 15:18:05,515 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2021-08-27 15:18:05,516 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 15:18:05,522 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 15:18:05,522 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 15:18:05,522 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 15:18:05,522 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 15:18:05,522 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 15:18:05,522 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 15:18:05,523 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 15:18:05,530 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 15:18:05,545 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Ended with exit code 0 [2021-08-27 15:18:05,545 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 15:18:05,546 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 15:18:05,546 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 15:18:05,547 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 15:18:05,548 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 15:18:05,554 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 15:18:05,554 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 15:18:05,554 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 15:18:05,554 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 15:18:05,554 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 15:18:05,555 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 15:18:05,555 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 15:18:05,557 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 15:18:05,572 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 15:18:05,572 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 15:18:05,572 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 15:18:05,573 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 15:18:05,575 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 15:18:05,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 15:18:05,582 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 15:18:05,582 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 15:18:05,582 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 15:18:05,582 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 15:18:05,582 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 15:18:05,583 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 15:18:05,583 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 15:18:05,583 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 15:18:05,598 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Forceful destruction successful, exit code 0 [2021-08-27 15:18:05,599 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 15:18:05,599 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 15:18:05,599 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 15:18:05,600 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 15:18:05,647 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 15:18:05,654 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 15:18:05,654 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 15:18:05,654 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 15:18:05,654 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 15:18:05,655 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 15:18:05,656 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 15:18:05,658 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 15:18:05,675 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 15:18:05,675 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 15:18:05,675 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 15:18:05,676 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 15:18:05,677 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 15:18:05,678 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 15:18:05,684 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 15:18:05,685 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 15:18:05,685 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 15:18:05,685 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 15:18:05,686 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 15:18:05,686 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 15:18:05,689 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 15:18:05,705 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 15:18:05,705 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 15:18:05,705 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 15:18:05,706 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 15:18:05,707 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 15:18:05,708 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 15:18:05,714 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 15:18:05,714 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 15:18:05,714 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 15:18:05,714 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 15:18:05,715 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 15:18:05,716 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 15:18:05,723 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 15:18:05,740 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 15:18:05,740 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 15:18:05,741 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 15:18:05,741 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 15:18:05,742 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 15:18:05,743 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 15:18:05,749 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 15:18:05,750 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 15:18:05,750 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 15:18:05,750 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 15:18:05,750 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 15:18:05,750 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 15:18:05,750 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 15:18:05,751 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 15:18:05,766 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Forceful destruction successful, exit code 0 [2021-08-27 15:18:05,768 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 15:18:05,768 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 15:18:05,768 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 15:18:05,769 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 15:18:05,770 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 15:18:05,777 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 15:18:05,777 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 15:18:05,777 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 15:18:05,777 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 15:18:05,778 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 15:18:05,778 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 15:18:05,780 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 15:18:05,795 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Forceful destruction successful, exit code 0 [2021-08-27 15:18:05,796 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 15:18:05,796 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 15:18:05,797 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 15:18:05,797 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 15:18:05,798 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 15:18:05,805 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 15:18:05,805 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 15:18:05,805 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 15:18:05,805 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 15:18:05,806 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 15:18:05,807 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 15:18:05,809 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 15:18:05,824 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Ended with exit code 0 [2021-08-27 15:18:05,824 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 15:18:05,825 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 15:18:05,825 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 15:18:05,826 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 15:18:05,827 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 15:18:05,833 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 15:18:05,833 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 15:18:05,833 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 15:18:05,834 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 15:18:05,835 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 15:18:05,835 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 15:18:05,837 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 15:18:05,852 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Ended with exit code 0 [2021-08-27 15:18:05,852 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 15:18:05,852 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 15:18:05,853 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 15:18:05,853 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 15:18:05,855 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 15:18:05,861 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 15:18:05,861 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 15:18:05,861 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 15:18:05,861 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 15:18:05,862 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 15:18:05,862 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 15:18:05,886 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 15:18:05,901 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Forceful destruction successful, exit code 0 [2021-08-27 15:18:05,901 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 15:18:05,901 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 15:18:05,902 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 15:18:05,903 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 15:18:05,904 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 15:18:05,910 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 15:18:05,910 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 15:18:05,910 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 15:18:05,910 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 15:18:05,910 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 15:18:05,911 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 15:18:05,911 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 15:18:05,911 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 15:18:05,927 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Forceful destruction successful, exit code 0 [2021-08-27 15:18:05,927 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 15:18:05,927 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 15:18:05,928 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 15:18:05,929 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 15:18:05,930 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 15:18:05,936 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 15:18:05,936 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 15:18:05,936 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 15:18:05,936 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 15:18:05,936 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 15:18:05,936 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 15:18:05,936 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 15:18:05,937 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 15:18:05,952 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 15:18:05,953 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 15:18:05,953 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 15:18:05,953 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 15:18:05,954 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 15:18:05,955 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 15:18:05,962 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 15:18:05,962 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 15:18:05,962 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 15:18:05,962 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 15:18:05,964 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 15:18:05,964 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 15:18:05,975 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 15:18:05,991 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 15:18:05,991 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 15:18:05,991 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 15:18:05,992 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 15:18:06,001 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 15:18:06,003 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 15:18:06,007 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 15:18:06,007 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 15:18:06,007 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 15:18:06,007 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 15:18:06,008 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 15:18:06,008 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 15:18:06,011 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 15:18:06,026 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Forceful destruction successful, exit code 0 [2021-08-27 15:18:06,027 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 15:18:06,027 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 15:18:06,027 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 15:18:06,029 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 15:18:06,030 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 15:18:06,036 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 15:18:06,036 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 15:18:06,036 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 15:18:06,037 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 15:18:06,043 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 15:18:06,043 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 15:18:06,056 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-08-27 15:18:06,075 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2021-08-27 15:18:06,075 INFO L444 ModelExtractionUtils]: 3 out of 28 variables were initially zero. Simplification set additionally 22 variables to zero. [2021-08-27 15:18:06,075 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 15:18:06,075 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 15:18:06,076 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 15:18:06,077 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 15:18:06,078 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-08-27 15:18:06,085 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2021-08-27 15:18:06,086 INFO L513 LassoAnalysis]: Proved termination. [2021-08-27 15:18:06,086 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~#str1~0.base)_2, ULTIMATE.start_main_~i~0) = 1*v_rep(select #length ULTIMATE.start_main_~#str1~0.base)_2 + 2*ULTIMATE.start_main_~i~0 Supporting invariants [] [2021-08-27 15:18:06,101 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 15:18:06,140 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 15:18:06,155 INFO L297 tatePredicateManager]: 16 out of 16 supporting invariants were superfluous and have been removed [2021-08-27 15:18:06,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 15:18:06,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 15:18:06,196 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 2 conjunts are in the unsatisfiable core [2021-08-27 15:18:06,197 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 15:18:06,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 15:18:06,243 INFO L263 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 6 conjunts are in the unsatisfiable core [2021-08-27 15:18:06,243 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 15:18:06,261 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 15:18:06,262 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 15:18:06,262 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 23 transitions. cyclomatic complexity: 5 Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 15:18:06,274 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states and 23 transitions. cyclomatic complexity: 5. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 24 states and 29 transitions. Complement of second has 7 states. [2021-08-27 15:18:06,274 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 15:18:06,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 15:18:06,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 9 transitions. [2021-08-27 15:18:06,275 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 14 letters. Loop has 2 letters. [2021-08-27 15:18:06,275 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-27 15:18:06,275 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 16 letters. Loop has 2 letters. [2021-08-27 15:18:06,276 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-27 15:18:06,276 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 14 letters. Loop has 4 letters. [2021-08-27 15:18:06,276 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-27 15:18:06,276 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 29 transitions. [2021-08-27 15:18:06,277 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2021-08-27 15:18:06,279 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 22 states and 25 transitions. [2021-08-27 15:18:06,279 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2021-08-27 15:18:06,279 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2021-08-27 15:18:06,279 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 25 transitions. [2021-08-27 15:18:06,279 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 15:18:06,279 INFO L681 BuchiCegarLoop]: Abstraction has 22 states and 25 transitions. [2021-08-27 15:18:06,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 25 transitions. [2021-08-27 15:18:06,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2021-08-27 15:18:06,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 21 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 15:18:06,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2021-08-27 15:18:06,282 INFO L704 BuchiCegarLoop]: Abstraction has 22 states and 25 transitions. [2021-08-27 15:18:06,282 INFO L587 BuchiCegarLoop]: Abstraction has 22 states and 25 transitions. [2021-08-27 15:18:06,282 INFO L425 BuchiCegarLoop]: ======== Iteration 8============ [2021-08-27 15:18:06,282 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 25 transitions. [2021-08-27 15:18:06,282 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2021-08-27 15:18:06,282 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 15:18:06,282 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 15:18:06,282 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 1, 1, 1, 1, 1, 1] [2021-08-27 15:18:06,282 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2021-08-27 15:18:06,283 INFO L791 eck$LassoCheckResult]: Stem: 616#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(18);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 617#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~post7, main_#t~mem10, main_#t~post11, main_#t~post9, main_#t~mem13, main_#t~mem14, main_#t~post15, main_#t~post12, main_~max~0, main_~#str1~0.base, main_~#str1~0.offset, main_~#str2~0.base, main_~#str2~0.offset, main_~i~0, main_~j~0;main_~max~0 := 5;call main_~#str1~0.base, main_~#str1~0.offset := #Ultimate.allocOnStack((if main_~max~0 % 4294967296 % 4294967296 <= 2147483647 then main_~max~0 % 4294967296 % 4294967296 else main_~max~0 % 4294967296 % 4294967296 - 4294967296));call main_~#str2~0.base, main_~#str2~0.offset := #Ultimate.allocOnStack((if main_~max~0 % 4294967296 % 4294967296 <= 2147483647 then main_~max~0 % 4294967296 % 4294967296 else main_~max~0 % 4294967296 % 4294967296 - 4294967296));havoc main_~i~0;havoc main_~j~0;main_~i~0 := 0; 625#L18-3 assume !!(main_~i~0 % 4294967296 < main_~max~0 % 4294967296);call write~int(main_#t~nondet8, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet8; 626#L18-2 main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 627#L18-3 assume !!(main_~i~0 % 4294967296 < main_~max~0 % 4294967296);call write~int(main_#t~nondet8, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet8; 620#L18-2 main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 621#L18-3 assume !!(main_~i~0 % 4294967296 < main_~max~0 % 4294967296);call write~int(main_#t~nondet8, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet8; 635#L18-2 main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 634#L18-3 assume !!(main_~i~0 % 4294967296 < main_~max~0 % 4294967296);call write~int(main_#t~nondet8, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet8; 633#L18-2 main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 632#L18-3 assume !!(main_~i~0 % 4294967296 < main_~max~0 % 4294967296);call write~int(main_#t~nondet8, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet8; 631#L18-2 main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 630#L18-3 assume !(main_~i~0 % 4294967296 < main_~max~0 % 4294967296); 628#L18-4 call write~int(0, main_~#str1~0.base, main_~#str1~0.offset + (if (main_~max~0 - 1) % 4294967296 % 4294967296 <= 2147483647 then (main_~max~0 - 1) % 4294967296 % 4294967296 else (main_~max~0 - 1) % 4294967296 % 4294967296 - 4294967296), 1);main_~j~0 := 0;main_~i~0 := (if (main_~max~0 - 1) % 4294967296 % 4294967296 <= 2147483647 then (main_~max~0 - 1) % 4294967296 % 4294967296 else (main_~max~0 - 1) % 4294967296 % 4294967296 - 4294967296); 629#L26-3 assume !(main_~i~0 >= 0); 622#L26-4 main_~j~0 := (if (main_~max~0 - 1) % 4294967296 % 4294967296 <= 2147483647 then (main_~max~0 - 1) % 4294967296 % 4294967296 else (main_~max~0 - 1) % 4294967296 % 4294967296 - 4294967296);main_~i~0 := 0; 615#L32-3 [2021-08-27 15:18:06,287 INFO L793 eck$LassoCheckResult]: Loop: 615#L32-3 assume !!(main_~i~0 % 4294967296 < main_~max~0 % 4294967296);call main_#t~mem13 := read~int(main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);call main_#t~mem14 := read~int(main_~#str2~0.base, main_~#str2~0.offset + main_~j~0, 1);__VERIFIER_assert_#in~cond := (if main_#t~mem13 == main_#t~mem14 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 619#L6 assume !(0 == __VERIFIER_assert_~cond); 618#L6-2 havoc main_#t~mem13;havoc main_#t~mem14;main_#t~post15 := main_~j~0;main_~j~0 := main_#t~post15 - 1;havoc main_#t~post15; 614#L32-2 main_#t~post12 := main_~i~0;main_~i~0 := 1 + main_#t~post12;havoc main_#t~post12; 615#L32-3 [2021-08-27 15:18:06,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 15:18:06,288 INFO L82 PathProgramCache]: Analyzing trace with hash 1715425437, now seen corresponding path program 1 times [2021-08-27 15:18:06,288 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 15:18:06,288 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814337158] [2021-08-27 15:18:06,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 15:18:06,288 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 15:18:06,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 15:18:06,326 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 15:18:06,326 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 15:18:06,326 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814337158] [2021-08-27 15:18:06,326 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [814337158] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 15:18:06,326 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 15:18:06,327 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-27 15:18:06,327 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484195448] [2021-08-27 15:18:06,327 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-27 15:18:06,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 15:18:06,328 INFO L82 PathProgramCache]: Analyzing trace with hash 2100362, now seen corresponding path program 1 times [2021-08-27 15:18:06,328 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 15:18:06,328 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175953775] [2021-08-27 15:18:06,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 15:18:06,328 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 15:18:06,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 15:18:06,334 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 15:18:06,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 15:18:06,340 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 15:18:06,438 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 15:18:06,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 15:18:06,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 15:18:06,439 INFO L87 Difference]: Start difference. First operand 22 states and 25 transitions. cyclomatic complexity: 6 Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 15:18:06,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 15:18:06,472 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2021-08-27 15:18:06,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 15:18:06,472 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 25 transitions. [2021-08-27 15:18:06,472 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2021-08-27 15:18:06,472 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 23 states and 25 transitions. [2021-08-27 15:18:06,473 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2021-08-27 15:18:06,473 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2021-08-27 15:18:06,473 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 25 transitions. [2021-08-27 15:18:06,473 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 15:18:06,473 INFO L681 BuchiCegarLoop]: Abstraction has 23 states and 25 transitions. [2021-08-27 15:18:06,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 25 transitions. [2021-08-27 15:18:06,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2021-08-27 15:18:06,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.0909090909090908) internal successors, (24), 21 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 15:18:06,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2021-08-27 15:18:06,474 INFO L704 BuchiCegarLoop]: Abstraction has 22 states and 24 transitions. [2021-08-27 15:18:06,474 INFO L587 BuchiCegarLoop]: Abstraction has 22 states and 24 transitions. [2021-08-27 15:18:06,474 INFO L425 BuchiCegarLoop]: ======== Iteration 9============ [2021-08-27 15:18:06,474 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 24 transitions. [2021-08-27 15:18:06,474 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2021-08-27 15:18:06,474 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 15:18:06,474 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 15:18:06,475 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 15:18:06,475 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2021-08-27 15:18:06,475 INFO L791 eck$LassoCheckResult]: Stem: 670#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(18);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 671#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~post7, main_#t~mem10, main_#t~post11, main_#t~post9, main_#t~mem13, main_#t~mem14, main_#t~post15, main_#t~post12, main_~max~0, main_~#str1~0.base, main_~#str1~0.offset, main_~#str2~0.base, main_~#str2~0.offset, main_~i~0, main_~j~0;main_~max~0 := 5;call main_~#str1~0.base, main_~#str1~0.offset := #Ultimate.allocOnStack((if main_~max~0 % 4294967296 % 4294967296 <= 2147483647 then main_~max~0 % 4294967296 % 4294967296 else main_~max~0 % 4294967296 % 4294967296 - 4294967296));call main_~#str2~0.base, main_~#str2~0.offset := #Ultimate.allocOnStack((if main_~max~0 % 4294967296 % 4294967296 <= 2147483647 then main_~max~0 % 4294967296 % 4294967296 else main_~max~0 % 4294967296 % 4294967296 - 4294967296));havoc main_~i~0;havoc main_~j~0;main_~i~0 := 0; 679#L18-3 assume !!(main_~i~0 % 4294967296 < main_~max~0 % 4294967296);call write~int(main_#t~nondet8, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet8; 673#L18-2 main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 674#L18-3 assume !!(main_~i~0 % 4294967296 < main_~max~0 % 4294967296);call write~int(main_#t~nondet8, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet8; 680#L18-2 main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 689#L18-3 assume !!(main_~i~0 % 4294967296 < main_~max~0 % 4294967296);call write~int(main_#t~nondet8, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet8; 688#L18-2 main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 687#L18-3 assume !!(main_~i~0 % 4294967296 < main_~max~0 % 4294967296);call write~int(main_#t~nondet8, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet8; 686#L18-2 main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 685#L18-3 assume !!(main_~i~0 % 4294967296 < main_~max~0 % 4294967296);call write~int(main_#t~nondet8, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet8; 684#L18-2 main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 683#L18-3 assume !(main_~i~0 % 4294967296 < main_~max~0 % 4294967296); 681#L18-4 call write~int(0, main_~#str1~0.base, main_~#str1~0.offset + (if (main_~max~0 - 1) % 4294967296 % 4294967296 <= 2147483647 then (main_~max~0 - 1) % 4294967296 % 4294967296 else (main_~max~0 - 1) % 4294967296 % 4294967296 - 4294967296), 1);main_~j~0 := 0;main_~i~0 := (if (main_~max~0 - 1) % 4294967296 % 4294967296 <= 2147483647 then (main_~max~0 - 1) % 4294967296 % 4294967296 else (main_~max~0 - 1) % 4294967296 % 4294967296 - 4294967296); 682#L26-3 assume !!(main_~i~0 >= 0);call main_#t~mem10 := read~int(main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);call write~int(main_#t~mem10, main_~#str2~0.base, main_~#str2~0.offset + main_~j~0, 1);havoc main_#t~mem10;main_#t~post11 := main_~j~0;main_~j~0 := 1 + main_#t~post11;havoc main_#t~post11; 676#L26-2 main_#t~post9 := main_~i~0;main_~i~0 := main_#t~post9 - 1;havoc main_#t~post9; 677#L26-3 assume !(main_~i~0 >= 0); 678#L26-4 main_~j~0 := (if (main_~max~0 - 1) % 4294967296 % 4294967296 <= 2147483647 then (main_~max~0 - 1) % 4294967296 % 4294967296 else (main_~max~0 - 1) % 4294967296 % 4294967296 - 4294967296);main_~i~0 := 0; 669#L32-3 [2021-08-27 15:18:06,475 INFO L793 eck$LassoCheckResult]: Loop: 669#L32-3 assume !!(main_~i~0 % 4294967296 < main_~max~0 % 4294967296);call main_#t~mem13 := read~int(main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);call main_#t~mem14 := read~int(main_~#str2~0.base, main_~#str2~0.offset + main_~j~0, 1);__VERIFIER_assert_#in~cond := (if main_#t~mem13 == main_#t~mem14 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 675#L6 assume !(0 == __VERIFIER_assert_~cond); 672#L6-2 havoc main_#t~mem13;havoc main_#t~mem14;main_#t~post15 := main_~j~0;main_~j~0 := main_#t~post15 - 1;havoc main_#t~post15; 668#L32-2 main_#t~post12 := main_~i~0;main_~i~0 := 1 + main_#t~post12;havoc main_#t~post12; 669#L32-3 [2021-08-27 15:18:06,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 15:18:06,475 INFO L82 PathProgramCache]: Analyzing trace with hash -743540257, now seen corresponding path program 1 times [2021-08-27 15:18:06,475 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 15:18:06,475 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801562495] [2021-08-27 15:18:06,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 15:18:06,475 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 15:18:06,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 15:18:06,550 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 15:18:06,550 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 15:18:06,550 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801562495] [2021-08-27 15:18:06,550 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1801562495] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 15:18:06,550 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [580180152] [2021-08-27 15:18:06,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 15:18:06,550 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 15:18:06,550 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 15:18:06,553 INFO L229 MonitoredProcess]: Starting monitored process 57 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 15:18:06,561 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (57)] Waiting until timeout for monitored process [2021-08-27 15:18:06,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 15:18:06,644 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 7 conjunts are in the unsatisfiable core [2021-08-27 15:18:06,645 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 15:18:06,762 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 15:18:06,763 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [580180152] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 15:18:06,763 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 15:18:06,763 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2021-08-27 15:18:06,763 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766011423] [2021-08-27 15:18:06,763 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-27 15:18:06,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 15:18:06,764 INFO L82 PathProgramCache]: Analyzing trace with hash 2100362, now seen corresponding path program 2 times [2021-08-27 15:18:06,764 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 15:18:06,764 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466557406] [2021-08-27 15:18:06,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 15:18:06,764 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 15:18:06,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 15:18:06,768 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 15:18:06,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 15:18:06,771 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 15:18:06,875 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 15:18:06,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-08-27 15:18:06,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2021-08-27 15:18:06,876 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. cyclomatic complexity: 5 Second operand has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 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 15:18:06,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 15:18:06,936 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2021-08-27 15:18:06,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-27 15:18:06,936 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 27 transitions. [2021-08-27 15:18:06,936 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2021-08-27 15:18:06,937 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 25 states and 27 transitions. [2021-08-27 15:18:06,937 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2021-08-27 15:18:06,937 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2021-08-27 15:18:06,937 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 27 transitions. [2021-08-27 15:18:06,937 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 15:18:06,937 INFO L681 BuchiCegarLoop]: Abstraction has 25 states and 27 transitions. [2021-08-27 15:18:06,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 27 transitions. [2021-08-27 15:18:06,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2021-08-27 15:18:06,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 23 states have internal predecessors, (26), 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 15:18:06,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2021-08-27 15:18:06,938 INFO L704 BuchiCegarLoop]: Abstraction has 24 states and 26 transitions. [2021-08-27 15:18:06,938 INFO L587 BuchiCegarLoop]: Abstraction has 24 states and 26 transitions. [2021-08-27 15:18:06,938 INFO L425 BuchiCegarLoop]: ======== Iteration 10============ [2021-08-27 15:18:06,938 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 26 transitions. [2021-08-27 15:18:06,938 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2021-08-27 15:18:06,938 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 15:18:06,938 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 15:18:06,939 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 2, 2, 1, 1, 1, 1, 1, 1] [2021-08-27 15:18:06,939 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2021-08-27 15:18:06,939 INFO L791 eck$LassoCheckResult]: Stem: 784#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(18);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 785#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~post7, main_#t~mem10, main_#t~post11, main_#t~post9, main_#t~mem13, main_#t~mem14, main_#t~post15, main_#t~post12, main_~max~0, main_~#str1~0.base, main_~#str1~0.offset, main_~#str2~0.base, main_~#str2~0.offset, main_~i~0, main_~j~0;main_~max~0 := 5;call main_~#str1~0.base, main_~#str1~0.offset := #Ultimate.allocOnStack((if main_~max~0 % 4294967296 % 4294967296 <= 2147483647 then main_~max~0 % 4294967296 % 4294967296 else main_~max~0 % 4294967296 % 4294967296 - 4294967296));call main_~#str2~0.base, main_~#str2~0.offset := #Ultimate.allocOnStack((if main_~max~0 % 4294967296 % 4294967296 <= 2147483647 then main_~max~0 % 4294967296 % 4294967296 else main_~max~0 % 4294967296 % 4294967296 - 4294967296));havoc main_~i~0;havoc main_~j~0;main_~i~0 := 0; 792#L18-3 assume !!(main_~i~0 % 4294967296 < main_~max~0 % 4294967296);call write~int(main_#t~nondet8, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet8; 787#L18-2 main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 788#L18-3 assume !!(main_~i~0 % 4294967296 < main_~max~0 % 4294967296);call write~int(main_#t~nondet8, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet8; 793#L18-2 main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 804#L18-3 assume !!(main_~i~0 % 4294967296 < main_~max~0 % 4294967296);call write~int(main_#t~nondet8, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet8; 803#L18-2 main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 802#L18-3 assume !!(main_~i~0 % 4294967296 < main_~max~0 % 4294967296);call write~int(main_#t~nondet8, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet8; 801#L18-2 main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 800#L18-3 assume !!(main_~i~0 % 4294967296 < main_~max~0 % 4294967296);call write~int(main_#t~nondet8, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet8; 798#L18-2 main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 797#L18-3 assume !(main_~i~0 % 4294967296 < main_~max~0 % 4294967296); 794#L18-4 call write~int(0, main_~#str1~0.base, main_~#str1~0.offset + (if (main_~max~0 - 1) % 4294967296 % 4294967296 <= 2147483647 then (main_~max~0 - 1) % 4294967296 % 4294967296 else (main_~max~0 - 1) % 4294967296 % 4294967296 - 4294967296), 1);main_~j~0 := 0;main_~i~0 := (if (main_~max~0 - 1) % 4294967296 % 4294967296 <= 2147483647 then (main_~max~0 - 1) % 4294967296 % 4294967296 else (main_~max~0 - 1) % 4294967296 % 4294967296 - 4294967296); 795#L26-3 assume !!(main_~i~0 >= 0);call main_#t~mem10 := read~int(main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);call write~int(main_#t~mem10, main_~#str2~0.base, main_~#str2~0.offset + main_~j~0, 1);havoc main_#t~mem10;main_#t~post11 := main_~j~0;main_~j~0 := 1 + main_#t~post11;havoc main_#t~post11; 789#L26-2 main_#t~post9 := main_~i~0;main_~i~0 := main_#t~post9 - 1;havoc main_#t~post9; 790#L26-3 assume !!(main_~i~0 >= 0);call main_#t~mem10 := read~int(main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);call write~int(main_#t~mem10, main_~#str2~0.base, main_~#str2~0.offset + main_~j~0, 1);havoc main_#t~mem10;main_#t~post11 := main_~j~0;main_~j~0 := 1 + main_#t~post11;havoc main_#t~post11; 796#L26-2 main_#t~post9 := main_~i~0;main_~i~0 := main_#t~post9 - 1;havoc main_#t~post9; 799#L26-3 assume !(main_~i~0 >= 0); 791#L26-4 main_~j~0 := (if (main_~max~0 - 1) % 4294967296 % 4294967296 <= 2147483647 then (main_~max~0 - 1) % 4294967296 % 4294967296 else (main_~max~0 - 1) % 4294967296 % 4294967296 - 4294967296);main_~i~0 := 0; 782#L32-3 [2021-08-27 15:18:06,939 INFO L793 eck$LassoCheckResult]: Loop: 782#L32-3 assume !!(main_~i~0 % 4294967296 < main_~max~0 % 4294967296);call main_#t~mem13 := read~int(main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);call main_#t~mem14 := read~int(main_~#str2~0.base, main_~#str2~0.offset + main_~j~0, 1);__VERIFIER_assert_#in~cond := (if main_#t~mem13 == main_#t~mem14 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 786#L6 assume !(0 == __VERIFIER_assert_~cond); 783#L6-2 havoc main_#t~mem13;havoc main_#t~mem14;main_#t~post15 := main_~j~0;main_~j~0 := main_#t~post15 - 1;havoc main_#t~post15; 781#L32-2 main_#t~post12 := main_~i~0;main_~i~0 := 1 + main_#t~post12;havoc main_#t~post12; 782#L32-3 [2021-08-27 15:18:06,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 15:18:06,939 INFO L82 PathProgramCache]: Analyzing trace with hash -1577559391, now seen corresponding path program 2 times [2021-08-27 15:18:06,939 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 15:18:06,939 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736570288] [2021-08-27 15:18:06,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 15:18:06,939 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 15:18:06,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 15:18:07,048 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2021-08-27 15:18:07,048 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 15:18:07,048 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736570288] [2021-08-27 15:18:07,048 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1736570288] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 15:18:07,048 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [762706313] [2021-08-27 15:18:07,048 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-08-27 15:18:07,048 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 15:18:07,049 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 15:18:07,049 INFO L229 MonitoredProcess]: Starting monitored process 58 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 15:18:07,058 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (58)] Waiting until timeout for monitored process [2021-08-27 15:18:07,164 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-08-27 15:18:07,164 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-27 15:18:07,165 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 11 conjunts are in the unsatisfiable core [2021-08-27 15:18:07,166 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 15:18:07,289 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2021-08-27 15:18:07,289 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [762706313] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 15:18:07,289 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 15:18:07,290 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 11 [2021-08-27 15:18:07,290 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048903511] [2021-08-27 15:18:07,290 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-27 15:18:07,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 15:18:07,290 INFO L82 PathProgramCache]: Analyzing trace with hash 2100362, now seen corresponding path program 3 times [2021-08-27 15:18:07,290 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 15:18:07,290 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936659581] [2021-08-27 15:18:07,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 15:18:07,290 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 15:18:07,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 15:18:07,294 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 15:18:07,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 15:18:07,296 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 15:18:07,377 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 15:18:07,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-08-27 15:18:07,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2021-08-27 15:18:07,378 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. cyclomatic complexity: 5 Second operand has 11 states, 11 states have (on average 2.0) internal successors, (22), 11 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 15:18:07,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 15:18:07,498 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2021-08-27 15:18:07,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-27 15:18:07,498 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 29 transitions. [2021-08-27 15:18:07,498 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2021-08-27 15:18:07,499 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 27 states and 29 transitions. [2021-08-27 15:18:07,499 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2021-08-27 15:18:07,499 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2021-08-27 15:18:07,499 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 29 transitions. [2021-08-27 15:18:07,499 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 15:18:07,499 INFO L681 BuchiCegarLoop]: Abstraction has 27 states and 29 transitions. [2021-08-27 15:18:07,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 29 transitions. [2021-08-27 15:18:07,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2021-08-27 15:18:07,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 1.0769230769230769) internal successors, (28), 25 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 15:18:07,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2021-08-27 15:18:07,501 INFO L704 BuchiCegarLoop]: Abstraction has 26 states and 28 transitions. [2021-08-27 15:18:07,501 INFO L587 BuchiCegarLoop]: Abstraction has 26 states and 28 transitions. [2021-08-27 15:18:07,501 INFO L425 BuchiCegarLoop]: ======== Iteration 11============ [2021-08-27 15:18:07,501 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 28 transitions. [2021-08-27 15:18:07,501 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2021-08-27 15:18:07,501 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 15:18:07,501 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 15:18:07,502 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 3, 3, 1, 1, 1, 1, 1, 1] [2021-08-27 15:18:07,502 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2021-08-27 15:18:07,502 INFO L791 eck$LassoCheckResult]: Stem: 912#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(18);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 913#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~post7, main_#t~mem10, main_#t~post11, main_#t~post9, main_#t~mem13, main_#t~mem14, main_#t~post15, main_#t~post12, main_~max~0, main_~#str1~0.base, main_~#str1~0.offset, main_~#str2~0.base, main_~#str2~0.offset, main_~i~0, main_~j~0;main_~max~0 := 5;call main_~#str1~0.base, main_~#str1~0.offset := #Ultimate.allocOnStack((if main_~max~0 % 4294967296 % 4294967296 <= 2147483647 then main_~max~0 % 4294967296 % 4294967296 else main_~max~0 % 4294967296 % 4294967296 - 4294967296));call main_~#str2~0.base, main_~#str2~0.offset := #Ultimate.allocOnStack((if main_~max~0 % 4294967296 % 4294967296 <= 2147483647 then main_~max~0 % 4294967296 % 4294967296 else main_~max~0 % 4294967296 % 4294967296 - 4294967296));havoc main_~i~0;havoc main_~j~0;main_~i~0 := 0; 920#L18-3 assume !!(main_~i~0 % 4294967296 < main_~max~0 % 4294967296);call write~int(main_#t~nondet8, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet8; 915#L18-2 main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 916#L18-3 assume !!(main_~i~0 % 4294967296 < main_~max~0 % 4294967296);call write~int(main_#t~nondet8, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet8; 921#L18-2 main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 934#L18-3 assume !!(main_~i~0 % 4294967296 < main_~max~0 % 4294967296);call write~int(main_#t~nondet8, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet8; 933#L18-2 main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 932#L18-3 assume !!(main_~i~0 % 4294967296 < main_~max~0 % 4294967296);call write~int(main_#t~nondet8, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet8; 931#L18-2 main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 930#L18-3 assume !!(main_~i~0 % 4294967296 < main_~max~0 % 4294967296);call write~int(main_#t~nondet8, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet8; 927#L18-2 main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 926#L18-3 assume !(main_~i~0 % 4294967296 < main_~max~0 % 4294967296); 922#L18-4 call write~int(0, main_~#str1~0.base, main_~#str1~0.offset + (if (main_~max~0 - 1) % 4294967296 % 4294967296 <= 2147483647 then (main_~max~0 - 1) % 4294967296 % 4294967296 else (main_~max~0 - 1) % 4294967296 % 4294967296 - 4294967296), 1);main_~j~0 := 0;main_~i~0 := (if (main_~max~0 - 1) % 4294967296 % 4294967296 <= 2147483647 then (main_~max~0 - 1) % 4294967296 % 4294967296 else (main_~max~0 - 1) % 4294967296 % 4294967296 - 4294967296); 923#L26-3 assume !!(main_~i~0 >= 0);call main_#t~mem10 := read~int(main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);call write~int(main_#t~mem10, main_~#str2~0.base, main_~#str2~0.offset + main_~j~0, 1);havoc main_#t~mem10;main_#t~post11 := main_~j~0;main_~j~0 := 1 + main_#t~post11;havoc main_#t~post11; 924#L26-2 main_#t~post9 := main_~i~0;main_~i~0 := main_#t~post9 - 1;havoc main_#t~post9; 925#L26-3 assume !!(main_~i~0 >= 0);call main_#t~mem10 := read~int(main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);call write~int(main_#t~mem10, main_~#str2~0.base, main_~#str2~0.offset + main_~j~0, 1);havoc main_#t~mem10;main_#t~post11 := main_~j~0;main_~j~0 := 1 + main_#t~post11;havoc main_#t~post11; 917#L26-2 main_#t~post9 := main_~i~0;main_~i~0 := main_#t~post9 - 1;havoc main_#t~post9; 918#L26-3 assume !!(main_~i~0 >= 0);call main_#t~mem10 := read~int(main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);call write~int(main_#t~mem10, main_~#str2~0.base, main_~#str2~0.offset + main_~j~0, 1);havoc main_#t~mem10;main_#t~post11 := main_~j~0;main_~j~0 := 1 + main_#t~post11;havoc main_#t~post11; 929#L26-2 main_#t~post9 := main_~i~0;main_~i~0 := main_#t~post9 - 1;havoc main_#t~post9; 928#L26-3 assume !(main_~i~0 >= 0); 919#L26-4 main_~j~0 := (if (main_~max~0 - 1) % 4294967296 % 4294967296 <= 2147483647 then (main_~max~0 - 1) % 4294967296 % 4294967296 else (main_~max~0 - 1) % 4294967296 % 4294967296 - 4294967296);main_~i~0 := 0; 910#L32-3 [2021-08-27 15:18:07,502 INFO L793 eck$LassoCheckResult]: Loop: 910#L32-3 assume !!(main_~i~0 % 4294967296 < main_~max~0 % 4294967296);call main_#t~mem13 := read~int(main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);call main_#t~mem14 := read~int(main_~#str2~0.base, main_~#str2~0.offset + main_~j~0, 1);__VERIFIER_assert_#in~cond := (if main_#t~mem13 == main_#t~mem14 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 914#L6 assume !(0 == __VERIFIER_assert_~cond); 911#L6-2 havoc main_#t~mem13;havoc main_#t~mem14;main_#t~post15 := main_~j~0;main_~j~0 := main_#t~post15 - 1;havoc main_#t~post15; 909#L32-2 main_#t~post12 := main_~i~0;main_~i~0 := 1 + main_#t~post12;havoc main_#t~post12; 910#L32-3 [2021-08-27 15:18:07,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 15:18:07,502 INFO L82 PathProgramCache]: Analyzing trace with hash 88937187, now seen corresponding path program 3 times [2021-08-27 15:18:07,502 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 15:18:07,502 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328096329] [2021-08-27 15:18:07,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 15:18:07,502 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 15:18:07,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 15:18:07,647 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2021-08-27 15:18:07,647 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 15:18:07,647 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328096329] [2021-08-27 15:18:07,648 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1328096329] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 15:18:07,648 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [197815906] [2021-08-27 15:18:07,648 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-08-27 15:18:07,648 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 15:18:07,648 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 15:18:07,677 INFO L229 MonitoredProcess]: Starting monitored process 59 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 15:18:07,678 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (59)] Waiting until timeout for monitored process [2021-08-27 15:18:07,816 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2021-08-27 15:18:07,816 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-27 15:18:07,817 INFO L263 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 13 conjunts are in the unsatisfiable core [2021-08-27 15:18:07,818 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 15:18:07,965 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2021-08-27 15:18:07,969 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [197815906] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 15:18:07,969 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 15:18:07,969 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 13 [2021-08-27 15:18:07,969 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129883107] [2021-08-27 15:18:07,969 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-27 15:18:07,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 15:18:07,969 INFO L82 PathProgramCache]: Analyzing trace with hash 2100362, now seen corresponding path program 4 times [2021-08-27 15:18:07,970 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 15:18:07,970 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043851899] [2021-08-27 15:18:07,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 15:18:07,970 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 15:18:07,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 15:18:07,973 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 15:18:07,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 15:18:07,976 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 15:18:08,066 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 15:18:08,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-08-27 15:18:08,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2021-08-27 15:18:08,067 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. cyclomatic complexity: 5 Second operand has 13 states, 13 states have (on average 2.0) internal successors, (26), 13 states have internal predecessors, (26), 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 15:18:08,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 15:18:08,203 INFO L93 Difference]: Finished difference Result 29 states and 31 transitions. [2021-08-27 15:18:08,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-27 15:18:08,203 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 31 transitions. [2021-08-27 15:18:08,203 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2021-08-27 15:18:08,204 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 29 states and 31 transitions. [2021-08-27 15:18:08,204 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2021-08-27 15:18:08,204 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2021-08-27 15:18:08,204 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 31 transitions. [2021-08-27 15:18:08,204 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 15:18:08,204 INFO L681 BuchiCegarLoop]: Abstraction has 29 states and 31 transitions. [2021-08-27 15:18:08,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 31 transitions. [2021-08-27 15:18:08,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2021-08-27 15:18:08,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 28 states have (on average 1.0714285714285714) internal successors, (30), 27 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 15:18:08,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2021-08-27 15:18:08,205 INFO L704 BuchiCegarLoop]: Abstraction has 28 states and 30 transitions. [2021-08-27 15:18:08,205 INFO L587 BuchiCegarLoop]: Abstraction has 28 states and 30 transitions. [2021-08-27 15:18:08,205 INFO L425 BuchiCegarLoop]: ======== Iteration 12============ [2021-08-27 15:18:08,205 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 30 transitions. [2021-08-27 15:18:08,206 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2021-08-27 15:18:08,206 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 15:18:08,206 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 15:18:08,206 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 4, 4, 1, 1, 1, 1, 1, 1] [2021-08-27 15:18:08,206 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2021-08-27 15:18:08,206 INFO L791 eck$LassoCheckResult]: Stem: 1054#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(18);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 1055#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~post7, main_#t~mem10, main_#t~post11, main_#t~post9, main_#t~mem13, main_#t~mem14, main_#t~post15, main_#t~post12, main_~max~0, main_~#str1~0.base, main_~#str1~0.offset, main_~#str2~0.base, main_~#str2~0.offset, main_~i~0, main_~j~0;main_~max~0 := 5;call main_~#str1~0.base, main_~#str1~0.offset := #Ultimate.allocOnStack((if main_~max~0 % 4294967296 % 4294967296 <= 2147483647 then main_~max~0 % 4294967296 % 4294967296 else main_~max~0 % 4294967296 % 4294967296 - 4294967296));call main_~#str2~0.base, main_~#str2~0.offset := #Ultimate.allocOnStack((if main_~max~0 % 4294967296 % 4294967296 <= 2147483647 then main_~max~0 % 4294967296 % 4294967296 else main_~max~0 % 4294967296 % 4294967296 - 4294967296));havoc main_~i~0;havoc main_~j~0;main_~i~0 := 0; 1062#L18-3 assume !!(main_~i~0 % 4294967296 < main_~max~0 % 4294967296);call write~int(main_#t~nondet8, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet8; 1056#L18-2 main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 1057#L18-3 assume !!(main_~i~0 % 4294967296 < main_~max~0 % 4294967296);call write~int(main_#t~nondet8, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet8; 1063#L18-2 main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 1075#L18-3 assume !!(main_~i~0 % 4294967296 < main_~max~0 % 4294967296);call write~int(main_#t~nondet8, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet8; 1074#L18-2 main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 1073#L18-3 assume !!(main_~i~0 % 4294967296 < main_~max~0 % 4294967296);call write~int(main_#t~nondet8, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet8; 1072#L18-2 main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 1069#L18-3 assume !!(main_~i~0 % 4294967296 < main_~max~0 % 4294967296);call write~int(main_#t~nondet8, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet8; 1068#L18-2 main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 1067#L18-3 assume !(main_~i~0 % 4294967296 < main_~max~0 % 4294967296); 1064#L18-4 call write~int(0, main_~#str1~0.base, main_~#str1~0.offset + (if (main_~max~0 - 1) % 4294967296 % 4294967296 <= 2147483647 then (main_~max~0 - 1) % 4294967296 % 4294967296 else (main_~max~0 - 1) % 4294967296 % 4294967296 - 4294967296), 1);main_~j~0 := 0;main_~i~0 := (if (main_~max~0 - 1) % 4294967296 % 4294967296 <= 2147483647 then (main_~max~0 - 1) % 4294967296 % 4294967296 else (main_~max~0 - 1) % 4294967296 % 4294967296 - 4294967296); 1065#L26-3 assume !!(main_~i~0 >= 0);call main_#t~mem10 := read~int(main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);call write~int(main_#t~mem10, main_~#str2~0.base, main_~#str2~0.offset + main_~j~0, 1);havoc main_#t~mem10;main_#t~post11 := main_~j~0;main_~j~0 := 1 + main_#t~post11;havoc main_#t~post11; 1059#L26-2 main_#t~post9 := main_~i~0;main_~i~0 := main_#t~post9 - 1;havoc main_#t~post9; 1060#L26-3 assume !!(main_~i~0 >= 0);call main_#t~mem10 := read~int(main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);call write~int(main_#t~mem10, main_~#str2~0.base, main_~#str2~0.offset + main_~j~0, 1);havoc main_#t~mem10;main_#t~post11 := main_~j~0;main_~j~0 := 1 + main_#t~post11;havoc main_#t~post11; 1066#L26-2 main_#t~post9 := main_~i~0;main_~i~0 := main_#t~post9 - 1;havoc main_#t~post9; 1078#L26-3 assume !!(main_~i~0 >= 0);call main_#t~mem10 := read~int(main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);call write~int(main_#t~mem10, main_~#str2~0.base, main_~#str2~0.offset + main_~j~0, 1);havoc main_#t~mem10;main_#t~post11 := main_~j~0;main_~j~0 := 1 + main_#t~post11;havoc main_#t~post11; 1077#L26-2 main_#t~post9 := main_~i~0;main_~i~0 := main_#t~post9 - 1;havoc main_#t~post9; 1076#L26-3 assume !!(main_~i~0 >= 0);call main_#t~mem10 := read~int(main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);call write~int(main_#t~mem10, main_~#str2~0.base, main_~#str2~0.offset + main_~j~0, 1);havoc main_#t~mem10;main_#t~post11 := main_~j~0;main_~j~0 := 1 + main_#t~post11;havoc main_#t~post11; 1071#L26-2 main_#t~post9 := main_~i~0;main_~i~0 := main_#t~post9 - 1;havoc main_#t~post9; 1070#L26-3 assume !(main_~i~0 >= 0); 1061#L26-4 main_~j~0 := (if (main_~max~0 - 1) % 4294967296 % 4294967296 <= 2147483647 then (main_~max~0 - 1) % 4294967296 % 4294967296 else (main_~max~0 - 1) % 4294967296 % 4294967296 - 4294967296);main_~i~0 := 0; 1052#L32-3 [2021-08-27 15:18:08,206 INFO L793 eck$LassoCheckResult]: Loop: 1052#L32-3 assume !!(main_~i~0 % 4294967296 < main_~max~0 % 4294967296);call main_#t~mem13 := read~int(main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);call main_#t~mem14 := read~int(main_~#str2~0.base, main_~#str2~0.offset + main_~j~0, 1);__VERIFIER_assert_#in~cond := (if main_#t~mem13 == main_#t~mem14 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 1058#L6 assume !(0 == __VERIFIER_assert_~cond); 1053#L6-2 havoc main_#t~mem13;havoc main_#t~mem14;main_#t~post15 := main_~j~0;main_~j~0 := main_#t~post15 - 1;havoc main_#t~post15; 1051#L32-2 main_#t~post12 := main_~i~0;main_~i~0 := 1 + main_#t~post12;havoc main_#t~post12; 1052#L32-3 [2021-08-27 15:18:08,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 15:18:08,207 INFO L82 PathProgramCache]: Analyzing trace with hash -430652763, now seen corresponding path program 4 times [2021-08-27 15:18:08,207 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 15:18:08,207 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447091143] [2021-08-27 15:18:08,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 15:18:08,207 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 15:18:08,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 15:18:08,374 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2021-08-27 15:18:08,374 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 15:18:08,374 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447091143] [2021-08-27 15:18:08,374 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [447091143] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 15:18:08,374 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [65685398] [2021-08-27 15:18:08,374 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-08-27 15:18:08,374 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 15:18:08,374 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 15:18:08,375 INFO L229 MonitoredProcess]: Starting monitored process 60 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 15:18:08,375 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (60)] Waiting until timeout for monitored process [2021-08-27 15:18:08,519 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-08-27 15:18:08,519 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-27 15:18:08,520 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 13 conjunts are in the unsatisfiable core [2021-08-27 15:18:08,521 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 15:18:08,645 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2021-08-27 15:18:08,645 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [65685398] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 15:18:08,646 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 15:18:08,646 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 15 [2021-08-27 15:18:08,646 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470997662] [2021-08-27 15:18:08,646 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-27 15:18:08,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 15:18:08,646 INFO L82 PathProgramCache]: Analyzing trace with hash 2100362, now seen corresponding path program 5 times [2021-08-27 15:18:08,646 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 15:18:08,646 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458857402] [2021-08-27 15:18:08,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 15:18:08,646 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 15:18:08,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 15:18:08,650 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 15:18:08,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 15:18:08,652 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 15:18:08,736 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 15:18:08,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-08-27 15:18:08,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2021-08-27 15:18:08,737 INFO L87 Difference]: Start difference. First operand 28 states and 30 transitions. cyclomatic complexity: 5 Second operand has 15 states, 15 states have (on average 2.0) internal successors, (30), 15 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 15:18:09,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 15:18:09,046 INFO L93 Difference]: Finished difference Result 42 states and 44 transitions. [2021-08-27 15:18:09,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-08-27 15:18:09,047 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42 states and 44 transitions. [2021-08-27 15:18:09,047 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2021-08-27 15:18:09,048 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42 states to 42 states and 44 transitions. [2021-08-27 15:18:09,048 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2021-08-27 15:18:09,048 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2021-08-27 15:18:09,048 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 44 transitions. [2021-08-27 15:18:09,049 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 15:18:09,049 INFO L681 BuchiCegarLoop]: Abstraction has 42 states and 44 transitions. [2021-08-27 15:18:09,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 44 transitions. [2021-08-27 15:18:09,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 30. [2021-08-27 15:18:09,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 30 states have (on average 1.0666666666666667) internal successors, (32), 29 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 15:18:09,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2021-08-27 15:18:09,050 INFO L704 BuchiCegarLoop]: Abstraction has 30 states and 32 transitions. [2021-08-27 15:18:09,050 INFO L587 BuchiCegarLoop]: Abstraction has 30 states and 32 transitions. [2021-08-27 15:18:09,050 INFO L425 BuchiCegarLoop]: ======== Iteration 13============ [2021-08-27 15:18:09,050 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 32 transitions. [2021-08-27 15:18:09,050 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2021-08-27 15:18:09,050 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 15:18:09,050 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 15:18:09,051 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1] [2021-08-27 15:18:09,051 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2021-08-27 15:18:09,051 INFO L791 eck$LassoCheckResult]: Stem: 1227#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(18);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 1228#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~post7, main_#t~mem10, main_#t~post11, main_#t~post9, main_#t~mem13, main_#t~mem14, main_#t~post15, main_#t~post12, main_~max~0, main_~#str1~0.base, main_~#str1~0.offset, main_~#str2~0.base, main_~#str2~0.offset, main_~i~0, main_~j~0;main_~max~0 := 5;call main_~#str1~0.base, main_~#str1~0.offset := #Ultimate.allocOnStack((if main_~max~0 % 4294967296 % 4294967296 <= 2147483647 then main_~max~0 % 4294967296 % 4294967296 else main_~max~0 % 4294967296 % 4294967296 - 4294967296));call main_~#str2~0.base, main_~#str2~0.offset := #Ultimate.allocOnStack((if main_~max~0 % 4294967296 % 4294967296 <= 2147483647 then main_~max~0 % 4294967296 % 4294967296 else main_~max~0 % 4294967296 % 4294967296 - 4294967296));havoc main_~i~0;havoc main_~j~0;main_~i~0 := 0; 1235#L18-3 assume !!(main_~i~0 % 4294967296 < main_~max~0 % 4294967296);call write~int(main_#t~nondet8, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet8; 1230#L18-2 main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 1231#L18-3 assume !!(main_~i~0 % 4294967296 < main_~max~0 % 4294967296);call write~int(main_#t~nondet8, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet8; 1236#L18-2 main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 1253#L18-3 assume !!(main_~i~0 % 4294967296 < main_~max~0 % 4294967296);call write~int(main_#t~nondet8, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet8; 1252#L18-2 main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 1250#L18-3 assume !!(main_~i~0 % 4294967296 < main_~max~0 % 4294967296);call write~int(main_#t~nondet8, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet8; 1248#L18-2 main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 1246#L18-3 assume !!(main_~i~0 % 4294967296 < main_~max~0 % 4294967296);call write~int(main_#t~nondet8, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet8; 1243#L18-2 main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 1242#L18-3 assume !(main_~i~0 % 4294967296 < main_~max~0 % 4294967296); 1237#L18-4 call write~int(0, main_~#str1~0.base, main_~#str1~0.offset + (if (main_~max~0 - 1) % 4294967296 % 4294967296 <= 2147483647 then (main_~max~0 - 1) % 4294967296 % 4294967296 else (main_~max~0 - 1) % 4294967296 % 4294967296 - 4294967296), 1);main_~j~0 := 0;main_~i~0 := (if (main_~max~0 - 1) % 4294967296 % 4294967296 <= 2147483647 then (main_~max~0 - 1) % 4294967296 % 4294967296 else (main_~max~0 - 1) % 4294967296 % 4294967296 - 4294967296); 1238#L26-3 assume !!(main_~i~0 >= 0);call main_#t~mem10 := read~int(main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);call write~int(main_#t~mem10, main_~#str2~0.base, main_~#str2~0.offset + main_~j~0, 1);havoc main_#t~mem10;main_#t~post11 := main_~j~0;main_~j~0 := 1 + main_#t~post11;havoc main_#t~post11; 1232#L26-2 main_#t~post9 := main_~i~0;main_~i~0 := main_#t~post9 - 1;havoc main_#t~post9; 1233#L26-3 assume !!(main_~i~0 >= 0);call main_#t~mem10 := read~int(main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);call write~int(main_#t~mem10, main_~#str2~0.base, main_~#str2~0.offset + main_~j~0, 1);havoc main_#t~mem10;main_#t~post11 := main_~j~0;main_~j~0 := 1 + main_#t~post11;havoc main_#t~post11; 1239#L26-2 main_#t~post9 := main_~i~0;main_~i~0 := main_#t~post9 - 1;havoc main_#t~post9; 1251#L26-3 assume !!(main_~i~0 >= 0);call main_#t~mem10 := read~int(main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);call write~int(main_#t~mem10, main_~#str2~0.base, main_~#str2~0.offset + main_~j~0, 1);havoc main_#t~mem10;main_#t~post11 := main_~j~0;main_~j~0 := 1 + main_#t~post11;havoc main_#t~post11; 1249#L26-2 main_#t~post9 := main_~i~0;main_~i~0 := main_#t~post9 - 1;havoc main_#t~post9; 1247#L26-3 assume !!(main_~i~0 >= 0);call main_#t~mem10 := read~int(main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);call write~int(main_#t~mem10, main_~#str2~0.base, main_~#str2~0.offset + main_~j~0, 1);havoc main_#t~mem10;main_#t~post11 := main_~j~0;main_~j~0 := 1 + main_#t~post11;havoc main_#t~post11; 1245#L26-2 main_#t~post9 := main_~i~0;main_~i~0 := main_#t~post9 - 1;havoc main_#t~post9; 1244#L26-3 assume !!(main_~i~0 >= 0);call main_#t~mem10 := read~int(main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);call write~int(main_#t~mem10, main_~#str2~0.base, main_~#str2~0.offset + main_~j~0, 1);havoc main_#t~mem10;main_#t~post11 := main_~j~0;main_~j~0 := 1 + main_#t~post11;havoc main_#t~post11; 1241#L26-2 main_#t~post9 := main_~i~0;main_~i~0 := main_#t~post9 - 1;havoc main_#t~post9; 1240#L26-3 assume !(main_~i~0 >= 0); 1234#L26-4 main_~j~0 := (if (main_~max~0 - 1) % 4294967296 % 4294967296 <= 2147483647 then (main_~max~0 - 1) % 4294967296 % 4294967296 else (main_~max~0 - 1) % 4294967296 % 4294967296 - 4294967296);main_~i~0 := 0; 1225#L32-3 [2021-08-27 15:18:09,051 INFO L793 eck$LassoCheckResult]: Loop: 1225#L32-3 assume !!(main_~i~0 % 4294967296 < main_~max~0 % 4294967296);call main_#t~mem13 := read~int(main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);call main_#t~mem14 := read~int(main_~#str2~0.base, main_~#str2~0.offset + main_~j~0, 1);__VERIFIER_assert_#in~cond := (if main_#t~mem13 == main_#t~mem14 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 1229#L6 assume !(0 == __VERIFIER_assert_~cond); 1226#L6-2 havoc main_#t~mem13;havoc main_#t~mem14;main_#t~post15 := main_~j~0;main_~j~0 := main_#t~post15 - 1;havoc main_#t~post15; 1224#L32-2 main_#t~post12 := main_~i~0;main_~i~0 := 1 + main_#t~post12;havoc main_#t~post12; 1225#L32-3 [2021-08-27 15:18:09,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 15:18:09,051 INFO L82 PathProgramCache]: Analyzing trace with hash -1540388377, now seen corresponding path program 5 times [2021-08-27 15:18:09,051 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 15:18:09,051 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414680801] [2021-08-27 15:18:09,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 15:18:09,051 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 15:18:09,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 15:18:09,067 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 15:18:09,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 15:18:09,119 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 15:18:09,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 15:18:09,119 INFO L82 PathProgramCache]: Analyzing trace with hash 2100362, now seen corresponding path program 6 times [2021-08-27 15:18:09,119 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 15:18:09,119 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524242520] [2021-08-27 15:18:09,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 15:18:09,119 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 15:18:09,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 15:18:09,123 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 15:18:09,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 15:18:09,125 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 15:18:09,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 15:18:09,126 INFO L82 PathProgramCache]: Analyzing trace with hash -1945357456, now seen corresponding path program 1 times [2021-08-27 15:18:09,126 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 15:18:09,126 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724396569] [2021-08-27 15:18:09,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 15:18:09,126 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 15:18:09,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 15:18:09,141 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 15:18:09,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 15:18:09,170 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 15:18:20,576 WARN L207 SmtUtils]: Spent 11.32 s on a formula simplification. DAG size of input: 312 DAG size of output: 237 [2021-08-27 15:18:25,277 INFO L210 LassoAnalysis]: Preferences: [2021-08-27 15:18:25,277 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-08-27 15:18:25,277 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-08-27 15:18:25,277 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-08-27 15:18:25,277 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-08-27 15:18:25,277 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 15:18:25,277 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-08-27 15:18:25,278 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-08-27 15:18:25,278 INFO L133 ssoRankerPreferences]: Filename of dumped script: invert_string-3.c_Iteration13_Lasso [2021-08-27 15:18:25,278 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-08-27 15:18:25,278 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-08-27 15:18:25,278 WARN L313 ript$VariableManager]: TermVariabe aux_div_v_ULTIMATE.start_main_~i~0_109_47 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-27 15:18:25,278 WARN L313 ript$VariableManager]: TermVariabe aux_div_aux_mod_v_ULTIMATE.start_main_~i~0_109_47_73 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-27 15:18:25,278 WARN L313 ript$VariableManager]: TermVariabe aux_mod_aux_mod_v_ULTIMATE.start_main_~i~0_109_47_73 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-27 15:18:25,280 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 15:18:25,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 15:18:26,817 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.AssertionError: MapEliminator tries to combine Int and (Array Int Int) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.indexEqualityInequalityImpliesValueEquality(MapEliminator.java:850) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.replaceSelectStoreTerm(MapEliminator.java:592) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.replaceStoreTerms(MapEliminator.java:542) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.getRewrittenTransFormula(MapEliminator.java:330) at de.uni_freiburg.informatik.ultimate.lassoranker.preprocessors.MapEliminationLassoPreprocessor.process(MapEliminationLassoPreprocessor.java:109) at de.uni_freiburg.informatik.ultimate.lassoranker.variables.LassoBuilder.applyPreprocessor(LassoBuilder.java:154) at de.uni_freiburg.informatik.ultimate.lassoranker.variables.LassoBuilder.preprocess(LassoBuilder.java:262) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.preprocess(LassoAnalysis.java:280) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.(LassoAnalysis.java:229) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.synthesize(LassoCheck.java:609) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.checkLassoTermination(LassoCheck.java:953) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.(LassoCheck.java:862) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.(LassoCheck.java:252) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.iterate(BuchiCegarLoop.java:457) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:143) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:398) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-08-27 15:18:26,821 INFO L168 Benchmark]: Toolchain (without parser) took 31061.33 ms. Allocated memory was 54.5 MB in the beginning and 174.1 MB in the end (delta: 119.5 MB). Free memory was 32.2 MB in the beginning and 79.8 MB in the end (delta: -47.6 MB). Peak memory consumption was 119.8 MB. Max. memory is 16.1 GB. [2021-08-27 15:18:26,821 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 54.5 MB. Free memory was 36.8 MB in the beginning and 36.7 MB in the end (delta: 38.1 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-27 15:18:26,821 INFO L168 Benchmark]: CACSL2BoogieTranslator took 147.57 ms. Allocated memory is still 54.5 MB. Free memory was 31.9 MB in the beginning and 35.9 MB in the end (delta: -4.0 MB). Peak memory consumption was 9.2 MB. Max. memory is 16.1 GB. [2021-08-27 15:18:26,822 INFO L168 Benchmark]: Boogie Procedure Inliner took 81.51 ms. Allocated memory was 54.5 MB in the beginning and 67.1 MB in the end (delta: 12.6 MB). Free memory was 35.9 MB in the beginning and 50.0 MB in the end (delta: -14.0 MB). Peak memory consumption was 2.3 MB. Max. memory is 16.1 GB. [2021-08-27 15:18:26,822 INFO L168 Benchmark]: Boogie Preprocessor took 33.14 ms. Allocated memory is still 67.1 MB. Free memory was 50.0 MB in the beginning and 48.9 MB in the end (delta: 1.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-08-27 15:18:26,822 INFO L168 Benchmark]: RCFGBuilder took 344.92 ms. Allocated memory is still 67.1 MB. Free memory was 48.7 MB in the beginning and 33.7 MB in the end (delta: 15.0 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.1 GB. [2021-08-27 15:18:26,822 INFO L168 Benchmark]: BuchiAutomizer took 30446.32 ms. Allocated memory was 67.1 MB in the beginning and 174.1 MB in the end (delta: 107.0 MB). Free memory was 33.7 MB in the beginning and 79.8 MB in the end (delta: -46.1 MB). Peak memory consumption was 108.2 MB. Max. memory is 16.1 GB. [2021-08-27 15:18:26,823 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.10 ms. Allocated memory is still 54.5 MB. Free memory was 36.8 MB in the beginning and 36.7 MB in the end (delta: 38.1 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 147.57 ms. Allocated memory is still 54.5 MB. Free memory was 31.9 MB in the beginning and 35.9 MB in the end (delta: -4.0 MB). Peak memory consumption was 9.2 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 81.51 ms. Allocated memory was 54.5 MB in the beginning and 67.1 MB in the end (delta: 12.6 MB). Free memory was 35.9 MB in the beginning and 50.0 MB in the end (delta: -14.0 MB). Peak memory consumption was 2.3 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 33.14 ms. Allocated memory is still 67.1 MB. Free memory was 50.0 MB in the beginning and 48.9 MB in the end (delta: 1.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 344.92 ms. Allocated memory is still 67.1 MB. Free memory was 48.7 MB in the beginning and 33.7 MB in the end (delta: 15.0 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.1 GB. * BuchiAutomizer took 30446.32 ms. Allocated memory was 67.1 MB in the beginning and 174.1 MB in the end (delta: 107.0 MB). Free memory was 33.7 MB in the beginning and 79.8 MB in the end (delta: -46.1 MB). Peak memory consumption was 108.2 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: AssertionError: MapEliminator tries to combine Int and (Array Int Int) de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: AssertionError: MapEliminator tries to combine Int and (Array Int Int): de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.indexEqualityInequalityImpliesValueEquality(MapEliminator.java:850) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2021-08-27 15:18:26,844 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (60)] Ended with exit code 0 [2021-08-27 15:18:27,053 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (59)] Ended with exit code 0 [2021-08-27 15:18:27,253 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (58)] Ended with exit code 0 [2021-08-27 15:18:27,453 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (57)] Forceful destruction successful, exit code 0 [2021-08-27 15:18:27,653 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Ended with exit code 0 [2021-08-27 15:18:27,853 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Ended with exit code 0 [2021-08-27 15:18:28,053 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Ended with exit code 0 [2021-08-27 15:18:28,282 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2021-08-27 15:18:28,444 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...