./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/array-memsafety/cstrcpy-alloca-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 6c24879c 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/array-memsafety/cstrcpy-alloca-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash fa78fde783b634840a8dd117d9f71a3fa4064d7e1622444edf74e6b44f549a34 --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-13 04:53:02,070 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-13 04:53:02,071 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-13 04:53:02,110 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-13 04:53:02,110 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-13 04:53:02,111 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-13 04:53:02,114 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-13 04:53:02,119 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-13 04:53:02,120 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-13 04:53:02,125 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-13 04:53:02,126 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-13 04:53:02,127 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-13 04:53:02,127 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-13 04:53:02,129 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-13 04:53:02,131 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-13 04:53:02,132 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-13 04:53:02,132 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-13 04:53:02,133 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-13 04:53:02,136 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-13 04:53:02,140 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-13 04:53:02,141 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-13 04:53:02,142 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-13 04:53:02,142 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-13 04:53:02,143 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-13 04:53:02,144 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-13 04:53:02,147 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-13 04:53:02,147 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-13 04:53:02,148 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-13 04:53:02,149 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-13 04:53:02,149 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-13 04:53:02,150 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-13 04:53:02,150 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-13 04:53:02,151 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-13 04:53:02,151 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-13 04:53:02,151 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-13 04:53:02,152 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-13 04:53:02,152 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-13 04:53:02,152 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-13 04:53:02,153 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-13 04:53:02,153 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-13 04:53:02,154 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-13 04:53:02,154 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-13 04:53:02,155 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2022-07-13 04:53:02,180 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-13 04:53:02,180 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-13 04:53:02,181 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-13 04:53:02,181 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-13 04:53:02,181 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-13 04:53:02,181 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-13 04:53:02,182 INFO L138 SettingsManager]: * Use SBE=true [2022-07-13 04:53:02,182 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-07-13 04:53:02,182 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-07-13 04:53:02,182 INFO L138 SettingsManager]: * Use old map elimination=false [2022-07-13 04:53:02,182 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-07-13 04:53:02,182 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-07-13 04:53:02,182 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-07-13 04:53:02,182 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-13 04:53:02,182 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-13 04:53:02,182 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-13 04:53:02,182 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-13 04:53:02,183 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-13 04:53:02,183 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-13 04:53:02,183 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-07-13 04:53:02,183 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-07-13 04:53:02,183 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-07-13 04:53:02,183 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-13 04:53:02,183 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-13 04:53:02,183 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-07-13 04:53:02,183 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-13 04:53:02,183 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-07-13 04:53:02,184 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-13 04:53:02,184 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-13 04:53:02,184 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-13 04:53:02,184 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-13 04:53:02,191 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-07-13 04:53:02,191 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 -> fa78fde783b634840a8dd117d9f71a3fa4064d7e1622444edf74e6b44f549a34 [2022-07-13 04:53:02,402 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-13 04:53:02,426 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-13 04:53:02,428 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-13 04:53:02,429 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-13 04:53:02,429 INFO L275 PluginConnector]: CDTParser initialized [2022-07-13 04:53:02,430 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-memsafety/cstrcpy-alloca-1.i [2022-07-13 04:53:02,484 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/69d5c32e0/1003ca6ebb814c94a505ae3d998d2603/FLAG166b19668 [2022-07-13 04:53:02,893 INFO L306 CDTParser]: Found 1 translation units. [2022-07-13 04:53:02,898 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety/cstrcpy-alloca-1.i [2022-07-13 04:53:02,909 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/69d5c32e0/1003ca6ebb814c94a505ae3d998d2603/FLAG166b19668 [2022-07-13 04:53:02,922 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/69d5c32e0/1003ca6ebb814c94a505ae3d998d2603 [2022-07-13 04:53:02,924 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-13 04:53:02,925 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-13 04:53:02,928 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-13 04:53:02,928 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-13 04:53:02,930 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-13 04:53:02,931 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 04:53:02" (1/1) ... [2022-07-13 04:53:02,932 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@63feda74 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:53:02, skipping insertion in model container [2022-07-13 04:53:02,932 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 04:53:02" (1/1) ... [2022-07-13 04:53:02,937 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-13 04:53:02,972 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 04:53:03,213 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 04:53:03,220 INFO L203 MainTranslator]: Completed pre-run [2022-07-13 04:53:03,258 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 04:53:03,283 INFO L208 MainTranslator]: Completed translation [2022-07-13 04:53:03,284 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:53:03 WrapperNode [2022-07-13 04:53:03,285 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-13 04:53:03,286 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-13 04:53:03,286 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-13 04:53:03,287 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-13 04:53:03,292 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:53:03" (1/1) ... [2022-07-13 04:53:03,308 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:53:03" (1/1) ... [2022-07-13 04:53:03,327 INFO L137 Inliner]: procedures = 117, calls = 13, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 65 [2022-07-13 04:53:03,327 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-13 04:53:03,328 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-13 04:53:03,328 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-13 04:53:03,329 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-13 04:53:03,334 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:53:03" (1/1) ... [2022-07-13 04:53:03,334 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:53:03" (1/1) ... [2022-07-13 04:53:03,344 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:53:03" (1/1) ... [2022-07-13 04:53:03,344 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:53:03" (1/1) ... [2022-07-13 04:53:03,354 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:53:03" (1/1) ... [2022-07-13 04:53:03,357 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:53:03" (1/1) ... [2022-07-13 04:53:03,364 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:53:03" (1/1) ... [2022-07-13 04:53:03,365 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-13 04:53:03,366 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-13 04:53:03,366 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-13 04:53:03,366 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-13 04:53:03,368 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:53:03" (1/1) ... [2022-07-13 04:53:03,373 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:53:03,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:53:03,391 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 04:53:03,410 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2022-07-13 04:53:03,422 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-13 04:53:03,423 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-13 04:53:03,423 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-13 04:53:03,423 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-13 04:53:03,423 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-13 04:53:03,423 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-13 04:53:03,482 INFO L234 CfgBuilder]: Building ICFG [2022-07-13 04:53:03,484 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-13 04:53:03,593 INFO L275 CfgBuilder]: Performing block encoding [2022-07-13 04:53:03,597 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-13 04:53:03,598 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-07-13 04:53:03,599 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 04:53:03 BoogieIcfgContainer [2022-07-13 04:53:03,599 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-13 04:53:03,614 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-07-13 04:53:03,615 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-07-13 04:53:03,617 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-07-13 04:53:03,618 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-13 04:53:03,618 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 13.07 04:53:02" (1/3) ... [2022-07-13 04:53:03,619 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@95c8da8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 13.07 04:53:03, skipping insertion in model container [2022-07-13 04:53:03,619 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-13 04:53:03,619 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:53:03" (2/3) ... [2022-07-13 04:53:03,619 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@95c8da8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 13.07 04:53:03, skipping insertion in model container [2022-07-13 04:53:03,619 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-13 04:53:03,619 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 04:53:03" (3/3) ... [2022-07-13 04:53:03,620 INFO L354 chiAutomizerObserver]: Analyzing ICFG cstrcpy-alloca-1.i [2022-07-13 04:53:03,681 INFO L255 stractBuchiCegarLoop]: Interprodecural is true [2022-07-13 04:53:03,681 INFO L256 stractBuchiCegarLoop]: Hoare is false [2022-07-13 04:53:03,681 INFO L257 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-07-13 04:53:03,681 INFO L258 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-07-13 04:53:03,681 INFO L259 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-07-13 04:53:03,681 INFO L260 stractBuchiCegarLoop]: Difference is false [2022-07-13 04:53:03,682 INFO L261 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-07-13 04:53:03,682 INFO L265 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-07-13 04:53:03,685 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 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) [2022-07-13 04:53:03,698 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2022-07-13 04:53:03,698 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 04:53:03,698 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 04:53:03,703 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-07-13 04:53:03,703 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-13 04:53:03,703 INFO L287 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-07-13 04:53:03,703 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 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) [2022-07-13 04:53:03,704 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2022-07-13 04:53:03,705 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 04:53:03,705 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 04:53:03,705 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-07-13 04:53:03,705 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-13 04:53:03,710 INFO L752 eck$LassoCheckResult]: Stem: 5#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 7#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~nondet6#1, main_#t~malloc7#1.base, main_#t~malloc7#1.offset, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~nondet10#1, main_#t~post9#1, main_~i~0#1, main_#t~ret11#1.base, main_#t~ret11#1.offset, main_~length1~0#1, main_~length2~0#1, main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset, main_~nondetString~0#1.base, main_~nondetString~0#1.offset;main_~length1~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~length2~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; 2#L525true assume !(main_~length1~0#1 < 1); 10#L525-2true assume !(main_~length2~0#1 < 1); 15#L528-1true assume !(main_~length1~0#1 < main_~length2~0#1);call main_#t~malloc7#1.base, main_#t~malloc7#1.offset := #Ultimate.allocOnStack(main_~length1~0#1);main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset := main_#t~malloc7#1.base, main_#t~malloc7#1.offset;call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnStack(main_~length2~0#1);main_~nondetString~0#1.base, main_~nondetString~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_~i~0#1 := 0; 4#L535-3true [2022-07-13 04:53:03,711 INFO L754 eck$LassoCheckResult]: Loop: 4#L535-3true assume !!(main_~i~0#1 < main_~length2~0#1 - 1);call write~int(main_#t~nondet10#1, main_~nondetString~0#1.base, main_~nondetString~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet10#1; 6#L535-2true main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 4#L535-3true [2022-07-13 04:53:03,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:53:03,716 INFO L85 PathProgramCache]: Analyzing trace with hash 28695882, now seen corresponding path program 1 times [2022-07-13 04:53:03,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:53:03,724 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226772558] [2022-07-13 04:53:03,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:53:03,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:53:03,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:53:03,809 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 04:53:03,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:53:03,840 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 04:53:03,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:53:03,842 INFO L85 PathProgramCache]: Analyzing trace with hash 1827, now seen corresponding path program 1 times [2022-07-13 04:53:03,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:53:03,843 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502150698] [2022-07-13 04:53:03,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:53:03,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:53:03,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:53:03,853 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 04:53:03,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:53:03,861 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 04:53:03,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:53:03,863 INFO L85 PathProgramCache]: Analyzing trace with hash 1806939692, now seen corresponding path program 1 times [2022-07-13 04:53:03,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:53:03,863 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672247834] [2022-07-13 04:53:03,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:53:03,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:53:03,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:53:03,885 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 04:53:03,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:53:03,901 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 04:53:04,213 INFO L210 LassoAnalysis]: Preferences: [2022-07-13 04:53:04,213 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-13 04:53:04,213 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-13 04:53:04,214 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-13 04:53:04,214 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-13 04:53:04,214 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:53:04,214 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-13 04:53:04,214 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-13 04:53:04,215 INFO L133 ssoRankerPreferences]: Filename of dumped script: cstrcpy-alloca-1.i_Iteration1_Lasso [2022-07-13 04:53:04,215 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-13 04:53:04,215 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-13 04:53:04,233 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:53:04,238 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:53:04,240 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:53:04,428 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:53:04,433 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:53:04,435 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:53: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 [2022-07-13 04:53:04,439 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:53:04,441 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:53:04,443 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:53:04,446 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:53:04,450 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:53:04,452 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:53:04,677 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-13 04:53:04,679 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-13 04:53:04,681 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:53:04,681 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:53:04,683 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 04:53:04,688 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2022-07-13 04:53:04,689 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 04:53:04,696 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:53:04,696 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 04:53:04,697 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:53:04,697 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:53:04,697 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:53:04,698 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 04:53:04,698 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 04:53:04,712 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 04:53:04,732 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2022-07-13 04:53:04,732 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:53:04,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:53:04,735 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 04:53:04,736 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2022-07-13 04:53:04,737 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 04:53:04,744 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:53:04,744 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 04:53:04,744 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:53:04,744 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:53:04,744 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:53:04,749 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 04:53:04,749 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 04:53:04,761 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 04:53:04,776 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2022-07-13 04:53:04,777 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:53:04,777 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:53:04,778 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 04:53:04,779 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2022-07-13 04:53:04,821 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 04:53:04,827 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:53:04,828 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:53:04,828 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:53:04,828 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:53:04,836 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 04:53:04,836 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 04:53:04,874 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-13 04:53:04,908 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2022-07-13 04:53:04,909 INFO L444 ModelExtractionUtils]: 14 out of 28 variables were initially zero. Simplification set additionally 10 variables to zero. [2022-07-13 04:53:04,910 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:53:04,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:53:04,940 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 04:53:04,941 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2022-07-13 04:53:04,954 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-13 04:53:04,983 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2022-07-13 04:53:04,983 INFO L513 LassoAnalysis]: Proved termination. [2022-07-13 04:53:04,984 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1, v_rep(select #length ULTIMATE.start_main_#t~malloc8#1.base)_1) = -1*ULTIMATE.start_main_~i~0#1 + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc8#1.base)_1 Supporting invariants [1*ULTIMATE.start_main_~nondetString~0#1.offset >= 0] [2022-07-13 04:53:05,003 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2022-07-13 04:53:05,031 INFO L293 tatePredicateManager]: 5 out of 7 supporting invariants were superfluous and have been removed [2022-07-13 04:53:05,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:53:05,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 04:53:05,099 INFO L263 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-13 04:53:05,101 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 04:53:05,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 04:53:05,122 INFO L263 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-13 04:53:05,123 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 04:53:05,150 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 04:53:05,186 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2022-07-13 04:53:05,188 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 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) Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 04:53:05,263 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 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). Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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 44 transitions. Complement of second has 8 states. [2022-07-13 04:53:05,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2022-07-13 04:53:05,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 04:53:05,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 29 transitions. [2022-07-13 04:53:05,273 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 29 transitions. Stem has 5 letters. Loop has 2 letters. [2022-07-13 04:53:05,274 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-13 04:53:05,274 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 29 transitions. Stem has 7 letters. Loop has 2 letters. [2022-07-13 04:53:05,274 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-13 04:53:05,274 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 29 transitions. Stem has 5 letters. Loop has 4 letters. [2022-07-13 04:53:05,274 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-13 04:53:05,275 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 44 transitions. [2022-07-13 04:53:05,279 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-07-13 04:53:05,282 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 11 states and 15 transitions. [2022-07-13 04:53:05,283 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2022-07-13 04:53:05,284 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2022-07-13 04:53:05,285 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 15 transitions. [2022-07-13 04:53:05,285 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 04:53:05,285 INFO L369 hiAutomatonCegarLoop]: Abstraction has 11 states and 15 transitions. [2022-07-13 04:53:05,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 15 transitions. [2022-07-13 04:53:05,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2022-07-13 04:53:05,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 10 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 04:53:05,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 15 transitions. [2022-07-13 04:53:05,307 INFO L392 hiAutomatonCegarLoop]: Abstraction has 11 states and 15 transitions. [2022-07-13 04:53:05,307 INFO L374 stractBuchiCegarLoop]: Abstraction has 11 states and 15 transitions. [2022-07-13 04:53:05,307 INFO L287 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-07-13 04:53:05,307 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 15 transitions. [2022-07-13 04:53:05,309 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-07-13 04:53:05,309 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 04:53:05,309 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 04:53:05,309 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-13 04:53:05,309 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-13 04:53:05,310 INFO L752 eck$LassoCheckResult]: Stem: 136#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 137#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~nondet6#1, main_#t~malloc7#1.base, main_#t~malloc7#1.offset, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~nondet10#1, main_#t~post9#1, main_~i~0#1, main_#t~ret11#1.base, main_#t~ret11#1.offset, main_~length1~0#1, main_~length2~0#1, main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset, main_~nondetString~0#1.base, main_~nondetString~0#1.offset;main_~length1~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~length2~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; 130#L525 assume !(main_~length1~0#1 < 1); 131#L525-2 assume !(main_~length2~0#1 < 1); 140#L528-1 assume !(main_~length1~0#1 < main_~length2~0#1);call main_#t~malloc7#1.base, main_#t~malloc7#1.offset := #Ultimate.allocOnStack(main_~length1~0#1);main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset := main_#t~malloc7#1.base, main_#t~malloc7#1.offset;call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnStack(main_~length2~0#1);main_~nondetString~0#1.base, main_~nondetString~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_~i~0#1 := 0; 132#L535-3 assume !(main_~i~0#1 < main_~length2~0#1 - 1); 133#L535-4 call write~int(0, main_~nondetString~0#1.base, main_~nondetString~0#1.offset + (main_~length2~0#1 - 1), 1);assume { :begin_inline_cstrcpy } true;cstrcpy_#in~s1#1.base, cstrcpy_#in~s1#1.offset, cstrcpy_#in~s2#1.base, cstrcpy_#in~s2#1.offset := main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset, main_~nondetString~0#1.base, main_~nondetString~0#1.offset;havoc cstrcpy_#res#1.base, cstrcpy_#res#1.offset;havoc cstrcpy_#t~post2#1.base, cstrcpy_#t~post2#1.offset, cstrcpy_#t~post3#1.base, cstrcpy_#t~post3#1.offset, cstrcpy_#t~mem4#1, cstrcpy_~s1#1.base, cstrcpy_~s1#1.offset, cstrcpy_~s2#1.base, cstrcpy_~s2#1.offset, cstrcpy_~dst~0#1.base, cstrcpy_~dst~0#1.offset, cstrcpy_~src~0#1.base, cstrcpy_~src~0#1.offset;cstrcpy_~s1#1.base, cstrcpy_~s1#1.offset := cstrcpy_#in~s1#1.base, cstrcpy_#in~s1#1.offset;cstrcpy_~s2#1.base, cstrcpy_~s2#1.offset := cstrcpy_#in~s2#1.base, cstrcpy_#in~s2#1.offset;cstrcpy_~dst~0#1.base, cstrcpy_~dst~0#1.offset := cstrcpy_~s1#1.base, cstrcpy_~s1#1.offset;cstrcpy_~src~0#1.base, cstrcpy_~src~0#1.offset := cstrcpy_~s2#1.base, cstrcpy_~s2#1.offset; 138#L518-3 [2022-07-13 04:53:05,310 INFO L754 eck$LassoCheckResult]: Loop: 138#L518-3 cstrcpy_#t~post2#1.base, cstrcpy_#t~post2#1.offset := cstrcpy_~dst~0#1.base, cstrcpy_~dst~0#1.offset;cstrcpy_~dst~0#1.base, cstrcpy_~dst~0#1.offset := cstrcpy_#t~post2#1.base, 1 + cstrcpy_#t~post2#1.offset;cstrcpy_#t~post3#1.base, cstrcpy_#t~post3#1.offset := cstrcpy_~src~0#1.base, cstrcpy_~src~0#1.offset;cstrcpy_~src~0#1.base, cstrcpy_~src~0#1.offset := cstrcpy_#t~post3#1.base, 1 + cstrcpy_#t~post3#1.offset;call cstrcpy_#t~mem4#1 := read~int(cstrcpy_#t~post3#1.base, cstrcpy_#t~post3#1.offset, 1);call write~int(cstrcpy_#t~mem4#1, cstrcpy_#t~post2#1.base, cstrcpy_#t~post2#1.offset, 1); 139#L518-1 assume !!(0 != cstrcpy_#t~mem4#1);havoc cstrcpy_#t~post2#1.base, cstrcpy_#t~post2#1.offset;havoc cstrcpy_#t~post3#1.base, cstrcpy_#t~post3#1.offset;havoc cstrcpy_#t~mem4#1; 138#L518-3 [2022-07-13 04:53:05,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:53:05,314 INFO L85 PathProgramCache]: Analyzing trace with hash 1806939634, now seen corresponding path program 1 times [2022-07-13 04:53:05,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:53:05,314 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586611077] [2022-07-13 04:53:05,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:53:05,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:53:05,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:53:05,346 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 04:53:05,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:53:05,380 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 04:53:05,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:53:05,380 INFO L85 PathProgramCache]: Analyzing trace with hash 2182, now seen corresponding path program 1 times [2022-07-13 04:53:05,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:53:05,380 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602515102] [2022-07-13 04:53:05,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:53:05,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:53:05,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:53:05,402 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 04:53:05,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:53:05,408 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 04:53:05,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:53:05,409 INFO L85 PathProgramCache]: Analyzing trace with hash 1302201911, now seen corresponding path program 1 times [2022-07-13 04:53:05,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:53:05,410 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010146759] [2022-07-13 04:53:05,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:53:05,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:53:05,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 04:53:05,519 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2022-07-13 04:53:05,566 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 04:53:05,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 04:53:05,567 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010146759] [2022-07-13 04:53:05,567 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2010146759] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 04:53:05,567 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 04:53:05,567 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-13 04:53:05,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249657619] [2022-07-13 04:53:05,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 04:53:05,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 04:53:05,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-13 04:53:05,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-13 04:53:05,641 INFO L87 Difference]: Start difference. First operand 11 states and 15 transitions. cyclomatic complexity: 6 Second operand has 7 states, 6 states have (on average 1.5) internal successors, (9), 7 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 04:53:05,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 04:53:05,692 INFO L93 Difference]: Finished difference Result 15 states and 18 transitions. [2022-07-13 04:53:05,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-13 04:53:05,693 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 18 transitions. [2022-07-13 04:53:05,693 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-07-13 04:53:05,694 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 12 states and 15 transitions. [2022-07-13 04:53:05,694 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2022-07-13 04:53:05,694 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2022-07-13 04:53:05,694 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 15 transitions. [2022-07-13 04:53:05,694 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 04:53:05,694 INFO L369 hiAutomatonCegarLoop]: Abstraction has 12 states and 15 transitions. [2022-07-13 04:53:05,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 15 transitions. [2022-07-13 04:53:05,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 11. [2022-07-13 04:53:05,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 10 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 04:53:05,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 14 transitions. [2022-07-13 04:53:05,696 INFO L392 hiAutomatonCegarLoop]: Abstraction has 11 states and 14 transitions. [2022-07-13 04:53:05,696 INFO L374 stractBuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2022-07-13 04:53:05,696 INFO L287 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-07-13 04:53:05,696 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 14 transitions. [2022-07-13 04:53:05,696 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-07-13 04:53:05,696 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 04:53:05,697 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 04:53:05,697 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 04:53:05,697 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-13 04:53:05,697 INFO L752 eck$LassoCheckResult]: Stem: 180#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 181#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~nondet6#1, main_#t~malloc7#1.base, main_#t~malloc7#1.offset, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~nondet10#1, main_#t~post9#1, main_~i~0#1, main_#t~ret11#1.base, main_#t~ret11#1.offset, main_~length1~0#1, main_~length2~0#1, main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset, main_~nondetString~0#1.base, main_~nondetString~0#1.offset;main_~length1~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~length2~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; 174#L525 assume !(main_~length1~0#1 < 1); 175#L525-2 assume !(main_~length2~0#1 < 1); 184#L528-1 assume !(main_~length1~0#1 < main_~length2~0#1);call main_#t~malloc7#1.base, main_#t~malloc7#1.offset := #Ultimate.allocOnStack(main_~length1~0#1);main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset := main_#t~malloc7#1.base, main_#t~malloc7#1.offset;call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnStack(main_~length2~0#1);main_~nondetString~0#1.base, main_~nondetString~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_~i~0#1 := 0; 176#L535-3 assume !!(main_~i~0#1 < main_~length2~0#1 - 1);call write~int(main_#t~nondet10#1, main_~nondetString~0#1.base, main_~nondetString~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet10#1; 177#L535-2 main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 178#L535-3 assume !(main_~i~0#1 < main_~length2~0#1 - 1); 179#L535-4 call write~int(0, main_~nondetString~0#1.base, main_~nondetString~0#1.offset + (main_~length2~0#1 - 1), 1);assume { :begin_inline_cstrcpy } true;cstrcpy_#in~s1#1.base, cstrcpy_#in~s1#1.offset, cstrcpy_#in~s2#1.base, cstrcpy_#in~s2#1.offset := main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset, main_~nondetString~0#1.base, main_~nondetString~0#1.offset;havoc cstrcpy_#res#1.base, cstrcpy_#res#1.offset;havoc cstrcpy_#t~post2#1.base, cstrcpy_#t~post2#1.offset, cstrcpy_#t~post3#1.base, cstrcpy_#t~post3#1.offset, cstrcpy_#t~mem4#1, cstrcpy_~s1#1.base, cstrcpy_~s1#1.offset, cstrcpy_~s2#1.base, cstrcpy_~s2#1.offset, cstrcpy_~dst~0#1.base, cstrcpy_~dst~0#1.offset, cstrcpy_~src~0#1.base, cstrcpy_~src~0#1.offset;cstrcpy_~s1#1.base, cstrcpy_~s1#1.offset := cstrcpy_#in~s1#1.base, cstrcpy_#in~s1#1.offset;cstrcpy_~s2#1.base, cstrcpy_~s2#1.offset := cstrcpy_#in~s2#1.base, cstrcpy_#in~s2#1.offset;cstrcpy_~dst~0#1.base, cstrcpy_~dst~0#1.offset := cstrcpy_~s1#1.base, cstrcpy_~s1#1.offset;cstrcpy_~src~0#1.base, cstrcpy_~src~0#1.offset := cstrcpy_~s2#1.base, cstrcpy_~s2#1.offset; 182#L518-3 [2022-07-13 04:53:05,697 INFO L754 eck$LassoCheckResult]: Loop: 182#L518-3 cstrcpy_#t~post2#1.base, cstrcpy_#t~post2#1.offset := cstrcpy_~dst~0#1.base, cstrcpy_~dst~0#1.offset;cstrcpy_~dst~0#1.base, cstrcpy_~dst~0#1.offset := cstrcpy_#t~post2#1.base, 1 + cstrcpy_#t~post2#1.offset;cstrcpy_#t~post3#1.base, cstrcpy_#t~post3#1.offset := cstrcpy_~src~0#1.base, cstrcpy_~src~0#1.offset;cstrcpy_~src~0#1.base, cstrcpy_~src~0#1.offset := cstrcpy_#t~post3#1.base, 1 + cstrcpy_#t~post3#1.offset;call cstrcpy_#t~mem4#1 := read~int(cstrcpy_#t~post3#1.base, cstrcpy_#t~post3#1.offset, 1);call write~int(cstrcpy_#t~mem4#1, cstrcpy_#t~post2#1.base, cstrcpy_#t~post2#1.offset, 1); 183#L518-1 assume !!(0 != cstrcpy_#t~mem4#1);havoc cstrcpy_#t~post2#1.base, cstrcpy_#t~post2#1.offset;havoc cstrcpy_#t~post3#1.base, cstrcpy_#t~post3#1.offset;havoc cstrcpy_#t~mem4#1; 182#L518-3 [2022-07-13 04:53:05,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:53:05,698 INFO L85 PathProgramCache]: Analyzing trace with hash 1302257236, now seen corresponding path program 1 times [2022-07-13 04:53:05,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:53:05,698 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410353909] [2022-07-13 04:53:05,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:53:05,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:53:05,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:53:05,709 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 04:53:05,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:53:05,719 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 04:53:05,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:53:05,719 INFO L85 PathProgramCache]: Analyzing trace with hash 2182, now seen corresponding path program 2 times [2022-07-13 04:53:05,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:53:05,720 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913442694] [2022-07-13 04:53:05,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:53:05,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:53:05,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:53:05,724 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 04:53:05,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:53:05,728 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 04:53:05,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:53:05,729 INFO L85 PathProgramCache]: Analyzing trace with hash 1633721881, now seen corresponding path program 1 times [2022-07-13 04:53:05,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:53:05,729 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047082715] [2022-07-13 04:53:05,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:53:05,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:53:05,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:53:05,741 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 04:53:05,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:53:05,759 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 04:53:06,349 INFO L210 LassoAnalysis]: Preferences: [2022-07-13 04:53:06,349 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-13 04:53:06,349 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-13 04:53:06,349 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-13 04:53:06,350 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-13 04:53:06,350 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:53:06,350 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-13 04:53:06,350 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-13 04:53:06,350 INFO L133 ssoRankerPreferences]: Filename of dumped script: cstrcpy-alloca-1.i_Iteration3_Lasso [2022-07-13 04:53:06,350 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-13 04:53:06,350 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-13 04:53:06,353 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:53:06,357 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:53:06,359 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:53:06,360 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:53:06,362 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:53:06,849 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:53:06,852 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:53:06,854 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:53:06,856 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:53:06,857 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:53:06,859 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:53:06,861 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:53:06,863 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:53:06,865 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:53:06,866 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:53:06,869 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:53:06,870 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:53:06,872 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:53:06,873 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:53:06,875 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:53:07,314 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-13 04:53:07,315 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-13 04:53:07,315 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:53:07,315 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:53:07,319 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 04:53:07,333 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2022-07-13 04:53:07,334 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 04:53:07,340 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:53:07,340 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 04:53:07,340 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:53:07,340 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:53:07,340 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:53:07,341 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 04:53:07,341 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 04:53:07,356 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 04:53:07,374 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2022-07-13 04:53:07,375 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:53:07,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:53:07,376 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 04:53:07,377 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2022-07-13 04:53:07,378 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 04:53:07,384 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:53:07,384 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 04:53:07,384 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:53:07,385 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:53:07,385 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:53:07,385 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 04:53:07,385 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 04:53:07,399 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 04:53:07,415 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 [2022-07-13 04:53:07,415 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:53:07,416 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:53:07,417 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 04:53:07,417 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2022-07-13 04:53:07,419 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 04:53:07,425 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:53:07,426 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 04:53:07,426 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:53:07,426 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:53:07,426 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:53:07,426 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 04:53:07,426 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 04:53:07,431 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 04:53:07,453 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2022-07-13 04:53:07,453 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:53:07,453 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:53:07,454 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 04:53:07,458 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2022-07-13 04:53:07,459 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 04:53:07,466 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:53:07,466 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:53:07,466 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:53:07,466 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:53:07,468 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 04:53:07,468 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 04:53:07,477 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 04:53:07,500 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2022-07-13 04:53:07,501 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:53:07,501 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:53:07,504 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 04:53:07,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 [2022-07-13 04:53:07,523 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:53:07,523 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:53:07,523 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2022-07-13 04:53:07,523 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:53:07,529 INFO L401 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2022-07-13 04:53:07,529 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2022-07-13 04:53:07,537 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2022-07-13 04:53:07,543 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 04:53:07,561 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2022-07-13 04:53:07,563 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:53:07,563 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:53:07,564 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 04:53:07,571 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 04:53:07,577 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:53:07,577 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:53:07,577 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:53:07,577 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:53:07,579 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 04:53:07,579 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 04:53:07,582 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2022-07-13 04:53:07,590 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 04:53:07,609 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2022-07-13 04:53:07,610 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:53:07,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:53:07,611 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 04:53:07,612 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2022-07-13 04:53:07,613 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 04:53:07,620 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:53:07,620 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:53:07,620 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:53:07,621 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:53:07,624 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 04:53:07,625 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 04:53:07,643 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 04:53:07,665 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2022-07-13 04:53:07,666 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:53:07,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:53:07,668 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 04:53:07,669 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2022-07-13 04:53:07,670 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 04:53:07,677 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:53:07,677 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:53:07,677 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:53:07,677 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:53:07,680 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 04:53:07,680 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 04:53:07,694 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 04:53:07,712 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2022-07-13 04:53:07,712 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:53:07,713 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:53:07,714 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 04:53:07,715 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2022-07-13 04:53:07,716 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 04:53:07,722 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:53:07,722 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:53:07,722 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:53:07,722 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:53:07,724 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 04:53:07,724 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 04:53:07,739 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 04:53:07,759 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2022-07-13 04:53:07,760 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:53:07,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:53:07,761 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) [2022-07-13 04:53:07,761 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 [2022-07-13 04:53:07,763 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 04:53:07,770 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:53:07,770 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:53:07,770 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:53:07,770 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:53:07,777 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 04:53:07,777 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 04:53:07,791 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 04:53:07,813 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2022-07-13 04:53:07,813 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:53:07,813 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:53:07,815 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) [2022-07-13 04:53:07,816 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 [2022-07-13 04:53:07,817 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 04:53:07,823 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:53:07,823 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 04:53:07,823 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:53:07,823 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:53:07,823 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:53:07,824 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 04:53:07,824 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 04:53:07,833 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 04:53:07,849 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2022-07-13 04:53:07,849 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:53:07,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:53:07,852 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 04:53:07,853 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2022-07-13 04:53:07,854 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 04:53:07,860 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:53:07,861 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:53:07,861 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:53:07,861 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:53:07,871 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 04:53:07,871 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 04:53:07,889 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-13 04:53:07,922 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2022-07-13 04:53:07,922 INFO L444 ModelExtractionUtils]: 33 out of 52 variables were initially zero. Simplification set additionally 14 variables to zero. [2022-07-13 04:53:07,922 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:53:07,922 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:53:07,928 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 04:53:07,930 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2022-07-13 04:53:07,931 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-13 04:53:07,949 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2022-07-13 04:53:07,949 INFO L513 LassoAnalysis]: Proved termination. [2022-07-13 04:53:07,949 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrcpy_~src~0#1.offset) = -2*ULTIMATE.start_cstrcpy_~src~0#1.offset + 3 Supporting invariants [-1*v_rep(select #length ULTIMATE.start_main_#t~malloc8#1.base)_2 + 2 >= 0] [2022-07-13 04:53:07,969 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2022-07-13 04:53:08,007 INFO L293 tatePredicateManager]: 13 out of 15 supporting invariants were superfluous and have been removed [2022-07-13 04:53:08,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:53:08,073 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2022-07-13 04:53:08,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 04:53:08,078 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 15 conjunts are in the unsatisfiable core [2022-07-13 04:53:08,079 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 04:53:08,117 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-13 04:53:08,118 INFO L390 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 9 treesize of output 15 [2022-07-13 04:53:08,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 04:53:08,176 INFO L263 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-13 04:53:08,176 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 04:53:08,203 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 04:53:08,204 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.4 stem predicates 2 loop predicates [2022-07-13 04:53:08,205 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states and 14 transitions. cyclomatic complexity: 5 Second operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 04:53:08,274 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states and 14 transitions. cyclomatic complexity: 5. Second operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 21 states and 25 transitions. Complement of second has 9 states. [2022-07-13 04:53:08,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 4 stem states 1 non-accepting loop states 2 accepting loop states [2022-07-13 04:53:08,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 04:53:08,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 20 transitions. [2022-07-13 04:53:08,275 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 20 transitions. Stem has 9 letters. Loop has 2 letters. [2022-07-13 04:53:08,276 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-13 04:53:08,276 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 20 transitions. Stem has 11 letters. Loop has 2 letters. [2022-07-13 04:53:08,276 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-13 04:53:08,276 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 20 transitions. Stem has 9 letters. Loop has 4 letters. [2022-07-13 04:53:08,276 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-13 04:53:08,276 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 25 transitions. [2022-07-13 04:53:08,277 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-07-13 04:53:08,277 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 16 states and 19 transitions. [2022-07-13 04:53:08,277 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2022-07-13 04:53:08,277 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2022-07-13 04:53:08,278 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 19 transitions. [2022-07-13 04:53:08,278 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 04:53:08,278 INFO L369 hiAutomatonCegarLoop]: Abstraction has 16 states and 19 transitions. [2022-07-13 04:53:08,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 19 transitions. [2022-07-13 04:53:08,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 13. [2022-07-13 04:53:08,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 12 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 04:53:08,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 16 transitions. [2022-07-13 04:53:08,279 INFO L392 hiAutomatonCegarLoop]: Abstraction has 13 states and 16 transitions. [2022-07-13 04:53:08,279 INFO L374 stractBuchiCegarLoop]: Abstraction has 13 states and 16 transitions. [2022-07-13 04:53:08,279 INFO L287 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2022-07-13 04:53:08,279 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 16 transitions. [2022-07-13 04:53:08,280 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-07-13 04:53:08,280 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 04:53:08,280 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 04:53:08,280 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 04:53:08,280 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-13 04:53:08,281 INFO L752 eck$LassoCheckResult]: Stem: 346#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 347#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~nondet6#1, main_#t~malloc7#1.base, main_#t~malloc7#1.offset, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~nondet10#1, main_#t~post9#1, main_~i~0#1, main_#t~ret11#1.base, main_#t~ret11#1.offset, main_~length1~0#1, main_~length2~0#1, main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset, main_~nondetString~0#1.base, main_~nondetString~0#1.offset;main_~length1~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~length2~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; 340#L525 assume !(main_~length1~0#1 < 1); 341#L525-2 assume !(main_~length2~0#1 < 1); 351#L528-1 assume !(main_~length1~0#1 < main_~length2~0#1);call main_#t~malloc7#1.base, main_#t~malloc7#1.offset := #Ultimate.allocOnStack(main_~length1~0#1);main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset := main_#t~malloc7#1.base, main_#t~malloc7#1.offset;call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnStack(main_~length2~0#1);main_~nondetString~0#1.base, main_~nondetString~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_~i~0#1 := 0; 342#L535-3 assume !!(main_~i~0#1 < main_~length2~0#1 - 1);call write~int(main_#t~nondet10#1, main_~nondetString~0#1.base, main_~nondetString~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet10#1; 343#L535-2 main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 344#L535-3 assume !!(main_~i~0#1 < main_~length2~0#1 - 1);call write~int(main_#t~nondet10#1, main_~nondetString~0#1.base, main_~nondetString~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet10#1; 345#L535-2 main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 352#L535-3 assume !(main_~i~0#1 < main_~length2~0#1 - 1); 348#L535-4 call write~int(0, main_~nondetString~0#1.base, main_~nondetString~0#1.offset + (main_~length2~0#1 - 1), 1);assume { :begin_inline_cstrcpy } true;cstrcpy_#in~s1#1.base, cstrcpy_#in~s1#1.offset, cstrcpy_#in~s2#1.base, cstrcpy_#in~s2#1.offset := main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset, main_~nondetString~0#1.base, main_~nondetString~0#1.offset;havoc cstrcpy_#res#1.base, cstrcpy_#res#1.offset;havoc cstrcpy_#t~post2#1.base, cstrcpy_#t~post2#1.offset, cstrcpy_#t~post3#1.base, cstrcpy_#t~post3#1.offset, cstrcpy_#t~mem4#1, cstrcpy_~s1#1.base, cstrcpy_~s1#1.offset, cstrcpy_~s2#1.base, cstrcpy_~s2#1.offset, cstrcpy_~dst~0#1.base, cstrcpy_~dst~0#1.offset, cstrcpy_~src~0#1.base, cstrcpy_~src~0#1.offset;cstrcpy_~s1#1.base, cstrcpy_~s1#1.offset := cstrcpy_#in~s1#1.base, cstrcpy_#in~s1#1.offset;cstrcpy_~s2#1.base, cstrcpy_~s2#1.offset := cstrcpy_#in~s2#1.base, cstrcpy_#in~s2#1.offset;cstrcpy_~dst~0#1.base, cstrcpy_~dst~0#1.offset := cstrcpy_~s1#1.base, cstrcpy_~s1#1.offset;cstrcpy_~src~0#1.base, cstrcpy_~src~0#1.offset := cstrcpy_~s2#1.base, cstrcpy_~s2#1.offset; 349#L518-3 [2022-07-13 04:53:08,281 INFO L754 eck$LassoCheckResult]: Loop: 349#L518-3 cstrcpy_#t~post2#1.base, cstrcpy_#t~post2#1.offset := cstrcpy_~dst~0#1.base, cstrcpy_~dst~0#1.offset;cstrcpy_~dst~0#1.base, cstrcpy_~dst~0#1.offset := cstrcpy_#t~post2#1.base, 1 + cstrcpy_#t~post2#1.offset;cstrcpy_#t~post3#1.base, cstrcpy_#t~post3#1.offset := cstrcpy_~src~0#1.base, cstrcpy_~src~0#1.offset;cstrcpy_~src~0#1.base, cstrcpy_~src~0#1.offset := cstrcpy_#t~post3#1.base, 1 + cstrcpy_#t~post3#1.offset;call cstrcpy_#t~mem4#1 := read~int(cstrcpy_#t~post3#1.base, cstrcpy_#t~post3#1.offset, 1);call write~int(cstrcpy_#t~mem4#1, cstrcpy_#t~post2#1.base, cstrcpy_#t~post2#1.offset, 1); 350#L518-1 assume !!(0 != cstrcpy_#t~mem4#1);havoc cstrcpy_#t~post2#1.base, cstrcpy_#t~post2#1.offset;havoc cstrcpy_#t~post3#1.base, cstrcpy_#t~post3#1.offset;havoc cstrcpy_#t~mem4#1; 349#L518-3 [2022-07-13 04:53:08,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:53:08,281 INFO L85 PathProgramCache]: Analyzing trace with hash 1633777206, now seen corresponding path program 2 times [2022-07-13 04:53:08,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:53:08,281 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221471354] [2022-07-13 04:53:08,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:53:08,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:53:08,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:53:08,293 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 04:53:08,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:53:08,307 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 04:53:08,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:53:08,308 INFO L85 PathProgramCache]: Analyzing trace with hash 2182, now seen corresponding path program 3 times [2022-07-13 04:53:08,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:53:08,308 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838878372] [2022-07-13 04:53:08,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:53:08,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:53:08,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:53:08,322 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 04:53:08,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:53:08,325 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 04:53:08,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:53:08,326 INFO L85 PathProgramCache]: Analyzing trace with hash -1898134149, now seen corresponding path program 2 times [2022-07-13 04:53:08,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:53:08,326 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635209226] [2022-07-13 04:53:08,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:53:08,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:53:08,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:53:08,337 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 04:53:08,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:53:08,363 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 04:53:08,955 INFO L210 LassoAnalysis]: Preferences: [2022-07-13 04:53:08,955 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-13 04:53:08,955 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-13 04:53:08,955 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-13 04:53:08,955 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-13 04:53:08,955 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:53:08,955 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-13 04:53:08,955 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-13 04:53:08,955 INFO L133 ssoRankerPreferences]: Filename of dumped script: cstrcpy-alloca-1.i_Iteration4_Lasso [2022-07-13 04:53:08,955 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-13 04:53:08,955 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-13 04:53:08,958 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:53:08,962 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:53:08,964 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:53:08,965 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:53:08,966 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:53:08,969 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:53:08,971 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:53:08,972 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:53:08,974 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:53:08,975 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:53:08,976 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:53:08,978 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:53:08,980 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:53:08,982 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:53:08,984 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:53:09,370 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.IllegalArgumentException at de.uni_freiburg.informatik.ultimate.util.datastructures.ScopedHashMap.put(ScopedHashMap.java:331) at java.base/java.util.AbstractMap.putAll(AbstractMap.java:281) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.PureSubstitution.(PureSubstitution.java:81) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.Substitution.(Substitution.java:48) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.Substitution.apply(Substitution.java:59) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.replaceMapReads(MapEliminator.java:518) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.getRewrittenTransFormula(MapEliminator.java:342) at de.uni_freiburg.informatik.ultimate.lassoranker.preprocessors.MapEliminationLassoPreprocessor.process(MapEliminationLassoPreprocessor.java:111) at de.uni_freiburg.informatik.ultimate.lassoranker.variables.LassoBuilder.applyPreprocessor(LassoBuilder.java:154) at de.uni_freiburg.informatik.ultimate.lassoranker.variables.LassoBuilder.preprocess(LassoBuilder.java:262) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.preprocess(LassoAnalysis.java:280) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.(LassoAnalysis.java:229) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.synthesize(LassoCheck.java:601) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.checkLassoTermination(LassoCheck.java:914) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.(LassoCheck.java:823) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.(LassoCheck.java:247) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.cegar.AbstractBuchiCegarLoop.runCegarLoop(AbstractBuchiCegarLoop.java:310) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:146) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:363) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-07-13 04:53:09,372 INFO L158 Benchmark]: Toolchain (without parser) took 6446.89ms. Allocated memory was 86.0MB in the beginning and 163.6MB in the end (delta: 77.6MB). Free memory was 50.1MB in the beginning and 99.4MB in the end (delta: -49.3MB). Peak memory consumption was 79.8MB. Max. memory is 16.1GB. [2022-07-13 04:53:09,373 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 86.0MB. Free memory was 55.1MB in the beginning and 55.1MB in the end (delta: 25.4kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 04:53:09,374 INFO L158 Benchmark]: CACSL2BoogieTranslator took 357.82ms. Allocated memory was 86.0MB in the beginning and 123.7MB in the end (delta: 37.7MB). Free memory was 49.9MB in the beginning and 91.8MB in the end (delta: -42.0MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-07-13 04:53:09,374 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.53ms. Allocated memory is still 123.7MB. Free memory was 91.8MB in the beginning and 90.5MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 04:53:09,375 INFO L158 Benchmark]: Boogie Preprocessor took 37.29ms. Allocated memory is still 123.7MB. Free memory was 90.5MB in the beginning and 89.0MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-13 04:53:09,375 INFO L158 Benchmark]: RCFGBuilder took 232.89ms. Allocated memory is still 123.7MB. Free memory was 89.0MB in the beginning and 78.6MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-07-13 04:53:09,376 INFO L158 Benchmark]: BuchiAutomizer took 5757.61ms. Allocated memory was 123.7MB in the beginning and 163.6MB in the end (delta: 39.8MB). Free memory was 77.9MB in the beginning and 99.4MB in the end (delta: -21.5MB). Peak memory consumption was 73.8MB. Max. memory is 16.1GB. [2022-07-13 04:53:09,378 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.13ms. Allocated memory is still 86.0MB. Free memory was 55.1MB in the beginning and 55.1MB in the end (delta: 25.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 357.82ms. Allocated memory was 86.0MB in the beginning and 123.7MB in the end (delta: 37.7MB). Free memory was 49.9MB in the beginning and 91.8MB in the end (delta: -42.0MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 41.53ms. Allocated memory is still 123.7MB. Free memory was 91.8MB in the beginning and 90.5MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 37.29ms. Allocated memory is still 123.7MB. Free memory was 90.5MB in the beginning and 89.0MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 232.89ms. Allocated memory is still 123.7MB. Free memory was 89.0MB in the beginning and 78.6MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * BuchiAutomizer took 5757.61ms. Allocated memory was 123.7MB in the beginning and 163.6MB in the end (delta: 39.8MB). Free memory was 77.9MB in the beginning and 99.4MB in the end (delta: -21.5MB). Peak memory consumption was 73.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: IllegalArgumentException: null de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: IllegalArgumentException: null: de.uni_freiburg.informatik.ultimate.util.datastructures.ScopedHashMap.put(ScopedHashMap.java:331) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-07-13 04:53:09,412 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... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis No suitable file found in config dir /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config using search string *Termination*32bit*_Bitvector*.epf No suitable settings file found using Termination*32bit*_Bitvector ERROR: UNSUPPORTED PROPERTY Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: IllegalArgumentException: null