./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/array-memsafety/openbsd_cstrstr-alloca-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version f4b24e32 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/array-memsafety/openbsd_cstrstr-alloca-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 991fb09b573d5827d0db553f1ea89a581f5a664ba8b68d6f14a043df738f2f6d --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-14 16:33:51,399 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-14 16:33:51,406 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-14 16:33:51,458 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-14 16:33:51,459 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-14 16:33:51,460 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-14 16:33:51,462 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-14 16:33:51,465 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-14 16:33:51,466 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-14 16:33:51,471 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-14 16:33:51,472 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-14 16:33:51,474 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-14 16:33:51,474 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-14 16:33:51,476 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-14 16:33:51,477 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-14 16:33:51,481 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-14 16:33:51,482 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-14 16:33:51,484 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-14 16:33:51,486 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-14 16:33:51,495 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-14 16:33:51,498 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-14 16:33:51,499 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-14 16:33:51,499 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-14 16:33:51,500 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-14 16:33:51,502 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-14 16:33:51,508 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-14 16:33:51,509 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-14 16:33:51,509 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-14 16:33:51,511 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-14 16:33:51,512 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-14 16:33:51,513 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-14 16:33:51,514 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-14 16:33:51,515 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-14 16:33:51,516 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-14 16:33:51,516 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-14 16:33:51,517 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-14 16:33:51,517 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-14 16:33:51,518 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-14 16:33:51,518 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-14 16:33:51,518 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-14 16:33:51,519 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-14 16:33:51,521 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-14 16:33:51,522 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2022-07-14 16:33:51,555 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-14 16:33:51,556 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-14 16:33:51,556 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-14 16:33:51,557 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-14 16:33:51,558 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-14 16:33:51,558 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-14 16:33:51,559 INFO L138 SettingsManager]: * Use SBE=true [2022-07-14 16:33:51,559 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-07-14 16:33:51,559 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-07-14 16:33:51,560 INFO L138 SettingsManager]: * Use old map elimination=false [2022-07-14 16:33:51,560 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-07-14 16:33:51,560 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-07-14 16:33:51,561 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-07-14 16:33:51,561 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-14 16:33:51,561 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-14 16:33:51,561 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-14 16:33:51,561 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-14 16:33:51,562 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-14 16:33:51,562 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-14 16:33:51,562 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-07-14 16:33:51,562 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-07-14 16:33:51,562 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-07-14 16:33:51,562 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-14 16:33:51,563 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-14 16:33:51,563 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-07-14 16:33:51,563 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-14 16:33:51,563 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-07-14 16:33:51,564 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-14 16:33:51,564 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-14 16:33:51,564 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-14 16:33:51,564 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-14 16:33:51,566 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-07-14 16:33:51,566 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 -> 991fb09b573d5827d0db553f1ea89a581f5a664ba8b68d6f14a043df738f2f6d [2022-07-14 16:33:51,809 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-14 16:33:51,831 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-14 16:33:51,833 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-14 16:33:51,834 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-14 16:33:51,835 INFO L275 PluginConnector]: CDTParser initialized [2022-07-14 16:33:51,836 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-memsafety/openbsd_cstrstr-alloca-2.i [2022-07-14 16:33:51,906 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/592af6510/ec87695907cf48ed8be647b8f0595096/FLAG7a2664d7f [2022-07-14 16:33:52,432 INFO L306 CDTParser]: Found 1 translation units. [2022-07-14 16:33:52,433 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety/openbsd_cstrstr-alloca-2.i [2022-07-14 16:33:52,451 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/592af6510/ec87695907cf48ed8be647b8f0595096/FLAG7a2664d7f [2022-07-14 16:33:52,917 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/592af6510/ec87695907cf48ed8be647b8f0595096 [2022-07-14 16:33:52,919 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-14 16:33:52,921 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-14 16:33:52,922 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-14 16:33:52,922 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-14 16:33:52,924 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-14 16:33:52,925 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 04:33:52" (1/1) ... [2022-07-14 16:33:52,925 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4fccc86c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:33:52, skipping insertion in model container [2022-07-14 16:33:52,925 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 04:33:52" (1/1) ... [2022-07-14 16:33:52,931 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-14 16:33:52,977 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-14 16:33:53,240 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 16:33:53,247 INFO L203 MainTranslator]: Completed pre-run [2022-07-14 16:33:53,315 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 16:33:53,340 INFO L208 MainTranslator]: Completed translation [2022-07-14 16:33:53,340 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:33:53 WrapperNode [2022-07-14 16:33:53,340 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-14 16:33:53,341 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-14 16:33:53,342 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-14 16:33:53,342 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-14 16:33:53,350 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:33:53" (1/1) ... [2022-07-14 16:33:53,362 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:33:53" (1/1) ... [2022-07-14 16:33:53,399 INFO L137 Inliner]: procedures = 119, calls = 23, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 156 [2022-07-14 16:33:53,400 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-14 16:33:53,401 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-14 16:33:53,401 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-14 16:33:53,401 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-14 16:33:53,409 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:33:53" (1/1) ... [2022-07-14 16:33:53,409 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:33:53" (1/1) ... [2022-07-14 16:33:53,427 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:33:53" (1/1) ... [2022-07-14 16:33:53,430 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:33:53" (1/1) ... [2022-07-14 16:33:53,437 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:33:53" (1/1) ... [2022-07-14 16:33:53,455 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:33:53" (1/1) ... [2022-07-14 16:33:53,457 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:33:53" (1/1) ... [2022-07-14 16:33:53,459 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-14 16:33:53,460 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-14 16:33:53,461 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-14 16:33:53,461 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-14 16:33:53,462 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:33:53" (1/1) ... [2022-07-14 16:33:53,482 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 16:33:53,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 16:33:53,546 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 16:33:53,552 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2022-07-14 16:33:53,586 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-14 16:33:53,587 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-14 16:33:53,587 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-14 16:33:53,587 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-14 16:33:53,587 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-14 16:33:53,588 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-14 16:33:53,698 INFO L234 CfgBuilder]: Building ICFG [2022-07-14 16:33:53,699 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-14 16:33:53,958 INFO L275 CfgBuilder]: Performing block encoding [2022-07-14 16:33:53,963 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-14 16:33:53,963 INFO L299 CfgBuilder]: Removed 6 assume(true) statements. [2022-07-14 16:33:53,965 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 04:33:53 BoogieIcfgContainer [2022-07-14 16:33:53,965 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-14 16:33:53,966 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-07-14 16:33:53,966 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-07-14 16:33:53,971 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-07-14 16:33:53,972 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-14 16:33:53,972 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 14.07 04:33:52" (1/3) ... [2022-07-14 16:33:53,973 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1ee4ae4c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.07 04:33:53, skipping insertion in model container [2022-07-14 16:33:53,973 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-14 16:33:53,974 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:33:53" (2/3) ... [2022-07-14 16:33:53,974 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1ee4ae4c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.07 04:33:53, skipping insertion in model container [2022-07-14 16:33:53,974 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-14 16:33:53,974 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 04:33:53" (3/3) ... [2022-07-14 16:33:53,975 INFO L354 chiAutomizerObserver]: Analyzing ICFG openbsd_cstrstr-alloca-2.i [2022-07-14 16:33:54,048 INFO L255 stractBuchiCegarLoop]: Interprodecural is true [2022-07-14 16:33:54,049 INFO L256 stractBuchiCegarLoop]: Hoare is false [2022-07-14 16:33:54,049 INFO L257 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-07-14 16:33:54,049 INFO L258 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-07-14 16:33:54,049 INFO L259 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-07-14 16:33:54,049 INFO L260 stractBuchiCegarLoop]: Difference is false [2022-07-14 16:33:54,050 INFO L261 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-07-14 16:33:54,050 INFO L265 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-07-14 16:33:54,060 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 37 states, 36 states have (on average 1.5277777777777777) internal successors, (55), 36 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 16:33:54,084 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 21 [2022-07-14 16:33:54,085 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 16:33:54,085 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 16:33:54,098 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-07-14 16:33:54,098 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-14 16:33:54,099 INFO L287 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-07-14 16:33:54,099 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 37 states, 36 states have (on average 1.5277777777777777) internal successors, (55), 36 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 16:33:54,105 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 21 [2022-07-14 16:33:54,105 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 16:33:54,105 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 16:33:54,106 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-07-14 16:33:54,106 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-14 16:33:54,112 INFO L752 eck$LassoCheckResult]: Stem: 25#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 9#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet20#1, main_#t~nondet21#1, main_#t~malloc22#1.base, main_#t~malloc22#1.offset, main_#t~malloc23#1.base, main_#t~malloc23#1.offset, main_#t~nondet25#1, main_#t~post24#1, main_~i~0#1, main_#t~nondet27#1, main_#t~post26#1, main_~i~1#1, main_#t~ret28#1.base, main_#t~ret28#1.offset, main_~length1~0#1, main_~length2~0#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;main_~length1~0#1 := main_#t~nondet20#1;havoc main_#t~nondet20#1;main_~length2~0#1 := main_#t~nondet21#1;havoc main_#t~nondet21#1; 31#L555true assume !(main_~length1~0#1 < 1); 28#L555-2true assume !(main_~length2~0#1 < 1); 6#L558-1true call main_#t~malloc22#1.base, main_#t~malloc22#1.offset := #Ultimate.allocOnStack(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc22#1.base, main_#t~malloc22#1.offset;call main_#t~malloc23#1.base, main_#t~malloc23#1.offset := #Ultimate.allocOnStack(main_~length2~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc23#1.base, main_#t~malloc23#1.offset;main_~i~0#1 := 0; 35#L564-3true [2022-07-14 16:33:54,112 INFO L754 eck$LassoCheckResult]: Loop: 35#L564-3true assume !!(main_~i~0#1 < main_~length1~0#1);call write~int(main_#t~nondet25#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet25#1; 23#L564-2true main_#t~post24#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post24#1;havoc main_#t~post24#1; 35#L564-3true [2022-07-14 16:33:54,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 16:33:54,121 INFO L85 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 1 times [2022-07-14 16:33:54,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 16:33:54,130 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814134817] [2022-07-14 16:33:54,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 16:33:54,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 16:33:54,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 16:33:54,235 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 16:33:54,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 16:33:54,281 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 16:33:54,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 16:33:54,284 INFO L85 PathProgramCache]: Analyzing trace with hash 1699, now seen corresponding path program 1 times [2022-07-14 16:33:54,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 16:33:54,285 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186988619] [2022-07-14 16:33:54,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 16:33:54,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 16:33:54,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 16:33:54,307 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 16:33:54,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 16:33:54,327 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 16:33:54,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 16:33:54,332 INFO L85 PathProgramCache]: Analyzing trace with hash 1806935720, now seen corresponding path program 1 times [2022-07-14 16:33:54,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 16:33:54,333 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515353019] [2022-07-14 16:33:54,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 16:33:54,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 16:33:54,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 16:33:54,373 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 16:33:54,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 16:33:54,410 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 16:33:54,770 INFO L210 LassoAnalysis]: Preferences: [2022-07-14 16:33:54,771 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-14 16:33:54,771 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-14 16:33:54,771 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-14 16:33:54,772 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-14 16:33:54,772 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 16:33:54,772 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-14 16:33:54,772 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-14 16:33:54,773 INFO L133 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrstr-alloca-2.i_Iteration1_Lasso [2022-07-14 16:33:54,773 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-14 16:33:54,773 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-14 16:33:54,792 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:33:54,798 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:33:54,805 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:33:54,808 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:33:54,810 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:33:54,812 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:33:54,814 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:33:54,818 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:33:54,821 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:33:54,825 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:33:54,828 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:33:54,831 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:33:54,843 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:33:54,846 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:33:54,848 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:33:54,851 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:33:55,330 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-14 16:33:55,334 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-14 16:33:55,336 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 16:33:55,336 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 16:33:55,338 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 16:33:55,358 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 16:33:55,367 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2022-07-14 16:33:55,368 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 16:33:55,368 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 16:33:55,368 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 16:33:55,369 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 16:33:55,369 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 16:33:55,370 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 16:33:55,371 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 16:33:55,384 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 16:33:55,412 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-14 16:33:55,412 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 16:33:55,412 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 16:33:55,414 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 16:33:55,422 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 16:33:55,430 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 16:33:55,430 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 16:33:55,430 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 16:33:55,430 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 16:33:55,434 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 16:33:55,434 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 16:33:55,438 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2022-07-14 16:33:55,446 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 16:33:55,474 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2022-07-14 16:33:55,475 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 16:33:55,475 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 16:33:55,476 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 16:33:55,477 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2022-07-14 16:33:55,484 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 16:33:55,492 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 16:33:55,492 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 16:33:55,492 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 16:33:55,492 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 16:33:55,492 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 16:33:55,493 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 16:33:55,493 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 16:33:55,502 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 16:33:55,527 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2022-07-14 16:33:55,527 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 16:33:55,527 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 16:33:55,530 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 16:33:55,531 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2022-07-14 16:33:55,536 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 16:33:55,543 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 16:33:55,543 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 16:33:55,544 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 16:33:55,544 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 16:33:55,544 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 16:33:55,544 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 16:33:55,544 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 16:33:55,546 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 16:33:55,562 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2022-07-14 16:33:55,562 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 16:33:55,563 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 16:33:55,564 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 16:33:55,564 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2022-07-14 16:33:55,566 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 16:33:55,572 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 16:33:55,572 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 16:33:55,573 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 16:33:55,573 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 16:33:55,573 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 16:33:55,573 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 16:33:55,573 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 16:33:55,575 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 16:33:55,591 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2022-07-14 16:33:55,592 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 16:33:55,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 16:33:55,593 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 16:33:55,594 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2022-07-14 16:33:55,595 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 16:33:55,601 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 16:33:55,602 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 16:33:55,602 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 16:33:55,602 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 16:33:55,602 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 16:33:55,602 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 16:33:55,603 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 16:33:55,604 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 16:33:55,620 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2022-07-14 16:33:55,620 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 16:33:55,620 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 16:33:55,622 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 16:33:55,623 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2022-07-14 16:33:55,624 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 16:33:55,631 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 16:33:55,631 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 16:33:55,631 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 16:33:55,631 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 16:33:55,634 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 16:33:55,634 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 16:33:55,649 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 16:33:55,676 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2022-07-14 16:33:55,676 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 16:33:55,676 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 16:33:55,678 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 16:33:55,685 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2022-07-14 16:33:55,686 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 16:33:55,693 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 16:33:55,693 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 16:33:55,693 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 16:33:55,693 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 16:33:55,693 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 16:33:55,694 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 16:33:55,694 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 16:33:55,703 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 16:33:55,719 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2022-07-14 16:33:55,720 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 16:33:55,720 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 16:33:55,722 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 16:33:55,722 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2022-07-14 16:33:55,723 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 16:33:55,729 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 16:33:55,730 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 16:33:55,730 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 16:33:55,730 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 16:33:55,733 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 16:33:55,733 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 16:33:55,762 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 16:33:55,786 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2022-07-14 16:33:55,787 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 16:33:55,787 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 16:33:55,788 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 16:33:55,799 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 16:33:55,804 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2022-07-14 16:33:55,807 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 16:33:55,807 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 16:33:55,807 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 16:33:55,807 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 16:33:55,807 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 16:33:55,808 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 16:33:55,808 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 16:33:55,811 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 16:33:55,827 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2022-07-14 16:33:55,828 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 16:33:55,828 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 16:33:55,829 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 16:33:55,832 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2022-07-14 16:33:55,832 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 16:33:55,840 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 16:33:55,840 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 16:33:55,840 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 16:33:55,840 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 16:33:55,842 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 16:33:55,842 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 16:33:55,851 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 16:33:55,868 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2022-07-14 16:33:55,869 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 16:33:55,869 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 16:33:55,870 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 16:33:55,871 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2022-07-14 16:33:55,872 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 16:33:55,878 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 16:33:55,878 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 16:33:55,879 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 16:33:55,879 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 16:33:55,879 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 16:33:55,879 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 16:33:55,879 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 16:33:55,882 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 16:33:55,899 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2022-07-14 16:33:55,899 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 16:33:55,899 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 16:33:55,900 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 16:33:55,901 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2022-07-14 16:33:55,904 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 16:33:55,910 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 16:33:55,911 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 16:33:55,911 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 16:33:55,911 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 16:33:55,913 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 16:33:55,913 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 16:33:55,925 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 16:33:55,941 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-14 16:33:55,941 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 16:33:55,941 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 16:33:55,942 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-14 16:33:55,943 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-14 16:33:55,944 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 16:33:55,951 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 16:33:55,951 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 16:33:55,951 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 16:33:55,951 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 16:33:55,951 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 16:33:55,952 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 16:33:55,952 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 16:33:55,979 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 16:33:56,006 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2022-07-14 16:33:56,006 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 16:33:56,007 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 16:33:56,008 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-14 16:33:56,009 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-14 16:33:56,010 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 16:33:56,018 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 16:33:56,018 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 16:33:56,018 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 16:33:56,018 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 16:33:56,020 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 16:33:56,020 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 16:33:56,043 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 16:33:56,069 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-14 16:33:56,070 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 16:33:56,070 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 16:33:56,071 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 16:33:56,075 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2022-07-14 16:33:56,125 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 16:33:56,131 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 16:33:56,132 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 16:33:56,132 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 16:33:56,132 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 16:33:56,139 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 16:33:56,140 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 16:33:56,151 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-14 16:33:56,204 INFO L443 ModelExtractionUtils]: Simplification made 14 calls to the SMT solver. [2022-07-14 16:33:56,204 INFO L444 ModelExtractionUtils]: 6 out of 22 variables were initially zero. Simplification set additionally 13 variables to zero. [2022-07-14 16:33:56,206 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 16:33:56,206 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 16:33:56,253 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 16:33:56,254 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2022-07-14 16:33:56,268 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-14 16:33:56,289 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-07-14 16:33:56,289 INFO L513 LassoAnalysis]: Proved termination. [2022-07-14 16:33:56,290 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~length1~0#1, ULTIMATE.start_main_~i~0#1) = 1*ULTIMATE.start_main_~length1~0#1 - 1*ULTIMATE.start_main_~i~0#1 Supporting invariants [] [2022-07-14 16:33:56,315 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2022-07-14 16:33:56,334 INFO L293 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2022-07-14 16:33:56,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 16:33:56,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 16:33:56,391 INFO L263 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-14 16:33:56,392 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 16:33:56,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 16:33:56,413 INFO L263 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-14 16:33:56,414 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 16:33:56,425 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 16:33:56,452 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2022-07-14 16:33:56,453 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 37 states, 36 states have (on average 1.5277777777777777) internal successors, (55), 36 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) 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-14 16:33:56,527 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 37 states, 36 states have (on average 1.5277777777777777) internal successors, (55), 36 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0). 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 99 states and 145 transitions. Complement of second has 7 states. [2022-07-14 16:33:56,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2022-07-14 16:33:56,535 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-14 16:33:56,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 99 transitions. [2022-07-14 16:33:56,539 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 99 transitions. Stem has 5 letters. Loop has 2 letters. [2022-07-14 16:33:56,539 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-14 16:33:56,539 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 99 transitions. Stem has 7 letters. Loop has 2 letters. [2022-07-14 16:33:56,540 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-14 16:33:56,540 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 99 transitions. Stem has 5 letters. Loop has 4 letters. [2022-07-14 16:33:56,540 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-14 16:33:56,541 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 99 states and 145 transitions. [2022-07-14 16:33:56,554 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 19 [2022-07-14 16:33:56,557 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 99 states to 32 states and 43 transitions. [2022-07-14 16:33:56,558 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2022-07-14 16:33:56,558 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2022-07-14 16:33:56,559 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 43 transitions. [2022-07-14 16:33:56,559 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-14 16:33:56,560 INFO L369 hiAutomatonCegarLoop]: Abstraction has 32 states and 43 transitions. [2022-07-14 16:33:56,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states and 43 transitions. [2022-07-14 16:33:56,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-07-14 16:33:56,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 32 states have (on average 1.34375) internal successors, (43), 31 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 16:33:56,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 43 transitions. [2022-07-14 16:33:56,584 INFO L392 hiAutomatonCegarLoop]: Abstraction has 32 states and 43 transitions. [2022-07-14 16:33:56,584 INFO L374 stractBuchiCegarLoop]: Abstraction has 32 states and 43 transitions. [2022-07-14 16:33:56,584 INFO L287 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-07-14 16:33:56,584 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 43 transitions. [2022-07-14 16:33:56,585 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 19 [2022-07-14 16:33:56,586 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 16:33:56,586 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 16:33:56,586 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-14 16:33:56,588 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-14 16:33:56,588 INFO L752 eck$LassoCheckResult]: Stem: 236#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 220#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet20#1, main_#t~nondet21#1, main_#t~malloc22#1.base, main_#t~malloc22#1.offset, main_#t~malloc23#1.base, main_#t~malloc23#1.offset, main_#t~nondet25#1, main_#t~post24#1, main_~i~0#1, main_#t~nondet27#1, main_#t~post26#1, main_~i~1#1, main_#t~ret28#1.base, main_#t~ret28#1.offset, main_~length1~0#1, main_~length2~0#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;main_~length1~0#1 := main_#t~nondet20#1;havoc main_#t~nondet20#1;main_~length2~0#1 := main_#t~nondet21#1;havoc main_#t~nondet21#1; 221#L555 assume !(main_~length1~0#1 < 1); 238#L555-2 assume !(main_~length2~0#1 < 1); 216#L558-1 call main_#t~malloc22#1.base, main_#t~malloc22#1.offset := #Ultimate.allocOnStack(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc22#1.base, main_#t~malloc22#1.offset;call main_#t~malloc23#1.base, main_#t~malloc23#1.offset := #Ultimate.allocOnStack(main_~length2~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc23#1.base, main_#t~malloc23#1.offset;main_~i~0#1 := 0; 217#L564-3 assume !(main_~i~0#1 < main_~length1~0#1); 237#L564-4 main_~i~1#1 := 0; 229#L568-3 [2022-07-14 16:33:56,589 INFO L754 eck$LassoCheckResult]: Loop: 229#L568-3 assume !!(main_~i~1#1 < main_~length2~0#1);call write~int(main_#t~nondet27#1, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet27#1; 231#L568-2 main_#t~post26#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post26#1;havoc main_#t~post26#1; 229#L568-3 [2022-07-14 16:33:56,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 16:33:56,590 INFO L85 PathProgramCache]: Analyzing trace with hash 1806935662, now seen corresponding path program 1 times [2022-07-14 16:33:56,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 16:33:56,590 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613404135] [2022-07-14 16:33:56,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 16:33:56,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 16:33:56,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 16:33:56,672 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 16:33:56,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 16:33:56,672 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613404135] [2022-07-14 16:33:56,674 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [613404135] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 16:33:56,674 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 16:33:56,674 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-14 16:33:56,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301751148] [2022-07-14 16:33:56,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 16:33:56,679 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-14 16:33:56,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 16:33:56,680 INFO L85 PathProgramCache]: Analyzing trace with hash 2147, now seen corresponding path program 1 times [2022-07-14 16:33:56,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 16:33:56,680 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754352214] [2022-07-14 16:33:56,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 16:33:56,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 16:33:56,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 16:33:56,695 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 16:33:56,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 16:33:56,700 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 16:33:56,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 16:33:56,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 16:33:56,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-14 16:33:56,744 INFO L87 Difference]: Start difference. First operand 32 states and 43 transitions. cyclomatic complexity: 15 Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 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-14 16:33:56,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 16:33:56,770 INFO L93 Difference]: Finished difference Result 33 states and 43 transitions. [2022-07-14 16:33:56,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-14 16:33:56,771 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 43 transitions. [2022-07-14 16:33:56,772 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 19 [2022-07-14 16:33:56,772 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 33 states and 43 transitions. [2022-07-14 16:33:56,772 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2022-07-14 16:33:56,773 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2022-07-14 16:33:56,773 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 43 transitions. [2022-07-14 16:33:56,773 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-14 16:33:56,773 INFO L369 hiAutomatonCegarLoop]: Abstraction has 33 states and 43 transitions. [2022-07-14 16:33:56,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 43 transitions. [2022-07-14 16:33:56,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2022-07-14 16:33:56,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 32 states have (on average 1.3125) internal successors, (42), 31 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 16:33:56,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 42 transitions. [2022-07-14 16:33:56,776 INFO L392 hiAutomatonCegarLoop]: Abstraction has 32 states and 42 transitions. [2022-07-14 16:33:56,776 INFO L374 stractBuchiCegarLoop]: Abstraction has 32 states and 42 transitions. [2022-07-14 16:33:56,776 INFO L287 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-07-14 16:33:56,776 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 42 transitions. [2022-07-14 16:33:56,776 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 19 [2022-07-14 16:33:56,776 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 16:33:56,776 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 16:33:56,777 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 16:33:56,777 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-14 16:33:56,777 INFO L752 eck$LassoCheckResult]: Stem: 308#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 292#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet20#1, main_#t~nondet21#1, main_#t~malloc22#1.base, main_#t~malloc22#1.offset, main_#t~malloc23#1.base, main_#t~malloc23#1.offset, main_#t~nondet25#1, main_#t~post24#1, main_~i~0#1, main_#t~nondet27#1, main_#t~post26#1, main_~i~1#1, main_#t~ret28#1.base, main_#t~ret28#1.offset, main_~length1~0#1, main_~length2~0#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;main_~length1~0#1 := main_#t~nondet20#1;havoc main_#t~nondet20#1;main_~length2~0#1 := main_#t~nondet21#1;havoc main_#t~nondet21#1; 293#L555 assume !(main_~length1~0#1 < 1); 310#L555-2 assume !(main_~length2~0#1 < 1); 288#L558-1 call main_#t~malloc22#1.base, main_#t~malloc22#1.offset := #Ultimate.allocOnStack(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc22#1.base, main_#t~malloc22#1.offset;call main_#t~malloc23#1.base, main_#t~malloc23#1.offset := #Ultimate.allocOnStack(main_~length2~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc23#1.base, main_#t~malloc23#1.offset;main_~i~0#1 := 0; 289#L564-3 assume !!(main_~i~0#1 < main_~length1~0#1);call write~int(main_#t~nondet25#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet25#1; 305#L564-2 main_#t~post24#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post24#1;havoc main_#t~post24#1; 306#L564-3 assume !(main_~i~0#1 < main_~length1~0#1); 309#L564-4 main_~i~1#1 := 0; 300#L568-3 [2022-07-14 16:33:56,777 INFO L754 eck$LassoCheckResult]: Loop: 300#L568-3 assume !!(main_~i~1#1 < main_~length2~0#1);call write~int(main_#t~nondet27#1, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet27#1; 302#L568-2 main_#t~post26#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post26#1;havoc main_#t~post26#1; 300#L568-3 [2022-07-14 16:33:56,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 16:33:56,777 INFO L85 PathProgramCache]: Analyzing trace with hash 1298440016, now seen corresponding path program 1 times [2022-07-14 16:33:56,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 16:33:56,778 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070955688] [2022-07-14 16:33:56,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 16:33:56,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 16:33:56,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 16:33:56,817 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 16:33:56,825 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2022-07-14 16:33:56,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 16:33:56,834 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 16:33:56,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 16:33:56,835 INFO L85 PathProgramCache]: Analyzing trace with hash 2147, now seen corresponding path program 2 times [2022-07-14 16:33:56,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 16:33:56,835 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289942367] [2022-07-14 16:33:56,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 16:33:56,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 16:33:56,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 16:33:56,847 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 16:33:56,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 16:33:56,851 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 16:33:56,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 16:33:56,852 INFO L85 PathProgramCache]: Analyzing trace with hash -2034626574, now seen corresponding path program 1 times [2022-07-14 16:33:56,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 16:33:56,852 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125620559] [2022-07-14 16:33:56,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 16:33:56,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 16:33:56,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 16:33:56,873 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 16:33:56,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 16:33:56,888 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 16:33:57,226 INFO L210 LassoAnalysis]: Preferences: [2022-07-14 16:33:57,226 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-14 16:33:57,226 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-14 16:33:57,226 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-14 16:33:57,226 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-14 16:33:57,226 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 16:33:57,226 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-14 16:33:57,226 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-14 16:33:57,227 INFO L133 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrstr-alloca-2.i_Iteration3_Lasso [2022-07-14 16:33:57,227 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-14 16:33:57,227 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-14 16:33:57,231 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:33:57,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-14 16:33:57,236 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:33:57,239 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:33:57,472 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:33:57,474 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:33:57,476 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:33:57,478 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:33:57,480 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:33:57,494 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:33:57,496 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:33:57,498 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:33:57,500 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:33:57,502 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:33:57,763 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-14 16:33:57,763 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-14 16:33:57,764 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 16:33:57,764 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 16:33:57,775 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 16:33:57,778 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2022-07-14 16:33:57,779 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 16:33:57,786 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 16:33:57,786 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 16:33:57,787 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 16:33:57,787 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 16:33:57,787 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 16:33:57,790 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 16:33:57,790 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 16:33:57,796 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 16:33:57,814 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2022-07-14 16:33:57,814 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 16:33:57,814 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 16:33:57,815 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 16:33:57,821 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2022-07-14 16:33:57,822 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 16:33:57,829 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 16:33:57,829 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 16:33:57,829 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 16:33:57,829 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 16:33:57,829 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 16:33:57,829 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 16:33:57,829 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 16:33:57,830 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 16:33:57,846 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2022-07-14 16:33:57,847 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 16:33:57,847 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 16:33:57,848 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 16:33:57,849 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2022-07-14 16:33:57,850 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 16:33:57,856 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 16:33:57,856 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 16:33:57,857 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 16:33:57,857 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 16:33:57,859 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 16:33:57,859 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 16:33:57,883 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 16:33:57,908 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2022-07-14 16:33:57,908 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 16:33:57,908 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 16:33:57,910 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 16:33:57,916 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 16:33:57,923 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 16:33:57,924 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 16:33:57,924 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 16:33:57,924 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 16:33:57,924 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 16:33:57,924 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 16:33:57,925 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 16:33:57,926 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2022-07-14 16:33:57,939 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 16:33:57,965 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2022-07-14 16:33:57,966 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 16:33:57,966 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 16:33:57,967 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 16:33:57,972 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 16:33:57,979 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2022-07-14 16:33:57,980 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 16:33:57,980 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 16:33:57,980 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 16:33:57,980 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 16:33:57,984 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 16:33:57,984 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 16:33:58,003 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 16:33:58,019 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2022-07-14 16:33:58,019 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 16:33:58,019 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 16:33:58,020 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 16:33:58,021 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2022-07-14 16:33:58,023 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 16:33:58,029 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 16:33:58,029 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 16:33:58,029 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 16:33:58,030 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 16:33:58,033 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 16:33:58,033 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 16:33:58,046 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 16:33:58,072 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2022-07-14 16:33:58,072 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 16:33:58,073 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 16:33:58,074 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 16:33:58,080 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 16:33:58,087 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 16:33:58,088 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 16:33:58,088 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 16:33:58,088 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 16:33:58,088 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2022-07-14 16:33:58,095 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 16:33:58,096 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 16:33:58,127 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-14 16:33:58,164 INFO L443 ModelExtractionUtils]: Simplification made 18 calls to the SMT solver. [2022-07-14 16:33:58,164 INFO L444 ModelExtractionUtils]: 8 out of 37 variables were initially zero. Simplification set additionally 26 variables to zero. [2022-07-14 16:33:58,164 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 16:33:58,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 16:33:58,167 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 16:33:58,170 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2022-07-14 16:33:58,172 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-14 16:33:58,188 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-07-14 16:33:58,188 INFO L513 LassoAnalysis]: Proved termination. [2022-07-14 16:33:58,188 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~1#1, ULTIMATE.start_main_~length2~0#1) = -1*ULTIMATE.start_main_~i~1#1 + 1*ULTIMATE.start_main_~length2~0#1 Supporting invariants [] [2022-07-14 16:33:58,212 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Ended with exit code 0 [2022-07-14 16:33:58,236 INFO L293 tatePredicateManager]: 9 out of 9 supporting invariants were superfluous and have been removed [2022-07-14 16:33:58,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 16:33:58,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 16:33:58,267 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-14 16:33:58,267 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 16:33:58,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 16:33:58,283 INFO L263 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-14 16:33:58,284 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 16:33:58,295 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 16:33:58,296 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2022-07-14 16:33:58,296 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 32 states and 42 transitions. cyclomatic complexity: 14 Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 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-14 16:33:58,313 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 32 states and 42 transitions. cyclomatic complexity: 14. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 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 55 states and 75 transitions. Complement of second has 6 states. [2022-07-14 16:33:58,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2022-07-14 16:33:58,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 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-14 16:33:58,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 41 transitions. [2022-07-14 16:33:58,314 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 41 transitions. Stem has 9 letters. Loop has 2 letters. [2022-07-14 16:33:58,314 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-14 16:33:58,314 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 41 transitions. Stem has 11 letters. Loop has 2 letters. [2022-07-14 16:33:58,315 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-14 16:33:58,315 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 41 transitions. Stem has 9 letters. Loop has 4 letters. [2022-07-14 16:33:58,315 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-14 16:33:58,315 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 55 states and 75 transitions. [2022-07-14 16:33:58,316 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2022-07-14 16:33:58,316 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 55 states to 33 states and 44 transitions. [2022-07-14 16:33:58,316 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2022-07-14 16:33:58,317 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2022-07-14 16:33:58,317 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 44 transitions. [2022-07-14 16:33:58,317 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-14 16:33:58,317 INFO L369 hiAutomatonCegarLoop]: Abstraction has 33 states and 44 transitions. [2022-07-14 16:33:58,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 44 transitions. [2022-07-14 16:33:58,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2022-07-14 16:33:58,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 33 states have (on average 1.3333333333333333) internal successors, (44), 32 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 16:33:58,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 44 transitions. [2022-07-14 16:33:58,319 INFO L392 hiAutomatonCegarLoop]: Abstraction has 33 states and 44 transitions. [2022-07-14 16:33:58,319 INFO L374 stractBuchiCegarLoop]: Abstraction has 33 states and 44 transitions. [2022-07-14 16:33:58,319 INFO L287 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2022-07-14 16:33:58,320 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 44 transitions. [2022-07-14 16:33:58,320 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2022-07-14 16:33:58,320 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 16:33:58,320 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 16:33:58,320 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 16:33:58,321 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-07-14 16:33:58,321 INFO L752 eck$LassoCheckResult]: Stem: 488#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 471#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet20#1, main_#t~nondet21#1, main_#t~malloc22#1.base, main_#t~malloc22#1.offset, main_#t~malloc23#1.base, main_#t~malloc23#1.offset, main_#t~nondet25#1, main_#t~post24#1, main_~i~0#1, main_#t~nondet27#1, main_#t~post26#1, main_~i~1#1, main_#t~ret28#1.base, main_#t~ret28#1.offset, main_~length1~0#1, main_~length2~0#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;main_~length1~0#1 := main_#t~nondet20#1;havoc main_#t~nondet20#1;main_~length2~0#1 := main_#t~nondet21#1;havoc main_#t~nondet21#1; 472#L555 assume !(main_~length1~0#1 < 1); 490#L555-2 assume !(main_~length2~0#1 < 1); 465#L558-1 call main_#t~malloc22#1.base, main_#t~malloc22#1.offset := #Ultimate.allocOnStack(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc22#1.base, main_#t~malloc22#1.offset;call main_#t~malloc23#1.base, main_#t~malloc23#1.offset := #Ultimate.allocOnStack(main_~length2~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc23#1.base, main_#t~malloc23#1.offset;main_~i~0#1 := 0; 466#L564-3 assume !!(main_~i~0#1 < main_~length1~0#1);call write~int(main_#t~nondet25#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet25#1; 485#L564-2 main_#t~post24#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post24#1;havoc main_#t~post24#1; 486#L564-3 assume !(main_~i~0#1 < main_~length1~0#1); 489#L564-4 main_~i~1#1 := 0; 479#L568-3 assume !(main_~i~1#1 < main_~length2~0#1); 480#L568-4 call write~int(0, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~length1~0#1 - 1), 1);call write~int(0, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + (main_~length2~0#1 - 1), 1);assume { :begin_inline_cstrstr } true;cstrstr_#in~s#1.base, cstrstr_#in~s#1.offset, cstrstr_#in~find#1.base, cstrstr_#in~find#1.offset := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc cstrstr_#res#1.base, cstrstr_#res#1.offset;havoc cstrstr_#t~post13#1.base, cstrstr_#t~post13#1.offset, cstrstr_#t~mem14#1, cstrstr_#t~ret15#1, cstrstr_#t~post17#1.base, cstrstr_#t~post17#1.offset, cstrstr_#t~mem18#1, cstrstr_#t~ret16#1, cstrstr_#t~post19#1.base, cstrstr_#t~post19#1.offset, cstrstr_~s#1.base, cstrstr_~s#1.offset, cstrstr_~find#1.base, cstrstr_~find#1.offset, cstrstr_~c~0#1, cstrstr_~sc~0#1, cstrstr_~len~0#1;cstrstr_~s#1.base, cstrstr_~s#1.offset := cstrstr_#in~s#1.base, cstrstr_#in~s#1.offset;cstrstr_~find#1.base, cstrstr_~find#1.offset := cstrstr_#in~find#1.base, cstrstr_#in~find#1.offset;havoc cstrstr_~c~0#1;havoc cstrstr_~sc~0#1;havoc cstrstr_~len~0#1;cstrstr_#t~post13#1.base, cstrstr_#t~post13#1.offset := cstrstr_~find#1.base, cstrstr_~find#1.offset;cstrstr_~find#1.base, cstrstr_~find#1.offset := cstrstr_#t~post13#1.base, 1 + cstrstr_#t~post13#1.offset;call cstrstr_#t~mem14#1 := read~int(cstrstr_#t~post13#1.base, cstrstr_#t~post13#1.offset, 1);cstrstr_~c~0#1 := cstrstr_#t~mem14#1; 487#L540 assume 0 != cstrstr_~c~0#1;havoc cstrstr_#t~post13#1.base, cstrstr_#t~post13#1.offset;havoc cstrstr_#t~mem14#1;assume { :begin_inline_cstrlen } true;cstrlen_#in~str#1.base, cstrlen_#in~str#1.offset := cstrstr_~find#1.base, cstrstr_~find#1.offset;havoc cstrlen_#res#1;havoc cstrlen_#t~pre2#1.base, cstrlen_#t~pre2#1.offset, cstrlen_#t~mem3#1, cstrlen_~str#1.base, cstrlen_~str#1.offset, cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset;cstrlen_~str#1.base, cstrlen_~str#1.offset := cstrlen_#in~str#1.base, cstrlen_#in~str#1.offset;havoc cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset;cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset := cstrlen_~str#1.base, cstrlen_~str#1.offset; 477#L518-4 [2022-07-14 16:33:58,321 INFO L754 eck$LassoCheckResult]: Loop: 477#L518-4 call cstrlen_#t~mem3#1 := read~int(cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset, 1); 478#L518-1 assume !!(0 != cstrlen_#t~mem3#1);havoc cstrlen_#t~mem3#1; 491#L518-3 cstrlen_#t~pre2#1.base, cstrlen_#t~pre2#1.offset := cstrlen_~s~0#1.base, 1 + cstrlen_~s~0#1.offset;cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset := cstrlen_~s~0#1.base, 1 + cstrlen_~s~0#1.offset;havoc cstrlen_#t~pre2#1.base, cstrlen_#t~pre2#1.offset; 477#L518-4 [2022-07-14 16:33:58,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 16:33:58,321 INFO L85 PathProgramCache]: Analyzing trace with hash 1351083894, now seen corresponding path program 1 times [2022-07-14 16:33:58,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 16:33:58,322 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109807199] [2022-07-14 16:33:58,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 16:33:58,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 16:33:58,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 16:33:58,397 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-14 16:33:58,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 16:33:58,397 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109807199] [2022-07-14 16:33:58,397 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [109807199] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 16:33:58,398 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 16:33:58,398 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-14 16:33:58,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651882061] [2022-07-14 16:33:58,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 16:33:58,398 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-14 16:33:58,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 16:33:58,398 INFO L85 PathProgramCache]: Analyzing trace with hash 79603, now seen corresponding path program 1 times [2022-07-14 16:33:58,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 16:33:58,399 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529191394] [2022-07-14 16:33:58,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 16:33:58,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 16:33:58,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 16:33:58,404 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 16:33:58,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 16:33:58,407 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 16:33:58,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 16:33:58,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-14 16:33:58,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-07-14 16:33:58,435 INFO L87 Difference]: Start difference. First operand 33 states and 44 transitions. cyclomatic complexity: 15 Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 16:33:58,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 16:33:58,453 INFO L93 Difference]: Finished difference Result 34 states and 44 transitions. [2022-07-14 16:33:58,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-14 16:33:58,460 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 44 transitions. [2022-07-14 16:33:58,460 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2022-07-14 16:33:58,461 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 34 states and 44 transitions. [2022-07-14 16:33:58,461 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2022-07-14 16:33:58,461 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2022-07-14 16:33:58,461 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 44 transitions. [2022-07-14 16:33:58,461 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-14 16:33:58,461 INFO L369 hiAutomatonCegarLoop]: Abstraction has 34 states and 44 transitions. [2022-07-14 16:33:58,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 44 transitions. [2022-07-14 16:33:58,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2022-07-14 16:33:58,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 33 states have (on average 1.303030303030303) internal successors, (43), 32 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 16:33:58,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 43 transitions. [2022-07-14 16:33:58,464 INFO L392 hiAutomatonCegarLoop]: Abstraction has 33 states and 43 transitions. [2022-07-14 16:33:58,464 INFO L374 stractBuchiCegarLoop]: Abstraction has 33 states and 43 transitions. [2022-07-14 16:33:58,464 INFO L287 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2022-07-14 16:33:58,464 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 43 transitions. [2022-07-14 16:33:58,464 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2022-07-14 16:33:58,464 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 16:33:58,464 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 16:33:58,465 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 16:33:58,465 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-07-14 16:33:58,465 INFO L752 eck$LassoCheckResult]: Stem: 563#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 546#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet20#1, main_#t~nondet21#1, main_#t~malloc22#1.base, main_#t~malloc22#1.offset, main_#t~malloc23#1.base, main_#t~malloc23#1.offset, main_#t~nondet25#1, main_#t~post24#1, main_~i~0#1, main_#t~nondet27#1, main_#t~post26#1, main_~i~1#1, main_#t~ret28#1.base, main_#t~ret28#1.offset, main_~length1~0#1, main_~length2~0#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;main_~length1~0#1 := main_#t~nondet20#1;havoc main_#t~nondet20#1;main_~length2~0#1 := main_#t~nondet21#1;havoc main_#t~nondet21#1; 547#L555 assume !(main_~length1~0#1 < 1); 565#L555-2 assume !(main_~length2~0#1 < 1); 542#L558-1 call main_#t~malloc22#1.base, main_#t~malloc22#1.offset := #Ultimate.allocOnStack(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc22#1.base, main_#t~malloc22#1.offset;call main_#t~malloc23#1.base, main_#t~malloc23#1.offset := #Ultimate.allocOnStack(main_~length2~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc23#1.base, main_#t~malloc23#1.offset;main_~i~0#1 := 0; 543#L564-3 assume !!(main_~i~0#1 < main_~length1~0#1);call write~int(main_#t~nondet25#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet25#1; 560#L564-2 main_#t~post24#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post24#1;havoc main_#t~post24#1; 561#L564-3 assume !(main_~i~0#1 < main_~length1~0#1); 564#L564-4 main_~i~1#1 := 0; 555#L568-3 assume !!(main_~i~1#1 < main_~length2~0#1);call write~int(main_#t~nondet27#1, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet27#1; 556#L568-2 main_#t~post26#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post26#1;havoc main_#t~post26#1; 557#L568-3 assume !(main_~i~1#1 < main_~length2~0#1); 558#L568-4 call write~int(0, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~length1~0#1 - 1), 1);call write~int(0, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + (main_~length2~0#1 - 1), 1);assume { :begin_inline_cstrstr } true;cstrstr_#in~s#1.base, cstrstr_#in~s#1.offset, cstrstr_#in~find#1.base, cstrstr_#in~find#1.offset := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc cstrstr_#res#1.base, cstrstr_#res#1.offset;havoc cstrstr_#t~post13#1.base, cstrstr_#t~post13#1.offset, cstrstr_#t~mem14#1, cstrstr_#t~ret15#1, cstrstr_#t~post17#1.base, cstrstr_#t~post17#1.offset, cstrstr_#t~mem18#1, cstrstr_#t~ret16#1, cstrstr_#t~post19#1.base, cstrstr_#t~post19#1.offset, cstrstr_~s#1.base, cstrstr_~s#1.offset, cstrstr_~find#1.base, cstrstr_~find#1.offset, cstrstr_~c~0#1, cstrstr_~sc~0#1, cstrstr_~len~0#1;cstrstr_~s#1.base, cstrstr_~s#1.offset := cstrstr_#in~s#1.base, cstrstr_#in~s#1.offset;cstrstr_~find#1.base, cstrstr_~find#1.offset := cstrstr_#in~find#1.base, cstrstr_#in~find#1.offset;havoc cstrstr_~c~0#1;havoc cstrstr_~sc~0#1;havoc cstrstr_~len~0#1;cstrstr_#t~post13#1.base, cstrstr_#t~post13#1.offset := cstrstr_~find#1.base, cstrstr_~find#1.offset;cstrstr_~find#1.base, cstrstr_~find#1.offset := cstrstr_#t~post13#1.base, 1 + cstrstr_#t~post13#1.offset;call cstrstr_#t~mem14#1 := read~int(cstrstr_#t~post13#1.base, cstrstr_#t~post13#1.offset, 1);cstrstr_~c~0#1 := cstrstr_#t~mem14#1; 562#L540 assume 0 != cstrstr_~c~0#1;havoc cstrstr_#t~post13#1.base, cstrstr_#t~post13#1.offset;havoc cstrstr_#t~mem14#1;assume { :begin_inline_cstrlen } true;cstrlen_#in~str#1.base, cstrlen_#in~str#1.offset := cstrstr_~find#1.base, cstrstr_~find#1.offset;havoc cstrlen_#res#1;havoc cstrlen_#t~pre2#1.base, cstrlen_#t~pre2#1.offset, cstrlen_#t~mem3#1, cstrlen_~str#1.base, cstrlen_~str#1.offset, cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset;cstrlen_~str#1.base, cstrlen_~str#1.offset := cstrlen_#in~str#1.base, cstrlen_#in~str#1.offset;havoc cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset;cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset := cstrlen_~str#1.base, cstrlen_~str#1.offset; 552#L518-4 [2022-07-14 16:33:58,465 INFO L754 eck$LassoCheckResult]: Loop: 552#L518-4 call cstrlen_#t~mem3#1 := read~int(cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset, 1); 553#L518-1 assume !!(0 != cstrlen_#t~mem3#1);havoc cstrlen_#t~mem3#1; 566#L518-3 cstrlen_#t~pre2#1.base, cstrlen_#t~pre2#1.offset := cstrlen_~s~0#1.base, 1 + cstrlen_~s~0#1.offset;cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset := cstrlen_~s~0#1.base, 1 + cstrlen_~s~0#1.offset;havoc cstrlen_#t~pre2#1.base, cstrlen_#t~pre2#1.offset; 552#L518-4 [2022-07-14 16:33:58,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 16:33:58,465 INFO L85 PathProgramCache]: Analyzing trace with hash 1313217428, now seen corresponding path program 1 times [2022-07-14 16:33:58,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 16:33:58,466 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126554376] [2022-07-14 16:33:58,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 16:33:58,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 16:33:58,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 16:33:58,626 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Ended with exit code 0 [2022-07-14 16:33:58,673 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-14 16:33:58,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 16:33:58,673 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126554376] [2022-07-14 16:33:58,673 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1126554376] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 16:33:58,673 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [399604064] [2022-07-14 16:33:58,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 16:33:58,674 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 16:33:58,674 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 16:33:58,676 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 16:33:58,700 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2022-07-14 16:33:58,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 16:33:58,751 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 24 conjunts are in the unsatisfiable core [2022-07-14 16:33:58,753 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 16:33:58,913 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 32 [2022-07-14 16:33:58,919 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 16:33:58,928 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 16:33:58,939 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-14 16:33:58,940 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 16:33:58,967 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 32 [2022-07-14 16:33:58,979 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 22 [2022-07-14 16:33:58,986 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 23 [2022-07-14 16:33:59,160 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-14 16:33:59,160 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [399604064] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 16:33:59,160 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 16:33:59,160 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 15 [2022-07-14 16:33:59,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566697291] [2022-07-14 16:33:59,161 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 16:33:59,161 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-14 16:33:59,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 16:33:59,161 INFO L85 PathProgramCache]: Analyzing trace with hash 79603, now seen corresponding path program 2 times [2022-07-14 16:33:59,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 16:33:59,162 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803559615] [2022-07-14 16:33:59,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 16:33:59,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 16:33:59,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 16:33:59,167 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 16:33:59,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 16:33:59,175 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 16:33:59,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 16:33:59,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-07-14 16:33:59,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=164, Unknown=0, NotChecked=0, Total=240 [2022-07-14 16:33:59,204 INFO L87 Difference]: Start difference. First operand 33 states and 43 transitions. cyclomatic complexity: 14 Second operand has 16 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 16 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 16:33:59,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 16:33:59,368 INFO L93 Difference]: Finished difference Result 38 states and 48 transitions. [2022-07-14 16:33:59,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-14 16:33:59,369 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 48 transitions. [2022-07-14 16:33:59,369 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2022-07-14 16:33:59,370 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 36 states and 46 transitions. [2022-07-14 16:33:59,370 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2022-07-14 16:33:59,370 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2022-07-14 16:33:59,370 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 46 transitions. [2022-07-14 16:33:59,370 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-14 16:33:59,370 INFO L369 hiAutomatonCegarLoop]: Abstraction has 36 states and 46 transitions. [2022-07-14 16:33:59,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states and 46 transitions. [2022-07-14 16:33:59,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2022-07-14 16:33:59,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 35 states have (on average 1.2857142857142858) internal successors, (45), 34 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 16:33:59,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 45 transitions. [2022-07-14 16:33:59,373 INFO L392 hiAutomatonCegarLoop]: Abstraction has 35 states and 45 transitions. [2022-07-14 16:33:59,373 INFO L374 stractBuchiCegarLoop]: Abstraction has 35 states and 45 transitions. [2022-07-14 16:33:59,373 INFO L287 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2022-07-14 16:33:59,373 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 45 transitions. [2022-07-14 16:33:59,373 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2022-07-14 16:33:59,373 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 16:33:59,373 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 16:33:59,374 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 16:33:59,374 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-07-14 16:33:59,374 INFO L752 eck$LassoCheckResult]: Stem: 742#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 724#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet20#1, main_#t~nondet21#1, main_#t~malloc22#1.base, main_#t~malloc22#1.offset, main_#t~malloc23#1.base, main_#t~malloc23#1.offset, main_#t~nondet25#1, main_#t~post24#1, main_~i~0#1, main_#t~nondet27#1, main_#t~post26#1, main_~i~1#1, main_#t~ret28#1.base, main_#t~ret28#1.offset, main_~length1~0#1, main_~length2~0#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;main_~length1~0#1 := main_#t~nondet20#1;havoc main_#t~nondet20#1;main_~length2~0#1 := main_#t~nondet21#1;havoc main_#t~nondet21#1; 725#L555 assume !(main_~length1~0#1 < 1); 744#L555-2 assume !(main_~length2~0#1 < 1); 718#L558-1 call main_#t~malloc22#1.base, main_#t~malloc22#1.offset := #Ultimate.allocOnStack(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc22#1.base, main_#t~malloc22#1.offset;call main_#t~malloc23#1.base, main_#t~malloc23#1.offset := #Ultimate.allocOnStack(main_~length2~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc23#1.base, main_#t~malloc23#1.offset;main_~i~0#1 := 0; 719#L564-3 assume !!(main_~i~0#1 < main_~length1~0#1);call write~int(main_#t~nondet25#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet25#1; 738#L564-2 main_#t~post24#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post24#1;havoc main_#t~post24#1; 739#L564-3 assume !(main_~i~0#1 < main_~length1~0#1); 743#L564-4 main_~i~1#1 := 0; 732#L568-3 assume !!(main_~i~1#1 < main_~length2~0#1);call write~int(main_#t~nondet27#1, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet27#1; 733#L568-2 main_#t~post26#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post26#1;havoc main_#t~post26#1; 734#L568-3 assume !!(main_~i~1#1 < main_~length2~0#1);call write~int(main_#t~nondet27#1, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet27#1; 735#L568-2 main_#t~post26#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post26#1;havoc main_#t~post26#1; 746#L568-3 assume !(main_~i~1#1 < main_~length2~0#1); 740#L568-4 call write~int(0, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~length1~0#1 - 1), 1);call write~int(0, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + (main_~length2~0#1 - 1), 1);assume { :begin_inline_cstrstr } true;cstrstr_#in~s#1.base, cstrstr_#in~s#1.offset, cstrstr_#in~find#1.base, cstrstr_#in~find#1.offset := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc cstrstr_#res#1.base, cstrstr_#res#1.offset;havoc cstrstr_#t~post13#1.base, cstrstr_#t~post13#1.offset, cstrstr_#t~mem14#1, cstrstr_#t~ret15#1, cstrstr_#t~post17#1.base, cstrstr_#t~post17#1.offset, cstrstr_#t~mem18#1, cstrstr_#t~ret16#1, cstrstr_#t~post19#1.base, cstrstr_#t~post19#1.offset, cstrstr_~s#1.base, cstrstr_~s#1.offset, cstrstr_~find#1.base, cstrstr_~find#1.offset, cstrstr_~c~0#1, cstrstr_~sc~0#1, cstrstr_~len~0#1;cstrstr_~s#1.base, cstrstr_~s#1.offset := cstrstr_#in~s#1.base, cstrstr_#in~s#1.offset;cstrstr_~find#1.base, cstrstr_~find#1.offset := cstrstr_#in~find#1.base, cstrstr_#in~find#1.offset;havoc cstrstr_~c~0#1;havoc cstrstr_~sc~0#1;havoc cstrstr_~len~0#1;cstrstr_#t~post13#1.base, cstrstr_#t~post13#1.offset := cstrstr_~find#1.base, cstrstr_~find#1.offset;cstrstr_~find#1.base, cstrstr_~find#1.offset := cstrstr_#t~post13#1.base, 1 + cstrstr_#t~post13#1.offset;call cstrstr_#t~mem14#1 := read~int(cstrstr_#t~post13#1.base, cstrstr_#t~post13#1.offset, 1);cstrstr_~c~0#1 := cstrstr_#t~mem14#1; 741#L540 assume 0 != cstrstr_~c~0#1;havoc cstrstr_#t~post13#1.base, cstrstr_#t~post13#1.offset;havoc cstrstr_#t~mem14#1;assume { :begin_inline_cstrlen } true;cstrlen_#in~str#1.base, cstrlen_#in~str#1.offset := cstrstr_~find#1.base, cstrstr_~find#1.offset;havoc cstrlen_#res#1;havoc cstrlen_#t~pre2#1.base, cstrlen_#t~pre2#1.offset, cstrlen_#t~mem3#1, cstrlen_~str#1.base, cstrlen_~str#1.offset, cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset;cstrlen_~str#1.base, cstrlen_~str#1.offset := cstrlen_#in~str#1.base, cstrlen_#in~str#1.offset;havoc cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset;cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset := cstrlen_~str#1.base, cstrlen_~str#1.offset; 730#L518-4 [2022-07-14 16:33:59,374 INFO L754 eck$LassoCheckResult]: Loop: 730#L518-4 call cstrlen_#t~mem3#1 := read~int(cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset, 1); 731#L518-1 assume !!(0 != cstrlen_#t~mem3#1);havoc cstrlen_#t~mem3#1; 745#L518-3 cstrlen_#t~pre2#1.base, cstrlen_#t~pre2#1.offset := cstrlen_~s~0#1.base, 1 + cstrlen_~s~0#1.offset;cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset := cstrlen_~s~0#1.base, 1 + cstrlen_~s~0#1.offset;havoc cstrlen_#t~pre2#1.base, cstrlen_#t~pre2#1.offset; 730#L518-4 [2022-07-14 16:33:59,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 16:33:59,375 INFO L85 PathProgramCache]: Analyzing trace with hash -716718030, now seen corresponding path program 2 times [2022-07-14 16:33:59,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 16:33:59,375 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523539632] [2022-07-14 16:33:59,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 16:33:59,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 16:33:59,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 16:33:59,394 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 16:33:59,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 16:33:59,413 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 16:33:59,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 16:33:59,413 INFO L85 PathProgramCache]: Analyzing trace with hash 79603, now seen corresponding path program 3 times [2022-07-14 16:33:59,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 16:33:59,414 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631683940] [2022-07-14 16:33:59,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 16:33:59,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 16:33:59,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 16:33:59,424 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 16:33:59,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 16:33:59,429 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 16:33:59,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 16:33:59,431 INFO L85 PathProgramCache]: Analyzing trace with hash -1464353502, now seen corresponding path program 1 times [2022-07-14 16:33:59,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 16:33:59,432 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752860467] [2022-07-14 16:33:59,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 16:33:59,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 16:33:59,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 16:33:59,638 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-14 16:33:59,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 16:33:59,638 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752860467] [2022-07-14 16:33:59,638 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [752860467] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 16:33:59,638 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [818244014] [2022-07-14 16:33:59,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 16:33:59,639 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 16:33:59,639 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 16:33:59,640 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 16:33:59,664 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2022-07-14 16:33:59,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 16:33:59,720 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 41 conjunts are in the unsatisfiable core [2022-07-14 16:33:59,723 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 16:33:59,862 INFO L356 Elim1Store]: treesize reduction 32, result has 37.3 percent of original size [2022-07-14 16:33:59,863 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 80 [2022-07-14 16:33:59,871 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 0 case distinctions, treesize of input 11 treesize of output 10 [2022-07-14 16:33:59,880 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 0 case distinctions, treesize of input 11 treesize of output 10 [2022-07-14 16:34:00,109 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 8 [2022-07-14 16:34:00,113 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 3 [2022-07-14 16:34:00,162 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 16:34:00,163 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 16:34:00,164 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 10 [2022-07-14 16:34:00,167 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-14 16:34:00,167 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 16:34:00,204 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 36 [2022-07-14 16:34:00,210 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 26 [2022-07-14 16:34:00,216 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 27 [2022-07-14 16:34:00,400 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-14 16:34:00,401 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [818244014] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 16:34:00,401 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 16:34:00,401 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 24 [2022-07-14 16:34:00,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237439810] [2022-07-14 16:34:00,401 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 16:34:00,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 16:34:00,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-07-14 16:34:00,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=459, Unknown=0, NotChecked=0, Total=552 [2022-07-14 16:34:00,438 INFO L87 Difference]: Start difference. First operand 35 states and 45 transitions. cyclomatic complexity: 14 Second operand has 24 states, 24 states have (on average 1.6666666666666667) internal successors, (40), 24 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 16:34:00,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 16:34:00,851 INFO L93 Difference]: Finished difference Result 58 states and 74 transitions. [2022-07-14 16:34:00,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-14 16:34:00,852 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 58 states and 74 transitions. [2022-07-14 16:34:00,852 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 31 [2022-07-14 16:34:00,853 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 58 states to 58 states and 74 transitions. [2022-07-14 16:34:00,853 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 49 [2022-07-14 16:34:00,853 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 49 [2022-07-14 16:34:00,853 INFO L73 IsDeterministic]: Start isDeterministic. Operand 58 states and 74 transitions. [2022-07-14 16:34:00,854 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-14 16:34:00,854 INFO L369 hiAutomatonCegarLoop]: Abstraction has 58 states and 74 transitions. [2022-07-14 16:34:00,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states and 74 transitions. [2022-07-14 16:34:00,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 41. [2022-07-14 16:34:00,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 41 states have (on average 1.2682926829268293) internal successors, (52), 40 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 16:34:00,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 52 transitions. [2022-07-14 16:34:00,857 INFO L392 hiAutomatonCegarLoop]: Abstraction has 41 states and 52 transitions. [2022-07-14 16:34:00,857 INFO L374 stractBuchiCegarLoop]: Abstraction has 41 states and 52 transitions. [2022-07-14 16:34:00,857 INFO L287 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2022-07-14 16:34:00,857 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 41 states and 52 transitions. [2022-07-14 16:34:00,857 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2022-07-14 16:34:00,858 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 16:34:00,858 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 16:34:00,858 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 16:34:00,858 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-07-14 16:34:00,859 INFO L752 eck$LassoCheckResult]: Stem: 992#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 974#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet20#1, main_#t~nondet21#1, main_#t~malloc22#1.base, main_#t~malloc22#1.offset, main_#t~malloc23#1.base, main_#t~malloc23#1.offset, main_#t~nondet25#1, main_#t~post24#1, main_~i~0#1, main_#t~nondet27#1, main_#t~post26#1, main_~i~1#1, main_#t~ret28#1.base, main_#t~ret28#1.offset, main_~length1~0#1, main_~length2~0#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;main_~length1~0#1 := main_#t~nondet20#1;havoc main_#t~nondet20#1;main_~length2~0#1 := main_#t~nondet21#1;havoc main_#t~nondet21#1; 975#L555 assume !(main_~length1~0#1 < 1); 994#L555-2 assume !(main_~length2~0#1 < 1); 970#L558-1 call main_#t~malloc22#1.base, main_#t~malloc22#1.offset := #Ultimate.allocOnStack(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc22#1.base, main_#t~malloc22#1.offset;call main_#t~malloc23#1.base, main_#t~malloc23#1.offset := #Ultimate.allocOnStack(main_~length2~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc23#1.base, main_#t~malloc23#1.offset;main_~i~0#1 := 0; 971#L564-3 assume !!(main_~i~0#1 < main_~length1~0#1);call write~int(main_#t~nondet25#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet25#1; 989#L564-2 main_#t~post24#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post24#1;havoc main_#t~post24#1; 990#L564-3 assume !(main_~i~0#1 < main_~length1~0#1); 993#L564-4 main_~i~1#1 := 0; 982#L568-3 assume !!(main_~i~1#1 < main_~length2~0#1);call write~int(main_#t~nondet27#1, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet27#1; 983#L568-2 main_#t~post26#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post26#1;havoc main_#t~post26#1; 1002#L568-3 assume !!(main_~i~1#1 < main_~length2~0#1);call write~int(main_#t~nondet27#1, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet27#1; 1001#L568-2 main_#t~post26#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post26#1;havoc main_#t~post26#1; 1000#L568-3 assume !!(main_~i~1#1 < main_~length2~0#1);call write~int(main_#t~nondet27#1, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet27#1; 986#L568-2 main_#t~post26#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post26#1;havoc main_#t~post26#1; 984#L568-3 assume !(main_~i~1#1 < main_~length2~0#1); 985#L568-4 call write~int(0, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~length1~0#1 - 1), 1);call write~int(0, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + (main_~length2~0#1 - 1), 1);assume { :begin_inline_cstrstr } true;cstrstr_#in~s#1.base, cstrstr_#in~s#1.offset, cstrstr_#in~find#1.base, cstrstr_#in~find#1.offset := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc cstrstr_#res#1.base, cstrstr_#res#1.offset;havoc cstrstr_#t~post13#1.base, cstrstr_#t~post13#1.offset, cstrstr_#t~mem14#1, cstrstr_#t~ret15#1, cstrstr_#t~post17#1.base, cstrstr_#t~post17#1.offset, cstrstr_#t~mem18#1, cstrstr_#t~ret16#1, cstrstr_#t~post19#1.base, cstrstr_#t~post19#1.offset, cstrstr_~s#1.base, cstrstr_~s#1.offset, cstrstr_~find#1.base, cstrstr_~find#1.offset, cstrstr_~c~0#1, cstrstr_~sc~0#1, cstrstr_~len~0#1;cstrstr_~s#1.base, cstrstr_~s#1.offset := cstrstr_#in~s#1.base, cstrstr_#in~s#1.offset;cstrstr_~find#1.base, cstrstr_~find#1.offset := cstrstr_#in~find#1.base, cstrstr_#in~find#1.offset;havoc cstrstr_~c~0#1;havoc cstrstr_~sc~0#1;havoc cstrstr_~len~0#1;cstrstr_#t~post13#1.base, cstrstr_#t~post13#1.offset := cstrstr_~find#1.base, cstrstr_~find#1.offset;cstrstr_~find#1.base, cstrstr_~find#1.offset := cstrstr_#t~post13#1.base, 1 + cstrstr_#t~post13#1.offset;call cstrstr_#t~mem14#1 := read~int(cstrstr_#t~post13#1.base, cstrstr_#t~post13#1.offset, 1);cstrstr_~c~0#1 := cstrstr_#t~mem14#1; 991#L540 assume 0 != cstrstr_~c~0#1;havoc cstrstr_#t~post13#1.base, cstrstr_#t~post13#1.offset;havoc cstrstr_#t~mem14#1;assume { :begin_inline_cstrlen } true;cstrlen_#in~str#1.base, cstrlen_#in~str#1.offset := cstrstr_~find#1.base, cstrstr_~find#1.offset;havoc cstrlen_#res#1;havoc cstrlen_#t~pre2#1.base, cstrlen_#t~pre2#1.offset, cstrlen_#t~mem3#1, cstrlen_~str#1.base, cstrlen_~str#1.offset, cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset;cstrlen_~str#1.base, cstrlen_~str#1.offset := cstrlen_#in~str#1.base, cstrlen_#in~str#1.offset;havoc cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset;cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset := cstrlen_~str#1.base, cstrlen_~str#1.offset; 980#L518-4 [2022-07-14 16:34:00,859 INFO L754 eck$LassoCheckResult]: Loop: 980#L518-4 call cstrlen_#t~mem3#1 := read~int(cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset, 1); 981#L518-1 assume !!(0 != cstrlen_#t~mem3#1);havoc cstrlen_#t~mem3#1; 995#L518-3 cstrlen_#t~pre2#1.base, cstrlen_#t~pre2#1.offset := cstrlen_~s~0#1.base, 1 + cstrlen_~s~0#1.offset;cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset := cstrlen_~s~0#1.base, 1 + cstrlen_~s~0#1.offset;havoc cstrlen_#t~pre2#1.base, cstrlen_#t~pre2#1.offset; 980#L518-4 [2022-07-14 16:34:00,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 16:34:00,859 INFO L85 PathProgramCache]: Analyzing trace with hash -1569540784, now seen corresponding path program 3 times [2022-07-14 16:34:00,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 16:34:00,860 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042580717] [2022-07-14 16:34:00,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 16:34:00,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 16:34:00,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 16:34:00,876 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 16:34:00,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 16:34:00,891 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 16:34:00,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 16:34:00,892 INFO L85 PathProgramCache]: Analyzing trace with hash 79603, now seen corresponding path program 4 times [2022-07-14 16:34:00,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 16:34:00,892 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537681600] [2022-07-14 16:34:00,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 16:34:00,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 16:34:00,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 16:34:00,895 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 16:34:00,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 16:34:00,898 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 16:34:00,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 16:34:00,899 INFO L85 PathProgramCache]: Analyzing trace with hash 1119505220, now seen corresponding path program 2 times [2022-07-14 16:34:00,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 16:34:00,899 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554030955] [2022-07-14 16:34:00,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 16:34:00,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 16:34:00,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 16:34:00,918 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 16:34:00,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 16:34:00,935 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 16:34:02,790 INFO L210 LassoAnalysis]: Preferences: [2022-07-14 16:34:02,790 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-14 16:34:02,790 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-14 16:34:02,790 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-14 16:34:02,790 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-14 16:34:02,791 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 16:34:02,791 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-14 16:34:02,791 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-14 16:34:02,791 INFO L133 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrstr-alloca-2.i_Iteration7_Lasso [2022-07-14 16:34:02,791 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-14 16:34:02,791 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-14 16:34:02,794 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:34:02,800 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:34:02,802 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:34:02,804 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:34:02,806 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:34:02,809 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:34:02,811 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:34:02,814 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:34:02,816 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:34:02,819 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:34:02,821 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:34:02,823 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:34:02,825 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:34:02,827 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:34:02,830 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:34:02,832 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:34:02,834 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:34:02,838 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:34:02,840 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:34:02,843 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:34:02,845 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:34:02,848 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:34:02,850 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:34:02,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-14 16:34:02,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-14 16:34:02,858 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:34:02,860 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:34:02,862 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:34:03,597 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-14 16:34:03,600 INFO L158 Benchmark]: Toolchain (without parser) took 10679.42ms. Allocated memory was 90.2MB in the beginning and 134.2MB in the end (delta: 44.0MB). Free memory was 59.2MB in the beginning and 83.6MB in the end (delta: -24.4MB). Peak memory consumption was 70.5MB. Max. memory is 16.1GB. [2022-07-14 16:34:03,600 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 90.2MB. Free memory was 43.0MB in the beginning and 43.0MB in the end (delta: 48.0kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-14 16:34:03,601 INFO L158 Benchmark]: CACSL2BoogieTranslator took 419.08ms. Allocated memory was 90.2MB in the beginning and 111.1MB in the end (delta: 21.0MB). Free memory was 58.9MB in the beginning and 80.0MB in the end (delta: -21.1MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-07-14 16:34:03,601 INFO L158 Benchmark]: Boogie Procedure Inliner took 58.61ms. Allocated memory is still 111.1MB. Free memory was 80.0MB in the beginning and 78.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-14 16:34:03,601 INFO L158 Benchmark]: Boogie Preprocessor took 58.95ms. Allocated memory is still 111.1MB. Free memory was 78.0MB in the beginning and 76.3MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-14 16:34:03,602 INFO L158 Benchmark]: RCFGBuilder took 504.52ms. Allocated memory is still 111.1MB. Free memory was 76.3MB in the beginning and 62.0MB in the end (delta: 14.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-07-14 16:34:03,602 INFO L158 Benchmark]: BuchiAutomizer took 9633.80ms. Allocated memory was 111.1MB in the beginning and 134.2MB in the end (delta: 23.1MB). Free memory was 61.6MB in the beginning and 83.6MB in the end (delta: -22.0MB). Peak memory consumption was 53.9MB. Max. memory is 16.1GB. [2022-07-14 16:34:03,604 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.20ms. Allocated memory is still 90.2MB. Free memory was 43.0MB in the beginning and 43.0MB in the end (delta: 48.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 419.08ms. Allocated memory was 90.2MB in the beginning and 111.1MB in the end (delta: 21.0MB). Free memory was 58.9MB in the beginning and 80.0MB in the end (delta: -21.1MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 58.61ms. Allocated memory is still 111.1MB. Free memory was 80.0MB in the beginning and 78.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 58.95ms. Allocated memory is still 111.1MB. Free memory was 78.0MB in the beginning and 76.3MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 504.52ms. Allocated memory is still 111.1MB. Free memory was 76.3MB in the beginning and 62.0MB in the end (delta: 14.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * BuchiAutomizer took 9633.80ms. Allocated memory was 111.1MB in the beginning and 134.2MB in the end (delta: 23.1MB). Free memory was 61.6MB in the beginning and 83.6MB in the end (delta: -22.0MB). Peak memory consumption was 53.9MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: IllegalArgumentException: null de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: IllegalArgumentException: null: de.uni_freiburg.informatik.ultimate.util.datastructures.ScopedHashMap.put(ScopedHashMap.java:331) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-07-14 16:34:03,643 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2022-07-14 16:34:03,857 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2022-07-14 16:34:04,057 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