/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/BuchiAutomizerCInline.xml -s ../../../trunk/examples/settings/buchiAutomizer/concurrent-automaton-noLbe.epf -i ../../../trunk/examples/svcomp/weaver/test-easy1.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-0d686a6 [2022-07-26 13:39:26,690 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-26 13:39:26,692 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-26 13:39:26,728 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-26 13:39:26,728 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-26 13:39:26,729 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-26 13:39:26,732 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-26 13:39:26,734 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-26 13:39:26,736 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-26 13:39:26,740 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-26 13:39:26,741 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-26 13:39:26,742 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-26 13:39:26,742 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-26 13:39:26,744 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-26 13:39:26,745 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-26 13:39:26,747 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-26 13:39:26,748 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-26 13:39:26,748 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-26 13:39:26,750 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-26 13:39:26,755 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-26 13:39:26,756 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-26 13:39:26,757 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-26 13:39:26,758 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-26 13:39:26,759 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-26 13:39:26,760 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-26 13:39:26,766 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-26 13:39:26,766 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-26 13:39:26,766 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-26 13:39:26,767 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-26 13:39:26,767 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-26 13:39:26,768 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-26 13:39:26,768 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-26 13:39:26,769 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-26 13:39:26,770 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-26 13:39:26,770 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-26 13:39:26,771 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-26 13:39:26,771 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-26 13:39:26,772 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-26 13:39:26,772 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-26 13:39:26,772 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-26 13:39:26,773 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-26 13:39:26,774 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-26 13:39:26,775 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/buchiAutomizer/concurrent-automaton-noLbe.epf [2022-07-26 13:39:26,805 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-26 13:39:26,805 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-26 13:39:26,805 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-26 13:39:26,805 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-26 13:39:26,806 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-26 13:39:26,807 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-26 13:39:26,807 INFO L138 SettingsManager]: * Use SBE=true [2022-07-26 13:39:26,807 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-07-26 13:39:26,807 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-07-26 13:39:26,808 INFO L138 SettingsManager]: * Use old map elimination=false [2022-07-26 13:39:26,808 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-07-26 13:39:26,808 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-07-26 13:39:26,808 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-07-26 13:39:26,808 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-26 13:39:26,809 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-26 13:39:26,809 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-26 13:39:26,809 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-26 13:39:26,810 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-26 13:39:26,810 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-26 13:39:26,810 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-07-26 13:39:26,810 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-07-26 13:39:26,810 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-07-26 13:39:26,810 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-26 13:39:26,810 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-26 13:39:26,810 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-07-26 13:39:26,810 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-26 13:39:26,810 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-07-26 13:39:26,811 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-26 13:39:26,811 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-26 13:39:26,811 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-26 13:39:26,811 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-26 13:39:26,811 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-26 13:39:26,813 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-07-26 13:39:26,813 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 [2022-07-26 13:39:27,014 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-26 13:39:27,037 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-26 13:39:27,039 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-26 13:39:27,040 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-26 13:39:27,040 INFO L275 PluginConnector]: CDTParser initialized [2022-07-26 13:39:27,041 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/test-easy1.wvr.c [2022-07-26 13:39:27,092 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5fa8770fa/24199ed5c142438486a2f65654c3a798/FLAGa456a21e9 [2022-07-26 13:39:27,454 INFO L306 CDTParser]: Found 1 translation units. [2022-07-26 13:39:27,454 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/test-easy1.wvr.c [2022-07-26 13:39:27,459 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5fa8770fa/24199ed5c142438486a2f65654c3a798/FLAGa456a21e9 [2022-07-26 13:39:27,472 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5fa8770fa/24199ed5c142438486a2f65654c3a798 [2022-07-26 13:39:27,474 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-26 13:39:27,475 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-07-26 13:39:27,476 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-26 13:39:27,476 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-26 13:39:27,478 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-26 13:39:27,478 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.07 01:39:27" (1/1) ... [2022-07-26 13:39:27,479 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@58d55be3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 01:39:27, skipping insertion in model container [2022-07-26 13:39:27,479 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.07 01:39:27" (1/1) ... [2022-07-26 13:39:27,483 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-26 13:39:27,494 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-26 13:39:27,629 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/test-easy1.wvr.c[1876,1889] [2022-07-26 13:39:27,630 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-26 13:39:27,634 INFO L203 MainTranslator]: Completed pre-run [2022-07-26 13:39:27,645 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/test-easy1.wvr.c[1876,1889] [2022-07-26 13:39:27,646 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-26 13:39:27,654 INFO L208 MainTranslator]: Completed translation [2022-07-26 13:39:27,654 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 01:39:27 WrapperNode [2022-07-26 13:39:27,654 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-26 13:39:27,655 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-26 13:39:27,655 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-26 13:39:27,655 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-26 13:39:27,660 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 01:39:27" (1/1) ... [2022-07-26 13:39:27,665 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 01:39:27" (1/1) ... [2022-07-26 13:39:27,680 INFO L137 Inliner]: procedures = 21, calls = 20, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 54 [2022-07-26 13:39:27,680 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-26 13:39:27,681 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-26 13:39:27,681 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-26 13:39:27,681 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-26 13:39:27,686 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 01:39:27" (1/1) ... [2022-07-26 13:39:27,686 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 01:39:27" (1/1) ... [2022-07-26 13:39:27,695 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 01:39:27" (1/1) ... [2022-07-26 13:39:27,695 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 01:39:27" (1/1) ... [2022-07-26 13:39:27,702 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 01:39:27" (1/1) ... [2022-07-26 13:39:27,704 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 01:39:27" (1/1) ... [2022-07-26 13:39:27,705 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 01:39:27" (1/1) ... [2022-07-26 13:39:27,711 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-26 13:39:27,711 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-26 13:39:27,711 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-26 13:39:27,711 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-26 13:39:27,712 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 01:39:27" (1/1) ... [2022-07-26 13:39:27,717 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:39:27,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:39:27,752 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 13:39:27,772 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2022-07-26 13:39:27,794 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-26 13:39:27,794 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-07-26 13:39:27,794 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-07-26 13:39:27,794 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-07-26 13:39:27,794 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-07-26 13:39:27,794 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-26 13:39:27,794 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-26 13:39:27,794 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-26 13:39:27,794 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-26 13:39:27,794 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-26 13:39:27,794 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-26 13:39:27,795 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-26 13:39:27,795 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-07-26 13:39:27,847 INFO L234 CfgBuilder]: Building ICFG [2022-07-26 13:39:27,848 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-26 13:39:27,971 INFO L275 CfgBuilder]: Performing block encoding [2022-07-26 13:39:27,976 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-26 13:39:27,977 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-07-26 13:39:27,978 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.07 01:39:27 BoogieIcfgContainer [2022-07-26 13:39:27,978 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-26 13:39:27,979 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-07-26 13:39:27,979 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-07-26 13:39:27,981 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-07-26 13:39:27,982 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-26 13:39:27,982 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 26.07 01:39:27" (1/3) ... [2022-07-26 13:39:27,983 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7287d637 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.07 01:39:27, skipping insertion in model container [2022-07-26 13:39:27,983 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-26 13:39:27,983 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 01:39:27" (2/3) ... [2022-07-26 13:39:27,983 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7287d637 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.07 01:39:27, skipping insertion in model container [2022-07-26 13:39:27,983 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-26 13:39:27,983 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.07 01:39:27" (3/3) ... [2022-07-26 13:39:27,984 INFO L322 chiAutomizerObserver]: Analyzing ICFG test-easy1.wvr.c [2022-07-26 13:39:28,026 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-07-26 13:39:28,044 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 82 places, 83 transitions, 182 flow [2022-07-26 13:39:28,078 INFO L129 PetriNetUnfolder]: 6/79 cut-off events. [2022-07-26 13:39:28,078 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-07-26 13:39:28,089 INFO L84 FinitePrefix]: Finished finitePrefix Result has 88 conditions, 79 events. 6/79 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 40 event pairs, 0 based on Foata normal form. 0/73 useless extension candidates. Maximal degree in co-relation 47. Up to 2 conditions per place. [2022-07-26 13:39:28,096 INFO L82 GeneralOperation]: Start removeDead. Operand has 82 places, 83 transitions, 182 flow [2022-07-26 13:39:28,104 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 80 places, 79 transitions, 170 flow [2022-07-26 13:39:28,113 INFO L301 stractBuchiCegarLoop]: Interprodecural is true [2022-07-26 13:39:28,113 INFO L302 stractBuchiCegarLoop]: Hoare is false [2022-07-26 13:39:28,113 INFO L303 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-07-26 13:39:28,113 INFO L304 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-07-26 13:39:28,113 INFO L305 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-07-26 13:39:28,113 INFO L306 stractBuchiCegarLoop]: Difference is false [2022-07-26 13:39:28,113 INFO L307 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-07-26 13:39:28,113 INFO L311 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-07-26 13:39:28,115 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 0 states, but on-demand construction may add more states [2022-07-26 13:39:28,199 INFO L131 ngComponentsAnalysis]: Automaton has 37 accepting balls. 196 [2022-07-26 13:39:28,200 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-26 13:39:28,200 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-26 13:39:28,203 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-26 13:39:28,204 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2022-07-26 13:39:28,204 INFO L333 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-07-26 13:39:28,204 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 307 states, but on-demand construction may add more states [2022-07-26 13:39:28,213 INFO L131 ngComponentsAnalysis]: Automaton has 37 accepting balls. 196 [2022-07-26 13:39:28,213 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-26 13:39:28,213 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-26 13:39:28,214 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-26 13:39:28,214 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2022-07-26 13:39:28,219 INFO L733 eck$LassoCheckResult]: Stem: 85#[ULTIMATE.startENTRY]don't care [162] ULTIMATE.startENTRY-->L-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 88#[L-1]don't care [140] L-1-->L-1-1: Formula: (and (= |v_#NULL.base_1| 0) (= |v_#NULL.offset_1| 0)) InVars {} OutVars{#NULL.offset=|v_#NULL.offset_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] 90#[L-1-1]don't care [168] L-1-1-->L-1-2: Formula: (= (select |v_#valid_1| 0) 0) InVars {#valid=|v_#valid_1|} OutVars{#valid=|v_#valid_1|} AuxVars[] AssignedVars[] 92#[L-1-2]don't care [170] L-1-2-->L21: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] 94#[L21]don't care [128] L21-->L21-1: Formula: (and (= (select |v_#valid_2| 1) 1) (= 2 (select |v_#length_1| 1))) InVars {#length=|v_#length_1|, #valid=|v_#valid_2|} OutVars{#length=|v_#length_1|, #valid=|v_#valid_2|} AuxVars[] AssignedVars[] 96#[L21-1]don't care [158] L21-1-->L21-2: Formula: (= 48 (select (select |v_#memory_int_1| 1) 0)) InVars {#memory_int=|v_#memory_int_1|} OutVars{#memory_int=|v_#memory_int_1|} AuxVars[] AssignedVars[] 98#[L21-2]don't care [156] L21-2-->L21-3: Formula: (= (select (select |v_#memory_int_2| 1) 1) 0) InVars {#memory_int=|v_#memory_int_2|} OutVars{#memory_int=|v_#memory_int_2|} AuxVars[] AssignedVars[] 100#[L21-3]don't care [121] L21-3-->L21-4: Formula: (and (= (select |v_#valid_3| 2) 1) (= (select |v_#length_2| 2) 17)) InVars {#length=|v_#length_2|, #valid=|v_#valid_3|} OutVars{#length=|v_#length_2|, #valid=|v_#valid_3|} AuxVars[] AssignedVars[] 102#[L21-4]don't care [176] L21-4-->L38: Formula: (= v_~x1~0_5 0) InVars {} OutVars{~x1~0=v_~x1~0_5} AuxVars[] AssignedVars[~x1~0] 104#[L38]don't care [177] L38-->L-1-3: Formula: (= v_~x2~0_5 0) InVars {} OutVars{~x2~0=v_~x2~0_5} AuxVars[] AssignedVars[~x2~0] 106#[L-1-3]don't care [174] L-1-3-->L-1-4: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 108#[L-1-4]don't care [152] L-1-4-->L-1-5: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 110#[L-1-5]don't care [119] L-1-5-->L-1-6: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1] 112#[L-1-6]don't care [150] L-1-6-->L57: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet4#1=|v_ULTIMATE.start_main_#t~nondet4#1_1|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_1|, ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_1|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_1|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_1|, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_1|, ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_1|, ULTIMATE.start_main_#t~nondet3#1=|v_ULTIMATE.start_main_#t~nondet3#1_1|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_1|, ULTIMATE.start_main_#t~mem9#1=|v_ULTIMATE.start_main_#t~mem9#1_1|, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_1|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre5#1, ULTIMATE.start_main_#t~nondet4#1, ULTIMATE.start_main_#t~nondet3#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_#t~nondet8#1, ULTIMATE.start_main_#t~nondet6#1, ULTIMATE.start_main_#t~mem9#1, ULTIMATE.start_main_#t~pre7#1, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_#t~mem10#1, ULTIMATE.start_main_~#t2~0#1.base] 114#[L57]don't care [179] L57-->L57-1: Formula: (and (= |v_ULTIMATE.start_main_~#t1~0#1.offset_2| 0) (= (select |v_#valid_5| |v_ULTIMATE.start_main_~#t1~0#1.base_2|) 0) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_~#t1~0#1.base_2|) (= |v_#length_3| (store |v_#length_4| |v_ULTIMATE.start_main_~#t1~0#1.base_2| 4)) (not (= |v_ULTIMATE.start_main_~#t1~0#1.base_2| 0)) (= (store |v_#valid_5| |v_ULTIMATE.start_main_~#t1~0#1.base_2| 1) |v_#valid_4|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_4|, #valid=|v_#valid_5|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_2|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_2|, #valid=|v_#valid_4|} AuxVars[] AssignedVars[#valid, #length, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t1~0#1.offset] 116#[L57-1]don't care [117] L57-1-->L57-2: Formula: (and (= |v_#length_5| (store |v_#length_6| |v_ULTIMATE.start_main_~#t2~0#1.base_2| 4)) (= (select |v_#valid_7| |v_ULTIMATE.start_main_~#t2~0#1.base_2|) 0) (= (store |v_#valid_7| |v_ULTIMATE.start_main_~#t2~0#1.base_2| 1) |v_#valid_6|) (not (= |v_ULTIMATE.start_main_~#t2~0#1.base_2| 0)) (= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_2|) (< |v_#StackHeapBarrier_3| |v_ULTIMATE.start_main_~#t2~0#1.base_2|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_6|, #valid=|v_#valid_7|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_5|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_2|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_2|, #valid=|v_#valid_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2~0#1.offset, #valid, #length, ULTIMATE.start_main_~#t2~0#1.base] 118#[L57-2]don't care [167] L57-2-->L59: Formula: (= v_~x1~0_6 |v_ULTIMATE.start_main_#t~nondet3#1_2|) InVars {ULTIMATE.start_main_#t~nondet3#1=|v_ULTIMATE.start_main_#t~nondet3#1_2|} OutVars{ULTIMATE.start_main_#t~nondet3#1=|v_ULTIMATE.start_main_#t~nondet3#1_2|, ~x1~0=v_~x1~0_6} AuxVars[] AssignedVars[~x1~0] 120#[L59]don't care [135] L59-->L60: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet3#1=|v_ULTIMATE.start_main_#t~nondet3#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet3#1] 122#[L60]don't care [173] L60-->L60-1: Formula: (= v_~x2~0_6 |v_ULTIMATE.start_main_#t~nondet4#1_2|) InVars {ULTIMATE.start_main_#t~nondet4#1=|v_ULTIMATE.start_main_#t~nondet4#1_2|} OutVars{~x2~0=v_~x2~0_6, ULTIMATE.start_main_#t~nondet4#1=|v_ULTIMATE.start_main_#t~nondet4#1_2|} AuxVars[] AssignedVars[~x2~0] 124#[L60-1]don't care [138] L60-1-->L61: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet4#1=|v_ULTIMATE.start_main_#t~nondet4#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet4#1] 126#[L61]don't care [106] L61-->L61-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 128#[L61-1]don't care [149] L61-1-->L61-2: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1| (ite (and (<= 0 v_~x1~0_7) (= v_~x1~0_7 v_~x2~0_7)) 1 0)) InVars {~x2~0=v_~x2~0_7, ~x1~0=v_~x1~0_7} OutVars{~x2~0=v_~x2~0_7, ~x1~0=v_~x1~0_7, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1] 130#[L61-2]don't care [157] L61-2-->L34: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 132#[L34]don't care [127] L34-->L35: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_2|) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_2|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 134#[L35]don't care [160] L35-->L34-1: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_4| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_4|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_4|} AuxVars[] AssignedVars[] 136#[L34-1]don't care [153] L34-1-->L64: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 140#[L64]don't care [124] L64-->L64-1: Formula: (= |v_ULTIMATE.start_main_#t~pre5#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_2|, #pthreadsForks=|v_#pthreadsForks_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre5#1] 142#[L64-1]don't care [169] L64-1-->L64-2: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] 144#[L64-2]don't care [181] L64-2-->L64-3: Formula: (and (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_3|) (= (select |v_#valid_8| |v_ULTIMATE.start_main_~#t1~0#1.base_3|) 1) (<= (+ |v_ULTIMATE.start_main_~#t1~0#1.offset_3| 4) (select |v_#length_7| |v_ULTIMATE.start_main_~#t1~0#1.base_3|)) (= (store |v_#memory_int_4| |v_ULTIMATE.start_main_~#t1~0#1.base_3| (store (select |v_#memory_int_4| |v_ULTIMATE.start_main_~#t1~0#1.base_3|) |v_ULTIMATE.start_main_~#t1~0#1.offset_3| |v_ULTIMATE.start_main_#t~pre5#1_3|)) |v_#memory_int_3|)) InVars {ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_3|, #valid=|v_#valid_8|, #memory_int=|v_#memory_int_4|, #length=|v_#length_7|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_3|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_3|} OutVars{ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_3|, #valid=|v_#valid_8|, #memory_int=|v_#memory_int_3|, #length=|v_#length_7|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_3|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_3|} AuxVars[] AssignedVars[#memory_int] 146#[L64-3]don't care [202] L64-3-->L41-1: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_2 0) (= |v_ULTIMATE.start_main_#t~pre5#1_6| v_thread1Thread1of1ForFork0_thidvar0_2)) InVars {ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_6|} OutVars{ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_6|, thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_4|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_8|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2, thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_4|, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_#res.offset, thread1Thread1of1ForFork0_thidvar1] 148#[L64-4, L41-1]don't care [2022-07-26 13:39:28,219 INFO L735 eck$LassoCheckResult]: Loop: 148#[L64-4, L41-1]don't care [186] L41-1-->L42: Formula: (< v_~x1~0_2 10000) InVars {~x1~0=v_~x1~0_2} OutVars{~x1~0=v_~x1~0_2} AuxVars[] AssignedVars[] 152#[L64-4, L42]don't care [188] L42-->L42-1: Formula: (= v_~x1~0_3 |v_thread1Thread1of1ForFork0_#t~post1_1|) InVars {~x1~0=v_~x1~0_3} OutVars{thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_1|, ~x1~0=v_~x1~0_3} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post1] 160#[L64-4, L42-1]don't care [190] L42-1-->L42-2: Formula: (= v_~x1~0_4 (+ |v_thread1Thread1of1ForFork0_#t~post1_3| 1)) InVars {thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_3|} OutVars{thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_3|, ~x1~0=v_~x1~0_4} AuxVars[] AssignedVars[~x1~0] 174#[L64-4, L42-2]don't care [191] L42-2-->L41-1: Formula: true InVars {} OutVars{thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_5|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post1] 148#[L64-4, L41-1]don't care [2022-07-26 13:39:28,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 13:39:28,223 INFO L85 PathProgramCache]: Analyzing trace with hash -1735433991, now seen corresponding path program 1 times [2022-07-26 13:39:28,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 13:39:28,229 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787234268] [2022-07-26 13:39:28,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 13:39:28,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 13:39:28,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 13:39:28,306 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 13:39:28,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 13:39:28,338 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 13:39:28,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 13:39:28,340 INFO L85 PathProgramCache]: Analyzing trace with hash 6651396, now seen corresponding path program 1 times [2022-07-26 13:39:28,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 13:39:28,340 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029094199] [2022-07-26 13:39:28,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 13:39:28,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 13:39:28,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 13:39:28,346 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 13:39:28,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 13:39:28,349 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 13:39:28,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 13:39:28,350 INFO L85 PathProgramCache]: Analyzing trace with hash 267100924, now seen corresponding path program 1 times [2022-07-26 13:39:28,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 13:39:28,351 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187544276] [2022-07-26 13:39:28,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 13:39:28,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 13:39:28,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 13:39:28,373 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 13:39:28,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 13:39:28,396 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 13:39:28,437 INFO L210 LassoAnalysis]: Preferences: [2022-07-26 13:39:28,438 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-26 13:39:28,438 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-26 13:39:28,438 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-26 13:39:28,438 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-07-26 13:39:28,438 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:39:28,438 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-26 13:39:28,438 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-26 13:39:28,438 INFO L133 ssoRankerPreferences]: Filename of dumped script: test-easy1.wvr.c_BEv2_Iteration1_Loop [2022-07-26 13:39:28,438 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-26 13:39:28,438 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-26 13:39:28,448 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:39:28,453 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:39:28,455 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:39:28,460 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:39:28,463 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:39:28,466 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:39:28,526 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-26 13:39:28,526 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-07-26 13:39:28,527 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:39:28,528 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:39:28,529 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 13:39:28,547 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-26 13:39:28,547 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-26 13:39:28,562 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2022-07-26 13:39:28,566 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-26 13:39:28,567 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~thread2.offset_1=1} Honda state: {v_rep#funAddr~thread2.offset_1=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-26 13:39:28,587 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2022-07-26 13:39:28,588 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:39:28,588 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:39:28,590 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 13:39:28,591 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2022-07-26 13:39:28,592 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-26 13:39:28,592 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-26 13:39:28,602 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-26 13:39:28,602 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {thread1Thread1of1ForFork0_#t~post1=0} Honda state: {thread1Thread1of1ForFork0_#t~post1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-26 13:39:28,619 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2022-07-26 13:39:28,620 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:39:28,620 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:39:28,621 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 13:39:28,626 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2022-07-26 13:39:28,628 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-26 13:39:28,628 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-26 13:39:28,677 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2022-07-26 13:39:28,678 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:39:28,678 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:39:28,679 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 13:39:28,682 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2022-07-26 13:39:28,682 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-07-26 13:39:28,683 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-26 13:39:28,712 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-07-26 13:39:28,717 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2022-07-26 13:39:28,717 INFO L210 LassoAnalysis]: Preferences: [2022-07-26 13:39:28,717 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-26 13:39:28,717 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-26 13:39:28,717 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-26 13:39:28,717 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-26 13:39:28,717 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:39:28,718 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-26 13:39:28,718 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-26 13:39:28,718 INFO L133 ssoRankerPreferences]: Filename of dumped script: test-easy1.wvr.c_BEv2_Iteration1_Loop [2022-07-26 13:39:28,718 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-26 13:39:28,718 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-26 13:39:28,719 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:39:28,728 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:39:28,730 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:39:28,732 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:39:28,745 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:39:28,759 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:39:28,810 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-26 13:39:28,813 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-26 13:39:28,814 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:39:28,814 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:39:28,815 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 13:39:28,833 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2022-07-26 13:39:28,839 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 13:39:28,845 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:39:28,846 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:39:28,846 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:39:28,846 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:39:28,850 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 13:39:28,850 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 13:39:28,860 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:39:28,876 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2022-07-26 13:39:28,876 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:39:28,876 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:39:28,877 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 13:39:28,878 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2022-07-26 13:39:28,879 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 13:39:28,885 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:39:28,885 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:39:28,886 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:39:28,886 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:39:28,888 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 13:39:28,888 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 13:39:28,903 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:39:28,918 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2022-07-26 13:39:28,918 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:39:28,919 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:39:28,920 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 13:39:28,921 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2022-07-26 13:39:28,922 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 13:39:28,928 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:39:28,928 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 13:39:28,928 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:39:28,928 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:39:28,928 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:39:28,929 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 13:39:28,929 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 13:39:28,944 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:39:28,960 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2022-07-26 13:39:28,960 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:39:28,960 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:39:28,961 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 13:39:28,962 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2022-07-26 13:39:28,964 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 13:39:28,969 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:39:28,969 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 13:39:28,970 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:39:28,970 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:39:28,970 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:39:28,970 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 13:39:28,971 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 13:39:28,986 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-26 13:39:28,995 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-07-26 13:39:28,995 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-07-26 13:39:28,996 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:39:28,996 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:39:28,997 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 13:39:28,998 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2022-07-26 13:39:28,999 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-26 13:39:28,999 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-07-26 13:39:29,000 INFO L513 LassoAnalysis]: Proved termination. [2022-07-26 13:39:29,000 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(~x1~0) = -2*~x1~0 + 19999 Supporting invariants [] [2022-07-26 13:39:29,016 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2022-07-26 13:39:29,019 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-07-26 13:39:29,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 13:39:29,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-26 13:39:29,057 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-26 13:39:29,058 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-26 13:39:29,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-26 13:39:29,094 WARN L261 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-26 13:39:29,095 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-26 13:39:29,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-26 13:39:29,164 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2022-07-26 13:39:29,166 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand currently 307 states, but on-demand construction may add more states Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-26 13:39:29,254 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand currently 307 states, but on-demand construction may add more states. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 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 949 states and 2561 transitions. Complement of second has 9 states. [2022-07-26 13:39:29,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2022-07-26 13:39:29,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-26 13:39:29,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 178 transitions. [2022-07-26 13:39:29,260 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 178 transitions. Stem has 30 letters. Loop has 4 letters. [2022-07-26 13:39:29,261 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-26 13:39:29,261 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 178 transitions. Stem has 34 letters. Loop has 4 letters. [2022-07-26 13:39:29,261 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-26 13:39:29,261 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 178 transitions. Stem has 30 letters. Loop has 8 letters. [2022-07-26 13:39:29,262 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-26 13:39:29,262 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 949 states and 2561 transitions. [2022-07-26 13:39:29,272 INFO L131 ngComponentsAnalysis]: Automaton has 31 accepting balls. 124 [2022-07-26 13:39:29,278 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 949 states to 348 states and 892 transitions. [2022-07-26 13:39:29,279 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 194 [2022-07-26 13:39:29,280 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 239 [2022-07-26 13:39:29,280 INFO L73 IsDeterministic]: Start isDeterministic. Operand 348 states and 892 transitions. [2022-07-26 13:39:29,280 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-26 13:39:29,280 INFO L220 hiAutomatonCegarLoop]: Abstraction has 348 states and 892 transitions. [2022-07-26 13:39:29,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states and 892 transitions. [2022-07-26 13:39:29,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 305. [2022-07-26 13:39:29,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 305 states, 305 states have (on average 2.495081967213115) internal successors, (761), 304 states have internal predecessors, (761), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-26 13:39:29,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 761 transitions. [2022-07-26 13:39:29,323 INFO L242 hiAutomatonCegarLoop]: Abstraction has 305 states and 761 transitions. [2022-07-26 13:39:29,323 INFO L426 stractBuchiCegarLoop]: Abstraction has 305 states and 761 transitions. [2022-07-26 13:39:29,323 INFO L333 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-07-26 13:39:29,323 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 305 states and 761 transitions. [2022-07-26 13:39:29,325 INFO L131 ngComponentsAnalysis]: Automaton has 31 accepting balls. 124 [2022-07-26 13:39:29,325 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-26 13:39:29,325 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-26 13:39:29,326 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-26 13:39:29,326 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2022-07-26 13:39:29,330 INFO L733 eck$LassoCheckResult]: Stem: 2388#[ULTIMATE.startENTRY]don't care [162] ULTIMATE.startENTRY-->L-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 2364#[L-1]don't care [140] L-1-->L-1-1: Formula: (and (= |v_#NULL.base_1| 0) (= |v_#NULL.offset_1| 0)) InVars {} OutVars{#NULL.offset=|v_#NULL.offset_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] 2366#[L-1-1]don't care [168] L-1-1-->L-1-2: Formula: (= (select |v_#valid_1| 0) 0) InVars {#valid=|v_#valid_1|} OutVars{#valid=|v_#valid_1|} AuxVars[] AssignedVars[] 2390#[L-1-2]don't care [170] L-1-2-->L21: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] 2228#[L21]don't care [128] L21-->L21-1: Formula: (and (= (select |v_#valid_2| 1) 1) (= 2 (select |v_#length_1| 1))) InVars {#length=|v_#length_1|, #valid=|v_#valid_2|} OutVars{#length=|v_#length_1|, #valid=|v_#valid_2|} AuxVars[] AssignedVars[] 2230#[L21-1]don't care [158] L21-1-->L21-2: Formula: (= 48 (select (select |v_#memory_int_1| 1) 0)) InVars {#memory_int=|v_#memory_int_1|} OutVars{#memory_int=|v_#memory_int_1|} AuxVars[] AssignedVars[] 2368#[L21-2]don't care [156] L21-2-->L21-3: Formula: (= (select (select |v_#memory_int_2| 1) 1) 0) InVars {#memory_int=|v_#memory_int_2|} OutVars{#memory_int=|v_#memory_int_2|} AuxVars[] AssignedVars[] 2370#[L21-3]don't care [121] L21-3-->L21-4: Formula: (and (= (select |v_#valid_3| 2) 1) (= (select |v_#length_2| 2) 17)) InVars {#length=|v_#length_2|, #valid=|v_#valid_3|} OutVars{#length=|v_#length_2|, #valid=|v_#valid_3|} AuxVars[] AssignedVars[] 2150#[L21-4]don't care [176] L21-4-->L38: Formula: (= v_~x1~0_5 0) InVars {} OutVars{~x1~0=v_~x1~0_5} AuxVars[] AssignedVars[~x1~0] 2152#[L38]don't care [177] L38-->L-1-3: Formula: (= v_~x2~0_5 0) InVars {} OutVars{~x2~0=v_~x2~0_5} AuxVars[] AssignedVars[~x2~0] 2378#[L-1-3]don't care [174] L-1-3-->L-1-4: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 2020#[L-1-4]don't care [152] L-1-4-->L-1-5: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 2022#[L-1-5]don't care [119] L-1-5-->L-1-6: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1] 2316#[L-1-6]don't care [150] L-1-6-->L57: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet4#1=|v_ULTIMATE.start_main_#t~nondet4#1_1|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_1|, ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_1|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_1|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_1|, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_1|, ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_1|, ULTIMATE.start_main_#t~nondet3#1=|v_ULTIMATE.start_main_#t~nondet3#1_1|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_1|, ULTIMATE.start_main_#t~mem9#1=|v_ULTIMATE.start_main_#t~mem9#1_1|, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_1|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre5#1, ULTIMATE.start_main_#t~nondet4#1, ULTIMATE.start_main_#t~nondet3#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_#t~nondet8#1, ULTIMATE.start_main_#t~nondet6#1, ULTIMATE.start_main_#t~mem9#1, ULTIMATE.start_main_#t~pre7#1, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_#t~mem10#1, ULTIMATE.start_main_~#t2~0#1.base] 2286#[L57]don't care [179] L57-->L57-1: Formula: (and (= |v_ULTIMATE.start_main_~#t1~0#1.offset_2| 0) (= (select |v_#valid_5| |v_ULTIMATE.start_main_~#t1~0#1.base_2|) 0) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_~#t1~0#1.base_2|) (= |v_#length_3| (store |v_#length_4| |v_ULTIMATE.start_main_~#t1~0#1.base_2| 4)) (not (= |v_ULTIMATE.start_main_~#t1~0#1.base_2| 0)) (= (store |v_#valid_5| |v_ULTIMATE.start_main_~#t1~0#1.base_2| 1) |v_#valid_4|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_4|, #valid=|v_#valid_5|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_2|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_2|, #valid=|v_#valid_4|} AuxVars[] AssignedVars[#valid, #length, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t1~0#1.offset] 1862#[L57-1]don't care [117] L57-1-->L57-2: Formula: (and (= |v_#length_5| (store |v_#length_6| |v_ULTIMATE.start_main_~#t2~0#1.base_2| 4)) (= (select |v_#valid_7| |v_ULTIMATE.start_main_~#t2~0#1.base_2|) 0) (= (store |v_#valid_7| |v_ULTIMATE.start_main_~#t2~0#1.base_2| 1) |v_#valid_6|) (not (= |v_ULTIMATE.start_main_~#t2~0#1.base_2| 0)) (= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_2|) (< |v_#StackHeapBarrier_3| |v_ULTIMATE.start_main_~#t2~0#1.base_2|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_6|, #valid=|v_#valid_7|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_5|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_2|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_2|, #valid=|v_#valid_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2~0#1.offset, #valid, #length, ULTIMATE.start_main_~#t2~0#1.base] 1864#[L57-2]don't care [167] L57-2-->L59: Formula: (= v_~x1~0_6 |v_ULTIMATE.start_main_#t~nondet3#1_2|) InVars {ULTIMATE.start_main_#t~nondet3#1=|v_ULTIMATE.start_main_#t~nondet3#1_2|} OutVars{ULTIMATE.start_main_#t~nondet3#1=|v_ULTIMATE.start_main_#t~nondet3#1_2|, ~x1~0=v_~x1~0_6} AuxVars[] AssignedVars[~x1~0] 2236#[L59]don't care [135] L59-->L60: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet3#1=|v_ULTIMATE.start_main_#t~nondet3#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet3#1] 2238#[L60]don't care [173] L60-->L60-1: Formula: (= v_~x2~0_6 |v_ULTIMATE.start_main_#t~nondet4#1_2|) InVars {ULTIMATE.start_main_#t~nondet4#1=|v_ULTIMATE.start_main_#t~nondet4#1_2|} OutVars{~x2~0=v_~x2~0_6, ULTIMATE.start_main_#t~nondet4#1=|v_ULTIMATE.start_main_#t~nondet4#1_2|} AuxVars[] AssignedVars[~x2~0] 2362#[L60-1]don't care [138] L60-1-->L61: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet4#1=|v_ULTIMATE.start_main_#t~nondet4#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet4#1] 2170#[L61]don't care [106] L61-->L61-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 2172#[L61-1]don't care [149] L61-1-->L61-2: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1| (ite (and (<= 0 v_~x1~0_7) (= v_~x1~0_7 v_~x2~0_7)) 1 0)) InVars {~x2~0=v_~x2~0_7, ~x1~0=v_~x1~0_7} OutVars{~x2~0=v_~x2~0_7, ~x1~0=v_~x1~0_7, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1] 2054#[L61-2]don't care [157] L61-2-->L34: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 2056#[L34]don't care [127] L34-->L35: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_2|) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_2|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 2348#[L35]don't care [160] L35-->L34-1: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_4| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_4|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_4|} AuxVars[] AssignedVars[] 2384#[L34-1]don't care [153] L34-1-->L64: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 2336#[L64]don't care [124] L64-->L64-1: Formula: (= |v_ULTIMATE.start_main_#t~pre5#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_2|, #pthreadsForks=|v_#pthreadsForks_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre5#1] 2338#[L64-1]don't care [169] L64-1-->L64-2: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] 2288#[L64-2]don't care [181] L64-2-->L64-3: Formula: (and (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_3|) (= (select |v_#valid_8| |v_ULTIMATE.start_main_~#t1~0#1.base_3|) 1) (<= (+ |v_ULTIMATE.start_main_~#t1~0#1.offset_3| 4) (select |v_#length_7| |v_ULTIMATE.start_main_~#t1~0#1.base_3|)) (= (store |v_#memory_int_4| |v_ULTIMATE.start_main_~#t1~0#1.base_3| (store (select |v_#memory_int_4| |v_ULTIMATE.start_main_~#t1~0#1.base_3|) |v_ULTIMATE.start_main_~#t1~0#1.offset_3| |v_ULTIMATE.start_main_#t~pre5#1_3|)) |v_#memory_int_3|)) InVars {ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_3|, #valid=|v_#valid_8|, #memory_int=|v_#memory_int_4|, #length=|v_#length_7|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_3|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_3|} OutVars{ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_3|, #valid=|v_#valid_8|, #memory_int=|v_#memory_int_3|, #length=|v_#length_7|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_3|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_3|} AuxVars[] AssignedVars[#memory_int] 1852#[L64-3]don't care [202] L64-3-->L41-1: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_2 0) (= |v_ULTIMATE.start_main_#t~pre5#1_6| v_thread1Thread1of1ForFork0_thidvar0_2)) InVars {ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_6|} OutVars{ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_6|, thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_4|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_8|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2, thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_4|, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_#res.offset, thread1Thread1of1ForFork0_thidvar1] 1854#[L64-4, L41-1]don't care [141] L64-4-->L64-5: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre5#1] 2318#[L64-5, L41-1]don't care [137] L64-5-->L65: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet6#1] 2304#[L41-1, L65]don't care [182] L65-->L65-1: Formula: (= |v_ULTIMATE.start_main_#t~pre7#1_2| |v_#pthreadsForks_4|) InVars {#pthreadsForks=|v_#pthreadsForks_4|} OutVars{#pthreadsForks=|v_#pthreadsForks_4|, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre7#1] 1786#[L41-1, L65-1]don't care [164] L65-1-->L65-2: Formula: (= (+ 1 |v_#pthreadsForks_6|) |v_#pthreadsForks_5|) InVars {#pthreadsForks=|v_#pthreadsForks_6|} OutVars{#pthreadsForks=|v_#pthreadsForks_5|} AuxVars[] AssignedVars[#pthreadsForks] 1958#[L41-1, L65-2]don't care [139] L65-2-->L65-3: Formula: (and (<= (+ 4 |v_ULTIMATE.start_main_~#t2~0#1.offset_3|) (select |v_#length_8| |v_ULTIMATE.start_main_~#t2~0#1.base_3|)) (= (select |v_#valid_9| |v_ULTIMATE.start_main_~#t2~0#1.base_3|) 1) (= (store |v_#memory_int_6| |v_ULTIMATE.start_main_~#t2~0#1.base_3| (store (select |v_#memory_int_6| |v_ULTIMATE.start_main_~#t2~0#1.base_3|) |v_ULTIMATE.start_main_~#t2~0#1.offset_3| |v_ULTIMATE.start_main_#t~pre7#1_3|)) |v_#memory_int_5|) (<= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_3|)) InVars {ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_3|, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_6|, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_3|, #length=|v_#length_8|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_3|} OutVars{ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_3|, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_3|, #length=|v_#length_8|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_3|} AuxVars[] AssignedVars[#memory_int] 2322#[L65-3, L41-1]don't care [205] L65-3-->L49-1: Formula: (and (= 0 v_thread2Thread1of1ForFork1_thidvar1_2) (= |v_ULTIMATE.start_main_#t~pre7#1_6| v_thread2Thread1of1ForFork1_thidvar0_2) (= 0 v_thread2Thread1of1ForFork1_thidvar2_2)) InVars {ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_6|} OutVars{thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_4|, thread2Thread1of1ForFork1_#t~post2=|v_thread2Thread1of1ForFork1_#t~post2_8|, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_4|, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_6|, thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_2, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_#t~post2, thread2Thread1of1ForFork1_#res.base, thread2Thread1of1ForFork1_thidvar2, thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1] 2078#[L49-1, L65-4, L41-1]don't care [2022-07-26 13:39:29,330 INFO L735 eck$LassoCheckResult]: Loop: 2078#[L49-1, L65-4, L41-1]don't care [194] L49-1-->L50: Formula: (< v_~x2~0_2 10000) InVars {~x2~0=v_~x2~0_2} OutVars{~x2~0=v_~x2~0_2} AuxVars[] AssignedVars[] 1798#[L50, L65-4, L41-1]don't care [196] L50-->L50-1: Formula: (= v_~x2~0_3 |v_thread2Thread1of1ForFork1_#t~post2_1|) InVars {~x2~0=v_~x2~0_3} OutVars{~x2~0=v_~x2~0_3, thread2Thread1of1ForFork1_#t~post2=|v_thread2Thread1of1ForFork1_#t~post2_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post2] 1800#[L65-4, L50-1, L41-1]don't care [198] L50-1-->L50-2: Formula: (= v_~x2~0_4 (+ |v_thread2Thread1of1ForFork1_#t~post2_3| 1)) InVars {thread2Thread1of1ForFork1_#t~post2=|v_thread2Thread1of1ForFork1_#t~post2_3|} OutVars{~x2~0=v_~x2~0_4, thread2Thread1of1ForFork1_#t~post2=|v_thread2Thread1of1ForFork1_#t~post2_3|} AuxVars[] AssignedVars[~x2~0] 2142#[L65-4, L50-2, L41-1]don't care [199] L50-2-->L49-1: Formula: true InVars {} OutVars{thread2Thread1of1ForFork1_#t~post2=|v_thread2Thread1of1ForFork1_#t~post2_5|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post2] 2078#[L49-1, L65-4, L41-1]don't care [2022-07-26 13:39:29,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 13:39:29,333 INFO L85 PathProgramCache]: Analyzing trace with hash 1945246373, now seen corresponding path program 1 times [2022-07-26 13:39:29,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 13:39:29,333 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667621020] [2022-07-26 13:39:29,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 13:39:29,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 13:39:29,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 13:39:29,375 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 13:39:29,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 13:39:29,392 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 13:39:29,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 13:39:29,393 INFO L85 PathProgramCache]: Analyzing trace with hash 6897668, now seen corresponding path program 1 times [2022-07-26 13:39:29,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 13:39:29,393 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094960701] [2022-07-26 13:39:29,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 13:39:29,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 13:39:29,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 13:39:29,403 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 13:39:29,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 13:39:29,405 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 13:39:29,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 13:39:29,405 INFO L85 PathProgramCache]: Analyzing trace with hash -1564120920, now seen corresponding path program 1 times [2022-07-26 13:39:29,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 13:39:29,406 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12418192] [2022-07-26 13:39:29,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 13:39:29,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 13:39:29,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 13:39:29,442 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 13:39:29,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 13:39:29,463 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 13:39:29,484 INFO L210 LassoAnalysis]: Preferences: [2022-07-26 13:39:29,485 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-26 13:39:29,485 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-26 13:39:29,485 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-26 13:39:29,485 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-07-26 13:39:29,485 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:39:29,485 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-26 13:39:29,485 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-26 13:39:29,485 INFO L133 ssoRankerPreferences]: Filename of dumped script: test-easy1.wvr.c_BEv2_Iteration2_Loop [2022-07-26 13:39:29,485 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-26 13:39:29,485 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-26 13:39:29,486 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:39:29,490 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:39:29,492 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:39:29,494 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:39:29,496 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:39:29,497 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:39:29,533 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-26 13:39:29,533 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-07-26 13:39:29,533 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:39:29,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:39:29,552 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 13:39:29,553 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2022-07-26 13:39:29,554 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-26 13:39:29,554 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-26 13:39:29,591 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2022-07-26 13:39:29,592 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:39:29,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:39:29,593 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 13:39:29,594 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2022-07-26 13:39:29,636 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-07-26 13:39:29,636 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-26 13:39:29,664 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-07-26 13:39:29,667 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-07-26 13:39:29,667 INFO L210 LassoAnalysis]: Preferences: [2022-07-26 13:39:29,668 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-26 13:39:29,668 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-26 13:39:29,668 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-26 13:39:29,668 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-26 13:39:29,668 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:39:29,668 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-26 13:39:29,668 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-26 13:39:29,668 INFO L133 ssoRankerPreferences]: Filename of dumped script: test-easy1.wvr.c_BEv2_Iteration2_Loop [2022-07-26 13:39:29,668 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-26 13:39:29,668 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-26 13:39:29,669 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:39:29,676 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:39:29,679 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:39:29,680 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:39:29,682 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:39:29,684 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:39:29,729 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-26 13:39:29,729 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-26 13:39:29,730 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:39:29,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:39:29,731 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 13:39:29,742 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 13:39:29,747 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:39:29,747 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 13:39:29,747 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:39:29,747 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:39:29,747 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:39:29,749 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 13:39:29,750 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 13:39:29,754 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2022-07-26 13:39:29,763 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-26 13:39:29,765 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-07-26 13:39:29,765 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-07-26 13:39:29,765 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:39:29,765 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:39:29,766 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 13:39:29,767 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2022-07-26 13:39:29,768 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-26 13:39:29,768 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-07-26 13:39:29,768 INFO L513 LassoAnalysis]: Proved termination. [2022-07-26 13:39:29,768 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(~x2~0) = -2*~x2~0 + 19999 Supporting invariants [] [2022-07-26 13:39:29,783 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2022-07-26 13:39:29,784 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-07-26 13:39:29,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 13:39:29,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-26 13:39:29,843 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-26 13:39:29,844 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-26 13:39:29,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-26 13:39:29,882 WARN L261 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-26 13:39:29,883 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-26 13:39:29,918 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-26 13:39:29,918 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2022-07-26 13:39:29,918 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 305 states and 761 transitions. cyclomatic complexity: 497 Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-26 13:39:29,955 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 305 states and 761 transitions. cyclomatic complexity: 497. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 666 states and 1882 transitions. Complement of second has 8 states. [2022-07-26 13:39:29,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2022-07-26 13:39:29,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-26 13:39:29,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 101 transitions. [2022-07-26 13:39:29,956 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 101 transitions. Stem has 36 letters. Loop has 4 letters. [2022-07-26 13:39:29,957 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-26 13:39:29,957 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 101 transitions. Stem has 40 letters. Loop has 4 letters. [2022-07-26 13:39:29,957 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-26 13:39:29,957 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 101 transitions. Stem has 36 letters. Loop has 8 letters. [2022-07-26 13:39:29,958 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-26 13:39:29,958 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 666 states and 1882 transitions. [2022-07-26 13:39:29,963 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-07-26 13:39:29,963 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 666 states to 0 states and 0 transitions. [2022-07-26 13:39:29,963 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2022-07-26 13:39:29,963 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2022-07-26 13:39:29,963 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2022-07-26 13:39:29,963 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-26 13:39:29,963 INFO L220 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-26 13:39:29,963 INFO L242 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-26 13:39:29,963 INFO L426 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-26 13:39:29,963 INFO L333 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-07-26 13:39:29,963 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2022-07-26 13:39:29,963 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-07-26 13:39:29,963 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-07-26 13:39:29,968 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.07 01:39:29 BoogieIcfgContainer [2022-07-26 13:39:29,968 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-07-26 13:39:29,969 INFO L158 Benchmark]: Toolchain (without parser) took 2493.63ms. Allocated memory was 197.1MB in the beginning and 237.0MB in the end (delta: 39.8MB). Free memory was 165.5MB in the beginning and 119.3MB in the end (delta: 46.3MB). Peak memory consumption was 86.6MB. Max. memory is 8.0GB. [2022-07-26 13:39:29,969 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 197.1MB. Free memory is still 154.4MB. There was no memory consumed. Max. memory is 8.0GB. [2022-07-26 13:39:29,969 INFO L158 Benchmark]: CACSL2BoogieTranslator took 178.68ms. Allocated memory is still 197.1MB. Free memory was 165.4MB in the beginning and 167.9MB in the end (delta: -2.5MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2022-07-26 13:39:29,970 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.51ms. Allocated memory is still 197.1MB. Free memory was 167.9MB in the beginning and 166.2MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-07-26 13:39:29,970 INFO L158 Benchmark]: Boogie Preprocessor took 29.60ms. Allocated memory is still 197.1MB. Free memory was 166.2MB in the beginning and 165.1MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-07-26 13:39:29,970 INFO L158 Benchmark]: RCFGBuilder took 266.92ms. Allocated memory is still 197.1MB. Free memory was 165.1MB in the beginning and 153.8MB in the end (delta: 11.3MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-07-26 13:39:29,970 INFO L158 Benchmark]: BuchiAutomizer took 1989.59ms. Allocated memory was 197.1MB in the beginning and 237.0MB in the end (delta: 39.8MB). Free memory was 153.6MB in the beginning and 119.3MB in the end (delta: 34.3MB). Peak memory consumption was 75.2MB. Max. memory is 8.0GB. [2022-07-26 13:39:29,972 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 197.1MB. Free memory is still 154.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 178.68ms. Allocated memory is still 197.1MB. Free memory was 165.4MB in the beginning and 167.9MB in the end (delta: -2.5MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 25.51ms. Allocated memory is still 197.1MB. Free memory was 167.9MB in the beginning and 166.2MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 29.60ms. Allocated memory is still 197.1MB. Free memory was 166.2MB in the beginning and 165.1MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 266.92ms. Allocated memory is still 197.1MB. Free memory was 165.1MB in the beginning and 153.8MB in the end (delta: 11.3MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * BuchiAutomizer took 1989.59ms. Allocated memory was 197.1MB in the beginning and 237.0MB in the end (delta: 39.8MB). Free memory was 153.6MB in the beginning and 119.3MB in the end (delta: 34.3MB). Peak memory consumption was 75.2MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 2 terminating modules (0 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function 19999 + -2 * x1 and consists of 6 locations. One deterministic module has affine ranking function 19999 + -2 * x2 and consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 1.9s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 1.2s. Construction of modules took 0.0s. Büchi inclusion checks took 0.3s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 1. Automata minimization 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 43 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 182 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 180 mSDsluCounter, 364 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 217 mSDsCounter, 6 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 51 IncrementalHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6 mSolverCounterUnsat, 165 mSDtfsCounter, 51 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT2 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital10 mio100 ax340 hnf100 lsp29 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq160 hnf93 smp100 dnf100 smp100 tf113 neg100 sie111 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 46ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 2 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 2 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.2s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2022-07-26 13:39:30,001 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-07-26 13:39:30,216 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2022-07-26 13:39:30,418 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...