/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/unroll-cond-4.wvr.c
--------------------------------------------------------------------------------
This is Ultimate 0.2.2-dev-21b0908
[2022-07-22 12:02:31,011 INFO L177 SettingsManager]: Resetting all preferences to default values...
[2022-07-22 12:02:31,014 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values
[2022-07-22 12:02:31,051 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2022-07-22 12:02:31,052 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2022-07-22 12:02:31,053 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2022-07-22 12:02:31,055 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2022-07-22 12:02:31,057 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values
[2022-07-22 12:02:31,060 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values
[2022-07-22 12:02:31,061 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values
[2022-07-22 12:02:31,062 INFO L181 SettingsManager]: Resetting Sifa preferences to default values
[2022-07-22 12:02:31,064 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2022-07-22 12:02:31,064 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values
[2022-07-22 12:02:31,065 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values
[2022-07-22 12:02:31,067 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2022-07-22 12:02:31,068 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values
[2022-07-22 12:02:31,069 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2022-07-22 12:02:31,070 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2022-07-22 12:02:31,072 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2022-07-22 12:02:31,093 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values
[2022-07-22 12:02:31,098 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values
[2022-07-22 12:02:31,100 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2022-07-22 12:02:31,101 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values
[2022-07-22 12:02:31,102 INFO L181 SettingsManager]: Resetting Referee preferences to default values
[2022-07-22 12:02:31,103 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values
[2022-07-22 12:02:31,107 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2022-07-22 12:02:31,107 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2022-07-22 12:02:31,108 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values
[2022-07-22 12:02:31,109 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values
[2022-07-22 12:02:31,109 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values
[2022-07-22 12:02:31,110 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring...
[2022-07-22 12:02:31,111 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values
[2022-07-22 12:02:31,112 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2022-07-22 12:02:31,113 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values
[2022-07-22 12:02:31,114 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values
[2022-07-22 12:02:31,115 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2022-07-22 12:02:31,115 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values
[2022-07-22 12:02:31,116 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2022-07-22 12:02:31,117 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring...
[2022-07-22 12:02:31,117 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values
[2022-07-22 12:02:31,118 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values
[2022-07-22 12:02:31,119 INFO L188 SettingsManager]: Finished resetting all preferences to default values...
[2022-07-22 12:02:31,120 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/buchiAutomizer/concurrent-automaton-noLbe.epf
[2022-07-22 12:02:31,151 INFO L113 SettingsManager]: Loading preferences was successful
[2022-07-22 12:02:31,151 INFO L115 SettingsManager]: Preferences different from defaults after loading the file:
[2022-07-22 12:02:31,154 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2022-07-22 12:02:31,154 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2022-07-22 12:02:31,156 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2022-07-22 12:02:31,156 INFO L138 SettingsManager]: * Create parallel compositions if possible=false
[2022-07-22 12:02:31,156 INFO L138 SettingsManager]: * Use SBE=true
[2022-07-22 12:02:31,156 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults:
[2022-07-22 12:02:31,157 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3
[2022-07-22 12:02:31,157 INFO L138 SettingsManager]: * Use old map elimination=false
[2022-07-22 12:02:31,157 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false
[2022-07-22 12:02:31,157 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true
[2022-07-22 12:02:31,157 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES
[2022-07-22 12:02:31,159 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2022-07-22 12:02:31,160 INFO L138 SettingsManager]: * sizeof long=4
[2022-07-22 12:02:31,160 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false
[2022-07-22 12:02:31,160 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true
[2022-07-22 12:02:31,160 INFO L138 SettingsManager]: * sizeof POINTER=4
[2022-07-22 12:02:31,161 INFO L138 SettingsManager]: * Check division by zero=IGNORE
[2022-07-22 12:02:31,161 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME
[2022-07-22 12:02:31,161 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME
[2022-07-22 12:02:31,162 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME
[2022-07-22 12:02:31,162 INFO L138 SettingsManager]: * sizeof long double=12
[2022-07-22 12:02:31,162 INFO L138 SettingsManager]: * Check if freed pointer was valid=false
[2022-07-22 12:02:31,162 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false
[2022-07-22 12:02:31,162 INFO L138 SettingsManager]: * Use constant arrays=true
[2022-07-22 12:02:31,163 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME
[2022-07-22 12:02:31,163 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2022-07-22 12:02:31,163 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements
[2022-07-22 12:02:31,164 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2022-07-22 12:02:31,164 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL
[2022-07-22 12:02:31,164 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false
[2022-07-22 12:02:31,166 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults:
[2022-07-22 12:02:31,166 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-22 12:02:31,585 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2022-07-22 12:02:31,610 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2022-07-22 12:02:31,615 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2022-07-22 12:02:31,616 INFO L271 PluginConnector]: Initializing CDTParser...
[2022-07-22 12:02:31,617 INFO L275 PluginConnector]: CDTParser initialized
[2022-07-22 12:02:31,618 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/unroll-cond-4.wvr.c
[2022-07-22 12:02:31,695 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/605711b26/7d3dc44d25f74f8cbcf27e9bd81198cc/FLAG62ac795cc
[2022-07-22 12:02:32,398 INFO L306 CDTParser]: Found 1 translation units.
[2022-07-22 12:02:32,398 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/unroll-cond-4.wvr.c
[2022-07-22 12:02:32,409 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/605711b26/7d3dc44d25f74f8cbcf27e9bd81198cc/FLAG62ac795cc
[2022-07-22 12:02:32,718 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/605711b26/7d3dc44d25f74f8cbcf27e9bd81198cc
[2022-07-22 12:02:32,722 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2022-07-22 12:02:32,728 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements.
[2022-07-22 12:02:32,730 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2022-07-22 12:02:32,731 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2022-07-22 12:02:32,735 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized
[2022-07-22 12:02:32,736 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 12:02:32" (1/1) ...
[2022-07-22 12:02:32,737 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ff8a306 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:02:32, skipping insertion in model container
[2022-07-22 12:02:32,738 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 12:02:32" (1/1) ...
[2022-07-22 12:02:32,746 INFO L145 MainTranslator]: Starting translation in SV-COMP mode
[2022-07-22 12:02:32,769 INFO L178 MainTranslator]: Built tables and reachable declarations
[2022-07-22 12:02:32,971 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/unroll-cond-4.wvr.c[2808,2821]
[2022-07-22 12:02:32,977 INFO L210 PostProcessor]: Analyzing one entry point: main
[2022-07-22 12:02:32,989 INFO L203 MainTranslator]: Completed pre-run
[2022-07-22 12:02:33,020 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/unroll-cond-4.wvr.c[2808,2821]
[2022-07-22 12:02:33,023 INFO L210 PostProcessor]: Analyzing one entry point: main
[2022-07-22 12:02:33,049 INFO L208 MainTranslator]: Completed translation
[2022-07-22 12:02:33,050 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:02:33 WrapperNode
[2022-07-22 12:02:33,050 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2022-07-22 12:02:33,052 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2022-07-22 12:02:33,052 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner...
[2022-07-22 12:02:33,052 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized
[2022-07-22 12:02:33,060 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:02:33" (1/1) ...
[2022-07-22 12:02:33,091 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:02:33" (1/1) ...
[2022-07-22 12:02:33,140 INFO L137 Inliner]: procedures = 24, calls = 41, calls flagged for inlining = 15, calls inlined = 15, statements flattened = 181
[2022-07-22 12:02:33,140 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2022-07-22 12:02:33,142 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2022-07-22 12:02:33,142 INFO L271 PluginConnector]: Initializing Boogie Preprocessor...
[2022-07-22 12:02:33,142 INFO L275 PluginConnector]: Boogie Preprocessor initialized
[2022-07-22 12:02:33,153 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:02:33" (1/1) ...
[2022-07-22 12:02:33,153 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:02:33" (1/1) ...
[2022-07-22 12:02:33,171 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:02:33" (1/1) ...
[2022-07-22 12:02:33,172 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:02:33" (1/1) ...
[2022-07-22 12:02:33,182 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:02:33" (1/1) ...
[2022-07-22 12:02:33,189 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:02:33" (1/1) ...
[2022-07-22 12:02:33,191 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:02:33" (1/1) ...
[2022-07-22 12:02:33,195 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2022-07-22 12:02:33,196 INFO L113 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2022-07-22 12:02:33,197 INFO L271 PluginConnector]: Initializing RCFGBuilder...
[2022-07-22 12:02:33,197 INFO L275 PluginConnector]: RCFGBuilder initialized
[2022-07-22 12:02:33,198 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:02:33" (1/1) ...
[2022-07-22 12:02:33,207 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2022-07-22 12:02:33,221 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-07-22 12:02:33,238 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-22 12:02:33,259 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-22 12:02:33,310 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2022-07-22 12:02:33,310 INFO L130 BoogieDeclarations]: Found specification of procedure thread1
[2022-07-22 12:02:33,310 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1
[2022-07-22 12:02:33,310 INFO L130 BoogieDeclarations]: Found specification of procedure thread2
[2022-07-22 12:02:33,311 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2
[2022-07-22 12:02:33,311 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int
[2022-07-22 12:02:33,311 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2022-07-22 12:02:33,311 INFO L130 BoogieDeclarations]: Found specification of procedure write~int
[2022-07-22 12:02:33,311 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap
[2022-07-22 12:02:33,312 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2022-07-22 12:02:33,312 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2022-07-22 12:02:33,312 INFO L130 BoogieDeclarations]: Found specification of procedure read~int
[2022-07-22 12:02:33,312 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2022-07-22 12:02:33,314 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement
[2022-07-22 12:02:33,413 INFO L234 CfgBuilder]: Building ICFG
[2022-07-22 12:02:33,415 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation
[2022-07-22 12:02:33,910 INFO L275 CfgBuilder]: Performing block encoding
[2022-07-22 12:02:33,926 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2022-07-22 12:02:33,927 INFO L299 CfgBuilder]: Removed 3 assume(true) statements.
[2022-07-22 12:02:33,930 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 12:02:33 BoogieIcfgContainer
[2022-07-22 12:02:33,930 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2022-07-22 12:02:33,931 INFO L113 PluginConnector]: ------------------------BuchiAutomizer----------------------------
[2022-07-22 12:02:33,932 INFO L271 PluginConnector]: Initializing BuchiAutomizer...
[2022-07-22 12:02:33,937 INFO L275 PluginConnector]: BuchiAutomizer initialized
[2022-07-22 12:02:33,938 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis
[2022-07-22 12:02:33,938 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.07 12:02:32" (1/3) ...
[2022-07-22 12:02:33,940 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5ccf2192 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.07 12:02:33, skipping insertion in model container
[2022-07-22 12:02:33,940 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis
[2022-07-22 12:02:33,941 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:02:33" (2/3) ...
[2022-07-22 12:02:33,941 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5ccf2192 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.07 12:02:33, skipping insertion in model container
[2022-07-22 12:02:33,941 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis
[2022-07-22 12:02:33,941 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 12:02:33" (3/3) ...
[2022-07-22 12:02:33,943 INFO L322 chiAutomizerObserver]: Analyzing ICFG unroll-cond-4.wvr.c
[2022-07-22 12:02:34,172 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions.
[2022-07-22 12:02:34,228 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 222 places, 238 transitions, 492 flow
[2022-07-22 12:02:34,417 INFO L129 PetriNetUnfolder]: 21/234 cut-off events.
[2022-07-22 12:02:34,417 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES.
[2022-07-22 12:02:34,426 INFO L84 FinitePrefix]: Finished finitePrefix Result has 243 conditions, 234 events. 21/234 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 400 event pairs, 0 based on Foata normal form. 0/213 useless extension candidates. Maximal degree in co-relation 141. Up to 2 conditions per place.
[2022-07-22 12:02:34,426 INFO L82 GeneralOperation]: Start removeDead. Operand has 222 places, 238 transitions, 492 flow
[2022-07-22 12:02:34,455 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 220 places, 234 transitions, 480 flow
[2022-07-22 12:02:34,473 INFO L300 stractBuchiCegarLoop]: Interprodecural is true
[2022-07-22 12:02:34,474 INFO L301 stractBuchiCegarLoop]: Hoare is false
[2022-07-22 12:02:34,474 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates
[2022-07-22 12:02:34,474 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE
[2022-07-22 12:02:34,474 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2022-07-22 12:02:34,474 INFO L305 stractBuchiCegarLoop]: Difference is false
[2022-07-22 12:02:34,474 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA
[2022-07-22 12:02:34,475 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ========
[2022-07-22 12:02:34,477 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 0 states, but on-demand construction may add more states
[2022-07-22 12:02:35,550 INFO L131 ngComponentsAnalysis]: Automaton has 214 accepting balls. 6641
[2022-07-22 12:02:35,551 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2022-07-22 12:02:35,551 INFO L119 BuchiIsEmpty]: Starting construction of run
[2022-07-22 12:02:35,561 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-07-22 12:02:35,561 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1]
[2022-07-22 12:02:35,562 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============
[2022-07-22 12:02:35,563 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 7618 states, but on-demand construction may add more states
[2022-07-22 12:02:35,740 INFO L131 ngComponentsAnalysis]: Automaton has 214 accepting balls. 6641
[2022-07-22 12:02:35,740 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2022-07-22 12:02:35,741 INFO L119 BuchiIsEmpty]: Starting construction of run
[2022-07-22 12:02:35,746 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-07-22 12:02:35,746 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1]
[2022-07-22 12:02:35,754 INFO L748 eck$LassoCheckResult]: Stem: 225#[ULTIMATE.startENTRY]don't care [541] ULTIMATE.startENTRY-->L-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 228#[L-1]don't care [454] 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] 230#[L-1-1]don't care [546] L-1-1-->L-1-2: Formula: (= (select |v_#valid_20| 0) 0) InVars {#valid=|v_#valid_20|} OutVars{#valid=|v_#valid_20|} AuxVars[] AssignedVars[] 232#[L-1-2]don't care [549] L-1-2-->L21: Formula: (< 0 |v_#StackHeapBarrier_2|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|} AuxVars[] AssignedVars[] 234#[L21]don't care [392] L21-->L21-1: Formula: (and (= (select |v_#valid_21| 1) 1) (= 2 (select |v_#length_16| 1))) InVars {#length=|v_#length_16|, #valid=|v_#valid_21|} OutVars{#length=|v_#length_16|, #valid=|v_#valid_21|} AuxVars[] AssignedVars[] 236#[L21-1]don't care [537] L21-1-->L21-2: Formula: (= 48 (select (select |v_#memory_int_17| 1) 0)) InVars {#memory_int=|v_#memory_int_17|} OutVars{#memory_int=|v_#memory_int_17|} AuxVars[] AssignedVars[] 238#[L21-2]don't care [461] L21-2-->L21-3: Formula: (= (select (select |v_#memory_int_18| 1) 1) 0) InVars {#memory_int=|v_#memory_int_18|} OutVars{#memory_int=|v_#memory_int_18|} AuxVars[] AssignedVars[] 240#[L21-3]don't care [503] L21-3-->L21-4: Formula: (and (= (select |v_#length_17| 2) 20) (= (select |v_#valid_22| 2) 1)) InVars {#length=|v_#length_17|, #valid=|v_#valid_22|} OutVars{#length=|v_#length_17|, #valid=|v_#valid_22|} AuxVars[] AssignedVars[] 242#[L21-4]don't care [373] L21-4-->L42: Formula: (and (= v_~f~0.base_10 0) (= v_~f~0.offset_10 0)) InVars {} OutVars{~f~0.base=v_~f~0.base_10, ~f~0.offset=v_~f~0.offset_10} AuxVars[] AssignedVars[~f~0.base, ~f~0.offset] 244#[L42]don't care [368] L42-->L42-1: Formula: (= v_~x1~0_5 0) InVars {} OutVars{~x1~0=v_~x1~0_5} AuxVars[] AssignedVars[~x1~0] 246#[L42-1]don't care [538] L42-1-->L42-2: Formula: (= v_~x2~0_23 0) InVars {} OutVars{~x2~0=v_~x2~0_23} AuxVars[] AssignedVars[~x2~0] 248#[L42-2]don't care [478] L42-2-->L43: Formula: (= 0 v_~size~0_9) InVars {} OutVars{~size~0=v_~size~0_9} AuxVars[] AssignedVars[~size~0] 250#[L43]don't care [544] L43-->L-1-3: Formula: (= v_~n~0_11 0) InVars {} OutVars{~n~0=v_~n~0_11} AuxVars[] AssignedVars[~n~0] 252#[L-1-3]don't care [554] L-1-3-->L-1-4: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 254#[L-1-4]don't care [357] L-1-4-->L-1-5: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 256#[L-1-5]don't care [440] L-1-5-->L-1-6: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1] 258#[L-1-6]don't care [532] L-1-6-->L92: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~ret19#1.base=|v_ULTIMATE.start_main_#t~ret19#1.base_4|, ULTIMATE.start_main_#t~nondet23#1=|v_ULTIMATE.start_main_#t~nondet23#1_2|, ULTIMATE.start_main_#t~nondet21#1=|v_ULTIMATE.start_main_#t~nondet21#1_2|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_5|, ULTIMATE.start_main_#t~nondet18#1=|v_ULTIMATE.start_main_#t~nondet18#1_1|, ULTIMATE.start_main_#t~ret19#1.offset=|v_ULTIMATE.start_main_#t~ret19#1.offset_4|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_5|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_5|, ULTIMATE.start_main_#t~mem25#1=|v_ULTIMATE.start_main_#t~mem25#1_3|, ULTIMATE.start_main_#t~pre20#1=|v_ULTIMATE.start_main_#t~pre20#1_4|, ULTIMATE.start_main_#t~pre22#1=|v_ULTIMATE.start_main_#t~pre22#1_4|, ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_1|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_5|, ULTIMATE.start_main_#t~mem24#1=|v_ULTIMATE.start_main_#t~mem24#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret19#1.base, ULTIMATE.start_main_#t~nondet23#1, ULTIMATE.start_main_#t~nondet21#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_#t~nondet18#1, ULTIMATE.start_main_#t~ret19#1.offset, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_#t~mem25#1, ULTIMATE.start_main_#t~pre20#1, ULTIMATE.start_main_#t~pre22#1, ULTIMATE.start_main_#t~nondet17#1, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_main_#t~mem24#1] 260#[L92]don't care [404] L92-->L92-1: Formula: (and (= |v_ULTIMATE.start_main_~#t1~0#1.offset_6| 0) (= (select |v_#valid_24| |v_ULTIMATE.start_main_~#t1~0#1.base_6|) 0) (not (= |v_ULTIMATE.start_main_~#t1~0#1.base_6| 0)) (= (store |v_#length_19| |v_ULTIMATE.start_main_~#t1~0#1.base_6| 4) |v_#length_18|) (< |v_#StackHeapBarrier_3| |v_ULTIMATE.start_main_~#t1~0#1.base_6|) (= |v_#valid_23| (store |v_#valid_24| |v_ULTIMATE.start_main_~#t1~0#1.base_6| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_19|, #valid=|v_#valid_24|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_18|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_6|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_6|, #valid=|v_#valid_23|} AuxVars[] AssignedVars[#valid, #length, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t1~0#1.offset] 262#[L92-1]don't care [396] L92-1-->L92-2: Formula: (and (= |v_#length_20| (store |v_#length_21| |v_ULTIMATE.start_main_~#t2~0#1.base_6| 4)) (= |v_#valid_25| (store |v_#valid_26| |v_ULTIMATE.start_main_~#t2~0#1.base_6| 1)) (not (= |v_ULTIMATE.start_main_~#t2~0#1.base_6| 0)) (= (select |v_#valid_26| |v_ULTIMATE.start_main_~#t2~0#1.base_6|) 0) (< |v_#StackHeapBarrier_4| |v_ULTIMATE.start_main_~#t2~0#1.base_6|) (= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_6|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_4|, #length=|v_#length_21|, #valid=|v_#valid_26|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_4|, #length=|v_#length_20|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_6|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_6|, #valid=|v_#valid_25|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2~0#1.offset, #valid, #length, ULTIMATE.start_main_~#t2~0#1.base] 264#[L92-2]don't care [474] L92-2-->L95: Formula: (= v_~n~0_12 |v_ULTIMATE.start_main_#t~nondet17#1_2|) InVars {ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_2|} OutVars{~n~0=v_~n~0_12, ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_2|} AuxVars[] AssignedVars[~n~0] 266#[L95]don't care [506] L95-->L96: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet17#1] 268#[L96]don't care [531] L96-->L96-1: Formula: (= v_~size~0_10 |v_ULTIMATE.start_main_#t~nondet18#1_2|) InVars {ULTIMATE.start_main_#t~nondet18#1=|v_ULTIMATE.start_main_#t~nondet18#1_2|} OutVars{~size~0=v_~size~0_10, ULTIMATE.start_main_#t~nondet18#1=|v_ULTIMATE.start_main_#t~nondet18#1_2|} AuxVars[] AssignedVars[~size~0] 270#[L96-1]don't care [484] L96-1-->L97: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet18#1=|v_ULTIMATE.start_main_#t~nondet18#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet18#1] 272#[L97]don't care [488] L97-->L97-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 274#[L97-1]don't care [502] L97-1-->L97-2: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_3| (ite (< 0 v_~size~0_11) 1 0)) InVars {~size~0=v_~size~0_11} OutVars{~size~0=v_~size~0_11, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1] 276#[L97-2]don't care [424] L97-2-->L37: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 278#[L37]don't care [370] L37-->L38: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_4| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_6|) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_4|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_6|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 280#[L38]don't care [481] L38-->L37-1: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_8| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_8|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_8|} AuxVars[] AssignedVars[] 284#[L37-1]don't care [472] L37-1-->L98: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 286#[L98]don't care [520] L98-->L98-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 288#[L98-1]don't care [439] L98-1-->L98-2: Formula: (= v_~size~0_12 |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_1|) InVars {~size~0=v_~size~0_12} OutVars{ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_1|, ~size~0=v_~size~0_12} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#in~size#1] 290#[L98-2]don't care [498] L98-2-->L98-3: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_3|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_3|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base] 292#[L98-3]don't care [393] L98-3-->L112: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_4|, ULTIMATE.start_create_fresh_int_array_#t~nondet28#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet28#1_3|, ULTIMATE.start_create_fresh_int_array_#t~post27#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post27#1_4|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_4|, ULTIMATE.start_create_fresh_int_array_#t~malloc26#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc26#1.offset_4|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_7|, ULTIMATE.start_create_fresh_int_array_#t~malloc26#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc26#1.base_4|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_create_fresh_int_array_#t~nondet28#1, ULTIMATE.start_create_fresh_int_array_#t~post27#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc26#1.offset, ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_create_fresh_int_array_#t~malloc26#1.base, ULTIMATE.start_create_fresh_int_array_~size#1] 294#[L112]don't care [466] L112-->L113: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_~size#1_5| |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_2|) InVars {ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_2|} OutVars{ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_2|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~size#1] 296#[L113]don't care [533] L113-->L113-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 298#[L113-1]don't care [336] L113-1-->L113-2: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_5| (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_6|) 1 0)) InVars {ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_6|} OutVars{ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_6|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1] 300#[L113-2]don't care [462] L113-2-->L37-2: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_9|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 302#[L37-2]don't care [442] L37-2-->L38-3: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_6| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_10|) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_6|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_10|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_6|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 304#[L38-3]don't care [352] L38-3-->L37-3: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_12| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_12|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_12|} AuxVars[] AssignedVars[] 306#[L37-3]don't care [344] L37-3-->L114: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 310#[L114]don't care [365] L114-->L114-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 312#[L114-1]don't care [510] L114-1-->L114-2: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_7| (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_7| 4294967296) 1073741823) 1 0)) InVars {ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_7|} OutVars{ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_7|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1] 314#[L114-2]don't care [354] L114-2-->L37-4: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_13|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 316#[L37-4]don't care [530] L37-4-->L38-6: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_8| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_14|) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_8|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_14|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_8|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 318#[L38-6]don't care [391] L38-6-->L37-5: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_16| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_16|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_16|} AuxVars[] AssignedVars[] 322#[L37-5]don't care [381] L37-5-->L116: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 324#[L116]don't care [449] L116-->L116-1: Formula: (and (= (store |v_#valid_10| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc26#1.base_1| 1) |v_#valid_9|) (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc26#1.offset_1| 0) (= (store |v_#length_10| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc26#1.base_1| (* |v_ULTIMATE.start_create_fresh_int_array_~size#1_1| 4)) |v_#length_9|) (< |v_ULTIMATE.start_create_fresh_int_array_#t~malloc26#1.base_1| |v_#StackHeapBarrier_1|) (not (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc26#1.base_1| 0)) (= (select |v_#valid_10| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc26#1.base_1|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_10|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_1|, #valid=|v_#valid_10|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_9|, ULTIMATE.start_create_fresh_int_array_#t~malloc26#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc26#1.offset_1|, #length=|v_#length_9|, ULTIMATE.start_create_fresh_int_array_#t~malloc26#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc26#1.base_1|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_1|} AuxVars[] AssignedVars[#valid, ULTIMATE.start_create_fresh_int_array_#t~malloc26#1.offset, #length, ULTIMATE.start_create_fresh_int_array_#t~malloc26#1.base] 326#[L116-1]don't care [515] L116-1-->L116-2: Formula: (and (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc26#1.base_2| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_1|) (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc26#1.offset_2| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_1|)) InVars {ULTIMATE.start_create_fresh_int_array_#t~malloc26#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc26#1.offset_2|, ULTIMATE.start_create_fresh_int_array_#t~malloc26#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc26#1.base_2|} OutVars{ULTIMATE.start_create_fresh_int_array_#t~malloc26#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc26#1.offset_2|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_1|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_1|, ULTIMATE.start_create_fresh_int_array_#t~malloc26#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc26#1.base_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base] 328#[L116-2]don't care [535] L116-2-->L117: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~malloc26#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc26#1.offset_3|, ULTIMATE.start_create_fresh_int_array_#t~malloc26#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc26#1.base_3|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~malloc26#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc26#1.base] 330#[L117]don't care [331] L117-->L117-6: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_1| 0) InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~2#1] 332#[L117-6]don't care
[2022-07-22 12:02:35,755 INFO L750 eck$LassoCheckResult]: Loop: 332#[L117-6]don't care [348] L117-6-->L118: Formula: (< |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_3| |v_ULTIMATE.start_create_fresh_int_array_~size#1_3|) InVars {ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_3|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_3|} OutVars{ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_3|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_3|} AuxVars[] AssignedVars[] 336#[L118]don't care [509] L118-->L118-1: Formula: (let ((.cse1 (* 4 |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_4|))) (let ((.cse0 (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_2| .cse1))) (and (<= 0 .cse0) (= (select |v_#valid_11| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2|) 1) (= (store |v_#memory_int_10| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2| (store (select |v_#memory_int_10| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2|) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet28#1_1|)) |v_#memory_int_9|) (<= (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_2| .cse1 4) (select |v_#length_11| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2|))))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_2|, ULTIMATE.start_create_fresh_int_array_#t~nondet28#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet28#1_1|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2|, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_10|, #length=|v_#length_11|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_4|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_2|, ULTIMATE.start_create_fresh_int_array_#t~nondet28#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet28#1_1|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2|, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_9|, #length=|v_#length_11|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_4|} AuxVars[] AssignedVars[#memory_int] 340#[L118-1]don't care [366] L118-1-->L117-3: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~nondet28#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet28#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~nondet28#1] 344#[L117-3]don't care [326] L117-3-->L117-4: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_#t~post27#1_1| |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_5|) InVars {ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_5|} OutVars{ULTIMATE.start_create_fresh_int_array_#t~post27#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post27#1_1|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post27#1] 348#[L117-4]don't care [380] L117-4-->L117-5: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_6| (+ |v_ULTIMATE.start_create_fresh_int_array_#t~post27#1_2| 1)) InVars {ULTIMATE.start_create_fresh_int_array_#t~post27#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post27#1_2|} OutVars{ULTIMATE.start_create_fresh_int_array_#t~post27#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post27#1_2|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_6|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~2#1] 352#[L117-5]don't care [496] L117-5-->L117-6: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~post27#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post27#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post27#1] 332#[L117-6]don't care
[2022-07-22 12:02:35,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-07-22 12:02:35,762 INFO L85 PathProgramCache]: Analyzing trace with hash 727006704, now seen corresponding path program 1 times
[2022-07-22 12:02:35,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-07-22 12:02:35,774 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125156121]
[2022-07-22 12:02:35,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-07-22 12:02:35,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-07-22 12:02:35,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2022-07-22 12:02:35,949 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2022-07-22 12:02:36,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2022-07-22 12:02:36,085 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2022-07-22 12:02:36,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-07-22 12:02:36,089 INFO L85 PathProgramCache]: Analyzing trace with hash -1553152402, now seen corresponding path program 1 times
[2022-07-22 12:02:36,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-07-22 12:02:36,091 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241050126]
[2022-07-22 12:02:36,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-07-22 12:02:36,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-07-22 12:02:36,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2022-07-22 12:02:36,128 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2022-07-22 12:02:36,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2022-07-22 12:02:36,152 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2022-07-22 12:02:36,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-07-22 12:02:36,158 INFO L85 PathProgramCache]: Analyzing trace with hash 2047972637, now seen corresponding path program 1 times
[2022-07-22 12:02:36,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-07-22 12:02:36,159 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232675481]
[2022-07-22 12:02:36,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-07-22 12:02:36,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-07-22 12:02:36,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2022-07-22 12:02:36,240 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2022-07-22 12:02:36,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2022-07-22 12:02:36,282 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2022-07-22 12:02:37,289 INFO L210 LassoAnalysis]: Preferences:
[2022-07-22 12:02:37,289 INFO L126 ssoRankerPreferences]: Compute integeral hull: false
[2022-07-22 12:02:37,289 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true
[2022-07-22 12:02:37,290 INFO L128 ssoRankerPreferences]: Term annotations enabled: false
[2022-07-22 12:02:37,290 INFO L129 ssoRankerPreferences]: Use exernal solver: false
[2022-07-22 12:02:37,290 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2022-07-22 12:02:37,290 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false
[2022-07-22 12:02:37,290 INFO L132 ssoRankerPreferences]: Path of dumped script:
[2022-07-22 12:02:37,291 INFO L133 ssoRankerPreferences]: Filename of dumped script: unroll-cond-4.wvr.c_BEv2_Iteration1_Lasso
[2022-07-22 12:02:37,291 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank
[2022-07-22 12:02:37,291 INFO L276 LassoAnalysis]: Starting lasso preprocessing...
[2022-07-22 12:02:37,315 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2022-07-22 12:02:37,321 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2022-07-22 12:02:37,324 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2022-07-22 12:02:37,326 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2022-07-22 12:02:37,329 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2022-07-22 12:02:37,332 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2022-07-22 12:02:37,334 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2022-07-22 12:02:37,336 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2022-07-22 12:02:37,338 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2022-07-22 12:02:37,341 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2022-07-22 12:02:37,344 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2022-07-22 12:02:37,346 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2022-07-22 12:02:37,348 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2022-07-22 12:02:37,351 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2022-07-22 12:02:37,710 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2022-07-22 12:02:37,712 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2022-07-22 12:02:37,714 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2022-07-22 12:02:37,717 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2022-07-22 12:02:37,719 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2022-07-22 12:02:37,721 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2022-07-22 12:02:37,723 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2022-07-22 12:02:37,726 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2022-07-22 12:02:37,728 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2022-07-22 12:02:37,730 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2022-07-22 12:02:37,732 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2022-07-22 12:02:37,738 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2022-07-22 12:02:37,740 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2022-07-22 12:02:37,742 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2022-07-22 12:02:37,745 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2022-07-22 12:02:37,747 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2022-07-22 12:02:37,749 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2022-07-22 12:02:38,188 INFO L294 LassoAnalysis]: Preprocessing complete.
[2022-07-22 12:02:38,193 INFO L490 LassoAnalysis]: Using template 'affine'.
[2022-07-22 12:02:38,195 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2022-07-22 12:02:38,195 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-07-22 12:02:38,202 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-22 12:02:38,204 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-22 12:02:38,204 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-22 12:02:38,213 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2022-07-22 12:02:38,214 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2022-07-22 12:02:38,214 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2022-07-22 12:02:38,214 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2022-07-22 12:02:38,215 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2022-07-22 12:02:38,217 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2022-07-22 12:02:38,217 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2022-07-22 12:02:38,233 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings.
[2022-07-22 12:02:38,260 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0
[2022-07-22 12:02:38,261 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2022-07-22 12:02:38,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-07-22 12:02:38,263 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-22 12:02:38,272 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-22 12:02:38,274 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-22 12:02:38,284 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2022-07-22 12:02:38,284 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2022-07-22 12:02:38,284 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2022-07-22 12:02:38,284 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2022-07-22 12:02:38,284 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2022-07-22 12:02:38,285 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2022-07-22 12:02:38,285 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2022-07-22 12:02:38,299 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings.
[2022-07-22 12:02:38,336 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0
[2022-07-22 12:02:38,337 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2022-07-22 12:02:38,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-07-22 12:02:38,339 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-22 12:02:38,341 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-22 12:02:38,349 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-22 12:02:38,352 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2022-07-22 12:02:38,352 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2022-07-22 12:02:38,352 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2022-07-22 12:02:38,353 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2022-07-22 12:02:38,353 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2022-07-22 12:02:38,353 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2022-07-22 12:02:38,354 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2022-07-22 12:02:38,363 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings.
[2022-07-22 12:02:38,397 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0
[2022-07-22 12:02:38,398 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2022-07-22 12:02:38,398 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-07-22 12:02:38,400 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-22 12:02:38,405 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-22 12:02:38,405 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-22 12:02:38,413 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2022-07-22 12:02:38,414 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2022-07-22 12:02:38,414 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2022-07-22 12:02:38,414 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2022-07-22 12:02:38,418 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications.
[2022-07-22 12:02:38,418 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added.
[2022-07-22 12:02:38,425 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings.
[2022-07-22 12:02:38,447 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-22 12:02:38,449 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2022-07-22 12:02:38,449 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-07-22 12:02:38,450 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-22 12:02:38,452 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-22 12:02:38,464 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-22 12:02:38,472 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2022-07-22 12:02:38,472 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2022-07-22 12:02:38,472 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2022-07-22 12:02:38,473 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2022-07-22 12:02:38,475 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications.
[2022-07-22 12:02:38,476 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added.
[2022-07-22 12:02:38,501 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings.
[2022-07-22 12:02:38,523 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0
[2022-07-22 12:02:38,523 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2022-07-22 12:02:38,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-07-22 12:02:38,526 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-22 12:02:38,529 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-22 12:02:38,531 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-22 12:02:38,537 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2022-07-22 12:02:38,538 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2022-07-22 12:02:38,538 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2022-07-22 12:02:38,538 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2022-07-22 12:02:38,538 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2022-07-22 12:02:38,539 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2022-07-22 12:02:38,539 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2022-07-22 12:02:38,542 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings.
[2022-07-22 12:02:38,565 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0
[2022-07-22 12:02:38,565 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2022-07-22 12:02:38,566 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-07-22 12:02:38,567 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-22 12:02:38,568 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-22 12:02:38,570 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-22 12:02:38,577 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2022-07-22 12:02:38,577 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2022-07-22 12:02:38,577 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2022-07-22 12:02:38,577 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2022-07-22 12:02:38,577 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2022-07-22 12:02:38,578 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2022-07-22 12:02:38,578 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2022-07-22 12:02:38,579 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings.
[2022-07-22 12:02:38,602 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-22 12:02:38,602 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2022-07-22 12:02:38,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-07-22 12:02:38,603 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-22 12:02:38,604 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-22 12:02:38,607 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-22 12:02:38,614 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2022-07-22 12:02:38,614 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2022-07-22 12:02:38,614 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2022-07-22 12:02:38,614 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2022-07-22 12:02:38,614 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2022-07-22 12:02:38,615 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2022-07-22 12:02:38,615 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2022-07-22 12:02:38,631 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings.
[2022-07-22 12:02:38,654 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0
[2022-07-22 12:02:38,654 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2022-07-22 12:02:38,654 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-07-22 12:02:38,655 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-22 12:02:38,657 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-22 12:02:38,659 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-22 12:02:38,668 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2022-07-22 12:02:38,668 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2022-07-22 12:02:38,668 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2022-07-22 12:02:38,668 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2022-07-22 12:02:38,672 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications.
[2022-07-22 12:02:38,672 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added.
[2022-07-22 12:02:38,688 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings.
[2022-07-22 12:02:38,710 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-22 12:02:38,711 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2022-07-22 12:02:38,711 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-07-22 12:02:38,712 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-22 12:02:38,712 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-22 12:02:38,721 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-22 12:02:38,729 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2022-07-22 12:02:38,730 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2022-07-22 12:02:38,730 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2022-07-22 12:02:38,730 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2022-07-22 12:02:38,738 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications.
[2022-07-22 12:02:38,738 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added.
[2022-07-22 12:02:38,754 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings.
[2022-07-22 12:02:38,784 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0
[2022-07-22 12:02:38,784 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2022-07-22 12:02:38,785 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-07-22 12:02:38,786 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-22 12:02:38,787 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-22 12:02:38,789 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-22 12:02:38,797 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2022-07-22 12:02:38,797 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2022-07-22 12:02:38,797 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2022-07-22 12:02:38,797 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2022-07-22 12:02:38,797 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2022-07-22 12:02:38,799 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2022-07-22 12:02:38,800 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2022-07-22 12:02:38,802 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings.
[2022-07-22 12:02:38,824 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0
[2022-07-22 12:02:38,824 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2022-07-22 12:02:38,825 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-07-22 12:02:38,826 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-22 12:02:38,827 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-22 12:02:38,829 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-22 12:02:38,836 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2022-07-22 12:02:38,836 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2022-07-22 12:02:38,836 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2022-07-22 12:02:38,836 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2022-07-22 12:02:38,843 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications.
[2022-07-22 12:02:38,843 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added.
[2022-07-22 12:02:38,861 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings.
[2022-07-22 12:02:38,897 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-22 12:02:38,897 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2022-07-22 12:02:38,897 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-07-22 12:02:38,898 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-22 12:02:38,908 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-22 12:02:38,917 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-22 12:02:38,917 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2022-07-22 12:02:38,917 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2022-07-22 12:02:38,917 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2022-07-22 12:02:38,918 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2022-07-22 12:02:38,919 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications.
[2022-07-22 12:02:38,920 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added.
[2022-07-22 12:02:38,925 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings.
[2022-07-22 12:02:38,947 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-22 12:02:38,947 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2022-07-22 12:02:38,947 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-07-22 12:02:38,948 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2022-07-22 12:02:38,949 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process
[2022-07-22 12:02:38,952 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-22 12:02:38,959 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2022-07-22 12:02:38,959 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2022-07-22 12:02:38,960 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2022-07-22 12:02:38,960 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2022-07-22 12:02:38,962 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications.
[2022-07-22 12:02:38,962 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added.
[2022-07-22 12:02:38,983 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings.
[2022-07-22 12:02:39,007 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0
[2022-07-22 12:02:39,007 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2022-07-22 12:02:39,008 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-07-22 12:02:39,009 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2022-07-22 12:02:39,011 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process
[2022-07-22 12:02:39,011 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-22 12:02:39,018 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2022-07-22 12:02:39,018 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2022-07-22 12:02:39,018 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2022-07-22 12:02:39,019 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2022-07-22 12:02:39,021 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications.
[2022-07-22 12:02:39,022 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added.
[2022-07-22 12:02:39,025 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings.
[2022-07-22 12:02:39,049 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0
[2022-07-22 12:02:39,049 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2022-07-22 12:02:39,050 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-07-22 12:02:39,051 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2022-07-22 12:02:39,052 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process
[2022-07-22 12:02:39,052 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-22 12:02:39,059 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2022-07-22 12:02:39,059 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2022-07-22 12:02:39,059 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2022-07-22 12:02:39,059 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2022-07-22 12:02:39,061 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications.
[2022-07-22 12:02:39,061 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added.
[2022-07-22 12:02:39,086 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings.
[2022-07-22 12:02:39,122 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0
[2022-07-22 12:02:39,122 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2022-07-22 12:02:39,122 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-07-22 12:02:39,123 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2022-07-22 12:02:39,132 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-22 12:02:39,140 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2022-07-22 12:02:39,141 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2022-07-22 12:02:39,141 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2022-07-22 12:02:39,141 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2022-07-22 12:02:39,141 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2022-07-22 12:02:39,142 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2022-07-22 12:02:39,142 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2022-07-22 12:02:39,143 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process
[2022-07-22 12:02:39,153 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings.
[2022-07-22 12:02:39,182 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0
[2022-07-22 12:02:39,182 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2022-07-22 12:02:39,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-07-22 12:02:39,184 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2022-07-22 12:02:39,185 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process
[2022-07-22 12:02:39,186 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-22 12:02:39,193 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2022-07-22 12:02:39,194 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2022-07-22 12:02:39,194 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2022-07-22 12:02:39,194 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2022-07-22 12:02:39,196 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications.
[2022-07-22 12:02:39,196 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added.
[2022-07-22 12:02:39,224 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings.
[2022-07-22 12:02:39,258 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0
[2022-07-22 12:02:39,258 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2022-07-22 12:02:39,259 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-07-22 12:02:39,260 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2022-07-22 12:02:39,267 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-22 12:02:39,275 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2022-07-22 12:02:39,275 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2022-07-22 12:02:39,275 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2022-07-22 12:02:39,276 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2022-07-22 12:02:39,278 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications.
[2022-07-22 12:02:39,278 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added.
[2022-07-22 12:02:39,282 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process
[2022-07-22 12:02:39,289 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings.
[2022-07-22 12:02:39,314 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0
[2022-07-22 12:02:39,315 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2022-07-22 12:02:39,315 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-07-22 12:02:39,316 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2022-07-22 12:02:39,322 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-22 12:02:39,326 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process
[2022-07-22 12:02:39,331 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2022-07-22 12:02:39,331 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts
[2022-07-22 12:02:39,331 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2022-07-22 12:02:39,331 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2022-07-22 12:02:39,335 INFO L401 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications.
[2022-07-22 12:02:39,335 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added.
[2022-07-22 12:02:39,353 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings.
[2022-07-22 12:02:39,378 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0
[2022-07-22 12:02:39,379 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2022-07-22 12:02:39,379 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-07-22 12:02:39,380 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2022-07-22 12:02:39,381 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process
[2022-07-22 12:02:39,382 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-22 12:02:39,388 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2022-07-22 12:02:39,389 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2022-07-22 12:02:39,389 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2022-07-22 12:02:39,389 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2022-07-22 12:02:39,391 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications.
[2022-07-22 12:02:39,391 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added.
[2022-07-22 12:02:39,403 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings.
[2022-07-22 12:02:39,437 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0
[2022-07-22 12:02:39,438 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2022-07-22 12:02:39,438 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-07-22 12:02:39,439 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2022-07-22 12:02:39,441 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process
[2022-07-22 12:02:39,441 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-22 12:02:39,449 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2022-07-22 12:02:39,450 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2022-07-22 12:02:39,450 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2022-07-22 12:02:39,450 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2022-07-22 12:02:39,452 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications.
[2022-07-22 12:02:39,452 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added.
[2022-07-22 12:02:39,469 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings.
[2022-07-22 12:02:39,492 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0
[2022-07-22 12:02:39,492 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2022-07-22 12:02:39,492 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-07-22 12:02:39,493 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2022-07-22 12:02:39,494 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process
[2022-07-22 12:02:39,495 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-22 12:02:39,504 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2022-07-22 12:02:39,504 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2022-07-22 12:02:39,504 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2022-07-22 12:02:39,504 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2022-07-22 12:02:39,506 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications.
[2022-07-22 12:02:39,506 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added.
[2022-07-22 12:02:39,516 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings.
[2022-07-22 12:02:39,538 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0
[2022-07-22 12:02:39,538 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2022-07-22 12:02:39,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-07-22 12:02:39,539 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2022-07-22 12:02:39,543 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process
[2022-07-22 12:02:39,543 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-22 12:02:39,551 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2022-07-22 12:02:39,551 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2022-07-22 12:02:39,551 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2022-07-22 12:02:39,551 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2022-07-22 12:02:39,553 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications.
[2022-07-22 12:02:39,554 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added.
[2022-07-22 12:02:39,575 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings.
[2022-07-22 12:02:39,597 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0
[2022-07-22 12:02:39,597 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2022-07-22 12:02:39,597 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-07-22 12:02:39,598 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2022-07-22 12:02:39,599 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process
[2022-07-22 12:02:39,601 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-22 12:02:39,608 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2022-07-22 12:02:39,609 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2022-07-22 12:02:39,609 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2022-07-22 12:02:39,609 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2022-07-22 12:02:39,611 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications.
[2022-07-22 12:02:39,611 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added.
[2022-07-22 12:02:39,642 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings.
[2022-07-22 12:02:39,663 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Ended with exit code 0
[2022-07-22 12:02:39,664 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2022-07-22 12:02:39,664 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-07-22 12:02:39,665 INFO L229 MonitoredProcess]: Starting monitored process 27 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-22 12:02:39,666 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process
[2022-07-22 12:02:39,666 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-22 12:02:39,674 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2022-07-22 12:02:39,674 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2022-07-22 12:02:39,674 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2022-07-22 12:02:39,675 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2022-07-22 12:02:39,677 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications.
[2022-07-22 12:02:39,677 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added.
[2022-07-22 12:02:39,701 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings.
[2022-07-22 12:02:39,736 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0
[2022-07-22 12:02:39,736 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2022-07-22 12:02:39,736 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-07-22 12:02:39,737 INFO L229 MonitoredProcess]: Starting monitored process 28 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-22 12:02:39,740 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-22 12:02:39,748 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2022-07-22 12:02:39,749 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2022-07-22 12:02:39,749 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2022-07-22 12:02:39,749 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2022-07-22 12:02:39,751 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications.
[2022-07-22 12:02:39,751 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added.
[2022-07-22 12:02:39,751 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process
[2022-07-22 12:02:39,754 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings.
[2022-07-22 12:02:39,775 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Ended with exit code 0
[2022-07-22 12:02:39,775 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2022-07-22 12:02:39,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-07-22 12:02:39,779 INFO L229 MonitoredProcess]: Starting monitored process 29 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-22 12:02:39,782 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process
[2022-07-22 12:02:39,785 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-22 12:02:39,793 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2022-07-22 12:02:39,793 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2022-07-22 12:02:39,793 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2022-07-22 12:02:39,793 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2022-07-22 12:02:39,793 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2022-07-22 12:02:39,794 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2022-07-22 12:02:39,794 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2022-07-22 12:02:39,797 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings.
[2022-07-22 12:02:39,818 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Ended with exit code 0
[2022-07-22 12:02:39,819 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2022-07-22 12:02:39,819 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-07-22 12:02:39,820 INFO L229 MonitoredProcess]: Starting monitored process 30 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-22 12:02:39,820 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process
[2022-07-22 12:02:39,821 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false
[2022-07-22 12:02:39,827 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2022-07-22 12:02:39,828 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2022-07-22 12:02:39,828 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2022-07-22 12:02:39,828 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2022-07-22 12:02:39,833 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications.
[2022-07-22 12:02:39,833 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added.
[2022-07-22 12:02:39,856 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify.
[2022-07-22 12:02:39,922 INFO L443 ModelExtractionUtils]: Simplification made 13 calls to the SMT solver.
[2022-07-22 12:02:39,922 INFO L444 ModelExtractionUtils]: 10 out of 22 variables were initially zero. Simplification set additionally 9 variables to zero.
[2022-07-22 12:02:39,925 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2022-07-22 12:02:39,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-07-22 12:02:39,934 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2022-07-22 12:02:39,970 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process
[2022-07-22 12:02:39,970 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants...
[2022-07-22 12:02:39,994 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2.
[2022-07-22 12:02:39,995 INFO L513 LassoAnalysis]: Proved termination.
[2022-07-22 12:02:39,995 INFO L515 LassoAnalysis]: Termination argument consisting of:
Ranking function f(ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_create_fresh_int_array_~size#1) = -1*ULTIMATE.start_create_fresh_int_array_~i~2#1 + 1*ULTIMATE.start_create_fresh_int_array_~size#1
Supporting invariants []
[2022-07-22 12:02:40,042 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Forceful destruction successful, exit code 0
[2022-07-22 12:02:40,123 INFO L257 tatePredicateManager]: 14 out of 14 supporting invariants were superfluous and have been removed
[2022-07-22 12:02:40,149 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Forceful destruction successful, exit code 0
[2022-07-22 12:02:40,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-07-22 12:02:40,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-07-22 12:02:40,198 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 2 conjunts are in the unsatisfiable core
[2022-07-22 12:02:40,201 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-07-22 12:02:40,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-07-22 12:02:40,297 INFO L263 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 5 conjunts are in the unsatisfiable core
[2022-07-22 12:02:40,298 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-07-22 12:02:40,371 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-22 12:02:40,435 INFO L142 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-22 12:02:40,439 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand currently 7618 states, but on-demand construction may add more states Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 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-22 12:02:40,856 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand currently 7618 states, but on-demand construction may add more states. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 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 15223 states and 44254 transitions. Complement of second has 8 states.
[2022-07-22 12:02:40,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states
[2022-07-22 12:02:40,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 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-22 12:02:40,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 266 transitions.
[2022-07-22 12:02:40,869 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 266 transitions. Stem has 50 letters. Loop has 6 letters.
[2022-07-22 12:02:40,871 INFO L116 BuchiAccepts]: Finished buchiAccepts.
[2022-07-22 12:02:40,871 INFO L690 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted
[2022-07-22 12:02:40,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-07-22 12:02:40,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-07-22 12:02:40,912 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 2 conjunts are in the unsatisfiable core
[2022-07-22 12:02:40,914 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-07-22 12:02:40,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-07-22 12:02:40,968 INFO L263 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 5 conjunts are in the unsatisfiable core
[2022-07-22 12:02:40,969 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-07-22 12:02:41,017 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-22 12:02:41,018 INFO L142 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 4 loop predicates
[2022-07-22 12:02:41,018 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand currently 7618 states, but on-demand construction may add more states Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 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-22 12:02:41,412 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand currently 7618 states, but on-demand construction may add more states. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 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 15217 states and 44247 transitions. Complement of second has 10 states.
[2022-07-22 12:02:41,413 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-22 12:02:41,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 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-22 12:02:41,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 267 transitions.
[2022-07-22 12:02:41,415 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 267 transitions. Stem has 50 letters. Loop has 6 letters.
[2022-07-22 12:02:41,415 INFO L116 BuchiAccepts]: Finished buchiAccepts.
[2022-07-22 12:02:41,415 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 267 transitions. Stem has 56 letters. Loop has 6 letters.
[2022-07-22 12:02:41,417 INFO L116 BuchiAccepts]: Finished buchiAccepts.
[2022-07-22 12:02:41,417 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 267 transitions. Stem has 50 letters. Loop has 12 letters.
[2022-07-22 12:02:41,420 INFO L116 BuchiAccepts]: Finished buchiAccepts.
[2022-07-22 12:02:41,421 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15217 states and 44247 transitions.
[2022-07-22 12:02:41,700 INFO L131 ngComponentsAnalysis]: Automaton has 213 accepting balls. 6635
[2022-07-22 12:02:41,830 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15217 states to 6924 states and 20069 transitions.
[2022-07-22 12:02:41,831 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6917
[2022-07-22 12:02:41,853 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6918
[2022-07-22 12:02:41,854 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6924 states and 20069 transitions.
[2022-07-22 12:02:41,907 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2022-07-22 12:02:41,907 INFO L220 hiAutomatonCegarLoop]: Abstraction has 6924 states and 20069 transitions.
[2022-07-22 12:02:41,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6924 states and 20069 transitions.
[2022-07-22 12:02:42,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6924 to 6924.
[2022-07-22 12:02:42,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6924 states, 6924 states have (on average 2.8984690930098207) internal successors, (20069), 6923 states have internal predecessors, (20069), 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-22 12:02:42,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6924 states to 6924 states and 20069 transitions.
[2022-07-22 12:02:42,411 INFO L242 hiAutomatonCegarLoop]: Abstraction has 6924 states and 20069 transitions.
[2022-07-22 12:02:42,411 INFO L425 stractBuchiCegarLoop]: Abstraction has 6924 states and 20069 transitions.
[2022-07-22 12:02:42,412 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============
[2022-07-22 12:02:42,412 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6924 states and 20069 transitions.
[2022-07-22 12:02:42,573 INFO L131 ngComponentsAnalysis]: Automaton has 213 accepting balls. 6635
[2022-07-22 12:02:42,573 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2022-07-22 12:02:42,573 INFO L119 BuchiIsEmpty]: Starting construction of run
[2022-07-22 12:02:42,577 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, 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-22 12:02:42,578 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-07-22 12:02:42,579 INFO L748 eck$LassoCheckResult]: Stem: 60169#[ULTIMATE.startENTRY]don't care [541] ULTIMATE.startENTRY-->L-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 59221#[L-1]don't care [454] 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] 49487#[L-1-1]don't care [546] L-1-1-->L-1-2: Formula: (= (select |v_#valid_20| 0) 0) InVars {#valid=|v_#valid_20|} OutVars{#valid=|v_#valid_20|} AuxVars[] AssignedVars[] 49489#[L-1-2]don't care [549] L-1-2-->L21: Formula: (< 0 |v_#StackHeapBarrier_2|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|} AuxVars[] AssignedVars[] 55107#[L21]don't care [392] L21-->L21-1: Formula: (and (= (select |v_#valid_21| 1) 1) (= 2 (select |v_#length_16| 1))) InVars {#length=|v_#length_16|, #valid=|v_#valid_21|} OutVars{#length=|v_#length_16|, #valid=|v_#valid_21|} AuxVars[] AssignedVars[] 55109#[L21-1]don't care [537] L21-1-->L21-2: Formula: (= 48 (select (select |v_#memory_int_17| 1) 0)) InVars {#memory_int=|v_#memory_int_17|} OutVars{#memory_int=|v_#memory_int_17|} AuxVars[] AssignedVars[] 59479#[L21-2]don't care [461] L21-2-->L21-3: Formula: (= (select (select |v_#memory_int_18| 1) 1) 0) InVars {#memory_int=|v_#memory_int_18|} OutVars{#memory_int=|v_#memory_int_18|} AuxVars[] AssignedVars[] 59481#[L21-3]don't care [503] L21-3-->L21-4: Formula: (and (= (select |v_#length_17| 2) 20) (= (select |v_#valid_22| 2) 1)) InVars {#length=|v_#length_17|, #valid=|v_#valid_22|} OutVars{#length=|v_#length_17|, #valid=|v_#valid_22|} AuxVars[] AssignedVars[] 54227#[L21-4]don't care [373] L21-4-->L42: Formula: (and (= v_~f~0.base_10 0) (= v_~f~0.offset_10 0)) InVars {} OutVars{~f~0.base=v_~f~0.base_10, ~f~0.offset=v_~f~0.offset_10} AuxVars[] AssignedVars[~f~0.base, ~f~0.offset] 53167#[L42]don't care [368] L42-->L42-1: Formula: (= v_~x1~0_5 0) InVars {} OutVars{~x1~0=v_~x1~0_5} AuxVars[] AssignedVars[~x1~0] 53169#[L42-1]don't care [538] L42-1-->L42-2: Formula: (= v_~x2~0_23 0) InVars {} OutVars{~x2~0=v_~x2~0_23} AuxVars[] AssignedVars[~x2~0] 55561#[L42-2]don't care [478] L42-2-->L43: Formula: (= 0 v_~size~0_9) InVars {} OutVars{~size~0=v_~size~0_9} AuxVars[] AssignedVars[~size~0] 51875#[L43]don't care [544] L43-->L-1-3: Formula: (= v_~n~0_11 0) InVars {} OutVars{~n~0=v_~n~0_11} AuxVars[] AssignedVars[~n~0] 50833#[L-1-3]don't care [554] L-1-3-->L-1-4: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 50835#[L-1-4]don't care [357] L-1-4-->L-1-5: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 55677#[L-1-5]don't care [440] L-1-5-->L-1-6: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1] 56121#[L-1-6]don't care [532] L-1-6-->L92: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~ret19#1.base=|v_ULTIMATE.start_main_#t~ret19#1.base_4|, ULTIMATE.start_main_#t~nondet23#1=|v_ULTIMATE.start_main_#t~nondet23#1_2|, ULTIMATE.start_main_#t~nondet21#1=|v_ULTIMATE.start_main_#t~nondet21#1_2|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_5|, ULTIMATE.start_main_#t~nondet18#1=|v_ULTIMATE.start_main_#t~nondet18#1_1|, ULTIMATE.start_main_#t~ret19#1.offset=|v_ULTIMATE.start_main_#t~ret19#1.offset_4|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_5|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_5|, ULTIMATE.start_main_#t~mem25#1=|v_ULTIMATE.start_main_#t~mem25#1_3|, ULTIMATE.start_main_#t~pre20#1=|v_ULTIMATE.start_main_#t~pre20#1_4|, ULTIMATE.start_main_#t~pre22#1=|v_ULTIMATE.start_main_#t~pre22#1_4|, ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_1|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_5|, ULTIMATE.start_main_#t~mem24#1=|v_ULTIMATE.start_main_#t~mem24#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret19#1.base, ULTIMATE.start_main_#t~nondet23#1, ULTIMATE.start_main_#t~nondet21#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_#t~nondet18#1, ULTIMATE.start_main_#t~ret19#1.offset, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_#t~mem25#1, ULTIMATE.start_main_#t~pre20#1, ULTIMATE.start_main_#t~pre22#1, ULTIMATE.start_main_#t~nondet17#1, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_main_#t~mem24#1] 50067#[L92]don't care [404] L92-->L92-1: Formula: (and (= |v_ULTIMATE.start_main_~#t1~0#1.offset_6| 0) (= (select |v_#valid_24| |v_ULTIMATE.start_main_~#t1~0#1.base_6|) 0) (not (= |v_ULTIMATE.start_main_~#t1~0#1.base_6| 0)) (= (store |v_#length_19| |v_ULTIMATE.start_main_~#t1~0#1.base_6| 4) |v_#length_18|) (< |v_#StackHeapBarrier_3| |v_ULTIMATE.start_main_~#t1~0#1.base_6|) (= |v_#valid_23| (store |v_#valid_24| |v_ULTIMATE.start_main_~#t1~0#1.base_6| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_19|, #valid=|v_#valid_24|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_18|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_6|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_6|, #valid=|v_#valid_23|} AuxVars[] AssignedVars[#valid, #length, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t1~0#1.offset] 48625#[L92-1]don't care [396] L92-1-->L92-2: Formula: (and (= |v_#length_20| (store |v_#length_21| |v_ULTIMATE.start_main_~#t2~0#1.base_6| 4)) (= |v_#valid_25| (store |v_#valid_26| |v_ULTIMATE.start_main_~#t2~0#1.base_6| 1)) (not (= |v_ULTIMATE.start_main_~#t2~0#1.base_6| 0)) (= (select |v_#valid_26| |v_ULTIMATE.start_main_~#t2~0#1.base_6|) 0) (< |v_#StackHeapBarrier_4| |v_ULTIMATE.start_main_~#t2~0#1.base_6|) (= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_6|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_4|, #length=|v_#length_21|, #valid=|v_#valid_26|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_4|, #length=|v_#length_20|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_6|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_6|, #valid=|v_#valid_25|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2~0#1.offset, #valid, #length, ULTIMATE.start_main_~#t2~0#1.base] 48627#[L92-2]don't care [474] L92-2-->L95: Formula: (= v_~n~0_12 |v_ULTIMATE.start_main_#t~nondet17#1_2|) InVars {ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_2|} OutVars{~n~0=v_~n~0_12, ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_2|} AuxVars[] AssignedVars[~n~0] 56067#[L95]don't care [506] L95-->L96: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet17#1] 54761#[L96]don't care [531] L96-->L96-1: Formula: (= v_~size~0_10 |v_ULTIMATE.start_main_#t~nondet18#1_2|) InVars {ULTIMATE.start_main_#t~nondet18#1=|v_ULTIMATE.start_main_#t~nondet18#1_2|} OutVars{~size~0=v_~size~0_10, ULTIMATE.start_main_#t~nondet18#1=|v_ULTIMATE.start_main_#t~nondet18#1_2|} AuxVars[] AssignedVars[~size~0] 50523#[L96-1]don't care [484] L96-1-->L97: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet18#1=|v_ULTIMATE.start_main_#t~nondet18#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet18#1] 50525#[L97]don't care [488] L97-->L97-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 51675#[L97-1]don't care [502] L97-1-->L97-2: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_3| (ite (< 0 v_~size~0_11) 1 0)) InVars {~size~0=v_~size~0_11} OutVars{~size~0=v_~size~0_11, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1] 55469#[L97-2]don't care [424] L97-2-->L37: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 59171#[L37]don't care [370] L37-->L38: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_4| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_6|) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_4|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_6|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 49189#[L38]don't care [481] L38-->L37-1: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_8| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_8|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_8|} AuxVars[] AssignedVars[] 49191#[L37-1]don't care [472] L37-1-->L98: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 53713#[L98]don't care [520] L98-->L98-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 56653#[L98-1]don't care [439] L98-1-->L98-2: Formula: (= v_~size~0_12 |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_1|) InVars {~size~0=v_~size~0_12} OutVars{ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_1|, ~size~0=v_~size~0_12} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#in~size#1] 60149#[L98-2]don't care [498] L98-2-->L98-3: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_3|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_3|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base] 50009#[L98-3]don't care [393] L98-3-->L112: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_4|, ULTIMATE.start_create_fresh_int_array_#t~nondet28#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet28#1_3|, ULTIMATE.start_create_fresh_int_array_#t~post27#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post27#1_4|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_4|, ULTIMATE.start_create_fresh_int_array_#t~malloc26#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc26#1.offset_4|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_7|, ULTIMATE.start_create_fresh_int_array_#t~malloc26#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc26#1.base_4|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_create_fresh_int_array_#t~nondet28#1, ULTIMATE.start_create_fresh_int_array_#t~post27#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc26#1.offset, ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_create_fresh_int_array_#t~malloc26#1.base, ULTIMATE.start_create_fresh_int_array_~size#1] 50011#[L112]don't care [466] L112-->L113: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_~size#1_5| |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_2|) InVars {ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_2|} OutVars{ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_2|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~size#1] 55969#[L113]don't care [533] L113-->L113-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 56827#[L113-1]don't care [336] L113-1-->L113-2: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_5| (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_6|) 1 0)) InVars {ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_6|} OutVars{ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_6|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1] 52581#[L113-2]don't care [462] L113-2-->L37-2: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_9|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 52583#[L37-2]don't care [442] L37-2-->L38-3: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_6| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_10|) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_6|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_10|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_6|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 59629#[L38-3]don't care [352] L38-3-->L37-3: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_12| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_12|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_12|} AuxVars[] AssignedVars[] 58325#[L37-3]don't care [344] L37-3-->L114: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 57455#[L114]don't care [365] L114-->L114-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 50655#[L114-1]don't care [510] L114-1-->L114-2: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_7| (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_7| 4294967296) 1073741823) 1 0)) InVars {ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_7|} OutVars{ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_7|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1] 50657#[L114-2]don't care [354] L114-2-->L37-4: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_13|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 56221#[L37-4]don't care [530] L37-4-->L38-6: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_8| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_14|) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_8|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_14|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_8|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 56333#[L38-6]don't care [391] L38-6-->L37-5: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_16| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_16|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_16|} AuxVars[] AssignedVars[] 55751#[L37-5]don't care [381] L37-5-->L116: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 55753#[L116]don't care [449] L116-->L116-1: Formula: (and (= (store |v_#valid_10| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc26#1.base_1| 1) |v_#valid_9|) (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc26#1.offset_1| 0) (= (store |v_#length_10| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc26#1.base_1| (* |v_ULTIMATE.start_create_fresh_int_array_~size#1_1| 4)) |v_#length_9|) (< |v_ULTIMATE.start_create_fresh_int_array_#t~malloc26#1.base_1| |v_#StackHeapBarrier_1|) (not (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc26#1.base_1| 0)) (= (select |v_#valid_10| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc26#1.base_1|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_10|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_1|, #valid=|v_#valid_10|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_9|, ULTIMATE.start_create_fresh_int_array_#t~malloc26#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc26#1.offset_1|, #length=|v_#length_9|, ULTIMATE.start_create_fresh_int_array_#t~malloc26#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc26#1.base_1|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_1|} AuxVars[] AssignedVars[#valid, ULTIMATE.start_create_fresh_int_array_#t~malloc26#1.offset, #length, ULTIMATE.start_create_fresh_int_array_#t~malloc26#1.base] 58131#[L116-1]don't care [515] L116-1-->L116-2: Formula: (and (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc26#1.base_2| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_1|) (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc26#1.offset_2| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_1|)) InVars {ULTIMATE.start_create_fresh_int_array_#t~malloc26#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc26#1.offset_2|, ULTIMATE.start_create_fresh_int_array_#t~malloc26#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc26#1.base_2|} OutVars{ULTIMATE.start_create_fresh_int_array_#t~malloc26#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc26#1.offset_2|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_1|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_1|, ULTIMATE.start_create_fresh_int_array_#t~malloc26#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc26#1.base_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base] 60023#[L116-2]don't care [535] L116-2-->L117: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~malloc26#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc26#1.offset_3|, ULTIMATE.start_create_fresh_int_array_#t~malloc26#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc26#1.base_3|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~malloc26#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc26#1.base] 60121#[L117]don't care [331] L117-->L117-6: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_1| 0) InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~2#1] 53099#[L117-6]don't care [347] L117-6-->L117-7: Formula: (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_2| |v_ULTIMATE.start_create_fresh_int_array_~size#1_2|)) InVars {ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_2|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_2|} OutVars{ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_2|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_2|} AuxVars[] AssignedVars[] 53101#[L117-7]don't care [450] L117-7-->L120: Formula: (and (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_3| |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_1|) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3| |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_1|)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_3|} OutVars{ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_1|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_3|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base] 55383#[L120]don't care [460] L120-->L98-4: Formula: (and (= |v_ULTIMATE.start_main_#t~ret19#1.base_1| |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_2|) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_2| |v_ULTIMATE.start_main_#t~ret19#1.offset_1|)) InVars {ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_2|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_2|} OutVars{ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_2|, ULTIMATE.start_main_#t~ret19#1.base=|v_ULTIMATE.start_main_#t~ret19#1.base_1|, ULTIMATE.start_main_#t~ret19#1.offset=|v_ULTIMATE.start_main_#t~ret19#1.offset_1|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret19#1.base, ULTIMATE.start_main_#t~ret19#1.offset] 49265#[L98-4]don't care [495] L98-4-->L98-5: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 49267#[L98-5]don't care [473] L98-5-->L98-6: Formula: (and (= v_~f~0.offset_9 |v_ULTIMATE.start_main_#t~ret19#1.offset_2|) (= |v_ULTIMATE.start_main_#t~ret19#1.base_2| v_~f~0.base_9)) InVars {ULTIMATE.start_main_#t~ret19#1.offset=|v_ULTIMATE.start_main_#t~ret19#1.offset_2|, ULTIMATE.start_main_#t~ret19#1.base=|v_ULTIMATE.start_main_#t~ret19#1.base_2|} OutVars{ULTIMATE.start_main_#t~ret19#1.base=|v_ULTIMATE.start_main_#t~ret19#1.base_2|, ULTIMATE.start_main_#t~ret19#1.offset=|v_ULTIMATE.start_main_#t~ret19#1.offset_2|, ~f~0.base=v_~f~0.base_9, ~f~0.offset=v_~f~0.offset_9} AuxVars[] AssignedVars[~f~0.base, ~f~0.offset] 59871#[L98-6]don't care [388] L98-6-->L101: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~ret19#1.offset=|v_ULTIMATE.start_main_#t~ret19#1.offset_3|, ULTIMATE.start_main_#t~ret19#1.base=|v_ULTIMATE.start_main_#t~ret19#1.base_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret19#1.base, ULTIMATE.start_main_#t~ret19#1.offset] 59311#[L101]don't care [542] L101-->L101-1: Formula: (= |v_#pthreadsForks_1| |v_ULTIMATE.start_main_#t~pre20#1_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre20#1=|v_ULTIMATE.start_main_#t~pre20#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre20#1] 57113#[L101-1]don't care [444] L101-1-->L101-2: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] 57115#[L101-2]don't care [385] L101-2-->L101-3: Formula: (and (<= (+ |v_ULTIMATE.start_main_~#t1~0#1.offset_1| 4) (select |v_#length_12| |v_ULTIMATE.start_main_~#t1~0#1.base_1|)) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_1|) (= (select |v_#valid_12| |v_ULTIMATE.start_main_~#t1~0#1.base_1|) 1) (= |v_#memory_int_11| (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1~0#1.base_1| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1~0#1.base_1|) |v_ULTIMATE.start_main_~#t1~0#1.offset_1| |v_ULTIMATE.start_main_#t~pre20#1_2|)))) InVars {ULTIMATE.start_main_#t~pre20#1=|v_ULTIMATE.start_main_#t~pre20#1_2|, #valid=|v_#valid_12|, #memory_int=|v_#memory_int_12|, #length=|v_#length_12|, 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|} OutVars{ULTIMATE.start_main_#t~pre20#1=|v_ULTIMATE.start_main_#t~pre20#1_2|, #valid=|v_#valid_12|, #memory_int=|v_#memory_int_11|, #length=|v_#length_12|, 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|} AuxVars[] AssignedVars[#memory_int] 50553#[L101-3]don't care [693] L101-3-->thread1ENTRY: Formula: (and (= v_thread1Thread1of1ForFork1_thidvar0_2 |v_ULTIMATE.start_main_#t~pre20#1_6|) (= 0 v_thread1Thread1of1ForFork1_thidvar1_2)) InVars {ULTIMATE.start_main_#t~pre20#1=|v_ULTIMATE.start_main_#t~pre20#1_6|} OutVars{thread1Thread1of1ForFork1_#t~post2#1=|v_thread1Thread1of1ForFork1_#t~post2#1_8|, ULTIMATE.start_main_#t~pre20#1=|v_ULTIMATE.start_main_#t~pre20#1_6|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_6|, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_12|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_4|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_4|, thread1Thread1of1ForFork1_#t~mem1#1=|v_thread1Thread1of1ForFork1_#t~mem1#1_8|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_2, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_10|, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_~i~0#1, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#res#1.base, thread1Thread1of1ForFork1_#t~mem1#1, thread1Thread1of1ForFork1_thidvar1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_thidvar0] 50555#[L101-4, thread1ENTRY]don't care [558] thread1ENTRY-->L49-2: Formula: (= |v_thread1Thread1of1ForFork1_~i~0#1_1| 0) InVars {} OutVars{thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_~i~0#1] 56541#[L49-2, L101-4]don't care
[2022-07-22 12:02:42,580 INFO L750 eck$LassoCheckResult]: Loop: 56541#[L49-2, L101-4]don't care [561] L49-2-->L50: Formula: (< (mod |v_thread1Thread1of1ForFork1_~i~0#1_5| 4294967296) (mod v_~n~0_2 4294967296)) InVars {~n~0=v_~n~0_2, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_5|} OutVars{~n~0=v_~n~0_2, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_5|} AuxVars[] AssignedVars[] 51583#[L50, L101-4]don't care [563] L50-->L50-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 51585#[L50-1, L101-4]don't care [565] L50-1-->L50-2: Formula: (= (ite (and (< v_~x1~0_1 v_~size~0_1) (<= 0 v_~x1~0_1)) 1 0) |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|) InVars {~size~0=v_~size~0_1, ~x1~0=v_~x1~0_1} OutVars{~size~0=v_~size~0_1, ~x1~0=v_~x1~0_1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1] 47353#[L101-4, L50-2]don't care [566] L50-2-->L37: Formula: true InVars {} OutVars{thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] 47355#[L37, L101-4]don't care [567] L37-->L38: Formula: (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_3| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_3|) InVars {thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_3|} OutVars{thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_3|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_3|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] 54811#[L101-4, L38]don't care [569] L38-->L37-1: Formula: (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_7| 0)) InVars {thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_7|} OutVars{thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_7|} AuxVars[] AssignedVars[] 54817#[L37-1, L101-4]don't care [571] L37-1-->L51: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 54549#[L51, L101-4]don't care [572] L51-->L51-1: Formula: (let ((.cse1 (* v_~x1~0_2 4))) (let ((.cse0 (+ .cse1 v_~f~0.offset_1))) (and (= (select |v_#valid_1| v_~f~0.base_1) 1) (<= 0 .cse0) (= (select (select |v_#memory_int_1| v_~f~0.base_1) .cse0) |v_thread1Thread1of1ForFork1_#t~mem1#1_1|) (<= (+ .cse1 v_~f~0.offset_1 4) (select |v_#length_1| v_~f~0.base_1))))) InVars {~f~0.base=v_~f~0.base_1, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #length=|v_#length_1|, ~x1~0=v_~x1~0_2, ~f~0.offset=v_~f~0.offset_1} OutVars{~f~0.base=v_~f~0.base_1, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #length=|v_#length_1|, thread1Thread1of1ForFork1_#t~mem1#1=|v_thread1Thread1of1ForFork1_#t~mem1#1_1|, ~x1~0=v_~x1~0_2, ~f~0.offset=v_~f~0.offset_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem1#1] 54551#[L51-1, L101-4]don't care [573] L51-1-->L51-2: Formula: (= v_~x1~0_3 |v_thread1Thread1of1ForFork1_#t~mem1#1_3|) InVars {thread1Thread1of1ForFork1_#t~mem1#1=|v_thread1Thread1of1ForFork1_#t~mem1#1_3|} OutVars{thread1Thread1of1ForFork1_#t~mem1#1=|v_thread1Thread1of1ForFork1_#t~mem1#1_3|, ~x1~0=v_~x1~0_3} AuxVars[] AssignedVars[~x1~0] 58545#[L101-4, L51-2]don't care [574] L51-2-->L52: Formula: true InVars {} OutVars{thread1Thread1of1ForFork1_#t~mem1#1=|v_thread1Thread1of1ForFork1_#t~mem1#1_5|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem1#1] 58547#[L101-4, L52]don't care [575] L52-->L52-1: Formula: (= |v_thread1Thread1of1ForFork1_#t~post2#1_1| |v_thread1Thread1of1ForFork1_~i~0#1_7|) InVars {thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_7|} OutVars{thread1Thread1of1ForFork1_#t~post2#1=|v_thread1Thread1of1ForFork1_#t~post2#1_1|, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_7|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2#1] 60007#[L52-1, L101-4]don't care [576] L52-1-->L52-2: Formula: (= |v_thread1Thread1of1ForFork1_~i~0#1_9| (+ |v_thread1Thread1of1ForFork1_#t~post2#1_3| 1)) InVars {thread1Thread1of1ForFork1_#t~post2#1=|v_thread1Thread1of1ForFork1_#t~post2#1_3|} OutVars{thread1Thread1of1ForFork1_#t~post2#1=|v_thread1Thread1of1ForFork1_#t~post2#1_3|, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_9|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_~i~0#1] 60163#[L52-2, L101-4]don't care [577] L52-2-->L49-2: Formula: true InVars {} OutVars{thread1Thread1of1ForFork1_#t~post2#1=|v_thread1Thread1of1ForFork1_#t~post2#1_5|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2#1] 56541#[L49-2, L101-4]don't care
[2022-07-22 12:02:42,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-07-22 12:02:42,580 INFO L85 PathProgramCache]: Analyzing trace with hash 1561553015, now seen corresponding path program 1 times
[2022-07-22 12:02:42,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-07-22 12:02:42,581 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071253132]
[2022-07-22 12:02:42,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-07-22 12:02:42,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-07-22 12:02:42,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-07-22 12:02:42,744 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-22 12:02:42,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-07-22 12:02:42,745 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071253132]
[2022-07-22 12:02:42,746 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1071253132] provided 1 perfect and 0 imperfect interpolant sequences
[2022-07-22 12:02:42,746 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-07-22 12:02:42,746 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2022-07-22 12:02:42,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447435195]
[2022-07-22 12:02:42,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-07-22 12:02:42,750 INFO L753 eck$LassoCheckResult]: stem already infeasible
[2022-07-22 12:02:42,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-07-22 12:02:42,751 INFO L85 PathProgramCache]: Analyzing trace with hash 1728928792, now seen corresponding path program 1 times
[2022-07-22 12:02:42,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-07-22 12:02:42,751 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321788523]
[2022-07-22 12:02:42,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-07-22 12:02:42,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-07-22 12:02:42,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2022-07-22 12:02:42,767 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2022-07-22 12:02:42,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2022-07-22 12:02:42,776 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2022-07-22 12:02:42,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-07-22 12:02:42,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2022-07-22 12:02:42,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56
[2022-07-22 12:02:42,893 INFO L87 Difference]: Start difference. First operand 6924 states and 20069 transitions. cyclomatic complexity: 13359 Second operand has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 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-22 12:02:43,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-07-22 12:02:43,064 INFO L93 Difference]: Finished difference Result 6928 states and 18908 transitions.
[2022-07-22 12:02:43,064 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 6928 states and 18908 transitions.
[2022-07-22 12:02:43,156 INFO L131 ngComponentsAnalysis]: Automaton has 233 accepting balls. 6353
[2022-07-22 12:02:43,299 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 6928 states to 6672 states and 18201 transitions.
[2022-07-22 12:02:43,299 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6662
[2022-07-22 12:02:43,312 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6662
[2022-07-22 12:02:43,312 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6672 states and 18201 transitions.
[2022-07-22 12:02:43,328 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2022-07-22 12:02:43,329 INFO L220 hiAutomatonCegarLoop]: Abstraction has 6672 states and 18201 transitions.
[2022-07-22 12:02:43,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6672 states and 18201 transitions.
[2022-07-22 12:02:43,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6672 to 6668.
[2022-07-22 12:02:43,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6668 states, 6668 states have (on average 2.729004199160168) internal successors, (18197), 6667 states have internal predecessors, (18197), 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-22 12:02:43,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6668 states to 6668 states and 18197 transitions.
[2022-07-22 12:02:43,557 INFO L242 hiAutomatonCegarLoop]: Abstraction has 6668 states and 18197 transitions.
[2022-07-22 12:02:43,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states.
[2022-07-22 12:02:43,558 INFO L425 stractBuchiCegarLoop]: Abstraction has 6668 states and 18197 transitions.
[2022-07-22 12:02:43,558 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============
[2022-07-22 12:02:43,559 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6668 states and 18197 transitions.
[2022-07-22 12:02:43,661 INFO L131 ngComponentsAnalysis]: Automaton has 233 accepting balls. 6353
[2022-07-22 12:02:43,661 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2022-07-22 12:02:43,661 INFO L119 BuchiIsEmpty]: Starting construction of run
[2022-07-22 12:02:43,663 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, 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-22 12:02:43,663 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-07-22 12:02:43,672 INFO L748 eck$LassoCheckResult]: Stem: 80452#[ULTIMATE.startENTRY]don't care [541] ULTIMATE.startENTRY-->L-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 79490#[L-1]don't care [454] 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] 70070#[L-1-1]don't care [546] L-1-1-->L-1-2: Formula: (= (select |v_#valid_20| 0) 0) InVars {#valid=|v_#valid_20|} OutVars{#valid=|v_#valid_20|} AuxVars[] AssignedVars[] 70072#[L-1-2]don't care [549] L-1-2-->L21: Formula: (< 0 |v_#StackHeapBarrier_2|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|} AuxVars[] AssignedVars[] 75430#[L21]don't care [392] L21-->L21-1: Formula: (and (= (select |v_#valid_21| 1) 1) (= 2 (select |v_#length_16| 1))) InVars {#length=|v_#length_16|, #valid=|v_#valid_21|} OutVars{#length=|v_#length_16|, #valid=|v_#valid_21|} AuxVars[] AssignedVars[] 75432#[L21-1]don't care [537] L21-1-->L21-2: Formula: (= 48 (select (select |v_#memory_int_17| 1) 0)) InVars {#memory_int=|v_#memory_int_17|} OutVars{#memory_int=|v_#memory_int_17|} AuxVars[] AssignedVars[] 79746#[L21-2]don't care [461] L21-2-->L21-3: Formula: (= (select (select |v_#memory_int_18| 1) 1) 0) InVars {#memory_int=|v_#memory_int_18|} OutVars{#memory_int=|v_#memory_int_18|} AuxVars[] AssignedVars[] 79748#[L21-3]don't care [503] L21-3-->L21-4: Formula: (and (= (select |v_#length_17| 2) 20) (= (select |v_#valid_22| 2) 1)) InVars {#length=|v_#length_17|, #valid=|v_#valid_22|} OutVars{#length=|v_#length_17|, #valid=|v_#valid_22|} AuxVars[] AssignedVars[] 74554#[L21-4]don't care [373] L21-4-->L42: Formula: (and (= v_~f~0.base_10 0) (= v_~f~0.offset_10 0)) InVars {} OutVars{~f~0.base=v_~f~0.base_10, ~f~0.offset=v_~f~0.offset_10} AuxVars[] AssignedVars[~f~0.base, ~f~0.offset] 73550#[L42]don't care [368] L42-->L42-1: Formula: (= v_~x1~0_5 0) InVars {} OutVars{~x1~0=v_~x1~0_5} AuxVars[] AssignedVars[~x1~0] 73552#[L42-1]don't care [538] L42-1-->L42-2: Formula: (= v_~x2~0_23 0) InVars {} OutVars{~x2~0=v_~x2~0_23} AuxVars[] AssignedVars[~x2~0] 75860#[L42-2]don't care [478] L42-2-->L43: Formula: (= 0 v_~size~0_9) InVars {} OutVars{~size~0=v_~size~0_9} AuxVars[] AssignedVars[~size~0] 72336#[L43]don't care [544] L43-->L-1-3: Formula: (= v_~n~0_11 0) InVars {} OutVars{~n~0=v_~n~0_11} AuxVars[] AssignedVars[~n~0] 71348#[L-1-3]don't care [554] L-1-3-->L-1-4: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 71350#[L-1-4]don't care [357] L-1-4-->L-1-5: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 75986#[L-1-5]don't care [440] L-1-5-->L-1-6: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1] 76422#[L-1-6]don't care [532] L-1-6-->L92: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~ret19#1.base=|v_ULTIMATE.start_main_#t~ret19#1.base_4|, ULTIMATE.start_main_#t~nondet23#1=|v_ULTIMATE.start_main_#t~nondet23#1_2|, ULTIMATE.start_main_#t~nondet21#1=|v_ULTIMATE.start_main_#t~nondet21#1_2|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_5|, ULTIMATE.start_main_#t~nondet18#1=|v_ULTIMATE.start_main_#t~nondet18#1_1|, ULTIMATE.start_main_#t~ret19#1.offset=|v_ULTIMATE.start_main_#t~ret19#1.offset_4|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_5|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_5|, ULTIMATE.start_main_#t~mem25#1=|v_ULTIMATE.start_main_#t~mem25#1_3|, ULTIMATE.start_main_#t~pre20#1=|v_ULTIMATE.start_main_#t~pre20#1_4|, ULTIMATE.start_main_#t~pre22#1=|v_ULTIMATE.start_main_#t~pre22#1_4|, ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_1|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_5|, ULTIMATE.start_main_#t~mem24#1=|v_ULTIMATE.start_main_#t~mem24#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret19#1.base, ULTIMATE.start_main_#t~nondet23#1, ULTIMATE.start_main_#t~nondet21#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_#t~nondet18#1, ULTIMATE.start_main_#t~ret19#1.offset, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_#t~mem25#1, ULTIMATE.start_main_#t~pre20#1, ULTIMATE.start_main_#t~pre22#1, ULTIMATE.start_main_#t~nondet17#1, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_main_#t~mem24#1] 70620#[L92]don't care [404] L92-->L92-1: Formula: (and (= |v_ULTIMATE.start_main_~#t1~0#1.offset_6| 0) (= (select |v_#valid_24| |v_ULTIMATE.start_main_~#t1~0#1.base_6|) 0) (not (= |v_ULTIMATE.start_main_~#t1~0#1.base_6| 0)) (= (store |v_#length_19| |v_ULTIMATE.start_main_~#t1~0#1.base_6| 4) |v_#length_18|) (< |v_#StackHeapBarrier_3| |v_ULTIMATE.start_main_~#t1~0#1.base_6|) (= |v_#valid_23| (store |v_#valid_24| |v_ULTIMATE.start_main_~#t1~0#1.base_6| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_19|, #valid=|v_#valid_24|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_18|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_6|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_6|, #valid=|v_#valid_23|} AuxVars[] AssignedVars[#valid, #length, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t1~0#1.offset] 69264#[L92-1]don't care [396] L92-1-->L92-2: Formula: (and (= |v_#length_20| (store |v_#length_21| |v_ULTIMATE.start_main_~#t2~0#1.base_6| 4)) (= |v_#valid_25| (store |v_#valid_26| |v_ULTIMATE.start_main_~#t2~0#1.base_6| 1)) (not (= |v_ULTIMATE.start_main_~#t2~0#1.base_6| 0)) (= (select |v_#valid_26| |v_ULTIMATE.start_main_~#t2~0#1.base_6|) 0) (< |v_#StackHeapBarrier_4| |v_ULTIMATE.start_main_~#t2~0#1.base_6|) (= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_6|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_4|, #length=|v_#length_21|, #valid=|v_#valid_26|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_4|, #length=|v_#length_20|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_6|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_6|, #valid=|v_#valid_25|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2~0#1.offset, #valid, #length, ULTIMATE.start_main_~#t2~0#1.base] 69266#[L92-2]don't care [474] L92-2-->L95: Formula: (= v_~n~0_12 |v_ULTIMATE.start_main_#t~nondet17#1_2|) InVars {ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_2|} OutVars{~n~0=v_~n~0_12, ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_2|} AuxVars[] AssignedVars[~n~0] 76366#[L95]don't care [506] L95-->L96: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet17#1] 75088#[L96]don't care [531] L96-->L96-1: Formula: (= v_~size~0_10 |v_ULTIMATE.start_main_#t~nondet18#1_2|) InVars {ULTIMATE.start_main_#t~nondet18#1=|v_ULTIMATE.start_main_#t~nondet18#1_2|} OutVars{~size~0=v_~size~0_10, ULTIMATE.start_main_#t~nondet18#1=|v_ULTIMATE.start_main_#t~nondet18#1_2|} AuxVars[] AssignedVars[~size~0] 71060#[L96-1]don't care [484] L96-1-->L97: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet18#1=|v_ULTIMATE.start_main_#t~nondet18#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet18#1] 71062#[L97]don't care [488] L97-->L97-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 72158#[L97-1]don't care [502] L97-1-->L97-2: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_3| (ite (< 0 v_~size~0_11) 1 0)) InVars {~size~0=v_~size~0_11} OutVars{~size~0=v_~size~0_11, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1] 75776#[L97-2]don't care [424] L97-2-->L37: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 79438#[L37]don't care [370] L37-->L38: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_4| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_6|) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_4|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_6|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 69790#[L38]don't care [481] L38-->L37-1: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_8| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_8|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_8|} AuxVars[] AssignedVars[] 69792#[L37-1]don't care [472] L37-1-->L98: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 74056#[L98]don't care [520] L98-->L98-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 76952#[L98-1]don't care [439] L98-1-->L98-2: Formula: (= v_~size~0_12 |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_1|) InVars {~size~0=v_~size~0_12} OutVars{ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_1|, ~size~0=v_~size~0_12} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#in~size#1] 80432#[L98-2]don't care [498] L98-2-->L98-3: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_3|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_3|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base] 70568#[L98-3]don't care [393] L98-3-->L112: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_4|, ULTIMATE.start_create_fresh_int_array_#t~nondet28#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet28#1_3|, ULTIMATE.start_create_fresh_int_array_#t~post27#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post27#1_4|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_4|, ULTIMATE.start_create_fresh_int_array_#t~malloc26#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc26#1.offset_4|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_7|, ULTIMATE.start_create_fresh_int_array_#t~malloc26#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc26#1.base_4|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_create_fresh_int_array_#t~nondet28#1, ULTIMATE.start_create_fresh_int_array_#t~post27#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc26#1.offset, ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_create_fresh_int_array_#t~malloc26#1.base, ULTIMATE.start_create_fresh_int_array_~size#1] 70570#[L112]don't care [466] L112-->L113: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_~size#1_5| |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_2|) InVars {ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_2|} OutVars{ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_2|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~size#1] 76270#[L113]don't care [533] L113-->L113-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 77122#[L113-1]don't care [336] L113-1-->L113-2: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_5| (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_6|) 1 0)) InVars {ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_6|} OutVars{ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_6|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1] 72998#[L113-2]don't care [462] L113-2-->L37-2: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_9|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 73000#[L37-2]don't care [442] L37-2-->L38-3: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_6| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_10|) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_6|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_10|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_6|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 79904#[L38-3]don't care [352] L38-3-->L37-3: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_12| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_12|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_12|} AuxVars[] AssignedVars[] 78606#[L37-3]don't care [344] L37-3-->L114: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 77730#[L114]don't care [365] L114-->L114-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 71178#[L114-1]don't care [510] L114-1-->L114-2: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_7| (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_7| 4294967296) 1073741823) 1 0)) InVars {ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_7|} OutVars{ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_7|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1] 71180#[L114-2]don't care [354] L114-2-->L37-4: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_13|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 76530#[L37-4]don't care [530] L37-4-->L38-6: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_8| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_14|) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_8|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_14|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_8|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 76646#[L38-6]don't care [391] L38-6-->L37-5: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_16| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_16|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_16|} AuxVars[] AssignedVars[] 76062#[L37-5]don't care [381] L37-5-->L116: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 76064#[L116]don't care [449] L116-->L116-1: Formula: (and (= (store |v_#valid_10| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc26#1.base_1| 1) |v_#valid_9|) (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc26#1.offset_1| 0) (= (store |v_#length_10| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc26#1.base_1| (* |v_ULTIMATE.start_create_fresh_int_array_~size#1_1| 4)) |v_#length_9|) (< |v_ULTIMATE.start_create_fresh_int_array_#t~malloc26#1.base_1| |v_#StackHeapBarrier_1|) (not (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc26#1.base_1| 0)) (= (select |v_#valid_10| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc26#1.base_1|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_10|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_1|, #valid=|v_#valid_10|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_9|, ULTIMATE.start_create_fresh_int_array_#t~malloc26#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc26#1.offset_1|, #length=|v_#length_9|, ULTIMATE.start_create_fresh_int_array_#t~malloc26#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc26#1.base_1|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_1|} AuxVars[] AssignedVars[#valid, ULTIMATE.start_create_fresh_int_array_#t~malloc26#1.offset, #length, ULTIMATE.start_create_fresh_int_array_#t~malloc26#1.base] 78414#[L116-1]don't care [515] L116-1-->L116-2: Formula: (and (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc26#1.base_2| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_1|) (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc26#1.offset_2| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_1|)) InVars {ULTIMATE.start_create_fresh_int_array_#t~malloc26#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc26#1.offset_2|, ULTIMATE.start_create_fresh_int_array_#t~malloc26#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc26#1.base_2|} OutVars{ULTIMATE.start_create_fresh_int_array_#t~malloc26#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc26#1.offset_2|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_1|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_1|, ULTIMATE.start_create_fresh_int_array_#t~malloc26#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc26#1.base_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base] 80304#[L116-2]don't care [535] L116-2-->L117: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~malloc26#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc26#1.offset_3|, ULTIMATE.start_create_fresh_int_array_#t~malloc26#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc26#1.base_3|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~malloc26#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc26#1.base] 80400#[L117]don't care [331] L117-->L117-6: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_1| 0) InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~2#1] 73480#[L117-6]don't care [348] L117-6-->L118: Formula: (< |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_3| |v_ULTIMATE.start_create_fresh_int_array_~size#1_3|) InVars {ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_3|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_3|} OutVars{ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_3|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_3|} AuxVars[] AssignedVars[] 68384#[L118]don't care [509] L118-->L118-1: Formula: (let ((.cse1 (* 4 |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_4|))) (let ((.cse0 (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_2| .cse1))) (and (<= 0 .cse0) (= (select |v_#valid_11| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2|) 1) (= (store |v_#memory_int_10| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2| (store (select |v_#memory_int_10| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2|) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet28#1_1|)) |v_#memory_int_9|) (<= (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_2| .cse1 4) (select |v_#length_11| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2|))))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_2|, ULTIMATE.start_create_fresh_int_array_#t~nondet28#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet28#1_1|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2|, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_10|, #length=|v_#length_11|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_4|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_2|, ULTIMATE.start_create_fresh_int_array_#t~nondet28#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet28#1_1|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2|, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_9|, #length=|v_#length_11|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_4|} AuxVars[] AssignedVars[#memory_int] 68386#[L118-1]don't care [366] L118-1-->L117-3: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~nondet28#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet28#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~nondet28#1] 75314#[L117-3]don't care [326] L117-3-->L117-4: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_#t~post27#1_1| |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_5|) InVars {ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_5|} OutVars{ULTIMATE.start_create_fresh_int_array_#t~post27#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post27#1_1|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post27#1] 71648#[L117-4]don't care [380] L117-4-->L117-5: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_6| (+ |v_ULTIMATE.start_create_fresh_int_array_#t~post27#1_2| 1)) InVars {ULTIMATE.start_create_fresh_int_array_#t~post27#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post27#1_2|} OutVars{ULTIMATE.start_create_fresh_int_array_#t~post27#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post27#1_2|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_6|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~2#1] 71650#[L117-5]don't care [496] L117-5-->L117-6: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~post27#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post27#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post27#1] 73482#[L117-6]don't care [347] L117-6-->L117-7: Formula: (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_2| |v_ULTIMATE.start_create_fresh_int_array_~size#1_2|)) InVars {ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_2|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_2|} OutVars{ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_2|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_2|} AuxVars[] AssignedVars[] 73484#[L117-7]don't care [450] L117-7-->L120: Formula: (and (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_3| |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_1|) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3| |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_1|)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_3|} OutVars{ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_1|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_3|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base] 75694#[L120]don't care [460] L120-->L98-4: Formula: (and (= |v_ULTIMATE.start_main_#t~ret19#1.base_1| |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_2|) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_2| |v_ULTIMATE.start_main_#t~ret19#1.offset_1|)) InVars {ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_2|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_2|} OutVars{ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_2|, ULTIMATE.start_main_#t~ret19#1.base=|v_ULTIMATE.start_main_#t~ret19#1.base_1|, ULTIMATE.start_main_#t~ret19#1.offset=|v_ULTIMATE.start_main_#t~ret19#1.offset_1|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret19#1.base, ULTIMATE.start_main_#t~ret19#1.offset] 69868#[L98-4]don't care [495] L98-4-->L98-5: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 69870#[L98-5]don't care [473] L98-5-->L98-6: Formula: (and (= v_~f~0.offset_9 |v_ULTIMATE.start_main_#t~ret19#1.offset_2|) (= |v_ULTIMATE.start_main_#t~ret19#1.base_2| v_~f~0.base_9)) InVars {ULTIMATE.start_main_#t~ret19#1.offset=|v_ULTIMATE.start_main_#t~ret19#1.offset_2|, ULTIMATE.start_main_#t~ret19#1.base=|v_ULTIMATE.start_main_#t~ret19#1.base_2|} OutVars{ULTIMATE.start_main_#t~ret19#1.base=|v_ULTIMATE.start_main_#t~ret19#1.base_2|, ULTIMATE.start_main_#t~ret19#1.offset=|v_ULTIMATE.start_main_#t~ret19#1.offset_2|, ~f~0.base=v_~f~0.base_9, ~f~0.offset=v_~f~0.offset_9} AuxVars[] AssignedVars[~f~0.base, ~f~0.offset] 80152#[L98-6]don't care [388] L98-6-->L101: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~ret19#1.offset=|v_ULTIMATE.start_main_#t~ret19#1.offset_3|, ULTIMATE.start_main_#t~ret19#1.base=|v_ULTIMATE.start_main_#t~ret19#1.base_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret19#1.base, ULTIMATE.start_main_#t~ret19#1.offset] 79584#[L101]don't care [542] L101-->L101-1: Formula: (= |v_#pthreadsForks_1| |v_ULTIMATE.start_main_#t~pre20#1_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre20#1=|v_ULTIMATE.start_main_#t~pre20#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre20#1] 77402#[L101-1]don't care [444] L101-1-->L101-2: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] 77404#[L101-2]don't care [385] L101-2-->L101-3: Formula: (and (<= (+ |v_ULTIMATE.start_main_~#t1~0#1.offset_1| 4) (select |v_#length_12| |v_ULTIMATE.start_main_~#t1~0#1.base_1|)) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_1|) (= (select |v_#valid_12| |v_ULTIMATE.start_main_~#t1~0#1.base_1|) 1) (= |v_#memory_int_11| (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1~0#1.base_1| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1~0#1.base_1|) |v_ULTIMATE.start_main_~#t1~0#1.offset_1| |v_ULTIMATE.start_main_#t~pre20#1_2|)))) InVars {ULTIMATE.start_main_#t~pre20#1=|v_ULTIMATE.start_main_#t~pre20#1_2|, #valid=|v_#valid_12|, #memory_int=|v_#memory_int_12|, #length=|v_#length_12|, 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|} OutVars{ULTIMATE.start_main_#t~pre20#1=|v_ULTIMATE.start_main_#t~pre20#1_2|, #valid=|v_#valid_12|, #memory_int=|v_#memory_int_11|, #length=|v_#length_12|, 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|} AuxVars[] AssignedVars[#memory_int] 71090#[L101-3]don't care [693] L101-3-->thread1ENTRY: Formula: (and (= v_thread1Thread1of1ForFork1_thidvar0_2 |v_ULTIMATE.start_main_#t~pre20#1_6|) (= 0 v_thread1Thread1of1ForFork1_thidvar1_2)) InVars {ULTIMATE.start_main_#t~pre20#1=|v_ULTIMATE.start_main_#t~pre20#1_6|} OutVars{thread1Thread1of1ForFork1_#t~post2#1=|v_thread1Thread1of1ForFork1_#t~post2#1_8|, ULTIMATE.start_main_#t~pre20#1=|v_ULTIMATE.start_main_#t~pre20#1_6|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_6|, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_12|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_4|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_4|, thread1Thread1of1ForFork1_#t~mem1#1=|v_thread1Thread1of1ForFork1_#t~mem1#1_8|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_2, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_10|, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_~i~0#1, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#res#1.base, thread1Thread1of1ForFork1_#t~mem1#1, thread1Thread1of1ForFork1_thidvar1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_thidvar0] 71092#[L101-4, thread1ENTRY]don't care [558] thread1ENTRY-->L49-2: Formula: (= |v_thread1Thread1of1ForFork1_~i~0#1_1| 0) InVars {} OutVars{thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_~i~0#1] 76842#[L49-2, L101-4]don't care
[2022-07-22 12:02:43,674 INFO L750 eck$LassoCheckResult]: Loop: 76842#[L49-2, L101-4]don't care [561] L49-2-->L50: Formula: (< (mod |v_thread1Thread1of1ForFork1_~i~0#1_5| 4294967296) (mod v_~n~0_2 4294967296)) InVars {~n~0=v_~n~0_2, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_5|} OutVars{~n~0=v_~n~0_2, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_5|} AuxVars[] AssignedVars[] 72068#[L50, L101-4]don't care [563] L50-->L50-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 72070#[L50-1, L101-4]don't care [565] L50-1-->L50-2: Formula: (= (ite (and (< v_~x1~0_1 v_~size~0_1) (<= 0 v_~x1~0_1)) 1 0) |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|) InVars {~size~0=v_~size~0_1, ~x1~0=v_~x1~0_1} OutVars{~size~0=v_~size~0_1, ~x1~0=v_~x1~0_1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1] 68094#[L101-4, L50-2]don't care [566] L50-2-->L37: Formula: true InVars {} OutVars{thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] 68096#[L37, L101-4]don't care [567] L37-->L38: Formula: (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_3| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_3|) InVars {thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_3|} OutVars{thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_3|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_3|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] 75138#[L101-4, L38]don't care [569] L38-->L37-1: Formula: (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_7| 0)) InVars {thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_7|} OutVars{thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_7|} AuxVars[] AssignedVars[] 75144#[L37-1, L101-4]don't care [571] L37-1-->L51: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 74888#[L51, L101-4]don't care [572] L51-->L51-1: Formula: (let ((.cse1 (* v_~x1~0_2 4))) (let ((.cse0 (+ .cse1 v_~f~0.offset_1))) (and (= (select |v_#valid_1| v_~f~0.base_1) 1) (<= 0 .cse0) (= (select (select |v_#memory_int_1| v_~f~0.base_1) .cse0) |v_thread1Thread1of1ForFork1_#t~mem1#1_1|) (<= (+ .cse1 v_~f~0.offset_1 4) (select |v_#length_1| v_~f~0.base_1))))) InVars {~f~0.base=v_~f~0.base_1, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #length=|v_#length_1|, ~x1~0=v_~x1~0_2, ~f~0.offset=v_~f~0.offset_1} OutVars{~f~0.base=v_~f~0.base_1, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #length=|v_#length_1|, thread1Thread1of1ForFork1_#t~mem1#1=|v_thread1Thread1of1ForFork1_#t~mem1#1_1|, ~x1~0=v_~x1~0_2, ~f~0.offset=v_~f~0.offset_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem1#1] 74890#[L51-1, L101-4]don't care [573] L51-1-->L51-2: Formula: (= v_~x1~0_3 |v_thread1Thread1of1ForFork1_#t~mem1#1_3|) InVars {thread1Thread1of1ForFork1_#t~mem1#1=|v_thread1Thread1of1ForFork1_#t~mem1#1_3|} OutVars{thread1Thread1of1ForFork1_#t~mem1#1=|v_thread1Thread1of1ForFork1_#t~mem1#1_3|, ~x1~0=v_~x1~0_3} AuxVars[] AssignedVars[~x1~0] 78824#[L101-4, L51-2]don't care [574] L51-2-->L52: Formula: true InVars {} OutVars{thread1Thread1of1ForFork1_#t~mem1#1=|v_thread1Thread1of1ForFork1_#t~mem1#1_5|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem1#1] 78826#[L101-4, L52]don't care [575] L52-->L52-1: Formula: (= |v_thread1Thread1of1ForFork1_#t~post2#1_1| |v_thread1Thread1of1ForFork1_~i~0#1_7|) InVars {thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_7|} OutVars{thread1Thread1of1ForFork1_#t~post2#1=|v_thread1Thread1of1ForFork1_#t~post2#1_1|, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_7|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2#1] 80290#[L52-1, L101-4]don't care [576] L52-1-->L52-2: Formula: (= |v_thread1Thread1of1ForFork1_~i~0#1_9| (+ |v_thread1Thread1of1ForFork1_#t~post2#1_3| 1)) InVars {thread1Thread1of1ForFork1_#t~post2#1=|v_thread1Thread1of1ForFork1_#t~post2#1_3|} OutVars{thread1Thread1of1ForFork1_#t~post2#1=|v_thread1Thread1of1ForFork1_#t~post2#1_3|, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_9|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_~i~0#1] 80446#[L52-2, L101-4]don't care [577] L52-2-->L49-2: Formula: true InVars {} OutVars{thread1Thread1of1ForFork1_#t~post2#1=|v_thread1Thread1of1ForFork1_#t~post2#1_5|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2#1] 76842#[L49-2, L101-4]don't care
[2022-07-22 12:02:43,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-07-22 12:02:43,675 INFO L85 PathProgramCache]: Analyzing trace with hash 2051326762, now seen corresponding path program 1 times
[2022-07-22 12:02:43,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-07-22 12:02:43,675 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535667854]
[2022-07-22 12:02:43,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-07-22 12:02:43,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-07-22 12:02:43,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2022-07-22 12:02:43,757 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2022-07-22 12:02:43,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2022-07-22 12:02:43,807 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2022-07-22 12:02:43,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-07-22 12:02:43,808 INFO L85 PathProgramCache]: Analyzing trace with hash 1728928792, now seen corresponding path program 2 times
[2022-07-22 12:02:43,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-07-22 12:02:43,808 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348500459]
[2022-07-22 12:02:43,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-07-22 12:02:43,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-07-22 12:02:43,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2022-07-22 12:02:43,818 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2022-07-22 12:02:43,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2022-07-22 12:02:43,826 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2022-07-22 12:02:43,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-07-22 12:02:43,827 INFO L85 PathProgramCache]: Analyzing trace with hash -664616049, now seen corresponding path program 1 times
[2022-07-22 12:02:43,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-07-22 12:02:43,828 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787429525]
[2022-07-22 12:02:43,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-07-22 12:02:43,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-07-22 12:02:43,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2022-07-22 12:02:43,864 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2022-07-22 12:02:43,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2022-07-22 12:02:43,910 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2022-07-22 12:02:45,602 INFO L210 LassoAnalysis]: Preferences:
[2022-07-22 12:02:45,602 INFO L126 ssoRankerPreferences]: Compute integeral hull: false
[2022-07-22 12:02:45,603 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true
[2022-07-22 12:02:45,603 INFO L128 ssoRankerPreferences]: Term annotations enabled: false
[2022-07-22 12:02:45,603 INFO L129 ssoRankerPreferences]: Use exernal solver: false
[2022-07-22 12:02:45,603 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2022-07-22 12:02:45,603 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false
[2022-07-22 12:02:45,603 INFO L132 ssoRankerPreferences]: Path of dumped script:
[2022-07-22 12:02:45,603 INFO L133 ssoRankerPreferences]: Filename of dumped script: unroll-cond-4.wvr.c_BEv2_Iteration3_Lasso
[2022-07-22 12:02:45,603 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank
[2022-07-22 12:02:45,604 INFO L276 LassoAnalysis]: Starting lasso preprocessing...
[2022-07-22 12:02:45,620 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2022-07-22 12:02:45,689 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2022-07-22 12:02:45,691 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2022-07-22 12:02:45,698 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2022-07-22 12:02:45,700 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2022-07-22 12:02:45,702 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2022-07-22 12:02:45,704 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2022-07-22 12:02:45,706 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2022-07-22 12:02:45,707 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2022-07-22 12:02:45,710 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2022-07-22 12:02:45,712 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2022-07-22 12:02:45,714 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2022-07-22 12:02:45,717 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2022-07-22 12:02:45,719 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2022-07-22 12:02:45,721 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2022-07-22 12:02:45,727 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2022-07-22 12:02:45,728 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2022-07-22 12:02:45,730 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2022-07-22 12:02:45,732 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2022-07-22 12:02:45,733 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2022-07-22 12:02:45,737 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2022-07-22 12:02:45,739 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2022-07-22 12:02:45,743 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2022-07-22 12:02:45,745 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2022-07-22 12:02:45,747 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2022-07-22 12:02:45,748 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2022-07-22 12:02:45,749 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2022-07-22 12:02:45,751 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2022-07-22 12:02:45,752 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2022-07-22 12:02:45,754 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2022-07-22 12:02:45,755 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2022-07-22 12:02:45,976 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception:
java.lang.IllegalArgumentException
at de.uni_freiburg.informatik.ultimate.util.datastructures.ScopedHashMap.put(ScopedHashMap.java:331)
at java.base/java.util.AbstractMap.putAll(AbstractMap.java:281)
at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.PureSubstitution.<init>(PureSubstitution.java:81)
at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.Substitution.<init>(Substitution.java:48)
at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.Substitution.apply(Substitution.java:59)
at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.replaceMapReads(MapEliminator.java:518)
at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.getRewrittenTransFormula(MapEliminator.java:342)
at de.uni_freiburg.informatik.ultimate.lassoranker.preprocessors.MapEliminationLassoPreprocessor.process(MapEliminationLassoPreprocessor.java:109)
at de.uni_freiburg.informatik.ultimate.lassoranker.variables.LassoBuilder.applyPreprocessor(LassoBuilder.java:154)
at de.uni_freiburg.informatik.ultimate.lassoranker.variables.LassoBuilder.preprocess(LassoBuilder.java:262)
at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.preprocess(LassoAnalysis.java:280)
at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.<init>(LassoAnalysis.java:229)
at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.synthesize(LassoCheck.java:602)
at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.checkLassoTermination(LassoCheck.java:910)
at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.<init>(LassoCheck.java:819)
at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.<init>(LassoCheck.java:253)
at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.cegar.AbstractBuchiCegarLoop.runCegarLoop(AbstractBuchiCegarLoop.java:356)
at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.runCegarLoops(BuchiAutomizerObserver.java:142)
at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:155)
at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:331)
at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168)
at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151)
at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128)
at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232)
at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226)
at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142)
at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104)
at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320)
at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145)
at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63)
[2022-07-22 12:02:45,981 INFO L158 Benchmark]: Toolchain (without parser) took 13255.34ms. Allocated memory was 162.5MB in the beginning and 534.8MB in the end (delta: 372.2MB). Free memory was 137.1MB in the beginning and 378.5MB in the end (delta: -241.4MB). Peak memory consumption was 236.0MB. Max. memory is 8.0GB.
[2022-07-22 12:02:45,981 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 162.5MB. Free memory is still 134.3MB. There was no memory consumed. Max. memory is 8.0GB.
[2022-07-22 12:02:45,982 INFO L158 Benchmark]: CACSL2BoogieTranslator took 320.06ms. Allocated memory is still 162.5MB. Free memory was 136.9MB in the beginning and 125.6MB in the end (delta: 11.3MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB.
[2022-07-22 12:02:45,982 INFO L158 Benchmark]: Boogie Procedure Inliner took 88.91ms. Allocated memory is still 162.5MB. Free memory was 125.4MB in the beginning and 123.4MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB.
[2022-07-22 12:02:45,983 INFO L158 Benchmark]: Boogie Preprocessor took 53.92ms. Allocated memory is still 162.5MB. Free memory was 123.4MB in the beginning and 121.7MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB.
[2022-07-22 12:02:45,984 INFO L158 Benchmark]: RCFGBuilder took 734.05ms. Allocated memory is still 162.5MB. Free memory was 121.7MB in the beginning and 134.8MB in the end (delta: -13.1MB). Peak memory consumption was 12.0MB. Max. memory is 8.0GB.
[2022-07-22 12:02:45,984 INFO L158 Benchmark]: BuchiAutomizer took 12047.48ms. Allocated memory was 162.5MB in the beginning and 534.8MB in the end (delta: 372.2MB). Free memory was 134.8MB in the beginning and 378.5MB in the end (delta: -243.7MB). Peak memory consumption was 233.5MB. Max. memory is 8.0GB.
[2022-07-22 12:02:45,988 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.27ms. Allocated memory is still 162.5MB. Free memory is still 134.3MB. There was no memory consumed. Max. memory is 8.0GB.
* CACSL2BoogieTranslator took 320.06ms. Allocated memory is still 162.5MB. Free memory was 136.9MB in the beginning and 125.6MB in the end (delta: 11.3MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB.
* Boogie Procedure Inliner took 88.91ms. Allocated memory is still 162.5MB. Free memory was 125.4MB in the beginning and 123.4MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB.
* Boogie Preprocessor took 53.92ms. Allocated memory is still 162.5MB. Free memory was 123.4MB in the beginning and 121.7MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB.
* RCFGBuilder took 734.05ms. Allocated memory is still 162.5MB. Free memory was 121.7MB in the beginning and 134.8MB in the end (delta: -13.1MB). Peak memory consumption was 12.0MB. Max. memory is 8.0GB.
* BuchiAutomizer took 12047.48ms. Allocated memory was 162.5MB in the beginning and 534.8MB in the end (delta: 372.2MB). Free memory was 134.8MB in the beginning and 378.5MB in the end (delta: -243.7MB). Peak memory consumption was 233.5MB. Max. memory is 8.0GB.
* Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer:
- ExceptionOrErrorResult: IllegalArgumentException: null
de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: IllegalArgumentException: null: de.uni_freiburg.informatik.ultimate.util.datastructures.ScopedHashMap.put(ScopedHashMap.java:331)
RESULT: Ultimate could not prove your program: Toolchain returned no result.
[2022-07-22 12:02:46,034 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...