/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-semanticLbe.epf -i ../../../trunk/examples/svcomp/weaver/popl20-channel-sum.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-21b0908 [2022-07-22 12:21:15,112 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-22 12:21:15,115 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-22 12:21:15,179 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-22 12:21:15,180 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-22 12:21:15,182 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-22 12:21:15,191 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-22 12:21:15,196 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-22 12:21:15,200 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-22 12:21:15,208 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-22 12:21:15,210 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-22 12:21:15,213 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-22 12:21:15,214 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-22 12:21:15,216 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-22 12:21:15,217 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-22 12:21:15,224 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-22 12:21:15,225 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-22 12:21:15,227 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-22 12:21:15,230 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-22 12:21:15,241 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-22 12:21:15,255 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-22 12:21:15,257 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-22 12:21:15,258 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-22 12:21:15,259 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-22 12:21:15,260 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-22 12:21:15,264 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-22 12:21:15,264 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-22 12:21:15,264 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-22 12:21:15,265 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-22 12:21:15,266 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-22 12:21:15,267 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-22 12:21:15,267 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-22 12:21:15,268 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-22 12:21:15,269 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-22 12:21:15,269 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-22 12:21:15,270 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-22 12:21:15,271 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-22 12:21:15,271 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-22 12:21:15,272 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-22 12:21:15,272 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-22 12:21:15,273 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-22 12:21:15,274 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-22 12:21:15,275 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/buchiAutomizer/concurrent-automaton-semanticLbe.epf [2022-07-22 12:21:15,304 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-22 12:21:15,304 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-22 12:21:15,304 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-22 12:21:15,305 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-22 12:21:15,306 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-22 12:21:15,306 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-22 12:21:15,306 INFO L138 SettingsManager]: * Use SBE=true [2022-07-22 12:21:15,307 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-07-22 12:21:15,307 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-07-22 12:21:15,307 INFO L138 SettingsManager]: * Use old map elimination=false [2022-07-22 12:21:15,307 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-07-22 12:21:15,307 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-07-22 12:21:15,308 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-07-22 12:21:15,308 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-22 12:21:15,308 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-22 12:21:15,308 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-22 12:21:15,308 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-22 12:21:15,309 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-22 12:21:15,309 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-22 12:21:15,309 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-07-22 12:21:15,309 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-07-22 12:21:15,309 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-07-22 12:21:15,310 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-22 12:21:15,310 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-22 12:21:15,310 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-07-22 12:21:15,310 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-22 12:21:15,310 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-07-22 12:21:15,311 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-22 12:21:15,311 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-22 12:21:15,311 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-22 12:21:15,312 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-22 12:21:15,313 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-07-22 12:21:15,313 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:21:15,680 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-22 12:21:15,705 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-22 12:21:15,708 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-22 12:21:15,709 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-22 12:21:15,713 INFO L275 PluginConnector]: CDTParser initialized [2022-07-22 12:21:15,714 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-channel-sum.wvr.c [2022-07-22 12:21:15,802 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3171547d4/33de12898fa04c1ba622250e6d78f488/FLAG99fe6ba5f [2022-07-22 12:21:16,563 INFO L306 CDTParser]: Found 1 translation units. [2022-07-22 12:21:16,564 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-channel-sum.wvr.c [2022-07-22 12:21:16,573 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3171547d4/33de12898fa04c1ba622250e6d78f488/FLAG99fe6ba5f [2022-07-22 12:21:16,900 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3171547d4/33de12898fa04c1ba622250e6d78f488 [2022-07-22 12:21:16,905 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-22 12:21:16,912 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-07-22 12:21:16,914 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-22 12:21:16,914 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-22 12:21:16,918 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-22 12:21:16,919 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 12:21:16" (1/1) ... [2022-07-22 12:21:16,920 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c71d12d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:21:16, skipping insertion in model container [2022-07-22 12:21:16,921 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 12:21:16" (1/1) ... [2022-07-22 12:21:16,930 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-22 12:21:16,952 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-22 12:21:17,143 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/popl20-channel-sum.wvr.c[2947,2960] [2022-07-22 12:21:17,149 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 12:21:17,159 INFO L203 MainTranslator]: Completed pre-run [2022-07-22 12:21:17,185 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/popl20-channel-sum.wvr.c[2947,2960] [2022-07-22 12:21:17,189 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 12:21:17,206 INFO L208 MainTranslator]: Completed translation [2022-07-22 12:21:17,207 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:21:17 WrapperNode [2022-07-22 12:21:17,207 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-22 12:21:17,208 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-22 12:21:17,209 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-22 12:21:17,209 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-22 12:21:17,216 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:21:17" (1/1) ... [2022-07-22 12:21:17,226 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:21:17" (1/1) ... [2022-07-22 12:21:17,257 INFO L137 Inliner]: procedures = 24, calls = 45, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 148 [2022-07-22 12:21:17,257 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-22 12:21:17,258 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-22 12:21:17,258 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-22 12:21:17,258 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-22 12:21:17,271 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:21:17" (1/1) ... [2022-07-22 12:21:17,271 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:21:17" (1/1) ... [2022-07-22 12:21:17,274 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:21:17" (1/1) ... [2022-07-22 12:21:17,275 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:21:17" (1/1) ... [2022-07-22 12:21:17,283 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:21:17" (1/1) ... [2022-07-22 12:21:17,289 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:21:17" (1/1) ... [2022-07-22 12:21:17,291 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:21:17" (1/1) ... [2022-07-22 12:21:17,294 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-22 12:21:17,295 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-22 12:21:17,295 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-22 12:21:17,295 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-22 12:21:17,296 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:21:17" (1/1) ... [2022-07-22 12:21:17,311 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:21:17,328 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:21:17,343 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:21:17,356 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:21:17,409 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-22 12:21:17,409 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-07-22 12:21:17,409 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-07-22 12:21:17,409 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-07-22 12:21:17,410 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-07-22 12:21:17,410 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-22 12:21:17,410 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-22 12:21:17,410 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-22 12:21:17,410 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-07-22 12:21:17,410 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-07-22 12:21:17,411 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-22 12:21:17,411 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-22 12:21:17,411 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-22 12:21:17,411 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-22 12:21:17,411 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-22 12:21:17,413 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:21:17,512 INFO L234 CfgBuilder]: Building ICFG [2022-07-22 12:21:17,514 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-22 12:21:17,907 INFO L275 CfgBuilder]: Performing block encoding [2022-07-22 12:21:17,976 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-22 12:21:17,976 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-07-22 12:21:17,979 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 12:21:17 BoogieIcfgContainer [2022-07-22 12:21:17,979 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-22 12:21:17,980 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-07-22 12:21:17,981 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-07-22 12:21:17,985 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-07-22 12:21:17,986 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-22 12:21:17,986 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.07 12:21:16" (1/3) ... [2022-07-22 12:21:17,988 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@600273aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.07 12:21:17, skipping insertion in model container [2022-07-22 12:21:17,988 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-22 12:21:17,988 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:21:17" (2/3) ... [2022-07-22 12:21:17,988 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@600273aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.07 12:21:17, skipping insertion in model container [2022-07-22 12:21:17,989 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-22 12:21:17,989 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 12:21:17" (3/3) ... [2022-07-22 12:21:17,991 INFO L322 chiAutomizerObserver]: Analyzing ICFG popl20-channel-sum.wvr.c [2022-07-22 12:21:18,094 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-07-22 12:21:18,147 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 134 places, 140 transitions, 296 flow [2022-07-22 12:21:18,244 INFO L129 PetriNetUnfolder]: 11/136 cut-off events. [2022-07-22 12:21:18,244 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-07-22 12:21:18,250 INFO L84 FinitePrefix]: Finished finitePrefix Result has 145 conditions, 136 events. 11/136 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 126 event pairs, 0 based on Foata normal form. 0/125 useless extension candidates. Maximal degree in co-relation 96. Up to 2 conditions per place. [2022-07-22 12:21:18,250 INFO L82 GeneralOperation]: Start removeDead. Operand has 134 places, 140 transitions, 296 flow [2022-07-22 12:21:18,267 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 132 places, 136 transitions, 284 flow [2022-07-22 12:21:18,271 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-07-22 12:21:18,289 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 132 places, 136 transitions, 284 flow [2022-07-22 12:21:18,292 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 132 places, 136 transitions, 284 flow [2022-07-22 12:21:18,293 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 132 places, 136 transitions, 284 flow [2022-07-22 12:21:18,320 INFO L129 PetriNetUnfolder]: 11/136 cut-off events. [2022-07-22 12:21:18,320 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-07-22 12:21:18,321 INFO L84 FinitePrefix]: Finished finitePrefix Result has 145 conditions, 136 events. 11/136 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 129 event pairs, 0 based on Foata normal form. 0/125 useless extension candidates. Maximal degree in co-relation 96. Up to 2 conditions per place. [2022-07-22 12:21:18,323 INFO L116 LiptonReduction]: Number of co-enabled transitions 1292 [2022-07-22 12:21:23,709 INFO L131 LiptonReduction]: Checked pairs total: 1475 [2022-07-22 12:21:23,709 INFO L133 LiptonReduction]: Total number of compositions: 150 [2022-07-22 12:21:23,735 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2022-07-22 12:21:23,735 INFO L301 stractBuchiCegarLoop]: Hoare is false [2022-07-22 12:21:23,735 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-07-22 12:21:23,735 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-07-22 12:21:23,736 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-07-22 12:21:23,736 INFO L305 stractBuchiCegarLoop]: Difference is false [2022-07-22 12:21:23,736 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-07-22 12:21:23,736 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-07-22 12:21:23,738 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 0 states, but on-demand construction may add more states [2022-07-22 12:21:23,800 INFO L131 ngComponentsAnalysis]: Automaton has 15 accepting balls. 23 [2022-07-22 12:21:23,800 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:21:23,800 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:21:23,806 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2022-07-22 12:21:23,806 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-22 12:21:23,806 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-07-22 12:21:23,807 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 42 states, but on-demand construction may add more states [2022-07-22 12:21:23,812 INFO L131 ngComponentsAnalysis]: Automaton has 15 accepting balls. 23 [2022-07-22 12:21:23,812 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:21:23,812 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:21:23,813 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2022-07-22 12:21:23,813 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-22 12:21:23,820 INFO L748 eck$LassoCheckResult]: Stem: 137#[ULTIMATE.startENTRY]don't care [587] ULTIMATE.startENTRY-->L115-6: Formula: (let ((.cse2 (store |v_#valid_In_7| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6| 1))) (let ((.cse0 (select |v_#memory_int_In_5| 1)) (.cse1 (store .cse2 |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6| 1))) (and (= |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_Out_2| 0) (= (select .cse0 1) 0) (= |v_#length_Out_6| (store (store (store |v_#length_In_7| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6| 4) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_2| (* 4 |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2|))) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_Out_6| 0) (= (select |v_#length_In_7| 2) 25) (= 0 |v_#NULL.base_Out_2|) (< |v_#StackHeapBarrier_In_3| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6|) (= v_~element~0_Out_6 0) (= v_~queue~0.offset_Out_2 0) (= 48 (select .cse0 0)) (= v_~queue~0.base_Out_2 0) (= (select |v_#valid_In_7| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6|) 0) (= (store .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_2| 1) |v_#valid_Out_10|) (= (select |v_#valid_In_7| 0) 0) (= |v_#NULL.offset_Out_2| 0) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_6| (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2| 4294967296) 1073741823) 1 0)) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_2| |v_#StackHeapBarrier_In_3|) (< 0 |v_#StackHeapBarrier_In_3|) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2|) 1 0) 0)) (= (select |v_#valid_In_7| 2) 1) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_10| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_6|) (= (select |v_#valid_In_7| 1) 1) (= 0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_Out_2|) (= v_~back~0_Out_6 v_~front~0_Out_2) (= v_~n~0_Out_2 |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_2|) (= |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2| |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_2|) (= (select .cse2 |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6|) 0) (= 2 (select |v_#length_In_7| 1)) (= v_~sum~0_Out_2 0) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_2| 0)) (< |v_#StackHeapBarrier_In_3| |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6|) (= (select .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_2|) 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_Out_6| 0) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_10| 0))))) InVars {#memory_int=|v_#memory_int_In_5|, #StackHeapBarrier=|v_#StackHeapBarrier_In_3|, #length=|v_#length_In_7|, #valid=|v_#valid_In_7|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_Out_2|, ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_Out_2|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_Out_2|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_Out_6|, ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_Out_2|, #NULL.offset=|v_#NULL.offset_Out_2|, ULTIMATE.start_create_fresh_int_array_#t~malloc17#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc17#1.offset_Out_6|, ULTIMATE.start_create_fresh_int_array_#t~malloc17#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc17#1.base_Out_6|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_6|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_Out_6|, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_Out_2|, ~sum~0=v_~sum~0_Out_2, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_2|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_10|, ULTIMATE.start_create_fresh_int_array_#t~post18#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post18#1_Out_2|, #length=|v_#length_Out_6|, ~front~0=v_~front~0_Out_2, ULTIMATE.start_main_#t~ret10#1.base=|v_ULTIMATE.start_main_#t~ret10#1.base_Out_2|, ~queue~0.offset=v_~queue~0.offset_Out_2, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_2|, ULTIMATE.start_main_#t~ret10#1.offset=|v_ULTIMATE.start_main_#t~ret10#1.offset_Out_2|, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_Out_2|, ULTIMATE.start_main_#t~mem15#1=|v_ULTIMATE.start_main_#t~mem15#1_Out_2|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_Out_6|, ~back~0=v_~back~0_Out_6, ULTIMATE.start_main_#t~mem16#1=|v_ULTIMATE.start_main_#t~mem16#1_Out_6|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_Out_6|, ~queue~0.base=v_~queue~0.base_Out_2, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2|, #NULL.base=|v_#NULL.base_Out_2|, ULTIMATE.start_main_#t~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_Out_2|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_6|, #StackHeapBarrier=|v_#StackHeapBarrier_In_3|, ~element~0=v_~element~0_Out_6, ULTIMATE.start_create_fresh_int_array_#t~nondet19#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet19#1_Out_2|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_Out_2|, #valid=|v_#valid_Out_10|, #memory_int=|v_#memory_int_In_5|, ~n~0=v_~n~0_Out_2, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_Out_6|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_6|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_main_#t~pre13#1, ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_#t~nondet9#1, #NULL.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc17#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc17#1.base, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_#t~nondet12#1, ~sum~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_create_fresh_int_array_#t~post18#1, #length, ~front~0, ULTIMATE.start_main_#t~ret10#1.base, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_main_#t~ret10#1.offset, ULTIMATE.start_main_#t~pre11#1, ULTIMATE.start_main_#t~mem15#1, ULTIMATE.start_main_#res#1, ~back~0, ULTIMATE.start_main_#t~mem16#1, ULTIMATE.start_main_~#t1~0#1.base, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_~size#1, #NULL.base, ULTIMATE.start_main_#t~nondet14#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~element~0, ULTIMATE.start_create_fresh_int_array_#t~nondet19#1, ULTIMATE.start_main_#t~nondet8#1, #valid, ~n~0, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 140#[L115-6]don't care [2022-07-22 12:21:23,820 INFO L750 eck$LassoCheckResult]: Loop: 140#[L115-6]don't care [554] L115-6-->L115-6: Formula: (let ((.cse0 (* |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_29| 4))) (let ((.cse1 (+ .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_21|))) (and (<= (+ .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_21| 4) (select |v_#length_121| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_21|)) (<= 0 .cse1) (= (+ |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_29| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_28|) (= (store |v_#memory_int_107| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_21| (store (select |v_#memory_int_107| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_21|) .cse1 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet19#1_13|)) |v_#memory_int_106|) (< |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_29| |v_ULTIMATE.start_create_fresh_int_array_~size#1_38|) (= (select |v_#valid_148| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_21|) 1)))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_21|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_21|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_29|, ULTIMATE.start_create_fresh_int_array_#t~nondet19#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet19#1_13|, #valid=|v_#valid_148|, #memory_int=|v_#memory_int_107|, #length=|v_#length_121|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_38|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_21|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_21|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_28|, #valid=|v_#valid_148|, ULTIMATE.start_create_fresh_int_array_#t~post18#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post18#1_13|, #memory_int=|v_#memory_int_106|, #length=|v_#length_121|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_38|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~nondet19#1, ULTIMATE.start_create_fresh_int_array_#t~post18#1, #memory_int] 140#[L115-6]don't care [2022-07-22 12:21:23,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:21:23,827 INFO L85 PathProgramCache]: Analyzing trace with hash 618, now seen corresponding path program 1 times [2022-07-22 12:21:23,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:21:23,839 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672933781] [2022-07-22 12:21:23,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:21:23,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:21:23,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:21:23,995 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:21:24,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:21:24,081 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:21:24,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:21:24,084 INFO L85 PathProgramCache]: Analyzing trace with hash 585, now seen corresponding path program 1 times [2022-07-22 12:21:24,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:21:24,085 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978000733] [2022-07-22 12:21:24,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:21:24,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:21:24,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:21:24,117 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:21:24,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:21:24,139 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:21:24,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:21:24,143 INFO L85 PathProgramCache]: Analyzing trace with hash 19712, now seen corresponding path program 1 times [2022-07-22 12:21:24,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:21:24,143 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940485444] [2022-07-22 12:21:24,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:21:24,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:21:24,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:21:24,222 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:21:24,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:21:24,278 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:21:24,831 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:21:24,833 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:21:24,833 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:21:24,833 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:21:24,833 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 12:21:24,833 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:21:24,834 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:21:24,834 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:21:24,834 INFO L133 ssoRankerPreferences]: Filename of dumped script: popl20-channel-sum.wvr.c_BEv2_Iteration1_Lasso [2022-07-22 12:21:24,834 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:21:24,834 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:21:24,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:21:24,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:21:24,870 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:21:24,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:21:24,873 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:21:24,876 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:21:24,878 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:21:24,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:21:24,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:21:24,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:21:24,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:21:24,901 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:21:24,903 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:21:24,904 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:21:24,906 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:21:25,237 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:21:25,239 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:21:25,242 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:21:25,243 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:21:25,247 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:21:25,250 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:21:25,251 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:21:25,254 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:21:25,256 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:21:25,258 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:21:25,260 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:21:25,262 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:21:25,264 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:21:25,265 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:21:25,267 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:21:25,269 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:21:25,713 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 12:21:25,718 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-22 12:21:25,720 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:21:25,721 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:21:25,733 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:21:25,740 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:21:25,740 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:21:25,752 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:21:25,752 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:21:25,753 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:21:25,753 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:21:25,758 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:21:25,758 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:21:25,774 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:21:25,811 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:21:25,812 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:21:25,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:21:25,813 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:21:25,816 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:21:25,817 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:21:25,827 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:21:25,827 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:21:25,827 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:21:25,827 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:21:25,830 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:21:25,830 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:21:25,844 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:21:25,882 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:21:25,882 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:21:25,882 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:21:25,884 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:21:25,887 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:21:25,887 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:21:25,895 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:21:25,895 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:21:25,896 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:21:25,896 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:21:25,896 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:21:25,899 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:21:25,899 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:21:25,915 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:21:25,954 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:21:25,954 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:21:25,955 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:21:25,956 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:21:25,986 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:21:25,987 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:21:25,995 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:21:25,995 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:21:25,996 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:21:25,996 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:21:25,996 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:21:25,997 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:21:25,997 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:21:26,001 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:21:26,023 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2022-07-22 12:21:26,024 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:21:26,024 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:21:26,026 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:21:26,027 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:21:26,030 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:21:26,037 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:21:26,037 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:21:26,037 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:21:26,037 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:21:26,038 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:21:26,043 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:21:26,043 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:21:26,046 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:21:26,068 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:21:26,068 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:21:26,068 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:21:26,070 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:21:26,071 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:21:26,072 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:21:26,081 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:21:26,081 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:21:26,081 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:21:26,081 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:21:26,081 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:21:26,082 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:21:26,082 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:21:26,102 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:21:26,137 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:21:26,138 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:21:26,138 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:21:26,139 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:21:26,143 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:21:26,153 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:21:26,153 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:21:26,153 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:21:26,153 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:21:26,153 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:21:26,154 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:21:26,154 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:21:26,155 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:21:26,166 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:21:26,197 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:21:26,197 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:21:26,197 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:21:26,198 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:21:26,199 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:21:26,201 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:21:26,208 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:21:26,208 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:21:26,208 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:21:26,208 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:21:26,208 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:21:26,215 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:21:26,215 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:21:26,226 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:21:26,252 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:21:26,253 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:21:26,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:21:26,255 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:21:26,256 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:21:26,256 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:21:26,265 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:21:26,265 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:21:26,265 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:21:26,266 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:21:26,269 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:21:26,269 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:21:26,288 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:21:26,321 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:21:26,322 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:21:26,322 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:21:26,323 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:21:26,333 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:21:26,341 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:21:26,342 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:21:26,342 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:21:26,342 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:21:26,344 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:21:26,344 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:21:26,349 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:21:26,357 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:21:26,388 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:21:26,390 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:21:26,390 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:21:26,391 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:21:26,396 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:21:26,397 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:21:26,405 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:21:26,406 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:21:26,406 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:21:26,406 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:21:26,408 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:21:26,408 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:21:26,411 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:21:26,433 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2022-07-22 12:21:26,433 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:21:26,433 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:21:26,434 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:21:26,436 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:21:26,438 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:21:26,446 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:21:26,447 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:21:26,447 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:21:26,447 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:21:26,449 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:21:26,449 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:21:26,460 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:21:26,495 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:21:26,495 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:21:26,495 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:21:26,499 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:21:26,503 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:21:26,504 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:21:26,514 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:21:26,514 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:21:26,514 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:21:26,514 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:21:26,514 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:21:26,515 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:21:26,515 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:21:26,526 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:21:26,559 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2022-07-22 12:21:26,560 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:21:26,560 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:21:26,561 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:21:26,565 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:21:26,566 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:21:26,573 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:21:26,573 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:21:26,573 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:21:26,573 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:21:26,575 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:21:26,575 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:21:26,591 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:21:26,626 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:21:26,626 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:21:26,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:21:26,627 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:21:26,633 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:21:26,642 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:21:26,642 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2022-07-22 12:21:26,642 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:21:26,642 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:21:26,646 INFO L401 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2022-07-22 12:21:26,646 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:21:26,653 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:21:26,660 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:21:26,693 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:21:26,694 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:21:26,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:21:26,695 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:21:26,697 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:21:26,698 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:21:26,707 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:21:26,707 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:21:26,707 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:21:26,708 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:21:26,710 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:21:26,710 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:21:26,722 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:21:26,750 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:21:26,750 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:21:26,751 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:21:26,751 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:21:26,753 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:21:26,754 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:21:26,762 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:21:26,762 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:21:26,762 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:21:26,762 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:21:26,772 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:21:26,772 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:21:26,783 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:21:26,806 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:21:26,806 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:21:26,806 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:21:26,807 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:21:26,811 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:21:26,812 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:21:26,822 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:21:26,822 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:21:26,822 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:21:26,822 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:21:26,824 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:21:26,824 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:21:26,828 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:21:26,851 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2022-07-22 12:21:26,852 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:21:26,852 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:21:26,853 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:21:26,860 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:21:26,861 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:21:26,869 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:21:26,869 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:21:26,869 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:21:26,869 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:21:26,871 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:21:26,871 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:21:26,886 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:21:26,922 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:21:26,923 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:21:26,923 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:21:26,925 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:21:26,935 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:21:26,936 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:21:26,943 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:21:26,943 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:21:26,943 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:21:26,943 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:21:26,943 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:21:26,944 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:21:26,944 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:21:26,958 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:21:26,996 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:21:26,997 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:21:26,997 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:21:26,998 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:21:27,000 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:21:27,007 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:21:27,010 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:21:27,010 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:21:27,010 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:21:27,011 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:21:27,016 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:21:27,016 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:21:27,035 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-22 12:21:27,086 INFO L443 ModelExtractionUtils]: Simplification made 17 calls to the SMT solver. [2022-07-22 12:21:27,087 INFO L444 ModelExtractionUtils]: 10 out of 22 variables were initially zero. Simplification set additionally 8 variables to zero. [2022-07-22 12:21:27,089 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:21:27,089 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:21:27,090 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:21:27,098 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-22 12:21:27,106 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:21:27,130 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-07-22 12:21:27,130 INFO L513 LassoAnalysis]: Proved termination. [2022-07-22 12:21:27,131 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_create_fresh_int_array_~i~0#1, v_rep(select #length ULTIMATE.start_create_fresh_int_array_~arr~0#1.base)_1) = -1*ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset - 4*ULTIMATE.start_create_fresh_int_array_~i~0#1 + 2*v_rep(select #length ULTIMATE.start_create_fresh_int_array_~arr~0#1.base)_1 Supporting invariants [] [2022-07-22 12:21:27,172 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:21:27,242 INFO L257 tatePredicateManager]: 14 out of 14 supporting invariants were superfluous and have been removed [2022-07-22 12:21:27,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:21:27,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:21:27,320 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 12:21:27,322 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:21:27,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:21:27,342 INFO L263 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-22 12:21:27,342 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:21:27,343 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:21:27,417 INFO L142 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2022-07-22 12:21:27,420 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand currently 42 states, but on-demand construction may add more states Second operand has 2 states, 2 states have (on average 1.0) internal successors, (2), 1 states have internal predecessors, (2), 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:21:27,466 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand currently 42 states, but on-demand construction may add more states. Second operand has 2 states, 2 states have (on average 1.0) internal successors, (2), 1 states have internal predecessors, (2), 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 44 states and 96 transitions. Complement of second has 3 states. [2022-07-22 12:21:27,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 2 states 1 stem states 0 non-accepting loop states 1 accepting loop states [2022-07-22 12:21:27,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 1.0) internal successors, (2), 1 states have internal predecessors, (2), 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:21:27,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 2 transitions. [2022-07-22 12:21:27,478 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 2 transitions. Stem has 1 letters. Loop has 1 letters. [2022-07-22 12:21:27,478 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:21:27,478 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 2 transitions. Stem has 2 letters. Loop has 1 letters. [2022-07-22 12:21:27,479 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:21:27,479 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 2 transitions. Stem has 1 letters. Loop has 2 letters. [2022-07-22 12:21:27,479 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:21:27,480 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 44 states and 96 transitions. [2022-07-22 12:21:27,484 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 22 [2022-07-22 12:21:27,490 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 44 states to 38 states and 85 transitions. [2022-07-22 12:21:27,492 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 36 [2022-07-22 12:21:27,493 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 37 [2022-07-22 12:21:27,493 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 85 transitions. [2022-07-22 12:21:27,495 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 12:21:27,495 INFO L220 hiAutomatonCegarLoop]: Abstraction has 38 states and 85 transitions. [2022-07-22 12:21:27,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states and 85 transitions. [2022-07-22 12:21:27,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2022-07-22 12:21:27,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 38 states have (on average 2.236842105263158) internal successors, (85), 37 states have internal predecessors, (85), 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:21:27,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 85 transitions. [2022-07-22 12:21:27,534 INFO L242 hiAutomatonCegarLoop]: Abstraction has 38 states and 85 transitions. [2022-07-22 12:21:27,534 INFO L425 stractBuchiCegarLoop]: Abstraction has 38 states and 85 transitions. [2022-07-22 12:21:27,534 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-07-22 12:21:27,534 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 38 states and 85 transitions. [2022-07-22 12:21:27,536 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 22 [2022-07-22 12:21:27,536 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:21:27,536 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:21:27,537 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2022-07-22 12:21:27,537 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-22 12:21:27,538 INFO L748 eck$LassoCheckResult]: Stem: 412#[ULTIMATE.startENTRY]don't care [587] ULTIMATE.startENTRY-->L115-6: Formula: (let ((.cse2 (store |v_#valid_In_7| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6| 1))) (let ((.cse0 (select |v_#memory_int_In_5| 1)) (.cse1 (store .cse2 |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6| 1))) (and (= |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_Out_2| 0) (= (select .cse0 1) 0) (= |v_#length_Out_6| (store (store (store |v_#length_In_7| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6| 4) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_2| (* 4 |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2|))) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_Out_6| 0) (= (select |v_#length_In_7| 2) 25) (= 0 |v_#NULL.base_Out_2|) (< |v_#StackHeapBarrier_In_3| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6|) (= v_~element~0_Out_6 0) (= v_~queue~0.offset_Out_2 0) (= 48 (select .cse0 0)) (= v_~queue~0.base_Out_2 0) (= (select |v_#valid_In_7| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6|) 0) (= (store .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_2| 1) |v_#valid_Out_10|) (= (select |v_#valid_In_7| 0) 0) (= |v_#NULL.offset_Out_2| 0) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_6| (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2| 4294967296) 1073741823) 1 0)) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_2| |v_#StackHeapBarrier_In_3|) (< 0 |v_#StackHeapBarrier_In_3|) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2|) 1 0) 0)) (= (select |v_#valid_In_7| 2) 1) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_10| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_6|) (= (select |v_#valid_In_7| 1) 1) (= 0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_Out_2|) (= v_~back~0_Out_6 v_~front~0_Out_2) (= v_~n~0_Out_2 |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_2|) (= |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2| |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_2|) (= (select .cse2 |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6|) 0) (= 2 (select |v_#length_In_7| 1)) (= v_~sum~0_Out_2 0) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_2| 0)) (< |v_#StackHeapBarrier_In_3| |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6|) (= (select .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_2|) 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_Out_6| 0) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_10| 0))))) InVars {#memory_int=|v_#memory_int_In_5|, #StackHeapBarrier=|v_#StackHeapBarrier_In_3|, #length=|v_#length_In_7|, #valid=|v_#valid_In_7|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_Out_2|, ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_Out_2|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_Out_2|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_Out_6|, ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_Out_2|, #NULL.offset=|v_#NULL.offset_Out_2|, ULTIMATE.start_create_fresh_int_array_#t~malloc17#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc17#1.offset_Out_6|, ULTIMATE.start_create_fresh_int_array_#t~malloc17#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc17#1.base_Out_6|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_6|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_Out_6|, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_Out_2|, ~sum~0=v_~sum~0_Out_2, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_2|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_10|, ULTIMATE.start_create_fresh_int_array_#t~post18#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post18#1_Out_2|, #length=|v_#length_Out_6|, ~front~0=v_~front~0_Out_2, ULTIMATE.start_main_#t~ret10#1.base=|v_ULTIMATE.start_main_#t~ret10#1.base_Out_2|, ~queue~0.offset=v_~queue~0.offset_Out_2, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_2|, ULTIMATE.start_main_#t~ret10#1.offset=|v_ULTIMATE.start_main_#t~ret10#1.offset_Out_2|, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_Out_2|, ULTIMATE.start_main_#t~mem15#1=|v_ULTIMATE.start_main_#t~mem15#1_Out_2|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_Out_6|, ~back~0=v_~back~0_Out_6, ULTIMATE.start_main_#t~mem16#1=|v_ULTIMATE.start_main_#t~mem16#1_Out_6|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_Out_6|, ~queue~0.base=v_~queue~0.base_Out_2, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2|, #NULL.base=|v_#NULL.base_Out_2|, ULTIMATE.start_main_#t~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_Out_2|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_6|, #StackHeapBarrier=|v_#StackHeapBarrier_In_3|, ~element~0=v_~element~0_Out_6, ULTIMATE.start_create_fresh_int_array_#t~nondet19#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet19#1_Out_2|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_Out_2|, #valid=|v_#valid_Out_10|, #memory_int=|v_#memory_int_In_5|, ~n~0=v_~n~0_Out_2, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_Out_6|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_6|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_main_#t~pre13#1, ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_#t~nondet9#1, #NULL.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc17#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc17#1.base, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_#t~nondet12#1, ~sum~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_create_fresh_int_array_#t~post18#1, #length, ~front~0, ULTIMATE.start_main_#t~ret10#1.base, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_main_#t~ret10#1.offset, ULTIMATE.start_main_#t~pre11#1, ULTIMATE.start_main_#t~mem15#1, ULTIMATE.start_main_#res#1, ~back~0, ULTIMATE.start_main_#t~mem16#1, ULTIMATE.start_main_~#t1~0#1.base, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_~size#1, #NULL.base, ULTIMATE.start_main_#t~nondet14#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~element~0, ULTIMATE.start_create_fresh_int_array_#t~nondet19#1, ULTIMATE.start_main_#t~nondet8#1, #valid, ~n~0, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 396#[L115-6]don't care [563] L115-6-->L99-3: Formula: (and (= (select |v_#valid_154| |v_ULTIMATE.start_main_~#t1~0#1.base_43|) 1) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_36| |v_ULTIMATE.start_create_fresh_int_array_~size#1_48|)) (<= (+ 4 |v_ULTIMATE.start_main_~#t1~0#1.offset_35|) (select |v_#length_125| |v_ULTIMATE.start_main_~#t1~0#1.base_43|)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_18| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_27|) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_18| v_~queue~0.offset_58) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_35|) (= |v_ULTIMATE.start_main_#t~pre11#1_27| |v_#pthreadsForks_44|) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_18| v_~queue~0.base_58) (= |v_#pthreadsForks_43| (+ |v_#pthreadsForks_44| 1)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_18| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_27|) (= (store |v_#memory_int_113| |v_ULTIMATE.start_main_~#t1~0#1.base_43| (store (select |v_#memory_int_113| |v_ULTIMATE.start_main_~#t1~0#1.base_43|) |v_ULTIMATE.start_main_~#t1~0#1.offset_35| |v_ULTIMATE.start_main_#t~pre11#1_27|)) |v_#memory_int_112|)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_27|, #pthreadsForks=|v_#pthreadsForks_44|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_27|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_36|, #valid=|v_#valid_154|, #memory_int=|v_#memory_int_113|, #length=|v_#length_125|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_43|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_35|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_48|} OutVars{ULTIMATE.start_main_#t~ret10#1.base=|v_ULTIMATE.start_main_#t~ret10#1.base_23|, ~queue~0.offset=v_~queue~0.offset_58, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_27|, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_27|, ULTIMATE.start_main_#t~ret10#1.offset=|v_ULTIMATE.start_main_#t~ret10#1.offset_23|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_27|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_36|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_43|, ~queue~0.base=v_~queue~0.base_58, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_18|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_35|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_48|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_18|, #pthreadsForks=|v_#pthreadsForks_43|, #valid=|v_#valid_154|, #memory_int=|v_#memory_int_112|, #length=|v_#length_125|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret10#1.base, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_main_#t~pre11#1, ULTIMATE.start_main_#t~ret10#1.offset, #pthreadsForks, #memory_int, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#res#1.base] 398#[L99-3]don't care [435] L99-3-->thread1ENTRY: Formula: (and (= v_thread1Thread1of1ForFork1_thidvar0_2 |v_ULTIMATE.start_main_#t~pre11#1_6|) (= 0 v_thread1Thread1of1ForFork1_thidvar1_2)) InVars {ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_6|} OutVars{thread1Thread1of1ForFork1_#t~post2#1=|v_thread1Thread1of1ForFork1_#t~post2#1_8|, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_6|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_6|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_4|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_4|, thread1Thread1of1ForFork1_#t~mem1#1=|v_thread1Thread1of1ForFork1_#t~mem1#1_8|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_2, thread1Thread1of1ForFork1_~cond~0#1=|v_thread1Thread1of1ForFork1_~cond~0#1_10|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_10|, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#res#1.base, thread1Thread1of1ForFork1_#t~mem1#1, thread1Thread1of1ForFork1_thidvar1, thread1Thread1of1ForFork1_~cond~0#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_thidvar0] 414#[thread1ENTRY, L99-4]don't care [392] thread1ENTRY-->L57: Formula: (= (ite (= (ite (< v_~front~0_1 v_~back~0_1) 1 0) 0) 0 1) |v_thread1Thread1of1ForFork1_~cond~0#1_1|) InVars {~back~0=v_~back~0_1, ~front~0=v_~front~0_1} OutVars{~back~0=v_~back~0_1, thread1Thread1of1ForFork1_~cond~0#1=|v_thread1Thread1of1ForFork1_~cond~0#1_1|, ~front~0=v_~front~0_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_~cond~0#1] 406#[L57, L99-4]don't care [2022-07-22 12:21:27,538 INFO L750 eck$LassoCheckResult]: Loop: 406#[L57, L99-4]don't care [572] L57-->L53: Formula: (let ((.cse0 (* v_~front~0_In_1 4))) (let ((.cse1 (+ v_~queue~0.offset_In_1 .cse0))) (and (<= (+ v_~queue~0.offset_In_1 .cse0 4) (select |v_#length_In_3| v_~queue~0.base_In_1)) (not (= 0 (mod |v_thread1Thread1of1ForFork1_~cond~0#1_In_3| 256))) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_2| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_2|) (= (select (select |v_#memory_int_In_1| v_~queue~0.base_In_1) .cse1) v_~element~0_Out_2) (= (select |v_#valid_In_3| v_~queue~0.base_In_1) 1) (<= 0 .cse1) (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_2| (ite (and (< v_~front~0_In_1 v_~n~0_In_1) (<= 0 v_~front~0_In_1)) 1 0))))) InVars {~queue~0.offset=v_~queue~0.offset_In_1, #valid=|v_#valid_In_3|, #memory_int=|v_#memory_int_In_1|, #length=|v_#length_In_3|, ~queue~0.base=v_~queue~0.base_In_1, ~n~0=v_~n~0_In_1, thread1Thread1of1ForFork1_~cond~0#1=|v_thread1Thread1of1ForFork1_~cond~0#1_In_3|, ~front~0=v_~front~0_In_1} OutVars{~queue~0.offset=v_~queue~0.offset_In_1, ~queue~0.base=v_~queue~0.base_In_1, ~element~0=v_~element~0_Out_2, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_2|, #valid=|v_#valid_In_3|, #memory_int=|v_#memory_int_In_1|, #length=|v_#length_In_3|, thread1Thread1of1ForFork1_#t~mem1#1=|v_thread1Thread1of1ForFork1_#t~mem1#1_Out_2|, ~n~0=v_~n~0_In_1, thread1Thread1of1ForFork1_~cond~0#1=|v_thread1Thread1of1ForFork1_~cond~0#1_In_3|, ~front~0=v_~front~0_In_1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_2|} AuxVars[] AssignedVars[~element~0, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#t~mem1#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] 408#[L53, L99-4]don't care [541] L53-->L57: Formula: (and (= (+ v_~front~0_49 1) v_~front~0_48) (= (+ v_~element~0_16 v_~sum~0_18) v_~sum~0_17) (= (ite (= (ite (< v_~front~0_48 v_~back~0_90) 1 0) 0) 0 1) |v_thread1Thread1of1ForFork1_~cond~0#1_25|)) InVars {~sum~0=v_~sum~0_18, ~element~0=v_~element~0_16, ~back~0=v_~back~0_90, ~front~0=v_~front~0_49} OutVars{~sum~0=v_~sum~0_17, thread1Thread1of1ForFork1_#t~post2#1=|v_thread1Thread1of1ForFork1_#t~post2#1_15|, ~element~0=v_~element~0_16, ~back~0=v_~back~0_90, thread1Thread1of1ForFork1_~cond~0#1=|v_thread1Thread1of1ForFork1_~cond~0#1_25|, ~front~0=v_~front~0_48} AuxVars[] AssignedVars[~sum~0, thread1Thread1of1ForFork1_#t~post2#1, thread1Thread1of1ForFork1_~cond~0#1, ~front~0] 406#[L57, L99-4]don't care [2022-07-22 12:21:27,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:21:27,539 INFO L85 PathProgramCache]: Analyzing trace with hash 18965758, now seen corresponding path program 1 times [2022-07-22 12:21:27,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:21:27,540 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16689700] [2022-07-22 12:21:27,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:21:27,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:21:27,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:21:27,573 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:21:27,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:21:27,599 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:21:27,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:21:27,600 INFO L85 PathProgramCache]: Analyzing trace with hash 19234, now seen corresponding path program 1 times [2022-07-22 12:21:27,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:21:27,601 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647866476] [2022-07-22 12:21:27,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:21:27,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:21:27,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:21:27,613 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:21:27,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:21:27,626 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:21:27,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:21:27,627 INFO L85 PathProgramCache]: Analyzing trace with hash 1046242527, now seen corresponding path program 1 times [2022-07-22 12:21:27,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:21:27,628 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053108902] [2022-07-22 12:21:27,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:21:27,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:21:27,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:21:27,789 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:21:27,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 12:21:27,793 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053108902] [2022-07-22 12:21:27,794 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1053108902] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 12:21:27,794 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 12:21:27,795 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 12:21:27,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590451435] [2022-07-22 12:21:27,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 12:21:28,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 12:21:28,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 12:21:28,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 12:21:28,008 INFO L87 Difference]: Start difference. First operand 38 states and 85 transitions. cyclomatic complexity: 62 Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 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:21:28,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 12:21:28,105 INFO L93 Difference]: Finished difference Result 65 states and 130 transitions. [2022-07-22 12:21:28,106 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 65 states and 130 transitions. [2022-07-22 12:21:28,109 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 22 [2022-07-22 12:21:28,110 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 65 states to 38 states and 84 transitions. [2022-07-22 12:21:28,110 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 37 [2022-07-22 12:21:28,111 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 37 [2022-07-22 12:21:28,111 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 84 transitions. [2022-07-22 12:21:28,111 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 12:21:28,112 INFO L220 hiAutomatonCegarLoop]: Abstraction has 38 states and 84 transitions. [2022-07-22 12:21:28,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states and 84 transitions. [2022-07-22 12:21:28,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2022-07-22 12:21:28,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 38 states have (on average 2.210526315789474) internal successors, (84), 37 states have internal predecessors, (84), 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:21:28,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 84 transitions. [2022-07-22 12:21:28,117 INFO L242 hiAutomatonCegarLoop]: Abstraction has 38 states and 84 transitions. [2022-07-22 12:21:28,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 12:21:28,118 INFO L425 stractBuchiCegarLoop]: Abstraction has 38 states and 84 transitions. [2022-07-22 12:21:28,119 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-07-22 12:21:28,119 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 38 states and 84 transitions. [2022-07-22 12:21:28,120 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 22 [2022-07-22 12:21:28,120 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:21:28,120 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:21:28,121 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-07-22 12:21:28,121 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-22 12:21:28,122 INFO L748 eck$LassoCheckResult]: Stem: 564#[ULTIMATE.startENTRY]don't care [587] ULTIMATE.startENTRY-->L115-6: Formula: (let ((.cse2 (store |v_#valid_In_7| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6| 1))) (let ((.cse0 (select |v_#memory_int_In_5| 1)) (.cse1 (store .cse2 |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6| 1))) (and (= |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_Out_2| 0) (= (select .cse0 1) 0) (= |v_#length_Out_6| (store (store (store |v_#length_In_7| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6| 4) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_2| (* 4 |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2|))) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_Out_6| 0) (= (select |v_#length_In_7| 2) 25) (= 0 |v_#NULL.base_Out_2|) (< |v_#StackHeapBarrier_In_3| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6|) (= v_~element~0_Out_6 0) (= v_~queue~0.offset_Out_2 0) (= 48 (select .cse0 0)) (= v_~queue~0.base_Out_2 0) (= (select |v_#valid_In_7| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6|) 0) (= (store .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_2| 1) |v_#valid_Out_10|) (= (select |v_#valid_In_7| 0) 0) (= |v_#NULL.offset_Out_2| 0) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_6| (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2| 4294967296) 1073741823) 1 0)) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_2| |v_#StackHeapBarrier_In_3|) (< 0 |v_#StackHeapBarrier_In_3|) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2|) 1 0) 0)) (= (select |v_#valid_In_7| 2) 1) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_10| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_6|) (= (select |v_#valid_In_7| 1) 1) (= 0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_Out_2|) (= v_~back~0_Out_6 v_~front~0_Out_2) (= v_~n~0_Out_2 |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_2|) (= |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2| |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_2|) (= (select .cse2 |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6|) 0) (= 2 (select |v_#length_In_7| 1)) (= v_~sum~0_Out_2 0) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_2| 0)) (< |v_#StackHeapBarrier_In_3| |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6|) (= (select .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_2|) 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_Out_6| 0) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_10| 0))))) InVars {#memory_int=|v_#memory_int_In_5|, #StackHeapBarrier=|v_#StackHeapBarrier_In_3|, #length=|v_#length_In_7|, #valid=|v_#valid_In_7|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_Out_2|, ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_Out_2|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_Out_2|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_Out_6|, ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_Out_2|, #NULL.offset=|v_#NULL.offset_Out_2|, ULTIMATE.start_create_fresh_int_array_#t~malloc17#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc17#1.offset_Out_6|, ULTIMATE.start_create_fresh_int_array_#t~malloc17#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc17#1.base_Out_6|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_6|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_Out_6|, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_Out_2|, ~sum~0=v_~sum~0_Out_2, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_2|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_10|, ULTIMATE.start_create_fresh_int_array_#t~post18#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post18#1_Out_2|, #length=|v_#length_Out_6|, ~front~0=v_~front~0_Out_2, ULTIMATE.start_main_#t~ret10#1.base=|v_ULTIMATE.start_main_#t~ret10#1.base_Out_2|, ~queue~0.offset=v_~queue~0.offset_Out_2, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_2|, ULTIMATE.start_main_#t~ret10#1.offset=|v_ULTIMATE.start_main_#t~ret10#1.offset_Out_2|, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_Out_2|, ULTIMATE.start_main_#t~mem15#1=|v_ULTIMATE.start_main_#t~mem15#1_Out_2|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_Out_6|, ~back~0=v_~back~0_Out_6, ULTIMATE.start_main_#t~mem16#1=|v_ULTIMATE.start_main_#t~mem16#1_Out_6|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_Out_6|, ~queue~0.base=v_~queue~0.base_Out_2, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2|, #NULL.base=|v_#NULL.base_Out_2|, ULTIMATE.start_main_#t~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_Out_2|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_6|, #StackHeapBarrier=|v_#StackHeapBarrier_In_3|, ~element~0=v_~element~0_Out_6, ULTIMATE.start_create_fresh_int_array_#t~nondet19#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet19#1_Out_2|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_Out_2|, #valid=|v_#valid_Out_10|, #memory_int=|v_#memory_int_In_5|, ~n~0=v_~n~0_Out_2, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_Out_6|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_6|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_main_#t~pre13#1, ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_#t~nondet9#1, #NULL.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc17#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc17#1.base, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_#t~nondet12#1, ~sum~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_create_fresh_int_array_#t~post18#1, #length, ~front~0, ULTIMATE.start_main_#t~ret10#1.base, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_main_#t~ret10#1.offset, ULTIMATE.start_main_#t~pre11#1, ULTIMATE.start_main_#t~mem15#1, ULTIMATE.start_main_#res#1, ~back~0, ULTIMATE.start_main_#t~mem16#1, ULTIMATE.start_main_~#t1~0#1.base, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_~size#1, #NULL.base, ULTIMATE.start_main_#t~nondet14#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~element~0, ULTIMATE.start_create_fresh_int_array_#t~nondet19#1, ULTIMATE.start_main_#t~nondet8#1, #valid, ~n~0, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 548#[L115-6]don't care [554] L115-6-->L115-6: Formula: (let ((.cse0 (* |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_29| 4))) (let ((.cse1 (+ .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_21|))) (and (<= (+ .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_21| 4) (select |v_#length_121| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_21|)) (<= 0 .cse1) (= (+ |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_29| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_28|) (= (store |v_#memory_int_107| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_21| (store (select |v_#memory_int_107| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_21|) .cse1 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet19#1_13|)) |v_#memory_int_106|) (< |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_29| |v_ULTIMATE.start_create_fresh_int_array_~size#1_38|) (= (select |v_#valid_148| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_21|) 1)))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_21|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_21|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_29|, ULTIMATE.start_create_fresh_int_array_#t~nondet19#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet19#1_13|, #valid=|v_#valid_148|, #memory_int=|v_#memory_int_107|, #length=|v_#length_121|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_38|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_21|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_21|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_28|, #valid=|v_#valid_148|, ULTIMATE.start_create_fresh_int_array_#t~post18#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post18#1_13|, #memory_int=|v_#memory_int_106|, #length=|v_#length_121|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_38|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~nondet19#1, ULTIMATE.start_create_fresh_int_array_#t~post18#1, #memory_int] 550#[L115-6]don't care [563] L115-6-->L99-3: Formula: (and (= (select |v_#valid_154| |v_ULTIMATE.start_main_~#t1~0#1.base_43|) 1) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_36| |v_ULTIMATE.start_create_fresh_int_array_~size#1_48|)) (<= (+ 4 |v_ULTIMATE.start_main_~#t1~0#1.offset_35|) (select |v_#length_125| |v_ULTIMATE.start_main_~#t1~0#1.base_43|)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_18| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_27|) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_18| v_~queue~0.offset_58) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_35|) (= |v_ULTIMATE.start_main_#t~pre11#1_27| |v_#pthreadsForks_44|) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_18| v_~queue~0.base_58) (= |v_#pthreadsForks_43| (+ |v_#pthreadsForks_44| 1)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_18| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_27|) (= (store |v_#memory_int_113| |v_ULTIMATE.start_main_~#t1~0#1.base_43| (store (select |v_#memory_int_113| |v_ULTIMATE.start_main_~#t1~0#1.base_43|) |v_ULTIMATE.start_main_~#t1~0#1.offset_35| |v_ULTIMATE.start_main_#t~pre11#1_27|)) |v_#memory_int_112|)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_27|, #pthreadsForks=|v_#pthreadsForks_44|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_27|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_36|, #valid=|v_#valid_154|, #memory_int=|v_#memory_int_113|, #length=|v_#length_125|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_43|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_35|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_48|} OutVars{ULTIMATE.start_main_#t~ret10#1.base=|v_ULTIMATE.start_main_#t~ret10#1.base_23|, ~queue~0.offset=v_~queue~0.offset_58, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_27|, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_27|, ULTIMATE.start_main_#t~ret10#1.offset=|v_ULTIMATE.start_main_#t~ret10#1.offset_23|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_27|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_36|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_43|, ~queue~0.base=v_~queue~0.base_58, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_18|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_35|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_48|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_18|, #pthreadsForks=|v_#pthreadsForks_43|, #valid=|v_#valid_154|, #memory_int=|v_#memory_int_112|, #length=|v_#length_125|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret10#1.base, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_main_#t~pre11#1, ULTIMATE.start_main_#t~ret10#1.offset, #pthreadsForks, #memory_int, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#res#1.base] 552#[L99-3]don't care [435] L99-3-->thread1ENTRY: Formula: (and (= v_thread1Thread1of1ForFork1_thidvar0_2 |v_ULTIMATE.start_main_#t~pre11#1_6|) (= 0 v_thread1Thread1of1ForFork1_thidvar1_2)) InVars {ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_6|} OutVars{thread1Thread1of1ForFork1_#t~post2#1=|v_thread1Thread1of1ForFork1_#t~post2#1_8|, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_6|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_6|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_4|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_4|, thread1Thread1of1ForFork1_#t~mem1#1=|v_thread1Thread1of1ForFork1_#t~mem1#1_8|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_2, thread1Thread1of1ForFork1_~cond~0#1=|v_thread1Thread1of1ForFork1_~cond~0#1_10|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_10|, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#res#1.base, thread1Thread1of1ForFork1_#t~mem1#1, thread1Thread1of1ForFork1_thidvar1, thread1Thread1of1ForFork1_~cond~0#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_thidvar0] 566#[thread1ENTRY, L99-4]don't care [392] thread1ENTRY-->L57: Formula: (= (ite (= (ite (< v_~front~0_1 v_~back~0_1) 1 0) 0) 0 1) |v_thread1Thread1of1ForFork1_~cond~0#1_1|) InVars {~back~0=v_~back~0_1, ~front~0=v_~front~0_1} OutVars{~back~0=v_~back~0_1, thread1Thread1of1ForFork1_~cond~0#1=|v_thread1Thread1of1ForFork1_~cond~0#1_1|, ~front~0=v_~front~0_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_~cond~0#1] 558#[L57, L99-4]don't care [2022-07-22 12:21:28,122 INFO L750 eck$LassoCheckResult]: Loop: 558#[L57, L99-4]don't care [572] L57-->L53: Formula: (let ((.cse0 (* v_~front~0_In_1 4))) (let ((.cse1 (+ v_~queue~0.offset_In_1 .cse0))) (and (<= (+ v_~queue~0.offset_In_1 .cse0 4) (select |v_#length_In_3| v_~queue~0.base_In_1)) (not (= 0 (mod |v_thread1Thread1of1ForFork1_~cond~0#1_In_3| 256))) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_2| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_2|) (= (select (select |v_#memory_int_In_1| v_~queue~0.base_In_1) .cse1) v_~element~0_Out_2) (= (select |v_#valid_In_3| v_~queue~0.base_In_1) 1) (<= 0 .cse1) (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_2| (ite (and (< v_~front~0_In_1 v_~n~0_In_1) (<= 0 v_~front~0_In_1)) 1 0))))) InVars {~queue~0.offset=v_~queue~0.offset_In_1, #valid=|v_#valid_In_3|, #memory_int=|v_#memory_int_In_1|, #length=|v_#length_In_3|, ~queue~0.base=v_~queue~0.base_In_1, ~n~0=v_~n~0_In_1, thread1Thread1of1ForFork1_~cond~0#1=|v_thread1Thread1of1ForFork1_~cond~0#1_In_3|, ~front~0=v_~front~0_In_1} OutVars{~queue~0.offset=v_~queue~0.offset_In_1, ~queue~0.base=v_~queue~0.base_In_1, ~element~0=v_~element~0_Out_2, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_2|, #valid=|v_#valid_In_3|, #memory_int=|v_#memory_int_In_1|, #length=|v_#length_In_3|, thread1Thread1of1ForFork1_#t~mem1#1=|v_thread1Thread1of1ForFork1_#t~mem1#1_Out_2|, ~n~0=v_~n~0_In_1, thread1Thread1of1ForFork1_~cond~0#1=|v_thread1Thread1of1ForFork1_~cond~0#1_In_3|, ~front~0=v_~front~0_In_1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_2|} AuxVars[] AssignedVars[~element~0, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#t~mem1#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] 560#[L53, L99-4]don't care [541] L53-->L57: Formula: (and (= (+ v_~front~0_49 1) v_~front~0_48) (= (+ v_~element~0_16 v_~sum~0_18) v_~sum~0_17) (= (ite (= (ite (< v_~front~0_48 v_~back~0_90) 1 0) 0) 0 1) |v_thread1Thread1of1ForFork1_~cond~0#1_25|)) InVars {~sum~0=v_~sum~0_18, ~element~0=v_~element~0_16, ~back~0=v_~back~0_90, ~front~0=v_~front~0_49} OutVars{~sum~0=v_~sum~0_17, thread1Thread1of1ForFork1_#t~post2#1=|v_thread1Thread1of1ForFork1_#t~post2#1_15|, ~element~0=v_~element~0_16, ~back~0=v_~back~0_90, thread1Thread1of1ForFork1_~cond~0#1=|v_thread1Thread1of1ForFork1_~cond~0#1_25|, ~front~0=v_~front~0_48} AuxVars[] AssignedVars[~sum~0, thread1Thread1of1ForFork1_#t~post2#1, thread1Thread1of1ForFork1_~cond~0#1, ~front~0] 558#[L57, L99-4]don't care [2022-07-22 12:21:28,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:21:28,123 INFO L85 PathProgramCache]: Analyzing trace with hash 587795112, now seen corresponding path program 1 times [2022-07-22 12:21:28,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:21:28,123 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873283141] [2022-07-22 12:21:28,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:21:28,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:21:28,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:21:28,157 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:21:28,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:21:28,182 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:21:28,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:21:28,183 INFO L85 PathProgramCache]: Analyzing trace with hash 19234, now seen corresponding path program 2 times [2022-07-22 12:21:28,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:21:28,183 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634529178] [2022-07-22 12:21:28,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:21:28,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:21:28,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:21:28,193 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:21:28,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:21:28,207 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:21:28,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:21:28,211 INFO L85 PathProgramCache]: Analyzing trace with hash -2064562167, now seen corresponding path program 1 times [2022-07-22 12:21:28,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:21:28,212 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077959512] [2022-07-22 12:21:28,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:21:28,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:21:28,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:21:28,311 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-22 12:21:28,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 12:21:28,312 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077959512] [2022-07-22 12:21:28,312 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2077959512] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 12:21:28,312 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 12:21:28,312 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 12:21:28,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658605508] [2022-07-22 12:21:28,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 12:21:28,456 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2022-07-22 12:21:28,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 12:21:28,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 12:21:28,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 12:21:28,501 INFO L87 Difference]: Start difference. First operand 38 states and 84 transitions. cyclomatic complexity: 61 Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:21:28,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 12:21:28,582 INFO L93 Difference]: Finished difference Result 46 states and 96 transitions. [2022-07-22 12:21:28,582 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 96 transitions. [2022-07-22 12:21:28,584 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 14 [2022-07-22 12:21:28,586 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 42 states and 88 transitions. [2022-07-22 12:21:28,586 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 41 [2022-07-22 12:21:28,586 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 41 [2022-07-22 12:21:28,586 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 88 transitions. [2022-07-22 12:21:28,587 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 12:21:28,587 INFO L220 hiAutomatonCegarLoop]: Abstraction has 42 states and 88 transitions. [2022-07-22 12:21:28,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 88 transitions. [2022-07-22 12:21:28,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 38. [2022-07-22 12:21:28,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 38 states have (on average 2.1315789473684212) internal successors, (81), 37 states have internal predecessors, (81), 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:21:28,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 81 transitions. [2022-07-22 12:21:28,593 INFO L242 hiAutomatonCegarLoop]: Abstraction has 38 states and 81 transitions. [2022-07-22 12:21:28,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 12:21:28,594 INFO L425 stractBuchiCegarLoop]: Abstraction has 38 states and 81 transitions. [2022-07-22 12:21:28,594 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2022-07-22 12:21:28,594 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 38 states and 81 transitions. [2022-07-22 12:21:28,595 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 14 [2022-07-22 12:21:28,596 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:21:28,596 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:21:28,596 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 12:21:28,596 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-22 12:21:28,598 INFO L748 eck$LassoCheckResult]: Stem: 695#[ULTIMATE.startENTRY]don't care [587] ULTIMATE.startENTRY-->L115-6: Formula: (let ((.cse2 (store |v_#valid_In_7| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6| 1))) (let ((.cse0 (select |v_#memory_int_In_5| 1)) (.cse1 (store .cse2 |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6| 1))) (and (= |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_Out_2| 0) (= (select .cse0 1) 0) (= |v_#length_Out_6| (store (store (store |v_#length_In_7| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6| 4) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_2| (* 4 |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2|))) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_Out_6| 0) (= (select |v_#length_In_7| 2) 25) (= 0 |v_#NULL.base_Out_2|) (< |v_#StackHeapBarrier_In_3| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6|) (= v_~element~0_Out_6 0) (= v_~queue~0.offset_Out_2 0) (= 48 (select .cse0 0)) (= v_~queue~0.base_Out_2 0) (= (select |v_#valid_In_7| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6|) 0) (= (store .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_2| 1) |v_#valid_Out_10|) (= (select |v_#valid_In_7| 0) 0) (= |v_#NULL.offset_Out_2| 0) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_6| (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2| 4294967296) 1073741823) 1 0)) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_2| |v_#StackHeapBarrier_In_3|) (< 0 |v_#StackHeapBarrier_In_3|) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2|) 1 0) 0)) (= (select |v_#valid_In_7| 2) 1) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_10| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_6|) (= (select |v_#valid_In_7| 1) 1) (= 0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_Out_2|) (= v_~back~0_Out_6 v_~front~0_Out_2) (= v_~n~0_Out_2 |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_2|) (= |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2| |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_2|) (= (select .cse2 |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6|) 0) (= 2 (select |v_#length_In_7| 1)) (= v_~sum~0_Out_2 0) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_2| 0)) (< |v_#StackHeapBarrier_In_3| |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6|) (= (select .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_2|) 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_Out_6| 0) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_10| 0))))) InVars {#memory_int=|v_#memory_int_In_5|, #StackHeapBarrier=|v_#StackHeapBarrier_In_3|, #length=|v_#length_In_7|, #valid=|v_#valid_In_7|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_Out_2|, ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_Out_2|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_Out_2|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_Out_6|, ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_Out_2|, #NULL.offset=|v_#NULL.offset_Out_2|, ULTIMATE.start_create_fresh_int_array_#t~malloc17#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc17#1.offset_Out_6|, ULTIMATE.start_create_fresh_int_array_#t~malloc17#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc17#1.base_Out_6|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_6|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_Out_6|, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_Out_2|, ~sum~0=v_~sum~0_Out_2, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_2|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_10|, ULTIMATE.start_create_fresh_int_array_#t~post18#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post18#1_Out_2|, #length=|v_#length_Out_6|, ~front~0=v_~front~0_Out_2, ULTIMATE.start_main_#t~ret10#1.base=|v_ULTIMATE.start_main_#t~ret10#1.base_Out_2|, ~queue~0.offset=v_~queue~0.offset_Out_2, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_2|, ULTIMATE.start_main_#t~ret10#1.offset=|v_ULTIMATE.start_main_#t~ret10#1.offset_Out_2|, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_Out_2|, ULTIMATE.start_main_#t~mem15#1=|v_ULTIMATE.start_main_#t~mem15#1_Out_2|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_Out_6|, ~back~0=v_~back~0_Out_6, ULTIMATE.start_main_#t~mem16#1=|v_ULTIMATE.start_main_#t~mem16#1_Out_6|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_Out_6|, ~queue~0.base=v_~queue~0.base_Out_2, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2|, #NULL.base=|v_#NULL.base_Out_2|, ULTIMATE.start_main_#t~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_Out_2|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_6|, #StackHeapBarrier=|v_#StackHeapBarrier_In_3|, ~element~0=v_~element~0_Out_6, ULTIMATE.start_create_fresh_int_array_#t~nondet19#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet19#1_Out_2|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_Out_2|, #valid=|v_#valid_Out_10|, #memory_int=|v_#memory_int_In_5|, ~n~0=v_~n~0_Out_2, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_Out_6|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_6|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_main_#t~pre13#1, ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_#t~nondet9#1, #NULL.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc17#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc17#1.base, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_#t~nondet12#1, ~sum~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_create_fresh_int_array_#t~post18#1, #length, ~front~0, ULTIMATE.start_main_#t~ret10#1.base, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_main_#t~ret10#1.offset, ULTIMATE.start_main_#t~pre11#1, ULTIMATE.start_main_#t~mem15#1, ULTIMATE.start_main_#res#1, ~back~0, ULTIMATE.start_main_#t~mem16#1, ULTIMATE.start_main_~#t1~0#1.base, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_~size#1, #NULL.base, ULTIMATE.start_main_#t~nondet14#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~element~0, ULTIMATE.start_create_fresh_int_array_#t~nondet19#1, ULTIMATE.start_main_#t~nondet8#1, #valid, ~n~0, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 675#[L115-6]don't care [554] L115-6-->L115-6: Formula: (let ((.cse0 (* |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_29| 4))) (let ((.cse1 (+ .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_21|))) (and (<= (+ .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_21| 4) (select |v_#length_121| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_21|)) (<= 0 .cse1) (= (+ |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_29| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_28|) (= (store |v_#memory_int_107| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_21| (store (select |v_#memory_int_107| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_21|) .cse1 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet19#1_13|)) |v_#memory_int_106|) (< |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_29| |v_ULTIMATE.start_create_fresh_int_array_~size#1_38|) (= (select |v_#valid_148| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_21|) 1)))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_21|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_21|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_29|, ULTIMATE.start_create_fresh_int_array_#t~nondet19#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet19#1_13|, #valid=|v_#valid_148|, #memory_int=|v_#memory_int_107|, #length=|v_#length_121|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_38|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_21|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_21|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_28|, #valid=|v_#valid_148|, ULTIMATE.start_create_fresh_int_array_#t~post18#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post18#1_13|, #memory_int=|v_#memory_int_106|, #length=|v_#length_121|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_38|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~nondet19#1, ULTIMATE.start_create_fresh_int_array_#t~post18#1, #memory_int] 677#[L115-6]don't care [563] L115-6-->L99-3: Formula: (and (= (select |v_#valid_154| |v_ULTIMATE.start_main_~#t1~0#1.base_43|) 1) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_36| |v_ULTIMATE.start_create_fresh_int_array_~size#1_48|)) (<= (+ 4 |v_ULTIMATE.start_main_~#t1~0#1.offset_35|) (select |v_#length_125| |v_ULTIMATE.start_main_~#t1~0#1.base_43|)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_18| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_27|) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_18| v_~queue~0.offset_58) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_35|) (= |v_ULTIMATE.start_main_#t~pre11#1_27| |v_#pthreadsForks_44|) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_18| v_~queue~0.base_58) (= |v_#pthreadsForks_43| (+ |v_#pthreadsForks_44| 1)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_18| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_27|) (= (store |v_#memory_int_113| |v_ULTIMATE.start_main_~#t1~0#1.base_43| (store (select |v_#memory_int_113| |v_ULTIMATE.start_main_~#t1~0#1.base_43|) |v_ULTIMATE.start_main_~#t1~0#1.offset_35| |v_ULTIMATE.start_main_#t~pre11#1_27|)) |v_#memory_int_112|)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_27|, #pthreadsForks=|v_#pthreadsForks_44|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_27|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_36|, #valid=|v_#valid_154|, #memory_int=|v_#memory_int_113|, #length=|v_#length_125|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_43|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_35|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_48|} OutVars{ULTIMATE.start_main_#t~ret10#1.base=|v_ULTIMATE.start_main_#t~ret10#1.base_23|, ~queue~0.offset=v_~queue~0.offset_58, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_27|, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_27|, ULTIMATE.start_main_#t~ret10#1.offset=|v_ULTIMATE.start_main_#t~ret10#1.offset_23|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_27|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_36|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_43|, ~queue~0.base=v_~queue~0.base_58, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_18|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_35|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_48|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_18|, #pthreadsForks=|v_#pthreadsForks_43|, #valid=|v_#valid_154|, #memory_int=|v_#memory_int_112|, #length=|v_#length_125|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret10#1.base, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_main_#t~pre11#1, ULTIMATE.start_main_#t~ret10#1.offset, #pthreadsForks, #memory_int, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#res#1.base] 679#[L99-3]don't care [435] L99-3-->thread1ENTRY: Formula: (and (= v_thread1Thread1of1ForFork1_thidvar0_2 |v_ULTIMATE.start_main_#t~pre11#1_6|) (= 0 v_thread1Thread1of1ForFork1_thidvar1_2)) InVars {ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_6|} OutVars{thread1Thread1of1ForFork1_#t~post2#1=|v_thread1Thread1of1ForFork1_#t~post2#1_8|, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_6|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_6|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_4|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_4|, thread1Thread1of1ForFork1_#t~mem1#1=|v_thread1Thread1of1ForFork1_#t~mem1#1_8|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_2, thread1Thread1of1ForFork1_~cond~0#1=|v_thread1Thread1of1ForFork1_~cond~0#1_10|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_10|, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#res#1.base, thread1Thread1of1ForFork1_#t~mem1#1, thread1Thread1of1ForFork1_thidvar1, thread1Thread1of1ForFork1_~cond~0#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_thidvar0] 697#[thread1ENTRY, L99-4]don't care [537] L99-4-->L100-3: Formula: (and (<= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_27|) (<= (+ |v_ULTIMATE.start_main_~#t2~0#1.offset_27| 4) (select |v_#length_91| |v_ULTIMATE.start_main_~#t2~0#1.base_29|)) (= (select |v_#valid_110| |v_ULTIMATE.start_main_~#t2~0#1.base_29|) 1) (= (store |v_#memory_int_83| |v_ULTIMATE.start_main_~#t2~0#1.base_29| (store (select |v_#memory_int_83| |v_ULTIMATE.start_main_~#t2~0#1.base_29|) |v_ULTIMATE.start_main_~#t2~0#1.offset_27| |v_ULTIMATE.start_main_#t~pre13#1_21|)) |v_#memory_int_82|) (= (+ |v_#pthreadsForks_28| 1) |v_#pthreadsForks_27|) (= |v_ULTIMATE.start_main_#t~pre13#1_21| |v_#pthreadsForks_28|)) InVars {#pthreadsForks=|v_#pthreadsForks_28|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_27|, #valid=|v_#valid_110|, #memory_int=|v_#memory_int_83|, #length=|v_#length_91|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_29|} OutVars{ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_21|, #pthreadsForks=|v_#pthreadsForks_27|, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_21|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_27|, #valid=|v_#valid_110|, #memory_int=|v_#memory_int_82|, #length=|v_#length_91|, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_11|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_29|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre13#1, #pthreadsForks, ULTIMATE.start_main_#t~pre11#1, #memory_int, ULTIMATE.start_main_#t~nondet12#1] 637#[L100-3, thread1ENTRY]don't care [432] L100-3-->thread2ENTRY: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar0_2 |v_ULTIMATE.start_main_#t~pre13#1_6|) (= v_thread2Thread1of1ForFork0_thidvar2_2 0) (= v_thread2Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_6|} OutVars{ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_6|, thread2Thread1of1ForFork0_~flag~0#1=|v_thread2Thread1of1ForFork0_~flag~0#1_12|, 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_8|, thread2Thread1of1ForFork0_#t~mem6#1=|v_thread2Thread1of1ForFork0_#t~mem6#1_4|, thread2Thread1of1ForFork0_#t~post7#1=|v_thread2Thread1of1ForFork0_#t~post7#1_4|, thread2Thread1of1ForFork0_#t~nondet3#1=|v_thread2Thread1of1ForFork0_#t~nondet3#1_10|, thread2Thread1of1ForFork0_#t~post5#1=|v_thread2Thread1of1ForFork0_#t~post5#1_4|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_8|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_4|, thread2Thread1of1ForFork0_#t~mem4#1=|v_thread2Thread1of1ForFork0_#t~mem4#1_4|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_2, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_2, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~flag~0#1, thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~mem6#1, thread2Thread1of1ForFork0_#t~post7#1, thread2Thread1of1ForFork0_#t~nondet3#1, thread2Thread1of1ForFork0_#t~post5#1, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_#t~mem4#1, thread2Thread1of1ForFork0_thidvar2, thread2Thread1of1ForFork0_thidvar1, thread2Thread1of1ForFork0_thidvar0] 639#[thread2ENTRY, L100-4, thread1ENTRY]don't care [414] thread2ENTRY-->L65-4: Formula: (= |v_thread2Thread1of1ForFork0_~flag~0#1_1| 1) InVars {} OutVars{thread2Thread1of1ForFork0_~flag~0#1=|v_thread2Thread1of1ForFork0_~flag~0#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~flag~0#1] 653#[L65-4, L100-4, thread1ENTRY]don't care [573] L65-4-->L65-4: Formula: (let ((.cse11 (* v_~back~0_In_1 4))) (let ((.cse2 (= (mod |v_thread2Thread1of1ForFork0_~flag~0#1_In_1| 256) 0)) (.cse12 (+ .cse11 v_~queue~0.offset_In_3))) (let ((.cse0 (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|)) (.cse1 (<= 0 .cse12)) (.cse3 (select (select |v_#memory_int_In_3| v_~queue~0.base_In_3) .cse12)) (.cse4 (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| 0))) (.cse5 (= (+ v_~back~0_In_1 1) v_~back~0_Out_2)) (.cse6 (= (select |v_#valid_In_5| v_~queue~0.base_In_3) 1)) (.cse7 (not (= (mod |v_thread2Thread1of1ForFork0_#t~nondet3#1_In_3| 256) 0))) (.cse8 (<= (+ .cse11 v_~queue~0.offset_In_3 4) (select |v_#length_In_5| v_~queue~0.base_In_3))) (.cse9 (= (ite (= (ite .cse2 1 0) 0) 0 1) |v_thread2Thread1of1ForFork0_~flag~0#1_Out_2|)) (.cse10 (not (= (ite (and (<= 0 v_~back~0_In_1) (< v_~back~0_In_1 v_~n~0_In_3)) 1 0) 0)))) (or (and .cse0 .cse1 (not .cse2) (= |v_thread2Thread1of1ForFork0_#t~post7#1_In_1| |v_thread2Thread1of1ForFork0_#t~post7#1_Out_2|) (= (ite (= .cse3 1) 1 0) |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) .cse4 (= |v_thread2Thread1of1ForFork0_#t~mem6#1_Out_2| |v_thread2Thread1of1ForFork0_#t~mem6#1_In_1|) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse2 .cse1 (= (ite (= (- 1) .cse3) 1 0) |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (= |v_thread2Thread1of1ForFork0_#t~mem4#1_In_1| |v_thread2Thread1of1ForFork0_#t~mem4#1_Out_2|) .cse4 .cse5 (= |v_thread2Thread1of1ForFork0_#t~post5#1_Out_2| |v_thread2Thread1of1ForFork0_#t~post5#1_In_1|) .cse6 .cse7 .cse8 .cse9 .cse10))))) InVars {~queue~0.offset=v_~queue~0.offset_In_3, thread2Thread1of1ForFork0_~flag~0#1=|v_thread2Thread1of1ForFork0_~flag~0#1_In_1|, ~back~0=v_~back~0_In_1, thread2Thread1of1ForFork0_#t~mem6#1=|v_thread2Thread1of1ForFork0_#t~mem6#1_In_1|, ~queue~0.base=v_~queue~0.base_In_3, thread2Thread1of1ForFork0_#t~post7#1=|v_thread2Thread1of1ForFork0_#t~post7#1_In_1|, thread2Thread1of1ForFork0_#t~nondet3#1=|v_thread2Thread1of1ForFork0_#t~nondet3#1_In_3|, thread2Thread1of1ForFork0_#t~post5#1=|v_thread2Thread1of1ForFork0_#t~post5#1_In_1|, thread2Thread1of1ForFork0_#t~mem4#1=|v_thread2Thread1of1ForFork0_#t~mem4#1_In_1|, #valid=|v_#valid_In_5|, #memory_int=|v_#memory_int_In_3|, #length=|v_#length_In_5|, ~n~0=v_~n~0_In_3} OutVars{~queue~0.offset=v_~queue~0.offset_In_3, thread2Thread1of1ForFork0_~flag~0#1=|v_thread2Thread1of1ForFork0_~flag~0#1_Out_2|, ~back~0=v_~back~0_Out_2, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|, thread2Thread1of1ForFork0_#t~mem6#1=|v_thread2Thread1of1ForFork0_#t~mem6#1_Out_2|, thread2Thread1of1ForFork0_#t~post7#1=|v_thread2Thread1of1ForFork0_#t~post7#1_Out_2|, ~queue~0.base=v_~queue~0.base_In_3, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2|, thread2Thread1of1ForFork0_#t~post5#1=|v_thread2Thread1of1ForFork0_#t~post5#1_Out_2|, thread2Thread1of1ForFork0_#t~mem4#1=|v_thread2Thread1of1ForFork0_#t~mem4#1_Out_2|, #valid=|v_#valid_In_5|, #memory_int=|v_#memory_int_In_3|, #length=|v_#length_In_5|, ~n~0=v_~n~0_In_3} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#t~post5#1, thread2Thread1of1ForFork0_~flag~0#1, thread2Thread1of1ForFork0_#t~mem4#1, ~back~0, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~mem6#1, thread2Thread1of1ForFork0_#t~post7#1, thread2Thread1of1ForFork0_#t~nondet3#1] 705#[L65-4, L100-4, thread1ENTRY]don't care [2022-07-22 12:21:28,598 INFO L750 eck$LassoCheckResult]: Loop: 705#[L65-4, L100-4, thread1ENTRY]don't care [573] L65-4-->L65-4: Formula: (let ((.cse11 (* v_~back~0_In_1 4))) (let ((.cse2 (= (mod |v_thread2Thread1of1ForFork0_~flag~0#1_In_1| 256) 0)) (.cse12 (+ .cse11 v_~queue~0.offset_In_3))) (let ((.cse0 (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|)) (.cse1 (<= 0 .cse12)) (.cse3 (select (select |v_#memory_int_In_3| v_~queue~0.base_In_3) .cse12)) (.cse4 (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| 0))) (.cse5 (= (+ v_~back~0_In_1 1) v_~back~0_Out_2)) (.cse6 (= (select |v_#valid_In_5| v_~queue~0.base_In_3) 1)) (.cse7 (not (= (mod |v_thread2Thread1of1ForFork0_#t~nondet3#1_In_3| 256) 0))) (.cse8 (<= (+ .cse11 v_~queue~0.offset_In_3 4) (select |v_#length_In_5| v_~queue~0.base_In_3))) (.cse9 (= (ite (= (ite .cse2 1 0) 0) 0 1) |v_thread2Thread1of1ForFork0_~flag~0#1_Out_2|)) (.cse10 (not (= (ite (and (<= 0 v_~back~0_In_1) (< v_~back~0_In_1 v_~n~0_In_3)) 1 0) 0)))) (or (and .cse0 .cse1 (not .cse2) (= |v_thread2Thread1of1ForFork0_#t~post7#1_In_1| |v_thread2Thread1of1ForFork0_#t~post7#1_Out_2|) (= (ite (= .cse3 1) 1 0) |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) .cse4 (= |v_thread2Thread1of1ForFork0_#t~mem6#1_Out_2| |v_thread2Thread1of1ForFork0_#t~mem6#1_In_1|) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse2 .cse1 (= (ite (= (- 1) .cse3) 1 0) |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (= |v_thread2Thread1of1ForFork0_#t~mem4#1_In_1| |v_thread2Thread1of1ForFork0_#t~mem4#1_Out_2|) .cse4 .cse5 (= |v_thread2Thread1of1ForFork0_#t~post5#1_Out_2| |v_thread2Thread1of1ForFork0_#t~post5#1_In_1|) .cse6 .cse7 .cse8 .cse9 .cse10))))) InVars {~queue~0.offset=v_~queue~0.offset_In_3, thread2Thread1of1ForFork0_~flag~0#1=|v_thread2Thread1of1ForFork0_~flag~0#1_In_1|, ~back~0=v_~back~0_In_1, thread2Thread1of1ForFork0_#t~mem6#1=|v_thread2Thread1of1ForFork0_#t~mem6#1_In_1|, ~queue~0.base=v_~queue~0.base_In_3, thread2Thread1of1ForFork0_#t~post7#1=|v_thread2Thread1of1ForFork0_#t~post7#1_In_1|, thread2Thread1of1ForFork0_#t~nondet3#1=|v_thread2Thread1of1ForFork0_#t~nondet3#1_In_3|, thread2Thread1of1ForFork0_#t~post5#1=|v_thread2Thread1of1ForFork0_#t~post5#1_In_1|, thread2Thread1of1ForFork0_#t~mem4#1=|v_thread2Thread1of1ForFork0_#t~mem4#1_In_1|, #valid=|v_#valid_In_5|, #memory_int=|v_#memory_int_In_3|, #length=|v_#length_In_5|, ~n~0=v_~n~0_In_3} OutVars{~queue~0.offset=v_~queue~0.offset_In_3, thread2Thread1of1ForFork0_~flag~0#1=|v_thread2Thread1of1ForFork0_~flag~0#1_Out_2|, ~back~0=v_~back~0_Out_2, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|, thread2Thread1of1ForFork0_#t~mem6#1=|v_thread2Thread1of1ForFork0_#t~mem6#1_Out_2|, thread2Thread1of1ForFork0_#t~post7#1=|v_thread2Thread1of1ForFork0_#t~post7#1_Out_2|, ~queue~0.base=v_~queue~0.base_In_3, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2|, thread2Thread1of1ForFork0_#t~post5#1=|v_thread2Thread1of1ForFork0_#t~post5#1_Out_2|, thread2Thread1of1ForFork0_#t~mem4#1=|v_thread2Thread1of1ForFork0_#t~mem4#1_Out_2|, #valid=|v_#valid_In_5|, #memory_int=|v_#memory_int_In_3|, #length=|v_#length_In_5|, ~n~0=v_~n~0_In_3} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#t~post5#1, thread2Thread1of1ForFork0_~flag~0#1, thread2Thread1of1ForFork0_#t~mem4#1, ~back~0, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~mem6#1, thread2Thread1of1ForFork0_#t~post7#1, thread2Thread1of1ForFork0_#t~nondet3#1] 705#[L65-4, L100-4, thread1ENTRY]don't care [2022-07-22 12:21:28,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:21:28,599 INFO L85 PathProgramCache]: Analyzing trace with hash 427264054, now seen corresponding path program 1 times [2022-07-22 12:21:28,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:21:28,599 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881162992] [2022-07-22 12:21:28,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:21:28,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:21:28,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:21:28,655 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:21:28,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:21:28,765 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:21:28,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:21:28,766 INFO L85 PathProgramCache]: Analyzing trace with hash 604, now seen corresponding path program 1 times [2022-07-22 12:21:28,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:21:28,766 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047636058] [2022-07-22 12:21:28,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:21:28,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:21:28,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:21:28,784 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:21:28,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:21:28,794 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:21:28,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:21:28,795 INFO L85 PathProgramCache]: Analyzing trace with hash 360284359, now seen corresponding path program 2 times [2022-07-22 12:21:28,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:21:28,796 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101616047] [2022-07-22 12:21:28,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:21:28,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:21:28,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:21:28,911 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 12:21:28,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 12:21:28,912 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101616047] [2022-07-22 12:21:28,912 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2101616047] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 12:21:28,912 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [80276353] [2022-07-22 12:21:28,912 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-22 12:21:28,913 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 12:21:28,913 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:21:28,916 INFO L229 MonitoredProcess]: Starting monitored process 24 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:21:28,941 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-07-22 12:21:29,011 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-22 12:21:29,011 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 12:21:29,013 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 16 conjunts are in the unsatisfiable core [2022-07-22 12:21:29,017 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:21:29,095 INFO L356 Elim1Store]: treesize reduction 33, result has 40.0 percent of original size [2022-07-22 12:21:29,098 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 27 [2022-07-22 12:21:29,364 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 12:21:29,364 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 12:21:29,830 INFO L356 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-07-22 12:21:29,833 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 315 treesize of output 267 [2022-07-22 12:21:29,845 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 267 treesize of output 259 [2022-07-22 12:21:30,207 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 12:21:30,207 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [80276353] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 12:21:30,207 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 12:21:30,207 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 4] total 14 [2022-07-22 12:21:30,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631531] [2022-07-22 12:21:30,208 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 12:21:30,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 12:21:30,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-07-22 12:21:30,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2022-07-22 12:21:30,603 INFO L87 Difference]: Start difference. First operand 38 states and 81 transitions. cyclomatic complexity: 54 Second operand has 16 states, 15 states have (on average 1.8) internal successors, (27), 15 states have internal predecessors, (27), 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:21:31,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 12:21:31,133 INFO L93 Difference]: Finished difference Result 78 states and 157 transitions. [2022-07-22 12:21:31,133 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 78 states and 157 transitions. [2022-07-22 12:21:31,135 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 22 [2022-07-22 12:21:31,140 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 78 states to 64 states and 130 transitions. [2022-07-22 12:21:31,140 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 62 [2022-07-22 12:21:31,141 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 62 [2022-07-22 12:21:31,141 INFO L73 IsDeterministic]: Start isDeterministic. Operand 64 states and 130 transitions. [2022-07-22 12:21:31,141 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 12:21:31,142 INFO L220 hiAutomatonCegarLoop]: Abstraction has 64 states and 130 transitions. [2022-07-22 12:21:31,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states and 130 transitions. [2022-07-22 12:21:31,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 58. [2022-07-22 12:21:31,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 58 states have (on average 2.086206896551724) internal successors, (121), 57 states have internal predecessors, (121), 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:21:31,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 121 transitions. [2022-07-22 12:21:31,153 INFO L242 hiAutomatonCegarLoop]: Abstraction has 58 states and 121 transitions. [2022-07-22 12:21:31,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-22 12:21:31,154 INFO L425 stractBuchiCegarLoop]: Abstraction has 58 states and 121 transitions. [2022-07-22 12:21:31,154 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2022-07-22 12:21:31,154 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 58 states and 121 transitions. [2022-07-22 12:21:31,157 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 18 [2022-07-22 12:21:31,157 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:21:31,157 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:21:31,159 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 12:21:31,159 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-22 12:21:31,160 INFO L748 eck$LassoCheckResult]: Stem: 932#[ULTIMATE.startENTRY]don't care [587] ULTIMATE.startENTRY-->L115-6: Formula: (let ((.cse2 (store |v_#valid_In_7| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6| 1))) (let ((.cse0 (select |v_#memory_int_In_5| 1)) (.cse1 (store .cse2 |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6| 1))) (and (= |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_Out_2| 0) (= (select .cse0 1) 0) (= |v_#length_Out_6| (store (store (store |v_#length_In_7| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6| 4) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_2| (* 4 |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2|))) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_Out_6| 0) (= (select |v_#length_In_7| 2) 25) (= 0 |v_#NULL.base_Out_2|) (< |v_#StackHeapBarrier_In_3| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6|) (= v_~element~0_Out_6 0) (= v_~queue~0.offset_Out_2 0) (= 48 (select .cse0 0)) (= v_~queue~0.base_Out_2 0) (= (select |v_#valid_In_7| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6|) 0) (= (store .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_2| 1) |v_#valid_Out_10|) (= (select |v_#valid_In_7| 0) 0) (= |v_#NULL.offset_Out_2| 0) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_6| (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2| 4294967296) 1073741823) 1 0)) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_2| |v_#StackHeapBarrier_In_3|) (< 0 |v_#StackHeapBarrier_In_3|) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2|) 1 0) 0)) (= (select |v_#valid_In_7| 2) 1) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_10| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_6|) (= (select |v_#valid_In_7| 1) 1) (= 0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_Out_2|) (= v_~back~0_Out_6 v_~front~0_Out_2) (= v_~n~0_Out_2 |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_2|) (= |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2| |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_2|) (= (select .cse2 |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6|) 0) (= 2 (select |v_#length_In_7| 1)) (= v_~sum~0_Out_2 0) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_2| 0)) (< |v_#StackHeapBarrier_In_3| |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6|) (= (select .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_2|) 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_Out_6| 0) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_10| 0))))) InVars {#memory_int=|v_#memory_int_In_5|, #StackHeapBarrier=|v_#StackHeapBarrier_In_3|, #length=|v_#length_In_7|, #valid=|v_#valid_In_7|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_Out_2|, ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_Out_2|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_Out_2|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_Out_6|, ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_Out_2|, #NULL.offset=|v_#NULL.offset_Out_2|, ULTIMATE.start_create_fresh_int_array_#t~malloc17#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc17#1.offset_Out_6|, ULTIMATE.start_create_fresh_int_array_#t~malloc17#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc17#1.base_Out_6|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_6|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_Out_6|, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_Out_2|, ~sum~0=v_~sum~0_Out_2, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_2|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_10|, ULTIMATE.start_create_fresh_int_array_#t~post18#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post18#1_Out_2|, #length=|v_#length_Out_6|, ~front~0=v_~front~0_Out_2, ULTIMATE.start_main_#t~ret10#1.base=|v_ULTIMATE.start_main_#t~ret10#1.base_Out_2|, ~queue~0.offset=v_~queue~0.offset_Out_2, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_2|, ULTIMATE.start_main_#t~ret10#1.offset=|v_ULTIMATE.start_main_#t~ret10#1.offset_Out_2|, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_Out_2|, ULTIMATE.start_main_#t~mem15#1=|v_ULTIMATE.start_main_#t~mem15#1_Out_2|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_Out_6|, ~back~0=v_~back~0_Out_6, ULTIMATE.start_main_#t~mem16#1=|v_ULTIMATE.start_main_#t~mem16#1_Out_6|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_Out_6|, ~queue~0.base=v_~queue~0.base_Out_2, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2|, #NULL.base=|v_#NULL.base_Out_2|, ULTIMATE.start_main_#t~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_Out_2|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_6|, #StackHeapBarrier=|v_#StackHeapBarrier_In_3|, ~element~0=v_~element~0_Out_6, ULTIMATE.start_create_fresh_int_array_#t~nondet19#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet19#1_Out_2|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_Out_2|, #valid=|v_#valid_Out_10|, #memory_int=|v_#memory_int_In_5|, ~n~0=v_~n~0_Out_2, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_Out_6|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_6|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_main_#t~pre13#1, ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_#t~nondet9#1, #NULL.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc17#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc17#1.base, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_#t~nondet12#1, ~sum~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_create_fresh_int_array_#t~post18#1, #length, ~front~0, ULTIMATE.start_main_#t~ret10#1.base, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_main_#t~ret10#1.offset, ULTIMATE.start_main_#t~pre11#1, ULTIMATE.start_main_#t~mem15#1, ULTIMATE.start_main_#res#1, ~back~0, ULTIMATE.start_main_#t~mem16#1, ULTIMATE.start_main_~#t1~0#1.base, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_~size#1, #NULL.base, ULTIMATE.start_main_#t~nondet14#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~element~0, ULTIMATE.start_create_fresh_int_array_#t~nondet19#1, ULTIMATE.start_main_#t~nondet8#1, #valid, ~n~0, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 910#[L115-6]don't care [554] L115-6-->L115-6: Formula: (let ((.cse0 (* |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_29| 4))) (let ((.cse1 (+ .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_21|))) (and (<= (+ .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_21| 4) (select |v_#length_121| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_21|)) (<= 0 .cse1) (= (+ |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_29| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_28|) (= (store |v_#memory_int_107| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_21| (store (select |v_#memory_int_107| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_21|) .cse1 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet19#1_13|)) |v_#memory_int_106|) (< |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_29| |v_ULTIMATE.start_create_fresh_int_array_~size#1_38|) (= (select |v_#valid_148| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_21|) 1)))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_21|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_21|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_29|, ULTIMATE.start_create_fresh_int_array_#t~nondet19#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet19#1_13|, #valid=|v_#valid_148|, #memory_int=|v_#memory_int_107|, #length=|v_#length_121|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_38|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_21|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_21|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_28|, #valid=|v_#valid_148|, ULTIMATE.start_create_fresh_int_array_#t~post18#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post18#1_13|, #memory_int=|v_#memory_int_106|, #length=|v_#length_121|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_38|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~nondet19#1, ULTIMATE.start_create_fresh_int_array_#t~post18#1, #memory_int] 912#[L115-6]don't care [563] L115-6-->L99-3: Formula: (and (= (select |v_#valid_154| |v_ULTIMATE.start_main_~#t1~0#1.base_43|) 1) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_36| |v_ULTIMATE.start_create_fresh_int_array_~size#1_48|)) (<= (+ 4 |v_ULTIMATE.start_main_~#t1~0#1.offset_35|) (select |v_#length_125| |v_ULTIMATE.start_main_~#t1~0#1.base_43|)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_18| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_27|) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_18| v_~queue~0.offset_58) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_35|) (= |v_ULTIMATE.start_main_#t~pre11#1_27| |v_#pthreadsForks_44|) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_18| v_~queue~0.base_58) (= |v_#pthreadsForks_43| (+ |v_#pthreadsForks_44| 1)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_18| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_27|) (= (store |v_#memory_int_113| |v_ULTIMATE.start_main_~#t1~0#1.base_43| (store (select |v_#memory_int_113| |v_ULTIMATE.start_main_~#t1~0#1.base_43|) |v_ULTIMATE.start_main_~#t1~0#1.offset_35| |v_ULTIMATE.start_main_#t~pre11#1_27|)) |v_#memory_int_112|)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_27|, #pthreadsForks=|v_#pthreadsForks_44|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_27|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_36|, #valid=|v_#valid_154|, #memory_int=|v_#memory_int_113|, #length=|v_#length_125|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_43|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_35|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_48|} OutVars{ULTIMATE.start_main_#t~ret10#1.base=|v_ULTIMATE.start_main_#t~ret10#1.base_23|, ~queue~0.offset=v_~queue~0.offset_58, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_27|, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_27|, ULTIMATE.start_main_#t~ret10#1.offset=|v_ULTIMATE.start_main_#t~ret10#1.offset_23|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_27|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_36|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_43|, ~queue~0.base=v_~queue~0.base_58, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_18|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_35|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_48|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_18|, #pthreadsForks=|v_#pthreadsForks_43|, #valid=|v_#valid_154|, #memory_int=|v_#memory_int_112|, #length=|v_#length_125|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret10#1.base, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_main_#t~pre11#1, ULTIMATE.start_main_#t~ret10#1.offset, #pthreadsForks, #memory_int, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#res#1.base] 972#[L99-3]don't care [435] L99-3-->thread1ENTRY: Formula: (and (= v_thread1Thread1of1ForFork1_thidvar0_2 |v_ULTIMATE.start_main_#t~pre11#1_6|) (= 0 v_thread1Thread1of1ForFork1_thidvar1_2)) InVars {ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_6|} OutVars{thread1Thread1of1ForFork1_#t~post2#1=|v_thread1Thread1of1ForFork1_#t~post2#1_8|, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_6|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_6|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_4|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_4|, thread1Thread1of1ForFork1_#t~mem1#1=|v_thread1Thread1of1ForFork1_#t~mem1#1_8|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_2, thread1Thread1of1ForFork1_~cond~0#1=|v_thread1Thread1of1ForFork1_~cond~0#1_10|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_10|, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#res#1.base, thread1Thread1of1ForFork1_#t~mem1#1, thread1Thread1of1ForFork1_thidvar1, thread1Thread1of1ForFork1_~cond~0#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_thidvar0] 970#[thread1ENTRY, L99-4]don't care [392] thread1ENTRY-->L57: Formula: (= (ite (= (ite (< v_~front~0_1 v_~back~0_1) 1 0) 0) 0 1) |v_thread1Thread1of1ForFork1_~cond~0#1_1|) InVars {~back~0=v_~back~0_1, ~front~0=v_~front~0_1} OutVars{~back~0=v_~back~0_1, thread1Thread1of1ForFork1_~cond~0#1=|v_thread1Thread1of1ForFork1_~cond~0#1_1|, ~front~0=v_~front~0_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_~cond~0#1] 968#[L57, L99-4]don't care [537] L99-4-->L100-3: Formula: (and (<= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_27|) (<= (+ |v_ULTIMATE.start_main_~#t2~0#1.offset_27| 4) (select |v_#length_91| |v_ULTIMATE.start_main_~#t2~0#1.base_29|)) (= (select |v_#valid_110| |v_ULTIMATE.start_main_~#t2~0#1.base_29|) 1) (= (store |v_#memory_int_83| |v_ULTIMATE.start_main_~#t2~0#1.base_29| (store (select |v_#memory_int_83| |v_ULTIMATE.start_main_~#t2~0#1.base_29|) |v_ULTIMATE.start_main_~#t2~0#1.offset_27| |v_ULTIMATE.start_main_#t~pre13#1_21|)) |v_#memory_int_82|) (= (+ |v_#pthreadsForks_28| 1) |v_#pthreadsForks_27|) (= |v_ULTIMATE.start_main_#t~pre13#1_21| |v_#pthreadsForks_28|)) InVars {#pthreadsForks=|v_#pthreadsForks_28|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_27|, #valid=|v_#valid_110|, #memory_int=|v_#memory_int_83|, #length=|v_#length_91|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_29|} OutVars{ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_21|, #pthreadsForks=|v_#pthreadsForks_27|, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_21|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_27|, #valid=|v_#valid_110|, #memory_int=|v_#memory_int_82|, #length=|v_#length_91|, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_11|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_29|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre13#1, #pthreadsForks, ULTIMATE.start_main_#t~pre11#1, #memory_int, ULTIMATE.start_main_#t~nondet12#1] 960#[L57, L100-3]don't care [432] L100-3-->thread2ENTRY: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar0_2 |v_ULTIMATE.start_main_#t~pre13#1_6|) (= v_thread2Thread1of1ForFork0_thidvar2_2 0) (= v_thread2Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_6|} OutVars{ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_6|, thread2Thread1of1ForFork0_~flag~0#1=|v_thread2Thread1of1ForFork0_~flag~0#1_12|, 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_8|, thread2Thread1of1ForFork0_#t~mem6#1=|v_thread2Thread1of1ForFork0_#t~mem6#1_4|, thread2Thread1of1ForFork0_#t~post7#1=|v_thread2Thread1of1ForFork0_#t~post7#1_4|, thread2Thread1of1ForFork0_#t~nondet3#1=|v_thread2Thread1of1ForFork0_#t~nondet3#1_10|, thread2Thread1of1ForFork0_#t~post5#1=|v_thread2Thread1of1ForFork0_#t~post5#1_4|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_8|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_4|, thread2Thread1of1ForFork0_#t~mem4#1=|v_thread2Thread1of1ForFork0_#t~mem4#1_4|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_2, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_2, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~flag~0#1, thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~mem6#1, thread2Thread1of1ForFork0_#t~post7#1, thread2Thread1of1ForFork0_#t~nondet3#1, thread2Thread1of1ForFork0_#t~post5#1, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_#t~mem4#1, thread2Thread1of1ForFork0_thidvar2, thread2Thread1of1ForFork0_thidvar1, thread2Thread1of1ForFork0_thidvar0] 894#[thread2ENTRY, L57, L100-4]don't care [414] thread2ENTRY-->L65-4: Formula: (= |v_thread2Thread1of1ForFork0_~flag~0#1_1| 1) InVars {} OutVars{thread2Thread1of1ForFork0_~flag~0#1=|v_thread2Thread1of1ForFork0_~flag~0#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~flag~0#1] 898#[L57, L65-4, L100-4]don't care [573] L65-4-->L65-4: Formula: (let ((.cse11 (* v_~back~0_In_1 4))) (let ((.cse2 (= (mod |v_thread2Thread1of1ForFork0_~flag~0#1_In_1| 256) 0)) (.cse12 (+ .cse11 v_~queue~0.offset_In_3))) (let ((.cse0 (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|)) (.cse1 (<= 0 .cse12)) (.cse3 (select (select |v_#memory_int_In_3| v_~queue~0.base_In_3) .cse12)) (.cse4 (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| 0))) (.cse5 (= (+ v_~back~0_In_1 1) v_~back~0_Out_2)) (.cse6 (= (select |v_#valid_In_5| v_~queue~0.base_In_3) 1)) (.cse7 (not (= (mod |v_thread2Thread1of1ForFork0_#t~nondet3#1_In_3| 256) 0))) (.cse8 (<= (+ .cse11 v_~queue~0.offset_In_3 4) (select |v_#length_In_5| v_~queue~0.base_In_3))) (.cse9 (= (ite (= (ite .cse2 1 0) 0) 0 1) |v_thread2Thread1of1ForFork0_~flag~0#1_Out_2|)) (.cse10 (not (= (ite (and (<= 0 v_~back~0_In_1) (< v_~back~0_In_1 v_~n~0_In_3)) 1 0) 0)))) (or (and .cse0 .cse1 (not .cse2) (= |v_thread2Thread1of1ForFork0_#t~post7#1_In_1| |v_thread2Thread1of1ForFork0_#t~post7#1_Out_2|) (= (ite (= .cse3 1) 1 0) |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) .cse4 (= |v_thread2Thread1of1ForFork0_#t~mem6#1_Out_2| |v_thread2Thread1of1ForFork0_#t~mem6#1_In_1|) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse2 .cse1 (= (ite (= (- 1) .cse3) 1 0) |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (= |v_thread2Thread1of1ForFork0_#t~mem4#1_In_1| |v_thread2Thread1of1ForFork0_#t~mem4#1_Out_2|) .cse4 .cse5 (= |v_thread2Thread1of1ForFork0_#t~post5#1_Out_2| |v_thread2Thread1of1ForFork0_#t~post5#1_In_1|) .cse6 .cse7 .cse8 .cse9 .cse10))))) InVars {~queue~0.offset=v_~queue~0.offset_In_3, thread2Thread1of1ForFork0_~flag~0#1=|v_thread2Thread1of1ForFork0_~flag~0#1_In_1|, ~back~0=v_~back~0_In_1, thread2Thread1of1ForFork0_#t~mem6#1=|v_thread2Thread1of1ForFork0_#t~mem6#1_In_1|, ~queue~0.base=v_~queue~0.base_In_3, thread2Thread1of1ForFork0_#t~post7#1=|v_thread2Thread1of1ForFork0_#t~post7#1_In_1|, thread2Thread1of1ForFork0_#t~nondet3#1=|v_thread2Thread1of1ForFork0_#t~nondet3#1_In_3|, thread2Thread1of1ForFork0_#t~post5#1=|v_thread2Thread1of1ForFork0_#t~post5#1_In_1|, thread2Thread1of1ForFork0_#t~mem4#1=|v_thread2Thread1of1ForFork0_#t~mem4#1_In_1|, #valid=|v_#valid_In_5|, #memory_int=|v_#memory_int_In_3|, #length=|v_#length_In_5|, ~n~0=v_~n~0_In_3} OutVars{~queue~0.offset=v_~queue~0.offset_In_3, thread2Thread1of1ForFork0_~flag~0#1=|v_thread2Thread1of1ForFork0_~flag~0#1_Out_2|, ~back~0=v_~back~0_Out_2, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|, thread2Thread1of1ForFork0_#t~mem6#1=|v_thread2Thread1of1ForFork0_#t~mem6#1_Out_2|, thread2Thread1of1ForFork0_#t~post7#1=|v_thread2Thread1of1ForFork0_#t~post7#1_Out_2|, ~queue~0.base=v_~queue~0.base_In_3, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2|, thread2Thread1of1ForFork0_#t~post5#1=|v_thread2Thread1of1ForFork0_#t~post5#1_Out_2|, thread2Thread1of1ForFork0_#t~mem4#1=|v_thread2Thread1of1ForFork0_#t~mem4#1_Out_2|, #valid=|v_#valid_In_5|, #memory_int=|v_#memory_int_In_3|, #length=|v_#length_In_5|, ~n~0=v_~n~0_In_3} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#t~post5#1, thread2Thread1of1ForFork0_~flag~0#1, thread2Thread1of1ForFork0_#t~mem4#1, ~back~0, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~mem6#1, thread2Thread1of1ForFork0_#t~post7#1, thread2Thread1of1ForFork0_#t~nondet3#1] 902#[L57, L65-4, L100-4]don't care [2022-07-22 12:21:31,161 INFO L750 eck$LassoCheckResult]: Loop: 902#[L57, L65-4, L100-4]don't care [572] L57-->L53: Formula: (let ((.cse0 (* v_~front~0_In_1 4))) (let ((.cse1 (+ v_~queue~0.offset_In_1 .cse0))) (and (<= (+ v_~queue~0.offset_In_1 .cse0 4) (select |v_#length_In_3| v_~queue~0.base_In_1)) (not (= 0 (mod |v_thread1Thread1of1ForFork1_~cond~0#1_In_3| 256))) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_2| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_2|) (= (select (select |v_#memory_int_In_1| v_~queue~0.base_In_1) .cse1) v_~element~0_Out_2) (= (select |v_#valid_In_3| v_~queue~0.base_In_1) 1) (<= 0 .cse1) (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_2| (ite (and (< v_~front~0_In_1 v_~n~0_In_1) (<= 0 v_~front~0_In_1)) 1 0))))) InVars {~queue~0.offset=v_~queue~0.offset_In_1, #valid=|v_#valid_In_3|, #memory_int=|v_#memory_int_In_1|, #length=|v_#length_In_3|, ~queue~0.base=v_~queue~0.base_In_1, ~n~0=v_~n~0_In_1, thread1Thread1of1ForFork1_~cond~0#1=|v_thread1Thread1of1ForFork1_~cond~0#1_In_3|, ~front~0=v_~front~0_In_1} OutVars{~queue~0.offset=v_~queue~0.offset_In_1, ~queue~0.base=v_~queue~0.base_In_1, ~element~0=v_~element~0_Out_2, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_2|, #valid=|v_#valid_In_3|, #memory_int=|v_#memory_int_In_1|, #length=|v_#length_In_3|, thread1Thread1of1ForFork1_#t~mem1#1=|v_thread1Thread1of1ForFork1_#t~mem1#1_Out_2|, ~n~0=v_~n~0_In_1, thread1Thread1of1ForFork1_~cond~0#1=|v_thread1Thread1of1ForFork1_~cond~0#1_In_3|, ~front~0=v_~front~0_In_1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_2|} AuxVars[] AssignedVars[~element~0, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#t~mem1#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] 926#[L53, L65-4, L100-4]don't care [541] L53-->L57: Formula: (and (= (+ v_~front~0_49 1) v_~front~0_48) (= (+ v_~element~0_16 v_~sum~0_18) v_~sum~0_17) (= (ite (= (ite (< v_~front~0_48 v_~back~0_90) 1 0) 0) 0 1) |v_thread1Thread1of1ForFork1_~cond~0#1_25|)) InVars {~sum~0=v_~sum~0_18, ~element~0=v_~element~0_16, ~back~0=v_~back~0_90, ~front~0=v_~front~0_49} OutVars{~sum~0=v_~sum~0_17, thread1Thread1of1ForFork1_#t~post2#1=|v_thread1Thread1of1ForFork1_#t~post2#1_15|, ~element~0=v_~element~0_16, ~back~0=v_~back~0_90, thread1Thread1of1ForFork1_~cond~0#1=|v_thread1Thread1of1ForFork1_~cond~0#1_25|, ~front~0=v_~front~0_48} AuxVars[] AssignedVars[~sum~0, thread1Thread1of1ForFork1_#t~post2#1, thread1Thread1of1ForFork1_~cond~0#1, ~front~0] 902#[L57, L65-4, L100-4]don't care [2022-07-22 12:21:31,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:21:31,161 INFO L85 PathProgramCache]: Analyzing trace with hash 229514238, now seen corresponding path program 1 times [2022-07-22 12:21:31,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:21:31,162 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30553858] [2022-07-22 12:21:31,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:21:31,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:21:31,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:21:31,224 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:21:31,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:21:31,337 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:21:31,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:21:31,338 INFO L85 PathProgramCache]: Analyzing trace with hash 19234, now seen corresponding path program 3 times [2022-07-22 12:21:31,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:21:31,338 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184123322] [2022-07-22 12:21:31,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:21:31,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:21:31,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:21:31,352 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:21:31,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:21:31,365 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:21:31,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:21:31,367 INFO L85 PathProgramCache]: Analyzing trace with hash 1519868895, now seen corresponding path program 1 times [2022-07-22 12:21:31,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:21:31,367 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454477972] [2022-07-22 12:21:31,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:21:31,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:21:31,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:21:31,486 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-22 12:21:31,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 12:21:31,486 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454477972] [2022-07-22 12:21:31,487 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [454477972] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 12:21:31,487 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 12:21:31,487 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 12:21:31,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170180530] [2022-07-22 12:21:31,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 12:21:31,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 12:21:31,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-22 12:21:31,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-22 12:21:31,610 INFO L87 Difference]: Start difference. First operand 58 states and 121 transitions. cyclomatic complexity: 76 Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:21:31,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 12:21:31,695 INFO L93 Difference]: Finished difference Result 72 states and 146 transitions. [2022-07-22 12:21:31,695 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 72 states and 146 transitions. [2022-07-22 12:21:31,696 INFO L131 ngComponentsAnalysis]: Automaton has 18 accepting balls. 24 [2022-07-22 12:21:31,697 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 72 states to 62 states and 126 transitions. [2022-07-22 12:21:31,698 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 60 [2022-07-22 12:21:31,699 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 60 [2022-07-22 12:21:31,699 INFO L73 IsDeterministic]: Start isDeterministic. Operand 62 states and 126 transitions. [2022-07-22 12:21:31,701 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 12:21:31,701 INFO L220 hiAutomatonCegarLoop]: Abstraction has 62 states and 126 transitions. [2022-07-22 12:21:31,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states and 126 transitions. [2022-07-22 12:21:31,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 52. [2022-07-22 12:21:31,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 52 states have (on average 2.0576923076923075) internal successors, (107), 51 states have internal predecessors, (107), 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:21:31,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 107 transitions. [2022-07-22 12:21:31,710 INFO L242 hiAutomatonCegarLoop]: Abstraction has 52 states and 107 transitions. [2022-07-22 12:21:31,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-22 12:21:31,712 INFO L425 stractBuchiCegarLoop]: Abstraction has 52 states and 107 transitions. [2022-07-22 12:21:31,713 INFO L332 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2022-07-22 12:21:31,713 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 52 states and 107 transitions. [2022-07-22 12:21:31,714 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 20 [2022-07-22 12:21:31,714 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:21:31,714 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:21:31,714 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 12:21:31,714 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-22 12:21:31,719 INFO L748 eck$LassoCheckResult]: Stem: 1128#[ULTIMATE.startENTRY]don't care [587] ULTIMATE.startENTRY-->L115-6: Formula: (let ((.cse2 (store |v_#valid_In_7| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6| 1))) (let ((.cse0 (select |v_#memory_int_In_5| 1)) (.cse1 (store .cse2 |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6| 1))) (and (= |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_Out_2| 0) (= (select .cse0 1) 0) (= |v_#length_Out_6| (store (store (store |v_#length_In_7| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6| 4) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_2| (* 4 |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2|))) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_Out_6| 0) (= (select |v_#length_In_7| 2) 25) (= 0 |v_#NULL.base_Out_2|) (< |v_#StackHeapBarrier_In_3| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6|) (= v_~element~0_Out_6 0) (= v_~queue~0.offset_Out_2 0) (= 48 (select .cse0 0)) (= v_~queue~0.base_Out_2 0) (= (select |v_#valid_In_7| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6|) 0) (= (store .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_2| 1) |v_#valid_Out_10|) (= (select |v_#valid_In_7| 0) 0) (= |v_#NULL.offset_Out_2| 0) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_6| (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2| 4294967296) 1073741823) 1 0)) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_2| |v_#StackHeapBarrier_In_3|) (< 0 |v_#StackHeapBarrier_In_3|) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2|) 1 0) 0)) (= (select |v_#valid_In_7| 2) 1) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_10| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_6|) (= (select |v_#valid_In_7| 1) 1) (= 0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_Out_2|) (= v_~back~0_Out_6 v_~front~0_Out_2) (= v_~n~0_Out_2 |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_2|) (= |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2| |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_2|) (= (select .cse2 |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6|) 0) (= 2 (select |v_#length_In_7| 1)) (= v_~sum~0_Out_2 0) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_2| 0)) (< |v_#StackHeapBarrier_In_3| |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6|) (= (select .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_2|) 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_Out_6| 0) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_10| 0))))) InVars {#memory_int=|v_#memory_int_In_5|, #StackHeapBarrier=|v_#StackHeapBarrier_In_3|, #length=|v_#length_In_7|, #valid=|v_#valid_In_7|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_Out_2|, ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_Out_2|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_Out_2|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_Out_6|, ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_Out_2|, #NULL.offset=|v_#NULL.offset_Out_2|, ULTIMATE.start_create_fresh_int_array_#t~malloc17#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc17#1.offset_Out_6|, ULTIMATE.start_create_fresh_int_array_#t~malloc17#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc17#1.base_Out_6|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_6|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_Out_6|, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_Out_2|, ~sum~0=v_~sum~0_Out_2, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_2|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_10|, ULTIMATE.start_create_fresh_int_array_#t~post18#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post18#1_Out_2|, #length=|v_#length_Out_6|, ~front~0=v_~front~0_Out_2, ULTIMATE.start_main_#t~ret10#1.base=|v_ULTIMATE.start_main_#t~ret10#1.base_Out_2|, ~queue~0.offset=v_~queue~0.offset_Out_2, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_2|, ULTIMATE.start_main_#t~ret10#1.offset=|v_ULTIMATE.start_main_#t~ret10#1.offset_Out_2|, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_Out_2|, ULTIMATE.start_main_#t~mem15#1=|v_ULTIMATE.start_main_#t~mem15#1_Out_2|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_Out_6|, ~back~0=v_~back~0_Out_6, ULTIMATE.start_main_#t~mem16#1=|v_ULTIMATE.start_main_#t~mem16#1_Out_6|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_Out_6|, ~queue~0.base=v_~queue~0.base_Out_2, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2|, #NULL.base=|v_#NULL.base_Out_2|, ULTIMATE.start_main_#t~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_Out_2|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_6|, #StackHeapBarrier=|v_#StackHeapBarrier_In_3|, ~element~0=v_~element~0_Out_6, ULTIMATE.start_create_fresh_int_array_#t~nondet19#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet19#1_Out_2|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_Out_2|, #valid=|v_#valid_Out_10|, #memory_int=|v_#memory_int_In_5|, ~n~0=v_~n~0_Out_2, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_Out_6|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_6|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_main_#t~pre13#1, ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_#t~nondet9#1, #NULL.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc17#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc17#1.base, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_#t~nondet12#1, ~sum~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_create_fresh_int_array_#t~post18#1, #length, ~front~0, ULTIMATE.start_main_#t~ret10#1.base, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_main_#t~ret10#1.offset, ULTIMATE.start_main_#t~pre11#1, ULTIMATE.start_main_#t~mem15#1, ULTIMATE.start_main_#res#1, ~back~0, ULTIMATE.start_main_#t~mem16#1, ULTIMATE.start_main_~#t1~0#1.base, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_~size#1, #NULL.base, ULTIMATE.start_main_#t~nondet14#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~element~0, ULTIMATE.start_create_fresh_int_array_#t~nondet19#1, ULTIMATE.start_main_#t~nondet8#1, #valid, ~n~0, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 1104#[L115-6]don't care [554] L115-6-->L115-6: Formula: (let ((.cse0 (* |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_29| 4))) (let ((.cse1 (+ .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_21|))) (and (<= (+ .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_21| 4) (select |v_#length_121| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_21|)) (<= 0 .cse1) (= (+ |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_29| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_28|) (= (store |v_#memory_int_107| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_21| (store (select |v_#memory_int_107| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_21|) .cse1 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet19#1_13|)) |v_#memory_int_106|) (< |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_29| |v_ULTIMATE.start_create_fresh_int_array_~size#1_38|) (= (select |v_#valid_148| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_21|) 1)))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_21|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_21|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_29|, ULTIMATE.start_create_fresh_int_array_#t~nondet19#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet19#1_13|, #valid=|v_#valid_148|, #memory_int=|v_#memory_int_107|, #length=|v_#length_121|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_38|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_21|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_21|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_28|, #valid=|v_#valid_148|, ULTIMATE.start_create_fresh_int_array_#t~post18#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post18#1_13|, #memory_int=|v_#memory_int_106|, #length=|v_#length_121|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_38|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~nondet19#1, ULTIMATE.start_create_fresh_int_array_#t~post18#1, #memory_int] 1106#[L115-6]don't care [563] L115-6-->L99-3: Formula: (and (= (select |v_#valid_154| |v_ULTIMATE.start_main_~#t1~0#1.base_43|) 1) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_36| |v_ULTIMATE.start_create_fresh_int_array_~size#1_48|)) (<= (+ 4 |v_ULTIMATE.start_main_~#t1~0#1.offset_35|) (select |v_#length_125| |v_ULTIMATE.start_main_~#t1~0#1.base_43|)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_18| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_27|) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_18| v_~queue~0.offset_58) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_35|) (= |v_ULTIMATE.start_main_#t~pre11#1_27| |v_#pthreadsForks_44|) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_18| v_~queue~0.base_58) (= |v_#pthreadsForks_43| (+ |v_#pthreadsForks_44| 1)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_18| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_27|) (= (store |v_#memory_int_113| |v_ULTIMATE.start_main_~#t1~0#1.base_43| (store (select |v_#memory_int_113| |v_ULTIMATE.start_main_~#t1~0#1.base_43|) |v_ULTIMATE.start_main_~#t1~0#1.offset_35| |v_ULTIMATE.start_main_#t~pre11#1_27|)) |v_#memory_int_112|)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_27|, #pthreadsForks=|v_#pthreadsForks_44|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_27|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_36|, #valid=|v_#valid_154|, #memory_int=|v_#memory_int_113|, #length=|v_#length_125|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_43|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_35|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_48|} OutVars{ULTIMATE.start_main_#t~ret10#1.base=|v_ULTIMATE.start_main_#t~ret10#1.base_23|, ~queue~0.offset=v_~queue~0.offset_58, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_27|, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_27|, ULTIMATE.start_main_#t~ret10#1.offset=|v_ULTIMATE.start_main_#t~ret10#1.offset_23|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_27|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_36|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_43|, ~queue~0.base=v_~queue~0.base_58, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_18|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_35|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_48|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_18|, #pthreadsForks=|v_#pthreadsForks_43|, #valid=|v_#valid_154|, #memory_int=|v_#memory_int_112|, #length=|v_#length_125|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret10#1.base, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_main_#t~pre11#1, ULTIMATE.start_main_#t~ret10#1.offset, #pthreadsForks, #memory_int, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#res#1.base] 1108#[L99-3]don't care [435] L99-3-->thread1ENTRY: Formula: (and (= v_thread1Thread1of1ForFork1_thidvar0_2 |v_ULTIMATE.start_main_#t~pre11#1_6|) (= 0 v_thread1Thread1of1ForFork1_thidvar1_2)) InVars {ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_6|} OutVars{thread1Thread1of1ForFork1_#t~post2#1=|v_thread1Thread1of1ForFork1_#t~post2#1_8|, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_6|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_6|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_4|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_4|, thread1Thread1of1ForFork1_#t~mem1#1=|v_thread1Thread1of1ForFork1_#t~mem1#1_8|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_2, thread1Thread1of1ForFork1_~cond~0#1=|v_thread1Thread1of1ForFork1_~cond~0#1_10|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_10|, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#res#1.base, thread1Thread1of1ForFork1_#t~mem1#1, thread1Thread1of1ForFork1_thidvar1, thread1Thread1of1ForFork1_~cond~0#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_thidvar0] 1130#[thread1ENTRY, L99-4]don't care [537] L99-4-->L100-3: Formula: (and (<= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_27|) (<= (+ |v_ULTIMATE.start_main_~#t2~0#1.offset_27| 4) (select |v_#length_91| |v_ULTIMATE.start_main_~#t2~0#1.base_29|)) (= (select |v_#valid_110| |v_ULTIMATE.start_main_~#t2~0#1.base_29|) 1) (= (store |v_#memory_int_83| |v_ULTIMATE.start_main_~#t2~0#1.base_29| (store (select |v_#memory_int_83| |v_ULTIMATE.start_main_~#t2~0#1.base_29|) |v_ULTIMATE.start_main_~#t2~0#1.offset_27| |v_ULTIMATE.start_main_#t~pre13#1_21|)) |v_#memory_int_82|) (= (+ |v_#pthreadsForks_28| 1) |v_#pthreadsForks_27|) (= |v_ULTIMATE.start_main_#t~pre13#1_21| |v_#pthreadsForks_28|)) InVars {#pthreadsForks=|v_#pthreadsForks_28|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_27|, #valid=|v_#valid_110|, #memory_int=|v_#memory_int_83|, #length=|v_#length_91|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_29|} OutVars{ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_21|, #pthreadsForks=|v_#pthreadsForks_27|, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_21|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_27|, #valid=|v_#valid_110|, #memory_int=|v_#memory_int_82|, #length=|v_#length_91|, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_11|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_29|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre13#1, #pthreadsForks, ULTIMATE.start_main_#t~pre11#1, #memory_int, ULTIMATE.start_main_#t~nondet12#1] 1064#[L100-3, thread1ENTRY]don't care [432] L100-3-->thread2ENTRY: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar0_2 |v_ULTIMATE.start_main_#t~pre13#1_6|) (= v_thread2Thread1of1ForFork0_thidvar2_2 0) (= v_thread2Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_6|} OutVars{ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_6|, thread2Thread1of1ForFork0_~flag~0#1=|v_thread2Thread1of1ForFork0_~flag~0#1_12|, 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_8|, thread2Thread1of1ForFork0_#t~mem6#1=|v_thread2Thread1of1ForFork0_#t~mem6#1_4|, thread2Thread1of1ForFork0_#t~post7#1=|v_thread2Thread1of1ForFork0_#t~post7#1_4|, thread2Thread1of1ForFork0_#t~nondet3#1=|v_thread2Thread1of1ForFork0_#t~nondet3#1_10|, thread2Thread1of1ForFork0_#t~post5#1=|v_thread2Thread1of1ForFork0_#t~post5#1_4|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_8|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_4|, thread2Thread1of1ForFork0_#t~mem4#1=|v_thread2Thread1of1ForFork0_#t~mem4#1_4|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_2, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_2, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~flag~0#1, thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~mem6#1, thread2Thread1of1ForFork0_#t~post7#1, thread2Thread1of1ForFork0_#t~nondet3#1, thread2Thread1of1ForFork0_#t~post5#1, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_#t~mem4#1, thread2Thread1of1ForFork0_thidvar2, thread2Thread1of1ForFork0_thidvar1, thread2Thread1of1ForFork0_thidvar0] 1066#[thread2ENTRY, L100-4, thread1ENTRY]don't care [414] thread2ENTRY-->L65-4: Formula: (= |v_thread2Thread1of1ForFork0_~flag~0#1_1| 1) InVars {} OutVars{thread2Thread1of1ForFork0_~flag~0#1=|v_thread2Thread1of1ForFork0_~flag~0#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~flag~0#1] 1086#[L65-4, L100-4, thread1ENTRY]don't care [573] L65-4-->L65-4: Formula: (let ((.cse11 (* v_~back~0_In_1 4))) (let ((.cse2 (= (mod |v_thread2Thread1of1ForFork0_~flag~0#1_In_1| 256) 0)) (.cse12 (+ .cse11 v_~queue~0.offset_In_3))) (let ((.cse0 (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|)) (.cse1 (<= 0 .cse12)) (.cse3 (select (select |v_#memory_int_In_3| v_~queue~0.base_In_3) .cse12)) (.cse4 (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| 0))) (.cse5 (= (+ v_~back~0_In_1 1) v_~back~0_Out_2)) (.cse6 (= (select |v_#valid_In_5| v_~queue~0.base_In_3) 1)) (.cse7 (not (= (mod |v_thread2Thread1of1ForFork0_#t~nondet3#1_In_3| 256) 0))) (.cse8 (<= (+ .cse11 v_~queue~0.offset_In_3 4) (select |v_#length_In_5| v_~queue~0.base_In_3))) (.cse9 (= (ite (= (ite .cse2 1 0) 0) 0 1) |v_thread2Thread1of1ForFork0_~flag~0#1_Out_2|)) (.cse10 (not (= (ite (and (<= 0 v_~back~0_In_1) (< v_~back~0_In_1 v_~n~0_In_3)) 1 0) 0)))) (or (and .cse0 .cse1 (not .cse2) (= |v_thread2Thread1of1ForFork0_#t~post7#1_In_1| |v_thread2Thread1of1ForFork0_#t~post7#1_Out_2|) (= (ite (= .cse3 1) 1 0) |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) .cse4 (= |v_thread2Thread1of1ForFork0_#t~mem6#1_Out_2| |v_thread2Thread1of1ForFork0_#t~mem6#1_In_1|) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse2 .cse1 (= (ite (= (- 1) .cse3) 1 0) |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (= |v_thread2Thread1of1ForFork0_#t~mem4#1_In_1| |v_thread2Thread1of1ForFork0_#t~mem4#1_Out_2|) .cse4 .cse5 (= |v_thread2Thread1of1ForFork0_#t~post5#1_Out_2| |v_thread2Thread1of1ForFork0_#t~post5#1_In_1|) .cse6 .cse7 .cse8 .cse9 .cse10))))) InVars {~queue~0.offset=v_~queue~0.offset_In_3, thread2Thread1of1ForFork0_~flag~0#1=|v_thread2Thread1of1ForFork0_~flag~0#1_In_1|, ~back~0=v_~back~0_In_1, thread2Thread1of1ForFork0_#t~mem6#1=|v_thread2Thread1of1ForFork0_#t~mem6#1_In_1|, ~queue~0.base=v_~queue~0.base_In_3, thread2Thread1of1ForFork0_#t~post7#1=|v_thread2Thread1of1ForFork0_#t~post7#1_In_1|, thread2Thread1of1ForFork0_#t~nondet3#1=|v_thread2Thread1of1ForFork0_#t~nondet3#1_In_3|, thread2Thread1of1ForFork0_#t~post5#1=|v_thread2Thread1of1ForFork0_#t~post5#1_In_1|, thread2Thread1of1ForFork0_#t~mem4#1=|v_thread2Thread1of1ForFork0_#t~mem4#1_In_1|, #valid=|v_#valid_In_5|, #memory_int=|v_#memory_int_In_3|, #length=|v_#length_In_5|, ~n~0=v_~n~0_In_3} OutVars{~queue~0.offset=v_~queue~0.offset_In_3, thread2Thread1of1ForFork0_~flag~0#1=|v_thread2Thread1of1ForFork0_~flag~0#1_Out_2|, ~back~0=v_~back~0_Out_2, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|, thread2Thread1of1ForFork0_#t~mem6#1=|v_thread2Thread1of1ForFork0_#t~mem6#1_Out_2|, thread2Thread1of1ForFork0_#t~post7#1=|v_thread2Thread1of1ForFork0_#t~post7#1_Out_2|, ~queue~0.base=v_~queue~0.base_In_3, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2|, thread2Thread1of1ForFork0_#t~post5#1=|v_thread2Thread1of1ForFork0_#t~post5#1_Out_2|, thread2Thread1of1ForFork0_#t~mem4#1=|v_thread2Thread1of1ForFork0_#t~mem4#1_Out_2|, #valid=|v_#valid_In_5|, #memory_int=|v_#memory_int_In_3|, #length=|v_#length_In_5|, ~n~0=v_~n~0_In_3} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#t~post5#1, thread2Thread1of1ForFork0_~flag~0#1, thread2Thread1of1ForFork0_#t~mem4#1, ~back~0, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~mem6#1, thread2Thread1of1ForFork0_#t~post7#1, thread2Thread1of1ForFork0_#t~nondet3#1] 1140#[L65-4, L100-4, thread1ENTRY]don't care [392] thread1ENTRY-->L57: Formula: (= (ite (= (ite (< v_~front~0_1 v_~back~0_1) 1 0) 0) 0 1) |v_thread1Thread1of1ForFork1_~cond~0#1_1|) InVars {~back~0=v_~back~0_1, ~front~0=v_~front~0_1} OutVars{~back~0=v_~back~0_1, thread1Thread1of1ForFork1_~cond~0#1=|v_thread1Thread1of1ForFork1_~cond~0#1_1|, ~front~0=v_~front~0_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_~cond~0#1] 1122#[L57, L65-4, L100-4]don't care [2022-07-22 12:21:31,719 INFO L750 eck$LassoCheckResult]: Loop: 1122#[L57, L65-4, L100-4]don't care [572] L57-->L53: Formula: (let ((.cse0 (* v_~front~0_In_1 4))) (let ((.cse1 (+ v_~queue~0.offset_In_1 .cse0))) (and (<= (+ v_~queue~0.offset_In_1 .cse0 4) (select |v_#length_In_3| v_~queue~0.base_In_1)) (not (= 0 (mod |v_thread1Thread1of1ForFork1_~cond~0#1_In_3| 256))) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_2| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_2|) (= (select (select |v_#memory_int_In_1| v_~queue~0.base_In_1) .cse1) v_~element~0_Out_2) (= (select |v_#valid_In_3| v_~queue~0.base_In_1) 1) (<= 0 .cse1) (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_2| (ite (and (< v_~front~0_In_1 v_~n~0_In_1) (<= 0 v_~front~0_In_1)) 1 0))))) InVars {~queue~0.offset=v_~queue~0.offset_In_1, #valid=|v_#valid_In_3|, #memory_int=|v_#memory_int_In_1|, #length=|v_#length_In_3|, ~queue~0.base=v_~queue~0.base_In_1, ~n~0=v_~n~0_In_1, thread1Thread1of1ForFork1_~cond~0#1=|v_thread1Thread1of1ForFork1_~cond~0#1_In_3|, ~front~0=v_~front~0_In_1} OutVars{~queue~0.offset=v_~queue~0.offset_In_1, ~queue~0.base=v_~queue~0.base_In_1, ~element~0=v_~element~0_Out_2, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_2|, #valid=|v_#valid_In_3|, #memory_int=|v_#memory_int_In_1|, #length=|v_#length_In_3|, thread1Thread1of1ForFork1_#t~mem1#1=|v_thread1Thread1of1ForFork1_#t~mem1#1_Out_2|, ~n~0=v_~n~0_In_1, thread1Thread1of1ForFork1_~cond~0#1=|v_thread1Thread1of1ForFork1_~cond~0#1_In_3|, ~front~0=v_~front~0_In_1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_2|} AuxVars[] AssignedVars[~element~0, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#t~mem1#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] 1118#[L53, L65-4, L100-4]don't care [541] L53-->L57: Formula: (and (= (+ v_~front~0_49 1) v_~front~0_48) (= (+ v_~element~0_16 v_~sum~0_18) v_~sum~0_17) (= (ite (= (ite (< v_~front~0_48 v_~back~0_90) 1 0) 0) 0 1) |v_thread1Thread1of1ForFork1_~cond~0#1_25|)) InVars {~sum~0=v_~sum~0_18, ~element~0=v_~element~0_16, ~back~0=v_~back~0_90, ~front~0=v_~front~0_49} OutVars{~sum~0=v_~sum~0_17, thread1Thread1of1ForFork1_#t~post2#1=|v_thread1Thread1of1ForFork1_#t~post2#1_15|, ~element~0=v_~element~0_16, ~back~0=v_~back~0_90, thread1Thread1of1ForFork1_~cond~0#1=|v_thread1Thread1of1ForFork1_~cond~0#1_25|, ~front~0=v_~front~0_48} AuxVars[] AssignedVars[~sum~0, thread1Thread1of1ForFork1_#t~post2#1, thread1Thread1of1ForFork1_~cond~0#1, ~front~0] 1122#[L57, L65-4, L100-4]don't care [2022-07-22 12:21:31,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:21:31,720 INFO L85 PathProgramCache]: Analyzing trace with hash 360284178, now seen corresponding path program 2 times [2022-07-22 12:21:31,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:21:31,720 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313162272] [2022-07-22 12:21:31,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:21:31,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:21:31,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:21:31,795 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:21:31,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:21:31,829 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:21:31,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:21:31,829 INFO L85 PathProgramCache]: Analyzing trace with hash 19234, now seen corresponding path program 4 times [2022-07-22 12:21:31,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:21:31,830 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347922309] [2022-07-22 12:21:31,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:21:31,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:21:31,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:21:31,837 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:21:31,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:21:31,844 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:21:31,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:21:31,845 INFO L85 PathProgramCache]: Analyzing trace with hash -1659237645, now seen corresponding path program 2 times [2022-07-22 12:21:31,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:21:31,845 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920093970] [2022-07-22 12:21:31,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:21:31,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:21:31,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:21:31,884 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:21:31,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:21:31,921 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:21:34,051 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:21:34,051 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:21:34,051 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:21:34,051 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:21:34,051 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 12:21:34,051 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:21:34,051 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:21:34,051 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:21:34,051 INFO L133 ssoRankerPreferences]: Filename of dumped script: popl20-channel-sum.wvr.c_BEv2_Iteration6_Lasso [2022-07-22 12:21:34,052 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:21:34,052 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:21:34,067 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:21:34,069 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:21:34,070 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:21:34,072 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:21:34,074 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:21:34,075 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:21:34,077 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:21:34,078 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:21:34,080 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:21:34,082 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:21:34,084 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:21:34,086 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:21:34,088 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:21:34,090 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:21:34,091 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:21:34,094 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:21:34,095 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:21:34,097 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:21:34,100 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:21:34,104 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:21:34,108 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:21:34,111 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:21:34,114 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:21:34,116 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:21:34,118 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:21:34,120 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:21:34,122 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:21:34,124 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:21:34,125 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:21:34,126 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:21:34,130 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:21:34,132 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:21:34,133 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:21:34,140 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:21:34,142 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:21:34,455 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:109) at de.uni_freiburg.informatik.ultimate.lassoranker.variables.LassoBuilder.applyPreprocessor(LassoBuilder.java:154) at de.uni_freiburg.informatik.ultimate.lassoranker.variables.LassoBuilder.preprocess(LassoBuilder.java:262) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.preprocess(LassoAnalysis.java:280) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.(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:21:34,461 INFO L158 Benchmark]: Toolchain (without parser) took 17552.56ms. Allocated memory was 151.0MB in the beginning and 241.2MB in the end (delta: 90.2MB). Free memory was 125.6MB in the beginning and 151.7MB in the end (delta: -26.1MB). Peak memory consumption was 139.8MB. Max. memory is 8.0GB. [2022-07-22 12:21:34,461 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 151.0MB. Free memory is still 122.7MB. There was no memory consumed. Max. memory is 8.0GB. [2022-07-22 12:21:34,462 INFO L158 Benchmark]: CACSL2BoogieTranslator took 293.76ms. Allocated memory is still 151.0MB. Free memory was 125.4MB in the beginning and 114.5MB in the end (delta: 10.9MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-07-22 12:21:34,462 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.82ms. Allocated memory is still 151.0MB. Free memory was 114.3MB in the beginning and 112.3MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-07-22 12:21:34,463 INFO L158 Benchmark]: Boogie Preprocessor took 36.35ms. Allocated memory is still 151.0MB. Free memory was 112.3MB in the beginning and 110.9MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-07-22 12:21:34,463 INFO L158 Benchmark]: RCFGBuilder took 684.44ms. Allocated memory is still 151.0MB. Free memory was 110.9MB in the beginning and 128.6MB in the end (delta: -17.7MB). Peak memory consumption was 18.7MB. Max. memory is 8.0GB. [2022-07-22 12:21:34,464 INFO L158 Benchmark]: BuchiAutomizer took 16479.66ms. Allocated memory was 151.0MB in the beginning and 241.2MB in the end (delta: 90.2MB). Free memory was 128.6MB in the beginning and 151.7MB in the end (delta: -23.1MB). Peak memory consumption was 142.0MB. Max. memory is 8.0GB. [2022-07-22 12:21:34,466 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.22ms. Allocated memory is still 151.0MB. Free memory is still 122.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 293.76ms. Allocated memory is still 151.0MB. Free memory was 125.4MB in the beginning and 114.5MB in the end (delta: 10.9MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 48.82ms. Allocated memory is still 151.0MB. Free memory was 114.3MB in the beginning and 112.3MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 36.35ms. Allocated memory is still 151.0MB. Free memory was 112.3MB in the beginning and 110.9MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 684.44ms. Allocated memory is still 151.0MB. Free memory was 110.9MB in the beginning and 128.6MB in the end (delta: -17.7MB). Peak memory consumption was 18.7MB. Max. memory is 8.0GB. * BuchiAutomizer took 16479.66ms. Allocated memory was 151.0MB in the beginning and 241.2MB in the end (delta: 90.2MB). Free memory was 128.6MB in the beginning and 151.7MB in the end (delta: -23.1MB). Peak memory consumption was 142.0MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.4s, 132 PlacesBefore, 22 PlacesAfterwards, 136 TransitionsBefore, 18 TransitionsAfterwards, 1292 CoEnabledTransitionPairs, 8 FixpointIterations, 80 TrivialSequentialCompositions, 34 ConcurrentSequentialCompositions, 17 TrivialYvCompositions, 11 ConcurrentYvCompositions, 8 ChoiceCompositions, 150 TotalNumberOfCompositions, 1475 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1369, positive: 1343, positive conditional: 0, positive unconditional: 1343, negative: 26, negative conditional: 0, negative unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 933, positive: 920, positive conditional: 0, positive unconditional: 920, negative: 13, negative conditional: 0, negative unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 933, positive: 920, positive conditional: 0, positive unconditional: 920, negative: 13, negative conditional: 0, negative unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 13, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 13, negative conditional: 0, negative unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 72, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 72, negative conditional: 0, negative unconditional: 72, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1369, positive: 423, positive conditional: 0, positive unconditional: 423, negative: 13, negative conditional: 0, negative unconditional: 13, unknown: 933, unknown conditional: 0, unknown unconditional: 933] , Statistics on independence cache: Total cache size (in pairs): 35, Positive cache size: 32, Positive conditional cache size: 0, Positive unconditional cache size: 32, Negative cache size: 3, Negative conditional cache size: 0, Negative unconditional cache size: 3 - 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:21:34,511 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2022-07-22 12:21:34,718 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request...