/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-syntacticLbe.epf -i ../../../trunk/examples/svcomp/pthread-atomic/szymanski-b.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-21b0908 [2022-07-22 12:34:02,310 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-22 12:34:02,314 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-22 12:34:02,369 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-22 12:34:02,370 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-22 12:34:02,372 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-22 12:34:02,379 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-22 12:34:02,384 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-22 12:34:02,387 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-22 12:34:02,392 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-22 12:34:02,394 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-22 12:34:02,396 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-22 12:34:02,397 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-22 12:34:02,400 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-22 12:34:02,401 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-22 12:34:02,407 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-22 12:34:02,408 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-22 12:34:02,409 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-22 12:34:02,411 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-22 12:34:02,429 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-22 12:34:02,434 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-22 12:34:02,436 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-22 12:34:02,437 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-22 12:34:02,439 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-22 12:34:02,439 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-22 12:34:02,443 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-22 12:34:02,443 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-22 12:34:02,443 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-22 12:34:02,444 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-22 12:34:02,445 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-22 12:34:02,446 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-22 12:34:02,446 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-22 12:34:02,447 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-22 12:34:02,447 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-22 12:34:02,448 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-22 12:34:02,449 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-22 12:34:02,450 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-22 12:34:02,450 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-22 12:34:02,451 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-22 12:34:02,451 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-22 12:34:02,452 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-22 12:34:02,454 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-22 12:34:02,455 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/buchiAutomizer/concurrent-automaton-syntacticLbe.epf [2022-07-22 12:34:02,484 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-22 12:34:02,484 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-22 12:34:02,485 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-22 12:34:02,485 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-22 12:34:02,486 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-22 12:34:02,487 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-22 12:34:02,487 INFO L138 SettingsManager]: * Use SBE=true [2022-07-22 12:34:02,487 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-07-22 12:34:02,487 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-07-22 12:34:02,488 INFO L138 SettingsManager]: * Use old map elimination=false [2022-07-22 12:34:02,488 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-07-22 12:34:02,488 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-07-22 12:34:02,489 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-07-22 12:34:02,489 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-22 12:34:02,489 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-22 12:34:02,489 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-22 12:34:02,490 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-22 12:34:02,490 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-22 12:34:02,490 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-22 12:34:02,490 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-07-22 12:34:02,491 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-07-22 12:34:02,491 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-07-22 12:34:02,491 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-22 12:34:02,491 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-22 12:34:02,491 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-07-22 12:34:02,492 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-22 12:34:02,492 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-07-22 12:34:02,492 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-22 12:34:02,492 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-22 12:34:02,492 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-22 12:34:02,493 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-22 12:34:02,493 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-07-22 12:34:02,494 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-07-22 12:34:02,494 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:34:02,879 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-22 12:34:02,908 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-22 12:34:02,912 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-22 12:34:02,913 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-22 12:34:02,914 INFO L275 PluginConnector]: CDTParser initialized [2022-07-22 12:34:02,915 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-atomic/szymanski-b.i [2022-07-22 12:34:03,007 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/579218b0a/8289dc710a6847febc3a94268840fd35/FLAGae4f49bc1 [2022-07-22 12:34:03,749 INFO L306 CDTParser]: Found 1 translation units. [2022-07-22 12:34:03,750 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-atomic/szymanski-b.i [2022-07-22 12:34:03,766 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/579218b0a/8289dc710a6847febc3a94268840fd35/FLAGae4f49bc1 [2022-07-22 12:34:03,982 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/579218b0a/8289dc710a6847febc3a94268840fd35 [2022-07-22 12:34:03,985 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-22 12:34:03,992 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-07-22 12:34:03,996 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-22 12:34:03,996 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-22 12:34:04,006 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-22 12:34:04,008 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 12:34:03" (1/1) ... [2022-07-22 12:34:04,009 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a6b5102 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:34:04, skipping insertion in model container [2022-07-22 12:34:04,012 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 12:34:03" (1/1) ... [2022-07-22 12:34:04,024 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-22 12:34:04,092 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-22 12:34:04,604 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-atomic/szymanski-b.i[30088,30101] [2022-07-22 12:34:04,611 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-atomic/szymanski-b.i[30375,30388] [2022-07-22 12:34:04,620 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 12:34:04,632 INFO L203 MainTranslator]: Completed pre-run [2022-07-22 12:34:04,695 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-atomic/szymanski-b.i[30088,30101] [2022-07-22 12:34:04,700 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-atomic/szymanski-b.i[30375,30388] [2022-07-22 12:34:04,705 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 12:34:04,766 INFO L208 MainTranslator]: Completed translation [2022-07-22 12:34:04,767 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:34:04 WrapperNode [2022-07-22 12:34:04,767 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-22 12:34:04,768 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-22 12:34:04,768 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-22 12:34:04,769 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-22 12:34:04,777 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:34:04" (1/1) ... [2022-07-22 12:34:04,814 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:34:04" (1/1) ... [2022-07-22 12:34:04,843 INFO L137 Inliner]: procedures = 167, calls = 18, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 42 [2022-07-22 12:34:04,844 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-22 12:34:04,845 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-22 12:34:04,845 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-22 12:34:04,845 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-22 12:34:04,854 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:34:04" (1/1) ... [2022-07-22 12:34:04,854 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:34:04" (1/1) ... [2022-07-22 12:34:04,864 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:34:04" (1/1) ... [2022-07-22 12:34:04,864 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:34:04" (1/1) ... [2022-07-22 12:34:04,886 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:34:04" (1/1) ... [2022-07-22 12:34:04,893 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:34:04" (1/1) ... [2022-07-22 12:34:04,897 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:34:04" (1/1) ... [2022-07-22 12:34:04,909 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-22 12:34:04,911 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-22 12:34:04,914 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-22 12:34:04,914 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-22 12:34:04,915 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:34:04" (1/1) ... [2022-07-22 12:34:04,924 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:34:04,937 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:34:04,957 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:34:04,978 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:34:05,025 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-22 12:34:05,025 INFO L130 BoogieDeclarations]: Found specification of procedure thr2 [2022-07-22 12:34:05,026 INFO L138 BoogieDeclarations]: Found implementation of procedure thr2 [2022-07-22 12:34:05,026 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2022-07-22 12:34:05,028 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2022-07-22 12:34:05,028 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-22 12:34:05,028 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-22 12:34:05,028 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-22 12:34:05,028 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-22 12:34:05,028 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-22 12:34:05,029 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-22 12:34:05,029 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-22 12:34:05,030 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:34:05,209 INFO L234 CfgBuilder]: Building ICFG [2022-07-22 12:34:05,215 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-22 12:34:05,472 INFO L275 CfgBuilder]: Performing block encoding [2022-07-22 12:34:05,480 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-22 12:34:05,481 INFO L299 CfgBuilder]: Removed 8 assume(true) statements. [2022-07-22 12:34:05,483 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 12:34:05 BoogieIcfgContainer [2022-07-22 12:34:05,484 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-22 12:34:05,485 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-07-22 12:34:05,485 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-07-22 12:34:05,489 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-07-22 12:34:05,490 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-22 12:34:05,491 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.07 12:34:03" (1/3) ... [2022-07-22 12:34:05,492 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6a564fd9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.07 12:34:05, skipping insertion in model container [2022-07-22 12:34:05,492 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-22 12:34:05,492 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:34:04" (2/3) ... [2022-07-22 12:34:05,493 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6a564fd9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.07 12:34:05, skipping insertion in model container [2022-07-22 12:34:05,493 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-22 12:34:05,493 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 12:34:05" (3/3) ... [2022-07-22 12:34:05,495 INFO L322 chiAutomizerObserver]: Analyzing ICFG szymanski-b.i [2022-07-22 12:34:05,579 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-07-22 12:34:05,616 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 86 places, 101 transitions, 218 flow [2022-07-22 12:34:05,662 INFO L129 PetriNetUnfolder]: 20/97 cut-off events. [2022-07-22 12:34:05,662 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-07-22 12:34:05,671 INFO L84 FinitePrefix]: Finished finitePrefix Result has 106 conditions, 97 events. 20/97 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 100 event pairs, 0 based on Foata normal form. 0/77 useless extension candidates. Maximal degree in co-relation 65. Up to 3 conditions per place. [2022-07-22 12:34:05,671 INFO L82 GeneralOperation]: Start removeDead. Operand has 86 places, 101 transitions, 218 flow [2022-07-22 12:34:05,686 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 84 places, 97 transitions, 206 flow [2022-07-22 12:34:05,690 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-07-22 12:34:05,703 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 84 places, 97 transitions, 206 flow [2022-07-22 12:34:05,707 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 84 places, 97 transitions, 206 flow [2022-07-22 12:34:05,708 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 84 places, 97 transitions, 206 flow [2022-07-22 12:34:05,753 INFO L129 PetriNetUnfolder]: 20/97 cut-off events. [2022-07-22 12:34:05,753 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-07-22 12:34:05,757 INFO L84 FinitePrefix]: Finished finitePrefix Result has 106 conditions, 97 events. 20/97 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 95 event pairs, 0 based on Foata normal form. 0/77 useless extension candidates. Maximal degree in co-relation 65. Up to 3 conditions per place. [2022-07-22 12:34:05,760 INFO L116 LiptonReduction]: Number of co-enabled transitions 2268 [2022-07-22 12:34:07,715 INFO L131 LiptonReduction]: Checked pairs total: 6115 [2022-07-22 12:34:07,715 INFO L133 LiptonReduction]: Total number of compositions: 56 [2022-07-22 12:34:07,736 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2022-07-22 12:34:07,736 INFO L301 stractBuchiCegarLoop]: Hoare is false [2022-07-22 12:34:07,736 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-07-22 12:34:07,736 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-07-22 12:34:07,736 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-07-22 12:34:07,737 INFO L305 stractBuchiCegarLoop]: Difference is false [2022-07-22 12:34:07,737 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-07-22 12:34:07,737 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-07-22 12:34:07,739 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 0 states, but on-demand construction may add more states [2022-07-22 12:34:07,887 INFO L131 ngComponentsAnalysis]: Automaton has 192 accepting balls. 192 [2022-07-22 12:34:07,888 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:34:07,888 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:34:07,894 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2022-07-22 12:34:07,894 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-22 12:34:07,895 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-07-22 12:34:07,895 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 393 states, but on-demand construction may add more states [2022-07-22 12:34:07,911 INFO L131 ngComponentsAnalysis]: Automaton has 192 accepting balls. 192 [2022-07-22 12:34:07,912 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:34:07,912 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:34:07,912 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2022-07-22 12:34:07,912 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-22 12:34:07,918 INFO L748 eck$LassoCheckResult]: Stem: 89#[ULTIMATE.startENTRY]don't care [401] ULTIMATE.startENTRY-->L720-2: Formula: (let ((.cse1 (store |v_#valid_91| |v_ULTIMATE.start_main_~#t1~0#1.base_39| 1)) (.cse0 (select |v_#memory_int_46| 1))) (and (= (select |v_#valid_91| |v_ULTIMATE.start_main_~#t1~0#1.base_39|) 0) (= 48 (select .cse0 0)) (= (select |v_#valid_91| 0) 0) (= |v_#length_55| (store (store |v_#length_56| |v_ULTIMATE.start_main_~#t1~0#1.base_39| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_41| 4)) (= |v_#memory_int_45| (store |v_#memory_int_46| |v_ULTIMATE.start_main_~#t1~0#1.base_39| (store (select |v_#memory_int_46| |v_ULTIMATE.start_main_~#t1~0#1.base_39|) |v_ULTIMATE.start_main_~#t1~0#1.offset_33| |v_ULTIMATE.start_main_#t~pre3#1_25|))) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_33| 0) (= v_~flag1~0_37 0) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t2~0#1.base_41|) (= (select |v_#valid_91| 1) 1) (= 2 (select |v_#length_56| 1)) (= v_~flag2~0_37 0) (= |v_#pthreadsForks_36| |v_ULTIMATE.start_main_#t~pre3#1_25|) (<= (+ 4 |v_ULTIMATE.start_main_~#t1~0#1.offset_33|) (select |v_#length_55| |v_ULTIMATE.start_main_~#t1~0#1.base_39|)) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_33|) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t1~0#1.base_39|) (= v_~x~0_24 0) (= (store .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_41| 1) |v_#valid_90|) (= |v_#NULL.offset_8| 0) (= (select |v_#length_56| 2) 12) (= (select .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_41|) 0) (< 0 |v_#StackHeapBarrier_18|) (= |v_#NULL.base_8| 0) (= |v_#pthreadsForks_35| (+ |v_#pthreadsForks_36| 1)) (= (select |v_#valid_91| 2) 1) (= (select .cse0 1) 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #pthreadsForks=|v_#pthreadsForks_36|, #valid=|v_#valid_91|, #memory_int=|v_#memory_int_46|, #length=|v_#length_56|} OutVars{ULTIMATE.start_main_#t~nondet4#1=|v_ULTIMATE.start_main_#t~nondet4#1_17|, ULTIMATE.start_main_#t~mem8#1=|v_ULTIMATE.start_main_#t~mem8#1_22|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_33|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_22|, ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_15|, #NULL.offset=|v_#NULL.offset_8|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_39|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_33|, #NULL.base=|v_#NULL.base_8|, ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_25|, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ULTIMATE.start_main_#t~mem7#1=|v_ULTIMATE.start_main_#t~mem7#1_20|, #pthreadsForks=|v_#pthreadsForks_35|, ~flag2~0=v_~flag2~0_37, #valid=|v_#valid_90|, #memory_int=|v_#memory_int_45|, ~flag1~0=v_~flag1~0_37, #length=|v_#length_55|, ~x~0=v_~x~0_24, ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_25|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_41|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet4#1, ULTIMATE.start_main_#t~mem8#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_#res#1, ULTIMATE.start_main_#t~nondet6#1, #NULL.offset, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t1~0#1.offset, #NULL.base, ULTIMATE.start_main_#t~pre5#1, ULTIMATE.start_main_#t~mem7#1, #pthreadsForks, ~flag2~0, #valid, #memory_int, ~flag1~0, #length, ~x~0, ULTIMATE.start_main_#t~pre3#1, ULTIMATE.start_main_~#t2~0#1.base] 92#[L720-2]don't care [340] L720-2-->thr1ENTRY: Formula: (and (= 0 |v_thr1Thread1of1ForFork0_#in~_.base_4|) (= |v_thr1Thread1of1ForFork0_#in~_.offset_4| 0) (= v_thr1Thread1of1ForFork0_thidvar1_2 0) (= |v_ULTIMATE.start_main_#t~pre3#1_6| v_thr1Thread1of1ForFork0_thidvar0_2)) InVars {ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_6|} OutVars{thr1Thread1of1ForFork0_~_.base=v_thr1Thread1of1ForFork0_~_.base_4, thr1Thread1of1ForFork0_#in~_.offset=|v_thr1Thread1of1ForFork0_#in~_.offset_4|, thr1Thread1of1ForFork0_#res.base=|v_thr1Thread1of1ForFork0_#res.base_4|, thr1Thread1of1ForFork0_thidvar0=v_thr1Thread1of1ForFork0_thidvar0_2, thr1Thread1of1ForFork0_thidvar1=v_thr1Thread1of1ForFork0_thidvar1_2, thr1Thread1of1ForFork0_#in~_.base=|v_thr1Thread1of1ForFork0_#in~_.base_4|, thr1Thread1of1ForFork0_#res.offset=|v_thr1Thread1of1ForFork0_#res.offset_4|, ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_6|, thr1Thread1of1ForFork0_~_.offset=v_thr1Thread1of1ForFork0_~_.offset_4} AuxVars[] AssignedVars[thr1Thread1of1ForFork0_~_.base, thr1Thread1of1ForFork0_#in~_.offset, thr1Thread1of1ForFork0_#res.base, thr1Thread1of1ForFork0_thidvar0, thr1Thread1of1ForFork0_thidvar1, thr1Thread1of1ForFork0_#in~_.base, thr1Thread1of1ForFork0_#res.offset, thr1Thread1of1ForFork0_~_.offset] 94#[L720-3, thr1ENTRY]don't care [362] thr1ENTRY-->L688-2: Formula: (and (= v_thr1Thread1of1ForFork0_~_.base_5 |v_thr1Thread1of1ForFork0_#in~_.base_5|) (= |v_thr1Thread1of1ForFork0_#in~_.offset_5| v_thr1Thread1of1ForFork0_~_.offset_5) (= v_~flag1~0_23 1)) InVars {thr1Thread1of1ForFork0_#in~_.offset=|v_thr1Thread1of1ForFork0_#in~_.offset_5|, thr1Thread1of1ForFork0_#in~_.base=|v_thr1Thread1of1ForFork0_#in~_.base_5|} OutVars{thr1Thread1of1ForFork0_~_.base=v_thr1Thread1of1ForFork0_~_.base_5, thr1Thread1of1ForFork0_#in~_.offset=|v_thr1Thread1of1ForFork0_#in~_.offset_5|, ~flag1~0=v_~flag1~0_23, thr1Thread1of1ForFork0_#in~_.base=|v_thr1Thread1of1ForFork0_#in~_.base_5|, thr1Thread1of1ForFork0_~_.offset=v_thr1Thread1of1ForFork0_~_.offset_5} AuxVars[] AssignedVars[thr1Thread1of1ForFork0_~_.base, ~flag1~0, thr1Thread1of1ForFork0_~_.offset] 96#[L720-3, L688-2]don't care [2022-07-22 12:34:07,919 INFO L750 eck$LassoCheckResult]: Loop: 96#[L720-3, L688-2]don't care [315] L688-2-->L688-2: Formula: (<= 3 v_~flag2~0_9) InVars {~flag2~0=v_~flag2~0_9} OutVars{~flag2~0=v_~flag2~0_9} AuxVars[] AssignedVars[] 96#[L720-3, L688-2]don't care [2022-07-22 12:34:07,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:34:07,926 INFO L85 PathProgramCache]: Analyzing trace with hash 426054, now seen corresponding path program 1 times [2022-07-22 12:34:07,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:34:07,937 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8456114] [2022-07-22 12:34:07,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:34:07,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:34:08,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:34:08,072 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:34:08,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:34:08,113 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:34:08,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:34:08,116 INFO L85 PathProgramCache]: Analyzing trace with hash 346, now seen corresponding path program 1 times [2022-07-22 12:34:08,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:34:08,117 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937891733] [2022-07-22 12:34:08,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:34:08,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:34:08,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:34:08,129 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:34:08,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:34:08,135 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:34:08,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:34:08,137 INFO L85 PathProgramCache]: Analyzing trace with hash 13207989, now seen corresponding path program 1 times [2022-07-22 12:34:08,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:34:08,138 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778055425] [2022-07-22 12:34:08,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:34:08,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:34:08,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:34:08,229 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:34:08,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 12:34:08,230 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778055425] [2022-07-22 12:34:08,230 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [778055425] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 12:34:08,231 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 12:34:08,231 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-07-22 12:34:08,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603909563] [2022-07-22 12:34:08,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 12:34:08,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 12:34:08,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 12:34:08,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 12:34:08,298 INFO L87 Difference]: Start difference. First operand currently 393 states, but on-demand construction may add more states Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:34:08,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 12:34:08,448 INFO L93 Difference]: Finished difference Result 386 states and 1129 transitions. [2022-07-22 12:34:08,452 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 386 states and 1129 transitions. [2022-07-22 12:34:08,469 INFO L131 ngComponentsAnalysis]: Automaton has 170 accepting balls. 170 [2022-07-22 12:34:08,496 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 386 states to 354 states and 1056 transitions. [2022-07-22 12:34:08,504 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 354 [2022-07-22 12:34:08,510 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 354 [2022-07-22 12:34:08,510 INFO L73 IsDeterministic]: Start isDeterministic. Operand 354 states and 1056 transitions. [2022-07-22 12:34:08,517 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 12:34:08,517 INFO L220 hiAutomatonCegarLoop]: Abstraction has 354 states and 1056 transitions. [2022-07-22 12:34:08,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states and 1056 transitions. [2022-07-22 12:34:08,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 354. [2022-07-22 12:34:08,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 354 states, 354 states have (on average 2.983050847457627) internal successors, (1056), 353 states have internal predecessors, (1056), 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:34:08,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 1056 transitions. [2022-07-22 12:34:08,593 INFO L242 hiAutomatonCegarLoop]: Abstraction has 354 states and 1056 transitions. [2022-07-22 12:34:08,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 12:34:08,599 INFO L425 stractBuchiCegarLoop]: Abstraction has 354 states and 1056 transitions. [2022-07-22 12:34:08,599 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-07-22 12:34:08,599 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 354 states and 1056 transitions. [2022-07-22 12:34:08,607 INFO L131 ngComponentsAnalysis]: Automaton has 170 accepting balls. 170 [2022-07-22 12:34:08,608 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:34:08,608 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:34:08,608 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-07-22 12:34:08,608 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-22 12:34:08,609 INFO L748 eck$LassoCheckResult]: Stem: 1978#[ULTIMATE.startENTRY]don't care [401] ULTIMATE.startENTRY-->L720-2: Formula: (let ((.cse1 (store |v_#valid_91| |v_ULTIMATE.start_main_~#t1~0#1.base_39| 1)) (.cse0 (select |v_#memory_int_46| 1))) (and (= (select |v_#valid_91| |v_ULTIMATE.start_main_~#t1~0#1.base_39|) 0) (= 48 (select .cse0 0)) (= (select |v_#valid_91| 0) 0) (= |v_#length_55| (store (store |v_#length_56| |v_ULTIMATE.start_main_~#t1~0#1.base_39| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_41| 4)) (= |v_#memory_int_45| (store |v_#memory_int_46| |v_ULTIMATE.start_main_~#t1~0#1.base_39| (store (select |v_#memory_int_46| |v_ULTIMATE.start_main_~#t1~0#1.base_39|) |v_ULTIMATE.start_main_~#t1~0#1.offset_33| |v_ULTIMATE.start_main_#t~pre3#1_25|))) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_33| 0) (= v_~flag1~0_37 0) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t2~0#1.base_41|) (= (select |v_#valid_91| 1) 1) (= 2 (select |v_#length_56| 1)) (= v_~flag2~0_37 0) (= |v_#pthreadsForks_36| |v_ULTIMATE.start_main_#t~pre3#1_25|) (<= (+ 4 |v_ULTIMATE.start_main_~#t1~0#1.offset_33|) (select |v_#length_55| |v_ULTIMATE.start_main_~#t1~0#1.base_39|)) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_33|) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t1~0#1.base_39|) (= v_~x~0_24 0) (= (store .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_41| 1) |v_#valid_90|) (= |v_#NULL.offset_8| 0) (= (select |v_#length_56| 2) 12) (= (select .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_41|) 0) (< 0 |v_#StackHeapBarrier_18|) (= |v_#NULL.base_8| 0) (= |v_#pthreadsForks_35| (+ |v_#pthreadsForks_36| 1)) (= (select |v_#valid_91| 2) 1) (= (select .cse0 1) 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #pthreadsForks=|v_#pthreadsForks_36|, #valid=|v_#valid_91|, #memory_int=|v_#memory_int_46|, #length=|v_#length_56|} OutVars{ULTIMATE.start_main_#t~nondet4#1=|v_ULTIMATE.start_main_#t~nondet4#1_17|, ULTIMATE.start_main_#t~mem8#1=|v_ULTIMATE.start_main_#t~mem8#1_22|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_33|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_22|, ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_15|, #NULL.offset=|v_#NULL.offset_8|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_39|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_33|, #NULL.base=|v_#NULL.base_8|, ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_25|, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ULTIMATE.start_main_#t~mem7#1=|v_ULTIMATE.start_main_#t~mem7#1_20|, #pthreadsForks=|v_#pthreadsForks_35|, ~flag2~0=v_~flag2~0_37, #valid=|v_#valid_90|, #memory_int=|v_#memory_int_45|, ~flag1~0=v_~flag1~0_37, #length=|v_#length_55|, ~x~0=v_~x~0_24, ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_25|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_41|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet4#1, ULTIMATE.start_main_#t~mem8#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_#res#1, ULTIMATE.start_main_#t~nondet6#1, #NULL.offset, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t1~0#1.offset, #NULL.base, ULTIMATE.start_main_#t~pre5#1, ULTIMATE.start_main_#t~mem7#1, #pthreadsForks, ~flag2~0, #valid, #memory_int, ~flag1~0, #length, ~x~0, ULTIMATE.start_main_#t~pre3#1, ULTIMATE.start_main_~#t2~0#1.base] 1976#[L720-2]don't care [340] L720-2-->thr1ENTRY: Formula: (and (= 0 |v_thr1Thread1of1ForFork0_#in~_.base_4|) (= |v_thr1Thread1of1ForFork0_#in~_.offset_4| 0) (= v_thr1Thread1of1ForFork0_thidvar1_2 0) (= |v_ULTIMATE.start_main_#t~pre3#1_6| v_thr1Thread1of1ForFork0_thidvar0_2)) InVars {ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_6|} OutVars{thr1Thread1of1ForFork0_~_.base=v_thr1Thread1of1ForFork0_~_.base_4, thr1Thread1of1ForFork0_#in~_.offset=|v_thr1Thread1of1ForFork0_#in~_.offset_4|, thr1Thread1of1ForFork0_#res.base=|v_thr1Thread1of1ForFork0_#res.base_4|, thr1Thread1of1ForFork0_thidvar0=v_thr1Thread1of1ForFork0_thidvar0_2, thr1Thread1of1ForFork0_thidvar1=v_thr1Thread1of1ForFork0_thidvar1_2, thr1Thread1of1ForFork0_#in~_.base=|v_thr1Thread1of1ForFork0_#in~_.base_4|, thr1Thread1of1ForFork0_#res.offset=|v_thr1Thread1of1ForFork0_#res.offset_4|, ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_6|, thr1Thread1of1ForFork0_~_.offset=v_thr1Thread1of1ForFork0_~_.offset_4} AuxVars[] AssignedVars[thr1Thread1of1ForFork0_~_.base, thr1Thread1of1ForFork0_#in~_.offset, thr1Thread1of1ForFork0_#res.base, thr1Thread1of1ForFork0_thidvar0, thr1Thread1of1ForFork0_thidvar1, thr1Thread1of1ForFork0_#in~_.base, thr1Thread1of1ForFork0_#res.offset, thr1Thread1of1ForFork0_~_.offset] 1846#[L720-3, thr1ENTRY]don't care [397] L720-3-->L721-3: Formula: (and (= (select |v_#valid_74| |v_ULTIMATE.start_main_~#t2~0#1.base_29|) 1) (<= (+ |v_ULTIMATE.start_main_~#t2~0#1.offset_25| 4) (select |v_#length_49| |v_ULTIMATE.start_main_~#t2~0#1.base_29|)) (= (store |v_#memory_int_38| |v_ULTIMATE.start_main_~#t2~0#1.base_29| (store (select |v_#memory_int_38| |v_ULTIMATE.start_main_~#t2~0#1.base_29|) |v_ULTIMATE.start_main_~#t2~0#1.offset_25| |v_ULTIMATE.start_main_#t~pre5#1_21|)) |v_#memory_int_37|) (= (+ |v_#pthreadsForks_28| 1) |v_#pthreadsForks_27|) (<= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_25|) (= |v_#pthreadsForks_28| |v_ULTIMATE.start_main_#t~pre5#1_21|)) InVars {#pthreadsForks=|v_#pthreadsForks_28|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_25|, #valid=|v_#valid_74|, #memory_int=|v_#memory_int_38|, #length=|v_#length_49|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_29|} OutVars{ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_21|, ULTIMATE.start_main_#t~nondet4#1=|v_ULTIMATE.start_main_#t~nondet4#1_13|, #pthreadsForks=|v_#pthreadsForks_27|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_25|, #valid=|v_#valid_74|, #memory_int=|v_#memory_int_37|, #length=|v_#length_49|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_29|, ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_21|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre5#1, ULTIMATE.start_main_#t~nondet4#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre3#1] 1362#[thr1ENTRY, L721-3]don't care [343] L721-3-->thr2ENTRY: Formula: (and (= v_thr2Thread1of1ForFork1_thidvar2_2 0) (= |v_thr2Thread1of1ForFork1_#in~_.base_4| 0) (= |v_thr2Thread1of1ForFork1_#in~_.offset_4| 0) (= v_thr2Thread1of1ForFork1_thidvar1_2 0) (= |v_ULTIMATE.start_main_#t~pre5#1_6| v_thr2Thread1of1ForFork1_thidvar0_2)) InVars {ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_6|} OutVars{ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_6|, thr2Thread1of1ForFork1_thidvar0=v_thr2Thread1of1ForFork1_thidvar0_2, thr2Thread1of1ForFork1_thidvar1=v_thr2Thread1of1ForFork1_thidvar1_2, thr2Thread1of1ForFork1_thidvar2=v_thr2Thread1of1ForFork1_thidvar2_2, thr2Thread1of1ForFork1_~_.offset=v_thr2Thread1of1ForFork1_~_.offset_4, thr2Thread1of1ForFork1_#res.base=|v_thr2Thread1of1ForFork1_#res.base_4|, thr2Thread1of1ForFork1_#in~_.offset=|v_thr2Thread1of1ForFork1_#in~_.offset_4|, thr2Thread1of1ForFork1_#res.offset=|v_thr2Thread1of1ForFork1_#res.offset_4|, thr2Thread1of1ForFork1_#in~_.base=|v_thr2Thread1of1ForFork1_#in~_.base_4|, thr2Thread1of1ForFork1_~_.base=v_thr2Thread1of1ForFork1_~_.base_4} AuxVars[] AssignedVars[thr2Thread1of1ForFork1_thidvar0, thr2Thread1of1ForFork1_thidvar1, thr2Thread1of1ForFork1_thidvar2, thr2Thread1of1ForFork1_~_.offset, thr2Thread1of1ForFork1_#res.base, thr2Thread1of1ForFork1_#in~_.offset, thr2Thread1of1ForFork1_#res.offset, thr2Thread1of1ForFork1_#in~_.base, thr2Thread1of1ForFork1_~_.base] 1364#[thr1ENTRY, L721-4, thr2ENTRY]don't care [346] thr2ENTRY-->L704-2: Formula: (and (= v_~flag2~0_17 1) (= v_thr2Thread1of1ForFork1_~_.offset_5 |v_thr2Thread1of1ForFork1_#in~_.offset_5|) (= |v_thr2Thread1of1ForFork1_#in~_.base_5| v_thr2Thread1of1ForFork1_~_.base_5)) InVars {thr2Thread1of1ForFork1_#in~_.offset=|v_thr2Thread1of1ForFork1_#in~_.offset_5|, thr2Thread1of1ForFork1_#in~_.base=|v_thr2Thread1of1ForFork1_#in~_.base_5|} OutVars{thr2Thread1of1ForFork1_~_.offset=v_thr2Thread1of1ForFork1_~_.offset_5, thr2Thread1of1ForFork1_#in~_.offset=|v_thr2Thread1of1ForFork1_#in~_.offset_5|, ~flag2~0=v_~flag2~0_17, thr2Thread1of1ForFork1_#in~_.base=|v_thr2Thread1of1ForFork1_#in~_.base_5|, thr2Thread1of1ForFork1_~_.base=v_thr2Thread1of1ForFork1_~_.base_5} AuxVars[] AssignedVars[thr2Thread1of1ForFork1_~_.offset, ~flag2~0, thr2Thread1of1ForFork1_~_.base] 1580#[thr1ENTRY, L721-4, L704-2]don't care [2022-07-22 12:34:08,609 INFO L750 eck$LassoCheckResult]: Loop: 1580#[thr1ENTRY, L721-4, L704-2]don't care [288] L704-2-->L704-2: Formula: (<= 3 v_~flag1~0_3) InVars {~flag1~0=v_~flag1~0_3} OutVars{~flag1~0=v_~flag1~0_3} AuxVars[] AssignedVars[] 1580#[thr1ENTRY, L721-4, L704-2]don't care [2022-07-22 12:34:08,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:34:08,610 INFO L85 PathProgramCache]: Analyzing trace with hash 409482508, now seen corresponding path program 1 times [2022-07-22 12:34:08,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:34:08,611 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016691897] [2022-07-22 12:34:08,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:34:08,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:34:08,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:34:08,640 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:34:08,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:34:08,664 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:34:08,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:34:08,665 INFO L85 PathProgramCache]: Analyzing trace with hash 319, now seen corresponding path program 1 times [2022-07-22 12:34:08,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:34:08,665 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647349662] [2022-07-22 12:34:08,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:34:08,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:34:08,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:34:08,679 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:34:08,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:34:08,690 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:34:08,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:34:08,692 INFO L85 PathProgramCache]: Analyzing trace with hash -190943852, now seen corresponding path program 1 times [2022-07-22 12:34:08,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:34:08,697 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274300369] [2022-07-22 12:34:08,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:34:08,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:34:08,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:34:08,762 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:34:08,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 12:34:08,763 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274300369] [2022-07-22 12:34:08,763 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1274300369] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 12:34:08,763 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 12:34:08,763 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-07-22 12:34:08,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040990119] [2022-07-22 12:34:08,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 12:34:08,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 12:34:08,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 12:34:08,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 12:34:08,770 INFO L87 Difference]: Start difference. First operand 354 states and 1056 transitions. cyclomatic complexity: 872 Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 2 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:34:08,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 12:34:08,835 INFO L93 Difference]: Finished difference Result 350 states and 1016 transitions. [2022-07-22 12:34:08,835 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 350 states and 1016 transitions. [2022-07-22 12:34:08,854 INFO L131 ngComponentsAnalysis]: Automaton has 150 accepting balls. 150 [2022-07-22 12:34:08,864 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 350 states to 312 states and 935 transitions. [2022-07-22 12:34:08,864 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 312 [2022-07-22 12:34:08,868 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 312 [2022-07-22 12:34:08,868 INFO L73 IsDeterministic]: Start isDeterministic. Operand 312 states and 935 transitions. [2022-07-22 12:34:08,874 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 12:34:08,874 INFO L220 hiAutomatonCegarLoop]: Abstraction has 312 states and 935 transitions. [2022-07-22 12:34:08,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states and 935 transitions. [2022-07-22 12:34:08,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 312. [2022-07-22 12:34:08,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 312 states, 312 states have (on average 2.996794871794872) internal successors, (935), 311 states have internal predecessors, (935), 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:34:08,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 935 transitions. [2022-07-22 12:34:08,899 INFO L242 hiAutomatonCegarLoop]: Abstraction has 312 states and 935 transitions. [2022-07-22 12:34:08,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 12:34:08,901 INFO L425 stractBuchiCegarLoop]: Abstraction has 312 states and 935 transitions. [2022-07-22 12:34:08,901 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-07-22 12:34:08,901 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 312 states and 935 transitions. [2022-07-22 12:34:08,905 INFO L131 ngComponentsAnalysis]: Automaton has 150 accepting balls. 150 [2022-07-22 12:34:08,905 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:34:08,905 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:34:08,906 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2022-07-22 12:34:08,906 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-22 12:34:08,906 INFO L748 eck$LassoCheckResult]: Stem: 2960#[ULTIMATE.startENTRY]don't care [401] ULTIMATE.startENTRY-->L720-2: Formula: (let ((.cse1 (store |v_#valid_91| |v_ULTIMATE.start_main_~#t1~0#1.base_39| 1)) (.cse0 (select |v_#memory_int_46| 1))) (and (= (select |v_#valid_91| |v_ULTIMATE.start_main_~#t1~0#1.base_39|) 0) (= 48 (select .cse0 0)) (= (select |v_#valid_91| 0) 0) (= |v_#length_55| (store (store |v_#length_56| |v_ULTIMATE.start_main_~#t1~0#1.base_39| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_41| 4)) (= |v_#memory_int_45| (store |v_#memory_int_46| |v_ULTIMATE.start_main_~#t1~0#1.base_39| (store (select |v_#memory_int_46| |v_ULTIMATE.start_main_~#t1~0#1.base_39|) |v_ULTIMATE.start_main_~#t1~0#1.offset_33| |v_ULTIMATE.start_main_#t~pre3#1_25|))) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_33| 0) (= v_~flag1~0_37 0) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t2~0#1.base_41|) (= (select |v_#valid_91| 1) 1) (= 2 (select |v_#length_56| 1)) (= v_~flag2~0_37 0) (= |v_#pthreadsForks_36| |v_ULTIMATE.start_main_#t~pre3#1_25|) (<= (+ 4 |v_ULTIMATE.start_main_~#t1~0#1.offset_33|) (select |v_#length_55| |v_ULTIMATE.start_main_~#t1~0#1.base_39|)) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_33|) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t1~0#1.base_39|) (= v_~x~0_24 0) (= (store .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_41| 1) |v_#valid_90|) (= |v_#NULL.offset_8| 0) (= (select |v_#length_56| 2) 12) (= (select .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_41|) 0) (< 0 |v_#StackHeapBarrier_18|) (= |v_#NULL.base_8| 0) (= |v_#pthreadsForks_35| (+ |v_#pthreadsForks_36| 1)) (= (select |v_#valid_91| 2) 1) (= (select .cse0 1) 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #pthreadsForks=|v_#pthreadsForks_36|, #valid=|v_#valid_91|, #memory_int=|v_#memory_int_46|, #length=|v_#length_56|} OutVars{ULTIMATE.start_main_#t~nondet4#1=|v_ULTIMATE.start_main_#t~nondet4#1_17|, ULTIMATE.start_main_#t~mem8#1=|v_ULTIMATE.start_main_#t~mem8#1_22|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_33|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_22|, ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_15|, #NULL.offset=|v_#NULL.offset_8|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_39|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_33|, #NULL.base=|v_#NULL.base_8|, ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_25|, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ULTIMATE.start_main_#t~mem7#1=|v_ULTIMATE.start_main_#t~mem7#1_20|, #pthreadsForks=|v_#pthreadsForks_35|, ~flag2~0=v_~flag2~0_37, #valid=|v_#valid_90|, #memory_int=|v_#memory_int_45|, ~flag1~0=v_~flag1~0_37, #length=|v_#length_55|, ~x~0=v_~x~0_24, ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_25|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_41|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet4#1, ULTIMATE.start_main_#t~mem8#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_#res#1, ULTIMATE.start_main_#t~nondet6#1, #NULL.offset, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t1~0#1.offset, #NULL.base, ULTIMATE.start_main_#t~pre5#1, ULTIMATE.start_main_#t~mem7#1, #pthreadsForks, ~flag2~0, #valid, #memory_int, ~flag1~0, #length, ~x~0, ULTIMATE.start_main_#t~pre3#1, ULTIMATE.start_main_~#t2~0#1.base] 2958#[L720-2]don't care [340] L720-2-->thr1ENTRY: Formula: (and (= 0 |v_thr1Thread1of1ForFork0_#in~_.base_4|) (= |v_thr1Thread1of1ForFork0_#in~_.offset_4| 0) (= v_thr1Thread1of1ForFork0_thidvar1_2 0) (= |v_ULTIMATE.start_main_#t~pre3#1_6| v_thr1Thread1of1ForFork0_thidvar0_2)) InVars {ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_6|} OutVars{thr1Thread1of1ForFork0_~_.base=v_thr1Thread1of1ForFork0_~_.base_4, thr1Thread1of1ForFork0_#in~_.offset=|v_thr1Thread1of1ForFork0_#in~_.offset_4|, thr1Thread1of1ForFork0_#res.base=|v_thr1Thread1of1ForFork0_#res.base_4|, thr1Thread1of1ForFork0_thidvar0=v_thr1Thread1of1ForFork0_thidvar0_2, thr1Thread1of1ForFork0_thidvar1=v_thr1Thread1of1ForFork0_thidvar1_2, thr1Thread1of1ForFork0_#in~_.base=|v_thr1Thread1of1ForFork0_#in~_.base_4|, thr1Thread1of1ForFork0_#res.offset=|v_thr1Thread1of1ForFork0_#res.offset_4|, ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_6|, thr1Thread1of1ForFork0_~_.offset=v_thr1Thread1of1ForFork0_~_.offset_4} AuxVars[] AssignedVars[thr1Thread1of1ForFork0_~_.base, thr1Thread1of1ForFork0_#in~_.offset, thr1Thread1of1ForFork0_#res.base, thr1Thread1of1ForFork0_thidvar0, thr1Thread1of1ForFork0_thidvar1, thr1Thread1of1ForFork0_#in~_.base, thr1Thread1of1ForFork0_#res.offset, thr1Thread1of1ForFork0_~_.offset] 2844#[L720-3, thr1ENTRY]don't care [362] thr1ENTRY-->L688-2: Formula: (and (= v_thr1Thread1of1ForFork0_~_.base_5 |v_thr1Thread1of1ForFork0_#in~_.base_5|) (= |v_thr1Thread1of1ForFork0_#in~_.offset_5| v_thr1Thread1of1ForFork0_~_.offset_5) (= v_~flag1~0_23 1)) InVars {thr1Thread1of1ForFork0_#in~_.offset=|v_thr1Thread1of1ForFork0_#in~_.offset_5|, thr1Thread1of1ForFork0_#in~_.base=|v_thr1Thread1of1ForFork0_#in~_.base_5|} OutVars{thr1Thread1of1ForFork0_~_.base=v_thr1Thread1of1ForFork0_~_.base_5, thr1Thread1of1ForFork0_#in~_.offset=|v_thr1Thread1of1ForFork0_#in~_.offset_5|, ~flag1~0=v_~flag1~0_23, thr1Thread1of1ForFork0_#in~_.base=|v_thr1Thread1of1ForFork0_#in~_.base_5|, thr1Thread1of1ForFork0_~_.offset=v_thr1Thread1of1ForFork0_~_.offset_5} AuxVars[] AssignedVars[thr1Thread1of1ForFork0_~_.base, ~flag1~0, thr1Thread1of1ForFork0_~_.offset] 2448#[L720-3, L688-2]don't care [397] L720-3-->L721-3: Formula: (and (= (select |v_#valid_74| |v_ULTIMATE.start_main_~#t2~0#1.base_29|) 1) (<= (+ |v_ULTIMATE.start_main_~#t2~0#1.offset_25| 4) (select |v_#length_49| |v_ULTIMATE.start_main_~#t2~0#1.base_29|)) (= (store |v_#memory_int_38| |v_ULTIMATE.start_main_~#t2~0#1.base_29| (store (select |v_#memory_int_38| |v_ULTIMATE.start_main_~#t2~0#1.base_29|) |v_ULTIMATE.start_main_~#t2~0#1.offset_25| |v_ULTIMATE.start_main_#t~pre5#1_21|)) |v_#memory_int_37|) (= (+ |v_#pthreadsForks_28| 1) |v_#pthreadsForks_27|) (<= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_25|) (= |v_#pthreadsForks_28| |v_ULTIMATE.start_main_#t~pre5#1_21|)) InVars {#pthreadsForks=|v_#pthreadsForks_28|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_25|, #valid=|v_#valid_74|, #memory_int=|v_#memory_int_38|, #length=|v_#length_49|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_29|} OutVars{ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_21|, ULTIMATE.start_main_#t~nondet4#1=|v_ULTIMATE.start_main_#t~nondet4#1_13|, #pthreadsForks=|v_#pthreadsForks_27|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_25|, #valid=|v_#valid_74|, #memory_int=|v_#memory_int_37|, #length=|v_#length_49|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_29|, ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_21|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre5#1, ULTIMATE.start_main_#t~nondet4#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre3#1] 2428#[L688-2, L721-3]don't care [343] L721-3-->thr2ENTRY: Formula: (and (= v_thr2Thread1of1ForFork1_thidvar2_2 0) (= |v_thr2Thread1of1ForFork1_#in~_.base_4| 0) (= |v_thr2Thread1of1ForFork1_#in~_.offset_4| 0) (= v_thr2Thread1of1ForFork1_thidvar1_2 0) (= |v_ULTIMATE.start_main_#t~pre5#1_6| v_thr2Thread1of1ForFork1_thidvar0_2)) InVars {ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_6|} OutVars{ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_6|, thr2Thread1of1ForFork1_thidvar0=v_thr2Thread1of1ForFork1_thidvar0_2, thr2Thread1of1ForFork1_thidvar1=v_thr2Thread1of1ForFork1_thidvar1_2, thr2Thread1of1ForFork1_thidvar2=v_thr2Thread1of1ForFork1_thidvar2_2, thr2Thread1of1ForFork1_~_.offset=v_thr2Thread1of1ForFork1_~_.offset_4, thr2Thread1of1ForFork1_#res.base=|v_thr2Thread1of1ForFork1_#res.base_4|, thr2Thread1of1ForFork1_#in~_.offset=|v_thr2Thread1of1ForFork1_#in~_.offset_4|, thr2Thread1of1ForFork1_#res.offset=|v_thr2Thread1of1ForFork1_#res.offset_4|, thr2Thread1of1ForFork1_#in~_.base=|v_thr2Thread1of1ForFork1_#in~_.base_4|, thr2Thread1of1ForFork1_~_.base=v_thr2Thread1of1ForFork1_~_.base_4} AuxVars[] AssignedVars[thr2Thread1of1ForFork1_thidvar0, thr2Thread1of1ForFork1_thidvar1, thr2Thread1of1ForFork1_thidvar2, thr2Thread1of1ForFork1_~_.offset, thr2Thread1of1ForFork1_#res.base, thr2Thread1of1ForFork1_#in~_.offset, thr2Thread1of1ForFork1_#res.offset, thr2Thread1of1ForFork1_#in~_.base, thr2Thread1of1ForFork1_~_.base] 2602#[L688-2, L721-4, thr2ENTRY]don't care [346] thr2ENTRY-->L704-2: Formula: (and (= v_~flag2~0_17 1) (= v_thr2Thread1of1ForFork1_~_.offset_5 |v_thr2Thread1of1ForFork1_#in~_.offset_5|) (= |v_thr2Thread1of1ForFork1_#in~_.base_5| v_thr2Thread1of1ForFork1_~_.base_5)) InVars {thr2Thread1of1ForFork1_#in~_.offset=|v_thr2Thread1of1ForFork1_#in~_.offset_5|, thr2Thread1of1ForFork1_#in~_.base=|v_thr2Thread1of1ForFork1_#in~_.base_5|} OutVars{thr2Thread1of1ForFork1_~_.offset=v_thr2Thread1of1ForFork1_~_.offset_5, thr2Thread1of1ForFork1_#in~_.offset=|v_thr2Thread1of1ForFork1_#in~_.offset_5|, ~flag2~0=v_~flag2~0_17, thr2Thread1of1ForFork1_#in~_.base=|v_thr2Thread1of1ForFork1_#in~_.base_5|, thr2Thread1of1ForFork1_~_.base=v_thr2Thread1of1ForFork1_~_.base_5} AuxVars[] AssignedVars[thr2Thread1of1ForFork1_~_.offset, ~flag2~0, thr2Thread1of1ForFork1_~_.base] 2906#[L704-2, L688-2, L721-4]don't care [2022-07-22 12:34:08,907 INFO L750 eck$LassoCheckResult]: Loop: 2906#[L704-2, L688-2, L721-4]don't care [288] L704-2-->L704-2: Formula: (<= 3 v_~flag1~0_3) InVars {~flag1~0=v_~flag1~0_3} OutVars{~flag1~0=v_~flag1~0_3} AuxVars[] AssignedVars[] 2906#[L704-2, L688-2, L721-4]don't care [2022-07-22 12:34:08,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:34:08,908 INFO L85 PathProgramCache]: Analyzing trace with hash -191934678, now seen corresponding path program 1 times [2022-07-22 12:34:08,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:34:08,908 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911277634] [2022-07-22 12:34:08,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:34:08,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:34:08,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:34:08,941 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:34:08,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:34:08,978 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:34:08,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:34:08,979 INFO L85 PathProgramCache]: Analyzing trace with hash 319, now seen corresponding path program 2 times [2022-07-22 12:34:08,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:34:08,980 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783048629] [2022-07-22 12:34:08,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:34:08,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:34:08,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:34:08,995 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:34:08,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:34:09,002 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:34:09,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:34:09,003 INFO L85 PathProgramCache]: Analyzing trace with hash -1655007434, now seen corresponding path program 1 times [2022-07-22 12:34:09,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:34:09,003 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754782402] [2022-07-22 12:34:09,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:34:09,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:34:09,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:34:09,077 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:34:09,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 12:34:09,078 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754782402] [2022-07-22 12:34:09,078 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1754782402] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 12:34:09,079 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 12:34:09,079 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-22 12:34:09,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404371429] [2022-07-22 12:34:09,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 12:34:09,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 12:34:09,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 12:34:09,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 12:34:09,086 INFO L87 Difference]: Start difference. First operand 312 states and 935 transitions. cyclomatic complexity: 773 Second operand has 3 states, 2 states have (on average 3.5) 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:34:09,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 12:34:09,185 INFO L93 Difference]: Finished difference Result 348 states and 1021 transitions. [2022-07-22 12:34:09,185 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 348 states and 1021 transitions. [2022-07-22 12:34:09,195 INFO L131 ngComponentsAnalysis]: Automaton has 168 accepting balls. 168 [2022-07-22 12:34:09,205 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 348 states to 348 states and 1021 transitions. [2022-07-22 12:34:09,205 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 348 [2022-07-22 12:34:09,206 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 348 [2022-07-22 12:34:09,206 INFO L73 IsDeterministic]: Start isDeterministic. Operand 348 states and 1021 transitions. [2022-07-22 12:34:09,211 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 12:34:09,212 INFO L220 hiAutomatonCegarLoop]: Abstraction has 348 states and 1021 transitions. [2022-07-22 12:34:09,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states and 1021 transitions. [2022-07-22 12:34:09,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 348. [2022-07-22 12:34:09,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 348 states, 348 states have (on average 2.9339080459770117) internal successors, (1021), 347 states have internal predecessors, (1021), 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:34:09,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 1021 transitions. [2022-07-22 12:34:09,259 INFO L242 hiAutomatonCegarLoop]: Abstraction has 348 states and 1021 transitions. [2022-07-22 12:34:09,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 12:34:09,261 INFO L425 stractBuchiCegarLoop]: Abstraction has 348 states and 1021 transitions. [2022-07-22 12:34:09,261 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2022-07-22 12:34:09,261 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 348 states and 1021 transitions. [2022-07-22 12:34:09,266 INFO L131 ngComponentsAnalysis]: Automaton has 168 accepting balls. 168 [2022-07-22 12:34:09,266 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:34:09,266 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:34:09,267 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2022-07-22 12:34:09,267 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-22 12:34:09,267 INFO L748 eck$LassoCheckResult]: Stem: 3962#[ULTIMATE.startENTRY]don't care [401] ULTIMATE.startENTRY-->L720-2: Formula: (let ((.cse1 (store |v_#valid_91| |v_ULTIMATE.start_main_~#t1~0#1.base_39| 1)) (.cse0 (select |v_#memory_int_46| 1))) (and (= (select |v_#valid_91| |v_ULTIMATE.start_main_~#t1~0#1.base_39|) 0) (= 48 (select .cse0 0)) (= (select |v_#valid_91| 0) 0) (= |v_#length_55| (store (store |v_#length_56| |v_ULTIMATE.start_main_~#t1~0#1.base_39| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_41| 4)) (= |v_#memory_int_45| (store |v_#memory_int_46| |v_ULTIMATE.start_main_~#t1~0#1.base_39| (store (select |v_#memory_int_46| |v_ULTIMATE.start_main_~#t1~0#1.base_39|) |v_ULTIMATE.start_main_~#t1~0#1.offset_33| |v_ULTIMATE.start_main_#t~pre3#1_25|))) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_33| 0) (= v_~flag1~0_37 0) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t2~0#1.base_41|) (= (select |v_#valid_91| 1) 1) (= 2 (select |v_#length_56| 1)) (= v_~flag2~0_37 0) (= |v_#pthreadsForks_36| |v_ULTIMATE.start_main_#t~pre3#1_25|) (<= (+ 4 |v_ULTIMATE.start_main_~#t1~0#1.offset_33|) (select |v_#length_55| |v_ULTIMATE.start_main_~#t1~0#1.base_39|)) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_33|) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t1~0#1.base_39|) (= v_~x~0_24 0) (= (store .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_41| 1) |v_#valid_90|) (= |v_#NULL.offset_8| 0) (= (select |v_#length_56| 2) 12) (= (select .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_41|) 0) (< 0 |v_#StackHeapBarrier_18|) (= |v_#NULL.base_8| 0) (= |v_#pthreadsForks_35| (+ |v_#pthreadsForks_36| 1)) (= (select |v_#valid_91| 2) 1) (= (select .cse0 1) 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #pthreadsForks=|v_#pthreadsForks_36|, #valid=|v_#valid_91|, #memory_int=|v_#memory_int_46|, #length=|v_#length_56|} OutVars{ULTIMATE.start_main_#t~nondet4#1=|v_ULTIMATE.start_main_#t~nondet4#1_17|, ULTIMATE.start_main_#t~mem8#1=|v_ULTIMATE.start_main_#t~mem8#1_22|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_33|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_22|, ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_15|, #NULL.offset=|v_#NULL.offset_8|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_39|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_33|, #NULL.base=|v_#NULL.base_8|, ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_25|, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ULTIMATE.start_main_#t~mem7#1=|v_ULTIMATE.start_main_#t~mem7#1_20|, #pthreadsForks=|v_#pthreadsForks_35|, ~flag2~0=v_~flag2~0_37, #valid=|v_#valid_90|, #memory_int=|v_#memory_int_45|, ~flag1~0=v_~flag1~0_37, #length=|v_#length_55|, ~x~0=v_~x~0_24, ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_25|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_41|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet4#1, ULTIMATE.start_main_#t~mem8#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_#res#1, ULTIMATE.start_main_#t~nondet6#1, #NULL.offset, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t1~0#1.offset, #NULL.base, ULTIMATE.start_main_#t~pre5#1, ULTIMATE.start_main_#t~mem7#1, #pthreadsForks, ~flag2~0, #valid, #memory_int, ~flag1~0, #length, ~x~0, ULTIMATE.start_main_#t~pre3#1, ULTIMATE.start_main_~#t2~0#1.base] 3960#[L720-2]don't care [340] L720-2-->thr1ENTRY: Formula: (and (= 0 |v_thr1Thread1of1ForFork0_#in~_.base_4|) (= |v_thr1Thread1of1ForFork0_#in~_.offset_4| 0) (= v_thr1Thread1of1ForFork0_thidvar1_2 0) (= |v_ULTIMATE.start_main_#t~pre3#1_6| v_thr1Thread1of1ForFork0_thidvar0_2)) InVars {ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_6|} OutVars{thr1Thread1of1ForFork0_~_.base=v_thr1Thread1of1ForFork0_~_.base_4, thr1Thread1of1ForFork0_#in~_.offset=|v_thr1Thread1of1ForFork0_#in~_.offset_4|, thr1Thread1of1ForFork0_#res.base=|v_thr1Thread1of1ForFork0_#res.base_4|, thr1Thread1of1ForFork0_thidvar0=v_thr1Thread1of1ForFork0_thidvar0_2, thr1Thread1of1ForFork0_thidvar1=v_thr1Thread1of1ForFork0_thidvar1_2, thr1Thread1of1ForFork0_#in~_.base=|v_thr1Thread1of1ForFork0_#in~_.base_4|, thr1Thread1of1ForFork0_#res.offset=|v_thr1Thread1of1ForFork0_#res.offset_4|, ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_6|, thr1Thread1of1ForFork0_~_.offset=v_thr1Thread1of1ForFork0_~_.offset_4} AuxVars[] AssignedVars[thr1Thread1of1ForFork0_~_.base, thr1Thread1of1ForFork0_#in~_.offset, thr1Thread1of1ForFork0_#res.base, thr1Thread1of1ForFork0_thidvar0, thr1Thread1of1ForFork0_thidvar1, thr1Thread1of1ForFork0_#in~_.base, thr1Thread1of1ForFork0_#res.offset, thr1Thread1of1ForFork0_~_.offset] 3822#[L720-3, thr1ENTRY]don't care [362] thr1ENTRY-->L688-2: Formula: (and (= v_thr1Thread1of1ForFork0_~_.base_5 |v_thr1Thread1of1ForFork0_#in~_.base_5|) (= |v_thr1Thread1of1ForFork0_#in~_.offset_5| v_thr1Thread1of1ForFork0_~_.offset_5) (= v_~flag1~0_23 1)) InVars {thr1Thread1of1ForFork0_#in~_.offset=|v_thr1Thread1of1ForFork0_#in~_.offset_5|, thr1Thread1of1ForFork0_#in~_.base=|v_thr1Thread1of1ForFork0_#in~_.base_5|} OutVars{thr1Thread1of1ForFork0_~_.base=v_thr1Thread1of1ForFork0_~_.base_5, thr1Thread1of1ForFork0_#in~_.offset=|v_thr1Thread1of1ForFork0_#in~_.offset_5|, ~flag1~0=v_~flag1~0_23, thr1Thread1of1ForFork0_#in~_.base=|v_thr1Thread1of1ForFork0_#in~_.base_5|, thr1Thread1of1ForFork0_~_.offset=v_thr1Thread1of1ForFork0_~_.offset_5} AuxVars[] AssignedVars[thr1Thread1of1ForFork0_~_.base, ~flag1~0, thr1Thread1of1ForFork0_~_.offset] 3422#[L720-3, L688-2]don't care [397] L720-3-->L721-3: Formula: (and (= (select |v_#valid_74| |v_ULTIMATE.start_main_~#t2~0#1.base_29|) 1) (<= (+ |v_ULTIMATE.start_main_~#t2~0#1.offset_25| 4) (select |v_#length_49| |v_ULTIMATE.start_main_~#t2~0#1.base_29|)) (= (store |v_#memory_int_38| |v_ULTIMATE.start_main_~#t2~0#1.base_29| (store (select |v_#memory_int_38| |v_ULTIMATE.start_main_~#t2~0#1.base_29|) |v_ULTIMATE.start_main_~#t2~0#1.offset_25| |v_ULTIMATE.start_main_#t~pre5#1_21|)) |v_#memory_int_37|) (= (+ |v_#pthreadsForks_28| 1) |v_#pthreadsForks_27|) (<= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_25|) (= |v_#pthreadsForks_28| |v_ULTIMATE.start_main_#t~pre5#1_21|)) InVars {#pthreadsForks=|v_#pthreadsForks_28|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_25|, #valid=|v_#valid_74|, #memory_int=|v_#memory_int_38|, #length=|v_#length_49|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_29|} OutVars{ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_21|, ULTIMATE.start_main_#t~nondet4#1=|v_ULTIMATE.start_main_#t~nondet4#1_13|, #pthreadsForks=|v_#pthreadsForks_27|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_25|, #valid=|v_#valid_74|, #memory_int=|v_#memory_int_37|, #length=|v_#length_49|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_29|, ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_21|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre5#1, ULTIMATE.start_main_#t~nondet4#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre3#1] 3408#[L688-2, L721-3]don't care [343] L721-3-->thr2ENTRY: Formula: (and (= v_thr2Thread1of1ForFork1_thidvar2_2 0) (= |v_thr2Thread1of1ForFork1_#in~_.base_4| 0) (= |v_thr2Thread1of1ForFork1_#in~_.offset_4| 0) (= v_thr2Thread1of1ForFork1_thidvar1_2 0) (= |v_ULTIMATE.start_main_#t~pre5#1_6| v_thr2Thread1of1ForFork1_thidvar0_2)) InVars {ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_6|} OutVars{ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_6|, thr2Thread1of1ForFork1_thidvar0=v_thr2Thread1of1ForFork1_thidvar0_2, thr2Thread1of1ForFork1_thidvar1=v_thr2Thread1of1ForFork1_thidvar1_2, thr2Thread1of1ForFork1_thidvar2=v_thr2Thread1of1ForFork1_thidvar2_2, thr2Thread1of1ForFork1_~_.offset=v_thr2Thread1of1ForFork1_~_.offset_4, thr2Thread1of1ForFork1_#res.base=|v_thr2Thread1of1ForFork1_#res.base_4|, thr2Thread1of1ForFork1_#in~_.offset=|v_thr2Thread1of1ForFork1_#in~_.offset_4|, thr2Thread1of1ForFork1_#res.offset=|v_thr2Thread1of1ForFork1_#res.offset_4|, thr2Thread1of1ForFork1_#in~_.base=|v_thr2Thread1of1ForFork1_#in~_.base_4|, thr2Thread1of1ForFork1_~_.base=v_thr2Thread1of1ForFork1_~_.base_4} AuxVars[] AssignedVars[thr2Thread1of1ForFork1_thidvar0, thr2Thread1of1ForFork1_thidvar1, thr2Thread1of1ForFork1_thidvar2, thr2Thread1of1ForFork1_~_.offset, thr2Thread1of1ForFork1_#res.base, thr2Thread1of1ForFork1_#in~_.offset, thr2Thread1of1ForFork1_#res.offset, thr2Thread1of1ForFork1_#in~_.base, thr2Thread1of1ForFork1_~_.base] 3578#[L688-2, L721-4, thr2ENTRY]don't care [346] thr2ENTRY-->L704-2: Formula: (and (= v_~flag2~0_17 1) (= v_thr2Thread1of1ForFork1_~_.offset_5 |v_thr2Thread1of1ForFork1_#in~_.offset_5|) (= |v_thr2Thread1of1ForFork1_#in~_.base_5| v_thr2Thread1of1ForFork1_~_.base_5)) InVars {thr2Thread1of1ForFork1_#in~_.offset=|v_thr2Thread1of1ForFork1_#in~_.offset_5|, thr2Thread1of1ForFork1_#in~_.base=|v_thr2Thread1of1ForFork1_#in~_.base_5|} OutVars{thr2Thread1of1ForFork1_~_.offset=v_thr2Thread1of1ForFork1_~_.offset_5, thr2Thread1of1ForFork1_#in~_.offset=|v_thr2Thread1of1ForFork1_#in~_.offset_5|, ~flag2~0=v_~flag2~0_17, thr2Thread1of1ForFork1_#in~_.base=|v_thr2Thread1of1ForFork1_#in~_.base_5|, thr2Thread1of1ForFork1_~_.base=v_thr2Thread1of1ForFork1_~_.base_5} AuxVars[] AssignedVars[thr2Thread1of1ForFork1_~_.offset, ~flag2~0, thr2Thread1of1ForFork1_~_.base] 3892#[L704-2, L688-2, L721-4]don't care [2022-07-22 12:34:09,268 INFO L750 eck$LassoCheckResult]: Loop: 3892#[L704-2, L688-2, L721-4]don't care [315] L688-2-->L688-2: Formula: (<= 3 v_~flag2~0_9) InVars {~flag2~0=v_~flag2~0_9} OutVars{~flag2~0=v_~flag2~0_9} AuxVars[] AssignedVars[] 3892#[L704-2, L688-2, L721-4]don't care [2022-07-22 12:34:09,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:34:09,268 INFO L85 PathProgramCache]: Analyzing trace with hash -191934678, now seen corresponding path program 2 times [2022-07-22 12:34:09,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:34:09,269 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015526748] [2022-07-22 12:34:09,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:34:09,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:34:09,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:34:09,309 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:34:09,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:34:09,346 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:34:09,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:34:09,347 INFO L85 PathProgramCache]: Analyzing trace with hash 346, now seen corresponding path program 2 times [2022-07-22 12:34:09,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:34:09,347 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748344833] [2022-07-22 12:34:09,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:34:09,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:34:09,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:34:09,355 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:34:09,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:34:09,362 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:34:09,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:34:09,363 INFO L85 PathProgramCache]: Analyzing trace with hash -1655007407, now seen corresponding path program 1 times [2022-07-22 12:34:09,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:34:09,364 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440111538] [2022-07-22 12:34:09,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:34:09,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:34:09,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:34:09,420 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:34:09,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 12:34:09,421 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440111538] [2022-07-22 12:34:09,421 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1440111538] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 12:34:09,421 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 12:34:09,422 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-22 12:34:09,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455109614] [2022-07-22 12:34:09,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 12:34:09,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 12:34:09,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 12:34:09,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 12:34:09,437 INFO L87 Difference]: Start difference. First operand 348 states and 1021 transitions. cyclomatic complexity: 841 Second operand has 3 states, 2 states have (on average 3.5) 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:34:09,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 12:34:09,518 INFO L93 Difference]: Finished difference Result 388 states and 1117 transitions. [2022-07-22 12:34:09,519 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 388 states and 1117 transitions. [2022-07-22 12:34:09,526 INFO L131 ngComponentsAnalysis]: Automaton has 188 accepting balls. 188 [2022-07-22 12:34:09,532 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 388 states to 388 states and 1117 transitions. [2022-07-22 12:34:09,532 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 388 [2022-07-22 12:34:09,533 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 388 [2022-07-22 12:34:09,533 INFO L73 IsDeterministic]: Start isDeterministic. Operand 388 states and 1117 transitions. [2022-07-22 12:34:09,534 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 12:34:09,534 INFO L220 hiAutomatonCegarLoop]: Abstraction has 388 states and 1117 transitions. [2022-07-22 12:34:09,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states and 1117 transitions. [2022-07-22 12:34:09,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 388. [2022-07-22 12:34:09,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 388 states, 388 states have (on average 2.8788659793814433) internal successors, (1117), 387 states have internal predecessors, (1117), 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:34:09,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 1117 transitions. [2022-07-22 12:34:09,552 INFO L242 hiAutomatonCegarLoop]: Abstraction has 388 states and 1117 transitions. [2022-07-22 12:34:09,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 12:34:09,553 INFO L425 stractBuchiCegarLoop]: Abstraction has 388 states and 1117 transitions. [2022-07-22 12:34:09,553 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2022-07-22 12:34:09,554 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 388 states and 1117 transitions. [2022-07-22 12:34:09,558 INFO L131 ngComponentsAnalysis]: Automaton has 188 accepting balls. 188 [2022-07-22 12:34:09,558 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:34:09,558 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:34:09,559 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 12:34:09,559 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-22 12:34:09,560 INFO L748 eck$LassoCheckResult]: Stem: 5076#[ULTIMATE.startENTRY]don't care [401] ULTIMATE.startENTRY-->L720-2: Formula: (let ((.cse1 (store |v_#valid_91| |v_ULTIMATE.start_main_~#t1~0#1.base_39| 1)) (.cse0 (select |v_#memory_int_46| 1))) (and (= (select |v_#valid_91| |v_ULTIMATE.start_main_~#t1~0#1.base_39|) 0) (= 48 (select .cse0 0)) (= (select |v_#valid_91| 0) 0) (= |v_#length_55| (store (store |v_#length_56| |v_ULTIMATE.start_main_~#t1~0#1.base_39| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_41| 4)) (= |v_#memory_int_45| (store |v_#memory_int_46| |v_ULTIMATE.start_main_~#t1~0#1.base_39| (store (select |v_#memory_int_46| |v_ULTIMATE.start_main_~#t1~0#1.base_39|) |v_ULTIMATE.start_main_~#t1~0#1.offset_33| |v_ULTIMATE.start_main_#t~pre3#1_25|))) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_33| 0) (= v_~flag1~0_37 0) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t2~0#1.base_41|) (= (select |v_#valid_91| 1) 1) (= 2 (select |v_#length_56| 1)) (= v_~flag2~0_37 0) (= |v_#pthreadsForks_36| |v_ULTIMATE.start_main_#t~pre3#1_25|) (<= (+ 4 |v_ULTIMATE.start_main_~#t1~0#1.offset_33|) (select |v_#length_55| |v_ULTIMATE.start_main_~#t1~0#1.base_39|)) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_33|) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t1~0#1.base_39|) (= v_~x~0_24 0) (= (store .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_41| 1) |v_#valid_90|) (= |v_#NULL.offset_8| 0) (= (select |v_#length_56| 2) 12) (= (select .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_41|) 0) (< 0 |v_#StackHeapBarrier_18|) (= |v_#NULL.base_8| 0) (= |v_#pthreadsForks_35| (+ |v_#pthreadsForks_36| 1)) (= (select |v_#valid_91| 2) 1) (= (select .cse0 1) 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #pthreadsForks=|v_#pthreadsForks_36|, #valid=|v_#valid_91|, #memory_int=|v_#memory_int_46|, #length=|v_#length_56|} OutVars{ULTIMATE.start_main_#t~nondet4#1=|v_ULTIMATE.start_main_#t~nondet4#1_17|, ULTIMATE.start_main_#t~mem8#1=|v_ULTIMATE.start_main_#t~mem8#1_22|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_33|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_22|, ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_15|, #NULL.offset=|v_#NULL.offset_8|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_39|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_33|, #NULL.base=|v_#NULL.base_8|, ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_25|, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ULTIMATE.start_main_#t~mem7#1=|v_ULTIMATE.start_main_#t~mem7#1_20|, #pthreadsForks=|v_#pthreadsForks_35|, ~flag2~0=v_~flag2~0_37, #valid=|v_#valid_90|, #memory_int=|v_#memory_int_45|, ~flag1~0=v_~flag1~0_37, #length=|v_#length_55|, ~x~0=v_~x~0_24, ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_25|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_41|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet4#1, ULTIMATE.start_main_#t~mem8#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_#res#1, ULTIMATE.start_main_#t~nondet6#1, #NULL.offset, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t1~0#1.offset, #NULL.base, ULTIMATE.start_main_#t~pre5#1, ULTIMATE.start_main_#t~mem7#1, #pthreadsForks, ~flag2~0, #valid, #memory_int, ~flag1~0, #length, ~x~0, ULTIMATE.start_main_#t~pre3#1, ULTIMATE.start_main_~#t2~0#1.base] 5074#[L720-2]don't care [340] L720-2-->thr1ENTRY: Formula: (and (= 0 |v_thr1Thread1of1ForFork0_#in~_.base_4|) (= |v_thr1Thread1of1ForFork0_#in~_.offset_4| 0) (= v_thr1Thread1of1ForFork0_thidvar1_2 0) (= |v_ULTIMATE.start_main_#t~pre3#1_6| v_thr1Thread1of1ForFork0_thidvar0_2)) InVars {ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_6|} OutVars{thr1Thread1of1ForFork0_~_.base=v_thr1Thread1of1ForFork0_~_.base_4, thr1Thread1of1ForFork0_#in~_.offset=|v_thr1Thread1of1ForFork0_#in~_.offset_4|, thr1Thread1of1ForFork0_#res.base=|v_thr1Thread1of1ForFork0_#res.base_4|, thr1Thread1of1ForFork0_thidvar0=v_thr1Thread1of1ForFork0_thidvar0_2, thr1Thread1of1ForFork0_thidvar1=v_thr1Thread1of1ForFork0_thidvar1_2, thr1Thread1of1ForFork0_#in~_.base=|v_thr1Thread1of1ForFork0_#in~_.base_4|, thr1Thread1of1ForFork0_#res.offset=|v_thr1Thread1of1ForFork0_#res.offset_4|, ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_6|, thr1Thread1of1ForFork0_~_.offset=v_thr1Thread1of1ForFork0_~_.offset_4} AuxVars[] AssignedVars[thr1Thread1of1ForFork0_~_.base, thr1Thread1of1ForFork0_#in~_.offset, thr1Thread1of1ForFork0_#res.base, thr1Thread1of1ForFork0_thidvar0, thr1Thread1of1ForFork0_thidvar1, thr1Thread1of1ForFork0_#in~_.base, thr1Thread1of1ForFork0_#res.offset, thr1Thread1of1ForFork0_~_.offset] 4924#[L720-3, thr1ENTRY]don't care [362] thr1ENTRY-->L688-2: Formula: (and (= v_thr1Thread1of1ForFork0_~_.base_5 |v_thr1Thread1of1ForFork0_#in~_.base_5|) (= |v_thr1Thread1of1ForFork0_#in~_.offset_5| v_thr1Thread1of1ForFork0_~_.offset_5) (= v_~flag1~0_23 1)) InVars {thr1Thread1of1ForFork0_#in~_.offset=|v_thr1Thread1of1ForFork0_#in~_.offset_5|, thr1Thread1of1ForFork0_#in~_.base=|v_thr1Thread1of1ForFork0_#in~_.base_5|} OutVars{thr1Thread1of1ForFork0_~_.base=v_thr1Thread1of1ForFork0_~_.base_5, thr1Thread1of1ForFork0_#in~_.offset=|v_thr1Thread1of1ForFork0_#in~_.offset_5|, ~flag1~0=v_~flag1~0_23, thr1Thread1of1ForFork0_#in~_.base=|v_thr1Thread1of1ForFork0_#in~_.base_5|, thr1Thread1of1ForFork0_~_.offset=v_thr1Thread1of1ForFork0_~_.offset_5} AuxVars[] AssignedVars[thr1Thread1of1ForFork0_~_.base, ~flag1~0, thr1Thread1of1ForFork0_~_.offset] 4514#[L720-3, L688-2]don't care [314] L688-2-->L688-3: Formula: (not (<= 3 v_~flag2~0_8)) InVars {~flag2~0=v_~flag2~0_8} OutVars{~flag2~0=v_~flag2~0_8} AuxVars[] AssignedVars[] 4516#[L720-3, L688-3]don't care [316] L688-3-->L690: Formula: (= v_~flag1~0_13 3) InVars {} OutVars{~flag1~0=v_~flag1~0_13} AuxVars[] AssignedVars[~flag1~0] 4874#[L720-3, L690]don't care [397] L720-3-->L721-3: Formula: (and (= (select |v_#valid_74| |v_ULTIMATE.start_main_~#t2~0#1.base_29|) 1) (<= (+ |v_ULTIMATE.start_main_~#t2~0#1.offset_25| 4) (select |v_#length_49| |v_ULTIMATE.start_main_~#t2~0#1.base_29|)) (= (store |v_#memory_int_38| |v_ULTIMATE.start_main_~#t2~0#1.base_29| (store (select |v_#memory_int_38| |v_ULTIMATE.start_main_~#t2~0#1.base_29|) |v_ULTIMATE.start_main_~#t2~0#1.offset_25| |v_ULTIMATE.start_main_#t~pre5#1_21|)) |v_#memory_int_37|) (= (+ |v_#pthreadsForks_28| 1) |v_#pthreadsForks_27|) (<= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_25|) (= |v_#pthreadsForks_28| |v_ULTIMATE.start_main_#t~pre5#1_21|)) InVars {#pthreadsForks=|v_#pthreadsForks_28|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_25|, #valid=|v_#valid_74|, #memory_int=|v_#memory_int_38|, #length=|v_#length_49|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_29|} OutVars{ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_21|, ULTIMATE.start_main_#t~nondet4#1=|v_ULTIMATE.start_main_#t~nondet4#1_13|, #pthreadsForks=|v_#pthreadsForks_27|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_25|, #valid=|v_#valid_74|, #memory_int=|v_#memory_int_37|, #length=|v_#length_49|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_29|, ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_21|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre5#1, ULTIMATE.start_main_#t~nondet4#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre3#1] 4848#[L721-3, L690]don't care [343] L721-3-->thr2ENTRY: Formula: (and (= v_thr2Thread1of1ForFork1_thidvar2_2 0) (= |v_thr2Thread1of1ForFork1_#in~_.base_4| 0) (= |v_thr2Thread1of1ForFork1_#in~_.offset_4| 0) (= v_thr2Thread1of1ForFork1_thidvar1_2 0) (= |v_ULTIMATE.start_main_#t~pre5#1_6| v_thr2Thread1of1ForFork1_thidvar0_2)) InVars {ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_6|} OutVars{ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_6|, thr2Thread1of1ForFork1_thidvar0=v_thr2Thread1of1ForFork1_thidvar0_2, thr2Thread1of1ForFork1_thidvar1=v_thr2Thread1of1ForFork1_thidvar1_2, thr2Thread1of1ForFork1_thidvar2=v_thr2Thread1of1ForFork1_thidvar2_2, thr2Thread1of1ForFork1_~_.offset=v_thr2Thread1of1ForFork1_~_.offset_4, thr2Thread1of1ForFork1_#res.base=|v_thr2Thread1of1ForFork1_#res.base_4|, thr2Thread1of1ForFork1_#in~_.offset=|v_thr2Thread1of1ForFork1_#in~_.offset_4|, thr2Thread1of1ForFork1_#res.offset=|v_thr2Thread1of1ForFork1_#res.offset_4|, thr2Thread1of1ForFork1_#in~_.base=|v_thr2Thread1of1ForFork1_#in~_.base_4|, thr2Thread1of1ForFork1_~_.base=v_thr2Thread1of1ForFork1_~_.base_4} AuxVars[] AssignedVars[thr2Thread1of1ForFork1_thidvar0, thr2Thread1of1ForFork1_thidvar1, thr2Thread1of1ForFork1_thidvar2, thr2Thread1of1ForFork1_~_.offset, thr2Thread1of1ForFork1_#res.base, thr2Thread1of1ForFork1_#in~_.offset, thr2Thread1of1ForFork1_#res.offset, thr2Thread1of1ForFork1_#in~_.base, thr2Thread1of1ForFork1_~_.base] 4850#[L721-4, L690, thr2ENTRY]don't care [346] thr2ENTRY-->L704-2: Formula: (and (= v_~flag2~0_17 1) (= v_thr2Thread1of1ForFork1_~_.offset_5 |v_thr2Thread1of1ForFork1_#in~_.offset_5|) (= |v_thr2Thread1of1ForFork1_#in~_.base_5| v_thr2Thread1of1ForFork1_~_.base_5)) InVars {thr2Thread1of1ForFork1_#in~_.offset=|v_thr2Thread1of1ForFork1_#in~_.offset_5|, thr2Thread1of1ForFork1_#in~_.base=|v_thr2Thread1of1ForFork1_#in~_.base_5|} OutVars{thr2Thread1of1ForFork1_~_.offset=v_thr2Thread1of1ForFork1_~_.offset_5, thr2Thread1of1ForFork1_#in~_.offset=|v_thr2Thread1of1ForFork1_#in~_.offset_5|, ~flag2~0=v_~flag2~0_17, thr2Thread1of1ForFork1_#in~_.base=|v_thr2Thread1of1ForFork1_#in~_.base_5|, thr2Thread1of1ForFork1_~_.base=v_thr2Thread1of1ForFork1_~_.base_5} AuxVars[] AssignedVars[thr2Thread1of1ForFork1_~_.offset, ~flag2~0, thr2Thread1of1ForFork1_~_.base] 4684#[L704-2, L721-4, L690]don't care [2022-07-22 12:34:09,560 INFO L750 eck$LassoCheckResult]: Loop: 4684#[L704-2, L721-4, L690]don't care [288] L704-2-->L704-2: Formula: (<= 3 v_~flag1~0_3) InVars {~flag1~0=v_~flag1~0_3} OutVars{~flag1~0=v_~flag1~0_3} AuxVars[] AssignedVars[] 4684#[L704-2, L721-4, L690]don't care [2022-07-22 12:34:09,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:34:09,561 INFO L85 PathProgramCache]: Analyzing trace with hash 156971560, now seen corresponding path program 1 times [2022-07-22 12:34:09,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:34:09,561 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856204026] [2022-07-22 12:34:09,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:34:09,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:34:09,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:34:09,597 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:34:09,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:34:09,615 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:34:09,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:34:09,618 INFO L85 PathProgramCache]: Analyzing trace with hash 319, now seen corresponding path program 3 times [2022-07-22 12:34:09,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:34:09,618 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127698234] [2022-07-22 12:34:09,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:34:09,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:34:09,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:34:09,623 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:34:09,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:34:09,633 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:34:09,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:34:09,634 INFO L85 PathProgramCache]: Analyzing trace with hash 571151352, now seen corresponding path program 1 times [2022-07-22 12:34:09,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:34:09,635 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176907030] [2022-07-22 12:34:09,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:34:09,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:34:09,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:34:09,661 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:34:09,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:34:09,677 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:34:10,809 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.07 12:34:10 BoogieIcfgContainer [2022-07-22 12:34:10,809 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-07-22 12:34:10,819 INFO L158 Benchmark]: Toolchain (without parser) took 6822.54ms. Allocated memory was 161.5MB in the beginning and 194.0MB in the end (delta: 32.5MB). Free memory was 134.8MB in the beginning and 76.5MB in the end (delta: 58.3MB). Peak memory consumption was 92.0MB. Max. memory is 8.0GB. [2022-07-22 12:34:10,819 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 161.5MB. Free memory is still 132.8MB. There was no memory consumed. Max. memory is 8.0GB. [2022-07-22 12:34:10,820 INFO L158 Benchmark]: CACSL2BoogieTranslator took 771.63ms. Allocated memory is still 161.5MB. Free memory was 134.6MB in the beginning and 115.8MB in the end (delta: 18.8MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. [2022-07-22 12:34:10,823 INFO L158 Benchmark]: Boogie Procedure Inliner took 75.79ms. Allocated memory is still 161.5MB. Free memory was 115.6MB in the beginning and 113.9MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-07-22 12:34:10,826 INFO L158 Benchmark]: Boogie Preprocessor took 64.64ms. Allocated memory is still 161.5MB. Free memory was 113.9MB in the beginning and 112.4MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-07-22 12:34:10,826 INFO L158 Benchmark]: RCFGBuilder took 573.17ms. Allocated memory is still 161.5MB. Free memory was 112.4MB in the beginning and 135.8MB in the end (delta: -23.4MB). Peak memory consumption was 11.2MB. Max. memory is 8.0GB. [2022-07-22 12:34:10,827 INFO L158 Benchmark]: BuchiAutomizer took 5324.51ms. Allocated memory was 161.5MB in the beginning and 194.0MB in the end (delta: 32.5MB). Free memory was 135.8MB in the beginning and 76.5MB in the end (delta: 59.2MB). Peak memory consumption was 92.3MB. Max. memory is 8.0GB. [2022-07-22 12:34:10,838 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.17ms. Allocated memory is still 161.5MB. Free memory is still 132.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 771.63ms. Allocated memory is still 161.5MB. Free memory was 134.6MB in the beginning and 115.8MB in the end (delta: 18.8MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 75.79ms. Allocated memory is still 161.5MB. Free memory was 115.6MB in the beginning and 113.9MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 64.64ms. Allocated memory is still 161.5MB. Free memory was 113.9MB in the beginning and 112.4MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 573.17ms. Allocated memory is still 161.5MB. Free memory was 112.4MB in the beginning and 135.8MB in the end (delta: -23.4MB). Peak memory consumption was 11.2MB. Max. memory is 8.0GB. * BuchiAutomizer took 5324.51ms. Allocated memory was 161.5MB in the beginning and 194.0MB in the end (delta: 32.5MB). Free memory was 135.8MB in the beginning and 76.5MB in the end (delta: 59.2MB). Peak memory consumption was 92.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 4 terminating modules (4 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.4 modules have a trivial ranking function, the largest among these consists of 3 locations. The remainder module has 388 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 5.1s and 5 iterations. TraceHistogramMax:1. Analysis of lassos took 2.0s. Construction of modules took 0.2s. Büchi inclusion checks took 0.5s. Highest rank in rank-based complementation 0. Minimization of det autom 4. Minimization of nondet autom 0. Automata minimization 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.1s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 78 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 78 mSDsluCounter, 186 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 90 mSDsCounter, 20 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 180 IncrementalHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 20 mSolverCounterUnsat, 130 mSDtfsCounter, 180 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT0 conc4 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: LassoTerminationAnalysisBenchmarks: not availableLassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 2.1s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 704]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {} State at position 1 is {\result=0, \result={0:0}, \result={0:0}, _={0:0}, _={0:0}, _={0:0}, _={0:0}, flag1=3, flag2=1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@144a0344 in0,0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5a5c6e80 in-1,0, org.eclipse.cdt.internal.core.dom.parser.c.CASTIdExpression@6791d1b6=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTIdExpression@6805e8df=0, t1={23911:0}, t2={23912:0}, x=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 704]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L684] 0 int flag1 = 0, flag2 = 0; [L685] 0 int x; [L719] 0 pthread_t t1, t2; [L720] FCALL, FORK 0 pthread_create(&t1, 0, thr1, 0) [L687] 1 flag1 = 1 [L688] COND FALSE 1 !(flag2 >= 3) [L689] 1 flag1 = 3 [L721] FCALL, FORK 0 pthread_create(&t2, 0, thr2, 0) [L703] 2 flag2 = 1 Loop: [L704] COND TRUE flag1 >= 3 End of lasso representation. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.0s, 84 PlacesBefore, 40 PlacesAfterwards, 97 TransitionsBefore, 51 TransitionsAfterwards, 2268 CoEnabledTransitionPairs, 5 FixpointIterations, 27 TrivialSequentialCompositions, 15 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 12 ConcurrentYvCompositions, 2 ChoiceCompositions, 56 TotalNumberOfCompositions, 6115 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2243, positive: 2061, positive conditional: 0, positive unconditional: 2061, negative: 182, negative conditional: 0, negative unconditional: 182, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 974, positive: 933, positive conditional: 0, positive unconditional: 933, negative: 41, negative conditional: 0, negative unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2243, positive: 1128, positive conditional: 0, positive unconditional: 1128, negative: 141, negative conditional: 0, negative unconditional: 141, unknown: 974, unknown conditional: 0, unknown unconditional: 974] , Statistics on independence cache: Total cache size (in pairs): 193, Positive cache size: 164, Positive conditional cache size: 0, Positive unconditional cache size: 164, Negative cache size: 29, Negative conditional cache size: 0, Negative unconditional cache size: 29 RESULT: Ultimate proved your program to be incorrect! [2022-07-22 12:34:10,927 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...