/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/BuchiAutomizerCInline.xml -s ../../../trunk/examples/settings/buchiAutomizer/concurrent-automaton-semanticLbe.epf -i ../../../trunk/examples/svcomp/pthread-atomic/lamport.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-0d686a6 [2022-07-26 13:44:14,553 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-26 13:44:14,556 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-26 13:44:14,599 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-26 13:44:14,599 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-26 13:44:14,601 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-26 13:44:14,603 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-26 13:44:14,605 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-26 13:44:14,607 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-26 13:44:14,611 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-26 13:44:14,612 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-26 13:44:14,613 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-26 13:44:14,614 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-26 13:44:14,616 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-26 13:44:14,617 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-26 13:44:14,619 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-26 13:44:14,620 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-26 13:44:14,621 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-26 13:44:14,622 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-26 13:44:14,627 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-26 13:44:14,629 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-26 13:44:14,630 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-26 13:44:14,631 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-26 13:44:14,632 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-26 13:44:14,633 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-26 13:44:14,639 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-26 13:44:14,640 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-26 13:44:14,640 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-26 13:44:14,641 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-26 13:44:14,641 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-26 13:44:14,642 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-26 13:44:14,642 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-26 13:44:14,644 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-26 13:44:14,644 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-26 13:44:14,645 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-26 13:44:14,646 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-26 13:44:14,646 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-26 13:44:14,646 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-26 13:44:14,647 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-26 13:44:14,647 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-26 13:44:14,647 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-26 13:44:14,649 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-26 13:44:14,649 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/buchiAutomizer/concurrent-automaton-semanticLbe.epf [2022-07-26 13:44:14,679 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-26 13:44:14,680 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-26 13:44:14,680 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-26 13:44:14,680 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-26 13:44:14,682 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-26 13:44:14,682 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-26 13:44:14,682 INFO L138 SettingsManager]: * Use SBE=true [2022-07-26 13:44:14,682 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-07-26 13:44:14,682 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-07-26 13:44:14,683 INFO L138 SettingsManager]: * Use old map elimination=false [2022-07-26 13:44:14,683 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-07-26 13:44:14,683 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-07-26 13:44:14,684 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-07-26 13:44:14,684 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-26 13:44:14,684 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-26 13:44:14,684 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-26 13:44:14,684 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-26 13:44:14,684 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-26 13:44:14,685 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-26 13:44:14,685 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-07-26 13:44:14,685 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-07-26 13:44:14,685 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-07-26 13:44:14,685 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-26 13:44:14,685 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-26 13:44:14,685 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-07-26 13:44:14,686 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-26 13:44:14,686 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-07-26 13:44:14,686 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-26 13:44:14,686 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-26 13:44:14,687 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-26 13:44:14,687 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-26 13:44:14,688 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-07-26 13:44:14,688 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-07-26 13:44:14,917 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-26 13:44:14,940 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-26 13:44:14,942 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-26 13:44:14,943 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-26 13:44:14,943 INFO L275 PluginConnector]: CDTParser initialized [2022-07-26 13:44:14,944 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-atomic/lamport.i [2022-07-26 13:44:14,998 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/18f0e641c/643d5cb3634b4bc4887eb18b5f282897/FLAGc1c7bc40e [2022-07-26 13:44:15,405 INFO L306 CDTParser]: Found 1 translation units. [2022-07-26 13:44:15,405 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-atomic/lamport.i [2022-07-26 13:44:15,419 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/18f0e641c/643d5cb3634b4bc4887eb18b5f282897/FLAGc1c7bc40e [2022-07-26 13:44:15,443 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/18f0e641c/643d5cb3634b4bc4887eb18b5f282897 [2022-07-26 13:44:15,445 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-26 13:44:15,447 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-07-26 13:44:15,450 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-26 13:44:15,450 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-26 13:44:15,453 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-26 13:44:15,453 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.07 01:44:15" (1/1) ... [2022-07-26 13:44:15,454 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@111bdb02 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 01:44:15, skipping insertion in model container [2022-07-26 13:44:15,454 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.07 01:44:15" (1/1) ... [2022-07-26 13:44:15,459 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-26 13:44:15,499 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-26 13:44:15,636 WARN L611 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-07-26 13:44:15,781 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/lamport.i[32156,32169] [2022-07-26 13:44:15,788 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/lamport.i[34083,34096] [2022-07-26 13:44:15,797 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-26 13:44:15,808 INFO L203 MainTranslator]: Completed pre-run [2022-07-26 13:44:15,828 WARN L611 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-07-26 13:44:15,843 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/lamport.i[32156,32169] [2022-07-26 13:44:15,847 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/lamport.i[34083,34096] [2022-07-26 13:44:15,850 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-26 13:44:15,883 INFO L208 MainTranslator]: Completed translation [2022-07-26 13:44:15,883 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 01:44:15 WrapperNode [2022-07-26 13:44:15,884 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-26 13:44:15,885 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-26 13:44:15,885 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-26 13:44:15,885 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-26 13:44:15,892 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 01:44:15" (1/1) ... [2022-07-26 13:44:15,917 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 01:44:15" (1/1) ... [2022-07-26 13:44:15,936 INFO L137 Inliner]: procedures = 171, calls = 83, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 44 [2022-07-26 13:44:15,937 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-26 13:44:15,938 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-26 13:44:15,938 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-26 13:44:15,938 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-26 13:44:15,946 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 01:44:15" (1/1) ... [2022-07-26 13:44:15,946 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 01:44:15" (1/1) ... [2022-07-26 13:44:15,965 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 01:44:15" (1/1) ... [2022-07-26 13:44:15,965 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 01:44:15" (1/1) ... [2022-07-26 13:44:15,970 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 01:44:15" (1/1) ... [2022-07-26 13:44:15,986 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 01:44:15" (1/1) ... [2022-07-26 13:44:15,988 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 01:44:15" (1/1) ... [2022-07-26 13:44:15,990 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-26 13:44:15,998 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-26 13:44:15,998 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-26 13:44:15,998 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-26 13:44:16,000 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 01:44:15" (1/1) ... [2022-07-26 13:44:16,007 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:44:16,016 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:44:16,033 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 13:44:16,057 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2022-07-26 13:44:16,077 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-26 13:44:16,078 INFO L130 BoogieDeclarations]: Found specification of procedure thr2 [2022-07-26 13:44:16,079 INFO L138 BoogieDeclarations]: Found implementation of procedure thr2 [2022-07-26 13:44:16,079 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2022-07-26 13:44:16,079 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2022-07-26 13:44:16,079 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-26 13:44:16,080 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-07-26 13:44:16,080 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-26 13:44:16,080 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-26 13:44:16,080 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-26 13:44:16,080 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-26 13:44:16,080 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-07-26 13:44:16,080 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-26 13:44:16,081 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-26 13:44:16,082 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-07-26 13:44:16,188 INFO L234 CfgBuilder]: Building ICFG [2022-07-26 13:44:16,189 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-26 13:44:16,422 INFO L275 CfgBuilder]: Performing block encoding [2022-07-26 13:44:16,428 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-26 13:44:16,428 INFO L299 CfgBuilder]: Removed 8 assume(true) statements. [2022-07-26 13:44:16,430 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.07 01:44:16 BoogieIcfgContainer [2022-07-26 13:44:16,430 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-26 13:44:16,431 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-07-26 13:44:16,431 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-07-26 13:44:16,435 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-07-26 13:44:16,436 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-26 13:44:16,436 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 26.07 01:44:15" (1/3) ... [2022-07-26 13:44:16,437 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2dd0f098 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.07 01:44:16, skipping insertion in model container [2022-07-26 13:44:16,437 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-26 13:44:16,437 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 01:44:15" (2/3) ... [2022-07-26 13:44:16,437 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2dd0f098 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.07 01:44:16, skipping insertion in model container [2022-07-26 13:44:16,437 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-26 13:44:16,437 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.07 01:44:16" (3/3) ... [2022-07-26 13:44:16,438 INFO L322 chiAutomizerObserver]: Analyzing ICFG lamport.i [2022-07-26 13:44:16,516 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-07-26 13:44:16,543 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 114 places, 133 transitions, 282 flow [2022-07-26 13:44:16,587 INFO L129 PetriNetUnfolder]: 24/129 cut-off events. [2022-07-26 13:44:16,588 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-07-26 13:44:16,599 INFO L84 FinitePrefix]: Finished finitePrefix Result has 138 conditions, 129 events. 24/129 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 243 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 95. Up to 5 conditions per place. [2022-07-26 13:44:16,599 INFO L82 GeneralOperation]: Start removeDead. Operand has 114 places, 133 transitions, 282 flow [2022-07-26 13:44:16,607 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 112 places, 129 transitions, 270 flow [2022-07-26 13:44:16,611 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-07-26 13:44:16,625 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 112 places, 129 transitions, 270 flow [2022-07-26 13:44:16,630 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 112 places, 129 transitions, 270 flow [2022-07-26 13:44:16,630 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 112 places, 129 transitions, 270 flow [2022-07-26 13:44:16,664 INFO L129 PetriNetUnfolder]: 24/129 cut-off events. [2022-07-26 13:44:16,664 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-07-26 13:44:16,666 INFO L84 FinitePrefix]: Finished finitePrefix Result has 138 conditions, 129 events. 24/129 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 234 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 95. Up to 5 conditions per place. [2022-07-26 13:44:16,670 INFO L116 LiptonReduction]: Number of co-enabled transitions 4788 [2022-07-26 13:44:18,763 INFO L131 LiptonReduction]: Checked pairs total: 12403 [2022-07-26 13:44:18,763 INFO L133 LiptonReduction]: Total number of compositions: 92 [2022-07-26 13:44:18,778 INFO L301 stractBuchiCegarLoop]: Interprodecural is true [2022-07-26 13:44:18,779 INFO L302 stractBuchiCegarLoop]: Hoare is false [2022-07-26 13:44:18,779 INFO L303 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-07-26 13:44:18,779 INFO L304 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-07-26 13:44:18,779 INFO L305 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-07-26 13:44:18,779 INFO L306 stractBuchiCegarLoop]: Difference is false [2022-07-26 13:44:18,779 INFO L307 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-07-26 13:44:18,779 INFO L311 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-07-26 13:44:18,781 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 0 states, but on-demand construction may add more states [2022-07-26 13:44:18,935 INFO L131 ngComponentsAnalysis]: Automaton has 26 accepting balls. 650 [2022-07-26 13:44:18,935 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-26 13:44:18,935 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-26 13:44:18,940 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2022-07-26 13:44:18,940 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2022-07-26 13:44:18,940 INFO L333 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-07-26 13:44:18,941 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 723 states, but on-demand construction may add more states [2022-07-26 13:44:18,963 INFO L131 ngComponentsAnalysis]: Automaton has 26 accepting balls. 650 [2022-07-26 13:44:18,965 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-26 13:44:18,965 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-26 13:44:18,966 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2022-07-26 13:44:18,966 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2022-07-26 13:44:18,970 INFO L733 eck$LassoCheckResult]: Stem: 117#[ULTIMATE.startENTRY]don't care [543] ULTIMATE.startENTRY-->L845-2: Formula: (let ((.cse0 (store |v_#valid_81| |v_ULTIMATE.start_main_~#t1~0#1.base_37| 1)) (.cse1 (select |v_#memory_int_46| 1))) (and (= (select |v_#valid_81| |v_ULTIMATE.start_main_~#t1~0#1.base_37|) 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_31| 0) (= |v_#memory_int_45| (store |v_#memory_int_46| |v_ULTIMATE.start_main_~#t1~0#1.base_37| (store (select |v_#memory_int_46| |v_ULTIMATE.start_main_~#t1~0#1.base_37|) |v_ULTIMATE.start_main_~#t1~0#1.offset_29| |v_ULTIMATE.start_main_#t~pre4#1_27|))) (= (store .cse0 |v_ULTIMATE.start_main_~#t2~0#1.base_37| 1) |v_#valid_80|) (= v_~x~0_82 0) (= 48 (select .cse1 0)) (= v_~b2~0_108 0) (< 0 |v_#StackHeapBarrier_22|) (= v_~X~0_282 0) (= |v_#pthreadsForks_34| |v_ULTIMATE.start_main_#t~pre4#1_27|) (< |v_#StackHeapBarrier_22| |v_ULTIMATE.start_main_~#t2~0#1.base_37|) (= 2 (select |v_#length_56| 1)) (< |v_#StackHeapBarrier_22| |v_ULTIMATE.start_main_~#t1~0#1.base_37|) (= (select |v_#valid_81| 1) 1) (= |v_#pthreadsForks_33| (+ |v_#pthreadsForks_34| 1)) (= |v_#length_55| (store (store |v_#length_56| |v_ULTIMATE.start_main_~#t1~0#1.base_37| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_37| 4)) (= v_~b1~0_57 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t2~0#1.base_37|) 0) (= |v_#NULL.offset_8| 0) (= v_~y~0_379 0) (= (select |v_#length_56| 2) 10) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_29| 0) (= |v_#NULL.base_8| 0) (= (select |v_#valid_81| 0) 0) (= (select |v_#valid_81| 2) 1) (= (select .cse1 1) 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_22|, #pthreadsForks=|v_#pthreadsForks_34|, #valid=|v_#valid_81|, #memory_int=|v_#memory_int_46|, #length=|v_#length_56|} OutVars{~b2~0=v_~b2~0_108, ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_25|, ULTIMATE.start_main_#t~mem8#1=|v_ULTIMATE.start_main_#t~mem8#1_18|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_31|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_20|, #NULL.offset=|v_#NULL.offset_8|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_37|, ~X~0=v_~X~0_282, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_27|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_29|, #NULL.base=|v_#NULL.base_8|, #StackHeapBarrier=|v_#StackHeapBarrier_22|, #pthreadsForks=|v_#pthreadsForks_33|, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_17|, #valid=|v_#valid_80|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_15|, #memory_int=|v_#memory_int_45|, ULTIMATE.start_main_#t~mem9#1=|v_ULTIMATE.start_main_#t~mem9#1_22|, #length=|v_#length_55|, ~y~0=v_~y~0_379, ~b1~0=v_~b1~0_57, ~x~0=v_~x~0_82, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_37|} AuxVars[] AssignedVars[~b2~0, ULTIMATE.start_main_#t~pre6#1, ULTIMATE.start_main_#t~mem8#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_#res#1, #NULL.offset, ULTIMATE.start_main_~#t1~0#1.base, ~X~0, ULTIMATE.start_main_#t~pre4#1, ULTIMATE.start_main_~#t1~0#1.offset, #NULL.base, #pthreadsForks, ULTIMATE.start_main_#t~nondet5#1, #valid, ULTIMATE.start_main_#t~nondet7#1, #memory_int, ULTIMATE.start_main_#t~mem9#1, #length, ~y~0, ~b1~0, ~x~0, ULTIMATE.start_main_~#t2~0#1.base] 120#[L845-2]don't care [449] L845-2-->thr1ENTRY: Formula: (and (= v_thr1Thread1of1ForFork1_thidvar1_2 0) (= |v_ULTIMATE.start_main_#t~pre4#1_6| v_thr1Thread1of1ForFork1_thidvar0_2) (= |v_thr1Thread1of1ForFork1_#in~_.base_4| 0) (= |v_thr1Thread1of1ForFork1_#in~_.offset_4| 0)) InVars {ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_6|} OutVars{thr1Thread1of1ForFork1_#in~_.offset=|v_thr1Thread1of1ForFork1_#in~_.offset_4|, thr1Thread1of1ForFork1_~_.base=v_thr1Thread1of1ForFork1_~_.base_4, thr1Thread1of1ForFork1_~b21~0=v_thr1Thread1of1ForFork1_~b21~0_10, thr1Thread1of1ForFork1_#res.base=|v_thr1Thread1of1ForFork1_#res.base_4|, thr1Thread1of1ForFork1_~y1~0=v_thr1Thread1of1ForFork1_~y1~0_30, thr1Thread1of1ForFork1_#in~_.base=|v_thr1Thread1of1ForFork1_#in~_.base_4|, thr1Thread1of1ForFork1_~_.offset=v_thr1Thread1of1ForFork1_~_.offset_4, thr1Thread1of1ForFork1_#res.offset=|v_thr1Thread1of1ForFork1_#res.offset_4|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_6|, thr1Thread1of1ForFork1_thidvar1=v_thr1Thread1of1ForFork1_thidvar1_2, thr1Thread1of1ForFork1_thidvar0=v_thr1Thread1of1ForFork1_thidvar0_2, thr1Thread1of1ForFork1_~x1~0=v_thr1Thread1of1ForFork1_~x1~0_8} AuxVars[] AssignedVars[thr1Thread1of1ForFork1_#in~_.offset, thr1Thread1of1ForFork1_~_.base, thr1Thread1of1ForFork1_~b21~0, thr1Thread1of1ForFork1_#res.base, thr1Thread1of1ForFork1_~y1~0, thr1Thread1of1ForFork1_#in~_.base, thr1Thread1of1ForFork1_~_.offset, thr1Thread1of1ForFork1_#res.offset, thr1Thread1of1ForFork1_thidvar1, thr1Thread1of1ForFork1_thidvar0, thr1Thread1of1ForFork1_~x1~0] 122#[L845-3, thr1ENTRY]don't care [481] thr1ENTRY-->L753-1: Formula: (and (= |v_thr1Thread1of1ForFork1_#in~_.offset_7| v_thr1Thread1of1ForFork1_~_.offset_7) (= v_thr1Thread1of1ForFork1_~_.base_7 |v_thr1Thread1of1ForFork1_#in~_.base_7|)) InVars {thr1Thread1of1ForFork1_#in~_.offset=|v_thr1Thread1of1ForFork1_#in~_.offset_7|, thr1Thread1of1ForFork1_#in~_.base=|v_thr1Thread1of1ForFork1_#in~_.base_7|} OutVars{thr1Thread1of1ForFork1_#in~_.offset=|v_thr1Thread1of1ForFork1_#in~_.offset_7|, thr1Thread1of1ForFork1_~_.base=v_thr1Thread1of1ForFork1_~_.base_7, thr1Thread1of1ForFork1_#in~_.base=|v_thr1Thread1of1ForFork1_#in~_.base_7|, thr1Thread1of1ForFork1_~_.offset=v_thr1Thread1of1ForFork1_~_.offset_7} AuxVars[] AssignedVars[thr1Thread1of1ForFork1_~_.base, thr1Thread1of1ForFork1_~_.offset] 124#[L753-1, L845-3]don't care [2022-07-26 13:44:18,971 INFO L735 eck$LassoCheckResult]: Loop: 124#[L753-1, L845-3]don't care [458] L753-1-->L707: Formula: (= v_~b1~0_10 1) InVars {} OutVars{~b1~0=v_~b1~0_10} AuxVars[] AssignedVars[~b1~0] 132#[L845-3, L707]don't care [411] L707-->L710: Formula: (= v_~x~0_3 1) InVars {} OutVars{~x~0=v_~x~0_3} AuxVars[] AssignedVars[~x~0] 142#[L710, L845-3]don't care [414] L710-->L713: Formula: (= v_~y~0_12 v_thr1Thread1of1ForFork1_~y1~0_1) InVars {~y~0=v_~y~0_12} OutVars{~y~0=v_~y~0_12, thr1Thread1of1ForFork1_~y1~0=v_thr1Thread1of1ForFork1_~y1~0_1} AuxVars[] AssignedVars[thr1Thread1of1ForFork1_~y1~0] 164#[L845-3, L713]don't care [454] L713-->L717: Formula: (and (= v_~b1~0_8 0) (not (= v_thr1Thread1of1ForFork1_~y1~0_35 0))) InVars {thr1Thread1of1ForFork1_~y1~0=v_thr1Thread1of1ForFork1_~y1~0_35} OutVars{thr1Thread1of1ForFork1_~y1~0=v_thr1Thread1of1ForFork1_~y1~0_35, ~b1~0=v_~b1~0_8} AuxVars[] AssignedVars[~b1~0] 208#[L845-3, L717]don't care [422] L717-->L724: Formula: (= v_~y~0_13 v_thr1Thread1of1ForFork1_~y1~0_7) InVars {~y~0=v_~y~0_13} OutVars{~y~0=v_~y~0_13, thr1Thread1of1ForFork1_~y1~0=v_thr1Thread1of1ForFork1_~y1~0_7} AuxVars[] AssignedVars[thr1Thread1of1ForFork1_~y1~0] 272#[L845-3, L724]don't care [506] L724-->L753-1: Formula: (= v_thr1Thread1of1ForFork1_~y1~0_In_3 0) InVars {thr1Thread1of1ForFork1_~y1~0=v_thr1Thread1of1ForFork1_~y1~0_In_3} OutVars{thr1Thread1of1ForFork1_~y1~0=v_thr1Thread1of1ForFork1_~y1~0_In_3} AuxVars[] AssignedVars[] 124#[L753-1, L845-3]don't care [2022-07-26 13:44:18,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 13:44:18,976 INFO L85 PathProgramCache]: Analyzing trace with hash 566014, now seen corresponding path program 1 times [2022-07-26 13:44:18,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 13:44:18,985 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861116803] [2022-07-26 13:44:18,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 13:44:18,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 13:44:19,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 13:44:19,102 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 13:44:19,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 13:44:19,144 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 13:44:19,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 13:44:19,146 INFO L85 PathProgramCache]: Analyzing trace with hash 1507103438, now seen corresponding path program 1 times [2022-07-26 13:44:19,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 13:44:19,147 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144098799] [2022-07-26 13:44:19,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 13:44:19,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 13:44:19,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-26 13:44:19,213 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-26 13:44:19,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-26 13:44:19,213 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144098799] [2022-07-26 13:44:19,214 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2144098799] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-26 13:44:19,214 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-26 13:44:19,214 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-26 13:44:19,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226961239] [2022-07-26 13:44:19,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-26 13:44:19,221 INFO L750 eck$LassoCheckResult]: loop already infeasible [2022-07-26 13:44:19,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-26 13:44:19,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-26 13:44:19,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-26 13:44:19,260 INFO L87 Difference]: Start difference. First operand currently 723 states, but on-demand construction may add more states Second operand has 5 states, 4 states have (on average 1.5) internal successors, (6), 5 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-26 13:44:19,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-26 13:44:19,609 INFO L93 Difference]: Finished difference Result 1364 states and 3688 transitions. [2022-07-26 13:44:19,610 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1364 states and 3688 transitions. [2022-07-26 13:44:19,637 INFO L131 ngComponentsAnalysis]: Automaton has 292 accepting balls. 702 [2022-07-26 13:44:19,660 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1364 states to 1248 states and 3368 transitions. [2022-07-26 13:44:19,661 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1248 [2022-07-26 13:44:19,666 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1248 [2022-07-26 13:44:19,667 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1248 states and 3368 transitions. [2022-07-26 13:44:19,678 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-26 13:44:19,678 INFO L220 hiAutomatonCegarLoop]: Abstraction has 1248 states and 3368 transitions. [2022-07-26 13:44:19,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1248 states and 3368 transitions. [2022-07-26 13:44:19,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1248 to 870. [2022-07-26 13:44:19,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 870 states, 870 states have (on average 2.7425287356321837) internal successors, (2386), 869 states have internal predecessors, (2386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-26 13:44:19,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 870 states to 870 states and 2386 transitions. [2022-07-26 13:44:19,770 INFO L242 hiAutomatonCegarLoop]: Abstraction has 870 states and 2386 transitions. [2022-07-26 13:44:19,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-26 13:44:19,773 INFO L426 stractBuchiCegarLoop]: Abstraction has 870 states and 2386 transitions. [2022-07-26 13:44:19,774 INFO L333 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-07-26 13:44:19,774 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 870 states and 2386 transitions. [2022-07-26 13:44:19,780 INFO L131 ngComponentsAnalysis]: Automaton has 214 accepting balls. 494 [2022-07-26 13:44:19,780 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-26 13:44:19,780 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-26 13:44:19,781 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-07-26 13:44:19,781 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2022-07-26 13:44:19,781 INFO L733 eck$LassoCheckResult]: Stem: 4488#[ULTIMATE.startENTRY]don't care [543] ULTIMATE.startENTRY-->L845-2: Formula: (let ((.cse0 (store |v_#valid_81| |v_ULTIMATE.start_main_~#t1~0#1.base_37| 1)) (.cse1 (select |v_#memory_int_46| 1))) (and (= (select |v_#valid_81| |v_ULTIMATE.start_main_~#t1~0#1.base_37|) 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_31| 0) (= |v_#memory_int_45| (store |v_#memory_int_46| |v_ULTIMATE.start_main_~#t1~0#1.base_37| (store (select |v_#memory_int_46| |v_ULTIMATE.start_main_~#t1~0#1.base_37|) |v_ULTIMATE.start_main_~#t1~0#1.offset_29| |v_ULTIMATE.start_main_#t~pre4#1_27|))) (= (store .cse0 |v_ULTIMATE.start_main_~#t2~0#1.base_37| 1) |v_#valid_80|) (= v_~x~0_82 0) (= 48 (select .cse1 0)) (= v_~b2~0_108 0) (< 0 |v_#StackHeapBarrier_22|) (= v_~X~0_282 0) (= |v_#pthreadsForks_34| |v_ULTIMATE.start_main_#t~pre4#1_27|) (< |v_#StackHeapBarrier_22| |v_ULTIMATE.start_main_~#t2~0#1.base_37|) (= 2 (select |v_#length_56| 1)) (< |v_#StackHeapBarrier_22| |v_ULTIMATE.start_main_~#t1~0#1.base_37|) (= (select |v_#valid_81| 1) 1) (= |v_#pthreadsForks_33| (+ |v_#pthreadsForks_34| 1)) (= |v_#length_55| (store (store |v_#length_56| |v_ULTIMATE.start_main_~#t1~0#1.base_37| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_37| 4)) (= v_~b1~0_57 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t2~0#1.base_37|) 0) (= |v_#NULL.offset_8| 0) (= v_~y~0_379 0) (= (select |v_#length_56| 2) 10) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_29| 0) (= |v_#NULL.base_8| 0) (= (select |v_#valid_81| 0) 0) (= (select |v_#valid_81| 2) 1) (= (select .cse1 1) 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_22|, #pthreadsForks=|v_#pthreadsForks_34|, #valid=|v_#valid_81|, #memory_int=|v_#memory_int_46|, #length=|v_#length_56|} OutVars{~b2~0=v_~b2~0_108, ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_25|, ULTIMATE.start_main_#t~mem8#1=|v_ULTIMATE.start_main_#t~mem8#1_18|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_31|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_20|, #NULL.offset=|v_#NULL.offset_8|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_37|, ~X~0=v_~X~0_282, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_27|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_29|, #NULL.base=|v_#NULL.base_8|, #StackHeapBarrier=|v_#StackHeapBarrier_22|, #pthreadsForks=|v_#pthreadsForks_33|, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_17|, #valid=|v_#valid_80|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_15|, #memory_int=|v_#memory_int_45|, ULTIMATE.start_main_#t~mem9#1=|v_ULTIMATE.start_main_#t~mem9#1_22|, #length=|v_#length_55|, ~y~0=v_~y~0_379, ~b1~0=v_~b1~0_57, ~x~0=v_~x~0_82, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_37|} AuxVars[] AssignedVars[~b2~0, ULTIMATE.start_main_#t~pre6#1, ULTIMATE.start_main_#t~mem8#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_#res#1, #NULL.offset, ULTIMATE.start_main_~#t1~0#1.base, ~X~0, ULTIMATE.start_main_#t~pre4#1, ULTIMATE.start_main_~#t1~0#1.offset, #NULL.base, #pthreadsForks, ULTIMATE.start_main_#t~nondet5#1, #valid, ULTIMATE.start_main_#t~nondet7#1, #memory_int, ULTIMATE.start_main_#t~mem9#1, #length, ~y~0, ~b1~0, ~x~0, ULTIMATE.start_main_~#t2~0#1.base] 4490#[L845-2]don't care [449] L845-2-->thr1ENTRY: Formula: (and (= v_thr1Thread1of1ForFork1_thidvar1_2 0) (= |v_ULTIMATE.start_main_#t~pre4#1_6| v_thr1Thread1of1ForFork1_thidvar0_2) (= |v_thr1Thread1of1ForFork1_#in~_.base_4| 0) (= |v_thr1Thread1of1ForFork1_#in~_.offset_4| 0)) InVars {ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_6|} OutVars{thr1Thread1of1ForFork1_#in~_.offset=|v_thr1Thread1of1ForFork1_#in~_.offset_4|, thr1Thread1of1ForFork1_~_.base=v_thr1Thread1of1ForFork1_~_.base_4, thr1Thread1of1ForFork1_~b21~0=v_thr1Thread1of1ForFork1_~b21~0_10, thr1Thread1of1ForFork1_#res.base=|v_thr1Thread1of1ForFork1_#res.base_4|, thr1Thread1of1ForFork1_~y1~0=v_thr1Thread1of1ForFork1_~y1~0_30, thr1Thread1of1ForFork1_#in~_.base=|v_thr1Thread1of1ForFork1_#in~_.base_4|, thr1Thread1of1ForFork1_~_.offset=v_thr1Thread1of1ForFork1_~_.offset_4, thr1Thread1of1ForFork1_#res.offset=|v_thr1Thread1of1ForFork1_#res.offset_4|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_6|, thr1Thread1of1ForFork1_thidvar1=v_thr1Thread1of1ForFork1_thidvar1_2, thr1Thread1of1ForFork1_thidvar0=v_thr1Thread1of1ForFork1_thidvar0_2, thr1Thread1of1ForFork1_~x1~0=v_thr1Thread1of1ForFork1_~x1~0_8} AuxVars[] AssignedVars[thr1Thread1of1ForFork1_#in~_.offset, thr1Thread1of1ForFork1_~_.base, thr1Thread1of1ForFork1_~b21~0, thr1Thread1of1ForFork1_#res.base, thr1Thread1of1ForFork1_~y1~0, thr1Thread1of1ForFork1_#in~_.base, thr1Thread1of1ForFork1_~_.offset, thr1Thread1of1ForFork1_#res.offset, thr1Thread1of1ForFork1_thidvar1, thr1Thread1of1ForFork1_thidvar0, thr1Thread1of1ForFork1_~x1~0] 3750#[L845-3, thr1ENTRY]don't care [533] L845-3-->L846-3: Formula: (and (<= (+ |v_ULTIMATE.start_main_~#t2~0#1.offset_25| 4) (select |v_#length_45| |v_ULTIMATE.start_main_~#t2~0#1.base_27|)) (= |v_#memory_int_33| (store |v_#memory_int_34| |v_ULTIMATE.start_main_~#t2~0#1.base_27| (store (select |v_#memory_int_34| |v_ULTIMATE.start_main_~#t2~0#1.base_27|) |v_ULTIMATE.start_main_~#t2~0#1.offset_25| |v_ULTIMATE.start_main_#t~pre6#1_21|))) (= (select |v_#valid_62| |v_ULTIMATE.start_main_~#t2~0#1.base_27|) 1) (= |v_ULTIMATE.start_main_#t~pre6#1_21| |v_#pthreadsForks_26|) (<= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_25|) (= |v_#pthreadsForks_25| (+ |v_#pthreadsForks_26| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_26|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_25|, #valid=|v_#valid_62|, #memory_int=|v_#memory_int_34|, #length=|v_#length_45|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_27|} OutVars{ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_21|, #pthreadsForks=|v_#pthreadsForks_25|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_25|, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_13|, #valid=|v_#valid_62|, #memory_int=|v_#memory_int_33|, #length=|v_#length_45|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_23|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_27|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre6#1, #pthreadsForks, ULTIMATE.start_main_#t~nondet5#1, #memory_int, ULTIMATE.start_main_#t~pre4#1] 3700#[L846-3, thr1ENTRY]don't care [446] L846-3-->thr2ENTRY: Formula: (and (= v_thr2Thread1of1ForFork0_thidvar2_2 0) (= |v_ULTIMATE.start_main_#t~pre6#1_6| v_thr2Thread1of1ForFork0_thidvar0_2) (= |v_thr2Thread1of1ForFork0_#in~_.offset_4| 0) (= |v_thr2Thread1of1ForFork0_#in~_.base_4| 0) (= v_thr2Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_6|} OutVars{thr2Thread1of1ForFork0_~y2~0=v_thr2Thread1of1ForFork0_~y2~0_30, ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_6|, thr2Thread1of1ForFork0_#in~_.offset=|v_thr2Thread1of1ForFork0_#in~_.offset_4|, thr2Thread1of1ForFork0_#res.base=|v_thr2Thread1of1ForFork0_#res.base_4|, thr2Thread1of1ForFork0_~x2~0=v_thr2Thread1of1ForFork0_~x2~0_8, thr2Thread1of1ForFork0_#res.offset=|v_thr2Thread1of1ForFork0_#res.offset_4|, thr2Thread1of1ForFork0_~b12~0=v_thr2Thread1of1ForFork0_~b12~0_10, thr2Thread1of1ForFork0_#in~_.base=|v_thr2Thread1of1ForFork0_#in~_.base_4|, thr2Thread1of1ForFork0_~_.base=v_thr2Thread1of1ForFork0_~_.base_4, thr2Thread1of1ForFork0_~_.offset=v_thr2Thread1of1ForFork0_~_.offset_4, thr2Thread1of1ForFork0_thidvar0=v_thr2Thread1of1ForFork0_thidvar0_2, thr2Thread1of1ForFork0_thidvar1=v_thr2Thread1of1ForFork0_thidvar1_2, thr2Thread1of1ForFork0_thidvar2=v_thr2Thread1of1ForFork0_thidvar2_2} AuxVars[] AssignedVars[thr2Thread1of1ForFork0_~y2~0, thr2Thread1of1ForFork0_~_.offset, thr2Thread1of1ForFork0_#in~_.offset, thr2Thread1of1ForFork0_#res.base, thr2Thread1of1ForFork0_thidvar0, thr2Thread1of1ForFork0_thidvar1, thr2Thread1of1ForFork0_thidvar2, thr2Thread1of1ForFork0_~x2~0, thr2Thread1of1ForFork0_#res.offset, thr2Thread1of1ForFork0_~b12~0, thr2Thread1of1ForFork0_#in~_.base, thr2Thread1of1ForFork0_~_.base] 3704#[thr2ENTRY, L846-4, thr1ENTRY]don't care [468] thr2ENTRY-->L823-1: Formula: (and (= v_thr2Thread1of1ForFork0_~_.offset_5 |v_thr2Thread1of1ForFork0_#in~_.offset_5|) (= |v_thr2Thread1of1ForFork0_#in~_.base_5| v_thr2Thread1of1ForFork0_~_.base_5)) InVars {thr2Thread1of1ForFork0_#in~_.offset=|v_thr2Thread1of1ForFork0_#in~_.offset_5|, thr2Thread1of1ForFork0_#in~_.base=|v_thr2Thread1of1ForFork0_#in~_.base_5|} OutVars{thr2Thread1of1ForFork0_~_.offset=v_thr2Thread1of1ForFork0_~_.offset_5, thr2Thread1of1ForFork0_#in~_.offset=|v_thr2Thread1of1ForFork0_#in~_.offset_5|, thr2Thread1of1ForFork0_#in~_.base=|v_thr2Thread1of1ForFork0_#in~_.base_5|, thr2Thread1of1ForFork0_~_.base=v_thr2Thread1of1ForFork0_~_.base_5} AuxVars[] AssignedVars[thr2Thread1of1ForFork0_~_.offset, thr2Thread1of1ForFork0_~_.base] 4448#[L823-1, thr1ENTRY, L846-4]don't care [2022-07-26 13:44:19,782 INFO L735 eck$LassoCheckResult]: Loop: 4448#[L823-1, thr1ENTRY, L846-4]don't care [502] L823-1-->L777: Formula: (= v_~b2~0_23 1) InVars {} OutVars{~b2~0=v_~b2~0_23} AuxVars[] AssignedVars[~b2~0] 4556#[L777, L846-4, thr1ENTRY]don't care [369] L777-->L780: Formula: (= 2 v_~x~0_1) InVars {} OutVars{~x~0=v_~x~0_1} AuxVars[] AssignedVars[~x~0] 4552#[L780, thr1ENTRY, L846-4]don't care [372] L780-->L783: Formula: (= v_~y~0_2 v_thr2Thread1of1ForFork0_~y2~0_1) InVars {~y~0=v_~y~0_2} OutVars{~y~0=v_~y~0_2, thr2Thread1of1ForFork0_~y2~0=v_thr2Thread1of1ForFork0_~y2~0_1} AuxVars[] AssignedVars[thr2Thread1of1ForFork0_~y2~0] 4554#[L846-4, thr1ENTRY, L783]don't care [483] L783-->L787: Formula: (and (= v_~b2~0_16 0) (not (= v_thr2Thread1of1ForFork0_~y2~0_47 0))) InVars {thr2Thread1of1ForFork0_~y2~0=v_thr2Thread1of1ForFork0_~y2~0_47} OutVars{~b2~0=v_~b2~0_16, thr2Thread1of1ForFork0_~y2~0=v_thr2Thread1of1ForFork0_~y2~0_47} AuxVars[] AssignedVars[~b2~0] 4580#[L787, thr1ENTRY, L846-4]don't care [380] L787-->L794: Formula: (= v_~y~0_3 v_thr2Thread1of1ForFork0_~y2~0_7) InVars {~y~0=v_~y~0_3} OutVars{~y~0=v_~y~0_3, thr2Thread1of1ForFork0_~y2~0=v_thr2Thread1of1ForFork0_~y2~0_7} AuxVars[] AssignedVars[thr2Thread1of1ForFork0_~y2~0] 4570#[L794, L846-4, thr1ENTRY]don't care [505] L794-->L823-1: Formula: (= v_thr2Thread1of1ForFork0_~y2~0_In_1 0) InVars {thr2Thread1of1ForFork0_~y2~0=v_thr2Thread1of1ForFork0_~y2~0_In_1} OutVars{thr2Thread1of1ForFork0_~y2~0=v_thr2Thread1of1ForFork0_~y2~0_In_1} AuxVars[] AssignedVars[] 4448#[L823-1, thr1ENTRY, L846-4]don't care [2022-07-26 13:44:19,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 13:44:19,782 INFO L85 PathProgramCache]: Analyzing trace with hash 544003720, now seen corresponding path program 1 times [2022-07-26 13:44:19,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 13:44:19,783 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312050559] [2022-07-26 13:44:19,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 13:44:19,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 13:44:19,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 13:44:19,805 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 13:44:19,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 13:44:19,826 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 13:44:19,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 13:44:19,826 INFO L85 PathProgramCache]: Analyzing trace with hash -1568193752, now seen corresponding path program 1 times [2022-07-26 13:44:19,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 13:44:19,827 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946739467] [2022-07-26 13:44:19,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 13:44:19,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 13:44:19,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-26 13:44:19,856 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-26 13:44:19,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-26 13:44:19,857 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946739467] [2022-07-26 13:44:19,857 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [946739467] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-26 13:44:19,857 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-26 13:44:19,857 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-26 13:44:19,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169411689] [2022-07-26 13:44:19,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-26 13:44:19,858 INFO L750 eck$LassoCheckResult]: loop already infeasible [2022-07-26 13:44:19,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-26 13:44:19,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-26 13:44:19,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-26 13:44:19,859 INFO L87 Difference]: Start difference. First operand 870 states and 2386 transitions. cyclomatic complexity: 1730 Second operand has 5 states, 4 states have (on average 1.5) internal successors, (6), 5 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-26 13:44:20,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-26 13:44:20,104 INFO L93 Difference]: Finished difference Result 1102 states and 2856 transitions. [2022-07-26 13:44:20,104 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1102 states and 2856 transitions. [2022-07-26 13:44:20,114 INFO L131 ngComponentsAnalysis]: Automaton has 290 accepting balls. 290 [2022-07-26 13:44:20,122 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1102 states to 1102 states and 2856 transitions. [2022-07-26 13:44:20,123 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1102 [2022-07-26 13:44:20,124 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1102 [2022-07-26 13:44:20,125 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1102 states and 2856 transitions. [2022-07-26 13:44:20,127 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-26 13:44:20,127 INFO L220 hiAutomatonCegarLoop]: Abstraction has 1102 states and 2856 transitions. [2022-07-26 13:44:20,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1102 states and 2856 transitions. [2022-07-26 13:44:20,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1102 to 792. [2022-07-26 13:44:20,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 792 states, 792 states have (on average 2.638888888888889) internal successors, (2090), 791 states have internal predecessors, (2090), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-26 13:44:20,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 2090 transitions. [2022-07-26 13:44:20,150 INFO L242 hiAutomatonCegarLoop]: Abstraction has 792 states and 2090 transitions. [2022-07-26 13:44:20,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-26 13:44:20,152 INFO L426 stractBuchiCegarLoop]: Abstraction has 792 states and 2090 transitions. [2022-07-26 13:44:20,152 INFO L333 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-07-26 13:44:20,152 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 792 states and 2090 transitions. [2022-07-26 13:44:20,157 INFO L131 ngComponentsAnalysis]: Automaton has 220 accepting balls. 220 [2022-07-26 13:44:20,157 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-26 13:44:20,157 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-26 13:44:20,158 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-26 13:44:20,158 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-26 13:44:20,158 INFO L733 eck$LassoCheckResult]: Stem: 7240#[ULTIMATE.startENTRY]don't care [543] ULTIMATE.startENTRY-->L845-2: Formula: (let ((.cse0 (store |v_#valid_81| |v_ULTIMATE.start_main_~#t1~0#1.base_37| 1)) (.cse1 (select |v_#memory_int_46| 1))) (and (= (select |v_#valid_81| |v_ULTIMATE.start_main_~#t1~0#1.base_37|) 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_31| 0) (= |v_#memory_int_45| (store |v_#memory_int_46| |v_ULTIMATE.start_main_~#t1~0#1.base_37| (store (select |v_#memory_int_46| |v_ULTIMATE.start_main_~#t1~0#1.base_37|) |v_ULTIMATE.start_main_~#t1~0#1.offset_29| |v_ULTIMATE.start_main_#t~pre4#1_27|))) (= (store .cse0 |v_ULTIMATE.start_main_~#t2~0#1.base_37| 1) |v_#valid_80|) (= v_~x~0_82 0) (= 48 (select .cse1 0)) (= v_~b2~0_108 0) (< 0 |v_#StackHeapBarrier_22|) (= v_~X~0_282 0) (= |v_#pthreadsForks_34| |v_ULTIMATE.start_main_#t~pre4#1_27|) (< |v_#StackHeapBarrier_22| |v_ULTIMATE.start_main_~#t2~0#1.base_37|) (= 2 (select |v_#length_56| 1)) (< |v_#StackHeapBarrier_22| |v_ULTIMATE.start_main_~#t1~0#1.base_37|) (= (select |v_#valid_81| 1) 1) (= |v_#pthreadsForks_33| (+ |v_#pthreadsForks_34| 1)) (= |v_#length_55| (store (store |v_#length_56| |v_ULTIMATE.start_main_~#t1~0#1.base_37| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_37| 4)) (= v_~b1~0_57 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t2~0#1.base_37|) 0) (= |v_#NULL.offset_8| 0) (= v_~y~0_379 0) (= (select |v_#length_56| 2) 10) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_29| 0) (= |v_#NULL.base_8| 0) (= (select |v_#valid_81| 0) 0) (= (select |v_#valid_81| 2) 1) (= (select .cse1 1) 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_22|, #pthreadsForks=|v_#pthreadsForks_34|, #valid=|v_#valid_81|, #memory_int=|v_#memory_int_46|, #length=|v_#length_56|} OutVars{~b2~0=v_~b2~0_108, ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_25|, ULTIMATE.start_main_#t~mem8#1=|v_ULTIMATE.start_main_#t~mem8#1_18|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_31|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_20|, #NULL.offset=|v_#NULL.offset_8|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_37|, ~X~0=v_~X~0_282, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_27|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_29|, #NULL.base=|v_#NULL.base_8|, #StackHeapBarrier=|v_#StackHeapBarrier_22|, #pthreadsForks=|v_#pthreadsForks_33|, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_17|, #valid=|v_#valid_80|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_15|, #memory_int=|v_#memory_int_45|, ULTIMATE.start_main_#t~mem9#1=|v_ULTIMATE.start_main_#t~mem9#1_22|, #length=|v_#length_55|, ~y~0=v_~y~0_379, ~b1~0=v_~b1~0_57, ~x~0=v_~x~0_82, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_37|} AuxVars[] AssignedVars[~b2~0, ULTIMATE.start_main_#t~pre6#1, ULTIMATE.start_main_#t~mem8#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_#res#1, #NULL.offset, ULTIMATE.start_main_~#t1~0#1.base, ~X~0, ULTIMATE.start_main_#t~pre4#1, ULTIMATE.start_main_~#t1~0#1.offset, #NULL.base, #pthreadsForks, ULTIMATE.start_main_#t~nondet5#1, #valid, ULTIMATE.start_main_#t~nondet7#1, #memory_int, ULTIMATE.start_main_#t~mem9#1, #length, ~y~0, ~b1~0, ~x~0, ULTIMATE.start_main_~#t2~0#1.base] 7242#[L845-2]don't care [449] L845-2-->thr1ENTRY: Formula: (and (= v_thr1Thread1of1ForFork1_thidvar1_2 0) (= |v_ULTIMATE.start_main_#t~pre4#1_6| v_thr1Thread1of1ForFork1_thidvar0_2) (= |v_thr1Thread1of1ForFork1_#in~_.base_4| 0) (= |v_thr1Thread1of1ForFork1_#in~_.offset_4| 0)) InVars {ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_6|} OutVars{thr1Thread1of1ForFork1_#in~_.offset=|v_thr1Thread1of1ForFork1_#in~_.offset_4|, thr1Thread1of1ForFork1_~_.base=v_thr1Thread1of1ForFork1_~_.base_4, thr1Thread1of1ForFork1_~b21~0=v_thr1Thread1of1ForFork1_~b21~0_10, thr1Thread1of1ForFork1_#res.base=|v_thr1Thread1of1ForFork1_#res.base_4|, thr1Thread1of1ForFork1_~y1~0=v_thr1Thread1of1ForFork1_~y1~0_30, thr1Thread1of1ForFork1_#in~_.base=|v_thr1Thread1of1ForFork1_#in~_.base_4|, thr1Thread1of1ForFork1_~_.offset=v_thr1Thread1of1ForFork1_~_.offset_4, thr1Thread1of1ForFork1_#res.offset=|v_thr1Thread1of1ForFork1_#res.offset_4|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_6|, thr1Thread1of1ForFork1_thidvar1=v_thr1Thread1of1ForFork1_thidvar1_2, thr1Thread1of1ForFork1_thidvar0=v_thr1Thread1of1ForFork1_thidvar0_2, thr1Thread1of1ForFork1_~x1~0=v_thr1Thread1of1ForFork1_~x1~0_8} AuxVars[] AssignedVars[thr1Thread1of1ForFork1_#in~_.offset, thr1Thread1of1ForFork1_~_.base, thr1Thread1of1ForFork1_~b21~0, thr1Thread1of1ForFork1_#res.base, thr1Thread1of1ForFork1_~y1~0, thr1Thread1of1ForFork1_#in~_.base, thr1Thread1of1ForFork1_~_.offset, thr1Thread1of1ForFork1_#res.offset, thr1Thread1of1ForFork1_thidvar1, thr1Thread1of1ForFork1_thidvar0, thr1Thread1of1ForFork1_~x1~0] 6596#[L845-3, thr1ENTRY]don't care [481] thr1ENTRY-->L753-1: Formula: (and (= |v_thr1Thread1of1ForFork1_#in~_.offset_7| v_thr1Thread1of1ForFork1_~_.offset_7) (= v_thr1Thread1of1ForFork1_~_.base_7 |v_thr1Thread1of1ForFork1_#in~_.base_7|)) InVars {thr1Thread1of1ForFork1_#in~_.offset=|v_thr1Thread1of1ForFork1_#in~_.offset_7|, thr1Thread1of1ForFork1_#in~_.base=|v_thr1Thread1of1ForFork1_#in~_.base_7|} OutVars{thr1Thread1of1ForFork1_#in~_.offset=|v_thr1Thread1of1ForFork1_#in~_.offset_7|, thr1Thread1of1ForFork1_~_.base=v_thr1Thread1of1ForFork1_~_.base_7, thr1Thread1of1ForFork1_#in~_.base=|v_thr1Thread1of1ForFork1_#in~_.base_7|, thr1Thread1of1ForFork1_~_.offset=v_thr1Thread1of1ForFork1_~_.offset_7} AuxVars[] AssignedVars[thr1Thread1of1ForFork1_~_.base, thr1Thread1of1ForFork1_~_.offset] 6598#[L753-1, L845-3]don't care [458] L753-1-->L707: Formula: (= v_~b1~0_10 1) InVars {} OutVars{~b1~0=v_~b1~0_10} AuxVars[] AssignedVars[~b1~0] 6928#[L845-3, L707]don't care [411] L707-->L710: Formula: (= v_~x~0_3 1) InVars {} OutVars{~x~0=v_~x~0_3} AuxVars[] AssignedVars[~x~0] 6624#[L710, L845-3]don't care [414] L710-->L713: Formula: (= v_~y~0_12 v_thr1Thread1of1ForFork1_~y1~0_1) InVars {~y~0=v_~y~0_12} OutVars{~y~0=v_~y~0_12, thr1Thread1of1ForFork1_~y1~0=v_thr1Thread1of1ForFork1_~y1~0_1} AuxVars[] AssignedVars[thr1Thread1of1ForFork1_~y1~0] 6628#[L845-3, L713]don't care [454] L713-->L717: Formula: (and (= v_~b1~0_8 0) (not (= v_thr1Thread1of1ForFork1_~y1~0_35 0))) InVars {thr1Thread1of1ForFork1_~y1~0=v_thr1Thread1of1ForFork1_~y1~0_35} OutVars{thr1Thread1of1ForFork1_~y1~0=v_thr1Thread1of1ForFork1_~y1~0_35, ~b1~0=v_~b1~0_8} AuxVars[] AssignedVars[~b1~0] 7112#[L845-3, L717]don't care [422] L717-->L724: Formula: (= v_~y~0_13 v_thr1Thread1of1ForFork1_~y1~0_7) InVars {~y~0=v_~y~0_13} OutVars{~y~0=v_~y~0_13, thr1Thread1of1ForFork1_~y1~0=v_thr1Thread1of1ForFork1_~y1~0_7} AuxVars[] AssignedVars[thr1Thread1of1ForFork1_~y1~0] 7116#[L845-3, L724]don't care [2022-07-26 13:44:20,159 INFO L735 eck$LassoCheckResult]: Loop: 7116#[L845-3, L724]don't care [465] L724-->L724: Formula: (and (not (= v_thr1Thread1of1ForFork1_~y1~0_40 0)) (= v_thr1Thread1of1ForFork1_~y1~0_39 v_~y~0_31)) InVars {thr1Thread1of1ForFork1_~y1~0=v_thr1Thread1of1ForFork1_~y1~0_40, ~y~0=v_~y~0_31} OutVars{thr1Thread1of1ForFork1_~y1~0=v_thr1Thread1of1ForFork1_~y1~0_39, ~y~0=v_~y~0_31} AuxVars[] AssignedVars[thr1Thread1of1ForFork1_~y1~0] 7116#[L845-3, L724]don't care [2022-07-26 13:44:20,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 13:44:20,160 INFO L85 PathProgramCache]: Analyzing trace with hash 24295375, now seen corresponding path program 1 times [2022-07-26 13:44:20,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 13:44:20,160 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914610861] [2022-07-26 13:44:20,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 13:44:20,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 13:44:20,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-26 13:44:20,232 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-26 13:44:20,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-26 13:44:20,233 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914610861] [2022-07-26 13:44:20,233 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [914610861] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-26 13:44:20,233 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-26 13:44:20,233 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-26 13:44:20,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032920666] [2022-07-26 13:44:20,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-26 13:44:20,234 INFO L738 eck$LassoCheckResult]: stem already infeasible [2022-07-26 13:44:20,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 13:44:20,234 INFO L85 PathProgramCache]: Analyzing trace with hash 496, now seen corresponding path program 1 times [2022-07-26 13:44:20,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 13:44:20,234 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790041669] [2022-07-26 13:44:20,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 13:44:20,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 13:44:20,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 13:44:20,240 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 13:44:20,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 13:44:20,243 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 13:44:20,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-26 13:44:20,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-26 13:44:20,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-26 13:44:20,266 INFO L87 Difference]: Start difference. First operand 792 states and 2090 transitions. cyclomatic complexity: 1518 Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-26 13:44:20,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-26 13:44:20,423 INFO L93 Difference]: Finished difference Result 980 states and 2462 transitions. [2022-07-26 13:44:20,423 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 980 states and 2462 transitions. [2022-07-26 13:44:20,446 INFO L131 ngComponentsAnalysis]: Automaton has 242 accepting balls. 242 [2022-07-26 13:44:20,453 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 980 states to 968 states and 2436 transitions. [2022-07-26 13:44:20,453 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 968 [2022-07-26 13:44:20,454 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 968 [2022-07-26 13:44:20,455 INFO L73 IsDeterministic]: Start isDeterministic. Operand 968 states and 2436 transitions. [2022-07-26 13:44:20,456 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-26 13:44:20,456 INFO L220 hiAutomatonCegarLoop]: Abstraction has 968 states and 2436 transitions. [2022-07-26 13:44:20,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 968 states and 2436 transitions. [2022-07-26 13:44:20,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 968 to 756. [2022-07-26 13:44:20,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 756 states, 756 states have (on average 2.6031746031746033) internal successors, (1968), 755 states have internal predecessors, (1968), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-26 13:44:20,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 756 states to 756 states and 1968 transitions. [2022-07-26 13:44:20,485 INFO L242 hiAutomatonCegarLoop]: Abstraction has 756 states and 1968 transitions. [2022-07-26 13:44:20,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-26 13:44:20,486 INFO L426 stractBuchiCegarLoop]: Abstraction has 756 states and 1968 transitions. [2022-07-26 13:44:20,486 INFO L333 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2022-07-26 13:44:20,486 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 756 states and 1968 transitions. [2022-07-26 13:44:20,491 INFO L131 ngComponentsAnalysis]: Automaton has 200 accepting balls. 200 [2022-07-26 13:44:20,491 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-26 13:44:20,491 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-26 13:44:20,491 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-26 13:44:20,491 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-26 13:44:20,492 INFO L733 eck$LassoCheckResult]: Stem: 9763#[ULTIMATE.startENTRY]don't care [543] ULTIMATE.startENTRY-->L845-2: Formula: (let ((.cse0 (store |v_#valid_81| |v_ULTIMATE.start_main_~#t1~0#1.base_37| 1)) (.cse1 (select |v_#memory_int_46| 1))) (and (= (select |v_#valid_81| |v_ULTIMATE.start_main_~#t1~0#1.base_37|) 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_31| 0) (= |v_#memory_int_45| (store |v_#memory_int_46| |v_ULTIMATE.start_main_~#t1~0#1.base_37| (store (select |v_#memory_int_46| |v_ULTIMATE.start_main_~#t1~0#1.base_37|) |v_ULTIMATE.start_main_~#t1~0#1.offset_29| |v_ULTIMATE.start_main_#t~pre4#1_27|))) (= (store .cse0 |v_ULTIMATE.start_main_~#t2~0#1.base_37| 1) |v_#valid_80|) (= v_~x~0_82 0) (= 48 (select .cse1 0)) (= v_~b2~0_108 0) (< 0 |v_#StackHeapBarrier_22|) (= v_~X~0_282 0) (= |v_#pthreadsForks_34| |v_ULTIMATE.start_main_#t~pre4#1_27|) (< |v_#StackHeapBarrier_22| |v_ULTIMATE.start_main_~#t2~0#1.base_37|) (= 2 (select |v_#length_56| 1)) (< |v_#StackHeapBarrier_22| |v_ULTIMATE.start_main_~#t1~0#1.base_37|) (= (select |v_#valid_81| 1) 1) (= |v_#pthreadsForks_33| (+ |v_#pthreadsForks_34| 1)) (= |v_#length_55| (store (store |v_#length_56| |v_ULTIMATE.start_main_~#t1~0#1.base_37| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_37| 4)) (= v_~b1~0_57 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t2~0#1.base_37|) 0) (= |v_#NULL.offset_8| 0) (= v_~y~0_379 0) (= (select |v_#length_56| 2) 10) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_29| 0) (= |v_#NULL.base_8| 0) (= (select |v_#valid_81| 0) 0) (= (select |v_#valid_81| 2) 1) (= (select .cse1 1) 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_22|, #pthreadsForks=|v_#pthreadsForks_34|, #valid=|v_#valid_81|, #memory_int=|v_#memory_int_46|, #length=|v_#length_56|} OutVars{~b2~0=v_~b2~0_108, ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_25|, ULTIMATE.start_main_#t~mem8#1=|v_ULTIMATE.start_main_#t~mem8#1_18|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_31|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_20|, #NULL.offset=|v_#NULL.offset_8|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_37|, ~X~0=v_~X~0_282, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_27|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_29|, #NULL.base=|v_#NULL.base_8|, #StackHeapBarrier=|v_#StackHeapBarrier_22|, #pthreadsForks=|v_#pthreadsForks_33|, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_17|, #valid=|v_#valid_80|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_15|, #memory_int=|v_#memory_int_45|, ULTIMATE.start_main_#t~mem9#1=|v_ULTIMATE.start_main_#t~mem9#1_22|, #length=|v_#length_55|, ~y~0=v_~y~0_379, ~b1~0=v_~b1~0_57, ~x~0=v_~x~0_82, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_37|} AuxVars[] AssignedVars[~b2~0, ULTIMATE.start_main_#t~pre6#1, ULTIMATE.start_main_#t~mem8#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_#res#1, #NULL.offset, ULTIMATE.start_main_~#t1~0#1.base, ~X~0, ULTIMATE.start_main_#t~pre4#1, ULTIMATE.start_main_~#t1~0#1.offset, #NULL.base, #pthreadsForks, ULTIMATE.start_main_#t~nondet5#1, #valid, ULTIMATE.start_main_#t~nondet7#1, #memory_int, ULTIMATE.start_main_#t~mem9#1, #length, ~y~0, ~b1~0, ~x~0, ULTIMATE.start_main_~#t2~0#1.base] 9765#[L845-2]don't care [449] L845-2-->thr1ENTRY: Formula: (and (= v_thr1Thread1of1ForFork1_thidvar1_2 0) (= |v_ULTIMATE.start_main_#t~pre4#1_6| v_thr1Thread1of1ForFork1_thidvar0_2) (= |v_thr1Thread1of1ForFork1_#in~_.base_4| 0) (= |v_thr1Thread1of1ForFork1_#in~_.offset_4| 0)) InVars {ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_6|} OutVars{thr1Thread1of1ForFork1_#in~_.offset=|v_thr1Thread1of1ForFork1_#in~_.offset_4|, thr1Thread1of1ForFork1_~_.base=v_thr1Thread1of1ForFork1_~_.base_4, thr1Thread1of1ForFork1_~b21~0=v_thr1Thread1of1ForFork1_~b21~0_10, thr1Thread1of1ForFork1_#res.base=|v_thr1Thread1of1ForFork1_#res.base_4|, thr1Thread1of1ForFork1_~y1~0=v_thr1Thread1of1ForFork1_~y1~0_30, thr1Thread1of1ForFork1_#in~_.base=|v_thr1Thread1of1ForFork1_#in~_.base_4|, thr1Thread1of1ForFork1_~_.offset=v_thr1Thread1of1ForFork1_~_.offset_4, thr1Thread1of1ForFork1_#res.offset=|v_thr1Thread1of1ForFork1_#res.offset_4|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_6|, thr1Thread1of1ForFork1_thidvar1=v_thr1Thread1of1ForFork1_thidvar1_2, thr1Thread1of1ForFork1_thidvar0=v_thr1Thread1of1ForFork1_thidvar0_2, thr1Thread1of1ForFork1_~x1~0=v_thr1Thread1of1ForFork1_~x1~0_8} AuxVars[] AssignedVars[thr1Thread1of1ForFork1_#in~_.offset, thr1Thread1of1ForFork1_~_.base, thr1Thread1of1ForFork1_~b21~0, thr1Thread1of1ForFork1_#res.base, thr1Thread1of1ForFork1_~y1~0, thr1Thread1of1ForFork1_#in~_.base, thr1Thread1of1ForFork1_~_.offset, thr1Thread1of1ForFork1_#res.offset, thr1Thread1of1ForFork1_thidvar1, thr1Thread1of1ForFork1_thidvar0, thr1Thread1of1ForFork1_~x1~0] 9131#[L845-3, thr1ENTRY]don't care [481] thr1ENTRY-->L753-1: Formula: (and (= |v_thr1Thread1of1ForFork1_#in~_.offset_7| v_thr1Thread1of1ForFork1_~_.offset_7) (= v_thr1Thread1of1ForFork1_~_.base_7 |v_thr1Thread1of1ForFork1_#in~_.base_7|)) InVars {thr1Thread1of1ForFork1_#in~_.offset=|v_thr1Thread1of1ForFork1_#in~_.offset_7|, thr1Thread1of1ForFork1_#in~_.base=|v_thr1Thread1of1ForFork1_#in~_.base_7|} OutVars{thr1Thread1of1ForFork1_#in~_.offset=|v_thr1Thread1of1ForFork1_#in~_.offset_7|, thr1Thread1of1ForFork1_~_.base=v_thr1Thread1of1ForFork1_~_.base_7, thr1Thread1of1ForFork1_#in~_.base=|v_thr1Thread1of1ForFork1_#in~_.base_7|, thr1Thread1of1ForFork1_~_.offset=v_thr1Thread1of1ForFork1_~_.offset_7} AuxVars[] AssignedVars[thr1Thread1of1ForFork1_~_.base, thr1Thread1of1ForFork1_~_.offset] 9133#[L753-1, L845-3]don't care [458] L753-1-->L707: Formula: (= v_~b1~0_10 1) InVars {} OutVars{~b1~0=v_~b1~0_10} AuxVars[] AssignedVars[~b1~0] 9451#[L845-3, L707]don't care [411] L707-->L710: Formula: (= v_~x~0_3 1) InVars {} OutVars{~x~0=v_~x~0_3} AuxVars[] AssignedVars[~x~0] 9153#[L710, L845-3]don't care [466] L710-->L728: Formula: (and (= v_thr1Thread1of1ForFork1_~y1~0_43 v_~y~0_33) (= v_thr1Thread1of1ForFork1_~y1~0_43 0)) InVars {~y~0=v_~y~0_33} OutVars{thr1Thread1of1ForFork1_~y1~0=v_thr1Thread1of1ForFork1_~y1~0_43, ~y~0=v_~y~0_33} AuxVars[] AssignedVars[thr1Thread1of1ForFork1_~y1~0] 9155#[L845-3, L728]don't care [420] L728-->L730: Formula: (= v_~y~0_16 1) InVars {} OutVars{~y~0=v_~y~0_16} AuxVars[] AssignedVars[~y~0] 9431#[L845-3, L730]don't care [463] L730-->L735: Formula: (and (= v_~x~0_9 v_thr1Thread1of1ForFork1_~x1~0_11) (not (= 1 v_thr1Thread1of1ForFork1_~x1~0_11))) InVars {~x~0=v_~x~0_9} OutVars{~x~0=v_~x~0_9, thr1Thread1of1ForFork1_~x1~0=v_thr1Thread1of1ForFork1_~x1~0_11} AuxVars[] AssignedVars[thr1Thread1of1ForFork1_~x1~0] 9617#[L845-3, L735]don't care [430] L735-->L737: Formula: (= v_~b1~0_3 0) InVars {} OutVars{~b1~0=v_~b1~0_3} AuxVars[] AssignedVars[~b1~0] 9737#[L845-3, L737]don't care [431] L737-->L744: Formula: (= v_~b2~0_5 v_thr1Thread1of1ForFork1_~b21~0_1) InVars {~b2~0=v_~b2~0_5} OutVars{~b2~0=v_~b2~0_5, thr1Thread1of1ForFork1_~b21~0=v_thr1Thread1of1ForFork1_~b21~0_1} AuxVars[] AssignedVars[thr1Thread1of1ForFork1_~b21~0] 9581#[L845-3, L744]don't care [2022-07-26 13:44:20,492 INFO L735 eck$LassoCheckResult]: Loop: 9581#[L845-3, L744]don't care [472] L744-->L744: Formula: (and (<= 1 v_thr1Thread1of1ForFork1_~b21~0_14) (= v_thr1Thread1of1ForFork1_~b21~0_13 v_~b2~0_11)) InVars {~b2~0=v_~b2~0_11, thr1Thread1of1ForFork1_~b21~0=v_thr1Thread1of1ForFork1_~b21~0_14} OutVars{~b2~0=v_~b2~0_11, thr1Thread1of1ForFork1_~b21~0=v_thr1Thread1of1ForFork1_~b21~0_13} AuxVars[] AssignedVars[thr1Thread1of1ForFork1_~b21~0] 9581#[L845-3, L744]don't care [2022-07-26 13:44:20,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 13:44:20,493 INFO L85 PathProgramCache]: Analyzing trace with hash 1920082255, now seen corresponding path program 1 times [2022-07-26 13:44:20,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 13:44:20,493 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133188353] [2022-07-26 13:44:20,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 13:44:20,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 13:44:20,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-26 13:44:20,542 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-26 13:44:20,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-26 13:44:20,546 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133188353] [2022-07-26 13:44:20,546 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1133188353] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-26 13:44:20,547 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-26 13:44:20,547 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-26 13:44:20,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862125431] [2022-07-26 13:44:20,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-26 13:44:20,547 INFO L738 eck$LassoCheckResult]: stem already infeasible [2022-07-26 13:44:20,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 13:44:20,548 INFO L85 PathProgramCache]: Analyzing trace with hash 503, now seen corresponding path program 1 times [2022-07-26 13:44:20,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 13:44:20,548 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715703956] [2022-07-26 13:44:20,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 13:44:20,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 13:44:20,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 13:44:20,553 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 13:44:20,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 13:44:20,556 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 13:44:20,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-26 13:44:20,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-26 13:44:20,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-26 13:44:20,566 INFO L87 Difference]: Start difference. First operand 756 states and 1968 transitions. cyclomatic complexity: 1412 Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-26 13:44:20,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-26 13:44:20,641 INFO L93 Difference]: Finished difference Result 1078 states and 2710 transitions. [2022-07-26 13:44:20,641 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1078 states and 2710 transitions. [2022-07-26 13:44:20,649 INFO L131 ngComponentsAnalysis]: Automaton has 264 accepting balls. 264 [2022-07-26 13:44:20,656 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1078 states to 990 states and 2506 transitions. [2022-07-26 13:44:20,657 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 990 [2022-07-26 13:44:20,658 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 990 [2022-07-26 13:44:20,658 INFO L73 IsDeterministic]: Start isDeterministic. Operand 990 states and 2506 transitions. [2022-07-26 13:44:20,659 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-26 13:44:20,660 INFO L220 hiAutomatonCegarLoop]: Abstraction has 990 states and 2506 transitions. [2022-07-26 13:44:20,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 990 states and 2506 transitions. [2022-07-26 13:44:20,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 990 to 740. [2022-07-26 13:44:20,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 740 states, 740 states have (on average 2.604054054054054) internal successors, (1927), 739 states have internal predecessors, (1927), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-26 13:44:20,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 740 states to 740 states and 1927 transitions. [2022-07-26 13:44:20,679 INFO L242 hiAutomatonCegarLoop]: Abstraction has 740 states and 1927 transitions. [2022-07-26 13:44:20,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-26 13:44:20,680 INFO L426 stractBuchiCegarLoop]: Abstraction has 740 states and 1927 transitions. [2022-07-26 13:44:20,680 INFO L333 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2022-07-26 13:44:20,680 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 740 states and 1927 transitions. [2022-07-26 13:44:20,705 INFO L131 ngComponentsAnalysis]: Automaton has 198 accepting balls. 198 [2022-07-26 13:44:20,706 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-26 13:44:20,706 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-26 13:44:20,706 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-26 13:44:20,706 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-26 13:44:20,706 INFO L733 eck$LassoCheckResult]: Stem: 12239#[ULTIMATE.startENTRY]don't care [543] ULTIMATE.startENTRY-->L845-2: Formula: (let ((.cse0 (store |v_#valid_81| |v_ULTIMATE.start_main_~#t1~0#1.base_37| 1)) (.cse1 (select |v_#memory_int_46| 1))) (and (= (select |v_#valid_81| |v_ULTIMATE.start_main_~#t1~0#1.base_37|) 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_31| 0) (= |v_#memory_int_45| (store |v_#memory_int_46| |v_ULTIMATE.start_main_~#t1~0#1.base_37| (store (select |v_#memory_int_46| |v_ULTIMATE.start_main_~#t1~0#1.base_37|) |v_ULTIMATE.start_main_~#t1~0#1.offset_29| |v_ULTIMATE.start_main_#t~pre4#1_27|))) (= (store .cse0 |v_ULTIMATE.start_main_~#t2~0#1.base_37| 1) |v_#valid_80|) (= v_~x~0_82 0) (= 48 (select .cse1 0)) (= v_~b2~0_108 0) (< 0 |v_#StackHeapBarrier_22|) (= v_~X~0_282 0) (= |v_#pthreadsForks_34| |v_ULTIMATE.start_main_#t~pre4#1_27|) (< |v_#StackHeapBarrier_22| |v_ULTIMATE.start_main_~#t2~0#1.base_37|) (= 2 (select |v_#length_56| 1)) (< |v_#StackHeapBarrier_22| |v_ULTIMATE.start_main_~#t1~0#1.base_37|) (= (select |v_#valid_81| 1) 1) (= |v_#pthreadsForks_33| (+ |v_#pthreadsForks_34| 1)) (= |v_#length_55| (store (store |v_#length_56| |v_ULTIMATE.start_main_~#t1~0#1.base_37| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_37| 4)) (= v_~b1~0_57 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t2~0#1.base_37|) 0) (= |v_#NULL.offset_8| 0) (= v_~y~0_379 0) (= (select |v_#length_56| 2) 10) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_29| 0) (= |v_#NULL.base_8| 0) (= (select |v_#valid_81| 0) 0) (= (select |v_#valid_81| 2) 1) (= (select .cse1 1) 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_22|, #pthreadsForks=|v_#pthreadsForks_34|, #valid=|v_#valid_81|, #memory_int=|v_#memory_int_46|, #length=|v_#length_56|} OutVars{~b2~0=v_~b2~0_108, ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_25|, ULTIMATE.start_main_#t~mem8#1=|v_ULTIMATE.start_main_#t~mem8#1_18|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_31|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_20|, #NULL.offset=|v_#NULL.offset_8|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_37|, ~X~0=v_~X~0_282, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_27|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_29|, #NULL.base=|v_#NULL.base_8|, #StackHeapBarrier=|v_#StackHeapBarrier_22|, #pthreadsForks=|v_#pthreadsForks_33|, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_17|, #valid=|v_#valid_80|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_15|, #memory_int=|v_#memory_int_45|, ULTIMATE.start_main_#t~mem9#1=|v_ULTIMATE.start_main_#t~mem9#1_22|, #length=|v_#length_55|, ~y~0=v_~y~0_379, ~b1~0=v_~b1~0_57, ~x~0=v_~x~0_82, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_37|} AuxVars[] AssignedVars[~b2~0, ULTIMATE.start_main_#t~pre6#1, ULTIMATE.start_main_#t~mem8#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_#res#1, #NULL.offset, ULTIMATE.start_main_~#t1~0#1.base, ~X~0, ULTIMATE.start_main_#t~pre4#1, ULTIMATE.start_main_~#t1~0#1.offset, #NULL.base, #pthreadsForks, ULTIMATE.start_main_#t~nondet5#1, #valid, ULTIMATE.start_main_#t~nondet7#1, #memory_int, ULTIMATE.start_main_#t~mem9#1, #length, ~y~0, ~b1~0, ~x~0, ULTIMATE.start_main_~#t2~0#1.base] 12241#[L845-2]don't care [449] L845-2-->thr1ENTRY: Formula: (and (= v_thr1Thread1of1ForFork1_thidvar1_2 0) (= |v_ULTIMATE.start_main_#t~pre4#1_6| v_thr1Thread1of1ForFork1_thidvar0_2) (= |v_thr1Thread1of1ForFork1_#in~_.base_4| 0) (= |v_thr1Thread1of1ForFork1_#in~_.offset_4| 0)) InVars {ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_6|} OutVars{thr1Thread1of1ForFork1_#in~_.offset=|v_thr1Thread1of1ForFork1_#in~_.offset_4|, thr1Thread1of1ForFork1_~_.base=v_thr1Thread1of1ForFork1_~_.base_4, thr1Thread1of1ForFork1_~b21~0=v_thr1Thread1of1ForFork1_~b21~0_10, thr1Thread1of1ForFork1_#res.base=|v_thr1Thread1of1ForFork1_#res.base_4|, thr1Thread1of1ForFork1_~y1~0=v_thr1Thread1of1ForFork1_~y1~0_30, thr1Thread1of1ForFork1_#in~_.base=|v_thr1Thread1of1ForFork1_#in~_.base_4|, thr1Thread1of1ForFork1_~_.offset=v_thr1Thread1of1ForFork1_~_.offset_4, thr1Thread1of1ForFork1_#res.offset=|v_thr1Thread1of1ForFork1_#res.offset_4|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_6|, thr1Thread1of1ForFork1_thidvar1=v_thr1Thread1of1ForFork1_thidvar1_2, thr1Thread1of1ForFork1_thidvar0=v_thr1Thread1of1ForFork1_thidvar0_2, thr1Thread1of1ForFork1_~x1~0=v_thr1Thread1of1ForFork1_~x1~0_8} AuxVars[] AssignedVars[thr1Thread1of1ForFork1_#in~_.offset, thr1Thread1of1ForFork1_~_.base, thr1Thread1of1ForFork1_~b21~0, thr1Thread1of1ForFork1_#res.base, thr1Thread1of1ForFork1_~y1~0, thr1Thread1of1ForFork1_#in~_.base, thr1Thread1of1ForFork1_~_.offset, thr1Thread1of1ForFork1_#res.offset, thr1Thread1of1ForFork1_thidvar1, thr1Thread1of1ForFork1_thidvar0, thr1Thread1of1ForFork1_~x1~0] 11639#[L845-3, thr1ENTRY]don't care [533] L845-3-->L846-3: Formula: (and (<= (+ |v_ULTIMATE.start_main_~#t2~0#1.offset_25| 4) (select |v_#length_45| |v_ULTIMATE.start_main_~#t2~0#1.base_27|)) (= |v_#memory_int_33| (store |v_#memory_int_34| |v_ULTIMATE.start_main_~#t2~0#1.base_27| (store (select |v_#memory_int_34| |v_ULTIMATE.start_main_~#t2~0#1.base_27|) |v_ULTIMATE.start_main_~#t2~0#1.offset_25| |v_ULTIMATE.start_main_#t~pre6#1_21|))) (= (select |v_#valid_62| |v_ULTIMATE.start_main_~#t2~0#1.base_27|) 1) (= |v_ULTIMATE.start_main_#t~pre6#1_21| |v_#pthreadsForks_26|) (<= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_25|) (= |v_#pthreadsForks_25| (+ |v_#pthreadsForks_26| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_26|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_25|, #valid=|v_#valid_62|, #memory_int=|v_#memory_int_34|, #length=|v_#length_45|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_27|} OutVars{ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_21|, #pthreadsForks=|v_#pthreadsForks_25|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_25|, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_13|, #valid=|v_#valid_62|, #memory_int=|v_#memory_int_33|, #length=|v_#length_45|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_23|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_27|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre6#1, #pthreadsForks, ULTIMATE.start_main_#t~nondet5#1, #memory_int, ULTIMATE.start_main_#t~pre4#1] 11603#[L846-3, thr1ENTRY]don't care [446] L846-3-->thr2ENTRY: Formula: (and (= v_thr2Thread1of1ForFork0_thidvar2_2 0) (= |v_ULTIMATE.start_main_#t~pre6#1_6| v_thr2Thread1of1ForFork0_thidvar0_2) (= |v_thr2Thread1of1ForFork0_#in~_.offset_4| 0) (= |v_thr2Thread1of1ForFork0_#in~_.base_4| 0) (= v_thr2Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_6|} OutVars{thr2Thread1of1ForFork0_~y2~0=v_thr2Thread1of1ForFork0_~y2~0_30, ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_6|, thr2Thread1of1ForFork0_#in~_.offset=|v_thr2Thread1of1ForFork0_#in~_.offset_4|, thr2Thread1of1ForFork0_#res.base=|v_thr2Thread1of1ForFork0_#res.base_4|, thr2Thread1of1ForFork0_~x2~0=v_thr2Thread1of1ForFork0_~x2~0_8, thr2Thread1of1ForFork0_#res.offset=|v_thr2Thread1of1ForFork0_#res.offset_4|, thr2Thread1of1ForFork0_~b12~0=v_thr2Thread1of1ForFork0_~b12~0_10, thr2Thread1of1ForFork0_#in~_.base=|v_thr2Thread1of1ForFork0_#in~_.base_4|, thr2Thread1of1ForFork0_~_.base=v_thr2Thread1of1ForFork0_~_.base_4, thr2Thread1of1ForFork0_~_.offset=v_thr2Thread1of1ForFork0_~_.offset_4, thr2Thread1of1ForFork0_thidvar0=v_thr2Thread1of1ForFork0_thidvar0_2, thr2Thread1of1ForFork0_thidvar1=v_thr2Thread1of1ForFork0_thidvar1_2, thr2Thread1of1ForFork0_thidvar2=v_thr2Thread1of1ForFork0_thidvar2_2} AuxVars[] AssignedVars[thr2Thread1of1ForFork0_~y2~0, thr2Thread1of1ForFork0_~_.offset, thr2Thread1of1ForFork0_#in~_.offset, thr2Thread1of1ForFork0_#res.base, thr2Thread1of1ForFork0_thidvar0, thr2Thread1of1ForFork0_thidvar1, thr2Thread1of1ForFork0_thidvar2, thr2Thread1of1ForFork0_~x2~0, thr2Thread1of1ForFork0_#res.offset, thr2Thread1of1ForFork0_~b12~0, thr2Thread1of1ForFork0_#in~_.base, thr2Thread1of1ForFork0_~_.base] 11607#[thr2ENTRY, L846-4, thr1ENTRY]don't care [468] thr2ENTRY-->L823-1: Formula: (and (= v_thr2Thread1of1ForFork0_~_.offset_5 |v_thr2Thread1of1ForFork0_#in~_.offset_5|) (= |v_thr2Thread1of1ForFork0_#in~_.base_5| v_thr2Thread1of1ForFork0_~_.base_5)) InVars {thr2Thread1of1ForFork0_#in~_.offset=|v_thr2Thread1of1ForFork0_#in~_.offset_5|, thr2Thread1of1ForFork0_#in~_.base=|v_thr2Thread1of1ForFork0_#in~_.base_5|} OutVars{thr2Thread1of1ForFork0_~_.offset=v_thr2Thread1of1ForFork0_~_.offset_5, thr2Thread1of1ForFork0_#in~_.offset=|v_thr2Thread1of1ForFork0_#in~_.offset_5|, thr2Thread1of1ForFork0_#in~_.base=|v_thr2Thread1of1ForFork0_#in~_.base_5|, thr2Thread1of1ForFork0_~_.base=v_thr2Thread1of1ForFork0_~_.base_5} AuxVars[] AssignedVars[thr2Thread1of1ForFork0_~_.offset, thr2Thread1of1ForFork0_~_.base] 12211#[L823-1, thr1ENTRY, L846-4]don't care [502] L823-1-->L777: Formula: (= v_~b2~0_23 1) InVars {} OutVars{~b2~0=v_~b2~0_23} AuxVars[] AssignedVars[~b2~0] 11187#[L777, L846-4, thr1ENTRY]don't care [369] L777-->L780: Formula: (= 2 v_~x~0_1) InVars {} OutVars{~x~0=v_~x~0_1} AuxVars[] AssignedVars[~x~0] 11189#[L780, thr1ENTRY, L846-4]don't care [372] L780-->L783: Formula: (= v_~y~0_2 v_thr2Thread1of1ForFork0_~y2~0_1) InVars {~y~0=v_~y~0_2} OutVars{~y~0=v_~y~0_2, thr2Thread1of1ForFork0_~y2~0=v_thr2Thread1of1ForFork0_~y2~0_1} AuxVars[] AssignedVars[thr2Thread1of1ForFork0_~y2~0] 11837#[L846-4, thr1ENTRY, L783]don't care [483] L783-->L787: Formula: (and (= v_~b2~0_16 0) (not (= v_thr2Thread1of1ForFork0_~y2~0_47 0))) InVars {thr2Thread1of1ForFork0_~y2~0=v_thr2Thread1of1ForFork0_~y2~0_47} OutVars{~b2~0=v_~b2~0_16, thr2Thread1of1ForFork0_~y2~0=v_thr2Thread1of1ForFork0_~y2~0_47} AuxVars[] AssignedVars[~b2~0] 11841#[L787, thr1ENTRY, L846-4]don't care [380] L787-->L794: Formula: (= v_~y~0_3 v_thr2Thread1of1ForFork0_~y2~0_7) InVars {~y~0=v_~y~0_3} OutVars{~y~0=v_~y~0_3, thr2Thread1of1ForFork0_~y2~0=v_thr2Thread1of1ForFork0_~y2~0_7} AuxVars[] AssignedVars[thr2Thread1of1ForFork0_~y2~0] 10987#[L794, L846-4, thr1ENTRY]don't care [2022-07-26 13:44:20,707 INFO L735 eck$LassoCheckResult]: Loop: 10987#[L794, L846-4, thr1ENTRY]don't care [476] L794-->L794: Formula: (and (not (= v_thr2Thread1of1ForFork0_~y2~0_34 0)) (= v_thr2Thread1of1ForFork0_~y2~0_33 v_~y~0_46)) InVars {thr2Thread1of1ForFork0_~y2~0=v_thr2Thread1of1ForFork0_~y2~0_34, ~y~0=v_~y~0_46} OutVars{thr2Thread1of1ForFork0_~y2~0=v_thr2Thread1of1ForFork0_~y2~0_33, ~y~0=v_~y~0_46} AuxVars[] AssignedVars[thr2Thread1of1ForFork0_~y2~0] 10987#[L794, L846-4, thr1ENTRY]don't care [2022-07-26 13:44:20,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 13:44:20,707 INFO L85 PathProgramCache]: Analyzing trace with hash 1955300042, now seen corresponding path program 1 times [2022-07-26 13:44:20,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 13:44:20,708 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819091347] [2022-07-26 13:44:20,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 13:44:20,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 13:44:20,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-26 13:44:20,759 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-26 13:44:20,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-26 13:44:20,760 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819091347] [2022-07-26 13:44:20,760 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [819091347] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-26 13:44:20,760 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-26 13:44:20,760 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-26 13:44:20,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873655834] [2022-07-26 13:44:20,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-26 13:44:20,761 INFO L738 eck$LassoCheckResult]: stem already infeasible [2022-07-26 13:44:20,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 13:44:20,761 INFO L85 PathProgramCache]: Analyzing trace with hash 507, now seen corresponding path program 1 times [2022-07-26 13:44:20,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 13:44:20,761 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185513543] [2022-07-26 13:44:20,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 13:44:20,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 13:44:20,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 13:44:20,765 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 13:44:20,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 13:44:20,768 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 13:44:20,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-26 13:44:20,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-26 13:44:20,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-26 13:44:20,777 INFO L87 Difference]: Start difference. First operand 740 states and 1927 transitions. cyclomatic complexity: 1385 Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-26 13:44:20,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-26 13:44:20,890 INFO L93 Difference]: Finished difference Result 856 states and 2120 transitions. [2022-07-26 13:44:20,890 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 856 states and 2120 transitions. [2022-07-26 13:44:20,896 INFO L131 ngComponentsAnalysis]: Automaton has 206 accepting balls. 206 [2022-07-26 13:44:20,902 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 856 states to 826 states and 2051 transitions. [2022-07-26 13:44:20,902 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 826 [2022-07-26 13:44:20,903 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 826 [2022-07-26 13:44:20,903 INFO L73 IsDeterministic]: Start isDeterministic. Operand 826 states and 2051 transitions. [2022-07-26 13:44:20,904 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-26 13:44:20,904 INFO L220 hiAutomatonCegarLoop]: Abstraction has 826 states and 2051 transitions. [2022-07-26 13:44:20,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 826 states and 2051 transitions. [2022-07-26 13:44:20,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 826 to 694. [2022-07-26 13:44:20,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 694 states, 694 states have (on average 2.5461095100864553) internal successors, (1767), 693 states have internal predecessors, (1767), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-26 13:44:20,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 694 states to 694 states and 1767 transitions. [2022-07-26 13:44:20,921 INFO L242 hiAutomatonCegarLoop]: Abstraction has 694 states and 1767 transitions. [2022-07-26 13:44:20,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-26 13:44:20,924 INFO L426 stractBuchiCegarLoop]: Abstraction has 694 states and 1767 transitions. [2022-07-26 13:44:20,924 INFO L333 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2022-07-26 13:44:20,925 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 694 states and 1767 transitions. [2022-07-26 13:44:20,929 INFO L131 ngComponentsAnalysis]: Automaton has 182 accepting balls. 182 [2022-07-26 13:44:20,929 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-26 13:44:20,929 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-26 13:44:20,930 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-26 13:44:20,930 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-26 13:44:20,931 INFO L733 eck$LassoCheckResult]: Stem: 14538#[ULTIMATE.startENTRY]don't care [543] ULTIMATE.startENTRY-->L845-2: Formula: (let ((.cse0 (store |v_#valid_81| |v_ULTIMATE.start_main_~#t1~0#1.base_37| 1)) (.cse1 (select |v_#memory_int_46| 1))) (and (= (select |v_#valid_81| |v_ULTIMATE.start_main_~#t1~0#1.base_37|) 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_31| 0) (= |v_#memory_int_45| (store |v_#memory_int_46| |v_ULTIMATE.start_main_~#t1~0#1.base_37| (store (select |v_#memory_int_46| |v_ULTIMATE.start_main_~#t1~0#1.base_37|) |v_ULTIMATE.start_main_~#t1~0#1.offset_29| |v_ULTIMATE.start_main_#t~pre4#1_27|))) (= (store .cse0 |v_ULTIMATE.start_main_~#t2~0#1.base_37| 1) |v_#valid_80|) (= v_~x~0_82 0) (= 48 (select .cse1 0)) (= v_~b2~0_108 0) (< 0 |v_#StackHeapBarrier_22|) (= v_~X~0_282 0) (= |v_#pthreadsForks_34| |v_ULTIMATE.start_main_#t~pre4#1_27|) (< |v_#StackHeapBarrier_22| |v_ULTIMATE.start_main_~#t2~0#1.base_37|) (= 2 (select |v_#length_56| 1)) (< |v_#StackHeapBarrier_22| |v_ULTIMATE.start_main_~#t1~0#1.base_37|) (= (select |v_#valid_81| 1) 1) (= |v_#pthreadsForks_33| (+ |v_#pthreadsForks_34| 1)) (= |v_#length_55| (store (store |v_#length_56| |v_ULTIMATE.start_main_~#t1~0#1.base_37| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_37| 4)) (= v_~b1~0_57 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t2~0#1.base_37|) 0) (= |v_#NULL.offset_8| 0) (= v_~y~0_379 0) (= (select |v_#length_56| 2) 10) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_29| 0) (= |v_#NULL.base_8| 0) (= (select |v_#valid_81| 0) 0) (= (select |v_#valid_81| 2) 1) (= (select .cse1 1) 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_22|, #pthreadsForks=|v_#pthreadsForks_34|, #valid=|v_#valid_81|, #memory_int=|v_#memory_int_46|, #length=|v_#length_56|} OutVars{~b2~0=v_~b2~0_108, ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_25|, ULTIMATE.start_main_#t~mem8#1=|v_ULTIMATE.start_main_#t~mem8#1_18|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_31|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_20|, #NULL.offset=|v_#NULL.offset_8|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_37|, ~X~0=v_~X~0_282, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_27|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_29|, #NULL.base=|v_#NULL.base_8|, #StackHeapBarrier=|v_#StackHeapBarrier_22|, #pthreadsForks=|v_#pthreadsForks_33|, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_17|, #valid=|v_#valid_80|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_15|, #memory_int=|v_#memory_int_45|, ULTIMATE.start_main_#t~mem9#1=|v_ULTIMATE.start_main_#t~mem9#1_22|, #length=|v_#length_55|, ~y~0=v_~y~0_379, ~b1~0=v_~b1~0_57, ~x~0=v_~x~0_82, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_37|} AuxVars[] AssignedVars[~b2~0, ULTIMATE.start_main_#t~pre6#1, ULTIMATE.start_main_#t~mem8#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_#res#1, #NULL.offset, ULTIMATE.start_main_~#t1~0#1.base, ~X~0, ULTIMATE.start_main_#t~pre4#1, ULTIMATE.start_main_~#t1~0#1.offset, #NULL.base, #pthreadsForks, ULTIMATE.start_main_#t~nondet5#1, #valid, ULTIMATE.start_main_#t~nondet7#1, #memory_int, ULTIMATE.start_main_#t~mem9#1, #length, ~y~0, ~b1~0, ~x~0, ULTIMATE.start_main_~#t2~0#1.base] 14540#[L845-2]don't care [449] L845-2-->thr1ENTRY: Formula: (and (= v_thr1Thread1of1ForFork1_thidvar1_2 0) (= |v_ULTIMATE.start_main_#t~pre4#1_6| v_thr1Thread1of1ForFork1_thidvar0_2) (= |v_thr1Thread1of1ForFork1_#in~_.base_4| 0) (= |v_thr1Thread1of1ForFork1_#in~_.offset_4| 0)) InVars {ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_6|} OutVars{thr1Thread1of1ForFork1_#in~_.offset=|v_thr1Thread1of1ForFork1_#in~_.offset_4|, thr1Thread1of1ForFork1_~_.base=v_thr1Thread1of1ForFork1_~_.base_4, thr1Thread1of1ForFork1_~b21~0=v_thr1Thread1of1ForFork1_~b21~0_10, thr1Thread1of1ForFork1_#res.base=|v_thr1Thread1of1ForFork1_#res.base_4|, thr1Thread1of1ForFork1_~y1~0=v_thr1Thread1of1ForFork1_~y1~0_30, thr1Thread1of1ForFork1_#in~_.base=|v_thr1Thread1of1ForFork1_#in~_.base_4|, thr1Thread1of1ForFork1_~_.offset=v_thr1Thread1of1ForFork1_~_.offset_4, thr1Thread1of1ForFork1_#res.offset=|v_thr1Thread1of1ForFork1_#res.offset_4|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_6|, thr1Thread1of1ForFork1_thidvar1=v_thr1Thread1of1ForFork1_thidvar1_2, thr1Thread1of1ForFork1_thidvar0=v_thr1Thread1of1ForFork1_thidvar0_2, thr1Thread1of1ForFork1_~x1~0=v_thr1Thread1of1ForFork1_~x1~0_8} AuxVars[] AssignedVars[thr1Thread1of1ForFork1_#in~_.offset, thr1Thread1of1ForFork1_~_.base, thr1Thread1of1ForFork1_~b21~0, thr1Thread1of1ForFork1_#res.base, thr1Thread1of1ForFork1_~y1~0, thr1Thread1of1ForFork1_#in~_.base, thr1Thread1of1ForFork1_~_.offset, thr1Thread1of1ForFork1_#res.offset, thr1Thread1of1ForFork1_thidvar1, thr1Thread1of1ForFork1_thidvar0, thr1Thread1of1ForFork1_~x1~0] 13948#[L845-3, thr1ENTRY]don't care [533] L845-3-->L846-3: Formula: (and (<= (+ |v_ULTIMATE.start_main_~#t2~0#1.offset_25| 4) (select |v_#length_45| |v_ULTIMATE.start_main_~#t2~0#1.base_27|)) (= |v_#memory_int_33| (store |v_#memory_int_34| |v_ULTIMATE.start_main_~#t2~0#1.base_27| (store (select |v_#memory_int_34| |v_ULTIMATE.start_main_~#t2~0#1.base_27|) |v_ULTIMATE.start_main_~#t2~0#1.offset_25| |v_ULTIMATE.start_main_#t~pre6#1_21|))) (= (select |v_#valid_62| |v_ULTIMATE.start_main_~#t2~0#1.base_27|) 1) (= |v_ULTIMATE.start_main_#t~pre6#1_21| |v_#pthreadsForks_26|) (<= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_25|) (= |v_#pthreadsForks_25| (+ |v_#pthreadsForks_26| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_26|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_25|, #valid=|v_#valid_62|, #memory_int=|v_#memory_int_34|, #length=|v_#length_45|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_27|} OutVars{ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_21|, #pthreadsForks=|v_#pthreadsForks_25|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_25|, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_13|, #valid=|v_#valid_62|, #memory_int=|v_#memory_int_33|, #length=|v_#length_45|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_23|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_27|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre6#1, #pthreadsForks, ULTIMATE.start_main_#t~nondet5#1, #memory_int, ULTIMATE.start_main_#t~pre4#1] 13914#[L846-3, thr1ENTRY]don't care [446] L846-3-->thr2ENTRY: Formula: (and (= v_thr2Thread1of1ForFork0_thidvar2_2 0) (= |v_ULTIMATE.start_main_#t~pre6#1_6| v_thr2Thread1of1ForFork0_thidvar0_2) (= |v_thr2Thread1of1ForFork0_#in~_.offset_4| 0) (= |v_thr2Thread1of1ForFork0_#in~_.base_4| 0) (= v_thr2Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_6|} OutVars{thr2Thread1of1ForFork0_~y2~0=v_thr2Thread1of1ForFork0_~y2~0_30, ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_6|, thr2Thread1of1ForFork0_#in~_.offset=|v_thr2Thread1of1ForFork0_#in~_.offset_4|, thr2Thread1of1ForFork0_#res.base=|v_thr2Thread1of1ForFork0_#res.base_4|, thr2Thread1of1ForFork0_~x2~0=v_thr2Thread1of1ForFork0_~x2~0_8, thr2Thread1of1ForFork0_#res.offset=|v_thr2Thread1of1ForFork0_#res.offset_4|, thr2Thread1of1ForFork0_~b12~0=v_thr2Thread1of1ForFork0_~b12~0_10, thr2Thread1of1ForFork0_#in~_.base=|v_thr2Thread1of1ForFork0_#in~_.base_4|, thr2Thread1of1ForFork0_~_.base=v_thr2Thread1of1ForFork0_~_.base_4, thr2Thread1of1ForFork0_~_.offset=v_thr2Thread1of1ForFork0_~_.offset_4, thr2Thread1of1ForFork0_thidvar0=v_thr2Thread1of1ForFork0_thidvar0_2, thr2Thread1of1ForFork0_thidvar1=v_thr2Thread1of1ForFork0_thidvar1_2, thr2Thread1of1ForFork0_thidvar2=v_thr2Thread1of1ForFork0_thidvar2_2} AuxVars[] AssignedVars[thr2Thread1of1ForFork0_~y2~0, thr2Thread1of1ForFork0_~_.offset, thr2Thread1of1ForFork0_#in~_.offset, thr2Thread1of1ForFork0_#res.base, thr2Thread1of1ForFork0_thidvar0, thr2Thread1of1ForFork0_thidvar1, thr2Thread1of1ForFork0_thidvar2, thr2Thread1of1ForFork0_~x2~0, thr2Thread1of1ForFork0_#res.offset, thr2Thread1of1ForFork0_~b12~0, thr2Thread1of1ForFork0_#in~_.base, thr2Thread1of1ForFork0_~_.base] 13918#[thr2ENTRY, L846-4, thr1ENTRY]don't care [468] thr2ENTRY-->L823-1: Formula: (and (= v_thr2Thread1of1ForFork0_~_.offset_5 |v_thr2Thread1of1ForFork0_#in~_.offset_5|) (= |v_thr2Thread1of1ForFork0_#in~_.base_5| v_thr2Thread1of1ForFork0_~_.base_5)) InVars {thr2Thread1of1ForFork0_#in~_.offset=|v_thr2Thread1of1ForFork0_#in~_.offset_5|, thr2Thread1of1ForFork0_#in~_.base=|v_thr2Thread1of1ForFork0_#in~_.base_5|} OutVars{thr2Thread1of1ForFork0_~_.offset=v_thr2Thread1of1ForFork0_~_.offset_5, thr2Thread1of1ForFork0_#in~_.offset=|v_thr2Thread1of1ForFork0_#in~_.offset_5|, thr2Thread1of1ForFork0_#in~_.base=|v_thr2Thread1of1ForFork0_#in~_.base_5|, thr2Thread1of1ForFork0_~_.base=v_thr2Thread1of1ForFork0_~_.base_5} AuxVars[] AssignedVars[thr2Thread1of1ForFork0_~_.offset, thr2Thread1of1ForFork0_~_.base] 14502#[L823-1, thr1ENTRY, L846-4]don't care [502] L823-1-->L777: Formula: (= v_~b2~0_23 1) InVars {} OutVars{~b2~0=v_~b2~0_23} AuxVars[] AssignedVars[~b2~0] 13514#[L777, L846-4, thr1ENTRY]don't care [369] L777-->L780: Formula: (= 2 v_~x~0_1) InVars {} OutVars{~x~0=v_~x~0_1} AuxVars[] AssignedVars[~x~0] 13516#[L780, thr1ENTRY, L846-4]don't care [494] L780-->L798: Formula: (and (= v_thr2Thread1of1ForFork0_~y2~0_57 0) (= v_thr2Thread1of1ForFork0_~y2~0_57 v_~y~0_64)) InVars {~y~0=v_~y~0_64} OutVars{thr2Thread1of1ForFork0_~y2~0=v_thr2Thread1of1ForFork0_~y2~0_57, ~y~0=v_~y~0_64} AuxVars[] AssignedVars[thr2Thread1of1ForFork0_~y2~0] 14478#[L798, L846-4, thr1ENTRY]don't care [378] L798-->L800: Formula: (= 2 v_~y~0_6) InVars {} OutVars{~y~0=v_~y~0_6} AuxVars[] AssignedVars[~y~0] 13798#[thr1ENTRY, L846-4, L800]don't care [381] L800-->L803: Formula: (= v_~x~0_2 v_thr2Thread1of1ForFork0_~x2~0_1) InVars {~x~0=v_~x~0_2} OutVars{thr2Thread1of1ForFork0_~x2~0=v_thr2Thread1of1ForFork0_~x2~0_1, ~x~0=v_~x~0_2} AuxVars[] AssignedVars[thr2Thread1of1ForFork0_~x2~0] 13804#[L803, L846-4, thr1ENTRY]don't care [484] L803-->L807: Formula: (and (not (= 2 v_thr2Thread1of1ForFork0_~x2~0_11)) (= v_~b2~0_18 0)) InVars {thr2Thread1of1ForFork0_~x2~0=v_thr2Thread1of1ForFork0_~x2~0_11} OutVars{~b2~0=v_~b2~0_18, thr2Thread1of1ForFork0_~x2~0=v_thr2Thread1of1ForFork0_~x2~0_11} AuxVars[] AssignedVars[~b2~0] 14492#[L807, thr1ENTRY, L846-4]don't care [389] L807-->L814: Formula: (= v_~b1~0_1 v_thr2Thread1of1ForFork0_~b12~0_1) InVars {~b1~0=v_~b1~0_1} OutVars{~b1~0=v_~b1~0_1, thr2Thread1of1ForFork0_~b12~0=v_thr2Thread1of1ForFork0_~b12~0_1} AuxVars[] AssignedVars[thr2Thread1of1ForFork0_~b12~0] 14376#[L846-4, thr1ENTRY, L814]don't care [2022-07-26 13:44:20,931 INFO L735 eck$LassoCheckResult]: Loop: 14376#[L846-4, thr1ENTRY, L814]don't care [461] L814-->L814: Formula: (and (<= 1 v_thr2Thread1of1ForFork0_~b12~0_12) (= v_thr2Thread1of1ForFork0_~b12~0_11 v_~b1~0_12)) InVars {thr2Thread1of1ForFork0_~b12~0=v_thr2Thread1of1ForFork0_~b12~0_12, ~b1~0=v_~b1~0_12} OutVars{thr2Thread1of1ForFork0_~b12~0=v_thr2Thread1of1ForFork0_~b12~0_11, ~b1~0=v_~b1~0_12} AuxVars[] AssignedVars[thr2Thread1of1ForFork0_~b12~0] 14376#[L846-4, thr1ENTRY, L814]don't care [2022-07-26 13:44:20,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 13:44:20,931 INFO L85 PathProgramCache]: Analyzing trace with hash -2042777425, now seen corresponding path program 1 times [2022-07-26 13:44:20,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 13:44:20,932 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345788361] [2022-07-26 13:44:20,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 13:44:20,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 13:44:20,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-26 13:44:20,984 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-26 13:44:20,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-26 13:44:20,984 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345788361] [2022-07-26 13:44:20,985 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [345788361] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-26 13:44:20,985 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-26 13:44:20,985 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-26 13:44:20,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704437316] [2022-07-26 13:44:20,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-26 13:44:20,985 INFO L738 eck$LassoCheckResult]: stem already infeasible [2022-07-26 13:44:20,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 13:44:20,986 INFO L85 PathProgramCache]: Analyzing trace with hash 492, now seen corresponding path program 1 times [2022-07-26 13:44:20,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 13:44:20,986 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779144755] [2022-07-26 13:44:20,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 13:44:20,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 13:44:20,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 13:44:20,997 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 13:44:20,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 13:44:21,003 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 13:44:21,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-26 13:44:21,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-26 13:44:21,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-26 13:44:21,021 INFO L87 Difference]: Start difference. First operand 694 states and 1767 transitions. cyclomatic complexity: 1255 Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-26 13:44:21,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-26 13:44:21,129 INFO L93 Difference]: Finished difference Result 758 states and 1755 transitions. [2022-07-26 13:44:21,129 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 758 states and 1755 transitions. [2022-07-26 13:44:21,134 INFO L131 ngComponentsAnalysis]: Automaton has 150 accepting balls. 150 [2022-07-26 13:44:21,138 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 758 states to 600 states and 1413 transitions. [2022-07-26 13:44:21,138 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 600 [2022-07-26 13:44:21,138 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 600 [2022-07-26 13:44:21,139 INFO L73 IsDeterministic]: Start isDeterministic. Operand 600 states and 1413 transitions. [2022-07-26 13:44:21,140 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-26 13:44:21,140 INFO L220 hiAutomatonCegarLoop]: Abstraction has 600 states and 1413 transitions. [2022-07-26 13:44:21,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states and 1413 transitions. [2022-07-26 13:44:21,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 554. [2022-07-26 13:44:21,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 554 states, 554 states have (on average 2.3790613718411553) internal successors, (1318), 553 states have internal predecessors, (1318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-26 13:44:21,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 554 states to 554 states and 1318 transitions. [2022-07-26 13:44:21,152 INFO L242 hiAutomatonCegarLoop]: Abstraction has 554 states and 1318 transitions. [2022-07-26 13:44:21,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-26 13:44:21,153 INFO L426 stractBuchiCegarLoop]: Abstraction has 554 states and 1318 transitions. [2022-07-26 13:44:21,153 INFO L333 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2022-07-26 13:44:21,153 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 554 states and 1318 transitions. [2022-07-26 13:44:21,156 INFO L131 ngComponentsAnalysis]: Automaton has 136 accepting balls. 136 [2022-07-26 13:44:21,156 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-26 13:44:21,156 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-26 13:44:21,157 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-26 13:44:21,157 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-26 13:44:21,157 INFO L733 eck$LassoCheckResult]: Stem: 16435#[ULTIMATE.startENTRY]don't care [543] ULTIMATE.startENTRY-->L845-2: Formula: (let ((.cse0 (store |v_#valid_81| |v_ULTIMATE.start_main_~#t1~0#1.base_37| 1)) (.cse1 (select |v_#memory_int_46| 1))) (and (= (select |v_#valid_81| |v_ULTIMATE.start_main_~#t1~0#1.base_37|) 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_31| 0) (= |v_#memory_int_45| (store |v_#memory_int_46| |v_ULTIMATE.start_main_~#t1~0#1.base_37| (store (select |v_#memory_int_46| |v_ULTIMATE.start_main_~#t1~0#1.base_37|) |v_ULTIMATE.start_main_~#t1~0#1.offset_29| |v_ULTIMATE.start_main_#t~pre4#1_27|))) (= (store .cse0 |v_ULTIMATE.start_main_~#t2~0#1.base_37| 1) |v_#valid_80|) (= v_~x~0_82 0) (= 48 (select .cse1 0)) (= v_~b2~0_108 0) (< 0 |v_#StackHeapBarrier_22|) (= v_~X~0_282 0) (= |v_#pthreadsForks_34| |v_ULTIMATE.start_main_#t~pre4#1_27|) (< |v_#StackHeapBarrier_22| |v_ULTIMATE.start_main_~#t2~0#1.base_37|) (= 2 (select |v_#length_56| 1)) (< |v_#StackHeapBarrier_22| |v_ULTIMATE.start_main_~#t1~0#1.base_37|) (= (select |v_#valid_81| 1) 1) (= |v_#pthreadsForks_33| (+ |v_#pthreadsForks_34| 1)) (= |v_#length_55| (store (store |v_#length_56| |v_ULTIMATE.start_main_~#t1~0#1.base_37| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_37| 4)) (= v_~b1~0_57 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t2~0#1.base_37|) 0) (= |v_#NULL.offset_8| 0) (= v_~y~0_379 0) (= (select |v_#length_56| 2) 10) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_29| 0) (= |v_#NULL.base_8| 0) (= (select |v_#valid_81| 0) 0) (= (select |v_#valid_81| 2) 1) (= (select .cse1 1) 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_22|, #pthreadsForks=|v_#pthreadsForks_34|, #valid=|v_#valid_81|, #memory_int=|v_#memory_int_46|, #length=|v_#length_56|} OutVars{~b2~0=v_~b2~0_108, ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_25|, ULTIMATE.start_main_#t~mem8#1=|v_ULTIMATE.start_main_#t~mem8#1_18|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_31|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_20|, #NULL.offset=|v_#NULL.offset_8|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_37|, ~X~0=v_~X~0_282, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_27|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_29|, #NULL.base=|v_#NULL.base_8|, #StackHeapBarrier=|v_#StackHeapBarrier_22|, #pthreadsForks=|v_#pthreadsForks_33|, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_17|, #valid=|v_#valid_80|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_15|, #memory_int=|v_#memory_int_45|, ULTIMATE.start_main_#t~mem9#1=|v_ULTIMATE.start_main_#t~mem9#1_22|, #length=|v_#length_55|, ~y~0=v_~y~0_379, ~b1~0=v_~b1~0_57, ~x~0=v_~x~0_82, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_37|} AuxVars[] AssignedVars[~b2~0, ULTIMATE.start_main_#t~pre6#1, ULTIMATE.start_main_#t~mem8#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_#res#1, #NULL.offset, ULTIMATE.start_main_~#t1~0#1.base, ~X~0, ULTIMATE.start_main_#t~pre4#1, ULTIMATE.start_main_~#t1~0#1.offset, #NULL.base, #pthreadsForks, ULTIMATE.start_main_#t~nondet5#1, #valid, ULTIMATE.start_main_#t~nondet7#1, #memory_int, ULTIMATE.start_main_#t~mem9#1, #length, ~y~0, ~b1~0, ~x~0, ULTIMATE.start_main_~#t2~0#1.base] 16437#[L845-2]don't care [449] L845-2-->thr1ENTRY: Formula: (and (= v_thr1Thread1of1ForFork1_thidvar1_2 0) (= |v_ULTIMATE.start_main_#t~pre4#1_6| v_thr1Thread1of1ForFork1_thidvar0_2) (= |v_thr1Thread1of1ForFork1_#in~_.base_4| 0) (= |v_thr1Thread1of1ForFork1_#in~_.offset_4| 0)) InVars {ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_6|} OutVars{thr1Thread1of1ForFork1_#in~_.offset=|v_thr1Thread1of1ForFork1_#in~_.offset_4|, thr1Thread1of1ForFork1_~_.base=v_thr1Thread1of1ForFork1_~_.base_4, thr1Thread1of1ForFork1_~b21~0=v_thr1Thread1of1ForFork1_~b21~0_10, thr1Thread1of1ForFork1_#res.base=|v_thr1Thread1of1ForFork1_#res.base_4|, thr1Thread1of1ForFork1_~y1~0=v_thr1Thread1of1ForFork1_~y1~0_30, thr1Thread1of1ForFork1_#in~_.base=|v_thr1Thread1of1ForFork1_#in~_.base_4|, thr1Thread1of1ForFork1_~_.offset=v_thr1Thread1of1ForFork1_~_.offset_4, thr1Thread1of1ForFork1_#res.offset=|v_thr1Thread1of1ForFork1_#res.offset_4|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_6|, thr1Thread1of1ForFork1_thidvar1=v_thr1Thread1of1ForFork1_thidvar1_2, thr1Thread1of1ForFork1_thidvar0=v_thr1Thread1of1ForFork1_thidvar0_2, thr1Thread1of1ForFork1_~x1~0=v_thr1Thread1of1ForFork1_~x1~0_8} AuxVars[] AssignedVars[thr1Thread1of1ForFork1_#in~_.offset, thr1Thread1of1ForFork1_~_.base, thr1Thread1of1ForFork1_~b21~0, thr1Thread1of1ForFork1_#res.base, thr1Thread1of1ForFork1_~y1~0, thr1Thread1of1ForFork1_#in~_.base, thr1Thread1of1ForFork1_~_.offset, thr1Thread1of1ForFork1_#res.offset, thr1Thread1of1ForFork1_thidvar1, thr1Thread1of1ForFork1_thidvar0, thr1Thread1of1ForFork1_~x1~0] 15967#[L845-3, thr1ENTRY]don't care [481] thr1ENTRY-->L753-1: Formula: (and (= |v_thr1Thread1of1ForFork1_#in~_.offset_7| v_thr1Thread1of1ForFork1_~_.offset_7) (= v_thr1Thread1of1ForFork1_~_.base_7 |v_thr1Thread1of1ForFork1_#in~_.base_7|)) InVars {thr1Thread1of1ForFork1_#in~_.offset=|v_thr1Thread1of1ForFork1_#in~_.offset_7|, thr1Thread1of1ForFork1_#in~_.base=|v_thr1Thread1of1ForFork1_#in~_.base_7|} OutVars{thr1Thread1of1ForFork1_#in~_.offset=|v_thr1Thread1of1ForFork1_#in~_.offset_7|, thr1Thread1of1ForFork1_~_.base=v_thr1Thread1of1ForFork1_~_.base_7, thr1Thread1of1ForFork1_#in~_.base=|v_thr1Thread1of1ForFork1_#in~_.base_7|, thr1Thread1of1ForFork1_~_.offset=v_thr1Thread1of1ForFork1_~_.offset_7} AuxVars[] AssignedVars[thr1Thread1of1ForFork1_~_.base, thr1Thread1of1ForFork1_~_.offset] 15969#[L753-1, L845-3]don't care [533] L845-3-->L846-3: Formula: (and (<= (+ |v_ULTIMATE.start_main_~#t2~0#1.offset_25| 4) (select |v_#length_45| |v_ULTIMATE.start_main_~#t2~0#1.base_27|)) (= |v_#memory_int_33| (store |v_#memory_int_34| |v_ULTIMATE.start_main_~#t2~0#1.base_27| (store (select |v_#memory_int_34| |v_ULTIMATE.start_main_~#t2~0#1.base_27|) |v_ULTIMATE.start_main_~#t2~0#1.offset_25| |v_ULTIMATE.start_main_#t~pre6#1_21|))) (= (select |v_#valid_62| |v_ULTIMATE.start_main_~#t2~0#1.base_27|) 1) (= |v_ULTIMATE.start_main_#t~pre6#1_21| |v_#pthreadsForks_26|) (<= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_25|) (= |v_#pthreadsForks_25| (+ |v_#pthreadsForks_26| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_26|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_25|, #valid=|v_#valid_62|, #memory_int=|v_#memory_int_34|, #length=|v_#length_45|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_27|} OutVars{ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_21|, #pthreadsForks=|v_#pthreadsForks_25|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_25|, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_13|, #valid=|v_#valid_62|, #memory_int=|v_#memory_int_33|, #length=|v_#length_45|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_23|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_27|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre6#1, #pthreadsForks, ULTIMATE.start_main_#t~nondet5#1, #memory_int, ULTIMATE.start_main_#t~pre4#1] 15937#[L846-3, L753-1]don't care [458] L753-1-->L707: Formula: (= v_~b1~0_10 1) InVars {} OutVars{~b1~0=v_~b1~0_10} AuxVars[] AssignedVars[~b1~0] 15903#[L846-3, L707]don't care [411] L707-->L710: Formula: (= v_~x~0_3 1) InVars {} OutVars{~x~0=v_~x~0_3} AuxVars[] AssignedVars[~x~0] 15905#[L846-3, L710]don't care [466] L710-->L728: Formula: (and (= v_thr1Thread1of1ForFork1_~y1~0_43 v_~y~0_33) (= v_thr1Thread1of1ForFork1_~y1~0_43 0)) InVars {~y~0=v_~y~0_33} OutVars{thr1Thread1of1ForFork1_~y1~0=v_thr1Thread1of1ForFork1_~y1~0_43, ~y~0=v_~y~0_33} AuxVars[] AssignedVars[thr1Thread1of1ForFork1_~y1~0] 16167#[L846-3, L728]don't care [420] L728-->L730: Formula: (= v_~y~0_16 1) InVars {} OutVars{~y~0=v_~y~0_16} AuxVars[] AssignedVars[~y~0] 16285#[L846-3, L730]don't care [446] L846-3-->thr2ENTRY: Formula: (and (= v_thr2Thread1of1ForFork0_thidvar2_2 0) (= |v_ULTIMATE.start_main_#t~pre6#1_6| v_thr2Thread1of1ForFork0_thidvar0_2) (= |v_thr2Thread1of1ForFork0_#in~_.offset_4| 0) (= |v_thr2Thread1of1ForFork0_#in~_.base_4| 0) (= v_thr2Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_6|} OutVars{thr2Thread1of1ForFork0_~y2~0=v_thr2Thread1of1ForFork0_~y2~0_30, ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_6|, thr2Thread1of1ForFork0_#in~_.offset=|v_thr2Thread1of1ForFork0_#in~_.offset_4|, thr2Thread1of1ForFork0_#res.base=|v_thr2Thread1of1ForFork0_#res.base_4|, thr2Thread1of1ForFork0_~x2~0=v_thr2Thread1of1ForFork0_~x2~0_8, thr2Thread1of1ForFork0_#res.offset=|v_thr2Thread1of1ForFork0_#res.offset_4|, thr2Thread1of1ForFork0_~b12~0=v_thr2Thread1of1ForFork0_~b12~0_10, thr2Thread1of1ForFork0_#in~_.base=|v_thr2Thread1of1ForFork0_#in~_.base_4|, thr2Thread1of1ForFork0_~_.base=v_thr2Thread1of1ForFork0_~_.base_4, thr2Thread1of1ForFork0_~_.offset=v_thr2Thread1of1ForFork0_~_.offset_4, thr2Thread1of1ForFork0_thidvar0=v_thr2Thread1of1ForFork0_thidvar0_2, thr2Thread1of1ForFork0_thidvar1=v_thr2Thread1of1ForFork0_thidvar1_2, thr2Thread1of1ForFork0_thidvar2=v_thr2Thread1of1ForFork0_thidvar2_2} AuxVars[] AssignedVars[thr2Thread1of1ForFork0_~y2~0, thr2Thread1of1ForFork0_~_.offset, thr2Thread1of1ForFork0_#in~_.offset, thr2Thread1of1ForFork0_#res.base, thr2Thread1of1ForFork0_thidvar0, thr2Thread1of1ForFork0_thidvar1, thr2Thread1of1ForFork0_thidvar2, thr2Thread1of1ForFork0_~x2~0, thr2Thread1of1ForFork0_#res.offset, thr2Thread1of1ForFork0_~b12~0, thr2Thread1of1ForFork0_#in~_.base, thr2Thread1of1ForFork0_~_.base] 16373#[thr2ENTRY, L846-4, L730]don't care [468] thr2ENTRY-->L823-1: Formula: (and (= v_thr2Thread1of1ForFork0_~_.offset_5 |v_thr2Thread1of1ForFork0_#in~_.offset_5|) (= |v_thr2Thread1of1ForFork0_#in~_.base_5| v_thr2Thread1of1ForFork0_~_.base_5)) InVars {thr2Thread1of1ForFork0_#in~_.offset=|v_thr2Thread1of1ForFork0_#in~_.offset_5|, thr2Thread1of1ForFork0_#in~_.base=|v_thr2Thread1of1ForFork0_#in~_.base_5|} OutVars{thr2Thread1of1ForFork0_~_.offset=v_thr2Thread1of1ForFork0_~_.offset_5, thr2Thread1of1ForFork0_#in~_.offset=|v_thr2Thread1of1ForFork0_#in~_.offset_5|, thr2Thread1of1ForFork0_#in~_.base=|v_thr2Thread1of1ForFork0_#in~_.base_5|, thr2Thread1of1ForFork0_~_.base=v_thr2Thread1of1ForFork0_~_.base_5} AuxVars[] AssignedVars[thr2Thread1of1ForFork0_~_.offset, thr2Thread1of1ForFork0_~_.base] 16425#[L823-1, L846-4, L730]don't care [502] L823-1-->L777: Formula: (= v_~b2~0_23 1) InVars {} OutVars{~b2~0=v_~b2~0_23} AuxVars[] AssignedVars[~b2~0] 16083#[L777, L846-4, L730]don't care [369] L777-->L780: Formula: (= 2 v_~x~0_1) InVars {} OutVars{~x~0=v_~x~0_1} AuxVars[] AssignedVars[~x~0] 16339#[L780, L846-4, L730]don't care [372] L780-->L783: Formula: (= v_~y~0_2 v_thr2Thread1of1ForFork0_~y2~0_1) InVars {~y~0=v_~y~0_2} OutVars{~y~0=v_~y~0_2, thr2Thread1of1ForFork0_~y2~0=v_thr2Thread1of1ForFork0_~y2~0_1} AuxVars[] AssignedVars[thr2Thread1of1ForFork0_~y2~0] 16463#[L846-4, L783, L730]don't care [483] L783-->L787: Formula: (and (= v_~b2~0_16 0) (not (= v_thr2Thread1of1ForFork0_~y2~0_47 0))) InVars {thr2Thread1of1ForFork0_~y2~0=v_thr2Thread1of1ForFork0_~y2~0_47} OutVars{~b2~0=v_~b2~0_16, thr2Thread1of1ForFork0_~y2~0=v_thr2Thread1of1ForFork0_~y2~0_47} AuxVars[] AssignedVars[~b2~0] 16465#[L787, L846-4, L730]don't care [380] L787-->L794: Formula: (= v_~y~0_3 v_thr2Thread1of1ForFork0_~y2~0_7) InVars {~y~0=v_~y~0_3} OutVars{~y~0=v_~y~0_3, thr2Thread1of1ForFork0_~y2~0=v_thr2Thread1of1ForFork0_~y2~0_7} AuxVars[] AssignedVars[thr2Thread1of1ForFork0_~y2~0] 16503#[L794, L846-4, L730]don't care [2022-07-26 13:44:21,158 INFO L735 eck$LassoCheckResult]: Loop: 16503#[L794, L846-4, L730]don't care [476] L794-->L794: Formula: (and (not (= v_thr2Thread1of1ForFork0_~y2~0_34 0)) (= v_thr2Thread1of1ForFork0_~y2~0_33 v_~y~0_46)) InVars {thr2Thread1of1ForFork0_~y2~0=v_thr2Thread1of1ForFork0_~y2~0_34, ~y~0=v_~y~0_46} OutVars{thr2Thread1of1ForFork0_~y2~0=v_thr2Thread1of1ForFork0_~y2~0_33, ~y~0=v_~y~0_46} AuxVars[] AssignedVars[thr2Thread1of1ForFork0_~y2~0] 16503#[L794, L846-4, L730]don't care [2022-07-26 13:44:21,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 13:44:21,158 INFO L85 PathProgramCache]: Analyzing trace with hash 303709890, now seen corresponding path program 1 times [2022-07-26 13:44:21,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 13:44:21,158 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863449105] [2022-07-26 13:44:21,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 13:44:21,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 13:44:21,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 13:44:21,181 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 13:44:21,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 13:44:21,199 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 13:44:21,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 13:44:21,200 INFO L85 PathProgramCache]: Analyzing trace with hash 507, now seen corresponding path program 2 times [2022-07-26 13:44:21,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 13:44:21,200 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298050564] [2022-07-26 13:44:21,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 13:44:21,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 13:44:21,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 13:44:21,203 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 13:44:21,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 13:44:21,205 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 13:44:21,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 13:44:21,206 INFO L85 PathProgramCache]: Analyzing trace with hash 825072474, now seen corresponding path program 1 times [2022-07-26 13:44:21,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 13:44:21,206 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859258350] [2022-07-26 13:44:21,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 13:44:21,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 13:44:21,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 13:44:21,220 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 13:44:21,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 13:44:21,244 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 13:44:22,211 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.07 01:44:22 BoogieIcfgContainer [2022-07-26 13:44:22,211 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-07-26 13:44:22,212 INFO L158 Benchmark]: Toolchain (without parser) took 6765.12ms. Allocated memory was 217.1MB in the beginning and 262.1MB in the end (delta: 45.1MB). Free memory was 190.1MB in the beginning and 98.9MB in the end (delta: 91.2MB). Peak memory consumption was 136.4MB. Max. memory is 8.0GB. [2022-07-26 13:44:22,213 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 217.1MB. Free memory is still 175.7MB. There was no memory consumed. Max. memory is 8.0GB. [2022-07-26 13:44:22,213 INFO L158 Benchmark]: CACSL2BoogieTranslator took 433.92ms. Allocated memory is still 217.1MB. Free memory was 189.8MB in the beginning and 176.9MB in the end (delta: 12.9MB). Peak memory consumption was 16.2MB. Max. memory is 8.0GB. [2022-07-26 13:44:22,214 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.06ms. Allocated memory is still 217.1MB. Free memory was 176.9MB in the beginning and 175.2MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-07-26 13:44:22,214 INFO L158 Benchmark]: Boogie Preprocessor took 52.86ms. Allocated memory is still 217.1MB. Free memory was 175.2MB in the beginning and 173.5MB in the end (delta: 1.7MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-07-26 13:44:22,214 INFO L158 Benchmark]: RCFGBuilder took 432.31ms. Allocated memory is still 217.1MB. Free memory was 173.5MB in the beginning and 159.1MB in the end (delta: 14.4MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2022-07-26 13:44:22,215 INFO L158 Benchmark]: BuchiAutomizer took 5780.76ms. Allocated memory was 217.1MB in the beginning and 262.1MB in the end (delta: 45.1MB). Free memory was 159.1MB in the beginning and 98.9MB in the end (delta: 60.2MB). Peak memory consumption was 107.7MB. Max. memory is 8.0GB. [2022-07-26 13:44:22,218 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.14ms. Allocated memory is still 217.1MB. Free memory is still 175.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 433.92ms. Allocated memory is still 217.1MB. Free memory was 189.8MB in the beginning and 176.9MB in the end (delta: 12.9MB). Peak memory consumption was 16.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 52.06ms. Allocated memory is still 217.1MB. Free memory was 176.9MB in the beginning and 175.2MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 52.86ms. Allocated memory is still 217.1MB. Free memory was 175.2MB in the beginning and 173.5MB in the end (delta: 1.7MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 432.31ms. Allocated memory is still 217.1MB. Free memory was 173.5MB in the beginning and 159.1MB in the end (delta: 14.4MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * BuchiAutomizer took 5780.76ms. Allocated memory was 217.1MB in the beginning and 262.1MB in the end (delta: 45.1MB). Free memory was 159.1MB in the beginning and 98.9MB in the end (delta: 60.2MB). Peak memory consumption was 107.7MB. 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 6 terminating modules (6 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.6 modules have a trivial ranking function, the largest among these consists of 5 locations. The remainder module has 554 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 5.6s and 7 iterations. TraceHistogramMax:1. Analysis of lassos took 1.7s. Construction of modules took 0.6s. Büchi inclusion checks took 0.7s. Highest rank in rank-based complementation 0. Minimization of det autom 6. Minimization of nondet autom 0. Automata minimization 0.2s AutomataMinimizationTime, 6 MinimizatonAttempts, 1328 StatesRemovedByMinimization, 6 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, 570 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 570 mSDsluCounter, 322 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 670 mSDsCounter, 134 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1231 IncrementalHoareTripleChecker+Invalid, 1365 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 134 mSolverCounterUnsat, 150 mSDtfsCounter, 1231 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI2 SFLT0 conc0 concLT0 SILN4 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: LassoTerminationAnalysisBenchmarks: not availableLassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 2.2s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 791]: 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}, b1=1, b12=0, b2=0, b21=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7c02e5c1 in0,0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@e7c5d07 in0,26970, org.eclipse.cdt.internal.core.dom.parser.c.CASTIdExpression@295fb695=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTIdExpression@891a865=0, t1={2783:0}, t2={2784:0}, X=0, x=2, x1=0, x2=0, y=1, y1=0, y2=1} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 791]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L700] 0 int x, y; [L701] 0 int b1, b2; [L702] 0 int X; [L844] 0 pthread_t t1, t2; [L845] FCALL, FORK 0 pthread_create(&t1, 0, thr1, 0) [L704] COND TRUE 1 1 [L706] 1 b1 = 1 [L709] 1 x = 1 [L712] 1 int y1 = y; [L714] COND FALSE 1 !(y1 != 0) [L729] 1 y = 1 [L846] FCALL, FORK 0 pthread_create(&t2, 0, thr2, 0) [L774] COND TRUE 2 1 [L776] 2 b2 = 1 [L779] 2 x = 2 [L782] 2 int y2 = y; [L784] COND TRUE 2 y2 != 0 [L786] 2 b2 = 0 [L789] 2 y2 = y Loop: [L791] COND TRUE y2 != 0 [L793] y2 = y End of lasso representation. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.1s, 112 PlacesBefore, 50 PlacesAfterwards, 129 TransitionsBefore, 60 TransitionsAfterwards, 4788 CoEnabledTransitionPairs, 5 FixpointIterations, 29 TrivialSequentialCompositions, 35 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 21 ConcurrentYvCompositions, 7 ChoiceCompositions, 92 TotalNumberOfCompositions, 12403 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 6474, positive: 6174, positive conditional: 0, positive unconditional: 6174, negative: 300, negative conditional: 0, negative unconditional: 300, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3149, positive: 3077, positive conditional: 0, positive unconditional: 3077, negative: 72, negative conditional: 0, negative unconditional: 72, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3149, positive: 2976, positive conditional: 0, positive unconditional: 2976, negative: 173, negative conditional: 0, negative unconditional: 173, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 173, positive: 101, positive conditional: 0, positive unconditional: 101, negative: 72, negative conditional: 0, negative unconditional: 72, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 138, positive: 67, positive conditional: 0, positive unconditional: 67, negative: 71, negative conditional: 0, negative unconditional: 71, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 6474, positive: 3097, positive conditional: 0, positive unconditional: 3097, negative: 228, negative conditional: 0, negative unconditional: 228, unknown: 3149, unknown conditional: 0, unknown unconditional: 3149] , Statistics on independence cache: Total cache size (in pairs): 662, Positive cache size: 603, Positive conditional cache size: 0, Positive unconditional cache size: 603, Negative cache size: 59, Negative conditional cache size: 0, Negative unconditional cache size: 59 RESULT: Ultimate proved your program to be incorrect! [2022-07-26 13:44:22,263 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...