./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/loops/invert_string-3.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/loops/invert_string-3.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ca98535e808a51f7cfa7d21c9d33f259821212a6554e27f29c2bddd9197c0249 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-21 03:57:53,563 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-21 03:57:53,564 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-21 03:57:53,586 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-21 03:57:53,586 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-21 03:57:53,587 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-21 03:57:53,588 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-21 03:57:53,589 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-21 03:57:53,591 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-21 03:57:53,591 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-21 03:57:53,592 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-21 03:57:53,593 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-21 03:57:53,593 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-21 03:57:53,594 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-21 03:57:53,595 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-21 03:57:53,596 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-21 03:57:53,596 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-21 03:57:53,597 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-21 03:57:53,598 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-21 03:57:53,599 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-21 03:57:53,600 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-21 03:57:53,616 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-21 03:57:53,618 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-21 03:57:53,619 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-21 03:57:53,631 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-21 03:57:53,631 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-21 03:57:53,631 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-21 03:57:53,633 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-21 03:57:53,633 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-21 03:57:53,634 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-21 03:57:53,634 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-21 03:57:53,635 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-21 03:57:53,636 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-21 03:57:53,637 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-21 03:57:53,638 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-21 03:57:53,638 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-21 03:57:53,639 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-21 03:57:53,639 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-21 03:57:53,639 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-21 03:57:53,640 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-21 03:57:53,640 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-21 03:57:53,642 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2022-02-21 03:57:53,667 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-21 03:57:53,669 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-21 03:57:53,669 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-21 03:57:53,670 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-21 03:57:53,671 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-21 03:57:53,671 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-21 03:57:53,671 INFO L138 SettingsManager]: * Use SBE=true [2022-02-21 03:57:53,672 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-02-21 03:57:53,672 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-02-21 03:57:53,672 INFO L138 SettingsManager]: * Use old map elimination=false [2022-02-21 03:57:53,673 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-02-21 03:57:53,673 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-02-21 03:57:53,673 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-02-21 03:57:53,673 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-21 03:57:53,673 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-21 03:57:53,673 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-21 03:57:53,674 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-21 03:57:53,674 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-21 03:57:53,674 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-21 03:57:53,674 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-02-21 03:57:53,674 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-02-21 03:57:53,674 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-02-21 03:57:53,674 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-21 03:57:53,675 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-21 03:57:53,675 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-02-21 03:57:53,675 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-21 03:57:53,675 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-02-21 03:57:53,675 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-21 03:57:53,675 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-21 03:57:53,676 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-21 03:57:53,676 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-21 03:57:53,676 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-02-21 03:57:53,677 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 -> ca98535e808a51f7cfa7d21c9d33f259821212a6554e27f29c2bddd9197c0249 [2022-02-21 03:57:53,850 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-21 03:57:53,867 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-21 03:57:53,869 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-21 03:57:53,870 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-21 03:57:53,871 INFO L275 PluginConnector]: CDTParser initialized [2022-02-21 03:57:53,871 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loops/invert_string-3.c [2022-02-21 03:57:53,945 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c65e5f36c/ed07378a66c948a799cc10fa5b9f0036/FLAG0784a7d60 [2022-02-21 03:57:54,357 INFO L306 CDTParser]: Found 1 translation units. [2022-02-21 03:57:54,358 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops/invert_string-3.c [2022-02-21 03:57:54,362 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c65e5f36c/ed07378a66c948a799cc10fa5b9f0036/FLAG0784a7d60 [2022-02-21 03:57:54,376 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c65e5f36c/ed07378a66c948a799cc10fa5b9f0036 [2022-02-21 03:57:54,379 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-21 03:57:54,381 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-21 03:57:54,384 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-21 03:57:54,384 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-21 03:57:54,386 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-21 03:57:54,390 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:57:54" (1/1) ... [2022-02-21 03:57:54,391 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@406557fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:57:54, skipping insertion in model container [2022-02-21 03:57:54,391 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:57:54" (1/1) ... [2022-02-21 03:57:54,396 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-21 03:57:54,405 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-21 03:57:54,529 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops/invert_string-3.c[327,340] [2022-02-21 03:57:54,551 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:57:54,575 INFO L203 MainTranslator]: Completed pre-run [2022-02-21 03:57:54,582 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops/invert_string-3.c[327,340] [2022-02-21 03:57:54,605 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:57:54,614 INFO L208 MainTranslator]: Completed translation [2022-02-21 03:57:54,614 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:57:54 WrapperNode [2022-02-21 03:57:54,614 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-21 03:57:54,618 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-21 03:57:54,619 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-21 03:57:54,619 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-21 03:57:54,634 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:57:54" (1/1) ... [2022-02-21 03:57:54,651 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:57:54" (1/1) ... [2022-02-21 03:57:54,703 INFO L137 Inliner]: procedures = 14, calls = 18, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 68 [2022-02-21 03:57:54,704 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-21 03:57:54,715 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-21 03:57:54,716 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-21 03:57:54,716 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-21 03:57:54,725 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:57:54" (1/1) ... [2022-02-21 03:57:54,725 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:57:54" (1/1) ... [2022-02-21 03:57:54,734 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:57:54" (1/1) ... [2022-02-21 03:57:54,734 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:57:54" (1/1) ... [2022-02-21 03:57:54,738 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:57:54" (1/1) ... [2022-02-21 03:57:54,740 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:57:54" (1/1) ... [2022-02-21 03:57:54,741 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:57:54" (1/1) ... [2022-02-21 03:57:54,742 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-21 03:57:54,744 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-21 03:57:54,744 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-21 03:57:54,744 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-21 03:57:54,746 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:57:54" (1/1) ... [2022-02-21 03:57:54,751 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:57:54,758 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:57:54,768 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-02-21 03:57:54,774 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-02-21 03:57:54,801 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-21 03:57:54,801 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-21 03:57:54,801 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-21 03:57:54,801 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-21 03:57:54,801 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-21 03:57:54,801 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-21 03:57:54,801 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-21 03:57:54,801 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-21 03:57:54,850 INFO L234 CfgBuilder]: Building ICFG [2022-02-21 03:57:54,851 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-21 03:57:55,012 INFO L275 CfgBuilder]: Performing block encoding [2022-02-21 03:57:55,016 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-21 03:57:55,016 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-02-21 03:57:55,017 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:57:55 BoogieIcfgContainer [2022-02-21 03:57:55,017 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-21 03:57:55,018 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-02-21 03:57:55,018 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-02-21 03:57:55,020 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-02-21 03:57:55,020 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:57:55,021 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 21.02 03:57:54" (1/3) ... [2022-02-21 03:57:55,021 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@526ac498 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 03:57:55, skipping insertion in model container [2022-02-21 03:57:55,021 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:57:55,022 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:57:54" (2/3) ... [2022-02-21 03:57:55,022 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@526ac498 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 03:57:55, skipping insertion in model container [2022-02-21 03:57:55,022 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:57:55,022 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:57:55" (3/3) ... [2022-02-21 03:57:55,023 INFO L388 chiAutomizerObserver]: Analyzing ICFG invert_string-3.c [2022-02-21 03:57:55,054 INFO L359 BuchiCegarLoop]: Interprodecural is true [2022-02-21 03:57:55,054 INFO L360 BuchiCegarLoop]: Hoare is false [2022-02-21 03:57:55,054 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-02-21 03:57:55,054 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-02-21 03:57:55,054 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-02-21 03:57:55,054 INFO L364 BuchiCegarLoop]: Difference is false [2022-02-21 03:57:55,055 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-02-21 03:57:55,055 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2022-02-21 03:57:55,082 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 17 states, 16 states have (on average 1.4375) internal successors, (23), 16 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:57:55,131 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2022-02-21 03:57:55,132 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:57:55,132 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:57:55,135 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2022-02-21 03:57:55,136 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2022-02-21 03:57:55,136 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2022-02-21 03:57:55,137 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 17 states, 16 states have (on average 1.4375) internal successors, (23), 16 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:57:55,139 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2022-02-21 03:57:55,139 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:57:55,139 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:57:55,140 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2022-02-21 03:57:55,140 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2022-02-21 03:57:55,144 INFO L791 eck$LassoCheckResult]: Stem: 4#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); 6#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~post4#1, main_#t~mem7#1, main_#t~post8#1, main_#t~post6#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~post12#1, main_#t~post9#1, main_~max~0#1, main_~#str1~0#1.base, main_~#str1~0#1.offset, main_~#str2~0#1.base, main_~#str2~0#1.offset, main_~i~0#1, main_~j~0#1;main_~max~0#1 := 5;call main_~#str1~0#1.base, main_~#str1~0#1.offset := #Ultimate.allocOnStack((if main_~max~0#1 % 4294967296 % 4294967296 <= 2147483647 then main_~max~0#1 % 4294967296 % 4294967296 else main_~max~0#1 % 4294967296 % 4294967296 - 4294967296));call main_~#str2~0#1.base, main_~#str2~0#1.offset := #Ultimate.allocOnStack((if main_~max~0#1 % 4294967296 % 4294967296 <= 2147483647 then main_~max~0#1 % 4294967296 % 4294967296 else main_~max~0#1 % 4294967296 % 4294967296 - 4294967296));havoc main_~i~0#1;havoc main_~j~0#1;main_~i~0#1 := 0; 15#L18-3true [2022-02-21 03:57:55,145 INFO L793 eck$LassoCheckResult]: Loop: 15#L18-3true assume !!(main_~i~0#1 % 4294967296 < main_~max~0#1 % 4294967296);call write~int(main_#t~nondet5#1, main_~#str1~0#1.base, main_~#str1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; 10#L18-2true main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 15#L18-3true [2022-02-21 03:57:55,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:57:55,149 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2022-02-21 03:57:55,165 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:57:55,166 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318278792] [2022-02-21 03:57:55,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:57:55,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:57:55,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:57:55,290 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:57:55,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:57:55,331 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:57:55,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:57:55,333 INFO L85 PathProgramCache]: Analyzing trace with hash 1283, now seen corresponding path program 1 times [2022-02-21 03:57:55,334 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:57:55,334 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142598165] [2022-02-21 03:57:55,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:57:55,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:57:55,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:57:55,369 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:57:55,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:57:55,389 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:57:55,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:57:55,392 INFO L85 PathProgramCache]: Analyzing trace with hash 925765, now seen corresponding path program 1 times [2022-02-21 03:57:55,392 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:57:55,393 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505399161] [2022-02-21 03:57:55,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:57:55,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:57:55,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:57:55,443 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:57:55,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:57:55,478 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:57:55,891 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:57:55,891 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:57:55,892 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:57:55,892 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:57:55,892 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:57:55,893 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:57:55,893 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:57:55,893 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:57:55,893 INFO L133 ssoRankerPreferences]: Filename of dumped script: invert_string-3.c_Iteration1_Lasso [2022-02-21 03:57:55,893 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:57:55,893 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:57:55,910 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:57:55,915 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:57:55,918 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:57:55,920 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:57:55,923 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:57:55,927 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:57:55,930 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:57:55,932 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:57:55,935 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:57:55,938 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:57:56,190 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:57:56,193 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:57:56,195 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:57:56,198 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:57:56,665 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:57:56,669 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:57:56,670 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:57:56,671 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:57:56,672 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-02-21 03:57:56,679 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-02-21 03:57:56,681 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-02-21 03:57:56,687 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:57:56,688 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:57:56,688 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:57:56,688 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:57:56,688 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:57:56,691 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:57:56,691 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:57:56,703 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:57:56,724 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-02-21 03:57:56,725 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:57:56,725 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:57:56,727 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-02-21 03:57:56,728 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-02-21 03:57:56,730 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-02-21 03:57:56,735 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:57:56,735 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:57:56,735 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:57:56,735 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:57:56,735 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:57:56,737 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:57:56,737 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:57:56,763 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:57:56,780 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-02-21 03:57:56,780 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:57:56,781 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:57:56,782 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-02-21 03:57:56,792 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-02-21 03:57:56,796 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-02-21 03:57:56,801 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:57:56,802 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:57:56,802 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:57:56,802 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:57:56,802 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:57:56,806 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:57:56,806 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:57:56,822 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:57:56,837 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-02-21 03:57:56,838 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:57:56,838 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:57:56,839 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-02-21 03:57:56,840 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-02-21 03:57:56,855 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:57:56,866 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:57:56,867 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:57:56,867 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:57:56,867 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:57:56,867 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:57:56,868 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:57:56,868 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:57:56,869 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:57:56,884 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-02-21 03:57:56,891 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:57:56,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:57:56,908 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-02-21 03:57:56,917 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-02-21 03:57:56,932 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-02-21 03:57:56,937 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:57:56,937 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:57:56,937 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:57:56,937 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:57:56,939 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:57:56,939 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:57:56,948 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:57:56,963 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-02-21 03:57:56,963 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:57:56,963 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:57:56,964 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-02-21 03:57:56,965 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-02-21 03:57:56,966 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-02-21 03:57:56,971 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:57:56,972 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:57:56,972 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:57:56,972 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:57:56,974 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:57:56,974 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:57:56,990 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:57:57,005 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2022-02-21 03:57:57,005 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:57:57,006 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:57:57,008 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-02-21 03:57:57,009 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-02-21 03:57:57,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-02-21 03:57:57,015 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:57:57,015 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:57:57,015 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:57:57,015 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:57:57,016 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:57:57,016 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:57:57,016 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:57:57,017 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:57:57,032 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-02-21 03:57:57,032 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:57:57,033 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:57:57,034 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-02-21 03:57:57,035 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-02-21 03:57:57,036 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-02-21 03:57:57,041 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:57:57,041 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:57:57,041 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:57:57,041 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:57:57,041 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:57:57,042 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:57:57,042 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:57:57,042 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:57:57,058 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-02-21 03:57:57,059 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:57:57,059 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:57:57,060 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-02-21 03:57:57,061 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-02-21 03:57:57,062 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-02-21 03:57:57,067 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:57:57,067 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:57:57,067 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:57:57,067 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:57:57,067 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:57:57,068 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:57:57,068 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:57:57,083 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:57:57,100 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2022-02-21 03:57:57,101 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:57:57,101 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:57:57,102 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-02-21 03:57:57,103 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-02-21 03:57:57,104 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-02-21 03:57:57,110 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:57:57,110 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:57:57,110 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:57:57,110 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:57:57,130 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:57:57,130 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:57:57,133 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:57:57,163 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2022-02-21 03:57:57,163 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:57:57,163 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:57:57,164 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-02-21 03:57:57,165 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-02-21 03:57:57,166 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-02-21 03:57:57,171 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:57:57,172 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:57:57,172 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:57:57,172 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:57:57,173 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:57:57,173 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:57:57,190 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:57:57,207 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2022-02-21 03:57:57,208 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:57:57,208 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:57:57,209 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-02-21 03:57:57,210 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-02-21 03:57:57,211 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-02-21 03:57:57,216 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:57:57,216 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:57:57,216 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:57:57,216 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:57:57,223 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:57:57,223 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:57:57,239 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:57:57,258 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2022-02-21 03:57:57,258 INFO L444 ModelExtractionUtils]: 12 out of 19 variables were initially zero. Simplification set additionally 3 variables to zero. [2022-02-21 03:57:57,260 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:57:57,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:57:57,265 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-02-21 03:57:57,266 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-02-21 03:57:57,319 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:57:57,337 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-02-21 03:57:57,337 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:57:57,338 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1, ULTIMATE.start_main_~#str1~0#1.offset, v_rep(select #length ULTIMATE.start_main_~#str1~0#1.base)_1) = -1*ULTIMATE.start_main_~i~0#1 - 1*ULTIMATE.start_main_~#str1~0#1.offset + 1*v_rep(select #length ULTIMATE.start_main_~#str1~0#1.base)_1 Supporting invariants [] [2022-02-21 03:57:57,377 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-02-21 03:57:57,425 INFO L297 tatePredicateManager]: 10 out of 10 supporting invariants were superfluous and have been removed [2022-02-21 03:57:57,429 INFO L390 LassoCheck]: Loop: "assume !!(main_~i~0#1 % 4294967296 < main_~max~0#1 % 4294967296);call write~int(main_#t~nondet5#1, main_~#str1~0#1.base, main_~#str1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1;" "main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" [2022-02-21 03:57:57,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:57:57,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:57:57,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:57:57,478 INFO L263 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 03:57:57,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:57:57,494 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:57:57,503 INFO L290 TraceCheckUtils]: 0: Hoare triple {27#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {27#unseeded} is VALID [2022-02-21 03:57:57,504 INFO L290 TraceCheckUtils]: 1: Hoare triple {27#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~post4#1, main_#t~mem7#1, main_#t~post8#1, main_#t~post6#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~post12#1, main_#t~post9#1, main_~max~0#1, main_~#str1~0#1.base, main_~#str1~0#1.offset, main_~#str2~0#1.base, main_~#str2~0#1.offset, main_~i~0#1, main_~j~0#1;main_~max~0#1 := 5;call main_~#str1~0#1.base, main_~#str1~0#1.offset := #Ultimate.allocOnStack((if main_~max~0#1 % 4294967296 % 4294967296 <= 2147483647 then main_~max~0#1 % 4294967296 % 4294967296 else main_~max~0#1 % 4294967296 % 4294967296 - 4294967296));call main_~#str2~0#1.base, main_~#str2~0#1.offset := #Ultimate.allocOnStack((if main_~max~0#1 % 4294967296 % 4294967296 <= 2147483647 then main_~max~0#1 % 4294967296 % 4294967296 else main_~max~0#1 % 4294967296 % 4294967296 - 4294967296));havoc main_~i~0#1;havoc main_~j~0#1;main_~i~0#1 := 0; {27#unseeded} is VALID [2022-02-21 03:57:57,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:57:57,517 INFO L263 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 03:57:57,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:57:57,522 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:57:57,549 INFO L290 TraceCheckUtils]: 0: Hoare triple {30#(>= oldRank0 (+ (* (- 1) |ULTIMATE.start_main_~#str1~0#1.offset|) (* (- 1) |ULTIMATE.start_main_~i~0#1|) (select |#length| |ULTIMATE.start_main_~#str1~0#1.base|)))} assume !!(main_~i~0#1 % 4294967296 < main_~max~0#1 % 4294967296);call write~int(main_#t~nondet5#1, main_~#str1~0#1.base, main_~#str1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; {98#(and (<= (+ |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~#str1~0#1.offset| 1) (select |#length| |ULTIMATE.start_main_~#str1~0#1.base|)) (>= oldRank0 (+ (* (- 1) |ULTIMATE.start_main_~#str1~0#1.offset|) (* (- 1) |ULTIMATE.start_main_~i~0#1|) (select |#length| |ULTIMATE.start_main_~#str1~0#1.base|))))} is VALID [2022-02-21 03:57:57,550 INFO L290 TraceCheckUtils]: 1: Hoare triple {98#(and (<= (+ |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~#str1~0#1.offset| 1) (select |#length| |ULTIMATE.start_main_~#str1~0#1.base|)) (>= oldRank0 (+ (* (- 1) |ULTIMATE.start_main_~#str1~0#1.offset|) (* (- 1) |ULTIMATE.start_main_~i~0#1|) (select |#length| |ULTIMATE.start_main_~#str1~0#1.base|))))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {90#(or (and (>= oldRank0 0) (> oldRank0 (+ (* (- 1) |ULTIMATE.start_main_~#str1~0#1.offset|) (* (- 1) |ULTIMATE.start_main_~i~0#1|) (select |#length| |ULTIMATE.start_main_~#str1~0#1.base|)))) unseeded)} is VALID [2022-02-21 03:57:57,550 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:57:57,566 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:57:57,572 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 4 edges. 4 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:57:57,573 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 2 letters. Loop has 2 letters. [2022-02-21 03:57:57,575 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:57,578 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-02-21 03:57:57,579 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 17 states, 16 states have (on average 1.4375) internal successors, (23), 16 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:57:57,637 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 17 states, 16 states have (on average 1.4375) internal successors, (23), 16 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0). Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 33 states and 47 transitions. Complement of second has 8 states. [2022-02-21 03:57:57,637 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-02-21 03:57:57,637 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:57:57,638 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 17 states, 16 states have (on average 1.4375) internal successors, (23), 16 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:57:57,639 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2022-02-21 03:57:57,639 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:57:57,639 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:57:57,640 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:57:57,642 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2022-02-21 03:57:57,642 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:57:57,642 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:57:57,642 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 47 transitions. [2022-02-21 03:57:57,643 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2022-02-21 03:57:57,644 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:57:57,644 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:57:57,645 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 17 states, 16 states have (on average 1.4375) internal successors, (23), 16 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:57:57,646 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2022-02-21 03:57:57,648 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 9 examples of accepted words. [2022-02-21 03:57:57,648 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:57:57,649 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2022-02-21 03:57:57,649 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 03:57:57,649 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 33 states and 47 transitions. cyclomatic complexity: 19 [2022-02-21 03:57:57,650 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 7 examples of accepted words. [2022-02-21 03:57:57,650 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 17 states, 16 states have (on average 1.4375) internal successors, (23), 16 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 2 letters. Loop has 2 letters. [2022-02-21 03:57:57,651 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:57,651 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 2 letters. Loop has 2 letters. [2022-02-21 03:57:57,651 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:57,651 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 47 transitions. cyclomatic complexity: 19 Stem has 2 letters. Loop has 2 letters. [2022-02-21 03:57:57,651 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:57,651 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 17 states, 16 states have (on average 1.4375) internal successors, (23), 16 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:57:57,652 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:57,652 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:57:57,652 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:57,652 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 47 transitions. cyclomatic complexity: 19 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:57:57,652 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:57,652 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 17 states, 16 states have (on average 1.4375) internal successors, (23), 16 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 4 letters. Loop has 2 letters. [2022-02-21 03:57:57,652 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:57,653 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 4 letters. Loop has 2 letters. [2022-02-21 03:57:57,653 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:57,653 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 47 transitions. cyclomatic complexity: 19 Stem has 4 letters. Loop has 2 letters. [2022-02-21 03:57:57,653 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:57,653 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 17 states, 16 states have (on average 1.4375) internal successors, (23), 16 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 33 letters. Loop has 33 letters. [2022-02-21 03:57:57,653 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:57,653 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 33 letters. Loop has 33 letters. [2022-02-21 03:57:57,654 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:57,654 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 47 transitions. cyclomatic complexity: 19 Stem has 33 letters. Loop has 33 letters. [2022-02-21 03:57:57,654 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:57,654 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 17 states, 16 states have (on average 1.4375) internal successors, (23), 16 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 17 letters. Loop has 17 letters. [2022-02-21 03:57:57,654 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:57,654 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 17 letters. Loop has 17 letters. [2022-02-21 03:57:57,655 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:57,655 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 47 transitions. cyclomatic complexity: 19 Stem has 17 letters. Loop has 17 letters. [2022-02-21 03:57:57,655 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:57,655 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 17 states, 16 states have (on average 1.4375) internal successors, (23), 16 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:57:57,655 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:57,655 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:57:57,655 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:57,655 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 47 transitions. cyclomatic complexity: 19 Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:57:57,656 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:57,656 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 17 states, 16 states have (on average 1.4375) internal successors, (23), 16 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 4 letters. [2022-02-21 03:57:57,656 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:57,656 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 4 letters. [2022-02-21 03:57:57,656 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:57,656 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 47 transitions. cyclomatic complexity: 19 Stem has 8 letters. Loop has 4 letters. [2022-02-21 03:57:57,657 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:57,657 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 17 states, 16 states have (on average 1.4375) internal successors, (23), 16 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 9 letters. Loop has 4 letters. [2022-02-21 03:57:57,657 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:57,657 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 9 letters. Loop has 4 letters. [2022-02-21 03:57:57,657 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:57,657 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 47 transitions. cyclomatic complexity: 19 Stem has 9 letters. Loop has 4 letters. [2022-02-21 03:57:57,657 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:57,658 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 17 states, 16 states have (on average 1.4375) internal successors, (23), 16 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 4 letters. [2022-02-21 03:57:57,658 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:57,658 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 4 letters. [2022-02-21 03:57:57,658 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:57,658 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 47 transitions. cyclomatic complexity: 19 Stem has 6 letters. Loop has 4 letters. [2022-02-21 03:57:57,658 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:57,659 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 17 states, 16 states have (on average 1.4375) internal successors, (23), 16 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 5 letters. [2022-02-21 03:57:57,659 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:57,659 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 5 letters. [2022-02-21 03:57:57,659 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:57,659 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 47 transitions. cyclomatic complexity: 19 Stem has 8 letters. Loop has 5 letters. [2022-02-21 03:57:57,659 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:57,660 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 17 states, 16 states have (on average 1.4375) internal successors, (23), 16 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 4 letters. [2022-02-21 03:57:57,660 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:57,660 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 4 letters. [2022-02-21 03:57:57,660 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:57,660 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 47 transitions. cyclomatic complexity: 19 Stem has 7 letters. Loop has 4 letters. [2022-02-21 03:57:57,660 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:57,661 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 17 states, 16 states have (on average 1.4375) internal successors, (23), 16 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 4 letters. Loop has 2 letters. [2022-02-21 03:57:57,661 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:57,661 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 4 letters. Loop has 2 letters. [2022-02-21 03:57:57,661 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:57,661 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 47 transitions. cyclomatic complexity: 19 Stem has 4 letters. Loop has 2 letters. [2022-02-21 03:57:57,661 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:57,661 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 17 states, 16 states have (on average 1.4375) internal successors, (23), 16 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 2 letters. [2022-02-21 03:57:57,662 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:57,662 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 2 letters. [2022-02-21 03:57:57,662 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:57,662 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 47 transitions. cyclomatic complexity: 19 Stem has 5 letters. Loop has 2 letters. [2022-02-21 03:57:57,662 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:57,662 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 17 states, 16 states have (on average 1.4375) internal successors, (23), 16 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 2 letters. Loop has 2 letters. [2022-02-21 03:57:57,662 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:57,663 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 2 letters. Loop has 2 letters. [2022-02-21 03:57:57,663 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:57,663 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 47 transitions. cyclomatic complexity: 19 Stem has 2 letters. Loop has 2 letters. [2022-02-21 03:57:57,663 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:57,663 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 17 states, 16 states have (on average 1.4375) internal successors, (23), 16 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 3 letters. Loop has 2 letters. [2022-02-21 03:57:57,663 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:57,664 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 3 letters. Loop has 2 letters. [2022-02-21 03:57:57,664 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:57,664 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 47 transitions. cyclomatic complexity: 19 Stem has 3 letters. Loop has 2 letters. [2022-02-21 03:57:57,664 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:57,664 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 17 states, 16 states have (on average 1.4375) internal successors, (23), 16 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 2 letters. Loop has 1 letters. [2022-02-21 03:57:57,664 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:57,664 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 2 letters. Loop has 1 letters. [2022-02-21 03:57:57,665 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:57,665 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 47 transitions. cyclomatic complexity: 19 Stem has 2 letters. Loop has 1 letters. [2022-02-21 03:57:57,665 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:57,665 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 17 states, 16 states have (on average 1.4375) internal successors, (23), 16 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:57:57,665 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:57,665 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:57:57,665 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:57,666 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 47 transitions. cyclomatic complexity: 19 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:57:57,666 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:57,666 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 17 states, 16 states have (on average 1.4375) internal successors, (23), 16 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 4 letters. [2022-02-21 03:57:57,666 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:57,666 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 4 letters. [2022-02-21 03:57:57,666 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:57,666 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 47 transitions. cyclomatic complexity: 19 Stem has 6 letters. Loop has 4 letters. [2022-02-21 03:57:57,667 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:57,667 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 17 states, 16 states have (on average 1.4375) internal successors, (23), 16 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 4 letters. [2022-02-21 03:57:57,667 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:57,667 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 4 letters. [2022-02-21 03:57:57,667 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:57,667 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 47 transitions. cyclomatic complexity: 19 Stem has 7 letters. Loop has 4 letters. [2022-02-21 03:57:57,668 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:57,668 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 17 states, 16 states have (on average 1.4375) internal successors, (23), 16 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 5 letters. [2022-02-21 03:57:57,668 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:57,668 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 5 letters. [2022-02-21 03:57:57,668 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:57,668 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 47 transitions. cyclomatic complexity: 19 Stem has 8 letters. Loop has 5 letters. [2022-02-21 03:57:57,668 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:57,669 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 17 states, 16 states have (on average 1.4375) internal successors, (23), 16 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 4 letters. [2022-02-21 03:57:57,669 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:57,670 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 4 letters. [2022-02-21 03:57:57,670 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:57,670 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 47 transitions. cyclomatic complexity: 19 Stem has 8 letters. Loop has 4 letters. [2022-02-21 03:57:57,670 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:57,670 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 17 states, 16 states have (on average 1.4375) internal successors, (23), 16 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 9 letters. Loop has 4 letters. [2022-02-21 03:57:57,670 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:57,670 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 9 letters. Loop has 4 letters. [2022-02-21 03:57:57,671 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:57,671 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 47 transitions. cyclomatic complexity: 19 Stem has 9 letters. Loop has 4 letters. [2022-02-21 03:57:57,671 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:57,671 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 17 states, 16 states have (on average 1.4375) internal successors, (23), 16 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 4 letters. Loop has 2 letters. [2022-02-21 03:57:57,671 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:57,671 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 4 letters. Loop has 2 letters. [2022-02-21 03:57:57,671 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:57,672 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 47 transitions. cyclomatic complexity: 19 Stem has 4 letters. Loop has 2 letters. [2022-02-21 03:57:57,672 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:57,672 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 17 states, 16 states have (on average 1.4375) internal successors, (23), 16 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 2 letters. [2022-02-21 03:57:57,672 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:57,672 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 2 letters. [2022-02-21 03:57:57,672 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:57,672 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 47 transitions. cyclomatic complexity: 19 Stem has 5 letters. Loop has 2 letters. [2022-02-21 03:57:57,672 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:57,673 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:57:57,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:57:57,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 23 transitions. [2022-02-21 03:57:57,677 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 23 transitions. Stem has 2 letters. Loop has 2 letters. [2022-02-21 03:57:57,677 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:57,677 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 23 transitions. Stem has 4 letters. Loop has 2 letters. [2022-02-21 03:57:57,677 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:57,678 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 23 transitions. Stem has 2 letters. Loop has 4 letters. [2022-02-21 03:57:57,678 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:57,678 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 47 transitions. cyclomatic complexity: 19 [2022-02-21 03:57:57,688 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2022-02-21 03:57:57,694 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 14 states and 19 transitions. [2022-02-21 03:57:57,695 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2022-02-21 03:57:57,695 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2022-02-21 03:57:57,695 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 19 transitions. [2022-02-21 03:57:57,695 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:57:57,695 INFO L681 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2022-02-21 03:57:57,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 19 transitions. [2022-02-21 03:57:57,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2022-02-21 03:57:57,711 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:57:57,711 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14 states and 19 transitions. Second operand has 14 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 13 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:57:57,712 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states and 19 transitions. Second operand has 14 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 13 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:57:57,713 INFO L87 Difference]: Start difference. First operand 14 states and 19 transitions. Second operand has 14 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 13 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:57:57,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:57:57,715 INFO L93 Difference]: Finished difference Result 14 states and 19 transitions. [2022-02-21 03:57:57,716 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 19 transitions. [2022-02-21 03:57:57,716 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:57:57,716 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:57:57,716 INFO L74 IsIncluded]: Start isIncluded. First operand has 14 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 13 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 14 states and 19 transitions. [2022-02-21 03:57:57,717 INFO L87 Difference]: Start difference. First operand has 14 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 13 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 14 states and 19 transitions. [2022-02-21 03:57:57,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:57:57,717 INFO L93 Difference]: Finished difference Result 14 states and 19 transitions. [2022-02-21 03:57:57,718 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 19 transitions. [2022-02-21 03:57:57,718 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:57:57,718 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:57:57,718 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:57:57,718 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:57:57,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 13 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:57:57,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 19 transitions. [2022-02-21 03:57:57,720 INFO L704 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2022-02-21 03:57:57,720 INFO L587 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2022-02-21 03:57:57,720 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2022-02-21 03:57:57,720 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 19 transitions. [2022-02-21 03:57:57,721 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2022-02-21 03:57:57,721 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:57:57,721 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:57:57,721 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2022-02-21 03:57:57,721 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2022-02-21 03:57:57,722 INFO L791 eck$LassoCheckResult]: Stem: 146#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); 147#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~post4#1, main_#t~mem7#1, main_#t~post8#1, main_#t~post6#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~post12#1, main_#t~post9#1, main_~max~0#1, main_~#str1~0#1.base, main_~#str1~0#1.offset, main_~#str2~0#1.base, main_~#str2~0#1.offset, main_~i~0#1, main_~j~0#1;main_~max~0#1 := 5;call main_~#str1~0#1.base, main_~#str1~0#1.offset := #Ultimate.allocOnStack((if main_~max~0#1 % 4294967296 % 4294967296 <= 2147483647 then main_~max~0#1 % 4294967296 % 4294967296 else main_~max~0#1 % 4294967296 % 4294967296 - 4294967296));call main_~#str2~0#1.base, main_~#str2~0#1.offset := #Ultimate.allocOnStack((if main_~max~0#1 % 4294967296 % 4294967296 <= 2147483647 then main_~max~0#1 % 4294967296 % 4294967296 else main_~max~0#1 % 4294967296 % 4294967296 - 4294967296));havoc main_~i~0#1;havoc main_~j~0#1;main_~i~0#1 := 0; 150#L18-3 assume !(main_~i~0#1 % 4294967296 < main_~max~0#1 % 4294967296); 159#L18-4 call write~int(0, main_~#str1~0#1.base, main_~#str1~0#1.offset + (if (main_~max~0#1 - 1) % 4294967296 % 4294967296 <= 2147483647 then (main_~max~0#1 - 1) % 4294967296 % 4294967296 else (main_~max~0#1 - 1) % 4294967296 % 4294967296 - 4294967296), 1);main_~j~0#1 := 0;main_~i~0#1 := (if (main_~max~0#1 - 1) % 4294967296 % 4294967296 <= 2147483647 then (main_~max~0#1 - 1) % 4294967296 % 4294967296 else (main_~max~0#1 - 1) % 4294967296 % 4294967296 - 4294967296); 158#L26-3 [2022-02-21 03:57:57,722 INFO L793 eck$LassoCheckResult]: Loop: 158#L26-3 assume !!(main_~i~0#1 >= 0);call main_#t~mem7#1 := read~int(main_~#str1~0#1.base, main_~#str1~0#1.offset + main_~i~0#1, 1);call write~int(main_#t~mem7#1, main_~#str2~0#1.base, main_~#str2~0#1.offset + main_~j~0#1, 1);havoc main_#t~mem7#1;main_#t~post8#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 157#L26-2 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := main_#t~post6#1 - 1;havoc main_#t~post6#1; 158#L26-3 [2022-02-21 03:57:57,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:57:57,723 INFO L85 PathProgramCache]: Analyzing trace with hash 925707, now seen corresponding path program 1 times [2022-02-21 03:57:57,723 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:57:57,723 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081659346] [2022-02-21 03:57:57,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:57:57,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:57:57,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:57:57,861 INFO L290 TraceCheckUtils]: 0: Hoare triple {191#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {191#true} is VALID [2022-02-21 03:57:57,862 INFO L290 TraceCheckUtils]: 1: Hoare triple {191#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~post4#1, main_#t~mem7#1, main_#t~post8#1, main_#t~post6#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~post12#1, main_#t~post9#1, main_~max~0#1, main_~#str1~0#1.base, main_~#str1~0#1.offset, main_~#str2~0#1.base, main_~#str2~0#1.offset, main_~i~0#1, main_~j~0#1;main_~max~0#1 := 5;call main_~#str1~0#1.base, main_~#str1~0#1.offset := #Ultimate.allocOnStack((if main_~max~0#1 % 4294967296 % 4294967296 <= 2147483647 then main_~max~0#1 % 4294967296 % 4294967296 else main_~max~0#1 % 4294967296 % 4294967296 - 4294967296));call main_~#str2~0#1.base, main_~#str2~0#1.offset := #Ultimate.allocOnStack((if main_~max~0#1 % 4294967296 % 4294967296 <= 2147483647 then main_~max~0#1 % 4294967296 % 4294967296 else main_~max~0#1 % 4294967296 % 4294967296 - 4294967296));havoc main_~i~0#1;havoc main_~j~0#1;main_~i~0#1 := 0; {193#(and (<= |ULTIMATE.start_main_~max~0#1| 5) (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~max~0#1| (+ (* (div |ULTIMATE.start_main_~max~0#1| 4294967296) 4294967296) (select |#length| |ULTIMATE.start_main_~#str1~0#1.base|))) (< 0 (div (+ |ULTIMATE.start_main_~max~0#1| 4294967295) 4294967296)) (= |ULTIMATE.start_main_~#str1~0#1.offset| 0))} is VALID [2022-02-21 03:57:57,863 INFO L290 TraceCheckUtils]: 2: Hoare triple {193#(and (<= |ULTIMATE.start_main_~max~0#1| 5) (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~max~0#1| (+ (* (div |ULTIMATE.start_main_~max~0#1| 4294967296) 4294967296) (select |#length| |ULTIMATE.start_main_~#str1~0#1.base|))) (< 0 (div (+ |ULTIMATE.start_main_~max~0#1| 4294967295) 4294967296)) (= |ULTIMATE.start_main_~#str1~0#1.offset| 0))} assume !(main_~i~0#1 % 4294967296 < main_~max~0#1 % 4294967296); {192#false} is VALID [2022-02-21 03:57:57,863 INFO L290 TraceCheckUtils]: 3: Hoare triple {192#false} call write~int(0, main_~#str1~0#1.base, main_~#str1~0#1.offset + (if (main_~max~0#1 - 1) % 4294967296 % 4294967296 <= 2147483647 then (main_~max~0#1 - 1) % 4294967296 % 4294967296 else (main_~max~0#1 - 1) % 4294967296 % 4294967296 - 4294967296), 1);main_~j~0#1 := 0;main_~i~0#1 := (if (main_~max~0#1 - 1) % 4294967296 % 4294967296 <= 2147483647 then (main_~max~0#1 - 1) % 4294967296 % 4294967296 else (main_~max~0#1 - 1) % 4294967296 % 4294967296 - 4294967296); {192#false} is VALID [2022-02-21 03:57:57,863 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:57:57,864 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:57:57,864 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081659346] [2022-02-21 03:57:57,865 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1081659346] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:57:57,865 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:57:57,865 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 03:57:57,865 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923076464] [2022-02-21 03:57:57,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:57:57,868 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 03:57:57,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:57:57,868 INFO L85 PathProgramCache]: Analyzing trace with hash 1731, now seen corresponding path program 1 times [2022-02-21 03:57:57,868 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:57:57,868 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924280244] [2022-02-21 03:57:57,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:57:57,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:57:57,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:57:57,884 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:57:57,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:57:57,894 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:57:57,985 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2022-02-21 03:57:57,995 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:57:57,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 03:57:57,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:57:57,997 INFO L87 Difference]: Start difference. First operand 14 states and 19 transitions. cyclomatic complexity: 8 Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:57:58,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:57:58,032 INFO L93 Difference]: Finished difference Result 15 states and 17 transitions. [2022-02-21 03:57:58,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 03:57:58,033 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:57:58,038 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 4 edges. 4 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:57:58,038 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 17 transitions. [2022-02-21 03:57:58,039 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2022-02-21 03:57:58,039 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 14 states and 16 transitions. [2022-02-21 03:57:58,039 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2022-02-21 03:57:58,040 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2022-02-21 03:57:58,040 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 16 transitions. [2022-02-21 03:57:58,040 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:57:58,040 INFO L681 BuchiCegarLoop]: Abstraction has 14 states and 16 transitions. [2022-02-21 03:57:58,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 16 transitions. [2022-02-21 03:57:58,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2022-02-21 03:57:58,041 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:57:58,041 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14 states and 16 transitions. Second operand has 13 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 12 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:57:58,041 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states and 16 transitions. Second operand has 13 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 12 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:57:58,041 INFO L87 Difference]: Start difference. First operand 14 states and 16 transitions. Second operand has 13 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 12 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:57:58,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:57:58,042 INFO L93 Difference]: Finished difference Result 14 states and 16 transitions. [2022-02-21 03:57:58,042 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 16 transitions. [2022-02-21 03:57:58,042 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:57:58,042 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:57:58,042 INFO L74 IsIncluded]: Start isIncluded. First operand has 13 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 12 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 14 states and 16 transitions. [2022-02-21 03:57:58,043 INFO L87 Difference]: Start difference. First operand has 13 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 12 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 14 states and 16 transitions. [2022-02-21 03:57:58,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:57:58,043 INFO L93 Difference]: Finished difference Result 14 states and 16 transitions. [2022-02-21 03:57:58,043 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 16 transitions. [2022-02-21 03:57:58,044 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:57:58,044 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:57:58,044 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:57:58,044 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:57:58,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 12 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:57:58,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 15 transitions. [2022-02-21 03:57:58,045 INFO L704 BuchiCegarLoop]: Abstraction has 13 states and 15 transitions. [2022-02-21 03:57:58,045 INFO L587 BuchiCegarLoop]: Abstraction has 13 states and 15 transitions. [2022-02-21 03:57:58,045 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2022-02-21 03:57:58,045 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 15 transitions. [2022-02-21 03:57:58,045 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2022-02-21 03:57:58,045 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:57:58,045 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:57:58,046 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2022-02-21 03:57:58,046 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2022-02-21 03:57:58,046 INFO L791 eck$LassoCheckResult]: Stem: 213#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); 214#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~post4#1, main_#t~mem7#1, main_#t~post8#1, main_#t~post6#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~post12#1, main_#t~post9#1, main_~max~0#1, main_~#str1~0#1.base, main_~#str1~0#1.offset, main_~#str2~0#1.base, main_~#str2~0#1.offset, main_~i~0#1, main_~j~0#1;main_~max~0#1 := 5;call main_~#str1~0#1.base, main_~#str1~0#1.offset := #Ultimate.allocOnStack((if main_~max~0#1 % 4294967296 % 4294967296 <= 2147483647 then main_~max~0#1 % 4294967296 % 4294967296 else main_~max~0#1 % 4294967296 % 4294967296 - 4294967296));call main_~#str2~0#1.base, main_~#str2~0#1.offset := #Ultimate.allocOnStack((if main_~max~0#1 % 4294967296 % 4294967296 <= 2147483647 then main_~max~0#1 % 4294967296 % 4294967296 else main_~max~0#1 % 4294967296 % 4294967296 - 4294967296));havoc main_~i~0#1;havoc main_~j~0#1;main_~i~0#1 := 0; 222#L18-3 assume !!(main_~i~0#1 % 4294967296 < main_~max~0#1 % 4294967296);call write~int(main_#t~nondet5#1, main_~#str1~0#1.base, main_~#str1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; 216#L18-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 217#L18-3 assume !(main_~i~0#1 % 4294967296 < main_~max~0#1 % 4294967296); 223#L18-4 call write~int(0, main_~#str1~0#1.base, main_~#str1~0#1.offset + (if (main_~max~0#1 - 1) % 4294967296 % 4294967296 <= 2147483647 then (main_~max~0#1 - 1) % 4294967296 % 4294967296 else (main_~max~0#1 - 1) % 4294967296 % 4294967296 - 4294967296), 1);main_~j~0#1 := 0;main_~i~0#1 := (if (main_~max~0#1 - 1) % 4294967296 % 4294967296 <= 2147483647 then (main_~max~0#1 - 1) % 4294967296 % 4294967296 else (main_~max~0#1 - 1) % 4294967296 % 4294967296 - 4294967296); 221#L26-3 [2022-02-21 03:57:58,046 INFO L793 eck$LassoCheckResult]: Loop: 221#L26-3 assume !!(main_~i~0#1 >= 0);call main_#t~mem7#1 := read~int(main_~#str1~0#1.base, main_~#str1~0#1.offset + main_~i~0#1, 1);call write~int(main_#t~mem7#1, main_~#str2~0#1.base, main_~#str2~0#1.offset + main_~j~0#1, 1);havoc main_#t~mem7#1;main_#t~post8#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 220#L26-2 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := main_#t~post6#1 - 1;havoc main_#t~post6#1; 221#L26-3 [2022-02-21 03:57:58,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:57:58,046 INFO L85 PathProgramCache]: Analyzing trace with hash 889660429, now seen corresponding path program 1 times [2022-02-21 03:57:58,046 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:57:58,047 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031555454] [2022-02-21 03:57:58,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:57:58,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:57:58,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:57:58,120 INFO L290 TraceCheckUtils]: 0: Hoare triple {255#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {255#true} is VALID [2022-02-21 03:57:58,121 INFO L290 TraceCheckUtils]: 1: Hoare triple {255#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~post4#1, main_#t~mem7#1, main_#t~post8#1, main_#t~post6#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~post12#1, main_#t~post9#1, main_~max~0#1, main_~#str1~0#1.base, main_~#str1~0#1.offset, main_~#str2~0#1.base, main_~#str2~0#1.offset, main_~i~0#1, main_~j~0#1;main_~max~0#1 := 5;call main_~#str1~0#1.base, main_~#str1~0#1.offset := #Ultimate.allocOnStack((if main_~max~0#1 % 4294967296 % 4294967296 <= 2147483647 then main_~max~0#1 % 4294967296 % 4294967296 else main_~max~0#1 % 4294967296 % 4294967296 - 4294967296));call main_~#str2~0#1.base, main_~#str2~0#1.offset := #Ultimate.allocOnStack((if main_~max~0#1 % 4294967296 % 4294967296 <= 2147483647 then main_~max~0#1 % 4294967296 % 4294967296 else main_~max~0#1 % 4294967296 % 4294967296 - 4294967296));havoc main_~i~0#1;havoc main_~j~0#1;main_~i~0#1 := 0; {257#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= (div |ULTIMATE.start_main_~max~0#1| 4294967296) (div |ULTIMATE.start_main_~i~0#1| 4294967296)) (<= 5 |ULTIMATE.start_main_~max~0#1|))} is VALID [2022-02-21 03:57:58,122 INFO L290 TraceCheckUtils]: 2: Hoare triple {257#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= (div |ULTIMATE.start_main_~max~0#1| 4294967296) (div |ULTIMATE.start_main_~i~0#1| 4294967296)) (<= 5 |ULTIMATE.start_main_~max~0#1|))} assume !!(main_~i~0#1 % 4294967296 < main_~max~0#1 % 4294967296);call write~int(main_#t~nondet5#1, main_~#str1~0#1.base, main_~#str1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; {257#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= (div |ULTIMATE.start_main_~max~0#1| 4294967296) (div |ULTIMATE.start_main_~i~0#1| 4294967296)) (<= 5 |ULTIMATE.start_main_~max~0#1|))} is VALID [2022-02-21 03:57:58,122 INFO L290 TraceCheckUtils]: 3: Hoare triple {257#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= (div |ULTIMATE.start_main_~max~0#1| 4294967296) (div |ULTIMATE.start_main_~i~0#1| 4294967296)) (<= 5 |ULTIMATE.start_main_~max~0#1|))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {258#(and (<= (+ |ULTIMATE.start_main_~i~0#1| 4) |ULTIMATE.start_main_~max~0#1|) (<= (div |ULTIMATE.start_main_~max~0#1| 4294967296) (div |ULTIMATE.start_main_~i~0#1| 4294967296)))} is VALID [2022-02-21 03:57:58,123 INFO L290 TraceCheckUtils]: 4: Hoare triple {258#(and (<= (+ |ULTIMATE.start_main_~i~0#1| 4) |ULTIMATE.start_main_~max~0#1|) (<= (div |ULTIMATE.start_main_~max~0#1| 4294967296) (div |ULTIMATE.start_main_~i~0#1| 4294967296)))} assume !(main_~i~0#1 % 4294967296 < main_~max~0#1 % 4294967296); {256#false} is VALID [2022-02-21 03:57:58,123 INFO L290 TraceCheckUtils]: 5: Hoare triple {256#false} call write~int(0, main_~#str1~0#1.base, main_~#str1~0#1.offset + (if (main_~max~0#1 - 1) % 4294967296 % 4294967296 <= 2147483647 then (main_~max~0#1 - 1) % 4294967296 % 4294967296 else (main_~max~0#1 - 1) % 4294967296 % 4294967296 - 4294967296), 1);main_~j~0#1 := 0;main_~i~0#1 := (if (main_~max~0#1 - 1) % 4294967296 % 4294967296 <= 2147483647 then (main_~max~0#1 - 1) % 4294967296 % 4294967296 else (main_~max~0#1 - 1) % 4294967296 % 4294967296 - 4294967296); {256#false} is VALID [2022-02-21 03:57:58,123 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:57:58,123 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:57:58,124 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031555454] [2022-02-21 03:57:58,124 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2031555454] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:57:58,125 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [600901334] [2022-02-21 03:57:58,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:57:58,126 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:57:58,126 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:57:58,127 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 03:57:58,128 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-02-21 03:57:58,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:57:58,166 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 17 conjunts are in the unsatisfiable core [2022-02-21 03:57:58,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:57:58,173 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:57:58,231 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-21 03:57:58,236 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-02-21 03:57:58,246 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 10 treesize of output 8 [2022-02-21 03:57:58,317 INFO L290 TraceCheckUtils]: 0: Hoare triple {255#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {255#true} is VALID [2022-02-21 03:57:58,318 INFO L290 TraceCheckUtils]: 1: Hoare triple {255#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~post4#1, main_#t~mem7#1, main_#t~post8#1, main_#t~post6#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~post12#1, main_#t~post9#1, main_~max~0#1, main_~#str1~0#1.base, main_~#str1~0#1.offset, main_~#str2~0#1.base, main_~#str2~0#1.offset, main_~i~0#1, main_~j~0#1;main_~max~0#1 := 5;call main_~#str1~0#1.base, main_~#str1~0#1.offset := #Ultimate.allocOnStack((if main_~max~0#1 % 4294967296 % 4294967296 <= 2147483647 then main_~max~0#1 % 4294967296 % 4294967296 else main_~max~0#1 % 4294967296 % 4294967296 - 4294967296));call main_~#str2~0#1.base, main_~#str2~0#1.offset := #Ultimate.allocOnStack((if main_~max~0#1 % 4294967296 % 4294967296 <= 2147483647 then main_~max~0#1 % 4294967296 % 4294967296 else main_~max~0#1 % 4294967296 % 4294967296 - 4294967296));havoc main_~i~0#1;havoc main_~j~0#1;main_~i~0#1 := 0; {265#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= (select |#length| |ULTIMATE.start_main_~#str1~0#1.base|) (mod |ULTIMATE.start_main_~max~0#1| 4294967296)) (= 5 |ULTIMATE.start_main_~max~0#1|) (= |ULTIMATE.start_main_~#str1~0#1.offset| 0))} is VALID [2022-02-21 03:57:58,318 INFO L290 TraceCheckUtils]: 2: Hoare triple {265#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= (select |#length| |ULTIMATE.start_main_~#str1~0#1.base|) (mod |ULTIMATE.start_main_~max~0#1| 4294967296)) (= 5 |ULTIMATE.start_main_~max~0#1|) (= |ULTIMATE.start_main_~#str1~0#1.offset| 0))} assume !!(main_~i~0#1 % 4294967296 < main_~max~0#1 % 4294967296);call write~int(main_#t~nondet5#1, main_~#str1~0#1.base, main_~#str1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; {265#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= (select |#length| |ULTIMATE.start_main_~#str1~0#1.base|) (mod |ULTIMATE.start_main_~max~0#1| 4294967296)) (= 5 |ULTIMATE.start_main_~max~0#1|) (= |ULTIMATE.start_main_~#str1~0#1.offset| 0))} is VALID [2022-02-21 03:57:58,319 INFO L290 TraceCheckUtils]: 3: Hoare triple {265#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= (select |#length| |ULTIMATE.start_main_~#str1~0#1.base|) (mod |ULTIMATE.start_main_~max~0#1| 4294967296)) (= 5 |ULTIMATE.start_main_~max~0#1|) (= |ULTIMATE.start_main_~#str1~0#1.offset| 0))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {272#(and (= 0 (+ (- 1) |ULTIMATE.start_main_~i~0#1|)) (<= (select |#length| |ULTIMATE.start_main_~#str1~0#1.base|) (mod |ULTIMATE.start_main_~max~0#1| 4294967296)) (= 5 |ULTIMATE.start_main_~max~0#1|) (= |ULTIMATE.start_main_~#str1~0#1.offset| 0))} is VALID [2022-02-21 03:57:58,319 INFO L290 TraceCheckUtils]: 4: Hoare triple {272#(and (= 0 (+ (- 1) |ULTIMATE.start_main_~i~0#1|)) (<= (select |#length| |ULTIMATE.start_main_~#str1~0#1.base|) (mod |ULTIMATE.start_main_~max~0#1| 4294967296)) (= 5 |ULTIMATE.start_main_~max~0#1|) (= |ULTIMATE.start_main_~#str1~0#1.offset| 0))} assume !(main_~i~0#1 % 4294967296 < main_~max~0#1 % 4294967296); {256#false} is VALID [2022-02-21 03:57:58,319 INFO L290 TraceCheckUtils]: 5: Hoare triple {256#false} call write~int(0, main_~#str1~0#1.base, main_~#str1~0#1.offset + (if (main_~max~0#1 - 1) % 4294967296 % 4294967296 <= 2147483647 then (main_~max~0#1 - 1) % 4294967296 % 4294967296 else (main_~max~0#1 - 1) % 4294967296 % 4294967296 - 4294967296), 1);main_~j~0#1 := 0;main_~i~0#1 := (if (main_~max~0#1 - 1) % 4294967296 % 4294967296 <= 2147483647 then (main_~max~0#1 - 1) % 4294967296 % 4294967296 else (main_~max~0#1 - 1) % 4294967296 % 4294967296 - 4294967296); {256#false} is VALID [2022-02-21 03:57:58,320 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:57:58,320 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:57:58,584 INFO L290 TraceCheckUtils]: 5: Hoare triple {279#(or (and (not (<= (+ (mod (+ |ULTIMATE.start_main_~max~0#1| 4294967295) 4294967296) |ULTIMATE.start_main_~#str1~0#1.offset| 1) (select |#length| |ULTIMATE.start_main_~#str1~0#1.base|))) (or (<= (mod (+ |ULTIMATE.start_main_~max~0#1| 4294967295) 4294967296) 2147483647) (not (<= (+ (mod (+ |ULTIMATE.start_main_~max~0#1| 4294967295) 4294967296) |ULTIMATE.start_main_~#str1~0#1.offset|) (+ 4294967295 (select |#length| |ULTIMATE.start_main_~#str1~0#1.base|)))))) (and (not (<= 4294967296 (+ (mod (+ |ULTIMATE.start_main_~max~0#1| 4294967295) 4294967296) |ULTIMATE.start_main_~#str1~0#1.offset|))) (or (not (<= (mod (+ |ULTIMATE.start_main_~max~0#1| 4294967295) 4294967296) 2147483647)) (not (<= 0 (+ (mod (+ |ULTIMATE.start_main_~max~0#1| 4294967295) 4294967296) |ULTIMATE.start_main_~#str1~0#1.offset|))))))} call write~int(0, main_~#str1~0#1.base, main_~#str1~0#1.offset + (if (main_~max~0#1 - 1) % 4294967296 % 4294967296 <= 2147483647 then (main_~max~0#1 - 1) % 4294967296 % 4294967296 else (main_~max~0#1 - 1) % 4294967296 % 4294967296 - 4294967296), 1);main_~j~0#1 := 0;main_~i~0#1 := (if (main_~max~0#1 - 1) % 4294967296 % 4294967296 <= 2147483647 then (main_~max~0#1 - 1) % 4294967296 % 4294967296 else (main_~max~0#1 - 1) % 4294967296 % 4294967296 - 4294967296); {256#false} is VALID [2022-02-21 03:57:58,585 INFO L290 TraceCheckUtils]: 4: Hoare triple {283#(or (and (not (<= (+ (mod (+ |ULTIMATE.start_main_~max~0#1| 4294967295) 4294967296) |ULTIMATE.start_main_~#str1~0#1.offset| 1) (select |#length| |ULTIMATE.start_main_~#str1~0#1.base|))) (or (<= (mod (+ |ULTIMATE.start_main_~max~0#1| 4294967295) 4294967296) 2147483647) (not (<= (+ (mod (+ |ULTIMATE.start_main_~max~0#1| 4294967295) 4294967296) |ULTIMATE.start_main_~#str1~0#1.offset|) (+ 4294967295 (select |#length| |ULTIMATE.start_main_~#str1~0#1.base|)))))) (and (not (<= 4294967296 (+ (mod (+ |ULTIMATE.start_main_~max~0#1| 4294967295) 4294967296) |ULTIMATE.start_main_~#str1~0#1.offset|))) (or (not (<= (mod (+ |ULTIMATE.start_main_~max~0#1| 4294967295) 4294967296) 2147483647)) (not (<= 0 (+ (mod (+ |ULTIMATE.start_main_~max~0#1| 4294967295) 4294967296) |ULTIMATE.start_main_~#str1~0#1.offset|))))) (< (mod |ULTIMATE.start_main_~i~0#1| 4294967296) (mod |ULTIMATE.start_main_~max~0#1| 4294967296)))} assume !(main_~i~0#1 % 4294967296 < main_~max~0#1 % 4294967296); {279#(or (and (not (<= (+ (mod (+ |ULTIMATE.start_main_~max~0#1| 4294967295) 4294967296) |ULTIMATE.start_main_~#str1~0#1.offset| 1) (select |#length| |ULTIMATE.start_main_~#str1~0#1.base|))) (or (<= (mod (+ |ULTIMATE.start_main_~max~0#1| 4294967295) 4294967296) 2147483647) (not (<= (+ (mod (+ |ULTIMATE.start_main_~max~0#1| 4294967295) 4294967296) |ULTIMATE.start_main_~#str1~0#1.offset|) (+ 4294967295 (select |#length| |ULTIMATE.start_main_~#str1~0#1.base|)))))) (and (not (<= 4294967296 (+ (mod (+ |ULTIMATE.start_main_~max~0#1| 4294967295) 4294967296) |ULTIMATE.start_main_~#str1~0#1.offset|))) (or (not (<= (mod (+ |ULTIMATE.start_main_~max~0#1| 4294967295) 4294967296) 2147483647)) (not (<= 0 (+ (mod (+ |ULTIMATE.start_main_~max~0#1| 4294967295) 4294967296) |ULTIMATE.start_main_~#str1~0#1.offset|))))))} is VALID [2022-02-21 03:57:58,587 INFO L290 TraceCheckUtils]: 3: Hoare triple {287#(or (and (not (<= (+ (mod (+ |ULTIMATE.start_main_~max~0#1| 4294967295) 4294967296) |ULTIMATE.start_main_~#str1~0#1.offset| 1) (select |#length| |ULTIMATE.start_main_~#str1~0#1.base|))) (or (<= (mod (+ |ULTIMATE.start_main_~max~0#1| 4294967295) 4294967296) 2147483647) (not (<= (+ (mod (+ |ULTIMATE.start_main_~max~0#1| 4294967295) 4294967296) |ULTIMATE.start_main_~#str1~0#1.offset|) (+ 4294967295 (select |#length| |ULTIMATE.start_main_~#str1~0#1.base|)))))) (and (not (<= 4294967296 (+ (mod (+ |ULTIMATE.start_main_~max~0#1| 4294967295) 4294967296) |ULTIMATE.start_main_~#str1~0#1.offset|))) (or (not (<= (mod (+ |ULTIMATE.start_main_~max~0#1| 4294967295) 4294967296) 2147483647)) (not (<= 0 (+ (mod (+ |ULTIMATE.start_main_~max~0#1| 4294967295) 4294967296) |ULTIMATE.start_main_~#str1~0#1.offset|))))) (< (mod (+ |ULTIMATE.start_main_~i~0#1| 1) 4294967296) (mod |ULTIMATE.start_main_~max~0#1| 4294967296)))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {283#(or (and (not (<= (+ (mod (+ |ULTIMATE.start_main_~max~0#1| 4294967295) 4294967296) |ULTIMATE.start_main_~#str1~0#1.offset| 1) (select |#length| |ULTIMATE.start_main_~#str1~0#1.base|))) (or (<= (mod (+ |ULTIMATE.start_main_~max~0#1| 4294967295) 4294967296) 2147483647) (not (<= (+ (mod (+ |ULTIMATE.start_main_~max~0#1| 4294967295) 4294967296) |ULTIMATE.start_main_~#str1~0#1.offset|) (+ 4294967295 (select |#length| |ULTIMATE.start_main_~#str1~0#1.base|)))))) (and (not (<= 4294967296 (+ (mod (+ |ULTIMATE.start_main_~max~0#1| 4294967295) 4294967296) |ULTIMATE.start_main_~#str1~0#1.offset|))) (or (not (<= (mod (+ |ULTIMATE.start_main_~max~0#1| 4294967295) 4294967296) 2147483647)) (not (<= 0 (+ (mod (+ |ULTIMATE.start_main_~max~0#1| 4294967295) 4294967296) |ULTIMATE.start_main_~#str1~0#1.offset|))))) (< (mod |ULTIMATE.start_main_~i~0#1| 4294967296) (mod |ULTIMATE.start_main_~max~0#1| 4294967296)))} is VALID [2022-02-21 03:57:58,588 INFO L290 TraceCheckUtils]: 2: Hoare triple {287#(or (and (not (<= (+ (mod (+ |ULTIMATE.start_main_~max~0#1| 4294967295) 4294967296) |ULTIMATE.start_main_~#str1~0#1.offset| 1) (select |#length| |ULTIMATE.start_main_~#str1~0#1.base|))) (or (<= (mod (+ |ULTIMATE.start_main_~max~0#1| 4294967295) 4294967296) 2147483647) (not (<= (+ (mod (+ |ULTIMATE.start_main_~max~0#1| 4294967295) 4294967296) |ULTIMATE.start_main_~#str1~0#1.offset|) (+ 4294967295 (select |#length| |ULTIMATE.start_main_~#str1~0#1.base|)))))) (and (not (<= 4294967296 (+ (mod (+ |ULTIMATE.start_main_~max~0#1| 4294967295) 4294967296) |ULTIMATE.start_main_~#str1~0#1.offset|))) (or (not (<= (mod (+ |ULTIMATE.start_main_~max~0#1| 4294967295) 4294967296) 2147483647)) (not (<= 0 (+ (mod (+ |ULTIMATE.start_main_~max~0#1| 4294967295) 4294967296) |ULTIMATE.start_main_~#str1~0#1.offset|))))) (< (mod (+ |ULTIMATE.start_main_~i~0#1| 1) 4294967296) (mod |ULTIMATE.start_main_~max~0#1| 4294967296)))} assume !!(main_~i~0#1 % 4294967296 < main_~max~0#1 % 4294967296);call write~int(main_#t~nondet5#1, main_~#str1~0#1.base, main_~#str1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; {287#(or (and (not (<= (+ (mod (+ |ULTIMATE.start_main_~max~0#1| 4294967295) 4294967296) |ULTIMATE.start_main_~#str1~0#1.offset| 1) (select |#length| |ULTIMATE.start_main_~#str1~0#1.base|))) (or (<= (mod (+ |ULTIMATE.start_main_~max~0#1| 4294967295) 4294967296) 2147483647) (not (<= (+ (mod (+ |ULTIMATE.start_main_~max~0#1| 4294967295) 4294967296) |ULTIMATE.start_main_~#str1~0#1.offset|) (+ 4294967295 (select |#length| |ULTIMATE.start_main_~#str1~0#1.base|)))))) (and (not (<= 4294967296 (+ (mod (+ |ULTIMATE.start_main_~max~0#1| 4294967295) 4294967296) |ULTIMATE.start_main_~#str1~0#1.offset|))) (or (not (<= (mod (+ |ULTIMATE.start_main_~max~0#1| 4294967295) 4294967296) 2147483647)) (not (<= 0 (+ (mod (+ |ULTIMATE.start_main_~max~0#1| 4294967295) 4294967296) |ULTIMATE.start_main_~#str1~0#1.offset|))))) (< (mod (+ |ULTIMATE.start_main_~i~0#1| 1) 4294967296) (mod |ULTIMATE.start_main_~max~0#1| 4294967296)))} is VALID [2022-02-21 03:57:58,589 INFO L290 TraceCheckUtils]: 1: Hoare triple {255#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~post4#1, main_#t~mem7#1, main_#t~post8#1, main_#t~post6#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~post12#1, main_#t~post9#1, main_~max~0#1, main_~#str1~0#1.base, main_~#str1~0#1.offset, main_~#str2~0#1.base, main_~#str2~0#1.offset, main_~i~0#1, main_~j~0#1;main_~max~0#1 := 5;call main_~#str1~0#1.base, main_~#str1~0#1.offset := #Ultimate.allocOnStack((if main_~max~0#1 % 4294967296 % 4294967296 <= 2147483647 then main_~max~0#1 % 4294967296 % 4294967296 else main_~max~0#1 % 4294967296 % 4294967296 - 4294967296));call main_~#str2~0#1.base, main_~#str2~0#1.offset := #Ultimate.allocOnStack((if main_~max~0#1 % 4294967296 % 4294967296 <= 2147483647 then main_~max~0#1 % 4294967296 % 4294967296 else main_~max~0#1 % 4294967296 % 4294967296 - 4294967296));havoc main_~i~0#1;havoc main_~j~0#1;main_~i~0#1 := 0; {287#(or (and (not (<= (+ (mod (+ |ULTIMATE.start_main_~max~0#1| 4294967295) 4294967296) |ULTIMATE.start_main_~#str1~0#1.offset| 1) (select |#length| |ULTIMATE.start_main_~#str1~0#1.base|))) (or (<= (mod (+ |ULTIMATE.start_main_~max~0#1| 4294967295) 4294967296) 2147483647) (not (<= (+ (mod (+ |ULTIMATE.start_main_~max~0#1| 4294967295) 4294967296) |ULTIMATE.start_main_~#str1~0#1.offset|) (+ 4294967295 (select |#length| |ULTIMATE.start_main_~#str1~0#1.base|)))))) (and (not (<= 4294967296 (+ (mod (+ |ULTIMATE.start_main_~max~0#1| 4294967295) 4294967296) |ULTIMATE.start_main_~#str1~0#1.offset|))) (or (not (<= (mod (+ |ULTIMATE.start_main_~max~0#1| 4294967295) 4294967296) 2147483647)) (not (<= 0 (+ (mod (+ |ULTIMATE.start_main_~max~0#1| 4294967295) 4294967296) |ULTIMATE.start_main_~#str1~0#1.offset|))))) (< (mod (+ |ULTIMATE.start_main_~i~0#1| 1) 4294967296) (mod |ULTIMATE.start_main_~max~0#1| 4294967296)))} is VALID [2022-02-21 03:57:58,589 INFO L290 TraceCheckUtils]: 0: Hoare triple {255#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {255#true} is VALID [2022-02-21 03:57:58,589 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:57:58,589 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [600901334] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:57:58,589 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:57:58,590 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2022-02-21 03:57:58,590 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131807588] [2022-02-21 03:57:58,590 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:57:58,590 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 03:57:58,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:57:58,591 INFO L85 PathProgramCache]: Analyzing trace with hash 1731, now seen corresponding path program 2 times [2022-02-21 03:57:58,591 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:57:58,591 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074397662] [2022-02-21 03:57:58,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:57:58,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:57:58,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:57:58,597 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:57:58,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:57:58,600 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:57:58,658 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:57:58,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-21 03:57:58,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2022-02-21 03:57:58,659 INFO L87 Difference]: Start difference. First operand 13 states and 15 transitions. cyclomatic complexity: 5 Second operand has 9 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 9 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:57:58,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:57:58,868 INFO L93 Difference]: Finished difference Result 20 states and 23 transitions. [2022-02-21 03:57:58,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-21 03:57:58,868 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 9 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:57:58,884 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:57:58,885 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 23 transitions. [2022-02-21 03:57:58,886 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2022-02-21 03:57:58,886 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 19 states and 21 transitions. [2022-02-21 03:57:58,886 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2022-02-21 03:57:58,886 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2022-02-21 03:57:58,886 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 21 transitions. [2022-02-21 03:57:58,887 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:57:58,887 INFO L681 BuchiCegarLoop]: Abstraction has 19 states and 21 transitions. [2022-02-21 03:57:58,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 21 transitions. [2022-02-21 03:57:58,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2022-02-21 03:57:58,887 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:57:58,888 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states and 21 transitions. Second operand has 19 states, 19 states have (on average 1.105263157894737) internal successors, (21), 18 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:57:58,888 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states and 21 transitions. Second operand has 19 states, 19 states have (on average 1.105263157894737) internal successors, (21), 18 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:57:58,888 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. Second operand has 19 states, 19 states have (on average 1.105263157894737) internal successors, (21), 18 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:57:58,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:57:58,888 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2022-02-21 03:57:58,888 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2022-02-21 03:57:58,888 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:57:58,888 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:57:58,888 INFO L74 IsIncluded]: Start isIncluded. First operand has 19 states, 19 states have (on average 1.105263157894737) internal successors, (21), 18 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 19 states and 21 transitions. [2022-02-21 03:57:58,889 INFO L87 Difference]: Start difference. First operand has 19 states, 19 states have (on average 1.105263157894737) internal successors, (21), 18 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 19 states and 21 transitions. [2022-02-21 03:57:58,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:57:58,889 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2022-02-21 03:57:58,889 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2022-02-21 03:57:58,890 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:57:58,890 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:57:58,890 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:57:58,890 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:57:58,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.105263157894737) internal successors, (21), 18 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:57:58,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2022-02-21 03:57:58,891 INFO L704 BuchiCegarLoop]: Abstraction has 19 states and 21 transitions. [2022-02-21 03:57:58,891 INFO L587 BuchiCegarLoop]: Abstraction has 19 states and 21 transitions. [2022-02-21 03:57:58,891 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2022-02-21 03:57:58,891 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 21 transitions. [2022-02-21 03:57:58,891 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2022-02-21 03:57:58,891 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:57:58,891 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:57:58,892 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 1, 1, 1, 1] [2022-02-21 03:57:58,892 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2022-02-21 03:57:58,892 INFO L791 eck$LassoCheckResult]: Stem: 320#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); 321#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~post4#1, main_#t~mem7#1, main_#t~post8#1, main_#t~post6#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~post12#1, main_#t~post9#1, main_~max~0#1, main_~#str1~0#1.base, main_~#str1~0#1.offset, main_~#str2~0#1.base, main_~#str2~0#1.offset, main_~i~0#1, main_~j~0#1;main_~max~0#1 := 5;call main_~#str1~0#1.base, main_~#str1~0#1.offset := #Ultimate.allocOnStack((if main_~max~0#1 % 4294967296 % 4294967296 <= 2147483647 then main_~max~0#1 % 4294967296 % 4294967296 else main_~max~0#1 % 4294967296 % 4294967296 - 4294967296));call main_~#str2~0#1.base, main_~#str2~0#1.offset := #Ultimate.allocOnStack((if main_~max~0#1 % 4294967296 % 4294967296 <= 2147483647 then main_~max~0#1 % 4294967296 % 4294967296 else main_~max~0#1 % 4294967296 % 4294967296 - 4294967296));havoc main_~i~0#1;havoc main_~j~0#1;main_~i~0#1 := 0; 329#L18-3 assume !!(main_~i~0#1 % 4294967296 < main_~max~0#1 % 4294967296);call write~int(main_#t~nondet5#1, main_~#str1~0#1.base, main_~#str1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; 323#L18-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 324#L18-3 assume !!(main_~i~0#1 % 4294967296 < main_~max~0#1 % 4294967296);call write~int(main_#t~nondet5#1, main_~#str1~0#1.base, main_~#str1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; 330#L18-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 336#L18-3 assume !!(main_~i~0#1 % 4294967296 < main_~max~0#1 % 4294967296);call write~int(main_#t~nondet5#1, main_~#str1~0#1.base, main_~#str1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; 335#L18-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 334#L18-3 assume !!(main_~i~0#1 % 4294967296 < main_~max~0#1 % 4294967296);call write~int(main_#t~nondet5#1, main_~#str1~0#1.base, main_~#str1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; 333#L18-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 332#L18-3 assume !(main_~i~0#1 % 4294967296 < main_~max~0#1 % 4294967296); 331#L18-4 call write~int(0, main_~#str1~0#1.base, main_~#str1~0#1.offset + (if (main_~max~0#1 - 1) % 4294967296 % 4294967296 <= 2147483647 then (main_~max~0#1 - 1) % 4294967296 % 4294967296 else (main_~max~0#1 - 1) % 4294967296 % 4294967296 - 4294967296), 1);main_~j~0#1 := 0;main_~i~0#1 := (if (main_~max~0#1 - 1) % 4294967296 % 4294967296 <= 2147483647 then (main_~max~0#1 - 1) % 4294967296 % 4294967296 else (main_~max~0#1 - 1) % 4294967296 % 4294967296 - 4294967296); 328#L26-3 [2022-02-21 03:57:58,892 INFO L793 eck$LassoCheckResult]: Loop: 328#L26-3 assume !!(main_~i~0#1 >= 0);call main_#t~mem7#1 := read~int(main_~#str1~0#1.base, main_~#str1~0#1.offset + main_~i~0#1, 1);call write~int(main_#t~mem7#1, main_~#str2~0#1.base, main_~#str2~0#1.offset + main_~j~0#1, 1);havoc main_#t~mem7#1;main_#t~post8#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 327#L26-2 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := main_#t~post6#1 - 1;havoc main_#t~post6#1; 328#L26-3 [2022-02-21 03:57:58,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:57:58,892 INFO L85 PathProgramCache]: Analyzing trace with hash 833936659, now seen corresponding path program 2 times [2022-02-21 03:57:58,893 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:57:58,893 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573663672] [2022-02-21 03:57:58,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:57:58,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:57:58,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:57:59,341 INFO L290 TraceCheckUtils]: 0: Hoare triple {378#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {378#true} is VALID [2022-02-21 03:57:59,342 INFO L290 TraceCheckUtils]: 1: Hoare triple {378#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~post4#1, main_#t~mem7#1, main_#t~post8#1, main_#t~post6#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~post12#1, main_#t~post9#1, main_~max~0#1, main_~#str1~0#1.base, main_~#str1~0#1.offset, main_~#str2~0#1.base, main_~#str2~0#1.offset, main_~i~0#1, main_~j~0#1;main_~max~0#1 := 5;call main_~#str1~0#1.base, main_~#str1~0#1.offset := #Ultimate.allocOnStack((if main_~max~0#1 % 4294967296 % 4294967296 <= 2147483647 then main_~max~0#1 % 4294967296 % 4294967296 else main_~max~0#1 % 4294967296 % 4294967296 - 4294967296));call main_~#str2~0#1.base, main_~#str2~0#1.offset := #Ultimate.allocOnStack((if main_~max~0#1 % 4294967296 % 4294967296 <= 2147483647 then main_~max~0#1 % 4294967296 % 4294967296 else main_~max~0#1 % 4294967296 % 4294967296 - 4294967296));havoc main_~i~0#1;havoc main_~j~0#1;main_~i~0#1 := 0; {380#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= (div |ULTIMATE.start_main_~max~0#1| 4294967296) 0) (<= 5 |ULTIMATE.start_main_~max~0#1|))} is VALID [2022-02-21 03:57:59,342 INFO L290 TraceCheckUtils]: 2: Hoare triple {380#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= (div |ULTIMATE.start_main_~max~0#1| 4294967296) 0) (<= 5 |ULTIMATE.start_main_~max~0#1|))} assume !!(main_~i~0#1 % 4294967296 < main_~max~0#1 % 4294967296);call write~int(main_#t~nondet5#1, main_~#str1~0#1.base, main_~#str1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; {380#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= (div |ULTIMATE.start_main_~max~0#1| 4294967296) 0) (<= 5 |ULTIMATE.start_main_~max~0#1|))} is VALID [2022-02-21 03:57:59,343 INFO L290 TraceCheckUtils]: 3: Hoare triple {380#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= (div |ULTIMATE.start_main_~max~0#1| 4294967296) 0) (<= 5 |ULTIMATE.start_main_~max~0#1|))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {381#(and (or (<= (div |ULTIMATE.start_main_~max~0#1| 4294967296) 0) (and (or (and (<= |ULTIMATE.start_main_~max~0#1| (+ |ULTIMATE.start_main_~i~0#1| 4294967300)) (not (<= |ULTIMATE.start_main_~max~0#1| (+ 2147483647 (* (div |ULTIMATE.start_main_~max~0#1| 4294967296) 4294967296))))) (<= |ULTIMATE.start_main_~max~0#1| (+ |ULTIMATE.start_main_~i~0#1| 4))) (= |ULTIMATE.start_main_~#str1~0#1.offset| 0) (or (and (not (<= |ULTIMATE.start_main_~max~0#1| (+ 2147483647 (* (div |ULTIMATE.start_main_~max~0#1| 4294967296) 4294967296)))) (= (+ |ULTIMATE.start_main_~max~0#1| (- 4294967296) (* (div |ULTIMATE.start_main_~max~0#1| 4294967296) (- 4294967296)) (* (- 1) (select |#length| |ULTIMATE.start_main_~#str1~0#1.base|))) 0)) (and (= (+ |ULTIMATE.start_main_~max~0#1| (* (div |ULTIMATE.start_main_~max~0#1| 4294967296) (- 4294967296)) (* (- 1) (select |#length| |ULTIMATE.start_main_~#str1~0#1.base|))) 0) (<= |ULTIMATE.start_main_~max~0#1| (+ 2147483647 (* (div |ULTIMATE.start_main_~max~0#1| 4294967296) 4294967296))))))) (or (not (<= (div |ULTIMATE.start_main_~max~0#1| 4294967296) 0)) (and (<= (+ |ULTIMATE.start_main_~i~0#1| 4) |ULTIMATE.start_main_~max~0#1|) (<= 1 |ULTIMATE.start_main_~i~0#1|))))} is VALID [2022-02-21 03:57:59,344 INFO L290 TraceCheckUtils]: 4: Hoare triple {381#(and (or (<= (div |ULTIMATE.start_main_~max~0#1| 4294967296) 0) (and (or (and (<= |ULTIMATE.start_main_~max~0#1| (+ |ULTIMATE.start_main_~i~0#1| 4294967300)) (not (<= |ULTIMATE.start_main_~max~0#1| (+ 2147483647 (* (div |ULTIMATE.start_main_~max~0#1| 4294967296) 4294967296))))) (<= |ULTIMATE.start_main_~max~0#1| (+ |ULTIMATE.start_main_~i~0#1| 4))) (= |ULTIMATE.start_main_~#str1~0#1.offset| 0) (or (and (not (<= |ULTIMATE.start_main_~max~0#1| (+ 2147483647 (* (div |ULTIMATE.start_main_~max~0#1| 4294967296) 4294967296)))) (= (+ |ULTIMATE.start_main_~max~0#1| (- 4294967296) (* (div |ULTIMATE.start_main_~max~0#1| 4294967296) (- 4294967296)) (* (- 1) (select |#length| |ULTIMATE.start_main_~#str1~0#1.base|))) 0)) (and (= (+ |ULTIMATE.start_main_~max~0#1| (* (div |ULTIMATE.start_main_~max~0#1| 4294967296) (- 4294967296)) (* (- 1) (select |#length| |ULTIMATE.start_main_~#str1~0#1.base|))) 0) (<= |ULTIMATE.start_main_~max~0#1| (+ 2147483647 (* (div |ULTIMATE.start_main_~max~0#1| 4294967296) 4294967296))))))) (or (not (<= (div |ULTIMATE.start_main_~max~0#1| 4294967296) 0)) (and (<= (+ |ULTIMATE.start_main_~i~0#1| 4) |ULTIMATE.start_main_~max~0#1|) (<= 1 |ULTIMATE.start_main_~i~0#1|))))} assume !!(main_~i~0#1 % 4294967296 < main_~max~0#1 % 4294967296);call write~int(main_#t~nondet5#1, main_~#str1~0#1.base, main_~#str1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; {381#(and (or (<= (div |ULTIMATE.start_main_~max~0#1| 4294967296) 0) (and (or (and (<= |ULTIMATE.start_main_~max~0#1| (+ |ULTIMATE.start_main_~i~0#1| 4294967300)) (not (<= |ULTIMATE.start_main_~max~0#1| (+ 2147483647 (* (div |ULTIMATE.start_main_~max~0#1| 4294967296) 4294967296))))) (<= |ULTIMATE.start_main_~max~0#1| (+ |ULTIMATE.start_main_~i~0#1| 4))) (= |ULTIMATE.start_main_~#str1~0#1.offset| 0) (or (and (not (<= |ULTIMATE.start_main_~max~0#1| (+ 2147483647 (* (div |ULTIMATE.start_main_~max~0#1| 4294967296) 4294967296)))) (= (+ |ULTIMATE.start_main_~max~0#1| (- 4294967296) (* (div |ULTIMATE.start_main_~max~0#1| 4294967296) (- 4294967296)) (* (- 1) (select |#length| |ULTIMATE.start_main_~#str1~0#1.base|))) 0)) (and (= (+ |ULTIMATE.start_main_~max~0#1| (* (div |ULTIMATE.start_main_~max~0#1| 4294967296) (- 4294967296)) (* (- 1) (select |#length| |ULTIMATE.start_main_~#str1~0#1.base|))) 0) (<= |ULTIMATE.start_main_~max~0#1| (+ 2147483647 (* (div |ULTIMATE.start_main_~max~0#1| 4294967296) 4294967296))))))) (or (not (<= (div |ULTIMATE.start_main_~max~0#1| 4294967296) 0)) (and (<= (+ |ULTIMATE.start_main_~i~0#1| 4) |ULTIMATE.start_main_~max~0#1|) (<= 1 |ULTIMATE.start_main_~i~0#1|))))} is VALID [2022-02-21 03:57:59,345 INFO L290 TraceCheckUtils]: 5: Hoare triple {381#(and (or (<= (div |ULTIMATE.start_main_~max~0#1| 4294967296) 0) (and (or (and (<= |ULTIMATE.start_main_~max~0#1| (+ |ULTIMATE.start_main_~i~0#1| 4294967300)) (not (<= |ULTIMATE.start_main_~max~0#1| (+ 2147483647 (* (div |ULTIMATE.start_main_~max~0#1| 4294967296) 4294967296))))) (<= |ULTIMATE.start_main_~max~0#1| (+ |ULTIMATE.start_main_~i~0#1| 4))) (= |ULTIMATE.start_main_~#str1~0#1.offset| 0) (or (and (not (<= |ULTIMATE.start_main_~max~0#1| (+ 2147483647 (* (div |ULTIMATE.start_main_~max~0#1| 4294967296) 4294967296)))) (= (+ |ULTIMATE.start_main_~max~0#1| (- 4294967296) (* (div |ULTIMATE.start_main_~max~0#1| 4294967296) (- 4294967296)) (* (- 1) (select |#length| |ULTIMATE.start_main_~#str1~0#1.base|))) 0)) (and (= (+ |ULTIMATE.start_main_~max~0#1| (* (div |ULTIMATE.start_main_~max~0#1| 4294967296) (- 4294967296)) (* (- 1) (select |#length| |ULTIMATE.start_main_~#str1~0#1.base|))) 0) (<= |ULTIMATE.start_main_~max~0#1| (+ 2147483647 (* (div |ULTIMATE.start_main_~max~0#1| 4294967296) 4294967296))))))) (or (not (<= (div |ULTIMATE.start_main_~max~0#1| 4294967296) 0)) (and (<= (+ |ULTIMATE.start_main_~i~0#1| 4) |ULTIMATE.start_main_~max~0#1|) (<= 1 |ULTIMATE.start_main_~i~0#1|))))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {382#(and (or (<= (div |ULTIMATE.start_main_~max~0#1| 4294967296) 0) (and (or (<= |ULTIMATE.start_main_~max~0#1| (+ 3 |ULTIMATE.start_main_~i~0#1|)) (and (not (<= |ULTIMATE.start_main_~max~0#1| (+ 2147483647 (* (div |ULTIMATE.start_main_~max~0#1| 4294967296) 4294967296)))) (<= |ULTIMATE.start_main_~max~0#1| (+ |ULTIMATE.start_main_~i~0#1| 4294967299)))) (= |ULTIMATE.start_main_~#str1~0#1.offset| 0) (or (and (not (<= |ULTIMATE.start_main_~max~0#1| (+ 2147483647 (* (div |ULTIMATE.start_main_~max~0#1| 4294967296) 4294967296)))) (= (+ |ULTIMATE.start_main_~max~0#1| (- 4294967296) (* (div |ULTIMATE.start_main_~max~0#1| 4294967296) (- 4294967296)) (* (- 1) (select |#length| |ULTIMATE.start_main_~#str1~0#1.base|))) 0)) (and (= (+ |ULTIMATE.start_main_~max~0#1| (* (div |ULTIMATE.start_main_~max~0#1| 4294967296) (- 4294967296)) (* (- 1) (select |#length| |ULTIMATE.start_main_~#str1~0#1.base|))) 0) (<= |ULTIMATE.start_main_~max~0#1| (+ 2147483647 (* (div |ULTIMATE.start_main_~max~0#1| 4294967296) 4294967296))))))) (or (and (<= 2 |ULTIMATE.start_main_~i~0#1|) (<= (+ 3 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~max~0#1|)) (not (<= (div |ULTIMATE.start_main_~max~0#1| 4294967296) 0))))} is VALID [2022-02-21 03:57:59,346 INFO L290 TraceCheckUtils]: 6: Hoare triple {382#(and (or (<= (div |ULTIMATE.start_main_~max~0#1| 4294967296) 0) (and (or (<= |ULTIMATE.start_main_~max~0#1| (+ 3 |ULTIMATE.start_main_~i~0#1|)) (and (not (<= |ULTIMATE.start_main_~max~0#1| (+ 2147483647 (* (div |ULTIMATE.start_main_~max~0#1| 4294967296) 4294967296)))) (<= |ULTIMATE.start_main_~max~0#1| (+ |ULTIMATE.start_main_~i~0#1| 4294967299)))) (= |ULTIMATE.start_main_~#str1~0#1.offset| 0) (or (and (not (<= |ULTIMATE.start_main_~max~0#1| (+ 2147483647 (* (div |ULTIMATE.start_main_~max~0#1| 4294967296) 4294967296)))) (= (+ |ULTIMATE.start_main_~max~0#1| (- 4294967296) (* (div |ULTIMATE.start_main_~max~0#1| 4294967296) (- 4294967296)) (* (- 1) (select |#length| |ULTIMATE.start_main_~#str1~0#1.base|))) 0)) (and (= (+ |ULTIMATE.start_main_~max~0#1| (* (div |ULTIMATE.start_main_~max~0#1| 4294967296) (- 4294967296)) (* (- 1) (select |#length| |ULTIMATE.start_main_~#str1~0#1.base|))) 0) (<= |ULTIMATE.start_main_~max~0#1| (+ 2147483647 (* (div |ULTIMATE.start_main_~max~0#1| 4294967296) 4294967296))))))) (or (and (<= 2 |ULTIMATE.start_main_~i~0#1|) (<= (+ 3 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~max~0#1|)) (not (<= (div |ULTIMATE.start_main_~max~0#1| 4294967296) 0))))} assume !!(main_~i~0#1 % 4294967296 < main_~max~0#1 % 4294967296);call write~int(main_#t~nondet5#1, main_~#str1~0#1.base, main_~#str1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; {382#(and (or (<= (div |ULTIMATE.start_main_~max~0#1| 4294967296) 0) (and (or (<= |ULTIMATE.start_main_~max~0#1| (+ 3 |ULTIMATE.start_main_~i~0#1|)) (and (not (<= |ULTIMATE.start_main_~max~0#1| (+ 2147483647 (* (div |ULTIMATE.start_main_~max~0#1| 4294967296) 4294967296)))) (<= |ULTIMATE.start_main_~max~0#1| (+ |ULTIMATE.start_main_~i~0#1| 4294967299)))) (= |ULTIMATE.start_main_~#str1~0#1.offset| 0) (or (and (not (<= |ULTIMATE.start_main_~max~0#1| (+ 2147483647 (* (div |ULTIMATE.start_main_~max~0#1| 4294967296) 4294967296)))) (= (+ |ULTIMATE.start_main_~max~0#1| (- 4294967296) (* (div |ULTIMATE.start_main_~max~0#1| 4294967296) (- 4294967296)) (* (- 1) (select |#length| |ULTIMATE.start_main_~#str1~0#1.base|))) 0)) (and (= (+ |ULTIMATE.start_main_~max~0#1| (* (div |ULTIMATE.start_main_~max~0#1| 4294967296) (- 4294967296)) (* (- 1) (select |#length| |ULTIMATE.start_main_~#str1~0#1.base|))) 0) (<= |ULTIMATE.start_main_~max~0#1| (+ 2147483647 (* (div |ULTIMATE.start_main_~max~0#1| 4294967296) 4294967296))))))) (or (and (<= 2 |ULTIMATE.start_main_~i~0#1|) (<= (+ 3 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~max~0#1|)) (not (<= (div |ULTIMATE.start_main_~max~0#1| 4294967296) 0))))} is VALID [2022-02-21 03:57:59,350 INFO L290 TraceCheckUtils]: 7: Hoare triple {382#(and (or (<= (div |ULTIMATE.start_main_~max~0#1| 4294967296) 0) (and (or (<= |ULTIMATE.start_main_~max~0#1| (+ 3 |ULTIMATE.start_main_~i~0#1|)) (and (not (<= |ULTIMATE.start_main_~max~0#1| (+ 2147483647 (* (div |ULTIMATE.start_main_~max~0#1| 4294967296) 4294967296)))) (<= |ULTIMATE.start_main_~max~0#1| (+ |ULTIMATE.start_main_~i~0#1| 4294967299)))) (= |ULTIMATE.start_main_~#str1~0#1.offset| 0) (or (and (not (<= |ULTIMATE.start_main_~max~0#1| (+ 2147483647 (* (div |ULTIMATE.start_main_~max~0#1| 4294967296) 4294967296)))) (= (+ |ULTIMATE.start_main_~max~0#1| (- 4294967296) (* (div |ULTIMATE.start_main_~max~0#1| 4294967296) (- 4294967296)) (* (- 1) (select |#length| |ULTIMATE.start_main_~#str1~0#1.base|))) 0)) (and (= (+ |ULTIMATE.start_main_~max~0#1| (* (div |ULTIMATE.start_main_~max~0#1| 4294967296) (- 4294967296)) (* (- 1) (select |#length| |ULTIMATE.start_main_~#str1~0#1.base|))) 0) (<= |ULTIMATE.start_main_~max~0#1| (+ 2147483647 (* (div |ULTIMATE.start_main_~max~0#1| 4294967296) 4294967296))))))) (or (and (<= 2 |ULTIMATE.start_main_~i~0#1|) (<= (+ 3 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~max~0#1|)) (not (<= (div |ULTIMATE.start_main_~max~0#1| 4294967296) 0))))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {383#(and (or (and (<= 3 |ULTIMATE.start_main_~i~0#1|) (<= (+ 2 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~max~0#1|)) (not (<= (div |ULTIMATE.start_main_~max~0#1| 4294967296) 0))) (or (and (or (<= |ULTIMATE.start_main_~max~0#1| (+ 2 |ULTIMATE.start_main_~i~0#1|)) (and (not (<= |ULTIMATE.start_main_~max~0#1| (+ 2147483647 (* (div |ULTIMATE.start_main_~max~0#1| 4294967296) 4294967296)))) (<= |ULTIMATE.start_main_~max~0#1| (+ |ULTIMATE.start_main_~i~0#1| 4294967298)))) (= |ULTIMATE.start_main_~#str1~0#1.offset| 0) (or (and (not (<= |ULTIMATE.start_main_~max~0#1| (+ 2147483647 (* (div |ULTIMATE.start_main_~max~0#1| 4294967296) 4294967296)))) (= (+ |ULTIMATE.start_main_~max~0#1| (- 4294967296) (* (div |ULTIMATE.start_main_~max~0#1| 4294967296) (- 4294967296)) (* (- 1) (select |#length| |ULTIMATE.start_main_~#str1~0#1.base|))) 0)) (and (= (+ |ULTIMATE.start_main_~max~0#1| (* (div |ULTIMATE.start_main_~max~0#1| 4294967296) (- 4294967296)) (* (- 1) (select |#length| |ULTIMATE.start_main_~#str1~0#1.base|))) 0) (<= |ULTIMATE.start_main_~max~0#1| (+ 2147483647 (* (div |ULTIMATE.start_main_~max~0#1| 4294967296) 4294967296)))))) (<= (div |ULTIMATE.start_main_~max~0#1| 4294967296) 0)))} is VALID [2022-02-21 03:57:59,351 INFO L290 TraceCheckUtils]: 8: Hoare triple {383#(and (or (and (<= 3 |ULTIMATE.start_main_~i~0#1|) (<= (+ 2 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~max~0#1|)) (not (<= (div |ULTIMATE.start_main_~max~0#1| 4294967296) 0))) (or (and (or (<= |ULTIMATE.start_main_~max~0#1| (+ 2 |ULTIMATE.start_main_~i~0#1|)) (and (not (<= |ULTIMATE.start_main_~max~0#1| (+ 2147483647 (* (div |ULTIMATE.start_main_~max~0#1| 4294967296) 4294967296)))) (<= |ULTIMATE.start_main_~max~0#1| (+ |ULTIMATE.start_main_~i~0#1| 4294967298)))) (= |ULTIMATE.start_main_~#str1~0#1.offset| 0) (or (and (not (<= |ULTIMATE.start_main_~max~0#1| (+ 2147483647 (* (div |ULTIMATE.start_main_~max~0#1| 4294967296) 4294967296)))) (= (+ |ULTIMATE.start_main_~max~0#1| (- 4294967296) (* (div |ULTIMATE.start_main_~max~0#1| 4294967296) (- 4294967296)) (* (- 1) (select |#length| |ULTIMATE.start_main_~#str1~0#1.base|))) 0)) (and (= (+ |ULTIMATE.start_main_~max~0#1| (* (div |ULTIMATE.start_main_~max~0#1| 4294967296) (- 4294967296)) (* (- 1) (select |#length| |ULTIMATE.start_main_~#str1~0#1.base|))) 0) (<= |ULTIMATE.start_main_~max~0#1| (+ 2147483647 (* (div |ULTIMATE.start_main_~max~0#1| 4294967296) 4294967296)))))) (<= (div |ULTIMATE.start_main_~max~0#1| 4294967296) 0)))} assume !!(main_~i~0#1 % 4294967296 < main_~max~0#1 % 4294967296);call write~int(main_#t~nondet5#1, main_~#str1~0#1.base, main_~#str1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; {384#(and (<= (div |ULTIMATE.start_main_~max~0#1| 4294967296) 0) (<= 3 |ULTIMATE.start_main_~i~0#1|) (<= (+ 2 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~max~0#1|))} is VALID [2022-02-21 03:57:59,352 INFO L290 TraceCheckUtils]: 9: Hoare triple {384#(and (<= (div |ULTIMATE.start_main_~max~0#1| 4294967296) 0) (<= 3 |ULTIMATE.start_main_~i~0#1|) (<= (+ 2 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~max~0#1|))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {385#(and (<= (div |ULTIMATE.start_main_~max~0#1| 4294967296) (div |ULTIMATE.start_main_~i~0#1| 4294967296)) (<= (div |ULTIMATE.start_main_~max~0#1| 4294967296) 0) (<= (+ |ULTIMATE.start_main_~i~0#1| 1) |ULTIMATE.start_main_~max~0#1|))} is VALID [2022-02-21 03:57:59,352 INFO L290 TraceCheckUtils]: 10: Hoare triple {385#(and (<= (div |ULTIMATE.start_main_~max~0#1| 4294967296) (div |ULTIMATE.start_main_~i~0#1| 4294967296)) (<= (div |ULTIMATE.start_main_~max~0#1| 4294967296) 0) (<= (+ |ULTIMATE.start_main_~i~0#1| 1) |ULTIMATE.start_main_~max~0#1|))} assume !(main_~i~0#1 % 4294967296 < main_~max~0#1 % 4294967296); {379#false} is VALID [2022-02-21 03:57:59,352 INFO L290 TraceCheckUtils]: 11: Hoare triple {379#false} call write~int(0, main_~#str1~0#1.base, main_~#str1~0#1.offset + (if (main_~max~0#1 - 1) % 4294967296 % 4294967296 <= 2147483647 then (main_~max~0#1 - 1) % 4294967296 % 4294967296 else (main_~max~0#1 - 1) % 4294967296 % 4294967296 - 4294967296), 1);main_~j~0#1 := 0;main_~i~0#1 := (if (main_~max~0#1 - 1) % 4294967296 % 4294967296 <= 2147483647 then (main_~max~0#1 - 1) % 4294967296 % 4294967296 else (main_~max~0#1 - 1) % 4294967296 % 4294967296 - 4294967296); {379#false} is VALID [2022-02-21 03:57:59,353 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:57:59,353 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:57:59,353 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573663672] [2022-02-21 03:57:59,353 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1573663672] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:57:59,353 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1559913967] [2022-02-21 03:57:59,353 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-21 03:57:59,353 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:57:59,353 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:57:59,354 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 03:57:59,387 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-02-21 03:57:59,453 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-21 03:57:59,454 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-21 03:57:59,455 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 22 conjunts are in the unsatisfiable core [2022-02-21 03:57:59,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:57:59,463 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:57:59,499 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 03:57:59,505 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-02-21 03:57:59,506 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 11 [2022-02-21 03:57:59,693 INFO L290 TraceCheckUtils]: 0: Hoare triple {378#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {378#true} is VALID [2022-02-21 03:57:59,694 INFO L290 TraceCheckUtils]: 1: Hoare triple {378#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~post4#1, main_#t~mem7#1, main_#t~post8#1, main_#t~post6#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~post12#1, main_#t~post9#1, main_~max~0#1, main_~#str1~0#1.base, main_~#str1~0#1.offset, main_~#str2~0#1.base, main_~#str2~0#1.offset, main_~i~0#1, main_~j~0#1;main_~max~0#1 := 5;call main_~#str1~0#1.base, main_~#str1~0#1.offset := #Ultimate.allocOnStack((if main_~max~0#1 % 4294967296 % 4294967296 <= 2147483647 then main_~max~0#1 % 4294967296 % 4294967296 else main_~max~0#1 % 4294967296 % 4294967296 - 4294967296));call main_~#str2~0#1.base, main_~#str2~0#1.offset := #Ultimate.allocOnStack((if main_~max~0#1 % 4294967296 % 4294967296 <= 2147483647 then main_~max~0#1 % 4294967296 % 4294967296 else main_~max~0#1 % 4294967296 % 4294967296 - 4294967296));havoc main_~i~0#1;havoc main_~j~0#1;main_~i~0#1 := 0; {392#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= 5 |ULTIMATE.start_main_~max~0#1|) (= (select |#length| |ULTIMATE.start_main_~#str1~0#1.base|) (mod |ULTIMATE.start_main_~max~0#1| 4294967296)) (= |ULTIMATE.start_main_~#str1~0#1.offset| 0))} is VALID [2022-02-21 03:57:59,695 INFO L290 TraceCheckUtils]: 2: Hoare triple {392#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= 5 |ULTIMATE.start_main_~max~0#1|) (= (select |#length| |ULTIMATE.start_main_~#str1~0#1.base|) (mod |ULTIMATE.start_main_~max~0#1| 4294967296)) (= |ULTIMATE.start_main_~#str1~0#1.offset| 0))} assume !!(main_~i~0#1 % 4294967296 < main_~max~0#1 % 4294967296);call write~int(main_#t~nondet5#1, main_~#str1~0#1.base, main_~#str1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; {392#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= 5 |ULTIMATE.start_main_~max~0#1|) (= (select |#length| |ULTIMATE.start_main_~#str1~0#1.base|) (mod |ULTIMATE.start_main_~max~0#1| 4294967296)) (= |ULTIMATE.start_main_~#str1~0#1.offset| 0))} is VALID [2022-02-21 03:57:59,695 INFO L290 TraceCheckUtils]: 3: Hoare triple {392#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= 5 |ULTIMATE.start_main_~max~0#1|) (= (select |#length| |ULTIMATE.start_main_~#str1~0#1.base|) (mod |ULTIMATE.start_main_~max~0#1| 4294967296)) (= |ULTIMATE.start_main_~#str1~0#1.offset| 0))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {399#(and (= 0 (+ (- 1) |ULTIMATE.start_main_~i~0#1|)) (= 5 |ULTIMATE.start_main_~max~0#1|) (= (select |#length| |ULTIMATE.start_main_~#str1~0#1.base|) (mod |ULTIMATE.start_main_~max~0#1| 4294967296)) (= |ULTIMATE.start_main_~#str1~0#1.offset| 0))} is VALID [2022-02-21 03:57:59,696 INFO L290 TraceCheckUtils]: 4: Hoare triple {399#(and (= 0 (+ (- 1) |ULTIMATE.start_main_~i~0#1|)) (= 5 |ULTIMATE.start_main_~max~0#1|) (= (select |#length| |ULTIMATE.start_main_~#str1~0#1.base|) (mod |ULTIMATE.start_main_~max~0#1| 4294967296)) (= |ULTIMATE.start_main_~#str1~0#1.offset| 0))} assume !!(main_~i~0#1 % 4294967296 < main_~max~0#1 % 4294967296);call write~int(main_#t~nondet5#1, main_~#str1~0#1.base, main_~#str1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; {399#(and (= 0 (+ (- 1) |ULTIMATE.start_main_~i~0#1|)) (= 5 |ULTIMATE.start_main_~max~0#1|) (= (select |#length| |ULTIMATE.start_main_~#str1~0#1.base|) (mod |ULTIMATE.start_main_~max~0#1| 4294967296)) (= |ULTIMATE.start_main_~#str1~0#1.offset| 0))} is VALID [2022-02-21 03:57:59,696 INFO L290 TraceCheckUtils]: 5: Hoare triple {399#(and (= 0 (+ (- 1) |ULTIMATE.start_main_~i~0#1|)) (= 5 |ULTIMATE.start_main_~max~0#1|) (= (select |#length| |ULTIMATE.start_main_~#str1~0#1.base|) (mod |ULTIMATE.start_main_~max~0#1| 4294967296)) (= |ULTIMATE.start_main_~#str1~0#1.offset| 0))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {406#(and (= 5 |ULTIMATE.start_main_~max~0#1|) (= 2 |ULTIMATE.start_main_~i~0#1|) (= (select |#length| |ULTIMATE.start_main_~#str1~0#1.base|) (mod |ULTIMATE.start_main_~max~0#1| 4294967296)) (= |ULTIMATE.start_main_~#str1~0#1.offset| 0))} is VALID [2022-02-21 03:57:59,697 INFO L290 TraceCheckUtils]: 6: Hoare triple {406#(and (= 5 |ULTIMATE.start_main_~max~0#1|) (= 2 |ULTIMATE.start_main_~i~0#1|) (= (select |#length| |ULTIMATE.start_main_~#str1~0#1.base|) (mod |ULTIMATE.start_main_~max~0#1| 4294967296)) (= |ULTIMATE.start_main_~#str1~0#1.offset| 0))} assume !!(main_~i~0#1 % 4294967296 < main_~max~0#1 % 4294967296);call write~int(main_#t~nondet5#1, main_~#str1~0#1.base, main_~#str1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; {406#(and (= 5 |ULTIMATE.start_main_~max~0#1|) (= 2 |ULTIMATE.start_main_~i~0#1|) (= (select |#length| |ULTIMATE.start_main_~#str1~0#1.base|) (mod |ULTIMATE.start_main_~max~0#1| 4294967296)) (= |ULTIMATE.start_main_~#str1~0#1.offset| 0))} is VALID [2022-02-21 03:57:59,697 INFO L290 TraceCheckUtils]: 7: Hoare triple {406#(and (= 5 |ULTIMATE.start_main_~max~0#1|) (= 2 |ULTIMATE.start_main_~i~0#1|) (= (select |#length| |ULTIMATE.start_main_~#str1~0#1.base|) (mod |ULTIMATE.start_main_~max~0#1| 4294967296)) (= |ULTIMATE.start_main_~#str1~0#1.offset| 0))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {413#(and (= 5 |ULTIMATE.start_main_~max~0#1|) (= 2 (+ (- 1) |ULTIMATE.start_main_~i~0#1|)) (= (select |#length| |ULTIMATE.start_main_~#str1~0#1.base|) (mod |ULTIMATE.start_main_~max~0#1| 4294967296)) (= |ULTIMATE.start_main_~#str1~0#1.offset| 0))} is VALID [2022-02-21 03:57:59,698 INFO L290 TraceCheckUtils]: 8: Hoare triple {413#(and (= 5 |ULTIMATE.start_main_~max~0#1|) (= 2 (+ (- 1) |ULTIMATE.start_main_~i~0#1|)) (= (select |#length| |ULTIMATE.start_main_~#str1~0#1.base|) (mod |ULTIMATE.start_main_~max~0#1| 4294967296)) (= |ULTIMATE.start_main_~#str1~0#1.offset| 0))} assume !!(main_~i~0#1 % 4294967296 < main_~max~0#1 % 4294967296);call write~int(main_#t~nondet5#1, main_~#str1~0#1.base, main_~#str1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; {413#(and (= 5 |ULTIMATE.start_main_~max~0#1|) (= 2 (+ (- 1) |ULTIMATE.start_main_~i~0#1|)) (= (select |#length| |ULTIMATE.start_main_~#str1~0#1.base|) (mod |ULTIMATE.start_main_~max~0#1| 4294967296)) (= |ULTIMATE.start_main_~#str1~0#1.offset| 0))} is VALID [2022-02-21 03:57:59,698 INFO L290 TraceCheckUtils]: 9: Hoare triple {413#(and (= 5 |ULTIMATE.start_main_~max~0#1|) (= 2 (+ (- 1) |ULTIMATE.start_main_~i~0#1|)) (= (select |#length| |ULTIMATE.start_main_~#str1~0#1.base|) (mod |ULTIMATE.start_main_~max~0#1| 4294967296)) (= |ULTIMATE.start_main_~#str1~0#1.offset| 0))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {420#(and (= |ULTIMATE.start_main_~i~0#1| 4) (= 5 |ULTIMATE.start_main_~max~0#1|) (= (select |#length| |ULTIMATE.start_main_~#str1~0#1.base|) (mod |ULTIMATE.start_main_~max~0#1| 4294967296)) (= |ULTIMATE.start_main_~#str1~0#1.offset| 0))} is VALID [2022-02-21 03:57:59,698 INFO L290 TraceCheckUtils]: 10: Hoare triple {420#(and (= |ULTIMATE.start_main_~i~0#1| 4) (= 5 |ULTIMATE.start_main_~max~0#1|) (= (select |#length| |ULTIMATE.start_main_~#str1~0#1.base|) (mod |ULTIMATE.start_main_~max~0#1| 4294967296)) (= |ULTIMATE.start_main_~#str1~0#1.offset| 0))} assume !(main_~i~0#1 % 4294967296 < main_~max~0#1 % 4294967296); {379#false} is VALID [2022-02-21 03:57:59,701 INFO L290 TraceCheckUtils]: 11: Hoare triple {379#false} call write~int(0, main_~#str1~0#1.base, main_~#str1~0#1.offset + (if (main_~max~0#1 - 1) % 4294967296 % 4294967296 <= 2147483647 then (main_~max~0#1 - 1) % 4294967296 % 4294967296 else (main_~max~0#1 - 1) % 4294967296 % 4294967296 - 4294967296), 1);main_~j~0#1 := 0;main_~i~0#1 := (if (main_~max~0#1 - 1) % 4294967296 % 4294967296 <= 2147483647 then (main_~max~0#1 - 1) % 4294967296 % 4294967296 else (main_~max~0#1 - 1) % 4294967296 % 4294967296 - 4294967296); {379#false} is VALID [2022-02-21 03:57:59,701 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:57:59,701 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:58:00,627 INFO L290 TraceCheckUtils]: 11: Hoare triple {427#(or (and (not (<= (+ (mod (+ |ULTIMATE.start_main_~max~0#1| 4294967295) 4294967296) |ULTIMATE.start_main_~#str1~0#1.offset| 1) (select |#length| |ULTIMATE.start_main_~#str1~0#1.base|))) (or (<= (mod (+ |ULTIMATE.start_main_~max~0#1| 4294967295) 4294967296) 2147483647) (not (<= (+ (mod (+ |ULTIMATE.start_main_~max~0#1| 4294967295) 4294967296) |ULTIMATE.start_main_~#str1~0#1.offset|) (+ 4294967295 (select |#length| |ULTIMATE.start_main_~#str1~0#1.base|)))))) (and (not (<= 4294967296 (+ (mod (+ |ULTIMATE.start_main_~max~0#1| 4294967295) 4294967296) |ULTIMATE.start_main_~#str1~0#1.offset|))) (or (not (<= (mod (+ |ULTIMATE.start_main_~max~0#1| 4294967295) 4294967296) 2147483647)) (not (<= 0 (+ (mod (+ |ULTIMATE.start_main_~max~0#1| 4294967295) 4294967296) |ULTIMATE.start_main_~#str1~0#1.offset|))))))} call write~int(0, main_~#str1~0#1.base, main_~#str1~0#1.offset + (if (main_~max~0#1 - 1) % 4294967296 % 4294967296 <= 2147483647 then (main_~max~0#1 - 1) % 4294967296 % 4294967296 else (main_~max~0#1 - 1) % 4294967296 % 4294967296 - 4294967296), 1);main_~j~0#1 := 0;main_~i~0#1 := (if (main_~max~0#1 - 1) % 4294967296 % 4294967296 <= 2147483647 then (main_~max~0#1 - 1) % 4294967296 % 4294967296 else (main_~max~0#1 - 1) % 4294967296 % 4294967296 - 4294967296); {379#false} is VALID [2022-02-21 03:58:00,628 INFO L290 TraceCheckUtils]: 10: Hoare triple {431#(or (and (not (<= (+ (mod (+ |ULTIMATE.start_main_~max~0#1| 4294967295) 4294967296) |ULTIMATE.start_main_~#str1~0#1.offset| 1) (select |#length| |ULTIMATE.start_main_~#str1~0#1.base|))) (or (<= (mod (+ |ULTIMATE.start_main_~max~0#1| 4294967295) 4294967296) 2147483647) (not (<= (+ (mod (+ |ULTIMATE.start_main_~max~0#1| 4294967295) 4294967296) |ULTIMATE.start_main_~#str1~0#1.offset|) (+ 4294967295 (select |#length| |ULTIMATE.start_main_~#str1~0#1.base|)))))) (and (not (<= 4294967296 (+ (mod (+ |ULTIMATE.start_main_~max~0#1| 4294967295) 4294967296) |ULTIMATE.start_main_~#str1~0#1.offset|))) (or (not (<= (mod (+ |ULTIMATE.start_main_~max~0#1| 4294967295) 4294967296) 2147483647)) (not (<= 0 (+ (mod (+ |ULTIMATE.start_main_~max~0#1| 4294967295) 4294967296) |ULTIMATE.start_main_~#str1~0#1.offset|))))) (< (mod |ULTIMATE.start_main_~i~0#1| 4294967296) (mod |ULTIMATE.start_main_~max~0#1| 4294967296)))} assume !(main_~i~0#1 % 4294967296 < main_~max~0#1 % 4294967296); {427#(or (and (not (<= (+ (mod (+ |ULTIMATE.start_main_~max~0#1| 4294967295) 4294967296) |ULTIMATE.start_main_~#str1~0#1.offset| 1) (select |#length| |ULTIMATE.start_main_~#str1~0#1.base|))) (or (<= (mod (+ |ULTIMATE.start_main_~max~0#1| 4294967295) 4294967296) 2147483647) (not (<= (+ (mod (+ |ULTIMATE.start_main_~max~0#1| 4294967295) 4294967296) |ULTIMATE.start_main_~#str1~0#1.offset|) (+ 4294967295 (select |#length| |ULTIMATE.start_main_~#str1~0#1.base|)))))) (and (not (<= 4294967296 (+ (mod (+ |ULTIMATE.start_main_~max~0#1| 4294967295) 4294967296) |ULTIMATE.start_main_~#str1~0#1.offset|))) (or (not (<= (mod (+ |ULTIMATE.start_main_~max~0#1| 4294967295) 4294967296) 2147483647)) (not (<= 0 (+ (mod (+ |ULTIMATE.start_main_~max~0#1| 4294967295) 4294967296) |ULTIMATE.start_main_~#str1~0#1.offset|))))))} is VALID [2022-02-21 03:58:00,629 INFO L290 TraceCheckUtils]: 9: Hoare triple {435#(or (and (not (<= (+ (mod (+ |ULTIMATE.start_main_~max~0#1| 4294967295) 4294967296) |ULTIMATE.start_main_~#str1~0#1.offset| 1) (select |#length| |ULTIMATE.start_main_~#str1~0#1.base|))) (or (<= (mod (+ |ULTIMATE.start_main_~max~0#1| 4294967295) 4294967296) 2147483647) (not (<= (+ (mod (+ |ULTIMATE.start_main_~max~0#1| 4294967295) 4294967296) |ULTIMATE.start_main_~#str1~0#1.offset|) (+ 4294967295 (select |#length| |ULTIMATE.start_main_~#str1~0#1.base|)))))) (and (not (<= 4294967296 (+ (mod (+ |ULTIMATE.start_main_~max~0#1| 4294967295) 4294967296) |ULTIMATE.start_main_~#str1~0#1.offset|))) (or (not (<= (mod (+ |ULTIMATE.start_main_~max~0#1| 4294967295) 4294967296) 2147483647)) (not (<= 0 (+ (mod (+ |ULTIMATE.start_main_~max~0#1| 4294967295) 4294967296) |ULTIMATE.start_main_~#str1~0#1.offset|))))) (< (mod (+ |ULTIMATE.start_main_~i~0#1| 1) 4294967296) (mod |ULTIMATE.start_main_~max~0#1| 4294967296)))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {431#(or (and (not (<= (+ (mod (+ |ULTIMATE.start_main_~max~0#1| 4294967295) 4294967296) |ULTIMATE.start_main_~#str1~0#1.offset| 1) (select |#length| |ULTIMATE.start_main_~#str1~0#1.base|))) (or (<= (mod (+ |ULTIMATE.start_main_~max~0#1| 4294967295) 4294967296) 2147483647) (not (<= (+ (mod (+ |ULTIMATE.start_main_~max~0#1| 4294967295) 4294967296) |ULTIMATE.start_main_~#str1~0#1.offset|) (+ 4294967295 (select |#length| |ULTIMATE.start_main_~#str1~0#1.base|)))))) (and (not (<= 4294967296 (+ (mod (+ |ULTIMATE.start_main_~max~0#1| 4294967295) 4294967296) |ULTIMATE.start_main_~#str1~0#1.offset|))) (or (not (<= (mod (+ |ULTIMATE.start_main_~max~0#1| 4294967295) 4294967296) 2147483647)) (not (<= 0 (+ (mod (+ |ULTIMATE.start_main_~max~0#1| 4294967295) 4294967296) |ULTIMATE.start_main_~#str1~0#1.offset|))))) (< (mod |ULTIMATE.start_main_~i~0#1| 4294967296) (mod |ULTIMATE.start_main_~max~0#1| 4294967296)))} is VALID [2022-02-21 03:58:00,631 INFO L290 TraceCheckUtils]: 8: Hoare triple {435#(or (and (not (<= (+ (mod (+ |ULTIMATE.start_main_~max~0#1| 4294967295) 4294967296) |ULTIMATE.start_main_~#str1~0#1.offset| 1) (select |#length| |ULTIMATE.start_main_~#str1~0#1.base|))) (or (<= (mod (+ |ULTIMATE.start_main_~max~0#1| 4294967295) 4294967296) 2147483647) (not (<= (+ (mod (+ |ULTIMATE.start_main_~max~0#1| 4294967295) 4294967296) |ULTIMATE.start_main_~#str1~0#1.offset|) (+ 4294967295 (select |#length| |ULTIMATE.start_main_~#str1~0#1.base|)))))) (and (not (<= 4294967296 (+ (mod (+ |ULTIMATE.start_main_~max~0#1| 4294967295) 4294967296) |ULTIMATE.start_main_~#str1~0#1.offset|))) (or (not (<= (mod (+ |ULTIMATE.start_main_~max~0#1| 4294967295) 4294967296) 2147483647)) (not (<= 0 (+ (mod (+ |ULTIMATE.start_main_~max~0#1| 4294967295) 4294967296) |ULTIMATE.start_main_~#str1~0#1.offset|))))) (< (mod (+ |ULTIMATE.start_main_~i~0#1| 1) 4294967296) (mod |ULTIMATE.start_main_~max~0#1| 4294967296)))} assume !!(main_~i~0#1 % 4294967296 < main_~max~0#1 % 4294967296);call write~int(main_#t~nondet5#1, main_~#str1~0#1.base, main_~#str1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; {435#(or (and (not (<= (+ (mod (+ |ULTIMATE.start_main_~max~0#1| 4294967295) 4294967296) |ULTIMATE.start_main_~#str1~0#1.offset| 1) (select |#length| |ULTIMATE.start_main_~#str1~0#1.base|))) (or (<= (mod (+ |ULTIMATE.start_main_~max~0#1| 4294967295) 4294967296) 2147483647) (not (<= (+ (mod (+ |ULTIMATE.start_main_~max~0#1| 4294967295) 4294967296) |ULTIMATE.start_main_~#str1~0#1.offset|) (+ 4294967295 (select |#length| |ULTIMATE.start_main_~#str1~0#1.base|)))))) (and (not (<= 4294967296 (+ (mod (+ |ULTIMATE.start_main_~max~0#1| 4294967295) 4294967296) |ULTIMATE.start_main_~#str1~0#1.offset|))) (or (not (<= (mod (+ |ULTIMATE.start_main_~max~0#1| 4294967295) 4294967296) 2147483647)) (not (<= 0 (+ (mod (+ |ULTIMATE.start_main_~max~0#1| 4294967295) 4294967296) |ULTIMATE.start_main_~#str1~0#1.offset|))))) (< (mod (+ |ULTIMATE.start_main_~i~0#1| 1) 4294967296) (mod |ULTIMATE.start_main_~max~0#1| 4294967296)))} is VALID [2022-02-21 03:58:00,635 INFO L290 TraceCheckUtils]: 7: Hoare triple {442#(or (< (mod (+ 2 |ULTIMATE.start_main_~i~0#1|) 4294967296) (mod |ULTIMATE.start_main_~max~0#1| 4294967296)) (and (not (<= (+ (mod (+ |ULTIMATE.start_main_~max~0#1| 4294967295) 4294967296) |ULTIMATE.start_main_~#str1~0#1.offset| 1) (select |#length| |ULTIMATE.start_main_~#str1~0#1.base|))) (or (<= (mod (+ |ULTIMATE.start_main_~max~0#1| 4294967295) 4294967296) 2147483647) (not (<= (+ (mod (+ |ULTIMATE.start_main_~max~0#1| 4294967295) 4294967296) |ULTIMATE.start_main_~#str1~0#1.offset|) (+ 4294967295 (select |#length| |ULTIMATE.start_main_~#str1~0#1.base|)))))) (and (not (<= 4294967296 (+ (mod (+ |ULTIMATE.start_main_~max~0#1| 4294967295) 4294967296) |ULTIMATE.start_main_~#str1~0#1.offset|))) (or (not (<= (mod (+ |ULTIMATE.start_main_~max~0#1| 4294967295) 4294967296) 2147483647)) (not (<= 0 (+ (mod (+ |ULTIMATE.start_main_~max~0#1| 4294967295) 4294967296) |ULTIMATE.start_main_~#str1~0#1.offset|))))))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {435#(or (and (not (<= (+ (mod (+ |ULTIMATE.start_main_~max~0#1| 4294967295) 4294967296) |ULTIMATE.start_main_~#str1~0#1.offset| 1) (select |#length| |ULTIMATE.start_main_~#str1~0#1.base|))) (or (<= (mod (+ |ULTIMATE.start_main_~max~0#1| 4294967295) 4294967296) 2147483647) (not (<= (+ (mod (+ |ULTIMATE.start_main_~max~0#1| 4294967295) 4294967296) |ULTIMATE.start_main_~#str1~0#1.offset|) (+ 4294967295 (select |#length| |ULTIMATE.start_main_~#str1~0#1.base|)))))) (and (not (<= 4294967296 (+ (mod (+ |ULTIMATE.start_main_~max~0#1| 4294967295) 4294967296) |ULTIMATE.start_main_~#str1~0#1.offset|))) (or (not (<= (mod (+ |ULTIMATE.start_main_~max~0#1| 4294967295) 4294967296) 2147483647)) (not (<= 0 (+ (mod (+ |ULTIMATE.start_main_~max~0#1| 4294967295) 4294967296) |ULTIMATE.start_main_~#str1~0#1.offset|))))) (< (mod (+ |ULTIMATE.start_main_~i~0#1| 1) 4294967296) (mod |ULTIMATE.start_main_~max~0#1| 4294967296)))} is VALID [2022-02-21 03:58:00,636 INFO L290 TraceCheckUtils]: 6: Hoare triple {442#(or (< (mod (+ 2 |ULTIMATE.start_main_~i~0#1|) 4294967296) (mod |ULTIMATE.start_main_~max~0#1| 4294967296)) (and (not (<= (+ (mod (+ |ULTIMATE.start_main_~max~0#1| 4294967295) 4294967296) |ULTIMATE.start_main_~#str1~0#1.offset| 1) (select |#length| |ULTIMATE.start_main_~#str1~0#1.base|))) (or (<= (mod (+ |ULTIMATE.start_main_~max~0#1| 4294967295) 4294967296) 2147483647) (not (<= (+ (mod (+ |ULTIMATE.start_main_~max~0#1| 4294967295) 4294967296) |ULTIMATE.start_main_~#str1~0#1.offset|) (+ 4294967295 (select |#length| |ULTIMATE.start_main_~#str1~0#1.base|)))))) (and (not (<= 4294967296 (+ (mod (+ |ULTIMATE.start_main_~max~0#1| 4294967295) 4294967296) |ULTIMATE.start_main_~#str1~0#1.offset|))) (or (not (<= (mod (+ |ULTIMATE.start_main_~max~0#1| 4294967295) 4294967296) 2147483647)) (not (<= 0 (+ (mod (+ |ULTIMATE.start_main_~max~0#1| 4294967295) 4294967296) |ULTIMATE.start_main_~#str1~0#1.offset|))))))} assume !!(main_~i~0#1 % 4294967296 < main_~max~0#1 % 4294967296);call write~int(main_#t~nondet5#1, main_~#str1~0#1.base, main_~#str1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; {442#(or (< (mod (+ 2 |ULTIMATE.start_main_~i~0#1|) 4294967296) (mod |ULTIMATE.start_main_~max~0#1| 4294967296)) (and (not (<= (+ (mod (+ |ULTIMATE.start_main_~max~0#1| 4294967295) 4294967296) |ULTIMATE.start_main_~#str1~0#1.offset| 1) (select |#length| |ULTIMATE.start_main_~#str1~0#1.base|))) (or (<= (mod (+ |ULTIMATE.start_main_~max~0#1| 4294967295) 4294967296) 2147483647) (not (<= (+ (mod (+ |ULTIMATE.start_main_~max~0#1| 4294967295) 4294967296) |ULTIMATE.start_main_~#str1~0#1.offset|) (+ 4294967295 (select |#length| |ULTIMATE.start_main_~#str1~0#1.base|)))))) (and (not (<= 4294967296 (+ (mod (+ |ULTIMATE.start_main_~max~0#1| 4294967295) 4294967296) |ULTIMATE.start_main_~#str1~0#1.offset|))) (or (not (<= (mod (+ |ULTIMATE.start_main_~max~0#1| 4294967295) 4294967296) 2147483647)) (not (<= 0 (+ (mod (+ |ULTIMATE.start_main_~max~0#1| 4294967295) 4294967296) |ULTIMATE.start_main_~#str1~0#1.offset|))))))} is VALID [2022-02-21 03:58:00,637 INFO L290 TraceCheckUtils]: 5: Hoare triple {449#(or (< (mod (+ 3 |ULTIMATE.start_main_~i~0#1|) 4294967296) (mod |ULTIMATE.start_main_~max~0#1| 4294967296)) (and (not (<= (+ (mod (+ |ULTIMATE.start_main_~max~0#1| 4294967295) 4294967296) |ULTIMATE.start_main_~#str1~0#1.offset| 1) (select |#length| |ULTIMATE.start_main_~#str1~0#1.base|))) (or (<= (mod (+ |ULTIMATE.start_main_~max~0#1| 4294967295) 4294967296) 2147483647) (not (<= (+ (mod (+ |ULTIMATE.start_main_~max~0#1| 4294967295) 4294967296) |ULTIMATE.start_main_~#str1~0#1.offset|) (+ 4294967295 (select |#length| |ULTIMATE.start_main_~#str1~0#1.base|)))))) (and (not (<= 4294967296 (+ (mod (+ |ULTIMATE.start_main_~max~0#1| 4294967295) 4294967296) |ULTIMATE.start_main_~#str1~0#1.offset|))) (or (not (<= (mod (+ |ULTIMATE.start_main_~max~0#1| 4294967295) 4294967296) 2147483647)) (not (<= 0 (+ (mod (+ |ULTIMATE.start_main_~max~0#1| 4294967295) 4294967296) |ULTIMATE.start_main_~#str1~0#1.offset|))))))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {442#(or (< (mod (+ 2 |ULTIMATE.start_main_~i~0#1|) 4294967296) (mod |ULTIMATE.start_main_~max~0#1| 4294967296)) (and (not (<= (+ (mod (+ |ULTIMATE.start_main_~max~0#1| 4294967295) 4294967296) |ULTIMATE.start_main_~#str1~0#1.offset| 1) (select |#length| |ULTIMATE.start_main_~#str1~0#1.base|))) (or (<= (mod (+ |ULTIMATE.start_main_~max~0#1| 4294967295) 4294967296) 2147483647) (not (<= (+ (mod (+ |ULTIMATE.start_main_~max~0#1| 4294967295) 4294967296) |ULTIMATE.start_main_~#str1~0#1.offset|) (+ 4294967295 (select |#length| |ULTIMATE.start_main_~#str1~0#1.base|)))))) (and (not (<= 4294967296 (+ (mod (+ |ULTIMATE.start_main_~max~0#1| 4294967295) 4294967296) |ULTIMATE.start_main_~#str1~0#1.offset|))) (or (not (<= (mod (+ |ULTIMATE.start_main_~max~0#1| 4294967295) 4294967296) 2147483647)) (not (<= 0 (+ (mod (+ |ULTIMATE.start_main_~max~0#1| 4294967295) 4294967296) |ULTIMATE.start_main_~#str1~0#1.offset|))))))} is VALID [2022-02-21 03:58:00,638 INFO L290 TraceCheckUtils]: 4: Hoare triple {449#(or (< (mod (+ 3 |ULTIMATE.start_main_~i~0#1|) 4294967296) (mod |ULTIMATE.start_main_~max~0#1| 4294967296)) (and (not (<= (+ (mod (+ |ULTIMATE.start_main_~max~0#1| 4294967295) 4294967296) |ULTIMATE.start_main_~#str1~0#1.offset| 1) (select |#length| |ULTIMATE.start_main_~#str1~0#1.base|))) (or (<= (mod (+ |ULTIMATE.start_main_~max~0#1| 4294967295) 4294967296) 2147483647) (not (<= (+ (mod (+ |ULTIMATE.start_main_~max~0#1| 4294967295) 4294967296) |ULTIMATE.start_main_~#str1~0#1.offset|) (+ 4294967295 (select |#length| |ULTIMATE.start_main_~#str1~0#1.base|)))))) (and (not (<= 4294967296 (+ (mod (+ |ULTIMATE.start_main_~max~0#1| 4294967295) 4294967296) |ULTIMATE.start_main_~#str1~0#1.offset|))) (or (not (<= (mod (+ |ULTIMATE.start_main_~max~0#1| 4294967295) 4294967296) 2147483647)) (not (<= 0 (+ (mod (+ |ULTIMATE.start_main_~max~0#1| 4294967295) 4294967296) |ULTIMATE.start_main_~#str1~0#1.offset|))))))} assume !!(main_~i~0#1 % 4294967296 < main_~max~0#1 % 4294967296);call write~int(main_#t~nondet5#1, main_~#str1~0#1.base, main_~#str1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; {449#(or (< (mod (+ 3 |ULTIMATE.start_main_~i~0#1|) 4294967296) (mod |ULTIMATE.start_main_~max~0#1| 4294967296)) (and (not (<= (+ (mod (+ |ULTIMATE.start_main_~max~0#1| 4294967295) 4294967296) |ULTIMATE.start_main_~#str1~0#1.offset| 1) (select |#length| |ULTIMATE.start_main_~#str1~0#1.base|))) (or (<= (mod (+ |ULTIMATE.start_main_~max~0#1| 4294967295) 4294967296) 2147483647) (not (<= (+ (mod (+ |ULTIMATE.start_main_~max~0#1| 4294967295) 4294967296) |ULTIMATE.start_main_~#str1~0#1.offset|) (+ 4294967295 (select |#length| |ULTIMATE.start_main_~#str1~0#1.base|)))))) (and (not (<= 4294967296 (+ (mod (+ |ULTIMATE.start_main_~max~0#1| 4294967295) 4294967296) |ULTIMATE.start_main_~#str1~0#1.offset|))) (or (not (<= (mod (+ |ULTIMATE.start_main_~max~0#1| 4294967295) 4294967296) 2147483647)) (not (<= 0 (+ (mod (+ |ULTIMATE.start_main_~max~0#1| 4294967295) 4294967296) |ULTIMATE.start_main_~#str1~0#1.offset|))))))} is VALID [2022-02-21 03:58:00,639 INFO L290 TraceCheckUtils]: 3: Hoare triple {456#(or (< (mod (+ |ULTIMATE.start_main_~i~0#1| 4) 4294967296) (mod |ULTIMATE.start_main_~max~0#1| 4294967296)) (and (not (<= (+ (mod (+ |ULTIMATE.start_main_~max~0#1| 4294967295) 4294967296) |ULTIMATE.start_main_~#str1~0#1.offset| 1) (select |#length| |ULTIMATE.start_main_~#str1~0#1.base|))) (or (<= (mod (+ |ULTIMATE.start_main_~max~0#1| 4294967295) 4294967296) 2147483647) (not (<= (+ (mod (+ |ULTIMATE.start_main_~max~0#1| 4294967295) 4294967296) |ULTIMATE.start_main_~#str1~0#1.offset|) (+ 4294967295 (select |#length| |ULTIMATE.start_main_~#str1~0#1.base|)))))) (and (not (<= 4294967296 (+ (mod (+ |ULTIMATE.start_main_~max~0#1| 4294967295) 4294967296) |ULTIMATE.start_main_~#str1~0#1.offset|))) (or (not (<= (mod (+ |ULTIMATE.start_main_~max~0#1| 4294967295) 4294967296) 2147483647)) (not (<= 0 (+ (mod (+ |ULTIMATE.start_main_~max~0#1| 4294967295) 4294967296) |ULTIMATE.start_main_~#str1~0#1.offset|))))))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {449#(or (< (mod (+ 3 |ULTIMATE.start_main_~i~0#1|) 4294967296) (mod |ULTIMATE.start_main_~max~0#1| 4294967296)) (and (not (<= (+ (mod (+ |ULTIMATE.start_main_~max~0#1| 4294967295) 4294967296) |ULTIMATE.start_main_~#str1~0#1.offset| 1) (select |#length| |ULTIMATE.start_main_~#str1~0#1.base|))) (or (<= (mod (+ |ULTIMATE.start_main_~max~0#1| 4294967295) 4294967296) 2147483647) (not (<= (+ (mod (+ |ULTIMATE.start_main_~max~0#1| 4294967295) 4294967296) |ULTIMATE.start_main_~#str1~0#1.offset|) (+ 4294967295 (select |#length| |ULTIMATE.start_main_~#str1~0#1.base|)))))) (and (not (<= 4294967296 (+ (mod (+ |ULTIMATE.start_main_~max~0#1| 4294967295) 4294967296) |ULTIMATE.start_main_~#str1~0#1.offset|))) (or (not (<= (mod (+ |ULTIMATE.start_main_~max~0#1| 4294967295) 4294967296) 2147483647)) (not (<= 0 (+ (mod (+ |ULTIMATE.start_main_~max~0#1| 4294967295) 4294967296) |ULTIMATE.start_main_~#str1~0#1.offset|))))))} is VALID [2022-02-21 03:58:00,640 INFO L290 TraceCheckUtils]: 2: Hoare triple {456#(or (< (mod (+ |ULTIMATE.start_main_~i~0#1| 4) 4294967296) (mod |ULTIMATE.start_main_~max~0#1| 4294967296)) (and (not (<= (+ (mod (+ |ULTIMATE.start_main_~max~0#1| 4294967295) 4294967296) |ULTIMATE.start_main_~#str1~0#1.offset| 1) (select |#length| |ULTIMATE.start_main_~#str1~0#1.base|))) (or (<= (mod (+ |ULTIMATE.start_main_~max~0#1| 4294967295) 4294967296) 2147483647) (not (<= (+ (mod (+ |ULTIMATE.start_main_~max~0#1| 4294967295) 4294967296) |ULTIMATE.start_main_~#str1~0#1.offset|) (+ 4294967295 (select |#length| |ULTIMATE.start_main_~#str1~0#1.base|)))))) (and (not (<= 4294967296 (+ (mod (+ |ULTIMATE.start_main_~max~0#1| 4294967295) 4294967296) |ULTIMATE.start_main_~#str1~0#1.offset|))) (or (not (<= (mod (+ |ULTIMATE.start_main_~max~0#1| 4294967295) 4294967296) 2147483647)) (not (<= 0 (+ (mod (+ |ULTIMATE.start_main_~max~0#1| 4294967295) 4294967296) |ULTIMATE.start_main_~#str1~0#1.offset|))))))} assume !!(main_~i~0#1 % 4294967296 < main_~max~0#1 % 4294967296);call write~int(main_#t~nondet5#1, main_~#str1~0#1.base, main_~#str1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; {456#(or (< (mod (+ |ULTIMATE.start_main_~i~0#1| 4) 4294967296) (mod |ULTIMATE.start_main_~max~0#1| 4294967296)) (and (not (<= (+ (mod (+ |ULTIMATE.start_main_~max~0#1| 4294967295) 4294967296) |ULTIMATE.start_main_~#str1~0#1.offset| 1) (select |#length| |ULTIMATE.start_main_~#str1~0#1.base|))) (or (<= (mod (+ |ULTIMATE.start_main_~max~0#1| 4294967295) 4294967296) 2147483647) (not (<= (+ (mod (+ |ULTIMATE.start_main_~max~0#1| 4294967295) 4294967296) |ULTIMATE.start_main_~#str1~0#1.offset|) (+ 4294967295 (select |#length| |ULTIMATE.start_main_~#str1~0#1.base|)))))) (and (not (<= 4294967296 (+ (mod (+ |ULTIMATE.start_main_~max~0#1| 4294967295) 4294967296) |ULTIMATE.start_main_~#str1~0#1.offset|))) (or (not (<= (mod (+ |ULTIMATE.start_main_~max~0#1| 4294967295) 4294967296) 2147483647)) (not (<= 0 (+ (mod (+ |ULTIMATE.start_main_~max~0#1| 4294967295) 4294967296) |ULTIMATE.start_main_~#str1~0#1.offset|))))))} is VALID [2022-02-21 03:58:00,641 INFO L290 TraceCheckUtils]: 1: Hoare triple {378#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~post4#1, main_#t~mem7#1, main_#t~post8#1, main_#t~post6#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~post12#1, main_#t~post9#1, main_~max~0#1, main_~#str1~0#1.base, main_~#str1~0#1.offset, main_~#str2~0#1.base, main_~#str2~0#1.offset, main_~i~0#1, main_~j~0#1;main_~max~0#1 := 5;call main_~#str1~0#1.base, main_~#str1~0#1.offset := #Ultimate.allocOnStack((if main_~max~0#1 % 4294967296 % 4294967296 <= 2147483647 then main_~max~0#1 % 4294967296 % 4294967296 else main_~max~0#1 % 4294967296 % 4294967296 - 4294967296));call main_~#str2~0#1.base, main_~#str2~0#1.offset := #Ultimate.allocOnStack((if main_~max~0#1 % 4294967296 % 4294967296 <= 2147483647 then main_~max~0#1 % 4294967296 % 4294967296 else main_~max~0#1 % 4294967296 % 4294967296 - 4294967296));havoc main_~i~0#1;havoc main_~j~0#1;main_~i~0#1 := 0; {456#(or (< (mod (+ |ULTIMATE.start_main_~i~0#1| 4) 4294967296) (mod |ULTIMATE.start_main_~max~0#1| 4294967296)) (and (not (<= (+ (mod (+ |ULTIMATE.start_main_~max~0#1| 4294967295) 4294967296) |ULTIMATE.start_main_~#str1~0#1.offset| 1) (select |#length| |ULTIMATE.start_main_~#str1~0#1.base|))) (or (<= (mod (+ |ULTIMATE.start_main_~max~0#1| 4294967295) 4294967296) 2147483647) (not (<= (+ (mod (+ |ULTIMATE.start_main_~max~0#1| 4294967295) 4294967296) |ULTIMATE.start_main_~#str1~0#1.offset|) (+ 4294967295 (select |#length| |ULTIMATE.start_main_~#str1~0#1.base|)))))) (and (not (<= 4294967296 (+ (mod (+ |ULTIMATE.start_main_~max~0#1| 4294967295) 4294967296) |ULTIMATE.start_main_~#str1~0#1.offset|))) (or (not (<= (mod (+ |ULTIMATE.start_main_~max~0#1| 4294967295) 4294967296) 2147483647)) (not (<= 0 (+ (mod (+ |ULTIMATE.start_main_~max~0#1| 4294967295) 4294967296) |ULTIMATE.start_main_~#str1~0#1.offset|))))))} is VALID [2022-02-21 03:58:00,641 INFO L290 TraceCheckUtils]: 0: Hoare triple {378#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {378#true} is VALID [2022-02-21 03:58:00,641 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:58:00,641 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1559913967] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:58:00,641 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:58:00,642 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 19 [2022-02-21 03:58:00,642 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829977613] [2022-02-21 03:58:00,642 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:58:00,642 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 03:58:00,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:58:00,642 INFO L85 PathProgramCache]: Analyzing trace with hash 1731, now seen corresponding path program 3 times [2022-02-21 03:58:00,642 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:58:00,642 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151648080] [2022-02-21 03:58:00,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:58:00,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:58:00,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:58:00,647 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:58:00,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:58:00,650 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:58:00,748 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:58:00,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-02-21 03:58:00,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=266, Unknown=0, NotChecked=0, Total=342 [2022-02-21 03:58:00,749 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. cyclomatic complexity: 5 Second operand has 19 states, 19 states have (on average 1.736842105263158) internal successors, (33), 19 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:58:01,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:58:01,403 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2022-02-21 03:58:01,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-21 03:58:01,403 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 19 states, 19 states have (on average 1.736842105263158) internal successors, (33), 19 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:58:01,444 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:58:01,445 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 24 transitions. [2022-02-21 03:58:01,445 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2022-02-21 03:58:01,446 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 22 states and 24 transitions. [2022-02-21 03:58:01,446 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2022-02-21 03:58:01,446 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2022-02-21 03:58:01,446 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 24 transitions. [2022-02-21 03:58:01,446 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:58:01,446 INFO L681 BuchiCegarLoop]: Abstraction has 22 states and 24 transitions. [2022-02-21 03:58:01,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 24 transitions. [2022-02-21 03:58:01,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2022-02-21 03:58:01,447 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:58:01,447 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states and 24 transitions. Second operand has 21 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 20 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:58:01,447 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states and 24 transitions. Second operand has 21 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 20 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:58:01,447 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand has 21 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 20 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:58:01,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:58:01,448 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2022-02-21 03:58:01,448 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2022-02-21 03:58:01,448 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:58:01,448 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:58:01,448 INFO L74 IsIncluded]: Start isIncluded. First operand has 21 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 20 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 22 states and 24 transitions. [2022-02-21 03:58:01,448 INFO L87 Difference]: Start difference. First operand has 21 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 20 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 22 states and 24 transitions. [2022-02-21 03:58:01,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:58:01,449 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2022-02-21 03:58:01,449 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2022-02-21 03:58:01,449 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:58:01,449 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:58:01,450 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:58:01,450 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:58:01,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 20 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:58:01,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2022-02-21 03:58:01,450 INFO L704 BuchiCegarLoop]: Abstraction has 21 states and 23 transitions. [2022-02-21 03:58:01,450 INFO L587 BuchiCegarLoop]: Abstraction has 21 states and 23 transitions. [2022-02-21 03:58:01,451 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2022-02-21 03:58:01,451 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 23 transitions. [2022-02-21 03:58:01,451 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2022-02-21 03:58:01,451 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:58:01,451 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:58:01,451 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 1, 1, 1, 1] [2022-02-21 03:58:01,452 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2022-02-21 03:58:01,452 INFO L791 eck$LassoCheckResult]: Stem: 490#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); 491#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~post4#1, main_#t~mem7#1, main_#t~post8#1, main_#t~post6#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~post12#1, main_#t~post9#1, main_~max~0#1, main_~#str1~0#1.base, main_~#str1~0#1.offset, main_~#str2~0#1.base, main_~#str2~0#1.offset, main_~i~0#1, main_~j~0#1;main_~max~0#1 := 5;call main_~#str1~0#1.base, main_~#str1~0#1.offset := #Ultimate.allocOnStack((if main_~max~0#1 % 4294967296 % 4294967296 <= 2147483647 then main_~max~0#1 % 4294967296 % 4294967296 else main_~max~0#1 % 4294967296 % 4294967296 - 4294967296));call main_~#str2~0#1.base, main_~#str2~0#1.offset := #Ultimate.allocOnStack((if main_~max~0#1 % 4294967296 % 4294967296 <= 2147483647 then main_~max~0#1 % 4294967296 % 4294967296 else main_~max~0#1 % 4294967296 % 4294967296 - 4294967296));havoc main_~i~0#1;havoc main_~j~0#1;main_~i~0#1 := 0; 498#L18-3 assume !!(main_~i~0#1 % 4294967296 < main_~max~0#1 % 4294967296);call write~int(main_#t~nondet5#1, main_~#str1~0#1.base, main_~#str1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; 499#L18-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 500#L18-3 assume !!(main_~i~0#1 % 4294967296 < main_~max~0#1 % 4294967296);call write~int(main_#t~nondet5#1, main_~#str1~0#1.base, main_~#str1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; 493#L18-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 494#L18-3 assume !!(main_~i~0#1 % 4294967296 < main_~max~0#1 % 4294967296);call write~int(main_#t~nondet5#1, main_~#str1~0#1.base, main_~#str1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; 507#L18-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 506#L18-3 assume !!(main_~i~0#1 % 4294967296 < main_~max~0#1 % 4294967296);call write~int(main_#t~nondet5#1, main_~#str1~0#1.base, main_~#str1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; 505#L18-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 504#L18-3 assume !!(main_~i~0#1 % 4294967296 < main_~max~0#1 % 4294967296);call write~int(main_#t~nondet5#1, main_~#str1~0#1.base, main_~#str1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; 503#L18-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 502#L18-3 assume !(main_~i~0#1 % 4294967296 < main_~max~0#1 % 4294967296); 501#L18-4 call write~int(0, main_~#str1~0#1.base, main_~#str1~0#1.offset + (if (main_~max~0#1 - 1) % 4294967296 % 4294967296 <= 2147483647 then (main_~max~0#1 - 1) % 4294967296 % 4294967296 else (main_~max~0#1 - 1) % 4294967296 % 4294967296 - 4294967296), 1);main_~j~0#1 := 0;main_~i~0#1 := (if (main_~max~0#1 - 1) % 4294967296 % 4294967296 <= 2147483647 then (main_~max~0#1 - 1) % 4294967296 % 4294967296 else (main_~max~0#1 - 1) % 4294967296 % 4294967296 - 4294967296); 497#L26-3 [2022-02-21 03:58:01,452 INFO L793 eck$LassoCheckResult]: Loop: 497#L26-3 assume !!(main_~i~0#1 >= 0);call main_#t~mem7#1 := read~int(main_~#str1~0#1.base, main_~#str1~0#1.offset + main_~i~0#1, 1);call write~int(main_#t~mem7#1, main_~#str2~0#1.base, main_~#str2~0#1.offset + main_~j~0#1, 1);havoc main_#t~mem7#1;main_#t~post8#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 496#L26-2 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := main_#t~post6#1 - 1;havoc main_#t~post6#1; 497#L26-3 [2022-02-21 03:58:01,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:58:01,452 INFO L85 PathProgramCache]: Analyzing trace with hash -1745699051, now seen corresponding path program 3 times [2022-02-21 03:58:01,452 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:58:01,453 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549379784] [2022-02-21 03:58:01,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:58:01,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:58:01,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:58:01,475 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:58:01,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:58:01,489 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:58:01,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:58:01,490 INFO L85 PathProgramCache]: Analyzing trace with hash 1731, now seen corresponding path program 4 times [2022-02-21 03:58:01,490 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:58:01,490 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283800833] [2022-02-21 03:58:01,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:58:01,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:58:01,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:58:01,495 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:58:01,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:58:01,498 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:58:01,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:58:01,498 INFO L85 PathProgramCache]: Analyzing trace with hash 1715425495, now seen corresponding path program 1 times [2022-02-21 03:58:01,498 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:58:01,498 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546360849] [2022-02-21 03:58:01,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:58:01,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:58:01,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:58:01,522 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:58:01,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:58:01,536 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:58:03,813 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:58:03,814 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:58:03,814 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:58:03,814 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:58:03,814 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:58:03,814 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:58:03,814 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:58:03,814 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:58:03,814 INFO L133 ssoRankerPreferences]: Filename of dumped script: invert_string-3.c_Iteration5_Lasso [2022-02-21 03:58:03,814 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:58:03,814 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:58:03,835 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:58:03,837 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:58:04,298 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.AssertionError: v_rep(select (select #memory_int ULTIMATE.start_main_~#str1~0#1.base) (+ (mod (+ 4294967295 ULTIMATE.start_main_~max~0#1) 4294967296) ULTIMATE.start_main_~#str1~0#1.offset))_1 was not added to the transformula! at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminatorUtils.getReplacementVar(MapEliminatorUtils.java:260) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.replaceMapReads(MapEliminator.java:509) 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:609) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.checkLassoTermination(LassoCheck.java:953) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.(LassoCheck.java:862) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.(LassoCheck.java:252) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.iterate(BuchiCegarLoop.java:457) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:142) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:397) 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-02-21 03:58:04,301 INFO L158 Benchmark]: Toolchain (without parser) took 9919.20ms. Allocated memory was 79.7MB in the beginning and 142.6MB in the end (delta: 62.9MB). Free memory was 45.2MB in the beginning and 54.4MB in the end (delta: -9.2MB). Peak memory consumption was 73.6MB. Max. memory is 16.1GB. [2022-02-21 03:58:04,301 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 79.7MB. Free memory was 58.7MB in the beginning and 58.6MB in the end (delta: 23.4kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:58:04,301 INFO L158 Benchmark]: CACSL2BoogieTranslator took 230.95ms. Allocated memory was 79.7MB in the beginning and 96.5MB in the end (delta: 16.8MB). Free memory was 45.1MB in the beginning and 72.0MB in the end (delta: -26.9MB). Peak memory consumption was 5.6MB. Max. memory is 16.1GB. [2022-02-21 03:58:04,301 INFO L158 Benchmark]: Boogie Procedure Inliner took 85.89ms. Allocated memory is still 96.5MB. Free memory was 72.0MB in the beginning and 70.3MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:58:04,302 INFO L158 Benchmark]: Boogie Preprocessor took 26.67ms. Allocated memory is still 96.5MB. Free memory was 70.3MB in the beginning and 68.9MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 03:58:04,302 INFO L158 Benchmark]: RCFGBuilder took 273.12ms. Allocated memory is still 96.5MB. Free memory was 68.9MB in the beginning and 55.9MB in the end (delta: 13.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-02-21 03:58:04,302 INFO L158 Benchmark]: BuchiAutomizer took 9281.92ms. Allocated memory was 96.5MB in the beginning and 142.6MB in the end (delta: 46.1MB). Free memory was 55.6MB in the beginning and 54.4MB in the end (delta: 1.2MB). Peak memory consumption was 69.9MB. Max. memory is 16.1GB. [2022-02-21 03:58:04,303 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 79.7MB. Free memory was 58.7MB in the beginning and 58.6MB in the end (delta: 23.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 230.95ms. Allocated memory was 79.7MB in the beginning and 96.5MB in the end (delta: 16.8MB). Free memory was 45.1MB in the beginning and 72.0MB in the end (delta: -26.9MB). Peak memory consumption was 5.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 85.89ms. Allocated memory is still 96.5MB. Free memory was 72.0MB in the beginning and 70.3MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 26.67ms. Allocated memory is still 96.5MB. Free memory was 70.3MB in the beginning and 68.9MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 273.12ms. Allocated memory is still 96.5MB. Free memory was 68.9MB in the beginning and 55.9MB in the end (delta: 13.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * BuchiAutomizer took 9281.92ms. Allocated memory was 96.5MB in the beginning and 142.6MB in the end (delta: 46.1MB). Free memory was 55.6MB in the beginning and 54.4MB in the end (delta: 1.2MB). Peak memory consumption was 69.9MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: AssertionError: v_rep(select (select #memory_int ULTIMATE.start_main_~#str1~0#1.base) (+ (mod (+ 4294967295 ULTIMATE.start_main_~max~0#1) 4294967296) ULTIMATE.start_main_~#str1~0#1.offset))_1 was not added to the transformula! de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: AssertionError: v_rep(select (select #memory_int ULTIMATE.start_main_~#str1~0#1.base) (+ (mod (+ 4294967295 ULTIMATE.start_main_~max~0#1) 4294967296) ULTIMATE.start_main_~#str1~0#1.offset))_1 was not added to the transformula!: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminatorUtils.getReplacementVar(MapEliminatorUtils.java:260) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-02-21 03:58:04,355 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-02-21 03:58:04,546 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-02-21 03:58:04,732 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis No suitable file found in config dir /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config using search string *Termination*32bit*_Bitvector*.epf No suitable settings file found using Termination*32bit*_Bitvector ERROR: UNSUPPORTED PROPERTY Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: v_rep(select (select #memory_int ULTIMATE.start_main_~#str1~0#1.base) (+ (mod (+ 4294967295 ULTIMATE.start_main_~max~0#1) 4294967296) ULTIMATE.start_main_~#str1~0#1.offset))_1 was not added to the transformula!