/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/BuchiAutomizerCInline.xml -s ../../../trunk/examples/settings/buchiAutomizer/concurrent-automaton-noLbe.epf -i ../../../trunk/examples/svcomp/weaver/test-context1.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-21b0908 [2022-07-22 12:01:52,973 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-22 12:01:52,976 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-22 12:01:53,049 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-22 12:01:53,049 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-22 12:01:53,054 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-22 12:01:53,060 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-22 12:01:53,062 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-22 12:01:53,064 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-22 12:01:53,065 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-22 12:01:53,067 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-22 12:01:53,068 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-22 12:01:53,069 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-22 12:01:53,070 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-22 12:01:53,071 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-22 12:01:53,072 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-22 12:01:53,073 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-22 12:01:53,074 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-22 12:01:53,079 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-22 12:01:53,083 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-22 12:01:53,086 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-22 12:01:53,090 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-22 12:01:53,094 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-22 12:01:53,095 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-22 12:01:53,097 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-22 12:01:53,102 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-22 12:01:53,102 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-22 12:01:53,103 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-22 12:01:53,104 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-22 12:01:53,104 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-22 12:01:53,106 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-22 12:01:53,107 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-22 12:01:53,109 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-22 12:01:53,110 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-22 12:01:53,111 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-22 12:01:53,112 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-22 12:01:53,112 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-22 12:01:53,113 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-22 12:01:53,113 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-22 12:01:53,114 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-22 12:01:53,116 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-22 12:01:53,125 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-22 12:01:53,125 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:01:53,176 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-22 12:01:53,177 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-22 12:01:53,178 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-22 12:01:53,178 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-22 12:01:53,179 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-22 12:01:53,180 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-22 12:01:53,180 INFO L138 SettingsManager]: * Use SBE=true [2022-07-22 12:01:53,180 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-07-22 12:01:53,180 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-07-22 12:01:53,182 INFO L138 SettingsManager]: * Use old map elimination=false [2022-07-22 12:01:53,182 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-07-22 12:01:53,182 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-07-22 12:01:53,182 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-07-22 12:01:53,182 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-22 12:01:53,183 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-22 12:01:53,183 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-22 12:01:53,183 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-22 12:01:53,183 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-22 12:01:53,183 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-22 12:01:53,184 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-07-22 12:01:53,184 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-07-22 12:01:53,184 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-07-22 12:01:53,184 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-22 12:01:53,184 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-22 12:01:53,184 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-07-22 12:01:53,185 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-22 12:01:53,185 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-07-22 12:01:53,185 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-22 12:01:53,185 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-22 12:01:53,186 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-22 12:01:53,186 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-22 12:01:53,186 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-22 12:01:53,189 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-07-22 12:01:53,189 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:01:53,577 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-22 12:01:53,606 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-22 12:01:53,609 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-22 12:01:53,611 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-22 12:01:53,612 INFO L275 PluginConnector]: CDTParser initialized [2022-07-22 12:01:53,614 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/test-context1.wvr.c [2022-07-22 12:01:53,691 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/41e2e7ae0/43452ad58b8945d8bbc40deb8c0c764d/FLAGa9213b027 [2022-07-22 12:01:54,407 INFO L306 CDTParser]: Found 1 translation units. [2022-07-22 12:01:54,408 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/test-context1.wvr.c [2022-07-22 12:01:54,423 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/41e2e7ae0/43452ad58b8945d8bbc40deb8c0c764d/FLAGa9213b027 [2022-07-22 12:01:54,755 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/41e2e7ae0/43452ad58b8945d8bbc40deb8c0c764d [2022-07-22 12:01:54,760 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-22 12:01:54,767 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-07-22 12:01:54,768 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-22 12:01:54,768 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-22 12:01:54,773 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-22 12:01:54,775 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 12:01:54" (1/1) ... [2022-07-22 12:01:54,777 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@db55aca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:01:54, skipping insertion in model container [2022-07-22 12:01:54,777 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 12:01:54" (1/1) ... [2022-07-22 12:01:54,787 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-22 12:01:54,828 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-22 12:01:55,124 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/test-context1.wvr.c[2433,2446] [2022-07-22 12:01:55,132 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 12:01:55,141 INFO L203 MainTranslator]: Completed pre-run [2022-07-22 12:01:55,165 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/test-context1.wvr.c[2433,2446] [2022-07-22 12:01:55,169 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 12:01:55,186 INFO L208 MainTranslator]: Completed translation [2022-07-22 12:01:55,186 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:01:55 WrapperNode [2022-07-22 12:01:55,186 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-22 12:01:55,188 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-22 12:01:55,188 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-22 12:01:55,188 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-22 12:01:55,195 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:01:55" (1/1) ... [2022-07-22 12:01:55,217 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:01:55" (1/1) ... [2022-07-22 12:01:55,286 INFO L137 Inliner]: procedures = 24, calls = 34, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 129 [2022-07-22 12:01:55,287 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-22 12:01:55,288 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-22 12:01:55,288 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-22 12:01:55,289 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-22 12:01:55,298 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:01:55" (1/1) ... [2022-07-22 12:01:55,298 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:01:55" (1/1) ... [2022-07-22 12:01:55,308 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:01:55" (1/1) ... [2022-07-22 12:01:55,308 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:01:55" (1/1) ... [2022-07-22 12:01:55,324 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:01:55" (1/1) ... [2022-07-22 12:01:55,332 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:01:55" (1/1) ... [2022-07-22 12:01:55,340 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:01:55" (1/1) ... [2022-07-22 12:01:55,343 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-22 12:01:55,344 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-22 12:01:55,345 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-22 12:01:55,345 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-22 12:01:55,346 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:01:55" (1/1) ... [2022-07-22 12:01:55,353 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:01:55,368 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:01:55,382 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:01:55,384 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:01:55,455 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-22 12:01:55,456 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-07-22 12:01:55,456 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-07-22 12:01:55,457 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-07-22 12:01:55,457 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-07-22 12:01:55,457 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-22 12:01:55,457 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-22 12:01:55,459 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-22 12:01:55,460 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-07-22 12:01:55,465 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-07-22 12:01:55,465 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-22 12:01:55,465 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-22 12:01:55,465 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-22 12:01:55,466 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-22 12:01:55,466 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-22 12:01:55,468 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:01:55,626 INFO L234 CfgBuilder]: Building ICFG [2022-07-22 12:01:55,628 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-22 12:01:55,912 INFO L275 CfgBuilder]: Performing block encoding [2022-07-22 12:01:56,143 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-22 12:01:56,143 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-07-22 12:01:56,148 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 12:01:56 BoogieIcfgContainer [2022-07-22 12:01:56,148 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-22 12:01:56,150 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-07-22 12:01:56,150 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-07-22 12:01:56,155 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-07-22 12:01:56,156 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-22 12:01:56,156 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.07 12:01:54" (1/3) ... [2022-07-22 12:01:56,159 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5e832942 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.07 12:01:56, skipping insertion in model container [2022-07-22 12:01:56,159 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-22 12:01:56,159 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:01:55" (2/3) ... [2022-07-22 12:01:56,160 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5e832942 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.07 12:01:56, skipping insertion in model container [2022-07-22 12:01:56,160 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-22 12:01:56,161 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 12:01:56" (3/3) ... [2022-07-22 12:01:56,162 INFO L322 chiAutomizerObserver]: Analyzing ICFG test-context1.wvr.c [2022-07-22 12:01:56,324 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-07-22 12:01:56,360 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 111 places, 115 transitions, 246 flow [2022-07-22 12:01:56,421 INFO L129 PetriNetUnfolder]: 9/111 cut-off events. [2022-07-22 12:01:56,422 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-07-22 12:01:56,426 INFO L84 FinitePrefix]: Finished finitePrefix Result has 120 conditions, 111 events. 9/111 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 58 event pairs, 0 based on Foata normal form. 0/102 useless extension candidates. Maximal degree in co-relation 79. Up to 2 conditions per place. [2022-07-22 12:01:56,426 INFO L82 GeneralOperation]: Start removeDead. Operand has 111 places, 115 transitions, 246 flow [2022-07-22 12:01:56,435 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 109 places, 111 transitions, 234 flow [2022-07-22 12:01:56,453 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2022-07-22 12:01:56,453 INFO L301 stractBuchiCegarLoop]: Hoare is false [2022-07-22 12:01:56,454 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-07-22 12:01:56,454 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-07-22 12:01:56,454 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-07-22 12:01:56,454 INFO L305 stractBuchiCegarLoop]: Difference is false [2022-07-22 12:01:56,454 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-07-22 12:01:56,454 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-07-22 12:01:56,456 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 0 states, but on-demand construction may add more states [2022-07-22 12:01:56,603 INFO L131 ngComponentsAnalysis]: Automaton has 46 accepting balls. 165 [2022-07-22 12:01:56,603 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:01:56,604 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:01:56,611 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] [2022-07-22 12:01:56,611 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2022-07-22 12:01:56,612 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-07-22 12:01:56,612 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 336 states, but on-demand construction may add more states [2022-07-22 12:01:56,632 INFO L131 ngComponentsAnalysis]: Automaton has 46 accepting balls. 165 [2022-07-22 12:01:56,632 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:01:56,632 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:01:56,637 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] [2022-07-22 12:01:56,638 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2022-07-22 12:01:56,647 INFO L748 eck$LassoCheckResult]: Stem: 114#[ULTIMATE.startENTRY]don't care [354] ULTIMATE.startENTRY-->L-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 117#[L-1]don't care [284] 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] 119#[L-1-1]don't care [360] L-1-1-->L-1-2: Formula: (= (select |v_#valid_14| 0) 0) InVars {#valid=|v_#valid_14|} OutVars{#valid=|v_#valid_14|} AuxVars[] AssignedVars[] 121#[L-1-2]don't care [361] L-1-2-->L21: Formula: (< 0 |v_#StackHeapBarrier_2|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|} AuxVars[] AssignedVars[] 123#[L21]don't care [335] L21-->L21-1: Formula: (and (= (select |v_#valid_15| 1) 1) (= 2 (select |v_#length_10| 1))) InVars {#length=|v_#length_10|, #valid=|v_#valid_15|} OutVars{#length=|v_#length_10|, #valid=|v_#valid_15|} AuxVars[] AssignedVars[] 125#[L21-1]don't care [350] L21-1-->L21-2: Formula: (= (select (select |v_#memory_int_11| 1) 0) 48) InVars {#memory_int=|v_#memory_int_11|} OutVars{#memory_int=|v_#memory_int_11|} AuxVars[] AssignedVars[] 127#[L21-2]don't care [294] L21-2-->L21-3: Formula: (= (select (select |v_#memory_int_12| 1) 1) 0) InVars {#memory_int=|v_#memory_int_12|} OutVars{#memory_int=|v_#memory_int_12|} AuxVars[] AssignedVars[] 129#[L21-3]don't care [326] L21-3-->L21-4: Formula: (and (= (select |v_#valid_16| 2) 1) (= (select |v_#length_11| 2) 20)) InVars {#length=|v_#length_11|, #valid=|v_#valid_16|} OutVars{#length=|v_#length_11|, #valid=|v_#valid_16|} AuxVars[] AssignedVars[] 131#[L21-4]don't care [308] L21-4-->L42: Formula: (and (= v_~queue~0.base_4 0) (= v_~queue~0.offset_4 0)) InVars {} OutVars{~queue~0.base=v_~queue~0.base_4, ~queue~0.offset=v_~queue~0.offset_4} AuxVars[] AssignedVars[~queue~0.offset, ~queue~0.base] 133#[L42]don't care [299] L42-->L42-1: Formula: (= v_~x~0_3 0) InVars {} OutVars{~x~0=v_~x~0_3} AuxVars[] AssignedVars[~x~0] 135#[L42-1]don't care [351] L42-1-->L42-2: Formula: (= v_~front~0_7 0) InVars {} OutVars{~front~0=v_~front~0_7} AuxVars[] AssignedVars[~front~0] 137#[L42-2]don't care [306] L42-2-->L42-3: Formula: (= 0 v_~size~0_8) InVars {} OutVars{~size~0=v_~size~0_8} AuxVars[] AssignedVars[~size~0] 139#[L42-3]don't care [273] L42-3-->L-1-3: Formula: (= v_~n~0_3 0) InVars {} OutVars{~n~0=v_~n~0_3} AuxVars[] AssignedVars[~n~0] 141#[L-1-3]don't care [365] L-1-3-->L-1-4: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 143#[L-1-4]don't care [291] L-1-4-->L-1-5: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 145#[L-1-5]don't care [270] 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] 147#[L-1-6]don't care [345] L-1-6-->L72: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~mem15#1=|v_ULTIMATE.start_main_#t~mem15#1_3|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_5|, 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~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_4|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_2|, ULTIMATE.start_main_#t~ret9#1.offset=|v_ULTIMATE.start_main_#t~ret9#1.offset_4|, ULTIMATE.start_main_#t~mem14#1=|v_ULTIMATE.start_main_#t~mem14#1_3|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_1|, ULTIMATE.start_main_#t~ret9#1.base=|v_ULTIMATE.start_main_#t~ret9#1.base_4|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_4|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_2|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem15#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_main_#t~nondet11#1, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_main_#t~mem14#1, ULTIMATE.start_main_#t~nondet8#1, ULTIMATE.start_main_#t~ret9#1.base, ULTIMATE.start_main_#t~pre10#1, ULTIMATE.start_main_#t~nondet13#1, ULTIMATE.start_main_~#t2~0#1.base] 149#[L72]don't care [311] L72-->L72-1: Formula: (and (= |v_ULTIMATE.start_main_~#t1~0#1.offset_6| 0) (not (= |v_ULTIMATE.start_main_~#t1~0#1.base_6| 0)) (= (store |v_#valid_18| |v_ULTIMATE.start_main_~#t1~0#1.base_6| 1) |v_#valid_17|) (< |v_#StackHeapBarrier_3| |v_ULTIMATE.start_main_~#t1~0#1.base_6|) (= (select |v_#valid_18| |v_ULTIMATE.start_main_~#t1~0#1.base_6|) 0) (= (store |v_#length_13| |v_ULTIMATE.start_main_~#t1~0#1.base_6| 4) |v_#length_12|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_13|, #valid=|v_#valid_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_12|, 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_17|} AuxVars[] AssignedVars[#valid, #length, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t1~0#1.offset] 151#[L72-1]don't care [315] L72-1-->L72-2: Formula: (and (= (select |v_#valid_20| |v_ULTIMATE.start_main_~#t2~0#1.base_6|) 0) (not (= |v_ULTIMATE.start_main_~#t2~0#1.base_6| 0)) (= (store |v_#valid_20| |v_ULTIMATE.start_main_~#t2~0#1.base_6| 1) |v_#valid_19|) (< |v_#StackHeapBarrier_4| |v_ULTIMATE.start_main_~#t2~0#1.base_6|) (= (store |v_#length_15| |v_ULTIMATE.start_main_~#t2~0#1.base_6| 4) |v_#length_14|) (= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_6|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_4|, #length=|v_#length_15|, #valid=|v_#valid_20|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_4|, #length=|v_#length_14|, 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_19|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2~0#1.offset, #valid, #length, ULTIMATE.start_main_~#t2~0#1.base] 153#[L72-2]don't care [261] L72-2-->L75: Formula: (= 5 v_~x~0_4) InVars {} OutVars{~x~0=v_~x~0_4} AuxVars[] AssignedVars[~x~0] 155#[L75]don't care [303] L75-->L75-1: Formula: (= |v_ULTIMATE.start_main_#t~nondet8#1_2| v_~n~0_4) InVars {ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_2|} OutVars{~n~0=v_~n~0_4, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_2|} AuxVars[] AssignedVars[~n~0] 157#[L75-1]don't care [276] L75-1-->L76: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet8#1] 159#[L76]don't care [312] L76-->L76-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 161#[L76-1]don't care [349] L76-1-->L76-2: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_1| v_~n~0_5) InVars {~n~0=v_~n~0_5} OutVars{ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_1|, ~n~0=v_~n~0_5} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#in~size#1] 163#[L76-2]don't care [355] L76-2-->L76-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] 165#[L76-3]don't care [262] L76-3-->L90: 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_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_4|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_7|, ULTIMATE.start_create_fresh_int_array_#t~nondet18#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet18#1_3|, ULTIMATE.start_create_fresh_int_array_#t~post17#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post17#1_4|, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_4|, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset_4|, 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_~arr~0#1.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~nondet18#1, ULTIMATE.start_create_fresh_int_array_#t~post17#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1] 167#[L90]don't care [356] L90-->L91: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_~size#1_6| |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_6|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~size#1] 169#[L91]don't care [274] L91-->L91-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 171#[L91-1]don't care [279] L91-1-->L91-2: Formula: (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_7|) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_5|) 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_5|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1] 173#[L91-2]don't care [314] L91-2-->L37: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_10|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 175#[L37]don't care [300] L37-->L38: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_6| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_11|) 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_11|, 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] 177#[L38]don't care [310] L38-->L37-1: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_1| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_1|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[] 181#[L37-1]don't care [301] L37-1-->L92: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 183#[L92]don't care [343] L92-->L92-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 185#[L92-1]don't care [337] L92-1-->L92-2: Formula: (= (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_1| 4294967296) 1073741823) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1|) InVars {ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_1|} OutVars{ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_1|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1] 187#[L92-2]don't care [304] L92-2-->L37-2: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 189#[L37-2]don't care [271] L37-2-->L38-3: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_3|) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_3|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 191#[L38-3]don't care [281] L38-3-->L37-3: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_5| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_5|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_5|} AuxVars[] AssignedVars[] 195#[L37-3]don't care [277] L37-3-->L94: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 197#[L94]don't care [352] L94-->L94-1: Formula: (and (= (select |v_#valid_4| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_1|) 0) (= (store |v_#valid_4| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_1| 1) |v_#valid_3|) (< |v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_1| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset_1| 0) (= |v_#length_3| (store |v_#length_4| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_1| (* |v_ULTIMATE.start_create_fresh_int_array_~size#1_2| 4))) (not (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_1| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_4|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_2|, #valid=|v_#valid_4|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_3|, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_1|, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset_1|, #length=|v_#length_3|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_2|} AuxVars[] AssignedVars[#valid, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, #length] 199#[L94-1]don't care [324] L94-1-->L94-2: Formula: (and (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset_2| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_1|) (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_2| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_1|)) InVars {ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset_2|, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_2|} OutVars{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_#t~malloc16#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset_2|, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_2|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base] 201#[L94-2]don't care [338] L94-2-->L95: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_3|, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset_3|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset] 203#[L95]don't care [329] L95-->L95-6: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_1| 0) InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~0#1] 205#[L95-6]don't care [2022-07-22 12:01:56,648 INFO L750 eck$LassoCheckResult]: Loop: 205#[L95-6]don't care [321] L95-6-->L96: Formula: (< |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_3| |v_ULTIMATE.start_create_fresh_int_array_~size#1_4|) InVars {ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_3|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_4|} OutVars{ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_3|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_4|} AuxVars[] AssignedVars[] 209#[L96]don't care [344] L96-->L96-1: Formula: (let ((.cse1 (* 4 |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_4|))) (let ((.cse0 (+ .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_2|))) (and (<= 0 .cse0) (= (store |v_#memory_int_4| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2| (store (select |v_#memory_int_4| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2|) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet18#1_1|)) |v_#memory_int_3|) (<= (+ .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_2| 4) (select |v_#length_5| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2|)) (= (select |v_#valid_5| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2|) 1)))) 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_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_4|, ULTIMATE.start_create_fresh_int_array_#t~nondet18#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet18#1_1|, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_4|, #length=|v_#length_5|} 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_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_4|, ULTIMATE.start_create_fresh_int_array_#t~nondet18#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet18#1_1|, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_3|, #length=|v_#length_5|} AuxVars[] AssignedVars[#memory_int] 213#[L96-1]don't care [316] L96-1-->L95-3: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~nondet18#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet18#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~nondet18#1] 217#[L95-3]don't care [347] L95-3-->L95-4: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_#t~post17#1_1| |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_5|) InVars {ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_5|} OutVars{ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_5|, ULTIMATE.start_create_fresh_int_array_#t~post17#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post17#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post17#1] 221#[L95-4]don't care [292] L95-4-->L95-5: Formula: (= (+ |v_ULTIMATE.start_create_fresh_int_array_#t~post17#1_2| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_6|) InVars {ULTIMATE.start_create_fresh_int_array_#t~post17#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post17#1_2|} OutVars{ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_6|, ULTIMATE.start_create_fresh_int_array_#t~post17#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post17#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~0#1] 225#[L95-5]don't care [255] L95-5-->L95-6: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~post17#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post17#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post17#1] 205#[L95-6]don't care [2022-07-22 12:01:56,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:01:56,655 INFO L85 PathProgramCache]: Analyzing trace with hash -1652435759, now seen corresponding path program 1 times [2022-07-22 12:01:56,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:01:56,667 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413757660] [2022-07-22 12:01:56,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:01:56,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:01:56,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:01:56,868 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:01:56,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:01:56,993 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:01:56,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:01:56,998 INFO L85 PathProgramCache]: Analyzing trace with hash 1814974514, now seen corresponding path program 1 times [2022-07-22 12:01:56,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:01:56,999 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247617966] [2022-07-22 12:01:57,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:01:57,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:01:57,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:01:57,040 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:01:57,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:01:57,060 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:01:57,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:01:57,067 INFO L85 PathProgramCache]: Analyzing trace with hash -921614078, now seen corresponding path program 1 times [2022-07-22 12:01:57,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:01:57,068 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593859926] [2022-07-22 12:01:57,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:01:57,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:01:57,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:01:57,114 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:01:57,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:01:57,149 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:01:58,372 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:01:58,372 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:01:58,373 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:01:58,373 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:01:58,373 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 12:01:58,373 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:01:58,373 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:01:58,374 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:01:58,374 INFO L133 ssoRankerPreferences]: Filename of dumped script: test-context1.wvr.c_BEv2_Iteration1_Lasso [2022-07-22 12:01:58,374 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:01:58,374 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:01:58,399 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:01:58,405 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:01:58,409 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:01:58,411 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:01:58,413 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:01:58,415 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:01:58,418 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:01:58,420 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:01:58,423 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:01:58,425 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:01:58,427 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:01:58,428 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:01:58,433 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:01:58,435 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:01:58,437 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:01:58,440 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:01:58,442 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:01:58,445 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:01:58,447 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:01:58,449 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:01:58,451 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:01:58,453 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:01:58,801 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:01:58,803 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:01:58,809 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:01:58,811 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:01:58,813 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:01:58,816 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:01:58,818 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:01:58,824 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:01:59,267 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 12:01:59,272 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-22 12:01:59,274 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:01:59,274 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:01:59,276 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:01:59,285 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:01:59,296 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:01:59,296 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:01:59,297 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:01:59,297 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:01:59,298 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:01:59,300 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:01:59,300 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:01:59,302 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:01:59,313 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:01:59,351 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2022-07-22 12:01:59,352 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:01:59,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:01:59,353 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:01:59,357 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:01:59,357 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:01:59,367 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:01:59,367 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:01:59,367 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:01:59,368 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:01:59,374 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:01:59,374 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:01:59,390 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:01:59,429 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:01:59,432 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:01:59,432 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:01:59,433 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:01:59,436 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:01:59,436 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:01:59,444 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:01:59,445 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:01:59,445 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:01:59,445 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:01:59,448 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:01:59,448 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:01:59,468 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:01:59,504 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:01:59,505 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:01:59,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:01:59,506 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:01:59,508 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:01:59,509 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:01:59,518 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:01:59,518 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:01:59,518 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:01:59,519 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:01:59,519 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:01:59,519 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:01:59,520 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:01:59,533 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:01:59,569 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:01:59,570 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:01:59,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:01:59,573 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:01:59,579 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:01:59,587 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:01:59,588 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:01:59,588 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:01:59,588 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:01:59,588 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:01:59,589 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:01:59,589 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:01:59,590 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:01:59,598 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:01:59,632 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2022-07-22 12:01:59,633 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:01:59,633 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:01:59,634 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:01:59,641 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:01:59,642 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:01:59,649 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:01:59,649 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:01:59,650 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:01:59,650 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:01:59,652 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:01:59,652 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:01:59,668 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:01:59,707 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2022-07-22 12:01:59,708 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:01:59,708 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:01:59,709 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:01:59,715 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:01:59,724 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:01:59,724 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:01:59,724 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:01:59,724 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:01:59,727 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:01:59,727 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:01:59,731 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:01:59,745 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:01:59,782 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:01:59,783 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:01:59,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:01:59,786 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:01:59,791 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:01:59,792 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:01:59,799 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:01:59,800 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:01:59,800 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:01:59,800 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:01:59,803 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:01:59,803 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:01:59,817 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:01:59,843 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:01:59,843 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:01:59,843 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:01:59,845 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:01:59,846 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:01:59,847 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:01:59,854 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:01:59,854 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:01:59,855 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:01:59,855 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:01:59,861 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:01:59,861 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:01:59,876 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:01:59,910 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:01:59,911 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:01:59,911 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:01:59,913 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:01:59,926 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:01:59,935 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:01:59,935 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:01:59,936 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:01:59,936 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:01:59,937 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:01:59,938 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:01:59,938 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:01:59,939 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:01:59,948 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:01:59,981 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2022-07-22 12:01:59,983 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:01:59,984 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:01:59,984 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:01:59,985 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:01:59,989 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:01:59,996 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:01:59,997 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:01:59,997 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:01:59,997 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:01:59,997 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:01:59,998 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:01:59,998 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:01:59,999 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:02:00,021 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:00,022 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:02:00,022 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:02:00,023 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:00,024 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:00,024 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:00,031 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:02:00,031 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:02:00,032 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:02:00,032 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:02:00,035 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:02:00,035 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:02:00,061 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:02:00,085 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:00,086 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:02:00,086 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:02:00,087 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:00,088 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:00,089 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:00,096 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:02:00,096 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:02:00,096 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:02:00,096 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:02:00,097 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:02:00,097 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:02:00,097 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:02:00,098 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:02:00,123 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2022-07-22 12:02:00,123 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:02:00,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:02:00,124 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:00,128 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:00,128 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:00,136 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:02:00,136 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:02:00,136 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:02:00,136 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:02:00,139 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:02:00,139 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:02:00,143 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:02:00,165 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:00,166 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:02:00,166 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:02:00,167 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:00,168 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:00,169 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:00,176 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:02:00,176 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:02:00,176 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:02:00,177 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:02:00,179 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:02:00,180 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:02:00,199 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:02:00,237 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:00,237 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:02:00,238 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:02:00,239 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:00,244 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:00,253 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:02:00,253 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:02:00,253 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:02:00,254 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:02:00,255 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:02:00,256 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:02:00,259 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:00,268 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:02:00,307 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:00,308 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:02:00,308 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:02:00,309 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:00,315 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:00,323 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:02:00,324 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:02:00,324 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:02:00,324 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:02:00,326 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:02:00,326 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:02:00,329 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:00,339 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:02:00,373 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:00,373 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:02:00,373 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:02:00,375 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:00,376 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:00,383 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:00,391 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:02:00,392 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:02:00,392 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:02:00,392 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:02:00,392 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:02:00,393 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:02:00,393 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:02:00,401 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:02:00,423 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:00,423 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:02:00,424 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:02:00,427 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:00,431 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:00,431 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:00,439 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:02:00,439 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:02:00,439 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:02:00,440 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:02:00,440 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:02:00,440 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:02:00,440 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:02:00,441 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:02:00,466 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:00,466 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:02:00,467 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:02:00,469 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:00,473 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:00,474 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:00,484 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:02:00,485 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:02:00,485 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:02:00,485 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:02:00,487 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:02:00,487 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:02:00,499 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:02:00,538 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:00,538 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:02:00,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:02:00,540 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:00,542 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:00,553 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:02:00,553 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:02:00,553 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:02:00,553 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:02:00,553 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:02:00,554 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:02:00,555 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:02:00,556 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:00,564 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:02:00,595 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:00,595 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:02:00,596 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:02:00,596 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:00,597 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:00,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:00,611 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:02:00,611 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:02:00,611 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:02:00,611 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:02:00,613 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:02:00,614 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:02:00,630 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:02:00,667 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:00,668 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:02:00,668 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:02:00,669 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:00,672 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:00,673 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:00,683 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:02:00,683 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:02:00,683 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:02:00,683 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:02:00,686 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:02:00,687 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:02:00,702 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:02:00,727 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2022-07-22 12:02:00,727 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:02:00,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:02:00,728 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:00,730 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:02:00,736 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:00,740 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:02:00,740 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:02:00,740 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:02:00,740 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:02:00,742 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:02:00,742 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:02:00,753 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:02:00,781 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:00,781 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:02:00,781 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:02:00,782 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:00,783 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:00,784 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:00,793 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:02:00,793 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:02:00,793 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:02:00,793 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:02:00,799 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:02:00,799 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:02:00,819 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-22 12:02:00,848 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2022-07-22 12:02:00,848 INFO L444 ModelExtractionUtils]: 11 out of 22 variables were initially zero. Simplification set additionally 8 variables to zero. [2022-07-22 12:02:00,850 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:02:00,851 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:02:00,870 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:00,906 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:00,906 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-22 12:02:00,932 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-07-22 12:02:00,932 INFO L513 LassoAnalysis]: Proved termination. [2022-07-22 12:02:00,933 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_~size#1) = -1*ULTIMATE.start_create_fresh_int_array_~i~0#1 + 1*ULTIMATE.start_create_fresh_int_array_~size#1 Supporting invariants [] [2022-07-22 12:02:01,008 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2022-07-22 12:02:01,059 INFO L257 tatePredicateManager]: 14 out of 14 supporting invariants were superfluous and have been removed [2022-07-22 12:02:01,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:02:01,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:02:01,127 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 12:02:01,132 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:02:01,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:02:01,219 INFO L263 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-22 12:02:01,219 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:02:01,277 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:01,340 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:01,344 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand currently 336 states, but on-demand construction may add more states Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 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:01,484 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand currently 336 states, but on-demand construction may add more states. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 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 654 states and 1609 transitions. Complement of second has 8 states. [2022-07-22 12:02:01,492 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:01,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 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:01,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 130 transitions. [2022-07-22 12:02:01,501 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 130 transitions. Stem has 43 letters. Loop has 6 letters. [2022-07-22 12:02:01,503 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:02:01,503 INFO L690 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2022-07-22 12:02:01,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:02:01,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:02:01,548 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 12:02:01,549 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:02:01,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:02:01,603 INFO L263 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-22 12:02:01,604 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:02:01,691 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:01,692 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:01,697 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand currently 336 states, but on-demand construction may add more states Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 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:01,698 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:01,783 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand currently 336 states, but on-demand construction may add more states. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 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 648 states and 1602 transitions. Complement of second has 10 states. [2022-07-22 12:02:01,783 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:01,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 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:01,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 131 transitions. [2022-07-22 12:02:01,787 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 131 transitions. Stem has 43 letters. Loop has 6 letters. [2022-07-22 12:02:01,788 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:02:01,788 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 131 transitions. Stem has 49 letters. Loop has 6 letters. [2022-07-22 12:02:01,789 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:02:01,789 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 131 transitions. Stem has 43 letters. Loop has 12 letters. [2022-07-22 12:02:01,791 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:02:01,793 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 648 states and 1602 transitions. [2022-07-22 12:02:01,822 INFO L131 ngComponentsAnalysis]: Automaton has 45 accepting balls. 159 [2022-07-22 12:02:01,838 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 648 states to 242 states and 556 transitions. [2022-07-22 12:02:01,840 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 235 [2022-07-22 12:02:01,842 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 236 [2022-07-22 12:02:01,843 INFO L73 IsDeterministic]: Start isDeterministic. Operand 242 states and 556 transitions. [2022-07-22 12:02:01,848 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 12:02:01,849 INFO L220 hiAutomatonCegarLoop]: Abstraction has 242 states and 556 transitions. [2022-07-22 12:02:01,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states and 556 transitions. [2022-07-22 12:02:01,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 242. [2022-07-22 12:02:01,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 242 states have (on average 2.2975206611570247) internal successors, (556), 241 states have internal predecessors, (556), 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:01,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 556 transitions. [2022-07-22 12:02:01,920 INFO L242 hiAutomatonCegarLoop]: Abstraction has 242 states and 556 transitions. [2022-07-22 12:02:01,920 INFO L425 stractBuchiCegarLoop]: Abstraction has 242 states and 556 transitions. [2022-07-22 12:02:01,921 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-07-22 12:02:01,921 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 242 states and 556 transitions. [2022-07-22 12:02:01,923 INFO L131 ngComponentsAnalysis]: Automaton has 45 accepting balls. 159 [2022-07-22 12:02:01,924 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:02:01,924 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:02:01,925 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] [2022-07-22 12:02:01,926 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-07-22 12:02:01,927 INFO L748 eck$LassoCheckResult]: Stem: 2964#[ULTIMATE.startENTRY]don't care [354] ULTIMATE.startENTRY-->L-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 2930#[L-1]don't care [284] 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] 2932#[L-1-1]don't care [360] L-1-1-->L-1-2: Formula: (= (select |v_#valid_14| 0) 0) InVars {#valid=|v_#valid_14|} OutVars{#valid=|v_#valid_14|} AuxVars[] AssignedVars[] 2966#[L-1-2]don't care [361] L-1-2-->L21: Formula: (< 0 |v_#StackHeapBarrier_2|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|} AuxVars[] AssignedVars[] 2808#[L21]don't care [335] L21-->L21-1: Formula: (and (= (select |v_#valid_15| 1) 1) (= 2 (select |v_#length_10| 1))) InVars {#length=|v_#length_10|, #valid=|v_#valid_15|} OutVars{#length=|v_#length_10|, #valid=|v_#valid_15|} AuxVars[] AssignedVars[] 2810#[L21-1]don't care [350] L21-1-->L21-2: Formula: (= (select (select |v_#memory_int_11| 1) 0) 48) InVars {#memory_int=|v_#memory_int_11|} OutVars{#memory_int=|v_#memory_int_11|} AuxVars[] AssignedVars[] 2936#[L21-2]don't care [294] L21-2-->L21-3: Formula: (= (select (select |v_#memory_int_12| 1) 1) 0) InVars {#memory_int=|v_#memory_int_12|} OutVars{#memory_int=|v_#memory_int_12|} AuxVars[] AssignedVars[] 2938#[L21-3]don't care [326] L21-3-->L21-4: Formula: (and (= (select |v_#valid_16| 2) 1) (= (select |v_#length_11| 2) 20)) InVars {#length=|v_#length_11|, #valid=|v_#valid_16|} OutVars{#length=|v_#length_11|, #valid=|v_#valid_16|} AuxVars[] AssignedVars[] 2712#[L21-4]don't care [308] L21-4-->L42: Formula: (and (= v_~queue~0.base_4 0) (= v_~queue~0.offset_4 0)) InVars {} OutVars{~queue~0.base=v_~queue~0.base_4, ~queue~0.offset=v_~queue~0.offset_4} AuxVars[] AssignedVars[~queue~0.offset, ~queue~0.base] 2692#[L42]don't care [299] L42-->L42-1: Formula: (= v_~x~0_3 0) InVars {} OutVars{~x~0=v_~x~0_3} AuxVars[] AssignedVars[~x~0] 2694#[L42-1]don't care [351] L42-1-->L42-2: Formula: (= v_~front~0_7 0) InVars {} OutVars{~front~0=v_~front~0_7} AuxVars[] AssignedVars[~front~0] 2946#[L42-2]don't care [306] L42-2-->L42-3: Formula: (= 0 v_~size~0_8) InVars {} OutVars{~size~0=v_~size~0_8} AuxVars[] AssignedVars[~size~0] 2914#[L42-3]don't care [273] L42-3-->L-1-3: Formula: (= v_~n~0_3 0) InVars {} OutVars{~n~0=v_~n~0_3} AuxVars[] AssignedVars[~n~0] 2916#[L-1-3]don't care [365] L-1-3-->L-1-4: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 2630#[L-1-4]don't care [291] L-1-4-->L-1-5: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 2632#[L-1-5]don't care [270] 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] 2904#[L-1-6]don't care [345] L-1-6-->L72: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~mem15#1=|v_ULTIMATE.start_main_#t~mem15#1_3|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_5|, 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~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_4|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_2|, ULTIMATE.start_main_#t~ret9#1.offset=|v_ULTIMATE.start_main_#t~ret9#1.offset_4|, ULTIMATE.start_main_#t~mem14#1=|v_ULTIMATE.start_main_#t~mem14#1_3|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_1|, ULTIMATE.start_main_#t~ret9#1.base=|v_ULTIMATE.start_main_#t~ret9#1.base_4|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_4|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_2|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem15#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_main_#t~nondet11#1, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_main_#t~mem14#1, ULTIMATE.start_main_#t~nondet8#1, ULTIMATE.start_main_#t~ret9#1.base, ULTIMATE.start_main_#t~pre10#1, ULTIMATE.start_main_#t~nondet13#1, ULTIMATE.start_main_~#t2~0#1.base] 2720#[L72]don't care [311] L72-->L72-1: Formula: (and (= |v_ULTIMATE.start_main_~#t1~0#1.offset_6| 0) (not (= |v_ULTIMATE.start_main_~#t1~0#1.base_6| 0)) (= (store |v_#valid_18| |v_ULTIMATE.start_main_~#t1~0#1.base_6| 1) |v_#valid_17|) (< |v_#StackHeapBarrier_3| |v_ULTIMATE.start_main_~#t1~0#1.base_6|) (= (select |v_#valid_18| |v_ULTIMATE.start_main_~#t1~0#1.base_6|) 0) (= (store |v_#length_13| |v_ULTIMATE.start_main_~#t1~0#1.base_6| 4) |v_#length_12|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_13|, #valid=|v_#valid_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_12|, 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_17|} AuxVars[] AssignedVars[#valid, #length, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t1~0#1.offset] 2722#[L72-1]don't care [315] L72-1-->L72-2: Formula: (and (= (select |v_#valid_20| |v_ULTIMATE.start_main_~#t2~0#1.base_6|) 0) (not (= |v_ULTIMATE.start_main_~#t2~0#1.base_6| 0)) (= (store |v_#valid_20| |v_ULTIMATE.start_main_~#t2~0#1.base_6| 1) |v_#valid_19|) (< |v_#StackHeapBarrier_4| |v_ULTIMATE.start_main_~#t2~0#1.base_6|) (= (store |v_#length_15| |v_ULTIMATE.start_main_~#t2~0#1.base_6| 4) |v_#length_14|) (= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_6|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_4|, #length=|v_#length_15|, #valid=|v_#valid_20|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_4|, #length=|v_#length_14|, 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_19|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2~0#1.offset, #valid, #length, ULTIMATE.start_main_~#t2~0#1.base] 2890#[L72-2]don't care [261] L72-2-->L75: Formula: (= 5 v_~x~0_4) InVars {} OutVars{~x~0=v_~x~0_4} AuxVars[] AssignedVars[~x~0] 2892#[L75]don't care [303] L75-->L75-1: Formula: (= |v_ULTIMATE.start_main_#t~nondet8#1_2| v_~n~0_4) InVars {ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_2|} OutVars{~n~0=v_~n~0_4, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_2|} AuxVars[] AssignedVars[~n~0] 2920#[L75-1]don't care [276] L75-1-->L76: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet8#1] 2734#[L76]don't care [312] L76-->L76-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 2736#[L76-1]don't care [349] L76-1-->L76-2: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_1| v_~n~0_5) InVars {~n~0=v_~n~0_5} OutVars{ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_1|, ~n~0=v_~n~0_5} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#in~size#1] 2962#[L76-2]don't care [355] L76-2-->L76-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] 2894#[L76-3]don't care [262] L76-3-->L90: 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_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_4|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_7|, ULTIMATE.start_create_fresh_int_array_#t~nondet18#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet18#1_3|, ULTIMATE.start_create_fresh_int_array_#t~post17#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post17#1_4|, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_4|, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset_4|, 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_~arr~0#1.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~nondet18#1, ULTIMATE.start_create_fresh_int_array_#t~post17#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1] 2864#[L90]don't care [356] L90-->L91: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_~size#1_6| |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_6|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~size#1] 2866#[L91]don't care [274] L91-->L91-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 2918#[L91-1]don't care [279] L91-1-->L91-2: Formula: (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_7|) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_5|) 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_5|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1] 2738#[L91-2]don't care [314] L91-2-->L37: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_10|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 2696#[L37]don't care [300] L37-->L38: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_6| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_11|) 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_11|, 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] 2698#[L38]don't care [310] L38-->L37-1: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_1| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_1|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[] 2944#[L37-1]don't care [301] L37-1-->L92: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 2854#[L92]don't care [343] L92-->L92-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 2836#[L92-1]don't care [337] L92-1-->L92-2: Formula: (= (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_1| 4294967296) 1073741823) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1|) InVars {ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_1|} OutVars{ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_1|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1] 2838#[L92-2]don't care [304] L92-2-->L37-2: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 2908#[L37-2]don't care [271] L37-2-->L38-3: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_3|) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_3|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 2588#[L38-3]don't care [281] L38-3-->L37-3: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_5| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_5|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_5|} AuxVars[] AssignedVars[] 2574#[L37-3]don't care [277] L37-3-->L94: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 2576#[L94]don't care [352] L94-->L94-1: Formula: (and (= (select |v_#valid_4| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_1|) 0) (= (store |v_#valid_4| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_1| 1) |v_#valid_3|) (< |v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_1| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset_1| 0) (= |v_#length_3| (store |v_#length_4| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_1| (* |v_ULTIMATE.start_create_fresh_int_array_~size#1_2| 4))) (not (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_1| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_4|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_2|, #valid=|v_#valid_4|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_3|, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_1|, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset_1|, #length=|v_#length_3|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_2|} AuxVars[] AssignedVars[#valid, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, #length] 2756#[L94-1]don't care [324] L94-1-->L94-2: Formula: (and (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset_2| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_1|) (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_2| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_1|)) InVars {ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset_2|, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_2|} OutVars{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_#t~malloc16#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset_2|, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_2|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base] 2758#[L94-2]don't care [338] L94-2-->L95: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_3|, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset_3|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset] 2846#[L95]don't care [329] L95-->L95-6: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_1| 0) InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~0#1] 2958#[L95-6]don't care [320] L95-6-->L95-7: Formula: (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_2| |v_ULTIMATE.start_create_fresh_int_array_~size#1_3|)) InVars {ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_2|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_3|} OutVars{ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_2|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_3|} AuxVars[] AssignedVars[] 2900#[L95-7]don't care [268] L95-7-->L98: 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] 2902#[L98]don't care [336] L98-->L76-4: Formula: (and (= |v_ULTIMATE.start_main_#t~ret9#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~ret9#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~ret9#1.offset=|v_ULTIMATE.start_main_#t~ret9#1.offset_1|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_2|, ULTIMATE.start_main_#t~ret9#1.base=|v_ULTIMATE.start_main_#t~ret9#1.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_main_#t~ret9#1.base] 2954#[L76-4]don't care [317] L76-4-->L76-5: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 2956#[L76-5]don't care [357] L76-5-->L76-6: Formula: (and (= |v_ULTIMATE.start_main_#t~ret9#1.base_2| v_~queue~0.base_3) (= v_~queue~0.offset_3 |v_ULTIMATE.start_main_#t~ret9#1.offset_2|)) InVars {ULTIMATE.start_main_#t~ret9#1.base=|v_ULTIMATE.start_main_#t~ret9#1.base_2|, ULTIMATE.start_main_#t~ret9#1.offset=|v_ULTIMATE.start_main_#t~ret9#1.offset_2|} OutVars{~queue~0.offset=v_~queue~0.offset_3, ULTIMATE.start_main_#t~ret9#1.offset=|v_ULTIMATE.start_main_#t~ret9#1.offset_2|, ~queue~0.base=v_~queue~0.base_3, ULTIMATE.start_main_#t~ret9#1.base=|v_ULTIMATE.start_main_#t~ret9#1.base_2|} AuxVars[] AssignedVars[~queue~0.offset, ~queue~0.base] 2882#[L76-6]don't care [256] L76-6-->L79: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~ret9#1.base=|v_ULTIMATE.start_main_#t~ret9#1.base_3|, ULTIMATE.start_main_#t~ret9#1.offset=|v_ULTIMATE.start_main_#t~ret9#1.offset_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_main_#t~ret9#1.base] 2666#[L79]don't care [296] L79-->L79-1: Formula: (= |v_ULTIMATE.start_main_#t~pre10#1_1| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre10#1] 2668#[L79-1]don't care [346] L79-1-->L79-2: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] 2928#[L79-2]don't care [278] L79-2-->L79-3: Formula: (and (= (select |v_#valid_6| |v_ULTIMATE.start_main_~#t1~0#1.base_1|) 1) (= (store |v_#memory_int_6| |v_ULTIMATE.start_main_~#t1~0#1.base_1| (store (select |v_#memory_int_6| |v_ULTIMATE.start_main_~#t1~0#1.base_1|) |v_ULTIMATE.start_main_~#t1~0#1.offset_1| |v_ULTIMATE.start_main_#t~pre10#1_2|)) |v_#memory_int_5|) (<= (+ |v_ULTIMATE.start_main_~#t1~0#1.offset_1| 4) (select |v_#length_6| |v_ULTIMATE.start_main_~#t1~0#1.base_1|)) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_1|)) InVars {ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_2|, #valid=|v_#valid_6|, #memory_int=|v_#memory_int_6|, #length=|v_#length_6|, 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~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_2|, #valid=|v_#valid_6|, #memory_int=|v_#memory_int_5|, #length=|v_#length_6|, 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] 2606#[L79-3]don't care [387] L79-3-->L53: Formula: (and (= v_thread1Thread1of1ForFork1_thidvar0_2 |v_ULTIMATE.start_main_#t~pre10#1_6|) (= 0 v_thread1Thread1of1ForFork1_thidvar1_2)) InVars {ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_6|} OutVars{thread1Thread1of1ForFork1_#t~post3#1=|v_thread1Thread1of1ForFork1_#t~post3#1_4|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_4|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_6|, thread1Thread1of1ForFork1_#t~mem2#1=|v_thread1Thread1of1ForFork1_#t~mem2#1_4|, thread1Thread1of1ForFork1_#t~nondet1#1=|v_thread1Thread1of1ForFork1_#t~nondet1#1_10|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_4|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_4|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_2, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_4|, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post3#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#t~mem2#1, thread1Thread1of1ForFork1_#t~nondet1#1, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#res#1.base, thread1Thread1of1ForFork1_thidvar1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_thidvar0] 2608#[L53, L79-4]don't care [2022-07-22 12:02:01,928 INFO L750 eck$LassoCheckResult]: Loop: 2608#[L53, L79-4]don't care [368] L53-->L48-2: Formula: (not (= (mod |v_thread1Thread1of1ForFork1_#t~nondet1#1_3| 256) 0)) InVars {thread1Thread1of1ForFork1_#t~nondet1#1=|v_thread1Thread1of1ForFork1_#t~nondet1#1_3|} OutVars{thread1Thread1of1ForFork1_#t~nondet1#1=|v_thread1Thread1of1ForFork1_#t~nondet1#1_3|} AuxVars[] AssignedVars[] 2884#[L48-2, L79-4]don't care [371] L48-2-->L49: Formula: true InVars {} OutVars{thread1Thread1of1ForFork1_#t~nondet1#1=|v_thread1Thread1of1ForFork1_#t~nondet1#1_7|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~nondet1#1] 2898#[L49, L79-4]don't care [373] L49-->L53: Formula: (let ((.cse1 (* v_~front~0_52 4)) (.cse2 (* v_~size~0_58 4))) (let ((.cse0 (+ .cse1 .cse2 v_~queue~0.offset_23))) (and (<= 0 .cse0) (= (+ v_~size~0_58 1) v_~size~0_57) (= (select |v_#valid_39| v_~queue~0.base_23) 1) (<= (+ .cse1 .cse2 4 v_~queue~0.offset_23) (select |v_#length_34| v_~queue~0.base_23)) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|) (not (= (ite (let ((.cse3 (+ v_~front~0_52 v_~size~0_58))) (and (< .cse3 v_~n~0_26) (<= 0 .cse3))) 1 0) 0)) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1| (ite (= (select (select |v_#memory_int_31| v_~queue~0.base_23) .cse0) 5) 1 0)) (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_1| 0))))) InVars {~queue~0.offset=v_~queue~0.offset_23, ~size~0=v_~size~0_58, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_31|, #length=|v_#length_34|, ~queue~0.base=v_~queue~0.base_23, ~n~0=v_~n~0_26, ~front~0=v_~front~0_52} OutVars{~queue~0.offset=v_~queue~0.offset_23, ~size~0=v_~size~0_57, thread1Thread1of1ForFork1_#t~mem2#1=|v_thread1Thread1of1ForFork1_#t~mem2#1_1|, ~queue~0.base=v_~queue~0.base_23, thread1Thread1of1ForFork1_#t~post3#1=|v_thread1Thread1of1ForFork1_#t~post3#1_1|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_31|, #length=|v_#length_34|, ~n~0=v_~n~0_26, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, ~front~0=v_~front~0_52} AuxVars[] AssignedVars[~size~0, thread1Thread1of1ForFork1_#t~post3#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#t~mem2#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] 2608#[L53, L79-4]don't care [2022-07-22 12:02:01,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:02:01,928 INFO L85 PathProgramCache]: Analyzing trace with hash 1055391268, now seen corresponding path program 1 times [2022-07-22 12:02:01,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:02:01,929 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528414025] [2022-07-22 12:02:01,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:02:01,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:02:01,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:02:01,960 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:02:01,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:02:01,998 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:02:01,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:02:01,999 INFO L85 PathProgramCache]: Analyzing trace with hash 395313, now seen corresponding path program 1 times [2022-07-22 12:02:01,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:02:02,000 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103465084] [2022-07-22 12:02:02,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:02:02,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:02:02,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:02:02,021 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:02:02,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:02:02,042 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:02:02,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:02:02,043 INFO L85 PathProgramCache]: Analyzing trace with hash 2001023790, now seen corresponding path program 1 times [2022-07-22 12:02:02,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:02:02,044 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570272148] [2022-07-22 12:02:02,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:02:02,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:02:02,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:02:02,278 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:02,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 12:02:02,279 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570272148] [2022-07-22 12:02:02,280 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1570272148] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 12:02:02,280 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 12:02:02,280 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-22 12:02:02,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688953755] [2022-07-22 12:02:02,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 12:02:02,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 12:02:02,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-22 12:02:02,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-07-22 12:02:02,384 INFO L87 Difference]: Start difference. First operand 242 states and 556 transitions. cyclomatic complexity: 360 Second operand has 8 states, 7 states have (on average 8.0) internal successors, (56), 8 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:02,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 12:02:02,550 INFO L93 Difference]: Finished difference Result 762 states and 1754 transitions. [2022-07-22 12:02:02,550 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 762 states and 1754 transitions. [2022-07-22 12:02:02,564 INFO L131 ngComponentsAnalysis]: Automaton has 73 accepting balls. 243 [2022-07-22 12:02:02,572 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 762 states to 489 states and 1165 transitions. [2022-07-22 12:02:02,572 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 479 [2022-07-22 12:02:02,574 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 479 [2022-07-22 12:02:02,574 INFO L73 IsDeterministic]: Start isDeterministic. Operand 489 states and 1165 transitions. [2022-07-22 12:02:02,577 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 12:02:02,577 INFO L220 hiAutomatonCegarLoop]: Abstraction has 489 states and 1165 transitions. [2022-07-22 12:02:02,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 489 states and 1165 transitions. [2022-07-22 12:02:02,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 489 to 296. [2022-07-22 12:02:02,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 296 states have (on average 2.22972972972973) internal successors, (660), 295 states have internal predecessors, (660), 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:02,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 660 transitions. [2022-07-22 12:02:02,602 INFO L242 hiAutomatonCegarLoop]: Abstraction has 296 states and 660 transitions. [2022-07-22 12:02:02,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-22 12:02:02,603 INFO L425 stractBuchiCegarLoop]: Abstraction has 296 states and 660 transitions. [2022-07-22 12:02:02,603 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-07-22 12:02:02,604 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 296 states and 660 transitions. [2022-07-22 12:02:02,608 INFO L131 ngComponentsAnalysis]: Automaton has 45 accepting balls. 159 [2022-07-22 12:02:02,608 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:02:02,608 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:02:02,610 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] [2022-07-22 12:02:02,610 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-07-22 12:02:02,612 INFO L748 eck$LassoCheckResult]: Stem: 4303#[ULTIMATE.startENTRY]don't care [354] ULTIMATE.startENTRY-->L-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 4231#[L-1]don't care [284] 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] 4233#[L-1-1]don't care [360] L-1-1-->L-1-2: Formula: (= (select |v_#valid_14| 0) 0) InVars {#valid=|v_#valid_14|} OutVars{#valid=|v_#valid_14|} AuxVars[] AssignedVars[] 4309#[L-1-2]don't care [361] L-1-2-->L21: Formula: (< 0 |v_#StackHeapBarrier_2|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|} AuxVars[] AssignedVars[] 4073#[L21]don't care [335] L21-->L21-1: Formula: (and (= (select |v_#valid_15| 1) 1) (= 2 (select |v_#length_10| 1))) InVars {#length=|v_#length_10|, #valid=|v_#valid_15|} OutVars{#length=|v_#length_10|, #valid=|v_#valid_15|} AuxVars[] AssignedVars[] 4075#[L21-1]don't care [350] L21-1-->L21-2: Formula: (= (select (select |v_#memory_int_11| 1) 0) 48) InVars {#memory_int=|v_#memory_int_11|} OutVars{#memory_int=|v_#memory_int_11|} AuxVars[] AssignedVars[] 4237#[L21-2]don't care [294] L21-2-->L21-3: Formula: (= (select (select |v_#memory_int_12| 1) 1) 0) InVars {#memory_int=|v_#memory_int_12|} OutVars{#memory_int=|v_#memory_int_12|} AuxVars[] AssignedVars[] 4239#[L21-3]don't care [326] L21-3-->L21-4: Formula: (and (= (select |v_#valid_16| 2) 1) (= (select |v_#length_11| 2) 20)) InVars {#length=|v_#length_11|, #valid=|v_#valid_16|} OutVars{#length=|v_#length_11|, #valid=|v_#valid_16|} AuxVars[] AssignedVars[] 3975#[L21-4]don't care [308] L21-4-->L42: Formula: (and (= v_~queue~0.base_4 0) (= v_~queue~0.offset_4 0)) InVars {} OutVars{~queue~0.base=v_~queue~0.base_4, ~queue~0.offset=v_~queue~0.offset_4} AuxVars[] AssignedVars[~queue~0.offset, ~queue~0.base] 3949#[L42]don't care [299] L42-->L42-1: Formula: (= v_~x~0_3 0) InVars {} OutVars{~x~0=v_~x~0_3} AuxVars[] AssignedVars[~x~0] 3951#[L42-1]don't care [351] L42-1-->L42-2: Formula: (= v_~front~0_7 0) InVars {} OutVars{~front~0=v_~front~0_7} AuxVars[] AssignedVars[~front~0] 4253#[L42-2]don't care [306] L42-2-->L42-3: Formula: (= 0 v_~size~0_8) InVars {} OutVars{~size~0=v_~size~0_8} AuxVars[] AssignedVars[~size~0] 4209#[L42-3]don't care [273] L42-3-->L-1-3: Formula: (= v_~n~0_3 0) InVars {} OutVars{~n~0=v_~n~0_3} AuxVars[] AssignedVars[~n~0] 4211#[L-1-3]don't care [365] L-1-3-->L-1-4: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 3883#[L-1-4]don't care [291] L-1-4-->L-1-5: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 3885#[L-1-5]don't care [270] 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] 4201#[L-1-6]don't care [345] L-1-6-->L72: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~mem15#1=|v_ULTIMATE.start_main_#t~mem15#1_3|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_5|, 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~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_4|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_2|, ULTIMATE.start_main_#t~ret9#1.offset=|v_ULTIMATE.start_main_#t~ret9#1.offset_4|, ULTIMATE.start_main_#t~mem14#1=|v_ULTIMATE.start_main_#t~mem14#1_3|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_1|, ULTIMATE.start_main_#t~ret9#1.base=|v_ULTIMATE.start_main_#t~ret9#1.base_4|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_4|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_2|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem15#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_main_#t~nondet11#1, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_main_#t~mem14#1, ULTIMATE.start_main_#t~nondet8#1, ULTIMATE.start_main_#t~ret9#1.base, ULTIMATE.start_main_#t~pre10#1, ULTIMATE.start_main_#t~nondet13#1, ULTIMATE.start_main_~#t2~0#1.base] 3987#[L72]don't care [311] L72-->L72-1: Formula: (and (= |v_ULTIMATE.start_main_~#t1~0#1.offset_6| 0) (not (= |v_ULTIMATE.start_main_~#t1~0#1.base_6| 0)) (= (store |v_#valid_18| |v_ULTIMATE.start_main_~#t1~0#1.base_6| 1) |v_#valid_17|) (< |v_#StackHeapBarrier_3| |v_ULTIMATE.start_main_~#t1~0#1.base_6|) (= (select |v_#valid_18| |v_ULTIMATE.start_main_~#t1~0#1.base_6|) 0) (= (store |v_#length_13| |v_ULTIMATE.start_main_~#t1~0#1.base_6| 4) |v_#length_12|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_13|, #valid=|v_#valid_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_12|, 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_17|} AuxVars[] AssignedVars[#valid, #length, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t1~0#1.offset] 3989#[L72-1]don't care [315] L72-1-->L72-2: Formula: (and (= (select |v_#valid_20| |v_ULTIMATE.start_main_~#t2~0#1.base_6|) 0) (not (= |v_ULTIMATE.start_main_~#t2~0#1.base_6| 0)) (= (store |v_#valid_20| |v_ULTIMATE.start_main_~#t2~0#1.base_6| 1) |v_#valid_19|) (< |v_#StackHeapBarrier_4| |v_ULTIMATE.start_main_~#t2~0#1.base_6|) (= (store |v_#length_15| |v_ULTIMATE.start_main_~#t2~0#1.base_6| 4) |v_#length_14|) (= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_6|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_4|, #length=|v_#length_15|, #valid=|v_#valid_20|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_4|, #length=|v_#length_14|, 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_19|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2~0#1.offset, #valid, #length, ULTIMATE.start_main_~#t2~0#1.base] 4173#[L72-2]don't care [261] L72-2-->L75: Formula: (= 5 v_~x~0_4) InVars {} OutVars{~x~0=v_~x~0_4} AuxVars[] AssignedVars[~x~0] 4175#[L75]don't care [303] L75-->L75-1: Formula: (= |v_ULTIMATE.start_main_#t~nondet8#1_2| v_~n~0_4) InVars {ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_2|} OutVars{~n~0=v_~n~0_4, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_2|} AuxVars[] AssignedVars[~n~0] 4215#[L75-1]don't care [276] L75-1-->L76: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet8#1] 3997#[L76]don't care [312] L76-->L76-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 3999#[L76-1]don't care [349] L76-1-->L76-2: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_1| v_~n~0_5) InVars {~n~0=v_~n~0_5} OutVars{ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_1|, ~n~0=v_~n~0_5} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#in~size#1] 4299#[L76-2]don't care [355] L76-2-->L76-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] 4177#[L76-3]don't care [262] L76-3-->L90: 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_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_4|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_7|, ULTIMATE.start_create_fresh_int_array_#t~nondet18#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet18#1_3|, ULTIMATE.start_create_fresh_int_array_#t~post17#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post17#1_4|, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_4|, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset_4|, 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_~arr~0#1.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~nondet18#1, ULTIMATE.start_create_fresh_int_array_#t~post17#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1] 4141#[L90]don't care [356] L90-->L91: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_~size#1_6| |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_6|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~size#1] 4143#[L91]don't care [274] L91-->L91-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 4213#[L91-1]don't care [279] L91-1-->L91-2: Formula: (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_7|) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_5|) 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_5|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1] 4005#[L91-2]don't care [314] L91-2-->L37: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_10|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 3953#[L37]don't care [300] L37-->L38: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_6| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_11|) 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_11|, 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] 3955#[L38]don't care [310] L38-->L37-1: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_1| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_1|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[] 4249#[L37-1]don't care [301] L37-1-->L92: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 4129#[L92]don't care [343] L92-->L92-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 4109#[L92-1]don't care [337] L92-1-->L92-2: Formula: (= (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_1| 4294967296) 1073741823) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1|) InVars {ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_1|} OutVars{ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_1|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1] 4111#[L92-2]don't care [304] L92-2-->L37-2: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 4203#[L37-2]don't care [271] L37-2-->L38-3: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_3|) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_3|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 3847#[L38-3]don't care [281] L38-3-->L37-3: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_5| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_5|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_5|} AuxVars[] AssignedVars[] 3835#[L37-3]don't care [277] L37-3-->L94: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 3837#[L94]don't care [352] L94-->L94-1: Formula: (and (= (select |v_#valid_4| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_1|) 0) (= (store |v_#valid_4| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_1| 1) |v_#valid_3|) (< |v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_1| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset_1| 0) (= |v_#length_3| (store |v_#length_4| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_1| (* |v_ULTIMATE.start_create_fresh_int_array_~size#1_2| 4))) (not (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_1| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_4|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_2|, #valid=|v_#valid_4|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_3|, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_1|, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset_1|, #length=|v_#length_3|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_2|} AuxVars[] AssignedVars[#valid, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, #length] 4021#[L94-1]don't care [324] L94-1-->L94-2: Formula: (and (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset_2| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_1|) (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_2| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_1|)) InVars {ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset_2|, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_2|} OutVars{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_#t~malloc16#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset_2|, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_2|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base] 4023#[L94-2]don't care [338] L94-2-->L95: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_3|, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset_3|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset] 4117#[L95]don't care [329] L95-->L95-6: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_1| 0) InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~0#1] 4267#[L95-6]don't care [321] L95-6-->L96: Formula: (< |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_3| |v_ULTIMATE.start_create_fresh_int_array_~size#1_4|) InVars {ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_3|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_4|} OutVars{ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_3|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_4|} AuxVars[] AssignedVars[] 4269#[L96]don't care [344] L96-->L96-1: Formula: (let ((.cse1 (* 4 |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_4|))) (let ((.cse0 (+ .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_2|))) (and (<= 0 .cse0) (= (store |v_#memory_int_4| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2| (store (select |v_#memory_int_4| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2|) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet18#1_1|)) |v_#memory_int_3|) (<= (+ .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_2| 4) (select |v_#length_5| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2|)) (= (select |v_#valid_5| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2|) 1)))) 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_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_4|, ULTIMATE.start_create_fresh_int_array_#t~nondet18#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet18#1_1|, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_4|, #length=|v_#length_5|} 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_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_4|, ULTIMATE.start_create_fresh_int_array_#t~nondet18#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet18#1_1|, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_3|, #length=|v_#length_5|} AuxVars[] AssignedVars[#memory_int] 4259#[L96-1]don't care [316] L96-1-->L95-3: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~nondet18#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet18#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~nondet18#1] 4261#[L95-3]don't care [347] L95-3-->L95-4: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_#t~post17#1_1| |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_5|) InVars {ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_5|} OutVars{ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_5|, ULTIMATE.start_create_fresh_int_array_#t~post17#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post17#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post17#1] 4235#[L95-4]don't care [292] L95-4-->L95-5: Formula: (= (+ |v_ULTIMATE.start_create_fresh_int_array_#t~post17#1_2| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_6|) InVars {ULTIMATE.start_create_fresh_int_array_#t~post17#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post17#1_2|} OutVars{ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_6|, ULTIMATE.start_create_fresh_int_array_#t~post17#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post17#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~0#1] 3749#[L95-5]don't care [255] L95-5-->L95-6: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~post17#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post17#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post17#1] 3751#[L95-6]don't care [320] L95-6-->L95-7: Formula: (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_2| |v_ULTIMATE.start_create_fresh_int_array_~size#1_3|)) InVars {ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_2|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_3|} OutVars{ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_2|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_3|} AuxVars[] AssignedVars[] 4195#[L95-7]don't care [268] L95-7-->L98: 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] 4197#[L98]don't care [336] L98-->L76-4: Formula: (and (= |v_ULTIMATE.start_main_#t~ret9#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~ret9#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~ret9#1.offset=|v_ULTIMATE.start_main_#t~ret9#1.offset_1|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_2|, ULTIMATE.start_main_#t~ret9#1.base=|v_ULTIMATE.start_main_#t~ret9#1.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_main_#t~ret9#1.base] 4263#[L76-4]don't care [317] L76-4-->L76-5: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 4265#[L76-5]don't care [357] L76-5-->L76-6: Formula: (and (= |v_ULTIMATE.start_main_#t~ret9#1.base_2| v_~queue~0.base_3) (= v_~queue~0.offset_3 |v_ULTIMATE.start_main_#t~ret9#1.offset_2|)) InVars {ULTIMATE.start_main_#t~ret9#1.base=|v_ULTIMATE.start_main_#t~ret9#1.base_2|, ULTIMATE.start_main_#t~ret9#1.offset=|v_ULTIMATE.start_main_#t~ret9#1.offset_2|} OutVars{~queue~0.offset=v_~queue~0.offset_3, ULTIMATE.start_main_#t~ret9#1.offset=|v_ULTIMATE.start_main_#t~ret9#1.offset_2|, ~queue~0.base=v_~queue~0.base_3, ULTIMATE.start_main_#t~ret9#1.base=|v_ULTIMATE.start_main_#t~ret9#1.base_2|} AuxVars[] AssignedVars[~queue~0.offset, ~queue~0.base] 4167#[L76-6]don't care [256] L76-6-->L79: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~ret9#1.base=|v_ULTIMATE.start_main_#t~ret9#1.base_3|, ULTIMATE.start_main_#t~ret9#1.offset=|v_ULTIMATE.start_main_#t~ret9#1.offset_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_main_#t~ret9#1.base] 3921#[L79]don't care [296] L79-->L79-1: Formula: (= |v_ULTIMATE.start_main_#t~pre10#1_1| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre10#1] 3923#[L79-1]don't care [346] L79-1-->L79-2: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] 4229#[L79-2]don't care [278] L79-2-->L79-3: Formula: (and (= (select |v_#valid_6| |v_ULTIMATE.start_main_~#t1~0#1.base_1|) 1) (= (store |v_#memory_int_6| |v_ULTIMATE.start_main_~#t1~0#1.base_1| (store (select |v_#memory_int_6| |v_ULTIMATE.start_main_~#t1~0#1.base_1|) |v_ULTIMATE.start_main_~#t1~0#1.offset_1| |v_ULTIMATE.start_main_#t~pre10#1_2|)) |v_#memory_int_5|) (<= (+ |v_ULTIMATE.start_main_~#t1~0#1.offset_1| 4) (select |v_#length_6| |v_ULTIMATE.start_main_~#t1~0#1.base_1|)) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_1|)) InVars {ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_2|, #valid=|v_#valid_6|, #memory_int=|v_#memory_int_6|, #length=|v_#length_6|, 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~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_2|, #valid=|v_#valid_6|, #memory_int=|v_#memory_int_5|, #length=|v_#length_6|, 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] 3861#[L79-3]don't care [387] L79-3-->L53: Formula: (and (= v_thread1Thread1of1ForFork1_thidvar0_2 |v_ULTIMATE.start_main_#t~pre10#1_6|) (= 0 v_thread1Thread1of1ForFork1_thidvar1_2)) InVars {ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_6|} OutVars{thread1Thread1of1ForFork1_#t~post3#1=|v_thread1Thread1of1ForFork1_#t~post3#1_4|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_4|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_6|, thread1Thread1of1ForFork1_#t~mem2#1=|v_thread1Thread1of1ForFork1_#t~mem2#1_4|, thread1Thread1of1ForFork1_#t~nondet1#1=|v_thread1Thread1of1ForFork1_#t~nondet1#1_10|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_4|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_4|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_2, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_4|, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post3#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#t~mem2#1, thread1Thread1of1ForFork1_#t~nondet1#1, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#res#1.base, thread1Thread1of1ForFork1_thidvar1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_thidvar0] 3863#[L53, L79-4]don't care [368] L53-->L48-2: Formula: (not (= (mod |v_thread1Thread1of1ForFork1_#t~nondet1#1_3| 256) 0)) InVars {thread1Thread1of1ForFork1_#t~nondet1#1=|v_thread1Thread1of1ForFork1_#t~nondet1#1_3|} OutVars{thread1Thread1of1ForFork1_#t~nondet1#1=|v_thread1Thread1of1ForFork1_#t~nondet1#1_3|} AuxVars[] AssignedVars[] 4169#[L48-2, L79-4]don't care [371] L48-2-->L49: Formula: true InVars {} OutVars{thread1Thread1of1ForFork1_#t~nondet1#1=|v_thread1Thread1of1ForFork1_#t~nondet1#1_7|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~nondet1#1] 4185#[L49, L79-4]don't care [373] L49-->L53: Formula: (let ((.cse1 (* v_~front~0_52 4)) (.cse2 (* v_~size~0_58 4))) (let ((.cse0 (+ .cse1 .cse2 v_~queue~0.offset_23))) (and (<= 0 .cse0) (= (+ v_~size~0_58 1) v_~size~0_57) (= (select |v_#valid_39| v_~queue~0.base_23) 1) (<= (+ .cse1 .cse2 4 v_~queue~0.offset_23) (select |v_#length_34| v_~queue~0.base_23)) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|) (not (= (ite (let ((.cse3 (+ v_~front~0_52 v_~size~0_58))) (and (< .cse3 v_~n~0_26) (<= 0 .cse3))) 1 0) 0)) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1| (ite (= (select (select |v_#memory_int_31| v_~queue~0.base_23) .cse0) 5) 1 0)) (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_1| 0))))) InVars {~queue~0.offset=v_~queue~0.offset_23, ~size~0=v_~size~0_58, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_31|, #length=|v_#length_34|, ~queue~0.base=v_~queue~0.base_23, ~n~0=v_~n~0_26, ~front~0=v_~front~0_52} OutVars{~queue~0.offset=v_~queue~0.offset_23, ~size~0=v_~size~0_57, thread1Thread1of1ForFork1_#t~mem2#1=|v_thread1Thread1of1ForFork1_#t~mem2#1_1|, ~queue~0.base=v_~queue~0.base_23, thread1Thread1of1ForFork1_#t~post3#1=|v_thread1Thread1of1ForFork1_#t~post3#1_1|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_31|, #length=|v_#length_34|, ~n~0=v_~n~0_26, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, ~front~0=v_~front~0_52} AuxVars[] AssignedVars[~size~0, thread1Thread1of1ForFork1_#t~post3#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#t~mem2#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] 4187#[L53, L79-4]don't care [2022-07-22 12:02:02,612 INFO L750 eck$LassoCheckResult]: Loop: 4187#[L53, L79-4]don't care [368] L53-->L48-2: Formula: (not (= (mod |v_thread1Thread1of1ForFork1_#t~nondet1#1_3| 256) 0)) InVars {thread1Thread1of1ForFork1_#t~nondet1#1=|v_thread1Thread1of1ForFork1_#t~nondet1#1_3|} OutVars{thread1Thread1of1ForFork1_#t~nondet1#1=|v_thread1Thread1of1ForFork1_#t~nondet1#1_3|} AuxVars[] AssignedVars[] 4315#[L48-2, L79-4]don't care [371] L48-2-->L49: Formula: true InVars {} OutVars{thread1Thread1of1ForFork1_#t~nondet1#1=|v_thread1Thread1of1ForFork1_#t~nondet1#1_7|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~nondet1#1] 4335#[L49, L79-4]don't care [373] L49-->L53: Formula: (let ((.cse1 (* v_~front~0_52 4)) (.cse2 (* v_~size~0_58 4))) (let ((.cse0 (+ .cse1 .cse2 v_~queue~0.offset_23))) (and (<= 0 .cse0) (= (+ v_~size~0_58 1) v_~size~0_57) (= (select |v_#valid_39| v_~queue~0.base_23) 1) (<= (+ .cse1 .cse2 4 v_~queue~0.offset_23) (select |v_#length_34| v_~queue~0.base_23)) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|) (not (= (ite (let ((.cse3 (+ v_~front~0_52 v_~size~0_58))) (and (< .cse3 v_~n~0_26) (<= 0 .cse3))) 1 0) 0)) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1| (ite (= (select (select |v_#memory_int_31| v_~queue~0.base_23) .cse0) 5) 1 0)) (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_1| 0))))) InVars {~queue~0.offset=v_~queue~0.offset_23, ~size~0=v_~size~0_58, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_31|, #length=|v_#length_34|, ~queue~0.base=v_~queue~0.base_23, ~n~0=v_~n~0_26, ~front~0=v_~front~0_52} OutVars{~queue~0.offset=v_~queue~0.offset_23, ~size~0=v_~size~0_57, thread1Thread1of1ForFork1_#t~mem2#1=|v_thread1Thread1of1ForFork1_#t~mem2#1_1|, ~queue~0.base=v_~queue~0.base_23, thread1Thread1of1ForFork1_#t~post3#1=|v_thread1Thread1of1ForFork1_#t~post3#1_1|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_31|, #length=|v_#length_34|, ~n~0=v_~n~0_26, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, ~front~0=v_~front~0_52} AuxVars[] AssignedVars[~size~0, thread1Thread1of1ForFork1_#t~post3#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#t~mem2#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] 4187#[L53, L79-4]don't care [2022-07-22 12:02:02,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:02:02,613 INFO L85 PathProgramCache]: Analyzing trace with hash -2031757667, now seen corresponding path program 1 times [2022-07-22 12:02:02,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:02:02,613 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747716403] [2022-07-22 12:02:02,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:02:02,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:02:02,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:02:02,660 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:02:02,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:02:02,751 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:02:02,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:02:02,753 INFO L85 PathProgramCache]: Analyzing trace with hash 395313, now seen corresponding path program 2 times [2022-07-22 12:02:02,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:02:02,753 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411951223] [2022-07-22 12:02:02,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:02:02,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:02:02,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:02:02,766 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:02:02,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:02:02,785 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:02:02,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:02:02,786 INFO L85 PathProgramCache]: Analyzing trace with hash 881810453, now seen corresponding path program 2 times [2022-07-22 12:02:02,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:02:02,787 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575565192] [2022-07-22 12:02:02,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:02:02,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:02:02,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:02:03,081 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 12:02:03,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 12:02:03,082 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575565192] [2022-07-22 12:02:03,082 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1575565192] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 12:02:03,082 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1627824441] [2022-07-22 12:02:03,082 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-22 12:02:03,083 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 12:02:03,083 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:02:03,084 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 12:02:03,102 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2022-07-22 12:02:03,166 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-22 12:02:03,167 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 12:02:03,169 INFO L263 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-22 12:02:03,176 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:02:03,596 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 12:02:03,596 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 12:02:03,973 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 12:02:03,974 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1627824441] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 12:02:03,974 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 12:02:03,974 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 27 [2022-07-22 12:02:03,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051275936] [2022-07-22 12:02:03,975 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 12:02:04,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 12:02:04,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-07-22 12:02:04,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=574, Unknown=0, NotChecked=0, Total=756 [2022-07-22 12:02:04,075 INFO L87 Difference]: Start difference. First operand 296 states and 660 transitions. cyclomatic complexity: 410 Second operand has 28 states, 27 states have (on average 6.444444444444445) internal successors, (174), 28 states have internal predecessors, (174), 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:04,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 12:02:04,593 INFO L93 Difference]: Finished difference Result 930 states and 2220 transitions. [2022-07-22 12:02:04,593 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 930 states and 2220 transitions. [2022-07-22 12:02:04,607 INFO L131 ngComponentsAnalysis]: Automaton has 104 accepting balls. 336 [2022-07-22 12:02:04,618 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 930 states to 786 states and 1856 transitions. [2022-07-22 12:02:04,619 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 770 [2022-07-22 12:02:04,620 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 770 [2022-07-22 12:02:04,620 INFO L73 IsDeterministic]: Start isDeterministic. Operand 786 states and 1856 transitions. [2022-07-22 12:02:04,623 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 12:02:04,623 INFO L220 hiAutomatonCegarLoop]: Abstraction has 786 states and 1856 transitions. [2022-07-22 12:02:04,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 786 states and 1856 transitions. [2022-07-22 12:02:04,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 786 to 419. [2022-07-22 12:02:04,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 419 states, 419 states have (on average 2.2291169451073984) internal successors, (934), 418 states have internal predecessors, (934), 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:04,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 934 transitions. [2022-07-22 12:02:04,649 INFO L242 hiAutomatonCegarLoop]: Abstraction has 419 states and 934 transitions. [2022-07-22 12:02:04,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-22 12:02:04,650 INFO L425 stractBuchiCegarLoop]: Abstraction has 419 states and 934 transitions. [2022-07-22 12:02:04,651 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2022-07-22 12:02:04,651 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 419 states and 934 transitions. [2022-07-22 12:02:04,656 INFO L131 ngComponentsAnalysis]: Automaton has 57 accepting balls. 195 [2022-07-22 12:02:04,656 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:02:04,656 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:02:04,658 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, 1] [2022-07-22 12:02:04,658 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-07-22 12:02:04,660 INFO L748 eck$LassoCheckResult]: Stem: 6272#[ULTIMATE.startENTRY]don't care [354] ULTIMATE.startENTRY-->L-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 6186#[L-1]don't care [284] 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] 6188#[L-1-1]don't care [360] L-1-1-->L-1-2: Formula: (= (select |v_#valid_14| 0) 0) InVars {#valid=|v_#valid_14|} OutVars{#valid=|v_#valid_14|} AuxVars[] AssignedVars[] 6280#[L-1-2]don't care [361] L-1-2-->L21: Formula: (< 0 |v_#StackHeapBarrier_2|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|} AuxVars[] AssignedVars[] 6022#[L21]don't care [335] L21-->L21-1: Formula: (and (= (select |v_#valid_15| 1) 1) (= 2 (select |v_#length_10| 1))) InVars {#length=|v_#length_10|, #valid=|v_#valid_15|} OutVars{#length=|v_#length_10|, #valid=|v_#valid_15|} AuxVars[] AssignedVars[] 6024#[L21-1]don't care [350] L21-1-->L21-2: Formula: (= (select (select |v_#memory_int_11| 1) 0) 48) InVars {#memory_int=|v_#memory_int_11|} OutVars{#memory_int=|v_#memory_int_11|} AuxVars[] AssignedVars[] 6196#[L21-2]don't care [294] L21-2-->L21-3: Formula: (= (select (select |v_#memory_int_12| 1) 1) 0) InVars {#memory_int=|v_#memory_int_12|} OutVars{#memory_int=|v_#memory_int_12|} AuxVars[] AssignedVars[] 6198#[L21-3]don't care [326] L21-3-->L21-4: Formula: (and (= (select |v_#valid_16| 2) 1) (= (select |v_#length_11| 2) 20)) InVars {#length=|v_#length_11|, #valid=|v_#valid_16|} OutVars{#length=|v_#length_11|, #valid=|v_#valid_16|} AuxVars[] AssignedVars[] 5920#[L21-4]don't care [308] L21-4-->L42: Formula: (and (= v_~queue~0.base_4 0) (= v_~queue~0.offset_4 0)) InVars {} OutVars{~queue~0.base=v_~queue~0.base_4, ~queue~0.offset=v_~queue~0.offset_4} AuxVars[] AssignedVars[~queue~0.offset, ~queue~0.base] 5900#[L42]don't care [299] L42-->L42-1: Formula: (= v_~x~0_3 0) InVars {} OutVars{~x~0=v_~x~0_3} AuxVars[] AssignedVars[~x~0] 5902#[L42-1]don't care [351] L42-1-->L42-2: Formula: (= v_~front~0_7 0) InVars {} OutVars{~front~0=v_~front~0_7} AuxVars[] AssignedVars[~front~0] 6212#[L42-2]don't care [306] L42-2-->L42-3: Formula: (= 0 v_~size~0_8) InVars {} OutVars{~size~0=v_~size~0_8} AuxVars[] AssignedVars[~size~0] 6160#[L42-3]don't care [273] L42-3-->L-1-3: Formula: (= v_~n~0_3 0) InVars {} OutVars{~n~0=v_~n~0_3} AuxVars[] AssignedVars[~n~0] 6162#[L-1-3]don't care [365] L-1-3-->L-1-4: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 5834#[L-1-4]don't care [291] L-1-4-->L-1-5: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 5836#[L-1-5]don't care [270] 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] 6152#[L-1-6]don't care [345] L-1-6-->L72: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~mem15#1=|v_ULTIMATE.start_main_#t~mem15#1_3|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_5|, 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~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_4|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_2|, ULTIMATE.start_main_#t~ret9#1.offset=|v_ULTIMATE.start_main_#t~ret9#1.offset_4|, ULTIMATE.start_main_#t~mem14#1=|v_ULTIMATE.start_main_#t~mem14#1_3|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_1|, ULTIMATE.start_main_#t~ret9#1.base=|v_ULTIMATE.start_main_#t~ret9#1.base_4|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_4|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_2|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem15#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_main_#t~nondet11#1, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_main_#t~mem14#1, ULTIMATE.start_main_#t~nondet8#1, ULTIMATE.start_main_#t~ret9#1.base, ULTIMATE.start_main_#t~pre10#1, ULTIMATE.start_main_#t~nondet13#1, ULTIMATE.start_main_~#t2~0#1.base] 5932#[L72]don't care [311] L72-->L72-1: Formula: (and (= |v_ULTIMATE.start_main_~#t1~0#1.offset_6| 0) (not (= |v_ULTIMATE.start_main_~#t1~0#1.base_6| 0)) (= (store |v_#valid_18| |v_ULTIMATE.start_main_~#t1~0#1.base_6| 1) |v_#valid_17|) (< |v_#StackHeapBarrier_3| |v_ULTIMATE.start_main_~#t1~0#1.base_6|) (= (select |v_#valid_18| |v_ULTIMATE.start_main_~#t1~0#1.base_6|) 0) (= (store |v_#length_13| |v_ULTIMATE.start_main_~#t1~0#1.base_6| 4) |v_#length_12|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_13|, #valid=|v_#valid_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_12|, 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_17|} AuxVars[] AssignedVars[#valid, #length, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t1~0#1.offset] 5934#[L72-1]don't care [315] L72-1-->L72-2: Formula: (and (= (select |v_#valid_20| |v_ULTIMATE.start_main_~#t2~0#1.base_6|) 0) (not (= |v_ULTIMATE.start_main_~#t2~0#1.base_6| 0)) (= (store |v_#valid_20| |v_ULTIMATE.start_main_~#t2~0#1.base_6| 1) |v_#valid_19|) (< |v_#StackHeapBarrier_4| |v_ULTIMATE.start_main_~#t2~0#1.base_6|) (= (store |v_#length_15| |v_ULTIMATE.start_main_~#t2~0#1.base_6| 4) |v_#length_14|) (= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_6|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_4|, #length=|v_#length_15|, #valid=|v_#valid_20|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_4|, #length=|v_#length_14|, 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_19|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2~0#1.offset, #valid, #length, ULTIMATE.start_main_~#t2~0#1.base] 6132#[L72-2]don't care [261] L72-2-->L75: Formula: (= 5 v_~x~0_4) InVars {} OutVars{~x~0=v_~x~0_4} AuxVars[] AssignedVars[~x~0] 6134#[L75]don't care [303] L75-->L75-1: Formula: (= |v_ULTIMATE.start_main_#t~nondet8#1_2| v_~n~0_4) InVars {ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_2|} OutVars{~n~0=v_~n~0_4, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_2|} AuxVars[] AssignedVars[~n~0] 6168#[L75-1]don't care [276] L75-1-->L76: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet8#1] 5942#[L76]don't care [312] L76-->L76-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 5944#[L76-1]don't care [349] L76-1-->L76-2: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_1| v_~n~0_5) InVars {~n~0=v_~n~0_5} OutVars{ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_1|, ~n~0=v_~n~0_5} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#in~size#1] 6268#[L76-2]don't care [355] L76-2-->L76-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] 6136#[L76-3]don't care [262] L76-3-->L90: 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_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_4|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_7|, ULTIMATE.start_create_fresh_int_array_#t~nondet18#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet18#1_3|, ULTIMATE.start_create_fresh_int_array_#t~post17#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post17#1_4|, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_4|, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset_4|, 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_~arr~0#1.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~nondet18#1, ULTIMATE.start_create_fresh_int_array_#t~post17#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1] 6088#[L90]don't care [356] L90-->L91: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_~size#1_6| |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_6|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~size#1] 6090#[L91]don't care [274] L91-->L91-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 6164#[L91-1]don't care [279] L91-1-->L91-2: Formula: (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_7|) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_5|) 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_5|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1] 5946#[L91-2]don't care [314] L91-2-->L37: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_10|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 5904#[L37]don't care [300] L37-->L38: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_6| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_11|) 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_11|, 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] 5906#[L38]don't care [310] L38-->L37-1: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_1| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_1|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[] 6208#[L37-1]don't care [301] L37-1-->L92: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 6076#[L92]don't care [343] L92-->L92-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 6058#[L92-1]don't care [337] L92-1-->L92-2: Formula: (= (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_1| 4294967296) 1073741823) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1|) InVars {ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_1|} OutVars{ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_1|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1] 6060#[L92-2]don't care [304] L92-2-->L37-2: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 6154#[L37-2]don't care [271] L37-2-->L38-3: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_3|) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_3|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 5804#[L38-3]don't care [281] L38-3-->L37-3: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_5| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_5|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_5|} AuxVars[] AssignedVars[] 5794#[L37-3]don't care [277] L37-3-->L94: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 5796#[L94]don't care [352] L94-->L94-1: Formula: (and (= (select |v_#valid_4| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_1|) 0) (= (store |v_#valid_4| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_1| 1) |v_#valid_3|) (< |v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_1| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset_1| 0) (= |v_#length_3| (store |v_#length_4| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_1| (* |v_ULTIMATE.start_create_fresh_int_array_~size#1_2| 4))) (not (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_1| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_4|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_2|, #valid=|v_#valid_4|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_3|, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_1|, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset_1|, #length=|v_#length_3|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_2|} AuxVars[] AssignedVars[#valid, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, #length] 5966#[L94-1]don't care [324] L94-1-->L94-2: Formula: (and (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset_2| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_1|) (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_2| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_1|)) InVars {ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset_2|, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_2|} OutVars{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_#t~malloc16#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset_2|, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_2|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base] 5968#[L94-2]don't care [338] L94-2-->L95: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_3|, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset_3|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset] 6068#[L95]don't care [329] L95-->L95-6: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_1| 0) InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~0#1] 6226#[L95-6]don't care [321] L95-6-->L96: Formula: (< |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_3| |v_ULTIMATE.start_create_fresh_int_array_~size#1_4|) InVars {ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_3|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_4|} OutVars{ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_3|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_4|} AuxVars[] AssignedVars[] 6228#[L96]don't care [344] L96-->L96-1: Formula: (let ((.cse1 (* 4 |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_4|))) (let ((.cse0 (+ .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_2|))) (and (<= 0 .cse0) (= (store |v_#memory_int_4| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2| (store (select |v_#memory_int_4| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2|) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet18#1_1|)) |v_#memory_int_3|) (<= (+ .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_2| 4) (select |v_#length_5| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2|)) (= (select |v_#valid_5| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2|) 1)))) 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_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_4|, ULTIMATE.start_create_fresh_int_array_#t~nondet18#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet18#1_1|, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_4|, #length=|v_#length_5|} 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_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_4|, ULTIMATE.start_create_fresh_int_array_#t~nondet18#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet18#1_1|, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_3|, #length=|v_#length_5|} AuxVars[] AssignedVars[#memory_int] 6336#[L96-1]don't care [316] L96-1-->L95-3: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~nondet18#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet18#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~nondet18#1] 6334#[L95-3]don't care [347] L95-3-->L95-4: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_#t~post17#1_1| |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_5|) InVars {ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_5|} OutVars{ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_5|, ULTIMATE.start_create_fresh_int_array_#t~post17#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post17#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post17#1] 6332#[L95-4]don't care [292] L95-4-->L95-5: Formula: (= (+ |v_ULTIMATE.start_create_fresh_int_array_#t~post17#1_2| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_6|) InVars {ULTIMATE.start_create_fresh_int_array_#t~post17#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post17#1_2|} OutVars{ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_6|, ULTIMATE.start_create_fresh_int_array_#t~post17#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post17#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~0#1] 5712#[L95-5]don't care [255] L95-5-->L95-6: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~post17#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post17#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post17#1] 5714#[L95-6]don't care [320] L95-6-->L95-7: Formula: (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_2| |v_ULTIMATE.start_create_fresh_int_array_~size#1_3|)) InVars {ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_2|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_3|} OutVars{ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_2|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_3|} AuxVars[] AssignedVars[] 6146#[L95-7]don't care [268] L95-7-->L98: 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] 6148#[L98]don't care [336] L98-->L76-4: Formula: (and (= |v_ULTIMATE.start_main_#t~ret9#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~ret9#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~ret9#1.offset=|v_ULTIMATE.start_main_#t~ret9#1.offset_1|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_2|, ULTIMATE.start_main_#t~ret9#1.base=|v_ULTIMATE.start_main_#t~ret9#1.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_main_#t~ret9#1.base] 6222#[L76-4]don't care [317] L76-4-->L76-5: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 6224#[L76-5]don't care [357] L76-5-->L76-6: Formula: (and (= |v_ULTIMATE.start_main_#t~ret9#1.base_2| v_~queue~0.base_3) (= v_~queue~0.offset_3 |v_ULTIMATE.start_main_#t~ret9#1.offset_2|)) InVars {ULTIMATE.start_main_#t~ret9#1.base=|v_ULTIMATE.start_main_#t~ret9#1.base_2|, ULTIMATE.start_main_#t~ret9#1.offset=|v_ULTIMATE.start_main_#t~ret9#1.offset_2|} OutVars{~queue~0.offset=v_~queue~0.offset_3, ULTIMATE.start_main_#t~ret9#1.offset=|v_ULTIMATE.start_main_#t~ret9#1.offset_2|, ~queue~0.base=v_~queue~0.base_3, ULTIMATE.start_main_#t~ret9#1.base=|v_ULTIMATE.start_main_#t~ret9#1.base_2|} AuxVars[] AssignedVars[~queue~0.offset, ~queue~0.base] 6120#[L76-6]don't care [256] L76-6-->L79: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~ret9#1.base=|v_ULTIMATE.start_main_#t~ret9#1.base_3|, ULTIMATE.start_main_#t~ret9#1.offset=|v_ULTIMATE.start_main_#t~ret9#1.offset_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_main_#t~ret9#1.base] 6122#[L79]don't care [296] L79-->L79-1: Formula: (= |v_ULTIMATE.start_main_#t~pre10#1_1| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre10#1] 6264#[L79-1]don't care [346] L79-1-->L79-2: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] 6266#[L79-2]don't care [278] L79-2-->L79-3: Formula: (and (= (select |v_#valid_6| |v_ULTIMATE.start_main_~#t1~0#1.base_1|) 1) (= (store |v_#memory_int_6| |v_ULTIMATE.start_main_~#t1~0#1.base_1| (store (select |v_#memory_int_6| |v_ULTIMATE.start_main_~#t1~0#1.base_1|) |v_ULTIMATE.start_main_~#t1~0#1.offset_1| |v_ULTIMATE.start_main_#t~pre10#1_2|)) |v_#memory_int_5|) (<= (+ |v_ULTIMATE.start_main_~#t1~0#1.offset_1| 4) (select |v_#length_6| |v_ULTIMATE.start_main_~#t1~0#1.base_1|)) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_1|)) InVars {ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_2|, #valid=|v_#valid_6|, #memory_int=|v_#memory_int_6|, #length=|v_#length_6|, 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~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_2|, #valid=|v_#valid_6|, #memory_int=|v_#memory_int_5|, #length=|v_#length_6|, 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] 5818#[L79-3]don't care [387] L79-3-->L53: Formula: (and (= v_thread1Thread1of1ForFork1_thidvar0_2 |v_ULTIMATE.start_main_#t~pre10#1_6|) (= 0 v_thread1Thread1of1ForFork1_thidvar1_2)) InVars {ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_6|} OutVars{thread1Thread1of1ForFork1_#t~post3#1=|v_thread1Thread1of1ForFork1_#t~post3#1_4|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_4|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_6|, thread1Thread1of1ForFork1_#t~mem2#1=|v_thread1Thread1of1ForFork1_#t~mem2#1_4|, thread1Thread1of1ForFork1_#t~nondet1#1=|v_thread1Thread1of1ForFork1_#t~nondet1#1_10|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_4|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_4|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_2, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_4|, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post3#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#t~mem2#1, thread1Thread1of1ForFork1_#t~nondet1#1, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#res#1.base, thread1Thread1of1ForFork1_thidvar1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_thidvar0] 5820#[L53, L79-4]don't care [368] L53-->L48-2: Formula: (not (= (mod |v_thread1Thread1of1ForFork1_#t~nondet1#1_3| 256) 0)) InVars {thread1Thread1of1ForFork1_#t~nondet1#1=|v_thread1Thread1of1ForFork1_#t~nondet1#1_3|} OutVars{thread1Thread1of1ForFork1_#t~nondet1#1=|v_thread1Thread1of1ForFork1_#t~nondet1#1_3|} AuxVars[] AssignedVars[] 6328#[L48-2, L79-4]don't care [371] L48-2-->L49: Formula: true InVars {} OutVars{thread1Thread1of1ForFork1_#t~nondet1#1=|v_thread1Thread1of1ForFork1_#t~nondet1#1_7|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~nondet1#1] 6326#[L49, L79-4]don't care [373] L49-->L53: Formula: (let ((.cse1 (* v_~front~0_52 4)) (.cse2 (* v_~size~0_58 4))) (let ((.cse0 (+ .cse1 .cse2 v_~queue~0.offset_23))) (and (<= 0 .cse0) (= (+ v_~size~0_58 1) v_~size~0_57) (= (select |v_#valid_39| v_~queue~0.base_23) 1) (<= (+ .cse1 .cse2 4 v_~queue~0.offset_23) (select |v_#length_34| v_~queue~0.base_23)) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|) (not (= (ite (let ((.cse3 (+ v_~front~0_52 v_~size~0_58))) (and (< .cse3 v_~n~0_26) (<= 0 .cse3))) 1 0) 0)) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1| (ite (= (select (select |v_#memory_int_31| v_~queue~0.base_23) .cse0) 5) 1 0)) (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_1| 0))))) InVars {~queue~0.offset=v_~queue~0.offset_23, ~size~0=v_~size~0_58, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_31|, #length=|v_#length_34|, ~queue~0.base=v_~queue~0.base_23, ~n~0=v_~n~0_26, ~front~0=v_~front~0_52} OutVars{~queue~0.offset=v_~queue~0.offset_23, ~size~0=v_~size~0_57, thread1Thread1of1ForFork1_#t~mem2#1=|v_thread1Thread1of1ForFork1_#t~mem2#1_1|, ~queue~0.base=v_~queue~0.base_23, thread1Thread1of1ForFork1_#t~post3#1=|v_thread1Thread1of1ForFork1_#t~post3#1_1|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_31|, #length=|v_#length_34|, ~n~0=v_~n~0_26, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, ~front~0=v_~front~0_52} AuxVars[] AssignedVars[~size~0, thread1Thread1of1ForFork1_#t~post3#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#t~mem2#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] 6282#[L53, L79-4]don't care [302] L79-4-->L79-5: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre10#1] 6286#[L79-5, L53]don't care [269] L79-5-->L80: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet11#1] 6288#[L80, L53]don't care [264] L80-->L80-1: Formula: (= |v_ULTIMATE.start_main_#t~pre12#1_1| |v_#pthreadsForks_4|) InVars {#pthreadsForks=|v_#pthreadsForks_4|} OutVars{#pthreadsForks=|v_#pthreadsForks_4|, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre12#1] 6290#[L53, L80-1]don't care [348] L80-1-->L80-2: Formula: (= (+ 1 |v_#pthreadsForks_6|) |v_#pthreadsForks_5|) InVars {#pthreadsForks=|v_#pthreadsForks_6|} OutVars{#pthreadsForks=|v_#pthreadsForks_5|} AuxVars[] AssignedVars[#pthreadsForks] 6292#[L80-2, L53]don't care [272] L80-2-->L80-3: Formula: (and (= (store |v_#memory_int_8| |v_ULTIMATE.start_main_~#t2~0#1.base_1| (store (select |v_#memory_int_8| |v_ULTIMATE.start_main_~#t2~0#1.base_1|) |v_ULTIMATE.start_main_~#t2~0#1.offset_1| |v_ULTIMATE.start_main_#t~pre12#1_2|)) |v_#memory_int_7|) (= (select |v_#valid_7| |v_ULTIMATE.start_main_~#t2~0#1.base_1|) 1) (<= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_1|) (<= (+ 4 |v_ULTIMATE.start_main_~#t2~0#1.offset_1|) (select |v_#length_7| |v_ULTIMATE.start_main_~#t2~0#1.base_1|))) InVars {ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_2|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_1|, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_8|, #length=|v_#length_7|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_1|} OutVars{ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_2|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_1|, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_7|, #length=|v_#length_7|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_1|} AuxVars[] AssignedVars[#memory_int] 6308#[L53, L80-3]don't care [384] L80-3-->L66: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar0_2 |v_ULTIMATE.start_main_#t~pre12#1_6|) (= v_thread2Thread1of1ForFork0_thidvar2_2 0) (= v_thread2Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_6|} OutVars{thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_4|, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_6|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_4|, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_4|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_4|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_2, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_2, thread2Thread1of1ForFork0_#t~mem5#1=|v_thread2Thread1of1ForFork0_#t~mem5#1_4|, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_2, thread2Thread1of1ForFork0_#t~post7#1=|v_thread2Thread1of1ForFork0_#t~post7#1_4|, thread2Thread1of1ForFork0_#t~nondet4#1=|v_thread2Thread1of1ForFork0_#t~nondet4#1_10|, thread2Thread1of1ForFork0_#t~post6#1=|v_thread2Thread1of1ForFork0_#t~post6#1_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_thidvar2, thread2Thread1of1ForFork0_thidvar1, thread2Thread1of1ForFork0_#t~mem5#1, thread2Thread1of1ForFork0_thidvar0, thread2Thread1of1ForFork0_#t~post7#1, thread2Thread1of1ForFork0_#t~nondet4#1, thread2Thread1of1ForFork0_#t~post6#1] 6048#[L66, L80-4, L53]don't care [2022-07-22 12:02:04,661 INFO L750 eck$LassoCheckResult]: Loop: 6048#[L66, L80-4, L53]don't care [376] L66-->L59-2: Formula: (not (= (mod |v_thread2Thread1of1ForFork0_#t~nondet4#1_3| 256) 0)) InVars {thread2Thread1of1ForFork0_#t~nondet4#1=|v_thread2Thread1of1ForFork0_#t~nondet4#1_3|} OutVars{thread2Thread1of1ForFork0_#t~nondet4#1=|v_thread2Thread1of1ForFork0_#t~nondet4#1_3|} AuxVars[] AssignedVars[] 6016#[L59-2, L80-4, L53]don't care [379] L59-2-->L60: Formula: true InVars {} OutVars{thread2Thread1of1ForFork0_#t~nondet4#1=|v_thread2Thread1of1ForFork0_#t~nondet4#1_7|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#t~nondet4#1] 6032#[L60, L80-4, L53]don't care [381] L60-->L66: Formula: (let ((.cse1 (* v_~front~0_65 4))) (let ((.cse0 (+ .cse1 v_~queue~0.offset_29))) (and (<= 0 .cse0) (= (+ v_~size~0_69 1) v_~size~0_70) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_1| 0)) (= (ite (and (< v_~front~0_65 v_~n~0_34) (<= 0 v_~front~0_65)) 1 0) |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|) (not (= (ite (< 0 v_~size~0_70) 1 0) 0)) (= (+ v_~front~0_65 1) v_~front~0_64) (= v_~x~0_15 (select (select |v_#memory_int_37| v_~queue~0.base_29) .cse0)) (<= (+ .cse1 4 v_~queue~0.offset_29) (select |v_#length_40| v_~queue~0.base_29)) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1| |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|) (= (select |v_#valid_45| v_~queue~0.base_29) 1)))) InVars {~queue~0.offset=v_~queue~0.offset_29, ~size~0=v_~size~0_70, #valid=|v_#valid_45|, #memory_int=|v_#memory_int_37|, #length=|v_#length_40|, ~queue~0.base=v_~queue~0.base_29, ~n~0=v_~n~0_34, ~front~0=v_~front~0_65} OutVars{~queue~0.offset=v_~queue~0.offset_29, ~size~0=v_~size~0_69, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, ~queue~0.base=v_~queue~0.base_29, thread2Thread1of1ForFork0_#t~post7#1=|v_thread2Thread1of1ForFork0_#t~post7#1_1|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, #valid=|v_#valid_45|, #memory_int=|v_#memory_int_37|, thread2Thread1of1ForFork0_#t~mem5#1=|v_thread2Thread1of1ForFork0_#t~mem5#1_1|, #length=|v_#length_40|, ~n~0=v_~n~0_34, ~x~0=v_~x~0_15, thread2Thread1of1ForFork0_#t~post6#1=|v_thread2Thread1of1ForFork0_#t~post6#1_1|, ~front~0=v_~front~0_64} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~size~0, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~mem5#1, thread2Thread1of1ForFork0_#t~post7#1, ~x~0, thread2Thread1of1ForFork0_#t~post6#1, ~front~0] 6048#[L66, L80-4, L53]don't care [2022-07-22 12:02:04,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:02:04,661 INFO L85 PathProgramCache]: Analyzing trace with hash 8595904, now seen corresponding path program 1 times [2022-07-22 12:02:04,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:02:04,662 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576113335] [2022-07-22 12:02:04,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:02:04,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:02:04,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:02:04,701 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:02:04,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:02:04,735 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:02:04,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:02:04,736 INFO L85 PathProgramCache]: Analyzing trace with hash 403257, now seen corresponding path program 1 times [2022-07-22 12:02:04,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:02:04,737 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814486736] [2022-07-22 12:02:04,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:02:04,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:02:04,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:02:04,743 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:02:04,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:02:04,750 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:02:04,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:02:04,751 INFO L85 PathProgramCache]: Analyzing trace with hash -1617088230, now seen corresponding path program 1 times [2022-07-22 12:02:04,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:02:04,751 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731093197] [2022-07-22 12:02:04,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:02:04,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:02:04,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:02:04,792 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:02:04,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:02:04,837 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:02:06,837 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:02:06,837 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:02:06,837 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:02:06,837 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:02:06,837 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 12:02:06,838 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:02:06,838 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:02:06,838 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:02:06,838 INFO L133 ssoRankerPreferences]: Filename of dumped script: test-context1.wvr.c_BEv2_Iteration4_Lasso [2022-07-22 12:02:06,838 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:02:06,838 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:02:06,845 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:02:06,851 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:02:06,852 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:02:06,854 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:02:06,855 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:06,857 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:02:06,860 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:02:06,861 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:02:06,862 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:02:06,863 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:02:06,866 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:02:06,868 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:06,871 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:06,872 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:02:06,874 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:06,879 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:06,880 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:06,882 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:06,884 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:06,887 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:06,888 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:06,892 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:06,894 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:06,896 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:06,898 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:06,909 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:06,911 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:06,913 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:06,917 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:06,918 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:02:06,921 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:06,923 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:02:06,924 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:06,926 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:07,878 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.IllegalArgumentException at de.uni_freiburg.informatik.ultimate.util.datastructures.ScopedHashMap.put(ScopedHashMap.java:331) at java.base/java.util.AbstractMap.putAll(AbstractMap.java:281) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.PureSubstitution.(PureSubstitution.java:81) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.Substitution.(Substitution.java:48) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.Substitution.apply(Substitution.java:59) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.replaceMapReads(MapEliminator.java:518) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.getRewrittenTransFormula(MapEliminator.java:342) at de.uni_freiburg.informatik.ultimate.lassoranker.preprocessors.MapEliminationLassoPreprocessor.process(MapEliminationLassoPreprocessor.java:111) at de.uni_freiburg.informatik.ultimate.lassoranker.variables.LassoBuilder.applyPreprocessor(LassoBuilder.java:154) at de.uni_freiburg.informatik.ultimate.lassoranker.variables.LassoBuilder.preprocess(LassoBuilder.java:262) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.preprocess(LassoAnalysis.java:280) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.(LassoAnalysis.java:229) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.synthesize(LassoCheck.java: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.(LassoCheck.java:819) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.(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:07,886 INFO L158 Benchmark]: Toolchain (without parser) took 13119.89ms. Allocated memory was 158.3MB in the beginning and 229.6MB in the end (delta: 71.3MB). Free memory was 137.1MB in the beginning and 94.4MB in the end (delta: 42.7MB). Peak memory consumption was 136.0MB. Max. memory is 8.0GB. [2022-07-22 12:02:07,890 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 158.3MB. Free memory was 127.7MB in the beginning and 127.7MB in the end (delta: 73.7kB). There was no memory consumed. Max. memory is 8.0GB. [2022-07-22 12:02:07,891 INFO L158 Benchmark]: CACSL2BoogieTranslator took 418.67ms. Allocated memory is still 158.3MB. Free memory was 136.9MB in the beginning and 126.4MB in the end (delta: 10.6MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-07-22 12:02:07,892 INFO L158 Benchmark]: Boogie Procedure Inliner took 99.14ms. Allocated memory is still 158.3MB. Free memory was 126.2MB in the beginning and 140.1MB in the end (delta: -13.9MB). Peak memory consumption was 3.3MB. Max. memory is 8.0GB. [2022-07-22 12:02:07,892 INFO L158 Benchmark]: Boogie Preprocessor took 55.32ms. Allocated memory is still 158.3MB. Free memory was 140.1MB in the beginning and 138.8MB in the end (delta: 1.3MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-07-22 12:02:07,893 INFO L158 Benchmark]: RCFGBuilder took 803.93ms. Allocated memory is still 158.3MB. Free memory was 138.7MB in the beginning and 118.1MB in the end (delta: 20.6MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. [2022-07-22 12:02:07,894 INFO L158 Benchmark]: BuchiAutomizer took 11730.95ms. Allocated memory was 158.3MB in the beginning and 229.6MB in the end (delta: 71.3MB). Free memory was 117.8MB in the beginning and 94.4MB in the end (delta: 23.4MB). Peak memory consumption was 118.1MB. Max. memory is 8.0GB. [2022-07-22 12:02:07,900 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.25ms. Allocated memory is still 158.3MB. Free memory was 127.7MB in the beginning and 127.7MB in the end (delta: 73.7kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 418.67ms. Allocated memory is still 158.3MB. Free memory was 136.9MB in the beginning and 126.4MB in the end (delta: 10.6MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 99.14ms. Allocated memory is still 158.3MB. Free memory was 126.2MB in the beginning and 140.1MB in the end (delta: -13.9MB). Peak memory consumption was 3.3MB. Max. memory is 8.0GB. * Boogie Preprocessor took 55.32ms. Allocated memory is still 158.3MB. Free memory was 140.1MB in the beginning and 138.8MB in the end (delta: 1.3MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 803.93ms. Allocated memory is still 158.3MB. Free memory was 138.7MB in the beginning and 118.1MB in the end (delta: 20.6MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. * BuchiAutomizer took 11730.95ms. Allocated memory was 158.3MB in the beginning and 229.6MB in the end (delta: 71.3MB). Free memory was 117.8MB in the beginning and 94.4MB in the end (delta: 23.4MB). Peak memory consumption was 118.1MB. 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:07,961 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2022-07-22 12:02:08,149 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...